diff --git a/dist/_30s.esm.js b/dist/_30s.esm.js
index fc9cdf907..78a732b05 100644
--- a/dist/_30s.esm.js
+++ b/dist/_30s.esm.js
@@ -197,8 +197,8 @@ const deepClone = obj => {
   return Array.isArray(obj) && obj.length
     ? (clone.length = obj.length) && Array.from(clone)
     : Array.isArray(obj)
-      ? Array.from(obj)
-      : clone;
+    ? Array.from(obj)
+    : clone;
 };
 const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));
 const deepFreeze = obj =>
@@ -210,13 +210,13 @@ const deepMapKeys = (obj, f) =>
   Array.isArray(obj)
     ? obj.map(val => deepMapKeys(val, f))
     : typeof obj === 'object'
-      ? Object.keys(obj).reduce((acc, current) => {
+    ? Object.keys(obj).reduce((acc, current) => {
         const val = obj[current];
         acc[f(current)] =
           val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);
         return acc;
       }, {})
-      : obj;
+    : obj;
 const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj);
 const defer = (fn, ...args) => setTimeout(fn, 1, ...args);
 const degreesToRads = deg => (deg * Math.PI) / 180.0;
@@ -238,9 +238,9 @@ const dig = (obj, target) =>
   target in obj
     ? obj[target]
     : Object.values(obj).reduce((acc, val) => {
-      if (acc !== undefined) return acc;
-      if (typeof val === 'object') return dig(val, target);
-    }, undefined);
+        if (acc !== undefined) return acc;
+        if (typeof val === 'object') return dig(val, target);
+      }, undefined);
 const digitize = n => [...`${n}`].map(i => parseInt(i));
 const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0);
 const drop = (arr, n = 1) => arr.slice(n);
@@ -313,11 +313,11 @@ const extendHex = shortHex =>
 const factorial = n =>
   n < 0
     ? (() => {
-      throw new TypeError('Negative numbers are not allowed!');
-    })()
+        throw new TypeError('Negative numbers are not allowed!');
+      })()
     : n <= 1
-      ? 1
-      : n * factorial(n - 1);
+    ? 1
+    : n * factorial(n - 1);
 const fibonacci = n =>
   Array.from({ length: n }).reduce(
     (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),
@@ -418,10 +418,10 @@ const getMeridiemSuffixOfInteger = num =>
   num === 0 || num === 24
     ? 12 + 'am'
     : num === 12
-      ? 12 + 'pm'
-      : num < 12
-        ? (num % 12) + 'am'
-        : (num % 12) + 'pm';
+    ? 12 + 'pm'
+    : num < 12
+    ? (num % 12) + 'am'
+    : (num % 12) + 'pm';
 const getScrollPosition = (el = window) => ({
   x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,
   y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop
@@ -641,8 +641,8 @@ const join = (arr, separator = ',', end = separator) =>
       i === arr.length - 2
         ? acc + val + end
         : i === arr.length - 1
-          ? acc + val
-          : acc + val + separator,
+        ? acc + val
+        : acc + val + separator,
     ''
   );
 const JSONtoCSV = (arr, columns, delimiter = ',') =>
@@ -985,9 +985,9 @@ const reject = (pred, array) => array.filter((...args) => !pred(...args));
 const remove = (arr, func) =>
   Array.isArray(arr)
     ? arr.filter(func).reduce((acc, val) => {
-      arr.splice(arr.indexOf(val), 1);
-      return acc.concat(val);
-    }, [])
+        arr.splice(arr.indexOf(val), 1);
+        return acc.concat(val);
+      }, [])
     : [];
 const removeNonASCII = str => str.replace(/[^\x20-\x7E]/g, '');
 const renameKeys = (keysMap, obj) =>
@@ -1065,10 +1065,10 @@ const size = val =>
   Array.isArray(val)
     ? val.length
     : val && typeof val === 'object'
-      ? val.size || val.length || Object.keys(val).length
-      : typeof val === 'string'
-        ? new Blob([val]).size
-        : 0;
+    ? val.size || val.length || Object.keys(val).length
+    : typeof val === 'string'
+    ? new Blob([val]).size
+    : 0;
 const sleep = ms => new Promise(resolve => setTimeout(resolve, ms));
 const smoothScroll = element =>
   document.querySelector(element).scrollIntoView({
diff --git a/dist/_30s.js b/dist/_30s.js
index dc07c69ad..cce01239b 100644
--- a/dist/_30s.js
+++ b/dist/_30s.js
@@ -203,8 +203,8 @@
     return Array.isArray(obj) && obj.length
       ? (clone.length = obj.length) && Array.from(clone)
       : Array.isArray(obj)
-        ? Array.from(obj)
-        : clone;
+      ? Array.from(obj)
+      : clone;
   };
   const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));
   const deepFreeze = obj =>
@@ -216,13 +216,13 @@
     Array.isArray(obj)
       ? obj.map(val => deepMapKeys(val, f))
       : typeof obj === 'object'
-        ? Object.keys(obj).reduce((acc, current) => {
+      ? Object.keys(obj).reduce((acc, current) => {
           const val = obj[current];
           acc[f(current)] =
             val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);
           return acc;
         }, {})
-        : obj;
+      : obj;
   const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj);
   const defer = (fn, ...args) => setTimeout(fn, 1, ...args);
   const degreesToRads = deg => (deg * Math.PI) / 180.0;
@@ -244,9 +244,9 @@
     target in obj
       ? obj[target]
       : Object.values(obj).reduce((acc, val) => {
-        if (acc !== undefined) return acc;
-        if (typeof val === 'object') return dig(val, target);
-      }, undefined);
+          if (acc !== undefined) return acc;
+          if (typeof val === 'object') return dig(val, target);
+        }, undefined);
   const digitize = n => [...`${n}`].map(i => parseInt(i));
   const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0);
   const drop = (arr, n = 1) => arr.slice(n);
@@ -319,11 +319,11 @@
   const factorial = n =>
     n < 0
       ? (() => {
-        throw new TypeError('Negative numbers are not allowed!');
-      })()
+          throw new TypeError('Negative numbers are not allowed!');
+        })()
       : n <= 1
-        ? 1
-        : n * factorial(n - 1);
+      ? 1
+      : n * factorial(n - 1);
   const fibonacci = n =>
     Array.from({ length: n }).reduce(
       (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),
@@ -424,10 +424,10 @@
     num === 0 || num === 24
       ? 12 + 'am'
       : num === 12
-        ? 12 + 'pm'
-        : num < 12
-          ? (num % 12) + 'am'
-          : (num % 12) + 'pm';
+      ? 12 + 'pm'
+      : num < 12
+      ? (num % 12) + 'am'
+      : (num % 12) + 'pm';
   const getScrollPosition = (el = window) => ({
     x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,
     y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop
@@ -647,8 +647,8 @@
         i === arr.length - 2
           ? acc + val + end
           : i === arr.length - 1
-            ? acc + val
-            : acc + val + separator,
+          ? acc + val
+          : acc + val + separator,
       ''
     );
   const JSONtoCSV = (arr, columns, delimiter = ',') =>
@@ -991,9 +991,9 @@
   const remove = (arr, func) =>
     Array.isArray(arr)
       ? arr.filter(func).reduce((acc, val) => {
-        arr.splice(arr.indexOf(val), 1);
-        return acc.concat(val);
-      }, [])
+          arr.splice(arr.indexOf(val), 1);
+          return acc.concat(val);
+        }, [])
       : [];
   const removeNonASCII = str => str.replace(/[^\x20-\x7E]/g, '');
   const renameKeys = (keysMap, obj) =>
@@ -1071,10 +1071,10 @@
     Array.isArray(val)
       ? val.length
       : val && typeof val === 'object'
-        ? val.size || val.length || Object.keys(val).length
-        : typeof val === 'string'
-          ? new Blob([val]).size
-          : 0;
+      ? val.size || val.length || Object.keys(val).length
+      : typeof val === 'string'
+      ? new Blob([val]).size
+      : 0;
   const sleep = ms => new Promise(resolve => setTimeout(resolve, ms));
   const smoothScroll = element =>
     document.querySelector(element).scrollIntoView({
diff --git a/snippet_data/archivedSnippetList.json b/snippet_data/archivedSnippetList.json
index edfc82222..7e3a92657 100644
--- a/snippet_data/archivedSnippetList.json
+++ b/snippet_data/archivedSnippetList.json
@@ -12,7 +12,7 @@
         ]
       },
       "meta": {
-        "hash": "90bc13657b6f59a1e0014e6672b9b95f925f4948e9324125a79e34d0a21b4468"
+        "hash": "48d538bccbc7be7e78b8f6a69004055c4b21324d2c8d7cbc4cba0cd42e4f67fb"
       }
     },
     {
@@ -27,7 +27,7 @@
         ]
       },
       "meta": {
-        "hash": "07ea927d2724e68224c7f80499159c3795650fe2e18e123e3df1a55e2313f624"
+        "hash": "d59410c4fa0ea5173af553068c1e1d4ef931695e084c50cdd8166b0cd0278722"
       }
     },
     {
@@ -42,7 +42,7 @@
         ]
       },
       "meta": {
-        "hash": "23455050bdb213ec6e15eb7ba8bd3fa7ecfc5bd82f73929c6c9754588f8a9e12"
+        "hash": "aaefc9bd6e9170001fe4754b1bc7bb9808ab97a5bec7fc6ceb1193be2f8009b1"
       }
     },
     {
@@ -57,7 +57,7 @@
         ]
       },
       "meta": {
-        "hash": "ab508ec0a9fb3d7a1269ace24e4909152b74ed95e6481323e1fdd66aa1ee19b9"
+        "hash": "0280a47e49f505d5f10e0e0bd2c3ab28a6ea2b931fc83f63155f8395f64a1840"
       }
     },
     {
@@ -72,7 +72,7 @@
         ]
       },
       "meta": {
-        "hash": "fdd106047031a9cd32d33ebe1d5bb5c992c5ce2675712da378080e46f9ca50a2"
+        "hash": "961b406dfe98746e3a267532b0703ee7c5c1b1c01a0e04c1f9e13e0fd0aeced1"
       }
     },
     {
@@ -87,7 +87,7 @@
         ]
       },
       "meta": {
-        "hash": "1e15cb532a03c2b283df16b6ee9079777679940f0032d9ce3e3193988c1f3d6c"
+        "hash": "8eed39b1040d6472e2fd619abf744848d30f12eebffda2711966c616d474524f"
       }
     },
     {
@@ -102,7 +102,7 @@
         ]
       },
       "meta": {
-        "hash": "5d91abbc4451394c1fe4290d63a0913e2cf41b1c02ffe8e9276b491c0f3803f1"
+        "hash": "a39ade2ae05ad86443446b335dbc019e3ac734fe0c1a542d50b929c554040fc0"
       }
     },
     {
@@ -117,7 +117,7 @@
         ]
       },
       "meta": {
-        "hash": "0b757d87765c3539b1b921ff9b915195a81e0f0653d95ca2382deea1f69a22d8"
+        "hash": "35488eb0f56b59035b56cc67fa0a5e1a970162ede4aafd97ebb2b4009c321c01"
       }
     },
     {
@@ -132,7 +132,7 @@
         ]
       },
       "meta": {
-        "hash": "d3d2d3e886ab1aa06315d00020c577884833a2fa2de851c2e736e398ebd21dc2"
+        "hash": "6ff845c13444a06569be548ce9e69900b7001516c44c315795f34b31e9baa833"
       }
     },
     {
@@ -147,7 +147,7 @@
         ]
       },
       "meta": {
-        "hash": "9cb879ebfd9ca4a4da57f81f26a512017ece8f57d3892738d249319bfce01cc7"
+        "hash": "d0be594ab377cbeb2910308610af5890b3468c06e7567cd0995a84d11aaccf47"
       }
     },
     {
@@ -162,7 +162,7 @@
         ]
       },
       "meta": {
-        "hash": "80bc7d5ac13bb3efe634dec4beacc3b9d3e72a973359b163bce3ccd7bda4f4b8"
+        "hash": "52ffa251dfc4e2bec7160a9066ef24a8c3047706e1ad2837f9d987cdf4d5f73e"
       }
     },
     {
@@ -177,7 +177,7 @@
         ]
       },
       "meta": {
-        "hash": "4f0e17ac776e2d66e0b036a5b4dc080d34917df6a408f792d20440f98daa0273"
+        "hash": "4fccb2abe966313a742d13965ee46cfd1094763a2697591eddb19c1c5af1db7e"
       }
     },
     {
@@ -192,7 +192,7 @@
         ]
       },
       "meta": {
-        "hash": "f6dccbcfcf5f64cdfef16c87efac6c58bfb3448b1e35c913475277d39e3aeffa"
+        "hash": "7eb4b1ffc1cbe28c10190bb82b7731ade2d79e78a5569bdee62af33a1020f2f5"
       }
     },
     {
@@ -207,7 +207,7 @@
         ]
       },
       "meta": {
-        "hash": "99ea08c72cebd7fc5f46731d47f3f2caaad25c2bf36403fe1d9c9e01699994f0"
+        "hash": "71ebcdb61794d8222fcf447509d206ffb10dc8068072a88c6b587e21e76fc7f2"
       }
     },
     {
@@ -222,7 +222,7 @@
         ]
       },
       "meta": {
-        "hash": "e2d9d4521c2abf0fe239ee83e33624f6d23c461f3fcd8f42f3c1bd067033d2b3"
+        "hash": "250615cfc281e99014b97d054c722d3ba6aa4190ccf66dd719e530ec80aec3bd"
       }
     },
     {
@@ -238,7 +238,7 @@
         ]
       },
       "meta": {
-        "hash": "33934cf9fb3f740afb520c98f0375de095c8abdc0113728cb71362ba2f1402a0"
+        "hash": "33e1e304fead4088971a60d4da974d0e9380370560f383ddb1ddc14e628df18b"
       }
     },
     {
@@ -253,7 +253,7 @@
         ]
       },
       "meta": {
-        "hash": "def6f0c50fd613013b41723b5c0aa86398b567bb196325fd6da4403f91bae8bb"
+        "hash": "f885a599e1185f8480445e1eb0c4a5cb8bf33948d7893f013dd4e8085478fe7a"
       }
     },
     {
@@ -268,7 +268,7 @@
         ]
       },
       "meta": {
-        "hash": "16986950549052514c4d82ec65c555118b3e9c7270ed9efe108d45fab9f26cb4"
+        "hash": "9f71509c5937cb68b65ef31893b1ad723ce6690e8ecd161707cb222ab67a475b"
       }
     },
     {
@@ -283,7 +283,7 @@
         ]
       },
       "meta": {
-        "hash": "1d6a2b08234f9b86ffb095bb645b5cc22624d17aa2d06badc177df3bd0a7055f"
+        "hash": "d1ec7968c8f8c48642a3f91878db84330231bdf84bf74633dc0754456e951338"
       }
     },
     {
@@ -298,7 +298,7 @@
         ]
       },
       "meta": {
-        "hash": "d264febc32505d36187d7cd7aa948766e520c36af21cedd16001af19cda0cd3a"
+        "hash": "dba6fa36424c23d601c4e463463a5f23d32b51d8b058a6c5020d3b4098a65e51"
       }
     },
     {
@@ -314,7 +314,7 @@
         ]
       },
       "meta": {
-        "hash": "b0e8729f35e7e7fb2406fe5c194cac83630cffe0d99dd671f08e832436a6e724"
+        "hash": "5c26069a02342eadd2c5ba2656a1b211da8f1a94da03c2cc31a5090be556d7b7"
       }
     },
     {
@@ -329,7 +329,7 @@
         ]
       },
       "meta": {
-        "hash": "45953ff742f8edfb77f0c1dfbcf28f85b81bd4703daecaa9ba59d180fd55aa23"
+        "hash": "5c6f8e292db8506568de362aa63890047f9d5a65d35143cfca1e27562642c414"
       }
     },
     {
@@ -344,7 +344,7 @@
         ]
       },
       "meta": {
-        "hash": "ff1f2f2a5cb5f00cf80322d9af5ce37d9c9b1492c468ea04c112b8a55be71232"
+        "hash": "0c37cf46586652fd20dfa9ca682d3635f01fe61c46864f9773f6b258e8f3b6f6"
       }
     },
     {
@@ -359,7 +359,7 @@
         ]
       },
       "meta": {
-        "hash": "fc2ca6d0b44a47a3b0eb638ec47d10964eff3dab91707186cc96dc53d178c135"
+        "hash": "9859dbef05dc0398e825150b50fccfea370583cf6b807c00c9e83b769d2b51c0"
       }
     },
     {
@@ -374,7 +374,7 @@
         ]
       },
       "meta": {
-        "hash": "f665ac48ee5f707eff3f0a13c9d9e844370765fa083e96126a6d64da8c29275a"
+        "hash": "19837ac6714833e9c5fe698811e171cc2598f7b9405a4847b33b8d3b35debf8a"
       }
     }
   ],
diff --git a/snippet_data/archivedSnippets.json b/snippet_data/archivedSnippets.json
index 72358390f..9fd5cface 100644
--- a/snippet_data/archivedSnippets.json
+++ b/snippet_data/archivedSnippets.json
@@ -8,9 +8,9 @@
         "fileName": "binarySearch.md",
         "text": "Use recursion. Similar to `Array.prototype.indexOf()` that finds the index of a value within an array.\nThe difference being this operation only works with sorted arrays which offers a major performance boost due to it's logarithmic nature when compared to a linear search or `Array.prototype.indexOf()`.\n\nSearch a sorted array by repeatedly dividing the search interval in half.\nBegin with an interval covering the whole array.\nIf the value of the search is less than the item in the middle of the interval, recurse into the lower half. Otherwise recurse into the upper half.\nRepeatedly recurse until the value is found which is the mid or you've recursed to a point that is greater than the length which means the value doesn't exist and return `-1`.\n\n",
         "codeBlocks": {
-          "es6": "const binarySearch = (arr, val, start = 0, end = arr.length - 1) => {\r\n  if (start > end) return -1;\r\n  const mid = Math.floor((start + end) / 2);\r\n  if (arr[mid] > val) return binarySearch(arr, val, start, mid - 1);\r\n  if (arr[mid] < val) return binarySearch(arr, val, mid + 1, end);\r\n  return mid;\r\n};",
+          "es6": "const binarySearch = (arr, val, start = 0, end = arr.length - 1) => {\n  if (start > end) return -1;\n  const mid = Math.floor((start + end) / 2);\n  if (arr[mid] > val) return binarySearch(arr, val, start, mid - 1);\n  if (arr[mid] < val) return binarySearch(arr, val, mid + 1, end);\n  return mid;\n};",
           "es5": "var binarySearch = function binarySearch(arr, val) {\n  var start = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n  var end = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : arr.length - 1;\n  if (start > end) return -1;\n  var mid = Math.floor((start + end) / 2);\n  if (arr[mid] > val) return binarySearch(arr, val, start, mid - 1);\n  if (arr[mid] < val) return binarySearch(arr, val, mid + 1, end);\n  return mid;\n};",
-          "example": "binarySearch([1, 4, 6, 7, 12, 13, 15, 18, 19, 20, 22, 24], 6); // 2\r\nbinarySearch([1, 4, 6, 7, 12, 13, 15, 18, 19, 20, 22, 24], 21); // -1"
+          "example": "binarySearch([1, 4, 6, 7, 12, 13, 15, 18, 19, 20, 22, 24], 6); // 2\nbinarySearch([1, 4, 6, 7, 12, 13, 15, 18, 19, 20, 22, 24], 21); // -1"
         },
         "tags": [
           "algorithm",
@@ -18,7 +18,7 @@
         ]
       },
       "meta": {
-        "hash": "90bc13657b6f59a1e0014e6672b9b95f925f4948e9324125a79e34d0a21b4468"
+        "hash": "48d538bccbc7be7e78b8f6a69004055c4b21324d2c8d7cbc4cba0cd42e4f67fb"
       }
     },
     {
@@ -39,7 +39,7 @@
         ]
       },
       "meta": {
-        "hash": "07ea927d2724e68224c7f80499159c3795650fe2e18e123e3df1a55e2313f624"
+        "hash": "d59410c4fa0ea5173af553068c1e1d4ef931695e084c50cdd8166b0cd0278722"
       }
     },
     {
@@ -50,9 +50,9 @@
         "fileName": "cleanObj.md",
         "text": "Removes any properties except the ones specified from a JSON object.\n\nUse `Object.keys()` method to loop over given JSON object and deleting keys that are not included in given array.\nIf you pass a special key,`childIndicator`, it will search deeply apply the function to inner objects, too.\n\n",
         "codeBlocks": {
-          "es6": "const cleanObj = (obj, keysToKeep = [], childIndicator) => {\r\n  Object.keys(obj).forEach(key => {\r\n    if (key === childIndicator) {\r\n      cleanObj(obj[key], keysToKeep, childIndicator);\r\n    } else if (!keysToKeep.includes(key)) {\r\n      delete obj[key];\r\n    }\r\n  });\r\n  return obj;\r\n};",
+          "es6": "const cleanObj = (obj, keysToKeep = [], childIndicator) => {\n  Object.keys(obj).forEach(key => {\n    if (key === childIndicator) {\n      cleanObj(obj[key], keysToKeep, childIndicator);\n    } else if (!keysToKeep.includes(key)) {\n      delete obj[key];\n    }\n  });\n  return obj;\n};",
           "es5": "var cleanObj = function cleanObj(obj) {\n  var keysToKeep = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n  var childIndicator = arguments.length > 2 ? arguments[2] : undefined;\n  Object.keys(obj).forEach(function (key) {\n    if (key === childIndicator) {\n      cleanObj(obj[key], keysToKeep, childIndicator);\n    } else if (!keysToKeep.includes(key)) {\n      delete obj[key];\n    }\n  });\n  return obj;\n};",
-          "example": "const testObj = { a: 1, b: 2, children: { a: 1, b: 2 } };\r\ncleanObj(testObj, ['a'], 'children'); // { a: 1, children : { a: 1}}"
+          "example": "const testObj = { a: 1, b: 2, children: { a: 1, b: 2 } };\ncleanObj(testObj, ['a'], 'children'); // { a: 1, children : { a: 1}}"
         },
         "tags": [
           "object",
@@ -60,7 +60,7 @@
         ]
       },
       "meta": {
-        "hash": "23455050bdb213ec6e15eb7ba8bd3fa7ecfc5bd82f73929c6c9754588f8a9e12"
+        "hash": "aaefc9bd6e9170001fe4754b1bc7bb9808ab97a5bec7fc6ceb1193be2f8009b1"
       }
     },
     {
@@ -81,7 +81,7 @@
         ]
       },
       "meta": {
-        "hash": "ab508ec0a9fb3d7a1269ace24e4909152b74ed95e6481323e1fdd66aa1ee19b9"
+        "hash": "0280a47e49f505d5f10e0e0bd2c3ab28a6ea2b931fc83f63155f8395f64a1840"
       }
     },
     {
@@ -94,7 +94,7 @@
         "codeBlocks": {
           "es6": "const countVowels = str => (str.match(/[aeiou]/gi) || []).length;",
           "es5": "var countVowels = function countVowels(str) {\n  return (str.match(/[aeiou]/gi) || []).length;\n};",
-          "example": "countVowels('foobar'); // 3\r\ncountVowels('gym'); // 0"
+          "example": "countVowels('foobar'); // 3\ncountVowels('gym'); // 0"
         },
         "tags": [
           "string",
@@ -102,7 +102,7 @@
         ]
       },
       "meta": {
-        "hash": "fdd106047031a9cd32d33ebe1d5bb5c992c5ce2675712da378080e46f9ca50a2"
+        "hash": "961b406dfe98746e3a267532b0703ee7c5c1b1c01a0e04c1f9e13e0fd0aeced1"
       }
     },
     {
@@ -113,9 +113,9 @@
         "fileName": "factors.md",
         "text": "Returns the array of factors of the given `num`.\nIf the second argument is set to `true` returns only the prime factors of `num`.\nIf `num` is `1` or `0` returns an empty array.\nIf `num` is less than `0` returns all the factors of `-int` together with their additive inverses.\n\nUse `Array.from()`, `Array.prototype.map()` and `Array.prototype.filter()` to find all the factors of `num`.\nIf given `num` is negative, use `Array.prototype.reduce()` to add the additive inverses to the array.\nReturn all results if `primes` is `false`, else determine and return only the prime factors using `isPrime` and `Array.prototype.filter()`.\nOmit the second argument, `primes`, to return prime and non-prime factors by default.\n\n**Note**:- _Negative numbers are not considered prime._\n\n",
         "codeBlocks": {
-          "es6": "const factors = (num, primes = false) => {\r\n  const isPrime = num => {\r\n    const boundary = Math.floor(Math.sqrt(num));\r\n    for (var i = 2; i <= boundary; i++) if (num % i === 0) return false;\r\n    return num >= 2;\r\n  };\r\n  const isNeg = num < 0;\r\n  num = isNeg ? -num : num;\r\n  let array = Array.from({ length: num - 1 })\r\n    .map((val, i) => (num % (i + 2) === 0 ? i + 2 : false))\r\n    .filter(val => val);\r\n  if (isNeg)\r\n    array = array.reduce((acc, val) => {\r\n      acc.push(val);\r\n      acc.push(-val);\r\n      return acc;\r\n    }, []);\r\n  return primes ? array.filter(isPrime) : array;\r\n};",
+          "es6": "const factors = (num, primes = false) => {\n  const isPrime = num => {\n    const boundary = Math.floor(Math.sqrt(num));\n    for (var i = 2; i <= boundary; i++) if (num % i === 0) return false;\n    return num >= 2;\n  };\n  const isNeg = num < 0;\n  num = isNeg ? -num : num;\n  let array = Array.from({ length: num - 1 })\n    .map((val, i) => (num % (i + 2) === 0 ? i + 2 : false))\n    .filter(val => val);\n  if (isNeg)\n    array = array.reduce((acc, val) => {\n      acc.push(val);\n      acc.push(-val);\n      return acc;\n    }, []);\n  return primes ? array.filter(isPrime) : array;\n};",
           "es5": "var factors = function factors(num) {\n  var primes = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n\n  var isPrime = function isPrime(num) {\n    var boundary = Math.floor(Math.sqrt(num));\n\n    for (var i = 2; i <= boundary; i++) {\n      if (num % i === 0) return false;\n    }\n\n    return num >= 2;\n  };\n\n  var isNeg = num < 0;\n  num = isNeg ? -num : num;\n  var array = Array.from({\n    length: num - 1\n  }).map(function (val, i) {\n    return num % (i + 2) === 0 ? i + 2 : false;\n  }).filter(function (val) {\n    return val;\n  });\n  if (isNeg) array = array.reduce(function (acc, val) {\n    acc.push(val);\n    acc.push(-val);\n    return acc;\n  }, []);\n  return primes ? array.filter(isPrime) : array;\n};",
-          "example": "factors(12); // [2,3,4,6,12]\r\nfactors(12, true); // [2,3]\r\nfactors(-12); // [2, -2, 3, -3, 4, -4, 6, -6, 12, -12]\r\nfactors(-12, true); // [2,3]"
+          "example": "factors(12); // [2,3,4,6,12]\nfactors(12, true); // [2,3]\nfactors(-12); // [2, -2, 3, -3, 4, -4, 6, -6, 12, -12]\nfactors(-12, true); // [2,3]"
         },
         "tags": [
           "math",
@@ -123,7 +123,7 @@
         ]
       },
       "meta": {
-        "hash": "1e15cb532a03c2b283df16b6ee9079777679940f0032d9ce3e3193988c1f3d6c"
+        "hash": "8eed39b1040d6472e2fd619abf744848d30f12eebffda2711966c616d474524f"
       }
     },
     {
@@ -144,7 +144,7 @@
         ]
       },
       "meta": {
-        "hash": "5d91abbc4451394c1fe4290d63a0913e2cf41b1c02ffe8e9276b491c0f3803f1"
+        "hash": "a39ade2ae05ad86443446b335dbc019e3ac734fe0c1a542d50b929c554040fc0"
       }
     },
     {
@@ -155,7 +155,7 @@
         "fileName": "fibonacciCountUntilNum.md",
         "text": "Returns the number of fibonnacci numbers up to `num`(`0` and `num` inclusive).\n\nUse a mathematical formula to calculate the number of fibonacci numbers until `num`.\n\n",
         "codeBlocks": {
-          "es6": "const fibonacciCountUntilNum = num =>\r\n  Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));",
+          "es6": "const fibonacciCountUntilNum = num =>\n  Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));",
           "es5": "var fibonacciCountUntilNum = function fibonacciCountUntilNum(num) {\n  return Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));\n};",
           "example": "fibonacciCountUntilNum(10); // 7"
         },
@@ -165,7 +165,7 @@
         ]
       },
       "meta": {
-        "hash": "0b757d87765c3539b1b921ff9b915195a81e0f0653d95ca2382deea1f69a22d8"
+        "hash": "35488eb0f56b59035b56cc67fa0a5e1a970162ede4aafd97ebb2b4009c321c01"
       }
     },
     {
@@ -176,7 +176,7 @@
         "fileName": "fibonacciUntilNum.md",
         "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\n\nCreate an empty array of the specific length, initializing the first two values (`0` and `1`).\nUse `Array.prototype.reduce()` to add values into the array, using the sum of the last two values, except for the first two.\nUses a mathematical formula to calculate the length of the array required.\n\n",
         "codeBlocks": {
-          "es6": "const fibonacciUntilNum = num => {\r\n  let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));\r\n  return Array.from({ length: n }).reduce(\r\n    (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),\r\n    []\r\n  );\r\n};",
+          "es6": "const fibonacciUntilNum = num => {\n  let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));\n  return Array.from({ length: n }).reduce(\n    (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),\n    []\n  );\n};",
           "es5": "var fibonacciUntilNum = function fibonacciUntilNum(num) {\n  var n = Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));\n  return Array.from({\n    length: n\n  }).reduce(function (acc, val, i) {\n    return acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i);\n  }, []);\n};",
           "example": "fibonacciUntilNum(10); // [ 0, 1, 1, 2, 3, 5, 8 ]"
         },
@@ -186,7 +186,7 @@
         ]
       },
       "meta": {
-        "hash": "d3d2d3e886ab1aa06315d00020c577884833a2fa2de851c2e736e398ebd21dc2"
+        "hash": "6ff845c13444a06569be548ce9e69900b7001516c44c315795f34b31e9baa833"
       }
     },
     {
@@ -197,7 +197,7 @@
         "fileName": "heronArea.md",
         "text": "Returns the area of a triangle using only the 3 side lengths, Heron's formula. Assumes that the sides define a valid triangle. Does NOT assume it is a right triangle.\n\nMore information on what Heron's formula is and why it works available here: https://en.wikipedia.org/wiki/Heron%27s_formula.\n\nUses `Math.sqrt()` to find the square root of a value.\n\n",
         "codeBlocks": {
-          "es6": "const heronArea = (side_a, side_b, side_c) => {\r\n    const p = (side_a + side_b + side_c) / 2\r\n    return Math.sqrt(p * (p-side_a) * (p-side_b) * (p-side_c))\r\n  };",
+          "es6": "const heronArea = (side_a, side_b, side_c) => {\n    const p = (side_a + side_b + side_c) / 2\n    return Math.sqrt(p * (p-side_a) * (p-side_b) * (p-side_c))\n  };",
           "es5": "var heronArea = function heronArea(side_a, side_b, side_c) {\n  var p = (side_a + side_b + side_c) / 2;\n  return Math.sqrt(p * (p - side_a) * (p - side_b) * (p - side_c));\n};",
           "example": "heronArea(3, 4, 5); // 6"
         },
@@ -207,7 +207,7 @@
         ]
       },
       "meta": {
-        "hash": "9cb879ebfd9ca4a4da57f81f26a512017ece8f57d3892738d249319bfce01cc7"
+        "hash": "d0be594ab377cbeb2910308610af5890b3468c06e7567cd0995a84d11aaccf47"
       }
     },
     {
@@ -218,9 +218,9 @@
         "fileName": "howManyTimes.md",
         "text": "Returns the number of times `num` can be divided by `divisor` (integer or fractional) without getting a fractional answer.\nWorks for both negative and positive integers.\n\nIf `divisor` is `-1` or `1` return `Infinity`.\nIf `divisor` is `-0` or `0` return `0`.\nOtherwise, keep dividing `num` with `divisor` and incrementing `i`, while the result is an integer.\nReturn the number of times the loop was executed, `i`.\n\n",
         "codeBlocks": {
-          "es6": "const howManyTimes = (num, divisor) => {\r\n  if (divisor === 1 || divisor === -1) return Infinity;\r\n  if (divisor === 0) return 0;\r\n  let i = 0;\r\n  while (Number.isInteger(num / divisor)) {\r\n    i++;\r\n    num = num / divisor;\r\n  }\r\n  return i;\r\n};",
+          "es6": "const howManyTimes = (num, divisor) => {\n  if (divisor === 1 || divisor === -1) return Infinity;\n  if (divisor === 0) return 0;\n  let i = 0;\n  while (Number.isInteger(num / divisor)) {\n    i++;\n    num = num / divisor;\n  }\n  return i;\n};",
           "es5": "var howManyTimes = function howManyTimes(num, divisor) {\n  if (divisor === 1 || divisor === -1) return Infinity;\n  if (divisor === 0) return 0;\n  var i = 0;\n\n  while (Number.isInteger(num / divisor)) {\n    i++;\n    num = num / divisor;\n  }\n\n  return i;\n};",
-          "example": "howManyTimes(100, 2); // 2\r\nhowManyTimes(100, 2.5); // 2\r\nhowManyTimes(100, 0); // 0\r\nhowManyTimes(100, -1); // Infinity"
+          "example": "howManyTimes(100, 2); // 2\nhowManyTimes(100, 2.5); // 2\nhowManyTimes(100, 0); // 0\nhowManyTimes(100, -1); // Infinity"
         },
         "tags": [
           "math",
@@ -228,7 +228,7 @@
         ]
       },
       "meta": {
-        "hash": "80bc7d5ac13bb3efe634dec4beacc3b9d3e72a973359b163bce3ccd7bda4f4b8"
+        "hash": "52ffa251dfc4e2bec7160a9066ef24a8c3047706e1ad2837f9d987cdf4d5f73e"
       }
     },
     {
@@ -239,9 +239,9 @@
         "fileName": "httpDelete.md",
         "text": "Makes a `DELETE` request to the passed URL.\n\nUse `XMLHttpRequest` web api to make a `delete` request to the given `url`.\nHandle the `onload` event, by running the provided `callback` function.\nHandle the `onerror` event, by running the provided `err` function.\nOmit the third argument, `err` to log the request to the console's error stream by default.\n\n",
         "codeBlocks": {
-          "es6": "const httpDelete = (url, callback, err = console.error) => {\r\n  const request = new XMLHttpRequest();\r\n  request.open('DELETE', url, true);\r\n  request.onload = () => callback(request);\r\n  request.onerror = () => err(request);\r\n  request.send();\r\n};",
+          "es6": "const httpDelete = (url, callback, err = console.error) => {\n  const request = new XMLHttpRequest();\n  request.open('DELETE', url, true);\n  request.onload = () => callback(request);\n  request.onerror = () => err(request);\n  request.send();\n};",
           "es5": "var httpDelete = function httpDelete(url, callback) {\n  var err = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : console.error;\n  var request = new XMLHttpRequest();\n  request.open('DELETE', url, true);\n\n  request.onload = function () {\n    return callback(request);\n  };\n\n  request.onerror = function () {\n    return err(request);\n  };\n\n  request.send();\n};",
-          "example": "httpDelete('https://website.com/users/123', request => {\r\n  console.log(request.responseText);\r\n}); // 'Deletes a user from the database'"
+          "example": "httpDelete('https://website.com/users/123', request => {\n  console.log(request.responseText);\n}); // 'Deletes a user from the database'"
         },
         "tags": [
           "browser",
@@ -249,7 +249,7 @@
         ]
       },
       "meta": {
-        "hash": "4f0e17ac776e2d66e0b036a5b4dc080d34917df6a408f792d20440f98daa0273"
+        "hash": "4fccb2abe966313a742d13965ee46cfd1094763a2697591eddb19c1c5af1db7e"
       }
     },
     {
@@ -260,9 +260,9 @@
         "fileName": "httpPut.md",
         "text": "Makes a `PUT` request to the passed URL.\n\nUse `XMLHttpRequest` web api to make a `put` request to the given `url`.\nSet the value of an `HTTP` request header with `setRequestHeader` method.\nHandle the `onload` event, by running the provided `callback` function.\nHandle the `onerror` event, by running the provided `err` function.\nOmit the last argument, `err` to log the request to the console's error stream by default.\n\n",
         "codeBlocks": {
-          "es6": "const httpPut = (url, data, callback, err = console.error) => {\r\n  const request = new XMLHttpRequest();\r\n  request.open(\"PUT\", url, true);\r\n  request.setRequestHeader('Content-type','application/json; charset=utf-8');\r\n  request.onload = () => callback(request);\r\n  request.onerror = () => err(request);\r\n  request.send(data);\r\n};",
+          "es6": "const httpPut = (url, data, callback, err = console.error) => {\n  const request = new XMLHttpRequest();\n  request.open(\"PUT\", url, true);\n  request.setRequestHeader('Content-type','application/json; charset=utf-8');\n  request.onload = () => callback(request);\n  request.onerror = () => err(request);\n  request.send(data);\n};",
           "es5": "var httpPut = function httpPut(url, data, callback) {\n  var err = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : console.error;\n  var request = new XMLHttpRequest();\n  request.open(\"PUT\", url, true);\n  request.setRequestHeader('Content-type', 'application/json; charset=utf-8');\n\n  request.onload = function () {\n    return callback(request);\n  };\n\n  request.onerror = function () {\n    return err(request);\n  };\n\n  request.send(data);\n};",
-          "example": "const password = \"fooBaz\";\r\nconst data = JSON.stringify(password);\r\nhttpPut('https://website.com/users/123', data, request => {\r\n  console.log(request.responseText);\r\n}); // 'Updates a user's password in database'"
+          "example": "const password = \"fooBaz\";\nconst data = JSON.stringify(password);\nhttpPut('https://website.com/users/123', data, request => {\n  console.log(request.responseText);\n}); // 'Updates a user's password in database'"
         },
         "tags": [
           "browser",
@@ -270,7 +270,7 @@
         ]
       },
       "meta": {
-        "hash": "f6dccbcfcf5f64cdfef16c87efac6c58bfb3448b1e35c913475277d39e3aeffa"
+        "hash": "7eb4b1ffc1cbe28c10190bb82b7731ade2d79e78a5569bdee62af33a1020f2f5"
       }
     },
     {
@@ -281,9 +281,9 @@
         "fileName": "isArmstrongNumber.md",
         "text": "Checks if the given number is an Armstrong number or not.\n\nConvert the given number into an array of digits. Use the exponent operator (`**`) to get the appropriate power for each digit and sum them up. If the sum is equal to the number itself, return `true` otherwise `false`.\n\n",
         "codeBlocks": {
-          "es6": "const isArmstrongNumber = digits =>\r\n  (arr => arr.reduce((a, d) => a + parseInt(d) ** arr.length, 0) == digits)(\r\n    (digits + '').split('')\r\n  );",
+          "es6": "const isArmstrongNumber = digits =>\n  (arr => arr.reduce((a, d) => a + parseInt(d) ** arr.length, 0) == digits)(\n    (digits + '').split('')\n  );",
           "es5": "var isArmstrongNumber = function isArmstrongNumber(digits) {\n  return function (arr) {\n    return arr.reduce(function (a, d) {\n      return a + Math.pow(parseInt(d), arr.length);\n    }, 0) == digits;\n  }((digits + '').split(''));\n};",
-          "example": "isArmstrongNumber(1634); // true\r\nisArmstrongNumber(56); // false"
+          "example": "isArmstrongNumber(1634); // true\nisArmstrongNumber(56); // false"
         },
         "tags": [
           "math",
@@ -291,7 +291,7 @@
         ]
       },
       "meta": {
-        "hash": "99ea08c72cebd7fc5f46731d47f3f2caaad25c2bf36403fe1d9c9e01699994f0"
+        "hash": "71ebcdb61794d8222fcf447509d206ffb10dc8068072a88c6b587e21e76fc7f2"
       }
     },
     {
@@ -302,9 +302,9 @@
         "fileName": "isSimilar.md",
         "text": "Determines if the `pattern` matches with `str`.\n\nUse `String.toLowerCase()` to convert both strings to lowercase, then loop through `str` and determine if it contains all characters of `pattern` and in the correct order.\nAdapted from [here](https://github.com/forrestthewoods/lib_fts/blob/80f3f8c52db53428247e741b9efe2cde9667050c/code/fts_fuzzy_match.js#L18).\n\n",
         "codeBlocks": {
-          "es6": "const isSimilar = (pattern, str) =>\r\n  [...str].reduce(\r\n      (matchIndex, char) =>\r\n          char.toLowerCase() === (pattern[matchIndex] || '').toLowerCase()\r\n              ? matchIndex + 1\r\n              : matchIndex,\r\n      0\r\n  ) === pattern.length;",
+          "es6": "const isSimilar = (pattern, str) =>\n  [...str].reduce(\n      (matchIndex, char) =>\n          char.toLowerCase() === (pattern[matchIndex] || '').toLowerCase()\n              ? matchIndex + 1\n              : matchIndex,\n      0\n  ) === pattern.length;",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar isSimilar = function isSimilar(pattern, str) {\n  return _toConsumableArray(str).reduce(function (matchIndex, _char) {\n    return _char.toLowerCase() === (pattern[matchIndex] || '').toLowerCase() ? matchIndex + 1 : matchIndex;\n  }, 0) === pattern.length;\n};",
-          "example": "isSimilar('rt','Rohit'); // true\r\nisSimilar('tr','Rohit'); // false"
+          "example": "isSimilar('rt','Rohit'); // true\nisSimilar('tr','Rohit'); // false"
         },
         "tags": [
           "string",
@@ -312,7 +312,7 @@
         ]
       },
       "meta": {
-        "hash": "e2d9d4521c2abf0fe239ee83e33624f6d23c461f3fcd8f42f3c1bd067033d2b3"
+        "hash": "250615cfc281e99014b97d054c722d3ba6aa4190ccf66dd719e530ec80aec3bd"
       }
     },
     {
@@ -323,7 +323,7 @@
         "fileName": "JSONToDate.md",
         "text": "Converts a JSON object to a date.\n\nUse `Date()`, to convert dates in JSON format to readable format (`dd/mm/yyyy`).\n\n",
         "codeBlocks": {
-          "es6": "const JSONToDate = arr => {\r\n  const dt = new Date(parseInt(arr.toString().substr(6)));\r\n  return `${dt.getDate()}/${dt.getMonth() + 1}/${dt.getFullYear()}`;\r\n};",
+          "es6": "const JSONToDate = arr => {\n  const dt = new Date(parseInt(arr.toString().substr(6)));\n  return `${dt.getDate()}/${dt.getMonth() + 1}/${dt.getFullYear()}`;\n};",
           "es5": "var JSONToDate = function JSONToDate(arr) {\n  var dt = new Date(parseInt(arr.toString().substr(6)));\n  return \"\".concat(dt.getDate(), \"/\").concat(dt.getMonth() + 1, \"/\").concat(dt.getFullYear());\n};",
           "example": "JSONToDate(/Date(1489525200000)/); // \"14/3/2017\""
         },
@@ -334,7 +334,7 @@
         ]
       },
       "meta": {
-        "hash": "33934cf9fb3f740afb520c98f0375de095c8abdc0113728cb71362ba2f1402a0"
+        "hash": "33e1e304fead4088971a60d4da974d0e9380370560f383ddb1ddc14e628df18b"
       }
     },
     {
@@ -347,7 +347,7 @@
         "codeBlocks": {
           "es6": "const kmphToMph = (kmph) => 0.621371192 * kmph;",
           "es5": "var kmphToMph = function kmphToMph(kmph) {\n  return 0.621371192 * kmph;\n};",
-          "example": "kmphToMph(10); // 16.09344000614692\r\nkmphToMph(345.4); // 138.24264965280207"
+          "example": "kmphToMph(10); // 16.09344000614692\nkmphToMph(345.4); // 138.24264965280207"
         },
         "tags": [
           "math",
@@ -355,7 +355,7 @@
         ]
       },
       "meta": {
-        "hash": "def6f0c50fd613013b41723b5c0aa86398b567bb196325fd6da4403f91bae8bb"
+        "hash": "f885a599e1185f8480445e1eb0c4a5cb8bf33948d7893f013dd4e8085478fe7a"
       }
     },
     {
@@ -366,9 +366,9 @@
         "fileName": "levenshteinDistance.md",
         "text": "Calculates the [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) between two strings.\n\nCalculates the number of changes (substitutions, deletions or additions) required to convert `string1` to `string2`. \nCan also be used to compare two strings as shown in the second example.\n\n",
         "codeBlocks": {
-          "es6": "const levenshteinDistance = (string1, string2) => {\r\n  if (string1.length === 0) return string2.length;\r\n  if (string2.length === 0) return string1.length;\r\n  let matrix = Array(string2.length + 1)\r\n    .fill(0)\r\n    .map((x, i) => [i]);\r\n  matrix[0] = Array(string1.length + 1)\r\n    .fill(0)\r\n    .map((x, i) => i);\r\n  for (let i = 1; i <= string2.length; i++) {\r\n    for (let j = 1; j <= string1.length; j++) {\r\n      if (string2[i - 1] === string1[j - 1]) {\r\n        matrix[i][j] = matrix[i - 1][j - 1];\r\n      } else {\r\n        matrix[i][j] = Math.min(\r\n          matrix[i - 1][j - 1] + 1,\r\n          matrix[i][j - 1] + 1,\r\n          matrix[i - 1][j] + 1\r\n        );\r\n      }\r\n    }\r\n  }\r\n  return matrix[string2.length][string1.length];\r\n};",
+          "es6": "const levenshteinDistance = (string1, string2) => {\n  if (string1.length === 0) return string2.length;\n  if (string2.length === 0) return string1.length;\n  let matrix = Array(string2.length + 1)\n    .fill(0)\n    .map((x, i) => [i]);\n  matrix[0] = Array(string1.length + 1)\n    .fill(0)\n    .map((x, i) => i);\n  for (let i = 1; i <= string2.length; i++) {\n    for (let j = 1; j <= string1.length; j++) {\n      if (string2[i - 1] === string1[j - 1]) {\n        matrix[i][j] = matrix[i - 1][j - 1];\n      } else {\n        matrix[i][j] = Math.min(\n          matrix[i - 1][j - 1] + 1,\n          matrix[i][j - 1] + 1,\n          matrix[i - 1][j] + 1\n        );\n      }\n    }\n  }\n  return matrix[string2.length][string1.length];\n};",
           "es5": "var levenshteinDistance = function levenshteinDistance(string1, string2) {\n  if (string1.length === 0) return string2.length;\n  if (string2.length === 0) return string1.length;\n  var matrix = Array(string2.length + 1).fill(0).map(function (x, i) {\n    return [i];\n  });\n  matrix[0] = Array(string1.length + 1).fill(0).map(function (x, i) {\n    return i;\n  });\n\n  for (var i = 1; i <= string2.length; i++) {\n    for (var j = 1; j <= string1.length; j++) {\n      if (string2[i - 1] === string1[j - 1]) {\n        matrix[i][j] = matrix[i - 1][j - 1];\n      } else {\n        matrix[i][j] = Math.min(matrix[i - 1][j - 1] + 1, matrix[i][j - 1] + 1, matrix[i - 1][j] + 1);\n      }\n    }\n  }\n\n  return matrix[string2.length][string1.length];\n};",
-          "example": "levenshteinDistance('30-seconds-of-code','30-seconds-of-python-code'); // 7\r\nconst compareStrings = (string1,string2) => (100 - levenshteinDistance(string1,string2) / Math.max(string1.length,string2.length));\r\ncompareStrings('30-seconds-of-code', '30-seconds-of-python-code'); // 99.72 (%)"
+          "example": "levenshteinDistance('30-seconds-of-code','30-seconds-of-python-code'); // 7\nconst compareStrings = (string1,string2) => (100 - levenshteinDistance(string1,string2) / Math.max(string1.length,string2.length));\ncompareStrings('30-seconds-of-code', '30-seconds-of-python-code'); // 99.72 (%)"
         },
         "tags": [
           "algorithm",
@@ -376,7 +376,7 @@
         ]
       },
       "meta": {
-        "hash": "16986950549052514c4d82ec65c555118b3e9c7270ed9efe108d45fab9f26cb4"
+        "hash": "9f71509c5937cb68b65ef31893b1ad723ce6690e8ecd161707cb222ab67a475b"
       }
     },
     {
@@ -389,7 +389,7 @@
         "codeBlocks": {
           "es6": "const mphToKmph = (mph) => 1.6093440006146922 * mph;",
           "es5": "var mphToKmph = function mphToKmph(mph) {\n  return 1.6093440006146922 * mph;\n};",
-          "example": "mphToKmph(10); // 16.09344000614692\r\nmphToKmph(85.9); // 138.24264965280207"
+          "example": "mphToKmph(10); // 16.09344000614692\nmphToKmph(85.9); // 138.24264965280207"
         },
         "tags": [
           "math",
@@ -397,7 +397,7 @@
         ]
       },
       "meta": {
-        "hash": "1d6a2b08234f9b86ffb095bb645b5cc22624d17aa2d06badc177df3bd0a7055f"
+        "hash": "d1ec7968c8f8c48642a3f91878db84330231bdf84bf74633dc0754456e951338"
       }
     },
     {
@@ -418,7 +418,7 @@
         ]
       },
       "meta": {
-        "hash": "d264febc32505d36187d7cd7aa948766e520c36af21cedd16001af19cda0cd3a"
+        "hash": "dba6fa36424c23d601c4e463463a5f23d32b51d8b058a6c5020d3b4098a65e51"
       }
     },
     {
@@ -429,9 +429,9 @@
         "fileName": "quickSort.md",
         "text": "QuickSort an Array (ascending sort by default).\n\nUse recursion.\nUse `Array.prototype.filter` and spread operator (`...`) to create an array that all elements with values less than the pivot come before the pivot, and all elements with values greater than the pivot come after it.\nIf the parameter `desc` is truthy, return array sorts in descending order.\n\n",
         "codeBlocks": {
-          "es6": "const quickSort = ([n, ...nums], desc) =>\r\n  isNaN(n)\r\n    ? []\r\n    : [\r\n        ...quickSort(nums.filter(v => (desc ? v > n : v <= n)), desc),\r\n        n,\r\n        ...quickSort(nums.filter(v => (!desc ? v > n : v <= n)), desc)\r\n      ];",
+          "es6": "const quickSort = ([n, ...nums], desc) =>\n  isNaN(n)\n    ? []\n    : [\n        ...quickSort(nums.filter(v => (desc ? v > n : v <= n)), desc),\n        n,\n        ...quickSort(nums.filter(v => (!desc ? v > n : v <= n)), desc)\n      ];",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nfunction _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar quickSort = function quickSort(_ref, desc) {\n  var _ref2 = _toArray(_ref),\n      n = _ref2[0],\n      nums = _ref2.slice(1);\n\n  return isNaN(n) ? [] : [].concat(_toConsumableArray(quickSort(nums.filter(function (v) {\n    return desc ? v > n : v <= n;\n  }), desc)), [n], _toConsumableArray(quickSort(nums.filter(function (v) {\n    return !desc ? v > n : v <= n;\n  }), desc)));\n};",
-          "example": "quickSort([4, 1, 3, 2]); // [1,2,3,4]\r\nquickSort([4, 1, 3, 2], true); // [4,3,2,1]"
+          "example": "quickSort([4, 1, 3, 2]); // [1,2,3,4]\nquickSort([4, 1, 3, 2], true); // [4,3,2,1]"
         },
         "tags": [
           "algorithm",
@@ -440,7 +440,7 @@
         ]
       },
       "meta": {
-        "hash": "b0e8729f35e7e7fb2406fe5c194cac83630cffe0d99dd671f08e832436a6e724"
+        "hash": "5c26069a02342eadd2c5ba2656a1b211da8f1a94da03c2cc31a5090be556d7b7"
       }
     },
     {
@@ -453,7 +453,7 @@
         "codeBlocks": {
           "es6": "const removeVowels = (str, repl = '') => str.replace(/[aeiou]/gi, repl);",
           "es5": "var removeVowels = function removeVowels(str) {\n  var repl = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n  return str.replace(/[aeiou]/gi, repl);\n};",
-          "example": "removeVowels(\"foobAr\"); // \"fbr\"\r\nremoveVowels(\"foobAr\",\"*\"); // \"f**b*r\""
+          "example": "removeVowels(\"foobAr\"); // \"fbr\"\nremoveVowels(\"foobAr\",\"*\"); // \"f**b*r\""
         },
         "tags": [
           "string",
@@ -461,7 +461,7 @@
         ]
       },
       "meta": {
-        "hash": "45953ff742f8edfb77f0c1dfbcf28f85b81bd4703daecaa9ba59d180fd55aa23"
+        "hash": "5c6f8e292db8506568de362aa63890047f9d5a65d35143cfca1e27562642c414"
       }
     },
     {
@@ -472,9 +472,9 @@
         "fileName": "solveRPN.md",
         "text": "Solves the given mathematical expression in [reverse polish notation](https://en.wikipedia.org/wiki/Reverse_Polish_notation).\nThrows appropriate errors if there are unrecognized symbols or the expression is wrong. The valid operators are :- `+`,`-`,`*`,`/`,`^`,`**` (`^`&`**` are the exponential symbols and are same). This snippet does not supports any unary operators.\n\nUse a dictionary, `OPERATORS` to specify each operator's matching mathematical operation.\nUse `String.prototype.replace()` with a regular expression to replace `^` with `**`, `String.prototype.split()` to tokenize the string and `Array.prototype.filter()` to remove empty tokens.\nUse `Array.prototype.forEach()` to parse each `symbol`, evaluate it as a numeric value or operator and solve the mathematical expression.\nNumeric values are converted to floating point numbers and pushed to a `stack`, while operators are evaluated using the `OPERATORS` dictionary and pop elements from the `stack` to apply operations.\n\n",
         "codeBlocks": {
-          "es6": "const solveRPN = rpn => {\r\n  const OPERATORS = {\r\n    '*': (a, b) => a * b,\r\n    '+': (a, b) => a + b,\r\n    '-': (a, b) => a - b,\r\n    '/': (a, b) => a / b,\r\n    '**': (a, b) => a ** b\r\n  };\r\n  const [stack, solve] = [\r\n    [],\r\n    rpn\r\n      .replace(/\\^/g, '**')\r\n      .split(/\\s+/g)\r\n      .filter(el => !/\\s+/.test(el) && el !== '')\r\n  ];\r\n  solve.forEach(symbol => {\r\n    if (!isNaN(parseFloat(symbol)) && isFinite(symbol)) {\r\n      stack.push(symbol);\r\n    } else if (Object.keys(OPERATORS).includes(symbol)) {\r\n      const [a, b] = [stack.pop(), stack.pop()];\r\n      stack.push(OPERATORS[symbol](parseFloat(b), parseFloat(a)));\r\n    } else {\r\n      throw `${symbol} is not a recognized symbol`;\r\n    }\r\n  });\r\n  if (stack.length === 1) return stack.pop();\r\n  else throw `${rpn} is not a proper RPN. Please check it and try again`;\r\n};",
+          "es6": "const solveRPN = rpn => {\n  const OPERATORS = {\n    '*': (a, b) => a * b,\n    '+': (a, b) => a + b,\n    '-': (a, b) => a - b,\n    '/': (a, b) => a / b,\n    '**': (a, b) => a ** b\n  };\n  const [stack, solve] = [\n    [],\n    rpn\n      .replace(/\\^/g, '**')\n      .split(/\\s+/g)\n      .filter(el => !/\\s+/.test(el) && el !== '')\n  ];\n  solve.forEach(symbol => {\n    if (!isNaN(parseFloat(symbol)) && isFinite(symbol)) {\n      stack.push(symbol);\n    } else if (Object.keys(OPERATORS).includes(symbol)) {\n      const [a, b] = [stack.pop(), stack.pop()];\n      stack.push(OPERATORS[symbol](parseFloat(b), parseFloat(a)));\n    } else {\n      throw `${symbol} is not a recognized symbol`;\n    }\n  });\n  if (stack.length === 1) return stack.pop();\n  else throw `${rpn} is not a proper RPN. Please check it and try again`;\n};",
           "es5": "var solveRPN = function solveRPN(rpn) {\n  var OPERATORS = {\n    '*': function _(a, b) {\n      return a * b;\n    },\n    '+': function _(a, b) {\n      return a + b;\n    },\n    '-': function _(a, b) {\n      return a - b;\n    },\n    '/': function _(a, b) {\n      return a / b;\n    },\n    '**': function _(a, b) {\n      return Math.pow(a, b);\n    }\n  };\n  var _ref = [[], rpn.replace(/\\^/g, '**').split(/\\s+/g).filter(function (el) {\n    return !/\\s+/.test(el) && el !== '';\n  })],\n      stack = _ref[0],\n      solve = _ref[1];\n  solve.forEach(function (symbol) {\n    if (!isNaN(parseFloat(symbol)) && isFinite(symbol)) {\n      stack.push(symbol);\n    } else if (Object.keys(OPERATORS).includes(symbol)) {\n      var _ref2 = [stack.pop(), stack.pop()],\n          a = _ref2[0],\n          b = _ref2[1];\n      stack.push(OPERATORS[symbol](parseFloat(b), parseFloat(a)));\n    } else {\n      throw \"\".concat(symbol, \" is not a recognized symbol\");\n    }\n  });\n  if (stack.length === 1) return stack.pop();else throw \"\".concat(rpn, \" is not a proper RPN. Please check it and try again\");\n};",
-          "example": "solveRPN('15 7 1 1 + - / 3 * 2 1 1 + + -'); // 5\r\nsolveRPN('2 3 ^'); // 8"
+          "example": "solveRPN('15 7 1 1 + - / 3 * 2 1 1 + + -'); // 5\nsolveRPN('2 3 ^'); // 8"
         },
         "tags": [
           "algorithm",
@@ -482,7 +482,7 @@
         ]
       },
       "meta": {
-        "hash": "ff1f2f2a5cb5f00cf80322d9af5ce37d9c9b1492c468ea04c112b8a55be71232"
+        "hash": "0c37cf46586652fd20dfa9ca682d3635f01fe61c46864f9773f6b258e8f3b6f6"
       }
     },
     {
@@ -493,7 +493,7 @@
         "fileName": "speechSynthesis.md",
         "text": "Performs speech synthesis (experimental).\n\nUse `SpeechSynthesisUtterance.voice` and `window.speechSynthesis.getVoices()` to convert a message to speech.\nUse `window.speechSynthesis.speak()` to play the message.\n\nLearn more about the [SpeechSynthesisUtterance interface of the Web Speech API](https://developer.mozilla.org/en-US/docs/Web/API/SpeechSynthesisUtterance).\n\n",
         "codeBlocks": {
-          "es6": "const speechSynthesis = message => {\r\n  const msg = new SpeechSynthesisUtterance(message);\r\n  msg.voice = window.speechSynthesis.getVoices()[0];\r\n  window.speechSynthesis.speak(msg);\r\n};",
+          "es6": "const speechSynthesis = message => {\n  const msg = new SpeechSynthesisUtterance(message);\n  msg.voice = window.speechSynthesis.getVoices()[0];\n  window.speechSynthesis.speak(msg);\n};",
           "es5": "var speechSynthesis = function speechSynthesis(message) {\n  var msg = new SpeechSynthesisUtterance(message);\n  msg.voice = window.speechSynthesis.getVoices()[0];\n  window.speechSynthesis.speak(msg);\n};",
           "example": "speechSynthesis('Hello, World'); // // plays the message"
         },
@@ -503,7 +503,7 @@
         ]
       },
       "meta": {
-        "hash": "fc2ca6d0b44a47a3b0eb638ec47d10964eff3dab91707186cc96dc53d178c135"
+        "hash": "9859dbef05dc0398e825150b50fccfea370583cf6b807c00c9e83b769d2b51c0"
       }
     },
     {
@@ -524,7 +524,7 @@
         ]
       },
       "meta": {
-        "hash": "f665ac48ee5f707eff3f0a13c9d9e844370765fa083e96126a6d64da8c29275a"
+        "hash": "19837ac6714833e9c5fe698811e171cc2598f7b9405a4847b33b8d3b35debf8a"
       }
     }
   ],
diff --git a/snippet_data/glossaryTerms.json b/snippet_data/glossaryTerms.json
index 4653db02c..215d861da 100644
--- a/snippet_data/glossaryTerms.json
+++ b/snippet_data/glossaryTerms.json
@@ -11,7 +11,7 @@
         ]
       },
       "meta": {
-        "hash": "9b1f6402c69f699f46f03c0ddcfb4beec171f27ca95cdded3afab446d03ad706"
+        "hash": "69b3cf5153fa3348e5863392fb2d0ee3c0c7caaf4f1006bbdb65fb8ea3b365af"
       }
     },
     {
@@ -25,7 +25,7 @@
         ]
       },
       "meta": {
-        "hash": "fff6c876f36872a1e20f0b75e8243a6db0468e0dc3ff1dd92fee2f5721f168e8"
+        "hash": "4a38caef0e8879fbe91f96c5d1f61c1628276502f4bb02da38ec79c75bd0e27a"
       }
     },
     {
@@ -39,7 +39,7 @@
         ]
       },
       "meta": {
-        "hash": "3df6a7b2e245dbdc839da5e244a9278ff12352ec7674b70915561534275cc88a"
+        "hash": "bb18f4bf7ba352a918752f5fae6c1838acba0c1a355d270e649b008e3e5be183"
       }
     },
     {
@@ -53,7 +53,7 @@
         ]
       },
       "meta": {
-        "hash": "fa20b67a6a5e27f8e368ea55a06add52159e0f68d4571278da2164d6d38b7762"
+        "hash": "5a8b7e5f9ac56f1008cc87c308371c282d3122746f8908ff80dbc1cdae613ef3"
       }
     },
     {
@@ -67,7 +67,7 @@
         ]
       },
       "meta": {
-        "hash": "0ac65b7d22cbeced1c3a9910b144cdec9fc8fa27ea27d8c13604475a865b986b"
+        "hash": "1a44acdc588be78c7c331704b9b4ab95b461eba5b55d70ebaae484b4cf625d6f"
       }
     },
     {
@@ -81,7 +81,7 @@
         ]
       },
       "meta": {
-        "hash": "ae6338f6a82155ed3d56875810a5bbd803b07a7e8e67333592185dfb73c4924b"
+        "hash": "510b08853e3816e62aba98e3f824bec05b124e6d1b5919bfc09319b7e9486570"
       }
     },
     {
@@ -95,7 +95,7 @@
         ]
       },
       "meta": {
-        "hash": "c4d8d7610c9c97b4933d998afb0ca45c8d0b7a7778a21495c01e3b8079d63a67"
+        "hash": "3f01c94cb306caf19a88b310c59fe7e488db661729afe6c100fba3c38be6e8a7"
       }
     },
     {
@@ -109,7 +109,7 @@
         ]
       },
       "meta": {
-        "hash": "827a5cd9608b33d3721fe1e61bbc6d729147901e99aea0918e04e1f19117e6d3"
+        "hash": "62b781aea272e769d6c92bd8daf99d99141af52462218727576ff207d341d65f"
       }
     },
     {
@@ -123,7 +123,7 @@
         ]
       },
       "meta": {
-        "hash": "373c77da130d9876ca5a9fb71889099022cdf88e907432ded542d6a397af318a"
+        "hash": "9c638e81443d53eb1c59a3145716414105aed86ae4046772c63ff81bd4f605a1"
       }
     },
     {
@@ -137,7 +137,7 @@
         ]
       },
       "meta": {
-        "hash": "22c1e8dae030c219a9e46192c4cc4084136f989a1a2aa819a03035d928362ad0"
+        "hash": "e0c3dd77f0e3d05ed361dc491ab5fc81cb7d1be88e31e787e4bc45bd32171d2c"
       }
     },
     {
@@ -151,7 +151,7 @@
         ]
       },
       "meta": {
-        "hash": "68a572858e08d8625b4ea0c655f167e399caefa84c5f082783f0285a9a3736d1"
+        "hash": "9c01b59507a6c71428df711d9089f92d8cb0b030356b061de8a4a6192bf39c93"
       }
     },
     {
@@ -165,7 +165,7 @@
         ]
       },
       "meta": {
-        "hash": "afe38f75dd585f7e3ad7ea384b263284b7db20bb293cc0e48cc798b1911c9565"
+        "hash": "f1d55fd4b7da687507a0560f8878828a52a3b442d4462a344cea3324392ff66b"
       }
     },
     {
@@ -179,7 +179,7 @@
         ]
       },
       "meta": {
-        "hash": "b05e439bab7b628f7c5af924b35141c8a5fa3c003a125a6584f4772a00040ed4"
+        "hash": "7c461f2980b6f1794518fd6b4b68166167fe912f8406144607c8da04d21908d7"
       }
     },
     {
@@ -193,7 +193,7 @@
         ]
       },
       "meta": {
-        "hash": "6eb566c2b02c357591c1ebfb633055b5a84a18c94b32305a0b4f12fbe3fa070b"
+        "hash": "878d6b1ad8b17eebb1ac24969c4a4c269a65822a21c609221c3d96c7b989b108"
       }
     },
     {
@@ -207,7 +207,7 @@
         ]
       },
       "meta": {
-        "hash": "6c6f09dd2307c988c1d3ddda5be95707777103e6e5786867ab0a4539454cd09a"
+        "hash": "2389500f32d8eead9e56735e78d7cc84a735b79f21ce87f902771e95290618f7"
       }
     },
     {
@@ -221,7 +221,7 @@
         ]
       },
       "meta": {
-        "hash": "6b31dddf283b18bfd1ca0a4381bf9c1a2604858a4df0db70ac433718a2818b41"
+        "hash": "5e494f687daab24e15c3853d0fccb90da6054f515f7cccd26801c6e0f38aaddc"
       }
     },
     {
@@ -235,7 +235,7 @@
         ]
       },
       "meta": {
-        "hash": "c2ecf2dd519743e76c507047954463998f85a12482e286eb908b1b2bce8572f5"
+        "hash": "75d004b6c01c85c4ca20a4ffac0d859ba438f19319513e9f664ce3ce53abe699"
       }
     },
     {
@@ -249,7 +249,7 @@
         ]
       },
       "meta": {
-        "hash": "1fe7dcff3a925aabcfcb6c2ce842ce95838a2695ff0e9b381c5b7ff07a6c0107"
+        "hash": "ad0bd1bd6faba643e1ed7e5b1937a75209dffe5b995a4c19d57367c4311f836a"
       }
     },
     {
@@ -263,7 +263,7 @@
         ]
       },
       "meta": {
-        "hash": "1b41d1d30012e6c12d81100b9d360af129c219a09307759eaf17e2721a386a66"
+        "hash": "fdbdbb8739e718f6be81222bda6e69e9f64f31ac786daa7d0a3118a145aee7f2"
       }
     },
     {
@@ -277,7 +277,7 @@
         ]
       },
       "meta": {
-        "hash": "2008cb370a2144ec0e7d62525d4c79dd99bf6746d2feb1b47ecc31811c72fd6c"
+        "hash": "feee663243f2a5a800908ae230338d6b3c23f8b35b1c041be4e71c65123244bd"
       }
     },
     {
@@ -291,7 +291,7 @@
         ]
       },
       "meta": {
-        "hash": "1a0db8645a4171320747cb8e6506711da00cdcf19f75760a5b340c23ddd05112"
+        "hash": "964b862cd385b8c17273b7dc3a4621050cceb412a4e7840c3e279c55b983734b"
       }
     },
     {
@@ -305,7 +305,7 @@
         ]
       },
       "meta": {
-        "hash": "5e1808b84a92cdd774c763a69e20ea65bf4c68e1781cad74fa019cc1097b3977"
+        "hash": "9d60a691f67322c528e67a5d25fa97210117e7189e2a295bb400a91c1c5f7976"
       }
     },
     {
@@ -319,7 +319,7 @@
         ]
       },
       "meta": {
-        "hash": "5111b26c807271210d5d566c973f988515b22d110468d5fefe2853e4c6030262"
+        "hash": "8d465038cf1b0d10b1e13e87f1c62ca2b641f83dfcf52d6e15fc65c23017dc9e"
       }
     },
     {
@@ -333,7 +333,7 @@
         ]
       },
       "meta": {
-        "hash": "76e09f629992e786374056340026dea7a5f127036ff4fd448650a1b8ec19cdd3"
+        "hash": "3fd8b63824d879f4b990a9fb67a60d733becda3ee74c2819f46515e563d19299"
       }
     },
     {
@@ -347,7 +347,7 @@
         ]
       },
       "meta": {
-        "hash": "637d992b13bda9cc95a3960ef85f35930e4b46bb3aa30357fbab74ee67944e23"
+        "hash": "ce222cb66f1299ffa59c08699cff464b5fb0daa8db3002007e8b8697f5ca5057"
       }
     },
     {
@@ -361,7 +361,7 @@
         ]
       },
       "meta": {
-        "hash": "9d784c9282d84e522e926a44cff06665ffeda0752d9ad1a4ad0978f4656b809a"
+        "hash": "0b478a7a88b2b463db686720064db6265b8b3161566815889ec6b00eb6e3ed20"
       }
     },
     {
@@ -375,7 +375,7 @@
         ]
       },
       "meta": {
-        "hash": "9a267c3bcb47f6bd54b826697aa1c3b18d80cc0851092c98fdfe8d8c657ab95a"
+        "hash": "9ce0565b0108631bea1187d52c5423320eb4833e1de33b223083be9b877eede8"
       }
     },
     {
@@ -389,7 +389,7 @@
         ]
       },
       "meta": {
-        "hash": "5e692fc6587ba97bdc8976809982d894daf464f35f080fb8b700125e25ecd91d"
+        "hash": "0e3ebc232de61abfd21f7017ed3be1bc877437f26ae4a5df2284c9d1c0e6acf9"
       }
     },
     {
@@ -403,7 +403,7 @@
         ]
       },
       "meta": {
-        "hash": "2fc2bc7a976fae32837fc7694650f34b632de9219fd162d2190155fd68cfa22d"
+        "hash": "9c65cdbdb985a10049eb1de1402c316d257c5b667f625f0fc04a87cd4fdd32ac"
       }
     },
     {
@@ -417,7 +417,7 @@
         ]
       },
       "meta": {
-        "hash": "42c8ba24aa3636cb7d950a6ccff61cf23ca1776d0a55e1211712788a8d7bf930"
+        "hash": "e3f7c2a5f8b2dab4bb5bc1cf04658e8b506825c9624fa260d82f797fc02e7c78"
       }
     },
     {
@@ -431,7 +431,7 @@
         ]
       },
       "meta": {
-        "hash": "ffc21d79a333ad55f538e1e6faf521e2b31a36a33ed86cac8a2bdb1749054d98"
+        "hash": "29cee59e219e12f9e91bb3e6b9e80b019fed963913cd070ac7e1f7cfab842ef1"
       }
     },
     {
@@ -445,7 +445,7 @@
         ]
       },
       "meta": {
-        "hash": "ce5d925a57f2112c699fefd8529d2dc438ad4f8b8045f62e0d970a9f38650710"
+        "hash": "a0c1c7de7ccb443a0430390da1004789762a4f9e6979cb9071f950897fa8e9d4"
       }
     },
     {
@@ -473,7 +473,7 @@
         ]
       },
       "meta": {
-        "hash": "082d9bbccade6611576f423ffea5b2d9ee89a9102faded2a44cc90e7f51d78e0"
+        "hash": "be1cc6d8fee2ab876af349d5d99bb1fc1a4cb7884fecbb9191d3d9e60d90a703"
       }
     },
     {
@@ -487,7 +487,7 @@
         ]
       },
       "meta": {
-        "hash": "23ab9254b5e120452adb8cb71030c6d737882bfde7307772c81efd7f653ccf66"
+        "hash": "12712370bee0ffd535998408f9977b94ac762fa6ff6b12e9b86359e14150c7af"
       }
     },
     {
@@ -501,7 +501,7 @@
         ]
       },
       "meta": {
-        "hash": "0e5793d0f803ffd63e9ab997c5818e42c3713c88fb720a586e619faa86110abc"
+        "hash": "d774609fa3ba6788d4bacd501f6e658a7afca91526e04dd5a619cf3d30badee4"
       }
     },
     {
@@ -515,7 +515,7 @@
         ]
       },
       "meta": {
-        "hash": "78bed830aa9e7733b948e8a242cce639d5bbfdea21254213dba31458bf9057da"
+        "hash": "389aaf215eaa534d4625d1aa6aba1e047ca4e7ef1241b4129867fa4e13438cbc"
       }
     },
     {
@@ -529,7 +529,7 @@
         ]
       },
       "meta": {
-        "hash": "a5ce95634eb0edeaf77d2443a1c18d7152338f85407c32ebb575aada4b28e47c"
+        "hash": "3c3a3376420cf16156ce79e62ea70363fd37710ea62490264bd851fed227cb6c"
       }
     },
     {
@@ -543,7 +543,7 @@
         ]
       },
       "meta": {
-        "hash": "b2f90fbfa2e7800d42044b637b675b40b6fa8494cb0b914f38afdfc5a5775f2c"
+        "hash": "25d2b0e1f222f102acdcfdedabfeec8f04b40ff808b61ce047de16f184484fa2"
       }
     },
     {
@@ -557,7 +557,7 @@
         ]
       },
       "meta": {
-        "hash": "f03c37ecbe1199bbad2a2f489c8f1115cd696acec93ccdbf367e90b50554289d"
+        "hash": "f7948fa3ad3524b004127eaf27cd023ce12a87b1d465e3f6e37af034d1239002"
       }
     },
     {
@@ -571,7 +571,7 @@
         ]
       },
       "meta": {
-        "hash": "b00cdcaa57db41f761d0e12249ff022fa9df2f5770b48962389c7456f608443a"
+        "hash": "7f45960c62541e01c3f7c28e75eb6e131272f81ff25d354031b2f0be1fb16ca4"
       }
     },
     {
@@ -585,7 +585,7 @@
         ]
       },
       "meta": {
-        "hash": "4c59c39acf39c93a6b5a162634fce945c93df7e9bfcd85ad912e09e91a210286"
+        "hash": "e5e1a1dffda6d69ca6247f3a5e78e629d95a4ad80ef2bd23605556068d86f419"
       }
     },
     {
@@ -599,7 +599,7 @@
         ]
       },
       "meta": {
-        "hash": "c7892883a0bc941a9287e5adec250d431aa3900373d20ad729908bb634e0397a"
+        "hash": "2c681c09ff405bc1c980151e4f1a3cfd54b415305bb6f3bcaf2b0cbcf9d05332"
       }
     },
     {
@@ -613,7 +613,7 @@
         ]
       },
       "meta": {
-        "hash": "dde9013ba2e6dc09dcd8a80f6350961b1d7173a856a3909ef10be8bf6b004cd3"
+        "hash": "ca87340c4addebe9e1a4249fce62c0ef3e9d37505b2a834b95368c2d7250d2a8"
       }
     },
     {
@@ -627,7 +627,7 @@
         ]
       },
       "meta": {
-        "hash": "221cced031d7fd8c679f320a95270a97f7dcc364cdc8eaf755ac825dba6efe1e"
+        "hash": "f0cc0f86211a8f1ae66ea9be353f3c9adc0e56dec19579709ff6da3ebf388ace"
       }
     },
     {
@@ -641,7 +641,7 @@
         ]
       },
       "meta": {
-        "hash": "5554d7d4eddb70199b7e090612c727240c4f7a054e245db83c796c1d82a3e091"
+        "hash": "e2812fdbe97a001ef10d72b95ffd9e4b4bdbe67e37ff7d1914eaea8583ae286c"
       }
     },
     {
@@ -655,7 +655,7 @@
         ]
       },
       "meta": {
-        "hash": "0c5fec36360ed400d98e47bf13c82815a6c21b1f9f3acab5e278bb6a6d7fed2d"
+        "hash": "3b9ca98ed6c2c184e2e7bd30615fe3752c20d7c016afbf6673b005ee76d7aec4"
       }
     },
     {
@@ -669,7 +669,7 @@
         ]
       },
       "meta": {
-        "hash": "bb08424ba323c6a38e4ed558957873507693cebee18522a8ce7c2c217e71a8c3"
+        "hash": "3e028e49f3eceb813e54013fb9bf05ef253efa4fa3034353c220cf28899952be"
       }
     },
     {
@@ -683,7 +683,7 @@
         ]
       },
       "meta": {
-        "hash": "8fd86cbb0d7ee3d9da284c99ea727fe9f4111a1747cc9667897378de3f172274"
+        "hash": "61ae68cf3a3b1bbf43ffce76bdaa244fa0f5bc5dbdadcd4a06d5260f8dd3247a"
       }
     },
     {
@@ -697,7 +697,7 @@
         ]
       },
       "meta": {
-        "hash": "da2b3dfd609ba61bce41033444a24208be967d3889091f715de8d6d0e0acb277"
+        "hash": "4e458b6078a1a91ed7da324aa1ac20cdbf290768aa395d3ab530d95238b7a05e"
       }
     },
     {
@@ -711,7 +711,7 @@
         ]
       },
       "meta": {
-        "hash": "87ed27e2a8dd280ef89cf245371298ae31d485a2c33823e723161443ddb96ac2"
+        "hash": "c7ca87020640f844151f9422b6c473afd99620b7483f90142040cc46ffb9a7a7"
       }
     },
     {
@@ -725,7 +725,7 @@
         ]
       },
       "meta": {
-        "hash": "3cd0002b13d233dd92910c19c3b4e9b61d1526b38bbfe56631a32c1e84439dcc"
+        "hash": "64da7def1e95f7220ef3bbf14568350c8cbf6abe187a6f539a64f9fb2067aa5d"
       }
     },
     {
@@ -739,7 +739,7 @@
         ]
       },
       "meta": {
-        "hash": "e26e25937c399cf118e05073f4b54df8531a5c60bb0103611e998b79024d96f2"
+        "hash": "9956f9ca2dab4c5d7370f3a6ed38abbf871b6f5c11ffef6449e3791aa5229420"
       }
     },
     {
@@ -753,7 +753,7 @@
         ]
       },
       "meta": {
-        "hash": "88c189d901748f9a9ac6bce6478f0d9d0098fef132ecb2aa3d9fec230a0a4d11"
+        "hash": "e03cbfde15c9f4b7c74ee034ed37f3d78809bd1ec64e2fdb62d2bf9da4c3c3ab"
       }
     },
     {
@@ -781,7 +781,7 @@
         ]
       },
       "meta": {
-        "hash": "71ea12e2e02b6de8b5db17ce07226147ce5e5da4d9e2312f114395f28172f6ab"
+        "hash": "49873aab20ab7019d8253e102d9623f086558d464241f821ed6d3de67aa0a15c"
       }
     },
     {
@@ -795,7 +795,7 @@
         ]
       },
       "meta": {
-        "hash": "5123f796bec733207c1f74390053dbf0219694033eb567e105325f8440a1694b"
+        "hash": "501ba8d90343d16c419320e6896196c38e7b9b14e893ef96617f8bb108931b19"
       }
     },
     {
@@ -809,7 +809,7 @@
         ]
       },
       "meta": {
-        "hash": "3a7225d0bf3aead127540ce9d1014e9e75394120d953a7951bd3b037b4accb6f"
+        "hash": "18066e6dbd116c3c589457fb5cef16b9a5728a87a4a096d91aa436c8e3aafdf4"
       }
     },
     {
@@ -823,7 +823,7 @@
         ]
       },
       "meta": {
-        "hash": "a1e0a08b4abb9397fac9607b9374dfddcae814e6a9ca2f65362acafd9bf6f2f1"
+        "hash": "5720bf41b264de168f79f6a5a4bd2bfb3e34e0bf14668e41d3473047fe606309"
       }
     },
     {
@@ -837,7 +837,7 @@
         ]
       },
       "meta": {
-        "hash": "39c7f8c2c6c79fe0a30b827dcef4ec8b0a30b4c802a9c7a2c79d78afcb29363e"
+        "hash": "ae5316c9f0178c362ae59e5c48d8e2bfca4bb4651e25696c16e7550851220251"
       }
     },
     {
@@ -851,7 +851,7 @@
         ]
       },
       "meta": {
-        "hash": "6f9ad765d303fc7139a94ab23086c910650d2b1944bc7d7489a7a2adf2570114"
+        "hash": "6a8d442044c67422c03c6e2d996380632d589c932b7d8bda1481196de230e83f"
       }
     },
     {
@@ -865,7 +865,7 @@
         ]
       },
       "meta": {
-        "hash": "6d45cb7bd8b5431f5a28a1c0a0ce04105aed21fb6fe16f594e009e3e359cd547"
+        "hash": "eb4de09ddad1a858923ec46b6b7fb4fd2ec04631ce53054fe3320e25b70650f4"
       }
     },
     {
@@ -879,7 +879,7 @@
         ]
       },
       "meta": {
-        "hash": "535cb183fee8810bea09bfb9838b6c0aeddb155b14de6ebbc783169fa7492784"
+        "hash": "101704381209b0f0949dfe98c63a412dfc22736fb9b68adba02aaac76f97f606"
       }
     },
     {
@@ -893,7 +893,7 @@
         ]
       },
       "meta": {
-        "hash": "9c78eb4661dccc2ac6051731f3e0465f9dc85530b9431ec640ebe0425fc8df6b"
+        "hash": "ccf2722f73b32d2693b0cb050ab611f86539ce1ec620af3b277e00042e7e4402"
       }
     },
     {
@@ -907,7 +907,7 @@
         ]
       },
       "meta": {
-        "hash": "30ace7009689a46ddffbc398de94ad2df92187d8644722bd7c4db10539099793"
+        "hash": "4a988d97fc5256e61d4c50677b4a78ffb17a34538b34e4bbba96a8ef1638c117"
       }
     },
     {
@@ -921,7 +921,7 @@
         ]
       },
       "meta": {
-        "hash": "0959371fd7e57beee1a6cba4bd18f0595e53f42a7675346c0f2906bcec550258"
+        "hash": "8ccde135a72db896bd889ea27843eb9368d2a0874726aa7a2af67b30c1c57185"
       }
     },
     {
@@ -935,7 +935,7 @@
         ]
       },
       "meta": {
-        "hash": "ef6bcadbfd0204d07f169b64a41dfca7d04c33c62554107acc2e2393352a1b4b"
+        "hash": "657233cddce674de187be8e93e1c8b6e38c405505b1266ca1f3fb35b965e1df2"
       }
     },
     {
@@ -949,7 +949,7 @@
         ]
       },
       "meta": {
-        "hash": "eef416d2a72cc672afa532ce4c09804efc06d97d1a29e92d955f26261f9b303d"
+        "hash": "b70059738193173e8ef6003dbd1b751d1c77921ac1b09f372fb0140c9356aab1"
       }
     },
     {
@@ -963,7 +963,7 @@
         ]
       },
       "meta": {
-        "hash": "7cf65bea40aa0b145015d5c3ddcbd1237a5eab4f03ee80b681ccf882f8f84358"
+        "hash": "489ab55187ce67a6138db4c0e2606dbe808624effb398ac3a18edde27c16a868"
       }
     },
     {
@@ -977,7 +977,7 @@
         ]
       },
       "meta": {
-        "hash": "4a552f47923d4acfc4463625732f1b30652443484d4e16e234cae302d14c505c"
+        "hash": "e44cc3eaa39955a9044b5970b515287a4df2cf07599c9e55ad1ae4defbcc2229"
       }
     },
     {
@@ -991,7 +991,7 @@
         ]
       },
       "meta": {
-        "hash": "c0672ba48a0059421374d26236df1e8000da2716df6466eaa3ab226dd37b0ad2"
+        "hash": "f17eb23b5bda4e18a346a107b8dfcb8fe2ae1b0ce325657ed6b505f3c756be3b"
       }
     },
     {
@@ -1005,7 +1005,7 @@
         ]
       },
       "meta": {
-        "hash": "a48de7348bbc5c1e588f910cc335e3f7067c74588f4d22b41af2886e17b8f8fa"
+        "hash": "1927b7df02d9e99369401756b6af641c68aa79e71f0e42afe5ccf812dae41709"
       }
     },
     {
@@ -1019,7 +1019,7 @@
         ]
       },
       "meta": {
-        "hash": "ff7d283cbe7a0585c2abbbeea24e0ffc7dbd7fdf924f00268b2b00997c911257"
+        "hash": "a91560cd1d2f68017e8ce5566b2a01e73201eaad0e79568e3b83d028ec29a45f"
       }
     },
     {
@@ -1033,7 +1033,7 @@
         ]
       },
       "meta": {
-        "hash": "fcd5e8583522b9c05f9cbb69eb21b6a3b54c6bbb91ce8c5e3a383d7bb878e923"
+        "hash": "cd2e898c927ba74fa82f23d7d307af836931c37376470431b42b7a5c01144daf"
       }
     },
     {
@@ -1047,7 +1047,7 @@
         ]
       },
       "meta": {
-        "hash": "15726d503491392ff26c090133c0522e8c86f9f92536d4f21c883cd80d938412"
+        "hash": "904a3d4e0278e6947dffde8d292d8f2e8240ccb804fa68e0828e34dd9dc18944"
       }
     },
     {
@@ -1061,7 +1061,7 @@
         ]
       },
       "meta": {
-        "hash": "455381f23dce0de0e677b7346f2cbee0559a277c7512af4044cd3c9f92eedda8"
+        "hash": "b8b7d7ab34f8ef4ec90a4c9f6801f3d5a7f79458b24b19054d546e87d1a8492c"
       }
     },
     {
@@ -1075,7 +1075,7 @@
         ]
       },
       "meta": {
-        "hash": "d2ab3f811d41c926d7a43d5860679e38337b3f8a432badf896fdbc85ec76dea2"
+        "hash": "7427cc55336c55eae8075ffca72b387cc3ff71bd5816bb3353fbf4b6adef5b57"
       }
     },
     {
@@ -1089,7 +1089,7 @@
         ]
       },
       "meta": {
-        "hash": "d54979056696062c54a919f4cbc6be16f07fbc834f8601630d68cbc952a7e9c3"
+        "hash": "fd1d5d006310c33063503ff8d67f262707858660091b21095d44950f33714e31"
       }
     },
     {
@@ -1103,7 +1103,7 @@
         ]
       },
       "meta": {
-        "hash": "4fd57a1c20ad5e16a5a4f1c307cd1711b8c9fb525bcf3f150161304e35573564"
+        "hash": "0d9dd1eb69be5a77576f7d0ce4ab36297ecd5390e3da5981abc752226d1684b6"
       }
     },
     {
@@ -1117,7 +1117,7 @@
         ]
       },
       "meta": {
-        "hash": "ea13f87af462530cf44b451ff3868630c64ddb26e354673204d7915925c92233"
+        "hash": "56438a14183c585f0b4c01f8a1ecae54dd2806ea9e6667c8f1636923cfe573a1"
       }
     },
     {
@@ -1131,7 +1131,7 @@
         ]
       },
       "meta": {
-        "hash": "3ad516292b5ff98bc7172199c12c5438b5c62742d1c550cf01342c23dad517e5"
+        "hash": "592306f78398a053a2a117962e5465fbfd098ca5f66240db78799decb6178ae0"
       }
     },
     {
@@ -1145,7 +1145,7 @@
         ]
       },
       "meta": {
-        "hash": "3f13e1175381c9c35e191f67e488be119322acb8478e64ab7dee36ba4e08ecf2"
+        "hash": "f52184fa97f6306fc9501564705022763798ab154c066ee46433d1c4be6aebb8"
       }
     },
     {
@@ -1159,7 +1159,7 @@
         ]
       },
       "meta": {
-        "hash": "8f6785ca3685f463fc2e44277e18280c5daead2483b4603877a58735debb0d6f"
+        "hash": "d118d7eee09cda42ea03766fc8177e339c256ae5e79d94e48e87f487d51503f8"
       }
     },
     {
@@ -1173,7 +1173,7 @@
         ]
       },
       "meta": {
-        "hash": "915bb1c0e77b041992407c60ed219c469fb2db37cb6cbf95bb285a066b314d83"
+        "hash": "8581444cfe757b6d9887743a456a087d2eb1549e1460218e8235cb85a3d46035"
       }
     },
     {
@@ -1187,7 +1187,7 @@
         ]
       },
       "meta": {
-        "hash": "5ec613163d268a55d922aa3d9b94017f5d8c4b66a34767e37f9976e5fa43c984"
+        "hash": "62ecaae6452a7a185c56c884f2da30c8d9772a0cfbf5194eabe8df1c295e38a6"
       }
     },
     {
@@ -1201,7 +1201,7 @@
         ]
       },
       "meta": {
-        "hash": "cb458835f913a64ddedbb48d63a86a33d062a6b40ffc5e5b2cce46282f473a51"
+        "hash": "1d7a7abda34fb0a8217183729bab2f9a61e6da3113f6c50515abecfe472ea7fe"
       }
     },
     {
@@ -1215,7 +1215,7 @@
         ]
       },
       "meta": {
-        "hash": "ea3c58a0be87fcaa8016ebaf59949a3071c7cb1bb8ec66a2066b9d6fc7e9b81b"
+        "hash": "16b9a3620acf34ce96bb78741c7015a7f0c2d0be84cb130466afc6e4bc4a7032"
       }
     },
     {
@@ -1229,7 +1229,7 @@
         ]
       },
       "meta": {
-        "hash": "d7439719ff10ca1116490998b686fdf98699bdcb68c04c3ac62b648aa3858629"
+        "hash": "a297da2dae0f7339a75301e2511479c9d092bf81bf34974efddfe69272fd03b9"
       }
     },
     {
@@ -1243,7 +1243,7 @@
         ]
       },
       "meta": {
-        "hash": "e4dabe4cc1e85eeb87345fde8db9a2574ca7893bcef46578b8c23ca4493d6669"
+        "hash": "8b6be0370cdada1c2e803b26158f43221acc93a2230ae7830cada43ac4f9373a"
       }
     },
     {
@@ -1257,7 +1257,7 @@
         ]
       },
       "meta": {
-        "hash": "89cecc554d0f36b3a219a1eee645b6933ef6e545374e046504ac53e382a14bc3"
+        "hash": "a7ba762d239435eac955eaf586afd973db0c71a64705bda133044288a71cc031"
       }
     },
     {
@@ -1271,7 +1271,7 @@
         ]
       },
       "meta": {
-        "hash": "063085db5cd5bef6e7b38eef1722be12968fc414fd7869e37cb55811955b0657"
+        "hash": "d8327733f4308d6aba5a3ae3df1576cef507075c00df88ef8ad472260b41108c"
       }
     },
     {
@@ -1285,7 +1285,7 @@
         ]
       },
       "meta": {
-        "hash": "16e209d671a3a94a047782f6b95baa525c00245150dbc0a3b338f34bae12170e"
+        "hash": "58083342d74f354e79a34470f880ad05dea22ec538f2d9f59b15c17a2694dc99"
       }
     },
     {
@@ -1299,7 +1299,7 @@
         ]
       },
       "meta": {
-        "hash": "2b9101658a89203204d2603ada5fed5973ddcfa6a4e3f61db9eb093cf8315d46"
+        "hash": "8d774423c630890285830ca99d32e150c00fb517aa93ec30cf8cbdcd3f10657f"
       }
     },
     {
@@ -1313,7 +1313,7 @@
         ]
       },
       "meta": {
-        "hash": "257f9725411883b26c39c5baa8d068561c9bc4b2fc8c733085703eff555030c7"
+        "hash": "61a25e70c3e7d4b0a9d9475ff53dc4d1091b110a43e511427e12a0bba9392e01"
       }
     },
     {
@@ -1327,7 +1327,7 @@
         ]
       },
       "meta": {
-        "hash": "a97822bf80acd8af731ce9c9b859dd60d8be579a8c4b3823d4f97b99dd65f292"
+        "hash": "082acd9ef41f1264fe2ac92e94b13a89cee1560030875f23853fcb69582142a6"
       }
     },
     {
@@ -1341,7 +1341,7 @@
         ]
       },
       "meta": {
-        "hash": "763156f64e0a79c965d4f33b3638fe67889df018f40d558e978c3c213de46491"
+        "hash": "df2ab9779e0379c88ccba56702720cb1658754918a84fbbcd022176544fa5444"
       }
     },
     {
@@ -1355,7 +1355,7 @@
         ]
       },
       "meta": {
-        "hash": "df3b150cba515a80eafc75c4917bbf10c8eaf0fe291967cd8d8b7aaf346c8173"
+        "hash": "6074990eb1d04f79808ad2f4f3ddfe86f6e8546303e003c38ebe96779fde51f1"
       }
     },
     {
@@ -1369,7 +1369,7 @@
         ]
       },
       "meta": {
-        "hash": "f13c288fcb5e90874408d34298b57366a1acc0993b45a4c4fd195fc3fef953e5"
+        "hash": "5c3c48bd06510d0971f48983872243787a33f2adfb8d9aca5f7b6ad9d776efbf"
       }
     },
     {
@@ -1383,7 +1383,7 @@
         ]
       },
       "meta": {
-        "hash": "4dc4b92880663523903693bfdf31026af5f3ca20c9e6b8b3cfa4cadb61c80eb4"
+        "hash": "c3ad71d08e76e152fc37aa5e63db9f35d0dc2c4ffc12810df9c82f92f98354ca"
       }
     }
   ],
diff --git a/snippet_data/snippetList.json b/snippet_data/snippetList.json
index a22d6029e..d3818561a 100644
--- a/snippet_data/snippetList.json
+++ b/snippet_data/snippetList.json
@@ -13,7 +13,7 @@
         ]
       },
       "meta": {
-        "hash": "1b37192f25e1bfcf9f7bae57fc0c1ca05d02016c0c4ab50fb3f6ac6a7073e949"
+        "hash": "ba8e5f17500d1e5428f4ca7fcc8095934a7ad3aa496b35465e8f7799f1715aaa"
       }
     },
     {
@@ -29,7 +29,7 @@
         ]
       },
       "meta": {
-        "hash": "9ff2aa6f079de4569beb1acde0caa8d4f35539e000bcf4ca52c56a824fc3cb63"
+        "hash": "bda519858588ad61c9200acbb4ea5ce66630eb2ed7ceda96d12518b772b986b9"
       }
     },
     {
@@ -45,7 +45,7 @@
         ]
       },
       "meta": {
-        "hash": "95795b2d98d3970eed4066134d947c2c6abf1f0ce1f7dfe705095bab64f44ae5"
+        "hash": "061b791456507197b9be0ff9b791b830fe0b550823868075bbe04962501f83a3"
       }
     },
     {
@@ -60,7 +60,7 @@
         ]
       },
       "meta": {
-        "hash": "062de86ad6c328483fa2760b5cbf79ceb40ef2efa87a74a5704423207a538657"
+        "hash": "805f11e2f230c3a6b7dc590fcee27b4083b2188b6f1d0a8afb93868891cdba22"
       }
     },
     {
@@ -77,7 +77,7 @@
         ]
       },
       "meta": {
-        "hash": "79164ada1eb58d8a611c548f0d5c85d1eb1c0b043fcc6b9f680b279080c55bb0"
+        "hash": "aeabb3d1d2be2d44fd8a20da3b069fdd1a8ad963f27e3e1ae9f5e8b40a8908cb"
       }
     },
     {
@@ -93,7 +93,7 @@
         ]
       },
       "meta": {
-        "hash": "762a7b62270de6cdbc21679ab007313c61e9baa1c3aac51d022206a21a98275b"
+        "hash": "9d7e2db4a98688ab199ed2f75242bbff40a6083cc3c0ef483ed679c5d3878239"
       }
     },
     {
@@ -109,7 +109,7 @@
         ]
       },
       "meta": {
-        "hash": "1e2b832078a1c3446823a3905cb8e16e06e0608988e2de650fae583095d34cc7"
+        "hash": "918d65f04bafeb3ee0b855a52805773e8a8dc818fec1daa4ad0940dba32de9e8"
       }
     },
     {
@@ -126,7 +126,7 @@
         ]
       },
       "meta": {
-        "hash": "ded2d29975207c5cd902ccbf4a8a7849b57cf80bc7b5963f1d4ef2c8a4ddd98c"
+        "hash": "32988360d63d6d62251314a88d3f4482ec3a265d67154a92a86d4140bd61c54b"
       }
     },
     {
@@ -141,7 +141,7 @@
         ]
       },
       "meta": {
-        "hash": "0f2f552619fe08cb9907ee7a0c98b950e8373389331f3b62c3d42f9f6309a147"
+        "hash": "a511836ad4a5755d469af2e6a331cbcd85df14b6231bbed6a1b0fe44aee3d2cf"
       }
     },
     {
@@ -157,7 +157,7 @@
         ]
       },
       "meta": {
-        "hash": "855cf560b8cbb21556c29ef2a28b4f31fb9d2bcc5bcbc601ef8ebfe8511d0863"
+        "hash": "edf5c7f142e59e4467ca7142eaf0ac95957abcb0dad1d439484b2b70fe8be6d3"
       }
     },
     {
@@ -174,7 +174,7 @@
         ]
       },
       "meta": {
-        "hash": "363aa1d913dde77133d4aba12fa28f3338b86a31fdff00067caaa62f93d991fe"
+        "hash": "7aa2052a6196029116ef9f2f7dda69b7d17344c0acc659ffedf002024b38d8b7"
       }
     },
     {
@@ -189,7 +189,7 @@
         ]
       },
       "meta": {
-        "hash": "7b517e54adbbbf3a95f67216f2867a08872bf26fca6fb4e8502fa25cac458d05"
+        "hash": "a801974915906c11a30deef1baa3994f44f548f1ca1cf599aede4bb730543ec6"
       }
     },
     {
@@ -205,7 +205,7 @@
         ]
       },
       "meta": {
-        "hash": "313794f5accd131722b6c22bfe6670d141a646d982083c263df7927be65001f8"
+        "hash": "db1b8580ab11b6ba05a7d47776b97d700c5a7e945ddc5ad9ca1f37e50f039b54"
       }
     },
     {
@@ -221,7 +221,7 @@
         ]
       },
       "meta": {
-        "hash": "434b28bc85a418e6380adfd5e9d256cd9710f81bb082f2e3d374fd61e187e65a"
+        "hash": "d15851c4e6991e41014768c3f2dd28df71615e44180c732b67eed1d162ea4b95"
       }
     },
     {
@@ -237,7 +237,7 @@
         ]
       },
       "meta": {
-        "hash": "f04a9ceec2418fddeaf4c14cd7ff199c7ac09b8de1eb8a4a0f6e25addeba04ba"
+        "hash": "e159b77ba0bde0f38d339348b9a69b4702cf036abd767777507159aa75ce151b"
       }
     },
     {
@@ -253,7 +253,7 @@
         ]
       },
       "meta": {
-        "hash": "f1c96f05acac42f40c9a13c109452c56a50d986a7f80ce3f62a2df0574b98ea7"
+        "hash": "e854f774dd81cdb291fb57b276a61e5d7f7ab13a6aae490c89c0e00acde820b4"
       }
     },
     {
@@ -268,7 +268,7 @@
         ]
       },
       "meta": {
-        "hash": "d78f9673883b943ed53c81d5d26c5b3540d4f8a96e2d0803a9947a9d297aaae4"
+        "hash": "0f36f6b8c7f803a55d8e888c8794cacba02db79c4d54043a8ddc71249c2f8a9f"
       }
     },
     {
@@ -283,7 +283,7 @@
         ]
       },
       "meta": {
-        "hash": "348cfaf2c4fdb8abe8ff462c5efe88be089e476dcdc828968dd9b5a96b8e3619"
+        "hash": "9c2b4a28ae4f39cc034dc75e98d2f405af6113541f796041f142b85e90e27800"
       }
     },
     {
@@ -300,7 +300,7 @@
         ]
       },
       "meta": {
-        "hash": "f6a129bf5ba0c8d340f92e043f442c7a212e78b2e158f638666fbb90b9ff5c7e"
+        "hash": "1c7836009987b8b1097b54a84c38144f6cb643477f08f00b1a37e274cf0c9f78"
       }
     },
     {
@@ -315,7 +315,7 @@
         ]
       },
       "meta": {
-        "hash": "a4d6775c44461cf0cd3cb9a8e9ee50131ac0fe4b420ec7107397b85e0cb76e63"
+        "hash": "c347c3d7b5fdc40df6d480810318d1ba644a74719bda3708b3ee3290f0ff953f"
       }
     },
     {
@@ -347,7 +347,7 @@
         ]
       },
       "meta": {
-        "hash": "25c1d02c0694607506c11337b1358c7377cffb926dcc830d93e59ddc143d5088"
+        "hash": "0c94a28b30fdfe112c8981a86868917d24cc5ddd1c84212a29783cec2d3a5ab4"
       }
     },
     {
@@ -363,7 +363,7 @@
         ]
       },
       "meta": {
-        "hash": "0c7a7de067c94153cd20954eedce399674ca96a6d2fd3352bb7c7c6f903f6245"
+        "hash": "aaf38afdc8033b2070b0e29ddb380db8570bbed490c6f39f55ff95167cdded8e"
       }
     },
     {
@@ -380,7 +380,7 @@
         ]
       },
       "meta": {
-        "hash": "aec0506ead3912f02cc5bdc4448366ca602c9a3a2ea61033c93c6d40497bfc23"
+        "hash": "307add91ea4d5c2a122256f799120f580ac235567523dddeeadd6500f1e81e94"
       }
     },
     {
@@ -395,7 +395,7 @@
         ]
       },
       "meta": {
-        "hash": "ef2a259b2e9abecd2682f8283640a15f6ebb96dc5566e85500bb7b27758fa4bb"
+        "hash": "cd48981af62f6ba75694f796fc5537e6af53a58045465ebd52f8bdd1a1f892af"
       }
     },
     {
@@ -412,7 +412,7 @@
         ]
       },
       "meta": {
-        "hash": "be39d8ec43f9e0f316cae59520cdd07ff9e912002d881c36df1472dd7a09d1f8"
+        "hash": "28eacf8643be19ca8fd83f3093d6641753857656bd6180c8e5f60c1a52df175f"
       }
     },
     {
@@ -427,7 +427,7 @@
         ]
       },
       "meta": {
-        "hash": "2b1b203a374b92765b3beae0556ebc0896f082f6ebe719dc412c3f7a01794446"
+        "hash": "4af3783b8b490cdf70853b0a01780244556a18a7398f5bef123e4f39edbadebe"
       }
     },
     {
@@ -442,7 +442,7 @@
         ]
       },
       "meta": {
-        "hash": "f6f185c1c57d7808281aff9683804bd38605e8cbdb09f9243f3467fc116aef2d"
+        "hash": "32fc5181c38c6d5bb16ac7373b68ad971c6b3cff6b80aee8cb69c296d47d0607"
       }
     },
     {
@@ -458,7 +458,7 @@
         ]
       },
       "meta": {
-        "hash": "4e974691c9b4f0d2e6e4e1a42b3ba0c6d77fcff5a0b8d8b8f8a8e8375cbf0cf7"
+        "hash": "3b7e9a506c229c792da093336574e3524cd1a8c794d18fc450f469f171ff83cf"
       }
     },
     {
@@ -473,7 +473,7 @@
         ]
       },
       "meta": {
-        "hash": "f262e963f6132fe5bd591a77a74444ca8ba46bf2cbd9870ddbdd5edffc25c45c"
+        "hash": "52b7275a934c85ccab144c174f07cf0f3aaf8b1dee913abab020b1be9666d021"
       }
     },
     {
@@ -488,7 +488,7 @@
         ]
       },
       "meta": {
-        "hash": "9d42c6146a3fe951276cdd794cad840c31a9dc5e818f230d7613326e512d238e"
+        "hash": "b85ec57d815ff34ba3906195440fce5d2ad9f33b64d7d96159c0e1125fee283c"
       }
     },
     {
@@ -522,7 +522,7 @@
         ]
       },
       "meta": {
-        "hash": "7fc9cdc29a2d09e99d73f64420e54ff66ca8217a9a354040c2c06d7e457f65b2"
+        "hash": "1ce726b8cbc9f87ff8ff6d68e0678325523b1118fa038b97f53ddad9031dbe23"
       }
     },
     {
@@ -537,7 +537,7 @@
         ]
       },
       "meta": {
-        "hash": "04a95c1797fd7aa7bc05f96e29d06bf6c1f32be5803c64d319f917705bf3b5e0"
+        "hash": "fdd7fd5631e5c1b541eff445f3388488dc060d435e339d9c0f1f257d5733e2fe"
       }
     },
     {
@@ -553,7 +553,7 @@
         ]
       },
       "meta": {
-        "hash": "854dabca292eb78b0c4c59bce756519c1a25ea7ffab28a5498d62b4574ed2222"
+        "hash": "7b6007e94c262a97cfab69ddb111d101103c095dbf2fd7680053d8733e6f2914"
       }
     },
     {
@@ -568,7 +568,7 @@
         ]
       },
       "meta": {
-        "hash": "9b1dd4a7f03c002c2c87e1d45731a005e51d668045e74905e9426e51755e81a9"
+        "hash": "200b26d1e1016c56ba796665b94266e57127b6bcf23bb00b702df01676f95443"
       }
     },
     {
@@ -583,7 +583,7 @@
         ]
       },
       "meta": {
-        "hash": "abfcd43f5c62b661c869442e2be78c58d2a2b943dc76ef1e64b06df0e11b8870"
+        "hash": "90b2780517322e1c847b7e7ae5325f1e69765eb22b72cf3472e1cd7d07f06347"
       }
     },
     {
@@ -598,7 +598,7 @@
         ]
       },
       "meta": {
-        "hash": "08033f31f81d5bd2fc8dc44b2212a7aa23e21f508fd77a6e90baacfc11ba02bd"
+        "hash": "37cf3e2c4a2b41cb94eab31680088761236be2fc817c2c4322a0f9f1a16ae475"
       }
     },
     {
@@ -614,7 +614,7 @@
         ]
       },
       "meta": {
-        "hash": "56a8c13a6c4690c7dad8863bee6f3c77c6b7ea6eff6e783d45cec85e471a4d4f"
+        "hash": "b16e20cca806e64e7d4d81d774e21e9fd6554f55121a53db8b74907ff148ee2f"
       }
     },
     {
@@ -630,7 +630,7 @@
         ]
       },
       "meta": {
-        "hash": "2dc70fb8b6ac6b30e9a2f0c343ab99b233af3a971ddfa166dd8285a6737741e7"
+        "hash": "d5c19dc814e9776782419f3e560dd132c1fdbf0493162e8a7a05b6ac84991f87"
       }
     },
     {
@@ -645,7 +645,7 @@
         ]
       },
       "meta": {
-        "hash": "881f231c303383291de5f2e3efff58e87caf5f2b0ace76bfa2d0b6f4ac410651"
+        "hash": "3143db5361ae9b8f20ee19ab2d5baeeebb976a195f60110522b558873204142c"
       }
     },
     {
@@ -660,7 +660,7 @@
         ]
       },
       "meta": {
-        "hash": "8375e1ddc19d512beea10d30087756e14d7920f6aaf98a0e1e7ff95e1fb95669"
+        "hash": "1ae0916c575409305f4e1f1a2af7966f0f4b9260a9986711805a936ac6ebd9f7"
       }
     },
     {
@@ -675,7 +675,7 @@
         ]
       },
       "meta": {
-        "hash": "8eb84f760e2aeab6861a1cc8ad350151dd860833031884e8b8d26264efe6ef78"
+        "hash": "233be96d6436773d7f6ceb16ad0cf63bdc63a961b59fc1faa11707af182ed510"
       }
     },
     {
@@ -691,7 +691,7 @@
         ]
       },
       "meta": {
-        "hash": "b63204ae9283c6f270a60d4c0068af300f8bb93d3622526ce764f47c0a1e0a7b"
+        "hash": "d162fbc50166f304216db6ea700e5fc7f428ea33d50b204ae921e1c58552a4e0"
       }
     },
     {
@@ -707,7 +707,7 @@
         ]
       },
       "meta": {
-        "hash": "5a50e92bc701fd0d7afbd508a8eb4d7764dfd591d3c21426fb4c76a922dd4482"
+        "hash": "bc41a9baac70cfa4415f23550ff0f0ac92ad5aa2192e577437e72c732956ada7"
       }
     },
     {
@@ -724,7 +724,7 @@
         ]
       },
       "meta": {
-        "hash": "10a7c4f33110b6a3f814d6be178651a3be7cb0220787b2854b18c049b538d7bc"
+        "hash": "3169ab83e588063262fa6a01f7d7df7bd9521345c65a7c7f874f577478c90305"
       }
     },
     {
@@ -741,7 +741,7 @@
         ]
       },
       "meta": {
-        "hash": "8cf59151187aae093b609a2c3f2e7124d541ab5d7fb5c7b3424b3b3f4ec4f39e"
+        "hash": "786d9d7dc8544fd49678b8bb71eb4a068ade86a30b2a58d07bef20da2fc28db1"
       }
     },
     {
@@ -757,7 +757,7 @@
         ]
       },
       "meta": {
-        "hash": "ec8356a21b932e91474580ea5f2c4b63420453e1d7c0428c13abe93e05495f79"
+        "hash": "f51d4d8679fadabe84e72547013537a5fcb7bcedd7907f79934fba06405097c7"
       }
     },
     {
@@ -773,7 +773,7 @@
         ]
       },
       "meta": {
-        "hash": "8e97da9862e249383e01c8f76521f64f718136e22413fc805357090826a6cce7"
+        "hash": "80e76d37fa79511f3256d5e1c113d223fc8875fd9d6cfe8b7530b567def30456"
       }
     },
     {
@@ -788,7 +788,7 @@
         ]
       },
       "meta": {
-        "hash": "16f3aea7c85e2373a402c113629b0a9ddae4cd001565eabd8d7dac6d0226a616"
+        "hash": "9057876a6323ed24bbc3db2a6db7ddc8bdf59663493d07935b9c9238d879a689"
       }
     },
     {
@@ -803,7 +803,7 @@
         ]
       },
       "meta": {
-        "hash": "b6f75281785a4d0803f40d5452e0f8d2a6bfd16acda43ac1e53f9f195c8ecd7f"
+        "hash": "bbf4d763429f499c0e1c3feb381e6291d3643d45613d25812ac5c47789d4d4f9"
       }
     },
     {
@@ -819,7 +819,7 @@
         ]
       },
       "meta": {
-        "hash": "504d4200bb420f842b538160e24badcb95ea8fd8a1d2566e09eec9f9156ce2ca"
+        "hash": "cb1b9240e8dae6a351937afeeccb1e200017a3729844b812721b8a8fcffdaa54"
       }
     },
     {
@@ -835,7 +835,7 @@
         ]
       },
       "meta": {
-        "hash": "d3746880744d38557e67fe915b31e15c01cd1541eda1ce68ec0e3242ed821ed6"
+        "hash": "cdf3e756a5a73f7e6925d51b141089e991ef579ee8bfff99f194da8fb0ef6dc8"
       }
     },
     {
@@ -851,7 +851,7 @@
         ]
       },
       "meta": {
-        "hash": "62f9e1311cb89f88dffcca2236405de454ac35efd99a2a9abe66ea2f99c280e8"
+        "hash": "3581c10be59a1ecac528c7dbbb2b19479193e896f75d7229ed56853f6b2ceb52"
       }
     },
     {
@@ -867,7 +867,7 @@
         ]
       },
       "meta": {
-        "hash": "4e827d3d774cc03fdff9dd9ff6894a797cd31f4c0fd64950cc0a2681989089cf"
+        "hash": "a96d773dc1d2d54b91ccabf3eb4acaf0964d080fc75dcbf74fc032fd40702e9e"
       }
     },
     {
@@ -882,7 +882,7 @@
         ]
       },
       "meta": {
-        "hash": "0047781cef3f32f1dda60562741862b6d6dd97f1959074620e7f3bd193e8da40"
+        "hash": "818735e4b97db79e60544be6339c8e260b630f375b542ea51e1bc60e4171be42"
       }
     },
     {
@@ -898,7 +898,7 @@
         ]
       },
       "meta": {
-        "hash": "99b0432028acde981514d3fc7c29a8db18351e4199dd112b7f22ef6c54158980"
+        "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
       }
     },
     {
@@ -913,7 +913,7 @@
         ]
       },
       "meta": {
-        "hash": "8ce6adfe5a929a10f301c1ac3f9f16ff7278c8cae764877a0b71bf4980d032fe"
+        "hash": "f891cda1417a4f1c3646c3d7451aad99833062eb28a9fcad4d414b98d1925bc6"
       }
     },
     {
@@ -928,7 +928,7 @@
         ]
       },
       "meta": {
-        "hash": "3315e60f3ce1bf23bdb863323f6ecfd9e11e10b456e16d895f49ff19d39f90d2"
+        "hash": "7a750cc36b1a97252c4048a6896e0e01816ccf0bcb6db634db42b4ae5be1ed3b"
       }
     },
     {
@@ -943,7 +943,7 @@
         ]
       },
       "meta": {
-        "hash": "e0f35f5ecbd879103c0c11c8daa36511390f300b749885d223e099053a537793"
+        "hash": "2bc5b5959725150f5c678769b6dffc05f44692ad2e201b9ac1ff40c00e5dc419"
       }
     },
     {
@@ -958,7 +958,7 @@
         ]
       },
       "meta": {
-        "hash": "1b60e100a66cd546827334174e0b2e1506884a61fa8131ea0362b536b80ed8fa"
+        "hash": "cfa17f3a578f2790d22b5054c728a07515678b72eccef8500218b78d8a3d9e4b"
       }
     },
     {
@@ -973,7 +973,7 @@
         ]
       },
       "meta": {
-        "hash": "e85101f72c32524d41415df0c0a1e39ac60180ce1a495467b39f831176f90853"
+        "hash": "ab72248448b94658fbbe2842d7feb3ec1621703384472f424a2355634d1aa774"
       }
     },
     {
@@ -989,7 +989,7 @@
         ]
       },
       "meta": {
-        "hash": "7fcc26fd4260f148881436b6d181e28bbf01de8a48ef1cf46785deb1e530b6c3"
+        "hash": "7e49ef3e36b2fe6f1cc680e2be782bda7af3e05fa75b4bacf59c63428a6ebf50"
       }
     },
     {
@@ -1005,7 +1005,7 @@
         ]
       },
       "meta": {
-        "hash": "f651e1b1c3a15cb76054925e77d3180642bdf256ded282b6b939d825365eb51a"
+        "hash": "1be0503ca3298cf2c05ff64889181fc35e682785476bb5617d439978b80fd35e"
       }
     },
     {
@@ -1021,7 +1021,7 @@
         ]
       },
       "meta": {
-        "hash": "137a16a300464b556916535135f2aafbf5eb3aa5647613d7a50af3333987fd56"
+        "hash": "b265f3860be86344badb79b74074e3dfe37da6b2c4ff95bd8865b6e6f7c0d73b"
       }
     },
     {
@@ -1037,7 +1037,7 @@
         ]
       },
       "meta": {
-        "hash": "e1f7ca3f54a993d8682fe3a2fc5bccc9da417281efad066b5f0160a689a07b08"
+        "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
       }
     },
     {
@@ -1053,7 +1053,7 @@
         ]
       },
       "meta": {
-        "hash": "c44a93b3effe25dd69f837c6bc6e5b940c48ee6b1de44f426d16b30720f46564"
+        "hash": "adc3d101e4cdb91158dceb8053b684dfdc1f16cedcbf6cf6429fc4ed8a164b59"
       }
     },
     {
@@ -1068,7 +1068,7 @@
         ]
       },
       "meta": {
-        "hash": "f80379e696d64247f73b734705fee11986cec7f37f1f04c6676ed4a9f3866872"
+        "hash": "4a9da71c7d722ae58f12c73771d00cab86e74c3167254451660d26197ba6bd19"
       }
     },
     {
@@ -1083,7 +1083,7 @@
         ]
       },
       "meta": {
-        "hash": "37658da68c3bd39a3ba2f588721e93180ffee682f751067bd846275035dbd1c8"
+        "hash": "bf545684ca0c4abe2fc44e3fcaf15df7986430630e306ad3c009e629e63a1fab"
       }
     },
     {
@@ -1098,7 +1098,7 @@
         ]
       },
       "meta": {
-        "hash": "0d7af0ac37c1c1f827fa8158c3fff9323f3ba6fd6a06866548f3f20b067e5c57"
+        "hash": "36905bae3e3177bb5999580342141975020ea45d7162f240af5cc418425c871a"
       }
     },
     {
@@ -1114,7 +1114,7 @@
         ]
       },
       "meta": {
-        "hash": "549f5445419dee32b101d1553d6f6cc7e2176c9d4112ca207fbb9d5d8b2420c9"
+        "hash": "252b49a7c475d830e22c7e6dbae7df45be37a97b400e93125935c2de5c24b0a1"
       }
     },
     {
@@ -1130,7 +1130,7 @@
         ]
       },
       "meta": {
-        "hash": "0081a0bba609bfdad40ce7b06e33eac15edb926b07d30696fa40fdd8d935179d"
+        "hash": "2433c61d4b168a15de1d89c3d077c51fdb36710dfd4e72465d929e83a5acb09f"
       }
     },
     {
@@ -1145,7 +1145,7 @@
         ]
       },
       "meta": {
-        "hash": "66b205760b4153404424a37c0010c97eb52c153ceb3f81acac2009278a90933d"
+        "hash": "2c6c186cf8b62305ab88307d24b413acd96dba006c80ee7835e5fb8e33e72256"
       }
     },
     {
@@ -1160,7 +1160,7 @@
         ]
       },
       "meta": {
-        "hash": "a5845d2eeb8ddf4885b6cbdf2b2e9b876c824e9a67008c08e9fff4005ceb14f4"
+        "hash": "46fed254db32437f3f54938d293aee32ebda0bac4dda24e6af33c039f4bc6f9f"
       }
     },
     {
@@ -1176,7 +1176,7 @@
         ]
       },
       "meta": {
-        "hash": "1f9a6da0bb0f3dbaed82dda773e3ed565981e4fc5e169d126d720245fd004c67"
+        "hash": "7f506f1d9999e20da3deebf7d51b80d9f56f9d87bddac6637faf63316bcd1790"
       }
     },
     {
@@ -1193,7 +1193,7 @@
         ]
       },
       "meta": {
-        "hash": "27c7f2a1d8c3e49491710c3bee0cc39158ebb24b8c6c5507fad7094d52b3200d"
+        "hash": "05ce8329709b7b6a70ae9e07146fe1044de6c1fb33e00f7b953bb66b6f605e4d"
       }
     },
     {
@@ -1210,7 +1210,7 @@
         ]
       },
       "meta": {
-        "hash": "2e00c83be3e95f6e57f2fa59fc335b7ac4bd2bab8a25c267738b447f929aaeec"
+        "hash": "456a613a9ad94c219753a2ad2ad6f5e1668b974e9f503d221791745c570a35d4"
       }
     },
     {
@@ -1226,7 +1226,7 @@
         ]
       },
       "meta": {
-        "hash": "6673e7e0351a435e0abebc2b0063489721ec1964227b52bcb7700b241803bb44"
+        "hash": "91c52b53fe79cc811678086b90b073f84bf168a1bd59dfa6796462ac96adfb17"
       }
     },
     {
@@ -1241,7 +1241,7 @@
         ]
       },
       "meta": {
-        "hash": "82f8cad5709a9c9c6b0a395848de9d7b7711af0b7f3a2186d3592df55a4d53ff"
+        "hash": "a111e4110ff4fe4895ba42b32ed7cb294ab8a0b1103d43cf5bf2d0c483f2ec7e"
       }
     },
     {
@@ -1257,7 +1257,7 @@
         ]
       },
       "meta": {
-        "hash": "7dd02d067f1a656e66039246ae3fc6ec69768bcd272fdf1b6959156655b0b18d"
+        "hash": "34df599e00a3541dfecf1c0780514006d8d6cadfe28905ead9e782cc3903902c"
       }
     },
     {
@@ -1273,7 +1273,7 @@
         ]
       },
       "meta": {
-        "hash": "74fd0eca4f8325581b4d8529c2701ba72224f3cb41029c40c58e07044c2dc245"
+        "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
       }
     },
     {
@@ -1289,7 +1289,7 @@
         ]
       },
       "meta": {
-        "hash": "d74f5f50e4649730596f1450df7f068d354bbdebe0fb102c103d715f33e1f6f1"
+        "hash": "156e9481207c96ff8e9fe054a5d72144933a5a0f4215e721925e3da0054f6be2"
       }
     },
     {
@@ -1319,7 +1319,7 @@
         ]
       },
       "meta": {
-        "hash": "863c3c8f0919a3ed4a7f33f2c993f4d7f0696ba294d66e83bf0396c698dc612e"
+        "hash": "f9abec985874548f8020c4b1a3f657981989c08e1c8d5547f21d1f36566b093c"
       }
     },
     {
@@ -1335,7 +1335,7 @@
         ]
       },
       "meta": {
-        "hash": "7e38e53cd66a42c5463f9eed768be6f2758da11fa4d62e636d9670fdc22311f9"
+        "hash": "9179ddcbbbf42b58c2fa5b2f079154bee2739e5a843ed8be84a8dc0dc9946116"
       }
     },
     {
@@ -1351,7 +1351,7 @@
         ]
       },
       "meta": {
-        "hash": "6ad4a3db3f1a369972c89bbd6f0cf759df6ca26c55352472d293cf964cf584ac"
+        "hash": "cd829971748368811b0c202243f3d968be259e24805715b7459657394eb9f302"
       }
     },
     {
@@ -1366,7 +1366,7 @@
         ]
       },
       "meta": {
-        "hash": "10e49db481cce7a77e3035e54524ba78dd8caebefa0b58c3f0a493802ab6ce76"
+        "hash": "2f79feebcfde7153bc7d457358d3ce9f0c544f98ea2cd35553a5d5e9ac88be6e"
       }
     },
     {
@@ -1382,7 +1382,7 @@
         ]
       },
       "meta": {
-        "hash": "993ce3d700e503d786cbdb16aa96011e9976db8949d7279b7242d783fdaa1ad5"
+        "hash": "48e20e5a2457427add5094d4fb588bebb98c244178758610678d25fd64b60f6c"
       }
     },
     {
@@ -1398,7 +1398,7 @@
         ]
       },
       "meta": {
-        "hash": "3fac655dd7f00562e93c9c0687176e8861b2eeda2d045afe4d1cfdcbd601da57"
+        "hash": "884ac6ea5ebaf84aa9d83bba6e2848e0b524fa4a39632cd96bf797474caf4b34"
       }
     },
     {
@@ -1413,7 +1413,7 @@
         ]
       },
       "meta": {
-        "hash": "05b26757613b43902a86dd1fb1e6941e6f31f276854082de21d695562d8aaaf8"
+        "hash": "e1793f61af6def69138bf162d0efb8f11578e7be5d718e701075dab4c510ceaa"
       }
     },
     {
@@ -1429,7 +1429,7 @@
         ]
       },
       "meta": {
-        "hash": "256c8a3b631c9766dc318a47e07f5b74c9cfdb84ba0d005da89c6784c136e726"
+        "hash": "5c49020c066977d2f001fb1101301768cb0e1a757ad76982c0cd0ea9b990e27c"
       }
     },
     {
@@ -1461,7 +1461,7 @@
         ]
       },
       "meta": {
-        "hash": "acefad1c97978d234a1e0c8afc26795467cc01a4f1b107084fb66f5160dfe07d"
+        "hash": "31b710c7f120ba4e484fb3c782ab6cb3da0a47e84521220d474473229103ed5a"
       }
     },
     {
@@ -1479,7 +1479,7 @@
         ]
       },
       "meta": {
-        "hash": "850ec34ff993bce76b849e1d0b08be8ee2fa11080f281ac420b01ff72d04a264"
+        "hash": "176cd07a9486286924a7393fe631e83471e7123e3b6349309a7c1cee7746d764"
       }
     },
     {
@@ -1495,7 +1495,7 @@
         ]
       },
       "meta": {
-        "hash": "09c228f22a9522dd25ec50f292359bae6430fb659fd52dfc02fb6d8168092275"
+        "hash": "24c79c76a89e64ad0d4a29f542400937bf280f49cd7bbafff3e26b63f0c4ad4d"
       }
     },
     {
@@ -1510,7 +1510,7 @@
         ]
       },
       "meta": {
-        "hash": "a86fbe1c26c290b8c75b012f5b55a169824a9e7e4423648b8b879f4899570e27"
+        "hash": "0f4525106d39a394413f7623eff35661baad618f49d7c2265496153804862c55"
       }
     },
     {
@@ -1525,7 +1525,7 @@
         ]
       },
       "meta": {
-        "hash": "48ecb0a9da86bd7ac915066fa6d6f84264b0f8ba010794324d2bbc67542f7a43"
+        "hash": "8810b76dac2c4294a0a029e697441ad73aa87f98a7b1698a61f31c62d5981ec8"
       }
     },
     {
@@ -1540,7 +1540,7 @@
         ]
       },
       "meta": {
-        "hash": "e43014c6f90608b4b6ccb44e3d12560f202138b1078dfea03c3c2b7d8151b58c"
+        "hash": "1b4fe94ee0e82ecd4c77de9ea258ded34a8a834da1bb021b5b25fe84ab8e4eea"
       }
     },
     {
@@ -1556,7 +1556,7 @@
         ]
       },
       "meta": {
-        "hash": "086d293330ee25c0a737a3059968e65adffa91494940e4d94a5959bb4ea48653"
+        "hash": "9f8947652b9c2faba5f1bda82f992bdc81a71c67374fcc843e96ce2a327a28db"
       }
     },
     {
@@ -1572,7 +1572,7 @@
         ]
       },
       "meta": {
-        "hash": "59ad552abe8321c20a89f0c9de7d7e47dc54e74c0eb4121a04ea2ab6d1e844e4"
+        "hash": "1ad875e1b31348464b3eedddc0e0a4b0e10154e16b08025fa5e46d94995aa887"
       }
     },
     {
@@ -1588,7 +1588,7 @@
         ]
       },
       "meta": {
-        "hash": "b8be82f028bc074c193da1f760ca7c52d0cbd596d469a49ac92657a8b1dda41a"
+        "hash": "751df689bc853192c8302d245e96684deaf158da463d8cdcbd54f84bb0d7c6dc"
       }
     },
     {
@@ -1603,7 +1603,7 @@
         ]
       },
       "meta": {
-        "hash": "dc5a09c89358b5410cab8967467f6e3943b63aedfcb0006631be00a7274cc337"
+        "hash": "dec4fa85a58d11deefd90a66b0ede5ec73ad3e2481d5cf76918d13235c3238d9"
       }
     },
     {
@@ -1618,7 +1618,7 @@
         ]
       },
       "meta": {
-        "hash": "f85c17ea79b6aa973ac396273c08388b1608ec2bed2d5c865e231cee12171ccd"
+        "hash": "9f1b9128c94cd905327d5f09904f924fee541e8114e298fe7e01855d87cfe3d2"
       }
     },
     {
@@ -1633,7 +1633,7 @@
         ]
       },
       "meta": {
-        "hash": "31951123792158e6ac3aa4a4b6579384da02ea7c1656d8519ec661177764e15b"
+        "hash": "b2802086a18e09907de87f5409547d902ce7f6ae4f5a39cbc8869a662353303e"
       }
     },
     {
@@ -1648,7 +1648,7 @@
         ]
       },
       "meta": {
-        "hash": "688e47c3386210f391da19cb1acf8d84518693c6254d0acd95c74ed058e72348"
+        "hash": "0a2c0629c3c0661519c08d21768dadd5bebac35c892d980d390b16b60c60a2eb"
       }
     },
     {
@@ -1663,7 +1663,7 @@
         ]
       },
       "meta": {
-        "hash": "1f774c5f8e2910a3aeaf8189c70e0c3f3eb3c11a79ebd2862109fad0d2fb1d44"
+        "hash": "1caa2b9a8817bc11874785cdcf9f676e169caec6487c54124287ce85bb818c93"
       }
     },
     {
@@ -1678,7 +1678,7 @@
         ]
       },
       "meta": {
-        "hash": "302fe6c17675c3e7792b162592bf368a5d0c90a3c46e5bb8783c56c52c2b77f9"
+        "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
       }
     },
     {
@@ -1693,7 +1693,7 @@
         ]
       },
       "meta": {
-        "hash": "cfb1339890d20878f61906660457ca315c0e9d4d7896ea53bbd9ebf3d95abb9e"
+        "hash": "255afa82679e614e1388476fb4392f0e1bb45f11e1c02e965925e231401f1f2c"
       }
     },
     {
@@ -1709,7 +1709,7 @@
         ]
       },
       "meta": {
-        "hash": "6bed676c5c244c645dc7edb01ed828dcf125c61c1ceea755bb425b0cdfabf27f"
+        "hash": "f779277f9fb5fe54aa4b122bf87d73d921cd2550253a5bda3a2b512ebf70a976"
       }
     },
     {
@@ -1724,7 +1724,7 @@
         ]
       },
       "meta": {
-        "hash": "8168607e9f063a80e9c2e6daf5be71e007a1dd73cbfd3fcf07dc88e7569a29dd"
+        "hash": "7209ddadbe2402ac811e20f69feecbb682ee8ec0545dc4d0839455d4cb790432"
       }
     },
     {
@@ -1742,7 +1742,7 @@
         ]
       },
       "meta": {
-        "hash": "db9d3a2f018998e9c410fe2fb6fb6bdc0ae44314af0ab9d4067fe10d30583966"
+        "hash": "460d0f75a526126cabbc1a0b7b727b78999332bec7876959519c187cd8db96db"
       }
     },
     {
@@ -1758,7 +1758,7 @@
         ]
       },
       "meta": {
-        "hash": "ed65c4da8d5ed52650dfd0eb198698c81227ca9dfaad9fee0a5a88fce9d67fe3"
+        "hash": "8f501c922c2d5d7fcb20bc84153e7b392b4209592f54b7bae5c61b77bb107f81"
       }
     },
     {
@@ -1773,7 +1773,7 @@
         ]
       },
       "meta": {
-        "hash": "d9d5dc03b392e24f48ef0d9ba16fc03059b24916728a8cb47ecae09dd82faa5d"
+        "hash": "b4234c37a89fb91b38283fc4ce8c4ccb2d7fb62d522f0becad4dd3d6a62efe56"
       }
     },
     {
@@ -1789,7 +1789,7 @@
         ]
       },
       "meta": {
-        "hash": "6d3bf4ca574efecfcfb36e1b5f3130c0b6e5bdc2604f527585e2c2a3c71f2c1b"
+        "hash": "bb20ea2c4697a6036f1d149063f91a973de3bb5902649ca7ac6c9271a3561375"
       }
     },
     {
@@ -1804,7 +1804,7 @@
         ]
       },
       "meta": {
-        "hash": "96e82bd321e00116ab9e8bd0917d2a3eb47d36ff2cc8f24910fb3747e6f41566"
+        "hash": "45c7a17b5debde35c4b31270a22e1a052fb4b4f1d7c05d10c8045caec96ef550"
       }
     },
     {
@@ -1822,7 +1822,7 @@
         ]
       },
       "meta": {
-        "hash": "69474eb1d52d8cf5d74cb68d3786b2721418c1cfa6b9863f710a3c08aab3c12d"
+        "hash": "beb6f68f5a8b63fd90a671758556aa72b5c061b681df049779cdf5631837966c"
       }
     },
     {
@@ -1839,7 +1839,7 @@
         ]
       },
       "meta": {
-        "hash": "ae6d4cb09a8e1da1a05d958b29f8030536480d0999b1389d48b663151bbea2f8"
+        "hash": "e7b6164cfaacf4869f997747df3e135a1ec4342abf5a56498586513332272a96"
       }
     },
     {
@@ -1854,7 +1854,7 @@
         ]
       },
       "meta": {
-        "hash": "8a257f572247b4025a5064162a0231281c8be01e66741b23aa5a5b7bd037d461"
+        "hash": "ce8a65975fa1d28533405e5518de608bcd3701bd21f97df39bc6e22b0e9bdf78"
       }
     },
     {
@@ -1871,7 +1871,7 @@
         ]
       },
       "meta": {
-        "hash": "0762c225818c8ef49001ac6691f6acf7aa86f2f5c310498d2fb86f56bfec3639"
+        "hash": "f61b08541372ded95a947cc570f57f7bbc9c7908ede569d59f294c5b9ef6feb1"
       }
     },
     {
@@ -1887,7 +1887,7 @@
         ]
       },
       "meta": {
-        "hash": "f0f1e093ca1900c17a2b3390604c05dcc8d89f678cc4202ad2ce388f2861a717"
+        "hash": "b2cb8be1a0e2b2d6471762cdac531925aa3c0c695f2ef162e0c8c1f4a1c174aa"
       }
     },
     {
@@ -1904,7 +1904,7 @@
         ]
       },
       "meta": {
-        "hash": "99a276135e36f8740fbe0ca8c24364b8fd5b1b529575a1f5c95a43039539917f"
+        "hash": "c138c0e5f16d48997691a98de7c0bc43b228a0b4285f0ab2b26d230e209d1530"
       }
     },
     {
@@ -1921,7 +1921,7 @@
         ]
       },
       "meta": {
-        "hash": "4090b3910892bbaf84193464390cfe55a7719b90842e258549e10d808e761112"
+        "hash": "5b29941074f19769531b3320ec8d61e2b2bdc69735fb781bf7e880ff2080ec04"
       }
     },
     {
@@ -1937,7 +1937,7 @@
         ]
       },
       "meta": {
-        "hash": "7ebc8d794576aa17a97af78c6509cf0479c9ffd1aadda84381f4612ef8f2d9ef"
+        "hash": "37468f75e3b2200d43906644eacce72a17a0e22441367bf1b8689e01e3c9ee76"
       }
     },
     {
@@ -1952,7 +1952,7 @@
         ]
       },
       "meta": {
-        "hash": "ce79f99a81da9fe307882fa227ad489b7ef14ff74aabc349f6279ff495592adf"
+        "hash": "542bc8c7cc17654b02dc9fdcd6791901f61a6907c89e42192f6e5d2a8eba41be"
       }
     },
     {
@@ -1968,7 +1968,7 @@
         ]
       },
       "meta": {
-        "hash": "d9c235b030ed77f98af4e366ca39a3388a7779554b66b4a014a1bd8133c6e9ec"
+        "hash": "544ebe19f71cab5f4b4ad5a6121d4327ebf2b09f04451151e7339c90c8924789"
       }
     },
     {
@@ -1983,7 +1983,7 @@
         ]
       },
       "meta": {
-        "hash": "becbd61f09613887eea56adee4da640bb200e2cf88d3191de99660441b67b70e"
+        "hash": "40c8167847d364d53d84026917aa41947024d180b0fbc70aa7033c1ef348c344"
       }
     },
     {
@@ -1998,7 +1998,7 @@
         ]
       },
       "meta": {
-        "hash": "6f519d1ba04a94b1fcb391898d3b820ae2fbc3caa41658f66b1a2b8895a60143"
+        "hash": "c2479bc7d9e651dde057378ed2641f37b75d5b4fc8ed295997bea8d37d46bba0"
       }
     },
     {
@@ -2013,7 +2013,7 @@
         ]
       },
       "meta": {
-        "hash": "9eb75fd66cdb9ea7be47349c5c0b31a53eb3aa2bbdb67354432d313b9da65d7b"
+        "hash": "ada7e68c9a5a701265c1ea38dfc253b8ccb7d9c261dffcf9a42cc560b264cabc"
       }
     },
     {
@@ -2029,7 +2029,7 @@
         ]
       },
       "meta": {
-        "hash": "6b251d9f470fe5b1536f5174091b0e17277a159f9c92389031579a4ce9d1892f"
+        "hash": "f4e970fb09664acfd567ee0ebc9867672095c529778b8b9169ed5b13d431c563"
       }
     },
     {
@@ -2045,7 +2045,7 @@
         ]
       },
       "meta": {
-        "hash": "0b70ff3151f64e4a11f201a03d28fb5f3769344912b26b156e22b79b780dac48"
+        "hash": "59cc7791996547b646472153ebb1fb0bee4d177199e6a7311791eab98c58e3be"
       }
     },
     {
@@ -2061,7 +2061,7 @@
         ]
       },
       "meta": {
-        "hash": "8e77ca220ace40c6e4499334bef214c3471f039355b29d22336c5d49b91d7f90"
+        "hash": "0e8321b0286c38321fdb3e27353567cdb03c6767152210e8e14e4925057adfe1"
       }
     },
     {
@@ -2077,7 +2077,7 @@
         ]
       },
       "meta": {
-        "hash": "d8b34bd8592d22bb0792b2a62ebff9b33a829fef6cc249769bdd2bbc374eb5a7"
+        "hash": "21b455190adbd8b80d2559a88d9ec244ac32544235b7cfed8caca65c11c8ab80"
       }
     },
     {
@@ -2092,7 +2092,7 @@
         ]
       },
       "meta": {
-        "hash": "c3ca3f1b04a1b7a199d90eea2e7a17c6989a2ce1c43ba68080fd24ec38307b5a"
+        "hash": "911d4a90c6ded62d063887e772d4017d4612e4fce48e79836ad19fc41e2c1abe"
       }
     },
     {
@@ -2107,7 +2107,7 @@
         ]
       },
       "meta": {
-        "hash": "82772b0d4bc878efc418b9fd9f7c5c99b8da05c4c4a140e3879f34ed9f6a71c1"
+        "hash": "9a2e1d5c50b955f8be4e0ee6b63894525be4904905a62c483789dd4e3d4bb11e"
       }
     },
     {
@@ -2122,7 +2122,7 @@
         ]
       },
       "meta": {
-        "hash": "e11b954b6481ac92e0b23fcd5056635f848255449e2424617598ec370e27f5ba"
+        "hash": "72db2aadee9327a4e794727fd39a254cc9cfcaa4f0819b2d03ad3c39c950264b"
       }
     },
     {
@@ -2138,7 +2138,7 @@
         ]
       },
       "meta": {
-        "hash": "6fb46bb2067d6a0e353c6dc0431e64fa7dcc46b0db046a2fa9695d6e2bee4211"
+        "hash": "8d42afae6c90ddcd75a078a39db780eedd9a484103fc2174f7b392613a31085f"
       }
     },
     {
@@ -2154,7 +2154,7 @@
         ]
       },
       "meta": {
-        "hash": "aa3877e7f5e7392232aed11b0de72dcbefe536c6e684cb046ae4821afc4c668d"
+        "hash": "ad560d72d29aa86e305bdbd54a7a5b5cde8c57a38386342fd8d6905575de1f7a"
       }
     },
     {
@@ -2170,7 +2170,7 @@
         ]
       },
       "meta": {
-        "hash": "06652ca62bda11d1066252bb1386a2679a5c654b9c764be3f0c14edf1eeb13c0"
+        "hash": "3dd3ad662f52d4189d00c5abea2e3d8f408acc789065d2071d16ff2a442c7c55"
       }
     },
     {
@@ -2186,7 +2186,7 @@
         ]
       },
       "meta": {
-        "hash": "870c2b24138e45ea3e18e6ae0287828179863963af8aa2f8d51d5ccf477933a1"
+        "hash": "193618c3f15f2aa14ce53dd88ee928aa8f6be6891c5253d7921eb87547ee7dbd"
       }
     },
     {
@@ -2203,7 +2203,7 @@
         ]
       },
       "meta": {
-        "hash": "0a9cebcc63f2c9ea95c911503f7db70defaf2e17c9850ee48a91856a7680f4ac"
+        "hash": "c9bbbe9ff32915b2c44849dfe8e1ab3554383cb0b7df9551424ca2597e355f41"
       }
     },
     {
@@ -2221,7 +2221,7 @@
         ]
       },
       "meta": {
-        "hash": "2c953de8cfb678cb6affc57a75e5633137bc4d4003a195a79641068c506ced82"
+        "hash": "7523c5d3ab85075efa61efc135bb1c8d85e2a2e5407ddc5768099993d46f13b5"
       }
     },
     {
@@ -2237,7 +2237,7 @@
         ]
       },
       "meta": {
-        "hash": "fa914519e97ba13886c958b664696740832b64f02184335909f257d324e774a0"
+        "hash": "19efe22718bca00459c41fa9df56c3574270c500bdd670873358052ccc870f5b"
       }
     },
     {
@@ -2253,7 +2253,7 @@
         ]
       },
       "meta": {
-        "hash": "c8298979582577c6cb04d4a0e696c5a411c6d02d124bd0c5259a5e5a19987ce8"
+        "hash": "d5d6a4a5652dfb641a7cade70e041e2e91aec06e9184d06f6bb82499bfee0498"
       }
     },
     {
@@ -2269,7 +2269,7 @@
         ]
       },
       "meta": {
-        "hash": "1cd03b507e61ad7af7c3bdaa7357d1f3a330f2dbe1f47ef3e81210d8090eac49"
+        "hash": "0694b883486ca56109cb2c2ad8ed3477c0c4ee84d2fa81884409c40302a13fa7"
       }
     },
     {
@@ -2285,7 +2285,7 @@
         ]
       },
       "meta": {
-        "hash": "6b8403f3c0c9612f665ef2aa7ca93ef10b390673b12dfbe7cd63c077866693dd"
+        "hash": "e0d70480b239a585f907c965214a037ce23ae15f5484ab80930ea9f57cbe529e"
       }
     },
     {
@@ -2300,7 +2300,7 @@
         ]
       },
       "meta": {
-        "hash": "fff9594012d5a6b16d82f50a303fede8d9157a5dfd7964500daf82462db18529"
+        "hash": "2c2e66152db8a6445af911c49a181d4cd5ca92db5bd23f24124d2df06bebbc15"
       }
     },
     {
@@ -2316,7 +2316,7 @@
         ]
       },
       "meta": {
-        "hash": "9d029af76de1d6abe676263147e17d3bd145b4b7f054e104ece4820e0ccd815c"
+        "hash": "6fb24837c043a0cc320a46695ef0e286a558aaf06e9354407569ae61c4a8d0bd"
       }
     },
     {
@@ -2331,7 +2331,7 @@
         ]
       },
       "meta": {
-        "hash": "42ae88827dacdc248ee9cd1443024dbf6e5a6aeaef5b8a14b56a918ed41fc33b"
+        "hash": "3aab66b09df0070568e0ff69717ac0d5c62d88727262419d07b0f50e1a6677e4"
       }
     },
     {
@@ -2346,7 +2346,7 @@
         ]
       },
       "meta": {
-        "hash": "322163bff5324802fe9336d37d0f3e5a5eadcbc944dd1f331ac7bc61121e2bf8"
+        "hash": "e89795b1f8240e97e4ed1825f2cb38deaa356b8c08ecdd3eaaeb6fe243363f7f"
       }
     },
     {
@@ -2362,7 +2362,7 @@
         ]
       },
       "meta": {
-        "hash": "017ab57b489e09c25de290666a4cc3bf1778b6cc91b6ec1aa1d0bb947f9fe881"
+        "hash": "f2ca078f493b19d44dddd6556e933b056bc9fff56e493a5481c3d943b24f1e01"
       }
     },
     {
@@ -2380,7 +2380,7 @@
         ]
       },
       "meta": {
-        "hash": "84fef40153bb4de500dec68586506aebf1f061311aa3f434b7e459a5833c03a3"
+        "hash": "ff080fab7095a63d01048bca4ed77d033af852303d26668c1ee7f564db8407d1"
       }
     },
     {
@@ -2395,7 +2395,7 @@
         ]
       },
       "meta": {
-        "hash": "e0b7ba393afd4e4e9f701a065b6b39ba1d2980c4a961baf1d23e887754c2705f"
+        "hash": "fa16462c8309a49d282421fd80c995fd3f8a9debaba5e492dd4a3625eecce101"
       }
     },
     {
@@ -2411,7 +2411,7 @@
         ]
       },
       "meta": {
-        "hash": "9c35f423e20db827fdd3992c9bf5a2ea44a2f96fcf882c632527f75141402f27"
+        "hash": "c9004512c957ceeda55d851452ad2b2d59235648272222fd36ca75d98965f0b6"
       }
     },
     {
@@ -2427,7 +2427,7 @@
         ]
       },
       "meta": {
-        "hash": "13d2c88a463ecafb88daa204c6553a407d603f13429f7a4118a735fe06dd76ef"
+        "hash": "e47bc176d868f3aab83f762997bf9d355258607594648573d2482faf7fc08826"
       }
     },
     {
@@ -2443,7 +2443,7 @@
         ]
       },
       "meta": {
-        "hash": "757f595af7b08257bf162cadc121fb8507c7ce86317abcaad8e6ea785443b0ad"
+        "hash": "ec55fd2848f1443613e33d59634ecaefc9dc82b721424b5416830a7389e1ce6e"
       }
     },
     {
@@ -2458,7 +2458,7 @@
         ]
       },
       "meta": {
-        "hash": "453dd444f658923f0859fabe9bd297e36460d52374929af99f770c595c40ca92"
+        "hash": "fd508fc1174e19116709b5979af67b3bcc48100b19e5a87e15b9545ba0a56d88"
       }
     },
     {
@@ -2473,7 +2473,7 @@
         ]
       },
       "meta": {
-        "hash": "09f9703d5ca502accfdbc7e44fdbe4ab43a53f49bf4beae6ddb8a853355a9c98"
+        "hash": "ecce7adac512977eb9a1f6ea9644c1e1318ca8611512009fbd55ea38519aa1c3"
       }
     },
     {
@@ -2489,7 +2489,7 @@
         ]
       },
       "meta": {
-        "hash": "edfe8a7845b27d27bb6c9f1044225147fd3b4496f782fe9b5747ccb80ea05fcb"
+        "hash": "5c6e6defd17719973b507d6c55cf00f958ea92ea3c55b6d9dff6d0441f53dc9a"
       }
     },
     {
@@ -2505,7 +2505,7 @@
         ]
       },
       "meta": {
-        "hash": "1c37d2c72a52694dee04dac99a7f54626b53a7f35921804b93ed08f433c773de"
+        "hash": "06b78776522f9e213357c031e21568295d7a528871fe05781ae2ac4f7e5d8451"
       }
     },
     {
@@ -2521,7 +2521,7 @@
         ]
       },
       "meta": {
-        "hash": "4148719d9c7db0b906695a763582e37117fb10da2128ad85f61a2d1c7c58f98e"
+        "hash": "c3424342e1ccfaff2b8f0b0727595fc2cd8063a185ecc42708fa41a2a7c25fc4"
       }
     },
     {
@@ -2537,7 +2537,7 @@
         ]
       },
       "meta": {
-        "hash": "39cad3beb4b785ece34ffdf1b421c0d2656ea2e3938560029c91201f0d2d849d"
+        "hash": "8a9ef17eda1a977bdd1149a4a782d7d0e7addd8c6db8d4bd3734c9269863b12c"
       }
     },
     {
@@ -2553,7 +2553,7 @@
         ]
       },
       "meta": {
-        "hash": "527563bf31b2d48471725d2e5e1ce0fe373fb4e43400ba4ab5292de359d48f64"
+        "hash": "aafa416b434137db2540668a13e8a33138cb04d652f29e8793a6c76b6a62983d"
       }
     },
     {
@@ -2571,7 +2571,7 @@
         ]
       },
       "meta": {
-        "hash": "4866836ea1c832caeda50a546451012d72b6f9910922bd47bd5fdddc472111df"
+        "hash": "2df9322464af125f8a33dad1f15a7df5ccd7d8f9322efe871dc026974971ac85"
       }
     },
     {
@@ -2588,7 +2588,7 @@
         ]
       },
       "meta": {
-        "hash": "9888c4b9583102dbe9b994a88f3ae66f91cd25d254179b5cdc2156e5540400dd"
+        "hash": "3edbaa911db73b703d8af9a0681a18f4c61d65db15cbd5812b78ecd3ac364cef"
       }
     },
     {
@@ -2604,7 +2604,7 @@
         ]
       },
       "meta": {
-        "hash": "4111aa90eaf50458f3027fcf2a1d6087d514d73883cba21e404fe3abee4330a9"
+        "hash": "a8199a2ae7965f48651bc7996e810423b2de44467204d481df54f7c8fa2dd44e"
       }
     },
     {
@@ -2620,7 +2620,7 @@
         ]
       },
       "meta": {
-        "hash": "903bd2bd6ec7427a009132313eb83f297793eb5d091d3f3e7f6ba7d9ac1ee34f"
+        "hash": "4accb95c8fb5ac770c73c78b6236938773499c74617df09a1f73a60abd6f44d7"
       }
     },
     {
@@ -2635,7 +2635,7 @@
         ]
       },
       "meta": {
-        "hash": "4264d14eda0f35cbfc392fb32e652258b238955a75b1fcd8e96f84efc376c1fa"
+        "hash": "b916ab345483f3d11d921f5f54da89bbf1c724aceb1d1c16f5b7365794da6e0e"
       }
     },
     {
@@ -2651,7 +2651,7 @@
         ]
       },
       "meta": {
-        "hash": "750e4e393fa1238425cbb6395fa4f66644ce834aa0f1da11c973625d0d063feb"
+        "hash": "5e2955867dd0b233a65bf95587e4a190da61629a4cba61e270d36e0a26c7946e"
       }
     },
     {
@@ -2667,7 +2667,7 @@
         ]
       },
       "meta": {
-        "hash": "75054eed566f7b778e9ff3a74ef312191fa94654dbbe91179889e8491326e69e"
+        "hash": "4a29ea0e99857a128109e6cf7d1120bc4cdb6b05be2ce4602715e6c863b1cc3d"
       }
     },
     {
@@ -2682,7 +2682,7 @@
         ]
       },
       "meta": {
-        "hash": "5526bb700ba1f479579c15409c9d0c2adad023d09768009942573e31bb6cd9a5"
+        "hash": "8599f274909a26bd17178514b849ee803959f3c69207fce2951923d1719fbddb"
       }
     },
     {
@@ -2697,7 +2697,7 @@
         ]
       },
       "meta": {
-        "hash": "c95badc9344879a41cabed9dab5064ae1f3e67e9ef4605f1b1ea2f1ae92cee6c"
+        "hash": "aaf7f8a0beaeedb11a5b13b304fa1c51eddf66e103d2b44a1c3648de39fd1e23"
       }
     },
     {
@@ -2712,7 +2712,7 @@
         ]
       },
       "meta": {
-        "hash": "37a1c9fe022a4806af443099471f264451b5885bc0bb974d54c84b1d3bf384f9"
+        "hash": "6ebaa03264b6b2f637f8380b8796ebdc820a2031db72fcfd5d6d657af79b496c"
       }
     },
     {
@@ -2728,7 +2728,7 @@
         ]
       },
       "meta": {
-        "hash": "0c8c208877079c6d2d9d86bfa4f5de5b911b580680a4a7c6ea2871e133b38631"
+        "hash": "0f90daea28e858946e4c2cb642a84189b47872dfe42c29f708b0aedcf76bc8dd"
       }
     },
     {
@@ -2744,7 +2744,7 @@
         ]
       },
       "meta": {
-        "hash": "ddf2b0fa76d61e808a1e2a16ec58ebb7ce92f95f452b2d32c7902afd38fb7bf2"
+        "hash": "3b695d9ce6aa94aea1a367fba124a615d0132c8894e702f96e042fd6e6349ac1"
       }
     },
     {
@@ -2759,7 +2759,7 @@
         ]
       },
       "meta": {
-        "hash": "e407c0fbb1c1d54fa8ba1dab0bd1f9f02834c9fc37961ff70d6ff96e3950608b"
+        "hash": "f4b7c801ff0d3a23d10d2cb4de23d63e0d1dd09cd0d014c414a81c5628b8ff8b"
       }
     },
     {
@@ -2774,7 +2774,7 @@
         ]
       },
       "meta": {
-        "hash": "6b977bb21dbf98b74bbda83539ddb5c2f17fdfd560ab724d6f994cb293334c90"
+        "hash": "6b2bfb3ce5798f702332f4cf14749b4b044fe7de6ee1d79bc786c1e3fe704dbd"
       }
     },
     {
@@ -2790,7 +2790,7 @@
         ]
       },
       "meta": {
-        "hash": "6b33ef8f2b82cb0d5b57c4f2bc7279bb00bdc3a63f6c8036733e7efd4f160ca5"
+        "hash": "8f9400b2f8204180520e4cb2d2150ea515eb704d684f483377ba3e5513268bb0"
       }
     },
     {
@@ -2805,7 +2805,7 @@
         ]
       },
       "meta": {
-        "hash": "085152c359856ea4c13ef70f136969d8ce554b21b27164cd04d08f93a6051636"
+        "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
       }
     },
     {
@@ -2822,7 +2822,7 @@
         ]
       },
       "meta": {
-        "hash": "fd21c68cbc13ec625b56c4be4ed95ff8374ac1009d28906c818e8366453932b7"
+        "hash": "5b76a1a772d79233e7d8c87d903f1ef48b4c4bc52a05df4d13753ed810795380"
       }
     },
     {
@@ -2838,7 +2838,7 @@
         ]
       },
       "meta": {
-        "hash": "2eb1a4bb3c642315cdf9b5f42c413aa175bf47c6d8c4727ddf935b943a3b238d"
+        "hash": "e7b3dc5eaa43f1ccf6b4863e437b9b4b275ec79fb18623a4c3d0e6ec300d9bcb"
       }
     },
     {
@@ -2853,7 +2853,7 @@
         ]
       },
       "meta": {
-        "hash": "be54f449bc8ff1e0ad9523f41b0f108c1915018a1ae43fd02754e21628097b08"
+        "hash": "e39f9d9a330111b1aa8c32545a9fcb20211563a8f25fdbed2abfb2ce6defad62"
       }
     },
     {
@@ -2869,7 +2869,7 @@
         ]
       },
       "meta": {
-        "hash": "5b913a0a63e4ec2a745c24e4af7c0dbe044c308a2899fb4535a382520afeb4d3"
+        "hash": "31f59a2480a0c840666af05f87ede6b169aece233b0323e9f03fd79ac7d4bc44"
       }
     },
     {
@@ -2886,7 +2886,7 @@
         ]
       },
       "meta": {
-        "hash": "1cd853b4a92ae93fd5751e1476ae61e5c064cf9fdfd96450c6129e2493104f40"
+        "hash": "1277ce52444adcbc3a7b62d5c9019aa3cf01293e7749b8d0e1871ae2aa6a8c88"
       }
     },
     {
@@ -2901,7 +2901,7 @@
         ]
       },
       "meta": {
-        "hash": "2be5dca5faf7c6f9c58342632db149469c79134820645deaa03b0c3dc6922a27"
+        "hash": "5a7033d47335bedd0239adab9cc2f112a311c28398d46da2bc2196fe61c9ce78"
       }
     },
     {
@@ -2917,7 +2917,7 @@
         ]
       },
       "meta": {
-        "hash": "b0dc3c84b70f6a45c0fb3f292fb2aad7923d88a6026703be6ac79113250b4ef1"
+        "hash": "ab83bac8546d02dfe4227792750f0b4c64cd2c8f8ce6063eef2a3f4357210d63"
       }
     },
     {
@@ -2933,7 +2933,7 @@
         ]
       },
       "meta": {
-        "hash": "8ba6bdab4591d8d7ce4fcfaa5151d07b60c7df6e632c540fd5f676388de38ffb"
+        "hash": "3e721dd4b5fc9a41ed7f3ae6eb888848c8ae557a0feea28f17f945a24ab677ae"
       }
     },
     {
@@ -2948,7 +2948,7 @@
         ]
       },
       "meta": {
-        "hash": "b0da4d48a96e48f9261fa03d1a8da3367db7093781ec35b8bbf10fc5ffd9146d"
+        "hash": "46da170d5f14d8070725e9f31e5b24de72aa4b0b476912d602e0480400638c9c"
       }
     },
     {
@@ -2964,7 +2964,7 @@
         ]
       },
       "meta": {
-        "hash": "71290432b76b6857278cdf2c3b656d661df5936428fa6e9b276d4251323ea985"
+        "hash": "3afc30c02480be79ae5fb41e05ee2b1cc6f3b408ccb64a1a192d0ad34148ede2"
       }
     },
     {
@@ -2982,7 +2982,7 @@
         ]
       },
       "meta": {
-        "hash": "f66ca9423759cb1084231cd4f0fe275b766ef64bc78fe4c9afe09d6eece76b3c"
+        "hash": "c4df98d941aeadd165c6a02143d79f7a9bf013f8c221f709aa545bf83495a956"
       }
     },
     {
@@ -2998,7 +2998,7 @@
         ]
       },
       "meta": {
-        "hash": "c3e8200967ffc973f3aa5eefe79b0a5263e2a740003fc73640d776adcfe92e7d"
+        "hash": "3853716eb171ac10f5b6dbd0b6afda1342262de305336cd0effd43dc75592f3c"
       }
     },
     {
@@ -3015,7 +3015,7 @@
         ]
       },
       "meta": {
-        "hash": "d078ae6f6c57027e6e53ca898cac1c7050a5c8676eb6785616b7adc953edd9b7"
+        "hash": "20da2d84848993791b963b0b44a1bbe6746259a6c40675e477a6f0e4ed449ab5"
       }
     },
     {
@@ -3031,7 +3031,7 @@
         ]
       },
       "meta": {
-        "hash": "f107df9c4fddc64bbb78b3fb6a3285be4002b60e83619b5325980ec9a1de23b1"
+        "hash": "45206aac5046169bce32aeeb14785735eb11b42e0bf8d3911531ae1ce6a56282"
       }
     },
     {
@@ -3048,7 +3048,7 @@
         ]
       },
       "meta": {
-        "hash": "45598b4b398b946efb0e037258dc8251c10af6075fde11cf1dff91b3fb7c3234"
+        "hash": "27bc40621fd8cb1b6ded57d7bbbbb33590d889ff87a5e418ef2c0ec6e4005505"
       }
     },
     {
@@ -3065,7 +3065,7 @@
         ]
       },
       "meta": {
-        "hash": "a045d114577548ab932a022c5bb42d8aeb40c82667e34744468781f86a937d93"
+        "hash": "bcedf0ea886a7ef2c3a4a925335f087c0bab2e2cb3eb4bc5843f7951cbd5c798"
       }
     },
     {
@@ -3081,7 +3081,7 @@
         ]
       },
       "meta": {
-        "hash": "b28b5d8280f1c93b2da6c8aae3d4319fa4dfcbad9eddacc4c9744b817506d6d4"
+        "hash": "dc618772c3321607f451b13b124358fd3207f81fbeaa7f2deb3b7cd1da671175"
       }
     },
     {
@@ -3097,7 +3097,7 @@
         ]
       },
       "meta": {
-        "hash": "8c8ad12415ca77ab4e346e52551d0b3518d69cc8449931f105912fef3469ddcc"
+        "hash": "888b1addde4cd2fa6137733130e9d847a87299d6753ddda5c8dd8c94b542db80"
       }
     },
     {
@@ -3113,7 +3113,7 @@
         ]
       },
       "meta": {
-        "hash": "a67d3f94f7fde42be197e13aeb88fcbe64774bae6f732b19a84df764a3a9208e"
+        "hash": "bf0a5bf2fe4d28262fe7e8f3eec16d24c05a177b06d20937db413c0d404cda12"
       }
     },
     {
@@ -3128,7 +3128,7 @@
         ]
       },
       "meta": {
-        "hash": "106ad76871f109faca35b0b89f432d24f56b88127fcbf291da4993fc9e05a455"
+        "hash": "451dd1fad58f3d4984363426a0f77e9a26697f6be944d53ed82d32c71849280e"
       }
     },
     {
@@ -3144,7 +3144,7 @@
         ]
       },
       "meta": {
-        "hash": "4a493ba755b98d89d8dd2a08023fed53d9b3a958f531789a1073ab026b58652d"
+        "hash": "cda4db6e9da35706f6e4b13f2860a210433c8bc2ac6078f9ff63aef6771c72d3"
       }
     },
     {
@@ -3160,7 +3160,7 @@
         ]
       },
       "meta": {
-        "hash": "012f13ebfdac1cc570e775255b6001a349513dcefcb018ea072c2400c6dabb3f"
+        "hash": "f9db07575860cfcc7fc619788c33821d7adb390d44b68160d6e561bfe41f7316"
       }
     },
     {
@@ -3177,7 +3177,7 @@
         ]
       },
       "meta": {
-        "hash": "a88d5c763dd4cd1bbaf842eefe8a01c02f8e214506e38aeeec056e8925727e7e"
+        "hash": "4c4ea74f666a35184db36bd5084614743446091a699086a5e5280ac2891be1c2"
       }
     },
     {
@@ -3193,7 +3193,7 @@
         ]
       },
       "meta": {
-        "hash": "e6e87f621d9bd69294a345c9470d963ebf798b0eeff3cc0ee666cb3cec829f9f"
+        "hash": "cf59c98e2fc56230399d301d1e3645dd5961389c5c361d763e4a5fce01d22db2"
       }
     },
     {
@@ -3209,7 +3209,7 @@
         ]
       },
       "meta": {
-        "hash": "402f5830b4ba4b1323e12f394d666c301f57e7f960a6ab4b47a31e20226c367e"
+        "hash": "65bcfbbf3937f35f591285306ec3bfbee46a1738a6a8f097c99bf07150aec198"
       }
     },
     {
@@ -3224,7 +3224,7 @@
         ]
       },
       "meta": {
-        "hash": "b1554b67cbb52506396dd9a73afa120a12e7d6bfa931d47be25dd54b236d47e1"
+        "hash": "120e31fa38796906a99beccdc457e83a8075e6ec72b5a937e03913b2e996ae26"
       }
     },
     {
@@ -3239,7 +3239,7 @@
         ]
       },
       "meta": {
-        "hash": "94d40de94d757fb0871782c64062dee9a5e85d412d8c897ff1f172eae29749ae"
+        "hash": "20deb11c89b14b294b13f9846fde62e4a9ac8df0a71553509431b16b5c88d24a"
       }
     },
     {
@@ -3254,7 +3254,7 @@
         ]
       },
       "meta": {
-        "hash": "0a86c558a550204d92db07a291dcbb0795476fcadfbea5c9494c16b0b14e193e"
+        "hash": "6133ec3409b8c18ccfc89d857149c7875eb4733803772b43743df3b7c51bd02c"
       }
     },
     {
@@ -3270,7 +3270,7 @@
         ]
       },
       "meta": {
-        "hash": "532864b242c1686e53b8195220ff16296bf232b826338e37aada325ffb180824"
+        "hash": "3c4f99f0a0b9d2103e7ed3553bf7268475135603aa46d2eae204d3f34fe51ffd"
       }
     },
     {
@@ -3286,7 +3286,7 @@
         ]
       },
       "meta": {
-        "hash": "06b3572f9804d2eeede2d13f9f17427e7e8430c92be6e99581af3c1fb37bdd78"
+        "hash": "a11f7bdacee4978a1cc579091b04a912962a239dc7bd442518420a4d39c290d5"
       }
     },
     {
@@ -3302,7 +3302,7 @@
         ]
       },
       "meta": {
-        "hash": "354a5582a041aa94bacc5aa7f086972261abd23748d7256b25350e3db89cb1b8"
+        "hash": "1885078f5fddc5de00844a837ab3c427f770c5325a70d5362ecab26c1c904125"
       }
     },
     {
@@ -3317,7 +3317,7 @@
         ]
       },
       "meta": {
-        "hash": "626a0a363fc568fa738e5f39b12b9e70a0683ab564a94b957e827265a5f219ea"
+        "hash": "51af30db5952a0473fe9ae72c338b974a88813cbca522ba56d0dc3b4ec6fc51c"
       }
     },
     {
@@ -3333,7 +3333,7 @@
         ]
       },
       "meta": {
-        "hash": "49fe52aac2183f2166ddf62026f8f9a1247a328ebec1d362135a745efc5d8f90"
+        "hash": "99537507288f1e101bfc0f80ba708b415832b27ce060033fbba8bdfc32cc3cea"
       }
     },
     {
@@ -3349,7 +3349,7 @@
         ]
       },
       "meta": {
-        "hash": "87b356d66c3e46065b562ba3bf3ea66e10461d1e5ea7f2cb31c188f2d8863ef9"
+        "hash": "ed97cd30b8004ca41939fabebf535f9017868b261ded4c2081c3367fa0ab1847"
       }
     },
     {
@@ -3365,7 +3365,7 @@
         ]
       },
       "meta": {
-        "hash": "f0c906b0a872d14cf474756a86a646443580c005a947da8d0af9e48932589317"
+        "hash": "98673c6d6bebe907c0ac285f342147f30de01bc326feb5109b6d25739fe473aa"
       }
     },
     {
@@ -3381,7 +3381,7 @@
         ]
       },
       "meta": {
-        "hash": "d2635dd38b8e45cb4d5ee367946c3fc42c8889889e4a2476e2ab3bf43744e7c2"
+        "hash": "ab081473a5589edddab0b641758744ee5a65bf43cb93eeca23f48e86e0fdbb9c"
       }
     },
     {
@@ -3396,7 +3396,7 @@
         ]
       },
       "meta": {
-        "hash": "66fd11461785a61039569a74c4a105364cb3e955d1b3cae3a16c016f965c5936"
+        "hash": "87cd3d6c458b2ecbb373645230a03c7e0770ca3991c635571ffaae5d7a40987c"
       }
     },
     {
@@ -3412,7 +3412,7 @@
         ]
       },
       "meta": {
-        "hash": "e017fc7333fc1e16280cb0a9f228f910f960be016b754b6a10793bd9b782c44e"
+        "hash": "64c941025c6bf130b6b6639427cf64c8af5759734118efbbbec9e8d490845a10"
       }
     },
     {
@@ -3429,7 +3429,7 @@
         ]
       },
       "meta": {
-        "hash": "aeb8920f3322ac49ce025d921514de914e7559d235e3842a34108e07c9f2b551"
+        "hash": "2119b62768ca88da15cef3bb1671c65a557d81f224c846bdaa6a75d320577366"
       }
     },
     {
@@ -3445,7 +3445,7 @@
         ]
       },
       "meta": {
-        "hash": "0a44adda6ccfbf0d8831533d2bc52791c880975710e5af333bba928e06564eab"
+        "hash": "37b8c9323006f3eb66cbfbe240d5020ef0896e312e9f1ed949b200a767324877"
       }
     },
     {
@@ -3460,7 +3460,7 @@
         ]
       },
       "meta": {
-        "hash": "207f55af7db8c445e754dcf7e03d45f10cdff2a22ebd4a0b684e5514b2902704"
+        "hash": "61603245edccd32edad26ecdbf39d3c8d99bde8d2672a1a392508ca9c30c6d22"
       }
     },
     {
@@ -3476,7 +3476,7 @@
         ]
       },
       "meta": {
-        "hash": "6a0a26b90aff163b4bce7f9e4ca69fbeb49971a13183da00907cb4a3e2fe4312"
+        "hash": "f12c78c23280839489bf4dfae847eeab3ceb72fef326b5bca3f2ed1bdcc44ee3"
       }
     },
     {
@@ -3492,7 +3492,7 @@
         ]
       },
       "meta": {
-        "hash": "3f4ae691f4ba13abcf54388e2897eb67852320ab339d349bf0077d0d44c331c1"
+        "hash": "a53f86761dacc7d0bc184c304dd2e59461a393d45214212d17d02a8df94144b0"
       }
     },
     {
@@ -3508,7 +3508,7 @@
         ]
       },
       "meta": {
-        "hash": "9992a09f3d2ac7aa90d182e87f6fcb3a194683121013aa09e8a165623496db97"
+        "hash": "ac660685eb10f64c7e573d0299936ae0bb562e531b2f3a76b048e3bbe9605bcc"
       }
     },
     {
@@ -3524,7 +3524,7 @@
         ]
       },
       "meta": {
-        "hash": "91fc50c63b8230ee4f6d007c5d8f323a20c11ccb13c27651023175a266b8ba6d"
+        "hash": "8aa05f5b221bb24bb52cf3b75b6087ca664ede628a8cfff2b3193ebe67f6b2e7"
       }
     },
     {
@@ -3539,7 +3539,7 @@
         ]
       },
       "meta": {
-        "hash": "942e782f93c1c3e465fc62c6f0bf003c8b5956952c767b784a0c723a3f8e6365"
+        "hash": "04a1e9e83ff8bb138a86e7bb060a19de2593bc4054ce48cfef511eec1052edbe"
       }
     },
     {
@@ -3554,7 +3554,7 @@
         ]
       },
       "meta": {
-        "hash": "c74f0cc1ad16d08f328893f8ec5a0517d4aa2a047025a4b334b6f75bb5209ccb"
+        "hash": "1cb29029bb6d17d5ab853b7f932e39e56639d294d732eff00d621fcffb24adb3"
       }
     },
     {
@@ -3570,7 +3570,7 @@
         ]
       },
       "meta": {
-        "hash": "3cb5372f26fdeb702119314674734dde44d3152b5c2cd04376ec89c3b9f2146e"
+        "hash": "c25aef075df93042a81bd98ebd7b77aefb91df3f08b9f1d2e7859ec0d95ad55b"
       }
     },
     {
@@ -3585,7 +3585,7 @@
         ]
       },
       "meta": {
-        "hash": "b023646e12856690040c14b2a68dcc0748d8821f13b9a213e6e5c36da105c5f1"
+        "hash": "fc0a07189064e1026c5a350923b1aa833523c2755eef1d66f9567a15caeebdf8"
       }
     },
     {
@@ -3600,7 +3600,7 @@
         ]
       },
       "meta": {
-        "hash": "efac2221f3e2fc82c5e1eecebd08b1a89ae19982c353a9e5002af729ce45c1b0"
+        "hash": "4d3cd9630e00f8c723b8321f1c17d17c4c7d0b7ad025dbafda492897b8300a24"
       }
     },
     {
@@ -3617,7 +3617,7 @@
         ]
       },
       "meta": {
-        "hash": "a7e93f1fcfea5d9bb1f28889a05c023b5d7ab77d8f9d1ceaefb607c5a6e320ed"
+        "hash": "fdaa6d4470e5bb113a2c20008652bf0030d23fbee789ca6c3c4ce0c9be9ae700"
       }
     },
     {
@@ -3632,7 +3632,7 @@
         ]
       },
       "meta": {
-        "hash": "e1ab4e8cd76fb8b5a17d5994be97a77294b2225f711b72f19d294c8e76a8a6c4"
+        "hash": "6fb26c1c3157de2309d5fe08354345d9bd18d175cc29e049cc5f19363f7ed374"
       }
     },
     {
@@ -3648,7 +3648,7 @@
         ]
       },
       "meta": {
-        "hash": "a39a1384d20d1b7d7766981739e048873e2397038f2ae4022c627c2507394306"
+        "hash": "11c74727c481c0067421afa2864b55b2a40291916ff92529542f572da0e8b8b5"
       }
     },
     {
@@ -3664,7 +3664,7 @@
         ]
       },
       "meta": {
-        "hash": "689fb9ba264351fe0262bb13c67a7d01fa1b77421e4903eaf9c8694df629b4f5"
+        "hash": "d8d3bc54bdc1ba649c052658a09ddd415ad88a30409d13489b32684c150cb799"
       }
     },
     {
@@ -3681,7 +3681,7 @@
         ]
       },
       "meta": {
-        "hash": "801e06861fb1a79d5f9de2d575a8321c8ab3f22ce3732cce2a4d1e1a49efb580"
+        "hash": "19851ac642bb32dcc56042f8e4f15184b293e300bd818a07573b8e23d1a1d06e"
       }
     },
     {
@@ -3698,7 +3698,7 @@
         ]
       },
       "meta": {
-        "hash": "2ae867ee87d3921269cbe771886c349f981c325a69af8fe3e1b62a40d1e9f475"
+        "hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
       }
     },
     {
@@ -3714,7 +3714,7 @@
         ]
       },
       "meta": {
-        "hash": "e095b9c8a733b1eea87323c354ec9880d79e6e3238d9164fb9111bfee11a62e2"
+        "hash": "dbdae1e05f13477865039be627fcd258943cbf2d7926e160de74a3ab5244dba1"
       }
     },
     {
@@ -3729,7 +3729,7 @@
         ]
       },
       "meta": {
-        "hash": "4793f68754b84bd85197d5577fc7fb4eb431946cf438a0c25e3e7f317aecd1c0"
+        "hash": "3bcd52927608bd59de8e20369fbd51f39b99d77b19f66de4de8bbc80140ea009"
       }
     },
     {
@@ -3744,7 +3744,7 @@
         ]
       },
       "meta": {
-        "hash": "24ae58cf3c2095792cd7cbe72cf548ee05c032e5b7a2173a57d80f79f143407a"
+        "hash": "b19b526319caff44e7b15c3126128701dedaa76b74cedb50761003268676b5b6"
       }
     },
     {
@@ -3760,7 +3760,7 @@
         ]
       },
       "meta": {
-        "hash": "0e954472a648809ebb2ae7682bc2b2b68feda1198176fd27362ea6b2336643cb"
+        "hash": "6668f37f9f1158b2bdd292ad64defea6e33a0b2908ea1e494b191dcaa9f039d6"
       }
     },
     {
@@ -3777,7 +3777,7 @@
         ]
       },
       "meta": {
-        "hash": "21bea20f75370e46f646bd1ad042a6b998859b4fb92e2e85e526e2d8f31c1269"
+        "hash": "e752de4a4f2b339851e796a5289e7adde51cf7e672b8230fd97bf79cf7330758"
       }
     },
     {
@@ -3793,7 +3793,7 @@
         ]
       },
       "meta": {
-        "hash": "23239e0ae5818b195c8875702f9734c0172dffb7d6fa775b50252ece82da3a13"
+        "hash": "8c11b6647c91c22969f8c568cf248a9c3c5b08323fe9491c3fad2cbbce90a8ac"
       }
     },
     {
@@ -3810,7 +3810,7 @@
         ]
       },
       "meta": {
-        "hash": "55a211fb9ee3b4cac66a40ba66f9d7ea466181d16cfd049e80a3e7032d67bd02"
+        "hash": "a6fe92925d4c25fccd29ae85d1c2004f88c73222099091ce30824a917a2fcfa2"
       }
     },
     {
@@ -3825,7 +3825,7 @@
         ]
       },
       "meta": {
-        "hash": "db7f0dd117a98eacfc835a644378736c21000fd65a9e49d0f95935eaca996d82"
+        "hash": "5d0655b4a4c1008dbfba8b4e59ae7144dde6ac98f2fcf0a60f4d80135d8feeba"
       }
     },
     {
@@ -3840,7 +3840,7 @@
         ]
       },
       "meta": {
-        "hash": "51e01a10797899a31b9071ac1834a01f8c911d1a0d5e97dae8873a9fc7df3bb8"
+        "hash": "dacbce5a4a058056f0c33a7975c4bdb586037223f6713d2d27379c9cb2eb93cd"
       }
     },
     {
@@ -3855,7 +3855,7 @@
         ]
       },
       "meta": {
-        "hash": "ff9c2d529aac684e1be07e85e0b038a15976fd4110988c38ea5dba88623a4abb"
+        "hash": "760685e275cac5e2b81b035cfd4799eb8e39483d56d5a483a0a04e19bf46a29d"
       }
     },
     {
@@ -3871,7 +3871,7 @@
         ]
       },
       "meta": {
-        "hash": "491d9a1bbb209f949e584cb5c7cadd8f569c43320aa8b01ad41df6462e371104"
+        "hash": "5166b5b5b9812d42c50364953ceb2311cafad66eb8881f21ec7d949396e6effb"
       }
     },
     {
@@ -3886,7 +3886,7 @@
         ]
       },
       "meta": {
-        "hash": "95f0387709679bedde35b88cd1a01c6735f5396484b6335b3013280824454f82"
+        "hash": "1a510a46746f7ea0eafcdc6a06eec78da731788311ef42a70e3a42c2a4080f60"
       }
     },
     {
@@ -3902,7 +3902,7 @@
         ]
       },
       "meta": {
-        "hash": "e4d04f46463e015d57a5de2ee979a4a44c5dc4d443ed3f6de41cd60542cf3189"
+        "hash": "42788f8392f5511db3641dbe2ab92b2c043b3b5209e95c386c73e5d96eaa63af"
       }
     },
     {
@@ -3919,7 +3919,7 @@
         ]
       },
       "meta": {
-        "hash": "a591d8b52d3fda503e8363c0822d1fece87b3738f74a11135489e3442fba3f03"
+        "hash": "7bff02cd849d994da1229f3153cca71b4c054d6774ab732101a5f60a0a04ba3a"
       }
     },
     {
@@ -3936,7 +3936,7 @@
         ]
       },
       "meta": {
-        "hash": "085e5c5ff68151cddf7feb04929c7522e78a6f7008c74089daa821e2f845aa60"
+        "hash": "8d8cca3d593e677c8a4ffc17e9f97b3018f800e7c014daa3462edc152fbbeec7"
       }
     },
     {
@@ -3953,7 +3953,7 @@
         ]
       },
       "meta": {
-        "hash": "3ca3cc3b6bae804c2184cd3548791bd4e3fa701ecf904a46e6982e813e255362"
+        "hash": "c86e3227e32565afb301805798da3a46756e13bff0115b880fcc3175a58d95af"
       }
     },
     {
@@ -3970,7 +3970,7 @@
         ]
       },
       "meta": {
-        "hash": "3324e2a4ba6ec4d6064ef486bf7dcf72bc52ce46222b0e9580d9c16c06ad26d9"
+        "hash": "d84f789a1b8a11d0fa4daf8e5f015e9839340adfefbc210e2304de8d63649f9e"
       }
     },
     {
@@ -3986,7 +3986,7 @@
         ]
       },
       "meta": {
-        "hash": "933193aefe648a9269c542b816e28171aaf042f32ee6b045c157ba1e20e6cfa1"
+        "hash": "5f2f2e33d269de787a1aaa245c6324030cc5cbe8345b46352a218f3f2453c220"
       }
     },
     {
@@ -4002,7 +4002,7 @@
         ]
       },
       "meta": {
-        "hash": "9c5af9cecb532126a2bb07d8e963c53a6ff6e7d9ea2f2b58d84bae752e5889ff"
+        "hash": "b780a5af9c22faa9601191aff53c24d55f5e88b62ac79fd2e02517f9a724b502"
       }
     },
     {
@@ -4018,7 +4018,7 @@
         ]
       },
       "meta": {
-        "hash": "f2520d4ce2bb10e791172f56e710ae5e8eca833c0056a1971770cfec1b207345"
+        "hash": "b5eb860bad14f54d114103321b8135e474057c63b703dfb06183a97530af402f"
       }
     },
     {
@@ -4033,7 +4033,7 @@
         ]
       },
       "meta": {
-        "hash": "1e54e88b1bf869e6ad9d1eabdf9b435f0df278472b8ba17a6cd10874787bd035"
+        "hash": "eb9a81be04298dc36d5b01dbbff22b9aac19d5ef1f1c752ef4c48e6a2cc0ea32"
       }
     },
     {
@@ -4049,7 +4049,7 @@
         ]
       },
       "meta": {
-        "hash": "e3deca71de3504628af78f647366bbd8229f7340a98319583e2cbeec7b010de3"
+        "hash": "276b7cc7252a0c5202520e4903d8083153240ca6fd035eb709eaf5bf6cc1eccc"
       }
     },
     {
@@ -4065,7 +4065,7 @@
         ]
       },
       "meta": {
-        "hash": "5aa0c74fdcd007ad744e305c081e92f85b58cba65becf61d185a739183d4e4e6"
+        "hash": "4da6106d2a999166888ef3f2d1cfaa3b32666ef12bbdfddac832cd0b8c7404d4"
       }
     },
     {
@@ -4080,7 +4080,7 @@
         ]
       },
       "meta": {
-        "hash": "74726cbaed0b640625a4e7490a5a02dd4b0b37ef44810c4e2e4d2289c418e158"
+        "hash": "dd81177b97db5628ce070cf138e38f6c51ecb82790609e2b939c45b769942407"
       }
     },
     {
@@ -4095,7 +4095,7 @@
         ]
       },
       "meta": {
-        "hash": "f517d3f98a3936e76bdf8600349b7f11b3aecc050aab3cef0e6787c088e4eb4f"
+        "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
       }
     },
     {
@@ -4111,7 +4111,7 @@
         ]
       },
       "meta": {
-        "hash": "ed60bea0708a82dc49ae81fee1abdef76686f1db3a01f2ca0b84315f820ee142"
+        "hash": "b557e3d59a04dac19161e9d69b5c347a758ad491c2214d56437d1592614f6944"
       }
     },
     {
@@ -4126,7 +4126,7 @@
         ]
       },
       "meta": {
-        "hash": "5b15a629b2d460b6fab5a5aebc7f34c950768a6b2cb39ef8155213d07dee45ac"
+        "hash": "d425dd9806d3ae9b3ac08404c43cf28c48084835ffbce5fbd01f04ee1d7a7e5a"
       }
     },
     {
@@ -4142,7 +4142,7 @@
         ]
       },
       "meta": {
-        "hash": "9da8bdbec4cbacdf94ca37ef353266e32cc8a249bd59f7b36cf4b7d9cda8ff2d"
+        "hash": "f608179567e28f0c7de78fce112c5dda6cf01989f9d8499119c80bdd119b0c8d"
       }
     },
     {
@@ -4157,7 +4157,7 @@
         ]
       },
       "meta": {
-        "hash": "521c70b2f2dff91faaff89c3b6c577e8aa467d54dcd2c42b00f318a1e6929dca"
+        "hash": "592446fabae44d631396de3441738710626c4d274eaabe3dfdb9b822ce3a5179"
       }
     },
     {
@@ -4172,7 +4172,7 @@
         ]
       },
       "meta": {
-        "hash": "aa3ecd00b757c4e84f3450c97b0ecb66c5ad661bda9515e735bfa2a5f9fdb4e1"
+        "hash": "8e1d9b3d05e81deb58e6608a0dbf9a336deb73e17820490defc4e98b1febf8e1"
       }
     },
     {
@@ -4190,7 +4190,7 @@
         ]
       },
       "meta": {
-        "hash": "1f749d57291f610c6380012dc78913edb7d7a7b71f55a1606fc618e691e68938"
+        "hash": "e8e3b0389a64049fccb2dec854868d94ce03c2ff9e9fdcef9b9b5e9477a7602b"
       }
     },
     {
@@ -4206,7 +4206,7 @@
         ]
       },
       "meta": {
-        "hash": "6db84d84544102f610a0a15e1397d924847641ce498592dc6dcce063e40afa00"
+        "hash": "0999832f2ad6dd8f9726494cffed82f85db80121f81b7d7ba43f184911abaf05"
       }
     },
     {
@@ -4222,7 +4222,7 @@
         ]
       },
       "meta": {
-        "hash": "91ad0dd9346dae495eda8f582d172261f2742f30e69b683582c517cd77ca7fe5"
+        "hash": "c17b6181734f37fd452c486dc37b85500aeffeb6472874cd4ff1b71bd79288b1"
       }
     },
     {
@@ -4238,7 +4238,7 @@
         ]
       },
       "meta": {
-        "hash": "fb360301d5ee69004b94bedfb05c757c444f2e48bb72a923bf0a9f8eebca51e0"
+        "hash": "dbca8b17910aa993f1a5746193a915a46b0825a8d69210e3d99d9fbcb484b919"
       }
     },
     {
@@ -4253,7 +4253,7 @@
         ]
       },
       "meta": {
-        "hash": "8e8f218a9508afd3d1f8a412bcf957fa1de69672c33b6a1fdfe7c3c1d2ed729a"
+        "hash": "2e8250f339e49af92c10c877ae4dbc9d2889ed14bdab24f96bfda82a095d4989"
       }
     },
     {
@@ -4269,7 +4269,7 @@
         ]
       },
       "meta": {
-        "hash": "3b1c0ae1f6e1266de289f5bb290e18ba1493515057e38859d2eb5b4e5af31918"
+        "hash": "58d91b4760b4af29df95cf1b073166c02660f9af3d46c950fba64b922c999ba1"
       }
     },
     {
@@ -4285,7 +4285,7 @@
         ]
       },
       "meta": {
-        "hash": "10bdf588cc2ad6d5b1547bd68de50827b8df26c793aa9eda2b73162118df9bd5"
+        "hash": "defdaa306864196a4f561c37c4c7f74ffc159406c4538a0f7e1f3f153840eebe"
       }
     },
     {
@@ -4301,7 +4301,7 @@
         ]
       },
       "meta": {
-        "hash": "72cf967e93347774db9f22ae7a18826eacf89903e19fbe76ce84419231eeb438"
+        "hash": "8edd4093e584bbfae52b464e55a335c0af33861ee2d580d4ec005b85cd7491ee"
       }
     },
     {
@@ -4316,7 +4316,7 @@
         ]
       },
       "meta": {
-        "hash": "009fbae4f246327f079fe6ada816acef2c48b5e3b3c4d0b5793c5de6d1e8f311"
+        "hash": "8f531d87240d659970223c06c464bb1434fb3096e365d48dccb5c386a39e1ac4"
       }
     },
     {
@@ -4331,7 +4331,7 @@
         ]
       },
       "meta": {
-        "hash": "06a565ce2693a6eb5b0b78505178bebe6e04d0cbe48a809f0ab440b4898299eb"
+        "hash": "4a19fb8e2ef816c5dfa373d3f0cbcb223c34fe8fe2861f09f139edb18bfb2978"
       }
     },
     {
@@ -4346,7 +4346,7 @@
         ]
       },
       "meta": {
-        "hash": "f6e68a989853c35ee3491e35d4f04721b2bbda789007d577e646b94ae156ebd5"
+        "hash": "65d097127b81a7fd3bfbaf79e804ce09114ef4ad08e27d64fa98891f4d68cb6b"
       }
     },
     {
@@ -4362,7 +4362,7 @@
         ]
       },
       "meta": {
-        "hash": "6c42a2c08286e2289b1478536f06888b6fbd55981bc52a21ba9e47e3cecc38a6"
+        "hash": "541411afec987a2cf11bfa2d3d6a4f5f3e1b4f3e7363dd57281715bbf433cc40"
       }
     },
     {
@@ -4378,7 +4378,7 @@
         ]
       },
       "meta": {
-        "hash": "8609761438b95c3a9654c82f378dd85aa4c37515295335bf33fac8d0bb178d58"
+        "hash": "10ea54fc484a0ccc346126ff9665835da5ef5bfa6f75fdea98bfaacfb2dbb65e"
       }
     },
     {
@@ -4394,7 +4394,7 @@
         ]
       },
       "meta": {
-        "hash": "85d98f2847d65eda437b656cf76e5ca9964c021b235f8656f043fceefd2f5fef"
+        "hash": "9a8cf04ac3d6a593ef6e5169338c96feaec5b19a799256cbc26543f1fac8234a"
       }
     },
     {
@@ -4411,7 +4411,7 @@
         ]
       },
       "meta": {
-        "hash": "40b0766f31c03c088f2e8214991eb3595f4b1805b8c982e0039e05a9e722fbbd"
+        "hash": "fc085a3110ffbbfa36c63ce282a3ab59e96d101eb4f489a59b68c1fda1814c14"
       }
     },
     {
@@ -4427,7 +4427,7 @@
         ]
       },
       "meta": {
-        "hash": "2d69647f24b144e1b0f44eeb97c1dc802bfe302a1fd169400dc9e576f0bbb68d"
+        "hash": "07393d7a0e2d433b57abea9792aef5165990bf0ba81eb4e45a01cabceffdaed6"
       }
     },
     {
@@ -4443,7 +4443,7 @@
         ]
       },
       "meta": {
-        "hash": "03f1b8a9529065a07da32a328eed66576cae63570e6e05306b416c6f0bb8d3c3"
+        "hash": "e7d3354d7f5e16a3e7f26ebde9fa93a58c806f2eb7767e9f4269136a408dacb3"
       }
     },
     {
@@ -4458,7 +4458,7 @@
         ]
       },
       "meta": {
-        "hash": "618a73ecb0908fd27644f468d38fccb095cbfa7a90962329684f3045cf681909"
+        "hash": "5aaca9e4e7703fd856345cd3cd124f7db9d3d9b33fc8971ded6e0692f1a5df79"
       }
     },
     {
@@ -4474,7 +4474,7 @@
         ]
       },
       "meta": {
-        "hash": "82c817c0a9054abc71403d326027460453911ca37deb01b3f1cba56b29548f75"
+        "hash": "86849a05d8395934e7f83d52d2c70a9b9d7982db85cfc264ffb4410c03496f79"
       }
     },
     {
@@ -4491,7 +4491,7 @@
         ]
       },
       "meta": {
-        "hash": "e0b03c8a78dae5936f1c8b7bc4efd8db999f895af28de7c6756745292096ae4e"
+        "hash": "1b3e4c56abe1a9a8d3fa17798c1efc281f0294be4e2877e8e8c323dfcb4ca591"
       }
     },
     {
@@ -4507,7 +4507,7 @@
         ]
       },
       "meta": {
-        "hash": "377ff7e20fbeaa0cc33532704e5c24a120506f62c921a27c5b92f6d853d3f79b"
+        "hash": "82ced04bfc70d243245fad7f3ebf9ef5945bd102d74e77102f917687b3e53d22"
       }
     },
     {
@@ -4524,7 +4524,7 @@
         ]
       },
       "meta": {
-        "hash": "5f2384a35ac811d2d21a38d6b2123d40bb68c9caa30fe60e9f2bf5ed18b4b548"
+        "hash": "517118a841e0a4f3feb0e73d2d7012fc48c9cb655129002b399a2c5c3fd7a3f6"
       }
     },
     {
@@ -4539,7 +4539,7 @@
         ]
       },
       "meta": {
-        "hash": "a1f2b6de37cd283c80bd3715299f5cfb0c929bfd4b1bd34c9792e4e6d6b88c54"
+        "hash": "0c21e5e8c3549051085ada0effdfa8f3e19a266778967ef46697c7b9b78b5227"
       }
     },
     {
@@ -4571,7 +4571,7 @@
         ]
       },
       "meta": {
-        "hash": "3789c451767caa84f152a24d2122c7c47b01f7b3ac8a285e6be6670395f1e8c1"
+        "hash": "4f0ace59a000b0898eab157f0d5232fb8e0a19d854baf8496442a2928c15f87d"
       }
     },
     {
@@ -4587,7 +4587,7 @@
         ]
       },
       "meta": {
-        "hash": "da5a92fce068814a2ae0398bb3e7863f8a29d3c3a59e543ebf300dc92e28ed0c"
+        "hash": "f0fe3943b1ac2f0935a3a5a3b7004f88f168faebe9bb4088f4dc441a06975cbb"
       }
     },
     {
@@ -4603,7 +4603,7 @@
         ]
       },
       "meta": {
-        "hash": "40f5651f71b9f0a9fe80bd6d26a8a4bd0621f9f44d3c9a8a2c015fcc5c55f264"
+        "hash": "f3072433cbe87501a6a466eb07faad4e739a8a3ccb6c05cc177176642a57bacd"
       }
     },
     {
@@ -4620,7 +4620,7 @@
         ]
       },
       "meta": {
-        "hash": "6c0aa0490c794c72862d69205655df84c505d9c7ba7a93456c20860af18f0632"
+        "hash": "a33dbe87821f5017cf4238c69d9effcfe993698f055fec5e915f4fff68c01e34"
       }
     },
     {
@@ -4636,7 +4636,7 @@
         ]
       },
       "meta": {
-        "hash": "df18682eaa04fc0695f08814c7ff5464db1d2bf5b3b4087cff2ca6b574da5111"
+        "hash": "a3ba3ba8f7bb293e1560c3140da2b50ac739ac4e5fb10c857f837b6dc54b029b"
       }
     },
     {
@@ -4653,7 +4653,7 @@
         ]
       },
       "meta": {
-        "hash": "f33391684fe093ac09dabf9cb6989ac7f14f723df2bde7394f545cc7b0b05262"
+        "hash": "3e92614cb14073c51991cb6978e6a7e5871a00f1f24a886046f441fdc4633175"
       }
     },
     {
@@ -4668,7 +4668,7 @@
         ]
       },
       "meta": {
-        "hash": "366850ca91f713d2e8fb174e9f8bd5a7748a434399ff7c1b5075955a08078521"
+        "hash": "5ba3bb9fbfb3e5b61195b6e72e5b8f9f3e86b1a9b478e52f2429c4399718d118"
       }
     },
     {
@@ -4684,7 +4684,7 @@
         ]
       },
       "meta": {
-        "hash": "b8e93a3c40ea05f379ab326d9ed2e4ac14949f7154d4e7fc2d17efa6a5481799"
+        "hash": "7f920d42aa9408822b33d9790b0664f7f289989a363f21e9a1a87cb88510fb54"
       }
     },
     {
@@ -4700,7 +4700,7 @@
         ]
       },
       "meta": {
-        "hash": "9fae38c78ae503c8e43dff66b18620706576f08fe7367af6ecceb11a20e518e9"
+        "hash": "f31a5937c12873095d7e167410eab03efdffb4bf6eb0561881a66111ddc750a7"
       }
     },
     {
@@ -4716,7 +4716,7 @@
         ]
       },
       "meta": {
-        "hash": "d9125d25ac50396ddd1efa084257c92729a5ddb8c50fbc681d242ce2b805cf25"
+        "hash": "2d54a197d2cd14bddc7daf88f64413ad8c3b4a42fdee91a0a5cf45d71688d8cf"
       }
     },
     {
@@ -4731,7 +4731,7 @@
         ]
       },
       "meta": {
-        "hash": "1e70ae6e7bd4ed20eea6aa70d73df0a73e71d5af12ede047786ec894eb8a5a1d"
+        "hash": "200a7d0c4ccca7ad8f80c9489ed461d46d5ad0ca75184d18c3414437fd99bad2"
       }
     },
     {
@@ -4746,7 +4746,7 @@
         ]
       },
       "meta": {
-        "hash": "c680328d56d076e2e8ca088a6ba2d847e154b1e685f906007043e1067393ac75"
+        "hash": "670d66a804a498c3826e65fe1cb8917832f72ff3a41cdee9f3c29f357aadb7fb"
       }
     },
     {
@@ -4761,7 +4761,7 @@
         ]
       },
       "meta": {
-        "hash": "f5876f1de114686d4fc591cb3495a4b67940e54bb0b5e081a355a6fb788fe6b7"
+        "hash": "4c83bc03b1146f6a9f49f12855a4118dd32367b6b6d46e64e94959404411e823"
       }
     },
     {
@@ -4777,7 +4777,7 @@
         ]
       },
       "meta": {
-        "hash": "1bfc91fad9d599076ff5a58f19c2db755db842bf38763fae83f9ad607cc47c6f"
+        "hash": "ee5e3e006f3b756090a5f3f02cd0d2ea06da048dd0550277c25719b83ceeeaf6"
       }
     },
     {
@@ -4793,7 +4793,7 @@
         ]
       },
       "meta": {
-        "hash": "4759e12c906e134d6445bb9f84bc0c40815e5a2381f3cfedb76681393e35381c"
+        "hash": "1131730353754c8cdb3f3c2d81eb750fbfc99020ff7266987253e857b9aee6c5"
       }
     },
     {
@@ -4808,7 +4808,7 @@
         ]
       },
       "meta": {
-        "hash": "b076b44e9bcfaff686b2edd329bd22938fa5a50ae7db2e21201e7233ec3addaf"
+        "hash": "0ff3f88fae6144b972137023cf882931df405a09413c1c48bdcb7ed78c1977aa"
       }
     },
     {
@@ -4823,7 +4823,7 @@
         ]
       },
       "meta": {
-        "hash": "b8167f33f791a4890383b967fbe55eacc3f9fb9f1d866f669c184aab4a703e71"
+        "hash": "f4f19054ff681f91e6d45f0b08ce964192b96eac5a6807df85877457cb4b366c"
       }
     },
     {
@@ -4838,7 +4838,7 @@
         ]
       },
       "meta": {
-        "hash": "f4d53ad4fb4f62d81c2ae71a6e63d0e9743611ffb1692e8cc69a942740046051"
+        "hash": "26246364ba1e8e3f52a51c8e1f329af721b05a5d307ed88bf31ccd2620c0deee"
       }
     },
     {
@@ -4854,7 +4854,7 @@
         ]
       },
       "meta": {
-        "hash": "2b9492d4623bde93a43fcd9980d078eded1b4c936eca1e250d8d0df4f4f77d63"
+        "hash": "5a38a98081a22fe5a56d272038bc1f7dadab097b1cf4c16c34286e9d51c26331"
       }
     },
     {
@@ -4869,7 +4869,7 @@
         ]
       },
       "meta": {
-        "hash": "82f1ee7e0691ac78fcb4f4fd1ec6328023f5079bdcd5235f9ef2ee4bfcb35619"
+        "hash": "2f817f7dc3ca24a50bfaa1a59dec3ec6d8ee3392ac2d7f3ecae3a93a9c96f09c"
       }
     },
     {
@@ -4885,7 +4885,7 @@
         ]
       },
       "meta": {
-        "hash": "ab620b01c52481708880d3741a6c2bbb12db547ef5f3b24eb9cd16e907f2c65b"
+        "hash": "426eb2319298548df80de3db701eb3c130abd4ff9613a87bd2ae55f76aae7039"
       }
     },
     {
@@ -4900,7 +4900,7 @@
         ]
       },
       "meta": {
-        "hash": "476069d28b960fdd4d65414ccc582c76096a4a6662421c74a72a72a043486412"
+        "hash": "994b3e4bd75982d26fef1b3812890b90118c8d89aec6e8a666ce7e132c382081"
       }
     },
     {
@@ -4915,7 +4915,7 @@
         ]
       },
       "meta": {
-        "hash": "2fbfe0bedd6f3f740fd23d5cbcf04b101ced73bed5c857ae526974a117813545"
+        "hash": "4d9656f6d96e3cdd49ab1df4389315e004c5a134fe22ad1036befb6168ee1e54"
       }
     },
     {
@@ -4931,7 +4931,7 @@
         ]
       },
       "meta": {
-        "hash": "c5b8ef27942b0caada88baf6864ebcb8105b6e9379547e4479e9ee6b7b02ac68"
+        "hash": "0981cb8583c317d56894840bb31fd83e820b56fd7eef18d96db1edcb0a222860"
       }
     },
     {
@@ -4946,7 +4946,7 @@
         ]
       },
       "meta": {
-        "hash": "9c126e9e3250d0331bf204ceae7e1aa36dc094cf80dbf8087937196eaf7df12e"
+        "hash": "79e76e143e7f595b4d2c5be657629728cd5fb2cc4248706dedb7e0c8e9512d3c"
       }
     },
     {
@@ -4962,7 +4962,7 @@
         ]
       },
       "meta": {
-        "hash": "0f75f320bb49b6ab79185cddddf6d9bfef90e53d4aa8b5884f96f260e184b442"
+        "hash": "0ebd3351685fd96bf678c2baa38fabc9aa18bd6a3fa6674ea0bae9663424ea5f"
       }
     },
     {
@@ -4977,7 +4977,7 @@
         ]
       },
       "meta": {
-        "hash": "9f15503a0b607766e642534c47394b09f3727394f43e9e7fb06e3d53b5ebc908"
+        "hash": "ebe1997777f4fb4c97cd5ae23a0cc590a0aab8f6762ae1d39c17f27bf2efe1c6"
       }
     },
     {
@@ -4993,7 +4993,7 @@
         ]
       },
       "meta": {
-        "hash": "d93f6fcf097149f6ae8dd2c317f4dce6a09c91f1fa19ddb1b5419d9d2b3390ae"
+        "hash": "84b49b4a42fc39414edc473addc5de9a956e3ad26496133bd721c8d691352def"
       }
     },
     {
@@ -5009,7 +5009,7 @@
         ]
       },
       "meta": {
-        "hash": "35ce1d82eafc92f53b48cde75cfcadf36ef9c5946ce9c7fe05d35bc2390d0c6d"
+        "hash": "9ec5b60fcad2b633dfdbb342bf3fad8f3b63d2e06da09781c73481283f0cab1b"
       }
     },
     {
@@ -5025,7 +5025,7 @@
         ]
       },
       "meta": {
-        "hash": "637dad1e69df73a391ae68895d0ecfaf22a549256addafd953858f002d9de291"
+        "hash": "2186f42e4ed6452b13986c08af41e7e98b6fb6528ca1994e2ee843d0453ef695"
       }
     },
     {
@@ -5041,7 +5041,7 @@
         ]
       },
       "meta": {
-        "hash": "3b2078d891329f1c08e5fa63e9789d6bd4c240b1415c383f91e431e23a71d306"
+        "hash": "61673214d218ca447cac81b95b6766264b66fd141462fbd5e3814e4c6cf7ded2"
       }
     },
     {
@@ -5056,7 +5056,7 @@
         ]
       },
       "meta": {
-        "hash": "3d14dbb3b40bc7432d7e1ad7363c89da0678c9c8e384f6ae2e886bc3b8960250"
+        "hash": "6f9ea1ee77d87c9b78e7b069bf27cf8bafd269023f3f7b675a65791446d7d2d3"
       }
     },
     {
@@ -5073,7 +5073,7 @@
         ]
       },
       "meta": {
-        "hash": "1c5cd5a4487b6faba52b0aa508548f63ebb3fc6d45e450ecd3fc20a58e472a3d"
+        "hash": "7e4b72845da78eb0665de207c9d94c2f728d945be47d6dd13a14b53101e7a6a4"
       }
     },
     {
@@ -5089,7 +5089,7 @@
         ]
       },
       "meta": {
-        "hash": "bd434f04c55ba07e748a4a32ccc0476ec54c97d0502cbb1c60ca7386b0da15d5"
+        "hash": "73046804bd1b91d397ee382d19eb59798f17319c1acf74393a550286be8cf087"
       }
     },
     {
@@ -5104,7 +5104,7 @@
         ]
       },
       "meta": {
-        "hash": "53730181591b9ac48200bb5331a45cd3ca70c00ec2aa57cc148eaaa2992ee17f"
+        "hash": "9947959c989195fe0581aa57ea3456f90d3c0e10a2f6e772f3a891ac81574f34"
       }
     },
     {
@@ -5120,7 +5120,7 @@
         ]
       },
       "meta": {
-        "hash": "b4732de7e076c350b70e3070dd0a0f127503796de26c2d34134a6e25e15f626d"
+        "hash": "f469a318ae70e50251f0430c34d8fe0f57ca9158c2a8619ba146d2246adee8d5"
       }
     },
     {
@@ -5135,7 +5135,7 @@
         ]
       },
       "meta": {
-        "hash": "264bd6b7e7c883a80866f7f59a00b07b64f296bcd244d054c0f46ff0a86f020a"
+        "hash": "bc549ec3e2504bca06ef5ce7f1424b3b7dcd8959ebe983eeb576cda7eb5f6017"
       }
     },
     {
@@ -5151,7 +5151,7 @@
         ]
       },
       "meta": {
-        "hash": "112ed48b23b273b53473604f54baf0481f8c2e493ea3ee78ab4b68c39f84320c"
+        "hash": "c1003c7baca5e5492e603c28aaa822cf24393036d6322fd90591519f9e7c74d9"
       }
     },
     {
@@ -5167,7 +5167,7 @@
         ]
       },
       "meta": {
-        "hash": "1110cf18c16f20e694cc0563d611dcfed248caea4607cdae909f9102f892ab1b"
+        "hash": "9b1bc0a79c182b07f6c9142ceb346a2958e1902c7b5defa906f071573583dcb7"
       }
     },
     {
@@ -5183,7 +5183,7 @@
         ]
       },
       "meta": {
-        "hash": "3f979ac8d6aa0c3063f43cb9f04afb749ac20c5380b137575baf8d5bd6df2c66"
+        "hash": "db6fe4b924d30c2d844e7c55a1b73250c323ccccaa22ae15d936ce653a5c7a15"
       }
     },
     {
@@ -5199,7 +5199,7 @@
         ]
       },
       "meta": {
-        "hash": "5f9ae7bec326eec143bbdf370c563d6b4dff298867366c20111b60bd7d5ee37b"
+        "hash": "2784f965f4f4c04998f63b440c6554613bb2042ea1b45a461775c8ffc9e2ec29"
       }
     },
     {
@@ -5214,7 +5214,7 @@
         ]
       },
       "meta": {
-        "hash": "b0f9c2c8468e300e3cf598b254f781dde03fe66bc68b2df7241ea711b82f230e"
+        "hash": "474b3568e2a842246ff6ab2800aeec3f82353732080bb63911adb142d273e34c"
       }
     },
     {
@@ -5230,7 +5230,7 @@
         ]
       },
       "meta": {
-        "hash": "06ff0d53ab6a331d8ce2328bc6b3508499643b949619b3cde76c76b62ce3dc9e"
+        "hash": "a506c398c0d84b8c6926b70e62f28ca6180a02d010088c89fc9c8d7e2706e0bc"
       }
     },
     {
@@ -5246,7 +5246,7 @@
         ]
       },
       "meta": {
-        "hash": "91b32837e695469deacf85acb7c3bbf135ac4f60a400f3f2d172da5b3b16acd1"
+        "hash": "59867a867b440985ad221def644ec15594908db1d2ae413fc8a41f2669e3798a"
       }
     },
     {
@@ -5262,7 +5262,7 @@
         ]
       },
       "meta": {
-        "hash": "b716a5ba1d108566843faebee7f3e9a7f58298867dbabdeef05f9ab564ae7c5f"
+        "hash": "553400fbd0f95322a82a87440dcaef7c25277740e3116027b5d23731a926cc61"
       }
     },
     {
@@ -5278,7 +5278,7 @@
         ]
       },
       "meta": {
-        "hash": "b36830b8ef8952e7efe53cda6f70c7d557c9c4990892d92404f867f41e080602"
+        "hash": "fc0e9c9b78dfc63137bd1a7bf71d03089d732356803f16af37febce1adefda9a"
       }
     },
     {
@@ -5293,7 +5293,7 @@
         ]
       },
       "meta": {
-        "hash": "e5a3523a7f3ff4e4dec462d925e8330e083840ad9e3a1b5f1c41e1af2c86c1c4"
+        "hash": "5165ec928d2bf1d48f21f8591df40cc466e2821064e5180aa598bb5aff4d642a"
       }
     },
     {
@@ -5309,7 +5309,7 @@
         ]
       },
       "meta": {
-        "hash": "4c5cd7ebb60e373668ca1999ff7f7da9ec0a991334bf7e52f84b392f36c9a7be"
+        "hash": "12bf4549e753e503e1798b21dcebc3bc2026ee3e6f391887d4bb0fa99211e2f6"
       }
     },
     {
@@ -5326,7 +5326,7 @@
         ]
       },
       "meta": {
-        "hash": "919f1c91d452aaa1bd6409f55cdf8a7bda8c247640712af424751680ea266089"
+        "hash": "6050cfa3a2a39089151bacfce1f5cedaec12f5da253dbc20a56dfaf50cb8924b"
       }
     },
     {
@@ -5343,7 +5343,7 @@
         ]
       },
       "meta": {
-        "hash": "c3a3f772340a13d3911760b188e51328f98b5529b7ab4a8bbe5ec7654e090ed3"
+        "hash": "9f84a12da85558ebdb189097dbc581b338e07d52eedc5975f1001133b123aad2"
       }
     },
     {
@@ -5360,7 +5360,7 @@
         ]
       },
       "meta": {
-        "hash": "30bb3a014903751a7883715528d1159ca97c2f424c6b18517cc04c0eda858e8f"
+        "hash": "79604b0f854a91af789fea8416c7099acfb3633259ef387f52a21337d2242478"
       }
     },
     {
@@ -5376,7 +5376,7 @@
         ]
       },
       "meta": {
-        "hash": "8596bd507a5c337cbf60ac6ca002660f9d772121fe99c7c43d0a319db4e10849"
+        "hash": "73fc55564fa0b59a71553aa442bda666cbcddbcd618f9ca53c2b55e42a7c26ca"
       }
     },
     {
@@ -5391,7 +5391,7 @@
         ]
       },
       "meta": {
-        "hash": "9d990d7de46d6cc19f27b635f3edfc4e9d12b5d97fe7f75b6bdd6ecbcb7ae101"
+        "hash": "a2c8560a2e285ebe11caad3a46c07ee0e41a64bd850b2e5a4f5aebc12da09dcc"
       }
     },
     {
@@ -5406,7 +5406,7 @@
         ]
       },
       "meta": {
-        "hash": "9405ea116f261da51ff2aeb33bc85c1f660336e9c545f9e349e4c24a173694d3"
+        "hash": "4ec8d33670ad1c716f00c72100c27c43a0031eb8ee411699aa4740df3bfe9659"
       }
     },
     {
@@ -5421,7 +5421,7 @@
         ]
       },
       "meta": {
-        "hash": "3d0ca97e0ac21dc80e159c16fbfd3d96971e18bd3a0916a15d4e9f607c374b06"
+        "hash": "54f15178f6196172218aeffd14defe4e9af475ee3e29f0857ada823f618d3c8f"
       }
     },
     {
@@ -5437,7 +5437,7 @@
         ]
       },
       "meta": {
-        "hash": "6ec0d898d6cd10a0803beb1d593f79d8587544286dbb9a5c7855224d01f0df67"
+        "hash": "b072b9cad23554279e7601cafb20813d6675459293aab607a22c820a2f2a0eb9"
       }
     },
     {
@@ -5453,7 +5453,7 @@
         ]
       },
       "meta": {
-        "hash": "3b24a5017fdefa96faab4977d6d16050b21e1c894257974b785d9415705c3aa2"
+        "hash": "8202d07045f90d897db21799a4daa0de39613c035b4ed1e92ab65c8cd5ce2e15"
       }
     },
     {
@@ -5469,7 +5469,7 @@
         ]
       },
       "meta": {
-        "hash": "23c21fc71824198eb77fad9d6cc159975a7b1d70db912877a0ae035e870f7379"
+        "hash": "6365f144def8abb711b890f8689ff8c9f1f1aee092525583fa913057ba623472"
       }
     },
     {
@@ -5484,7 +5484,7 @@
         ]
       },
       "meta": {
-        "hash": "6dc856b968d246b98ce60715240955d6744837c36736d2a718edbe7fd420c799"
+        "hash": "033e90570af5f5ed3d8c0ea4407d6ccaea760372562c5633a24bf08e1f8782d3"
       }
     },
     {
@@ -5499,7 +5499,7 @@
         ]
       },
       "meta": {
-        "hash": "f73f7ab8ab477f0ff1becac163dc817944ed313df9774e1396a2fb6257fe0a63"
+        "hash": "ec0b5750affd681f1eed8dd7a4711c103675f559da38aab23162d5270567d329"
       }
     },
     {
@@ -5515,7 +5515,7 @@
         ]
       },
       "meta": {
-        "hash": "dd3efa6bab11e40fd0fc7cb93816ae0af75c703dc5aaa689405e7bff90b9f0f6"
+        "hash": "f2c7e2c6a8e566946e631c92b295c76cc406650347ec0e21318522f26094acd7"
       }
     },
     {
@@ -5531,7 +5531,7 @@
         ]
       },
       "meta": {
-        "hash": "d6aae10a70618948763d65d9eb3b0b7704efec8a0c9287a45bdbfc4fbd6dc34c"
+        "hash": "457830ee4df5b57b6605c4133b863cc3f3eebf0031ccd1358fae3c6f5cb3c75e"
       }
     }
   ],
diff --git a/snippet_data/snippets.json b/snippet_data/snippets.json
index e31799115..54159f0d1 100644
--- a/snippet_data/snippets.json
+++ b/snippet_data/snippets.json
@@ -10,7 +10,7 @@
         "codeBlocks": {
           "es6": "const all = (arr, fn = Boolean) => arr.every(fn);",
           "es5": "var all = function all(arr) {\n  var fn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Boolean;\n  return arr.every(fn);\n};",
-          "example": "all([4, 2, 3], x => x > 1); // true\r\nall([1, 2, 3]); // true"
+          "example": "all([4, 2, 3], x => x > 1); // true\nall([1, 2, 3]); // true"
         },
         "tags": [
           "array",
@@ -19,7 +19,7 @@
         ]
       },
       "meta": {
-        "hash": "1b37192f25e1bfcf9f7bae57fc0c1ca05d02016c0c4ab50fb3f6ac6a7073e949"
+        "hash": "ba8e5f17500d1e5428f4ca7fcc8095934a7ad3aa496b35465e8f7799f1715aaa"
       }
     },
     {
@@ -32,7 +32,7 @@
         "codeBlocks": {
           "es6": "const allEqual = arr => arr.every(val => val === arr[0]);",
           "es5": "var allEqual = function allEqual(arr) {\n  return arr.every(function (val) {\n    return val === arr[0];\n  });\n};",
-          "example": "allEqual([1, 2, 3, 4, 5, 6]); // false\r\nallEqual([1, 1, 1, 1]); // true"
+          "example": "allEqual([1, 2, 3, 4, 5, 6]); // false\nallEqual([1, 1, 1, 1]); // true"
         },
         "tags": [
           "array",
@@ -41,7 +41,7 @@
         ]
       },
       "meta": {
-        "hash": "9ff2aa6f079de4569beb1acde0caa8d4f35539e000bcf4ca52c56a824fc3cb63"
+        "hash": "bda519858588ad61c9200acbb4ea5ce66630eb2ed7ceda96d12518b772b986b9"
       }
     },
     {
@@ -54,7 +54,7 @@
         "codeBlocks": {
           "es6": "const any = (arr, fn = Boolean) => arr.some(fn);",
           "es5": "var any = function any(arr) {\n  var fn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Boolean;\n  return arr.some(fn);\n};",
-          "example": "any([0, 1, 2, 0], x => x >= 2); // true\r\nany([0, 0, 1, 0]); // true"
+          "example": "any([0, 1, 2, 0], x => x >= 2); // true\nany([0, 0, 1, 0]); // true"
         },
         "tags": [
           "array",
@@ -63,7 +63,7 @@
         ]
       },
       "meta": {
-        "hash": "95795b2d98d3970eed4066134d947c2c6abf1f0ce1f7dfe705095bab64f44ae5"
+        "hash": "061b791456507197b9be0ff9b791b830fe0b550823868075bbe04962501f83a3"
       }
     },
     {
@@ -84,7 +84,7 @@
         ]
       },
       "meta": {
-        "hash": "062de86ad6c328483fa2760b5cbf79ceb40ef2efa87a74a5704423207a538657"
+        "hash": "805f11e2f230c3a6b7dc590fcee27b4083b2188b6f1d0a8afb93868891cdba22"
       }
     },
     {
@@ -95,9 +95,9 @@
         "fileName": "arrayToCSV.md",
         "text": "Converts a 2D array to a comma-separated values (CSV) string.\n\nUse `Array.prototype.map()` and `Array.prototype.join(delimiter)` to combine individual 1D arrays (rows) into strings.\nUse `Array.prototype.join('\\n')` to combine all rows into a CSV string, separating each row with a newline.\nOmit the second argument, `delimiter`, to use a default delimiter of `,`.\n\n",
         "codeBlocks": {
-          "es6": "const arrayToCSV = (arr, delimiter = ',') =>\r\n  arr\r\n    .map(v => v.map(x => (isNaN(x) ? `\"${x.replace(/\"/g, '\"\"')}\"` : x)).join(delimiter))\r\n    .join('\\n');",
+          "es6": "const arrayToCSV = (arr, delimiter = ',') =>\n  arr\n    .map(v => v.map(x => (isNaN(x) ? `\"${x.replace(/\"/g, '\"\"')}\"` : x)).join(delimiter))\n    .join('\\n');",
           "es5": "var arrayToCSV = function arrayToCSV(arr) {\n  var delimiter = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n  return arr.map(function (v) {\n    return v.map(function (x) {\n      return isNaN(x) ? \"\\\"\".concat(x.replace(/\"/g, '\"\"'), \"\\\"\") : x;\n    }).join(delimiter);\n  }).join('\\n');\n};",
-          "example": "arrayToCSV([['a', 'b'], ['c', 'd']]); // '\"a\",\"b\"\\n\"c\",\"d\"'\r\narrayToCSV([['a', 'b'], ['c', 'd']], ';'); // '\"a\";\"b\"\\n\"c\";\"d\"'\r\narrayToCSV([['a', '\"b\" great'], ['c', 3.1415]]); // '\"a\",\"\"\"b\"\" great\"\\n\"c\",3.1415'"
+          "example": "arrayToCSV([['a', 'b'], ['c', 'd']]); // '\"a\",\"b\"\\n\"c\",\"d\"'\narrayToCSV([['a', 'b'], ['c', 'd']], ';'); // '\"a\";\"b\"\\n\"c\";\"d\"'\narrayToCSV([['a', '\"b\" great'], ['c', 3.1415]]); // '\"a\",\"\"\"b\"\" great\"\\n\"c\",3.1415'"
         },
         "tags": [
           "array",
@@ -107,7 +107,7 @@
         ]
       },
       "meta": {
-        "hash": "79164ada1eb58d8a611c548f0d5c85d1eb1c0b043fcc6b9f680b279080c55bb0"
+        "hash": "aeabb3d1d2be2d44fd8a20da3b069fdd1a8ad963f27e3e1ae9f5e8b40a8908cb"
       }
     },
     {
@@ -118,7 +118,7 @@
         "fileName": "arrayToHtmlList.md",
         "text": "Converts the given array elements into `<li>` tags and appends them to the list of the given id.\n\nUse `Array.prototype.map()`, `document.querySelector()`, and an anonymous inner closure to create a list of html tags.\n\n",
         "codeBlocks": {
-          "es6": "const arrayToHtmlList = (arr, listID) =>\r\n  (el => (\r\n    (el = document.querySelector('#' + listID)),\r\n    (el.innerHTML += arr.map(item => `<li>${item}</li>`).join(''))\r\n  ))();",
+          "es6": "const arrayToHtmlList = (arr, listID) =>\n  (el => (\n    (el = document.querySelector('#' + listID)),\n    (el.innerHTML += arr.map(item => `<li>${item}</li>`).join(''))\n  ))();",
           "es5": "var arrayToHtmlList = function arrayToHtmlList(arr, listID) {\n  return function (el) {\n    return el = document.querySelector('#' + listID), el.innerHTML += arr.map(function (item) {\n      return \"<li>\".concat(item, \"</li>\");\n    }).join('');\n  }();\n};",
           "example": "arrayToHtmlList(['item 1', 'item 2'], 'myListID');"
         },
@@ -129,7 +129,7 @@
         ]
       },
       "meta": {
-        "hash": "762a7b62270de6cdbc21679ab007313c61e9baa1c3aac51d022206a21a98275b"
+        "hash": "9d7e2db4a98688ab199ed2f75242bbff40a6083cc3c0ef483ed679c5d3878239"
       }
     },
     {
@@ -142,7 +142,7 @@
         "codeBlocks": {
           "es6": "const ary = (fn, n) => (...args) => fn(...args.slice(0, n));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar ary = function ary(fn, n) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return fn.apply(void 0, _toConsumableArray(args.slice(0, n)));\n  };\n};",
-          "example": "const firstTwoMax = ary(Math.max, 2);\r\n[[2, 6, 'a'], [8, 4, 6], [10]].map(x => firstTwoMax(...x)); // [6, 8, 10]"
+          "example": "const firstTwoMax = ary(Math.max, 2);\n[[2, 6, 'a'], [8, 4, 6], [10]].map(x => firstTwoMax(...x)); // [6, 8, 10]"
         },
         "tags": [
           "adapter",
@@ -151,7 +151,7 @@
         ]
       },
       "meta": {
-        "hash": "1e2b832078a1c3446823a3905cb8e16e06e0608988e2de650fae583095d34cc7"
+        "hash": "918d65f04bafeb3ee0b855a52805773e8a8dc818fec1daa4ad0940dba32de9e8"
       }
     },
     {
@@ -174,7 +174,7 @@
         ]
       },
       "meta": {
-        "hash": "ded2d29975207c5cd902ccbf4a8a7849b57cf80bc7b5963f1d4ef2c8a4ddd98c"
+        "hash": "32988360d63d6d62251314a88d3f4482ec3a265d67154a92a86d4140bd61c54b"
       }
     },
     {
@@ -185,9 +185,9 @@
         "fileName": "attempt.md",
         "text": "Attempts to invoke a function with the provided arguments, returning either the result or the caught error object.\n\nUse a `try... catch` block to return either the result of the function or an appropriate error.\n\n",
         "codeBlocks": {
-          "es6": "const attempt = (fn, ...args) => {\r\n  try {\r\n    return fn(...args);\r\n  } catch (e) {\r\n    return e instanceof Error ? e : new Error(e);\r\n  }\r\n};",
+          "es6": "const attempt = (fn, ...args) => {\n  try {\n    return fn(...args);\n  } catch (e) {\n    return e instanceof Error ? e : new Error(e);\n  }\n};",
           "es5": "var attempt = function attempt(fn) {\n  try {\n    for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n      args[_key - 1] = arguments[_key];\n    }\n\n    return fn.apply(void 0, args);\n  } catch (e) {\n    return e instanceof Error ? e : new Error(e);\n  }\n};",
-          "example": "var elements = attempt(function(selector) {\r\n  return document.querySelectorAll(selector);\r\n}, '>_>');\r\nif (elements instanceof Error) elements = []; // elements = []"
+          "example": "var elements = attempt(function(selector) {\n  return document.querySelectorAll(selector);\n}, '>_>');\nif (elements instanceof Error) elements = []; // elements = []"
         },
         "tags": [
           "function",
@@ -195,7 +195,7 @@
         ]
       },
       "meta": {
-        "hash": "0f2f552619fe08cb9907ee7a0c98b950e8373389331f3b62c3d42f9f6309a147"
+        "hash": "a511836ad4a5755d469af2e6a331cbcd85df14b6231bbed6a1b0fe44aee3d2cf"
       }
     },
     {
@@ -208,7 +208,7 @@
         "codeBlocks": {
           "es6": "const average = (...nums) => nums.reduce((acc, val) => acc + val, 0) / nums.length;",
           "es5": "var average = function average() {\n  for (var _len = arguments.length, nums = new Array(_len), _key = 0; _key < _len; _key++) {\n    nums[_key] = arguments[_key];\n  }\n\n  return nums.reduce(function (acc, val) {\n    return acc + val;\n  }, 0) / nums.length;\n};",
-          "example": "average(...[1, 2, 3]); // 2\r\naverage(1, 2, 3); // 2"
+          "example": "average(...[1, 2, 3]); // 2\naverage(1, 2, 3); // 2"
         },
         "tags": [
           "math",
@@ -217,7 +217,7 @@
         ]
       },
       "meta": {
-        "hash": "855cf560b8cbb21556c29ef2a28b4f31fb9d2bcc5bcbc601ef8ebfe8511d0863"
+        "hash": "edf5c7f142e59e4467ca7142eaf0ac95957abcb0dad1d439484b2b70fe8be6d3"
       }
     },
     {
@@ -228,9 +228,9 @@
         "fileName": "averageBy.md",
         "text": "Returns the average of an array, after mapping each element to a value using the provided function.\n\nUse `Array.prototype.map()` to map each element to the value returned by `fn`, `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`, divide by the `length` of the array.\n\n",
         "codeBlocks": {
-          "es6": "const averageBy = (arr, fn) =>\r\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => acc + val, 0) /\r\n  arr.length;",
+          "es6": "const averageBy = (arr, fn) =>\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => acc + val, 0) /\n  arr.length;",
           "es5": "var averageBy = function averageBy(arr, fn) {\n  return arr.map(typeof fn === 'function' ? fn : function (val) {\n    return val[fn];\n  }).reduce(function (acc, val) {\n    return acc + val;\n  }, 0) / arr.length;\n};",
-          "example": "averageBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 5\r\naverageBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 5"
+          "example": "averageBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 5\naverageBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 5"
         },
         "tags": [
           "math",
@@ -240,7 +240,7 @@
         ]
       },
       "meta": {
-        "hash": "363aa1d913dde77133d4aba12fa28f3338b86a31fdff00067caaa62f93d991fe"
+        "hash": "7aa2052a6196029116ef9f2f7dda69b7d17344c0acc659ffedf002024b38d8b7"
       }
     },
     {
@@ -251,7 +251,7 @@
         "fileName": "bifurcate.md",
         "text": "Splits values into two groups. If an element in `filter` is truthy, the corresponding element in the collection belongs to the first group; otherwise, it belongs to the second group.\n\nUse `Array.prototype.reduce()` and `Array.prototype.push()` to add elements to groups, based on `filter`.\n\n",
         "codeBlocks": {
-          "es6": "const bifurcate = (arr, filter) =>\r\n  arr.reduce((acc, val, i) => (acc[filter[i] ? 0 : 1].push(val), acc), [[], []]);",
+          "es6": "const bifurcate = (arr, filter) =>\n  arr.reduce((acc, val, i) => (acc[filter[i] ? 0 : 1].push(val), acc), [[], []]);",
           "es5": "var bifurcate = function bifurcate(arr, filter) {\n  return arr.reduce(function (acc, val, i) {\n    return acc[filter[i] ? 0 : 1].push(val), acc;\n  }, [[], []]);\n};",
           "example": "bifurcate(['beep', 'boop', 'foo', 'bar'], [true, true, false, true]); // [ ['beep', 'boop', 'bar'], ['foo'] ]"
         },
@@ -261,7 +261,7 @@
         ]
       },
       "meta": {
-        "hash": "7b517e54adbbbf3a95f67216f2867a08872bf26fca6fb4e8502fa25cac458d05"
+        "hash": "a801974915906c11a30deef1baa3994f44f548f1ca1cf599aede4bb730543ec6"
       }
     },
     {
@@ -272,7 +272,7 @@
         "fileName": "bifurcateBy.md",
         "text": "Splits values into two groups according to a predicate function, which specifies which group an element in the input collection belongs to. If the predicate function returns a truthy value, the collection element belongs to the first group; otherwise, it belongs to the second group.\n\nUse `Array.prototype.reduce()` and `Array.prototype.push()` to add elements to groups, based on the value returned by `fn` for each element.\n\n",
         "codeBlocks": {
-          "es6": "const bifurcateBy = (arr, fn) =>\r\n  arr.reduce((acc, val, i) => (acc[fn(val, i) ? 0 : 1].push(val), acc), [[], []]);",
+          "es6": "const bifurcateBy = (arr, fn) =>\n  arr.reduce((acc, val, i) => (acc[fn(val, i) ? 0 : 1].push(val), acc), [[], []]);",
           "es5": "var bifurcateBy = function bifurcateBy(arr, fn) {\n  return arr.reduce(function (acc, val, i) {\n    return acc[fn(val, i) ? 0 : 1].push(val), acc;\n  }, [[], []]);\n};",
           "example": "bifurcateBy(['beep', 'boop', 'foo', 'bar'], x => x[0] === 'b'); // [ ['beep', 'boop', 'bar'], ['foo'] ]"
         },
@@ -283,7 +283,7 @@
         ]
       },
       "meta": {
-        "hash": "313794f5accd131722b6c22bfe6670d141a646d982083c263df7927be65001f8"
+        "hash": "db1b8580ab11b6ba05a7d47776b97d700c5a7e945ddc5ad9ca1f37e50f039b54"
       }
     },
     {
@@ -296,7 +296,7 @@
         "codeBlocks": {
           "es6": "const bind = (fn, context, ...boundArgs) => (...args) => fn.apply(context, [...boundArgs, ...args]);",
           "es5": "var bind = function bind(fn, context) {\n  for (var _len = arguments.length, boundArgs = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {\n    boundArgs[_key - 2] = arguments[_key];\n  }\n\n  return function () {\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return fn.apply(context, [].concat(boundArgs, args));\n  };\n};",
-          "example": "function greet(greeting, punctuation) {\r\n  return greeting + ' ' + this.user + punctuation;\r\n}\r\nconst freddy = { user: 'fred' };\r\nconst freddyBound = bind(greet, freddy);\r\nconsole.log(freddyBound('hi', '!')); // 'hi fred!'"
+          "example": "function greet(greeting, punctuation) {\n  return greeting + ' ' + this.user + punctuation;\n}\nconst freddy = { user: 'fred' };\nconst freddyBound = bind(greet, freddy);\nconsole.log(freddyBound('hi', '!')); // 'hi fred!'"
         },
         "tags": [
           "function",
@@ -305,7 +305,7 @@
         ]
       },
       "meta": {
-        "hash": "434b28bc85a418e6380adfd5e9d256cd9710f81bb082f2e3d374fd61e187e65a"
+        "hash": "d15851c4e6991e41014768c3f2dd28df71615e44180c732b67eed1d162ea4b95"
       }
     },
     {
@@ -316,9 +316,9 @@
         "fileName": "bindAll.md",
         "text": "Binds methods of an object to the object itself, overwriting the existing method.\n\nUse `Array.prototype.forEach()` to return a `function` that uses `Function.prototype.apply()` to apply the given context (`obj`) to `fn` for each function specified.\n\n",
         "codeBlocks": {
-          "es6": "const bindAll = (obj, ...fns) =>\r\n  fns.forEach(\r\n    fn => (\r\n      (f = obj[fn]),\r\n      (obj[fn] = function() {\r\n        return f.apply(obj);\r\n      })\r\n    )\r\n  );",
+          "es6": "const bindAll = (obj, ...fns) =>\n  fns.forEach(\n    fn => (\n      (f = obj[fn]),\n      (obj[fn] = function() {\n        return f.apply(obj);\n      })\n    )\n  );",
           "es5": "var bindAll = function bindAll(obj) {\n  for (var _len = arguments.length, fns = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    fns[_key - 1] = arguments[_key];\n  }\n\n  return fns.forEach(function (fn) {\n    return f = obj[fn], obj[fn] = function () {\n      return f.apply(obj);\n    };\n  });\n};",
-          "example": "var view = {\r\n  label: 'docs',\r\n  click: function() {\r\n    console.log('clicked ' + this.label);\r\n  }\r\n};\r\nbindAll(view, 'click');\r\njQuery(element).on('click', view.click); // Logs 'clicked docs' when clicked."
+          "example": "var view = {\n  label: 'docs',\n  click: function() {\n    console.log('clicked ' + this.label);\n  }\n};\nbindAll(view, 'click');\njQuery(element).on('click', view.click); // Logs 'clicked docs' when clicked."
         },
         "tags": [
           "object",
@@ -327,7 +327,7 @@
         ]
       },
       "meta": {
-        "hash": "f04a9ceec2418fddeaf4c14cd7ff199c7ac09b8de1eb8a4a0f6e25addeba04ba"
+        "hash": "e159b77ba0bde0f38d339348b9a69b4702cf036abd767777507159aa75ce151b"
       }
     },
     {
@@ -338,9 +338,9 @@
         "fileName": "bindKey.md",
         "text": "Creates a function that invokes the method at a given key of an object, optionally adding any additional supplied parameters to the beginning of the arguments.\n\nReturn a `function` that uses `Function.prototype.apply()` to bind `context[fn]` to `context`.\nUse the spread operator (`...`) to prepend any additional supplied parameters to the arguments.\n\n",
         "codeBlocks": {
-          "es6": "const bindKey = (context, fn, ...boundArgs) => (...args) =>\r\n  context[fn].apply(context, [...boundArgs, ...args]);",
+          "es6": "const bindKey = (context, fn, ...boundArgs) => (...args) =>\n  context[fn].apply(context, [...boundArgs, ...args]);",
           "es5": "var bindKey = function bindKey(context, fn) {\n  for (var _len = arguments.length, boundArgs = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {\n    boundArgs[_key - 2] = arguments[_key];\n  }\n\n  return function () {\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return context[fn].apply(context, [].concat(boundArgs, args));\n  };\n};",
-          "example": "const freddy = {\r\n  user: 'fred',\r\n  greet: function(greeting, punctuation) {\r\n    return greeting + ' ' + this.user + punctuation;\r\n  }\r\n};\r\nconst freddyBound = bindKey(freddy, 'greet');\r\nconsole.log(freddyBound('hi', '!')); // 'hi fred!'"
+          "example": "const freddy = {\n  user: 'fred',\n  greet: function(greeting, punctuation) {\n    return greeting + ' ' + this.user + punctuation;\n  }\n};\nconst freddyBound = bindKey(freddy, 'greet');\nconsole.log(freddyBound('hi', '!')); // 'hi fred!'"
         },
         "tags": [
           "function",
@@ -349,7 +349,7 @@
         ]
       },
       "meta": {
-        "hash": "f1c96f05acac42f40c9a13c109452c56a50d986a7f80ce3f62a2df0574b98ea7"
+        "hash": "e854f774dd81cdb291fb57b276a61e5d7f7ab13a6aae490c89c0e00acde820b4"
       }
     },
     {
@@ -360,7 +360,7 @@
         "fileName": "binomialCoefficient.md",
         "text": "Evaluates the binomial coefficient of two integers `n` and `k`.\n\nUse `Number.isNaN()` to check if any of the two values is `NaN`.\nCheck if `k` is less than `0`, greater than or equal to `n`, equal to `1` or `n - 1` and return the appropriate result.\nCheck if `n - k` is less than `k` and switch their values accordingly.\nLoop from `2` through `k` and calculate the binomial coefficient.\nUse `Math.round()` to account for rounding errors in the calculation.\n\n",
         "codeBlocks": {
-          "es6": "const binomialCoefficient = (n, k) => {\r\n  if (Number.isNaN(n) || Number.isNaN(k)) return NaN;\r\n  if (k < 0 || k > n) return 0;\r\n  if (k === 0 || k === n) return 1;\r\n  if (k === 1 || k === n - 1) return n;\r\n  if (n - k < k) k = n - k;\r\n  let res = n;\r\n  for (let j = 2; j <= k; j++) res *= (n - j + 1) / j;\r\n  return Math.round(res);\r\n};",
+          "es6": "const binomialCoefficient = (n, k) => {\n  if (Number.isNaN(n) || Number.isNaN(k)) return NaN;\n  if (k < 0 || k > n) return 0;\n  if (k === 0 || k === n) return 1;\n  if (k === 1 || k === n - 1) return n;\n  if (n - k < k) k = n - k;\n  let res = n;\n  for (let j = 2; j <= k; j++) res *= (n - j + 1) / j;\n  return Math.round(res);\n};",
           "es5": "var binomialCoefficient = function binomialCoefficient(n, k) {\n  if (Number.isNaN(n) || Number.isNaN(k)) return NaN;\n  if (k < 0 || k > n) return 0;\n  if (k === 0 || k === n) return 1;\n  if (k === 1 || k === n - 1) return n;\n  if (n - k < k) k = n - k;\n  var res = n;\n\n  for (var j = 2; j <= k; j++) {\n    res *= (n - j + 1) / j;\n  }\n\n  return Math.round(res);\n};",
           "example": "binomialCoefficient(8, 2); // 28"
         },
@@ -370,7 +370,7 @@
         ]
       },
       "meta": {
-        "hash": "d78f9673883b943ed53c81d5d26c5b3540d4f8a96e2d0803a9947a9d297aaae4"
+        "hash": "0f36f6b8c7f803a55d8e888c8794cacba02db79c4d54043a8ddc71249c2f8a9f"
       }
     },
     {
@@ -381,7 +381,7 @@
         "fileName": "bottomVisible.md",
         "text": "Returns `true` if the bottom of the page is visible, `false` otherwise.\n\nUse `scrollY`, `scrollHeight` and `clientHeight` to determine if the bottom of the page is visible.\n\n",
         "codeBlocks": {
-          "es6": "const bottomVisible = () =>\r\n  document.documentElement.clientHeight + window.scrollY >=\r\n  (document.documentElement.scrollHeight || document.documentElement.clientHeight);",
+          "es6": "const bottomVisible = () =>\n  document.documentElement.clientHeight + window.scrollY >=\n  (document.documentElement.scrollHeight || document.documentElement.clientHeight);",
           "es5": "var bottomVisible = function bottomVisible() {\n  return document.documentElement.clientHeight + window.scrollY >= (document.documentElement.scrollHeight || document.documentElement.clientHeight);\n};",
           "example": "bottomVisible(); // true"
         },
@@ -391,7 +391,7 @@
         ]
       },
       "meta": {
-        "hash": "348cfaf2c4fdb8abe8ff462c5efe88be089e476dcdc828968dd9b5a96b8e3619"
+        "hash": "9c2b4a28ae4f39cc034dc75e98d2f405af6113541f796041f142b85e90e27800"
       }
     },
     {
@@ -414,7 +414,7 @@
         ]
       },
       "meta": {
-        "hash": "f6a129bf5ba0c8d340f92e043f442c7a212e78b2e158f638666fbb90b9ff5c7e"
+        "hash": "1c7836009987b8b1097b54a84c38144f6cb643477f08f00b1a37e274cf0c9f78"
       }
     },
     {
@@ -427,7 +427,7 @@
         "codeBlocks": {
           "es6": "const byteSize = str => new Blob([str]).size;",
           "es5": "var byteSize = function byteSize(str) {\n  return new Blob([str]).size;\n};",
-          "example": "byteSize('😀'); // 4\r\nbyteSize('Hello World'); // 11"
+          "example": "byteSize('😀'); // 4\nbyteSize('Hello World'); // 11"
         },
         "tags": [
           "string",
@@ -435,7 +435,7 @@
         ]
       },
       "meta": {
-        "hash": "a4d6775c44461cf0cd3cb9a8e9ee50131ac0fe4b420ec7107397b85e0cb76e63"
+        "hash": "c347c3d7b5fdc40df6d480810318d1ba644a74719bda3708b3ee3290f0ff953f"
       }
     },
     {
@@ -468,9 +468,9 @@
         "fileName": "capitalize.md",
         "text": "Capitalizes the first letter of a string.\n\nUse array destructuring and `String.prototype.toUpperCase()` to capitalize first letter, `...rest` to get array of characters after first letter and then `Array.prototype.join('')` to make it a string again.\nOmit the `lowerRest` parameter to keep the rest of the string intact, or set it to `true` to convert to lowercase.\n\n",
         "codeBlocks": {
-          "es6": "const capitalize = ([first, ...rest], lowerRest = false) =>\r\n  first.toUpperCase() + (lowerRest ? rest.join('').toLowerCase() : rest.join(''));",
+          "es6": "const capitalize = ([first, ...rest], lowerRest = false) =>\n  first.toUpperCase() + (lowerRest ? rest.join('').toLowerCase() : rest.join(''));",
           "es5": "function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar capitalize = function capitalize(_ref) {\n  var _ref2 = _toArray(_ref),\n      first = _ref2[0],\n      rest = _ref2.slice(1);\n\n  var lowerRest = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  return first.toUpperCase() + (lowerRest ? rest.join('').toLowerCase() : rest.join(''));\n};",
-          "example": "capitalize('fooBar'); // 'FooBar'\r\ncapitalize('fooBar', true); // 'Foobar'"
+          "example": "capitalize('fooBar'); // 'FooBar'\ncapitalize('fooBar', true); // 'Foobar'"
         },
         "tags": [
           "string",
@@ -479,7 +479,7 @@
         ]
       },
       "meta": {
-        "hash": "25c1d02c0694607506c11337b1358c7377cffb926dcc830d93e59ddc143d5088"
+        "hash": "0c94a28b30fdfe112c8981a86868917d24cc5ddd1c84212a29783cec2d3a5ab4"
       }
     },
     {
@@ -501,7 +501,7 @@
         ]
       },
       "meta": {
-        "hash": "0c7a7de067c94153cd20954eedce399674ca96a6d2fd3352bb7c7c6f903f6245"
+        "hash": "aaf38afdc8033b2070b0e29ddb380db8570bbed490c6f39f55ff95167cdded8e"
       }
     },
     {
@@ -514,7 +514,7 @@
         "codeBlocks": {
           "es6": "const castArray = val => (Array.isArray(val) ? val : [val]);",
           "es5": "var castArray = function castArray(val) {\n  return Array.isArray(val) ? val : [val];\n};",
-          "example": "castArray('foo'); // ['foo']\r\ncastArray([1]); // [1]"
+          "example": "castArray('foo'); // ['foo']\ncastArray([1]); // [1]"
         },
         "tags": [
           "utility",
@@ -524,7 +524,7 @@
         ]
       },
       "meta": {
-        "hash": "aec0506ead3912f02cc5bdc4448366ca602c9a3a2ea61033c93c6d40497bfc23"
+        "hash": "307add91ea4d5c2a122256f799120f580ac235567523dddeeadd6500f1e81e94"
       }
     },
     {
@@ -535,9 +535,9 @@
         "fileName": "chainAsync.md",
         "text": "Chains asynchronous functions.\n\nLoop through an array of functions containing asynchronous events, calling `next` when each asynchronous event has completed.\n\n",
         "codeBlocks": {
-          "es6": "const chainAsync = fns => {\r\n  let curr = 0;\r\n  const last = fns[fns.length - 1];\r\n  const next = () => {\r\n    const fn = fns[curr++];\r\n    fn === last ? fn() : fn(next);\r\n  };\r\n  next();\r\n};",
+          "es6": "const chainAsync = fns => {\n  let curr = 0;\n  const last = fns[fns.length - 1];\n  const next = () => {\n    const fn = fns[curr++];\n    fn === last ? fn() : fn(next);\n  };\n  next();\n};",
           "es5": "var chainAsync = function chainAsync(fns) {\n  var curr = 0;\n  var last = fns[fns.length - 1];\n\n  var next = function next() {\n    var fn = fns[curr++];\n    fn === last ? fn() : fn(next);\n  };\n\n  next();\n};",
-          "example": "chainAsync([\r\n  next => {\r\n    console.log('0 seconds');\r\n    setTimeout(next, 1000);\r\n  },\r\n  next => {\r\n    console.log('1 second');\r\n    setTimeout(next, 1000);\r\n  },\r\n  () => {\r\n    console.log('2 second');\r\n  }\r\n]);"
+          "example": "chainAsync([\n  next => {\n    console.log('0 seconds');\n    setTimeout(next, 1000);\n  },\n  next => {\n    console.log('1 second');\n    setTimeout(next, 1000);\n  },\n  () => {\n    console.log('2 second');\n  }\n]);"
         },
         "tags": [
           "function",
@@ -545,7 +545,7 @@
         ]
       },
       "meta": {
-        "hash": "ef2a259b2e9abecd2682f8283640a15f6ebb96dc5566e85500bb7b27758fa4bb"
+        "hash": "cd48981af62f6ba75694f796fc5537e6af53a58045465ebd52f8bdd1a1f892af"
       }
     },
     {
@@ -558,7 +558,7 @@
         "codeBlocks": {
           "es6": "const checkProp = (predicate, prop) => obj => !!predicate(obj[prop]);",
           "es5": "var checkProp = function checkProp(predicate, prop) {\n  return function (obj) {\n    return !!predicate(obj[prop]);\n  };\n};",
-          "example": "const lengthIs4 = checkProp(l => l === 4, 'length');\r\nlengthIs4([]); // false\r\nlengthIs4([1,2,3,4]); // true\r\nlengthIs4(new Set([1,2,3,4])); // false (Set uses Size, not length)\r\n\r\nconst session = { user: {} };\r\nconst validUserSession = checkProps(u => u.active && !u.disabled, 'user');\r\n\r\nvalidUserSession(session); // false\r\n\r\nsession.user.active = true;\r\nvalidUserSession(session); // true\r\n\r\nconst noLength(l => l === undefined, 'length');\r\nnoLength([]); // false\r\nnoLength({}); // true\r\nnoLength(new Set()); // true"
+          "example": "const lengthIs4 = checkProp(l => l === 4, 'length');\nlengthIs4([]); // false\nlengthIs4([1,2,3,4]); // true\nlengthIs4(new Set([1,2,3,4])); // false (Set uses Size, not length)\n\nconst session = { user: {} };\nconst validUserSession = checkProps(u => u.active && !u.disabled, 'user');\n\nvalidUserSession(session); // false\n\nsession.user.active = true;\nvalidUserSession(session); // true\n\nconst noLength(l => l === undefined, 'length');\nnoLength([]); // false\nnoLength({}); // true\nnoLength(new Set()); // true"
         },
         "tags": [
           "function",
@@ -568,7 +568,7 @@
         ]
       },
       "meta": {
-        "hash": "be39d8ec43f9e0f316cae59520cdd07ff9e912002d881c36df1472dd7a09d1f8"
+        "hash": "28eacf8643be19ca8fd83f3093d6641753857656bd6180c8e5f60c1a52df175f"
       }
     },
     {
@@ -579,7 +579,7 @@
         "fileName": "chunk.md",
         "text": "Chunks an array into smaller arrays of a specified size.\n\nUse `Array.from()` to create a new array, that fits the number of chunks that will be produced.\nUse `Array.prototype.slice()` to map each element of the new array to a chunk the length of `size`.\nIf the original array can't be split evenly, the final chunk will contain the remaining elements.\n\n",
         "codeBlocks": {
-          "es6": "const chunk = (arr, size) =>\r\n  Array.from({ length: Math.ceil(arr.length / size) }, (v, i) =>\r\n    arr.slice(i * size, i * size + size)\r\n  );",
+          "es6": "const chunk = (arr, size) =>\n  Array.from({ length: Math.ceil(arr.length / size) }, (v, i) =>\n    arr.slice(i * size, i * size + size)\n  );",
           "es5": "var chunk = function chunk(arr, size) {\n  return Array.from({\n    length: Math.ceil(arr.length / size)\n  }, function (v, i) {\n    return arr.slice(i * size, i * size + size);\n  });\n};",
           "example": "chunk([1, 2, 3, 4, 5], 2); // [[1,2],[3,4],[5]]"
         },
@@ -589,7 +589,7 @@
         ]
       },
       "meta": {
-        "hash": "2b1b203a374b92765b3beae0556ebc0896f082f6ebe719dc412c3f7a01794446"
+        "hash": "4af3783b8b490cdf70853b0a01780244556a18a7398f5bef123e4f39edbadebe"
       }
     },
     {
@@ -602,7 +602,7 @@
         "codeBlocks": {
           "es6": "const clampNumber = (num, a, b) => Math.max(Math.min(num, Math.max(a, b)), Math.min(a, b));",
           "es5": "var clampNumber = function clampNumber(num, a, b) {\n  return Math.max(Math.min(num, Math.max(a, b)), Math.min(a, b));\n};",
-          "example": "clampNumber(2, 3, 5); // 3\r\nclampNumber(1, -1, -5); // -1"
+          "example": "clampNumber(2, 3, 5); // 3\nclampNumber(1, -1, -5); // -1"
         },
         "tags": [
           "math",
@@ -610,7 +610,7 @@
         ]
       },
       "meta": {
-        "hash": "f6f185c1c57d7808281aff9683804bd38605e8cbdb09f9243f3467fc116aef2d"
+        "hash": "32fc5181c38c6d5bb16ac7373b68ad971c6b3cff6b80aee8cb69c296d47d0607"
       }
     },
     {
@@ -623,7 +623,7 @@
         "codeBlocks": {
           "es6": "const cloneRegExp = regExp => new RegExp(regExp.source, regExp.flags);",
           "es5": "var cloneRegExp = function cloneRegExp(regExp) {\n  return new RegExp(regExp.source, regExp.flags);\n};",
-          "example": "const regExp = /lorem ipsum/gi;\r\nconst regExp2 = cloneRegExp(regExp); // /lorem ipsum/gi"
+          "example": "const regExp = /lorem ipsum/gi;\nconst regExp2 = cloneRegExp(regExp); // /lorem ipsum/gi"
         },
         "tags": [
           "utility",
@@ -632,7 +632,7 @@
         ]
       },
       "meta": {
-        "hash": "4e974691c9b4f0d2e6e4e1a42b3ba0c6d77fcff5a0b8d8b8f8a8e8375cbf0cf7"
+        "hash": "3b7e9a506c229c792da093336574e3524cd1a8c794d18fc450f469f171ff83cf"
       }
     },
     {
@@ -653,7 +653,7 @@
         ]
       },
       "meta": {
-        "hash": "f262e963f6132fe5bd591a77a74444ca8ba46bf2cbd9870ddbdd5edffc25c45c"
+        "hash": "52b7275a934c85ccab144c174f07cf0f3aaf8b1dee913abab020b1be9666d021"
       }
     },
     {
@@ -666,7 +666,7 @@
         "codeBlocks": {
           "es6": "const coalesceFactory = valid => (...args) => args.find(valid);",
           "es5": "var coalesceFactory = function coalesceFactory(valid) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return args.find(valid);\n  };\n};",
-          "example": "const customCoalesce = coalesceFactory(_ => ![null, undefined, '', NaN].includes(_));\r\ncustomCoalesce(undefined, null, NaN, '', 'Waldo'); // \"Waldo\""
+          "example": "const customCoalesce = coalesceFactory(_ => ![null, undefined, '', NaN].includes(_));\ncustomCoalesce(undefined, null, NaN, '', 'Waldo'); // \"Waldo\""
         },
         "tags": [
           "utility",
@@ -674,7 +674,7 @@
         ]
       },
       "meta": {
-        "hash": "9d42c6146a3fe951276cdd794cad840c31a9dc5e818f230d7613326e512d238e"
+        "hash": "b85ec57d815ff34ba3906195440fce5d2ad9f33b64d7d96159c0e1125fee283c"
       }
     },
     {
@@ -708,9 +708,9 @@
         "fileName": "colorize.md",
         "text": "Add special characters to text to print in color in the console (combined with `console.log()`).\n\nUse template literals and special characters to add the appropriate color code to the string output.\nFor background colors, add a special character that resets the background color at the end of the string.\n\n",
         "codeBlocks": {
-          "es6": "const colorize = (...args) => ({\r\n  black: `\\x1b[30m${args.join(' ')}`,\r\n  red: `\\x1b[31m${args.join(' ')}`,\r\n  green: `\\x1b[32m${args.join(' ')}`,\r\n  yellow: `\\x1b[33m${args.join(' ')}`,\r\n  blue: `\\x1b[34m${args.join(' ')}`,\r\n  magenta: `\\x1b[35m${args.join(' ')}`,\r\n  cyan: `\\x1b[36m${args.join(' ')}`,\r\n  white: `\\x1b[37m${args.join(' ')}`,\r\n  bgBlack: `\\x1b[40m${args.join(' ')}\\x1b[0m`,\r\n  bgRed: `\\x1b[41m${args.join(' ')}\\x1b[0m`,\r\n  bgGreen: `\\x1b[42m${args.join(' ')}\\x1b[0m`,\r\n  bgYellow: `\\x1b[43m${args.join(' ')}\\x1b[0m`,\r\n  bgBlue: `\\x1b[44m${args.join(' ')}\\x1b[0m`,\r\n  bgMagenta: `\\x1b[45m${args.join(' ')}\\x1b[0m`,\r\n  bgCyan: `\\x1b[46m${args.join(' ')}\\x1b[0m`,\r\n  bgWhite: `\\x1b[47m${args.join(' ')}\\x1b[0m`\r\n});",
+          "es6": "const colorize = (...args) => ({\n  black: `\\x1b[30m${args.join(' ')}`,\n  red: `\\x1b[31m${args.join(' ')}`,\n  green: `\\x1b[32m${args.join(' ')}`,\n  yellow: `\\x1b[33m${args.join(' ')}`,\n  blue: `\\x1b[34m${args.join(' ')}`,\n  magenta: `\\x1b[35m${args.join(' ')}`,\n  cyan: `\\x1b[36m${args.join(' ')}`,\n  white: `\\x1b[37m${args.join(' ')}`,\n  bgBlack: `\\x1b[40m${args.join(' ')}\\x1b[0m`,\n  bgRed: `\\x1b[41m${args.join(' ')}\\x1b[0m`,\n  bgGreen: `\\x1b[42m${args.join(' ')}\\x1b[0m`,\n  bgYellow: `\\x1b[43m${args.join(' ')}\\x1b[0m`,\n  bgBlue: `\\x1b[44m${args.join(' ')}\\x1b[0m`,\n  bgMagenta: `\\x1b[45m${args.join(' ')}\\x1b[0m`,\n  bgCyan: `\\x1b[46m${args.join(' ')}\\x1b[0m`,\n  bgWhite: `\\x1b[47m${args.join(' ')}\\x1b[0m`\n});",
           "es5": "var colorize = function colorize() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  return {\n    black: \"\\x1B[30m\".concat(args.join(' ')),\n    red: \"\\x1B[31m\".concat(args.join(' ')),\n    green: \"\\x1B[32m\".concat(args.join(' ')),\n    yellow: \"\\x1B[33m\".concat(args.join(' ')),\n    blue: \"\\x1B[34m\".concat(args.join(' ')),\n    magenta: \"\\x1B[35m\".concat(args.join(' ')),\n    cyan: \"\\x1B[36m\".concat(args.join(' ')),\n    white: \"\\x1B[37m\".concat(args.join(' ')),\n    bgBlack: \"\\x1B[40m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgRed: \"\\x1B[41m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgGreen: \"\\x1B[42m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgYellow: \"\\x1B[43m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgBlue: \"\\x1B[44m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgMagenta: \"\\x1B[45m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgCyan: \"\\x1B[46m\".concat(args.join(' '), \"\\x1B[0m\"),\n    bgWhite: \"\\x1B[47m\".concat(args.join(' '), \"\\x1B[0m\")\n  };\n};",
-          "example": "console.log(colorize('foo').red); // 'foo' (red letters)\r\nconsole.log(colorize('foo', 'bar').bgBlue); // 'foo bar' (blue background)\r\nconsole.log(colorize(colorize('foo').yellow, colorize('foo').green).bgWhite); // 'foo bar' (first word in yellow letters, second word in green letters, white background for both)"
+          "example": "console.log(colorize('foo').red); // 'foo' (red letters)\nconsole.log(colorize('foo', 'bar').bgBlue); // 'foo bar' (blue background)\nconsole.log(colorize(colorize('foo').yellow, colorize('foo').green).bgWhite); // 'foo bar' (first word in yellow letters, second word in green letters, white background for both)"
         },
         "tags": [
           "node",
@@ -720,7 +720,7 @@
         ]
       },
       "meta": {
-        "hash": "7fc9cdc29a2d09e99d73f64420e54ff66ca8217a9a354040c2c06d7e457f65b2"
+        "hash": "1ce726b8cbc9f87ff8ff6d68e0678325523b1118fa038b97f53ddad9031dbe23"
       }
     },
     {
@@ -741,7 +741,7 @@
         ]
       },
       "meta": {
-        "hash": "04a95c1797fd7aa7bc05f96e29d06bf6c1f32be5803c64d319f917705bf3b5e0"
+        "hash": "fdd7fd5631e5c1b541eff445f3388488dc060d435e339d9c0f1f257d5733e2fe"
       }
     },
     {
@@ -754,7 +754,7 @@
         "codeBlocks": {
           "es6": "const compactWhitespace = str => str.replace(/\\s{2,}/g, ' ');",
           "es5": "var compactWhitespace = function compactWhitespace(str) {\n  return str.replace(/\\s{2,}/g, ' ');\n};",
-          "example": "compactWhitespace('Lorem    Ipsum'); // 'Lorem Ipsum'\r\ncompactWhitespace('Lorem \\n Ipsum'); // 'Lorem Ipsum'"
+          "example": "compactWhitespace('Lorem    Ipsum'); // 'Lorem Ipsum'\ncompactWhitespace('Lorem \\n Ipsum'); // 'Lorem Ipsum'"
         },
         "tags": [
           "string",
@@ -763,7 +763,7 @@
         ]
       },
       "meta": {
-        "hash": "854dabca292eb78b0c4c59bce756519c1a25ea7ffab28a5498d62b4574ed2222"
+        "hash": "7b6007e94c262a97cfab69ddb111d101103c095dbf2fd7680053d8733e6f2914"
       }
     },
     {
@@ -776,7 +776,7 @@
         "codeBlocks": {
           "es6": "const compose = (...fns) => fns.reduce((f, g) => (...args) => f(g(...args)));",
           "es5": "var compose = function compose() {\n  for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n    fns[_key] = arguments[_key];\n  }\n\n  return fns.reduce(function (f, g) {\n    return function () {\n      return f(g.apply(void 0, arguments));\n    };\n  });\n};",
-          "example": "const add5 = x => x + 5;\r\nconst multiply = (x, y) => x * y;\r\nconst multiplyAndAdd5 = compose(\r\n  add5,\r\n  multiply\r\n);\r\nmultiplyAndAdd5(5, 2); // 15"
+          "example": "const add5 = x => x + 5;\nconst multiply = (x, y) => x * y;\nconst multiplyAndAdd5 = compose(\n  add5,\n  multiply\n);\nmultiplyAndAdd5(5, 2); // 15"
         },
         "tags": [
           "function",
@@ -784,7 +784,7 @@
         ]
       },
       "meta": {
-        "hash": "9b1dd4a7f03c002c2c87e1d45731a005e51d668045e74905e9426e51755e81a9"
+        "hash": "200b26d1e1016c56ba796665b94266e57127b6bcf23bb00b702df01676f95443"
       }
     },
     {
@@ -797,7 +797,7 @@
         "codeBlocks": {
           "es6": "const composeRight = (...fns) => fns.reduce((f, g) => (...args) => g(f(...args)));",
           "es5": "var composeRight = function composeRight() {\n  for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n    fns[_key] = arguments[_key];\n  }\n\n  return fns.reduce(function (f, g) {\n    return function () {\n      return g(f.apply(void 0, arguments));\n    };\n  });\n};",
-          "example": "const add = (x, y) => x + y;\r\nconst square = x => x * x;\r\nconst addAndSquare = composeRight(add, square);\r\naddAndSquare(1, 2); // 9"
+          "example": "const add = (x, y) => x + y;\nconst square = x => x * x;\nconst addAndSquare = composeRight(add, square);\naddAndSquare(1, 2); // 9"
         },
         "tags": [
           "function",
@@ -805,7 +805,7 @@
         ]
       },
       "meta": {
-        "hash": "abfcd43f5c62b661c869442e2be78c58d2a2b943dc76ef1e64b06df0e11b8870"
+        "hash": "90b2780517322e1c847b7e7ae5325f1e69765eb22b72cf3472e1cd7d07f06347"
       }
     },
     {
@@ -818,7 +818,7 @@
         "codeBlocks": {
           "es6": "const converge = (converger, fns) => (...args) => converger(...fns.map(fn => fn.apply(null, args)));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar converge = function converge(converger, fns) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return converger.apply(void 0, _toConsumableArray(fns.map(function (fn) {\n      return fn.apply(null, args);\n    })));\n  };\n};",
-          "example": "const average = converge((a, b) => a / b, [\r\n  arr => arr.reduce((a, v) => a + v, 0),\r\n  arr => arr.length\r\n]);\r\naverage([1, 2, 3, 4, 5, 6, 7]); // 4"
+          "example": "const average = converge((a, b) => a / b, [\n  arr => arr.reduce((a, v) => a + v, 0),\n  arr => arr.length\n]);\naverage([1, 2, 3, 4, 5, 6, 7]); // 4"
         },
         "tags": [
           "function",
@@ -826,7 +826,7 @@
         ]
       },
       "meta": {
-        "hash": "08033f31f81d5bd2fc8dc44b2212a7aa23e21f508fd77a6e90baacfc11ba02bd"
+        "hash": "37cf3e2c4a2b41cb94eab31680088761236be2fc817c2c4322a0f9f1a16ae475"
       }
     },
     {
@@ -837,7 +837,7 @@
         "fileName": "copyToClipboard.md",
         "text": "⚠️ **NOTICE:** The same functionality can be easily implemented by using the new asynchronous Clipboard API, which is still experimental but should be used in the future instead of this snippet. Find out more about it [here](https://github.com/w3c/clipboard-apis/blob/master/explainer.adoc#writing-to-the-clipboard).\n\nCopy a string to the clipboard. \nOnly works as a result of user action (i.e. inside a `click` event listener).\n\nCreate a new `<textarea>` element, fill it with the supplied data and add it to the HTML document.\nUse `Selection.getRangeAt()`to store the selected range (if any).\nUse `document.execCommand('copy')` to copy to the clipboard.\nRemove the `<textarea>` element from the HTML document.\nFinally, use `Selection().addRange()` to recover the original selected range (if any).\n\n",
         "codeBlocks": {
-          "es6": "const copyToClipboard = str => {\r\n  const el = document.createElement('textarea');\r\n  el.value = str;\r\n  el.setAttribute('readonly', '');\r\n  el.style.position = 'absolute';\r\n  el.style.left = '-9999px';\r\n  document.body.appendChild(el);\r\n  const selected =\r\n    document.getSelection().rangeCount > 0 ? document.getSelection().getRangeAt(0) : false;\r\n  el.select();\r\n  document.execCommand('copy');\r\n  document.body.removeChild(el);\r\n  if (selected) {\r\n    document.getSelection().removeAllRanges();\r\n    document.getSelection().addRange(selected);\r\n  }\r\n};",
+          "es6": "const copyToClipboard = str => {\n  const el = document.createElement('textarea');\n  el.value = str;\n  el.setAttribute('readonly', '');\n  el.style.position = 'absolute';\n  el.style.left = '-9999px';\n  document.body.appendChild(el);\n  const selected =\n    document.getSelection().rangeCount > 0 ? document.getSelection().getRangeAt(0) : false;\n  el.select();\n  document.execCommand('copy');\n  document.body.removeChild(el);\n  if (selected) {\n    document.getSelection().removeAllRanges();\n    document.getSelection().addRange(selected);\n  }\n};",
           "es5": "var copyToClipboard = function copyToClipboard(str) {\n  var el = document.createElement('textarea');\n  el.value = str;\n  el.setAttribute('readonly', '');\n  el.style.position = 'absolute';\n  el.style.left = '-9999px';\n  document.body.appendChild(el);\n  var selected = document.getSelection().rangeCount > 0 ? document.getSelection().getRangeAt(0) : false;\n  el.select();\n  document.execCommand('copy');\n  document.body.removeChild(el);\n\n  if (selected) {\n    document.getSelection().removeAllRanges();\n    document.getSelection().addRange(selected);\n  }\n};",
           "example": "copyToClipboard('Lorem ipsum'); // 'Lorem ipsum' copied to clipboard."
         },
@@ -848,7 +848,7 @@
         ]
       },
       "meta": {
-        "hash": "56a8c13a6c4690c7dad8863bee6f3c77c6b7ea6eff6e783d45cec85e471a4d4f"
+        "hash": "b16e20cca806e64e7d4d81d774e21e9fd6554f55121a53db8b74907ff148ee2f"
       }
     },
     {
@@ -859,9 +859,9 @@
         "fileName": "countBy.md",
         "text": "Groups the elements of an array based on the given function and returns the count of elements in each group.\n\nUse `Array.prototype.map()` to map the values of an array to a function or property name.\nUse `Array.prototype.reduce()` to create an object, where the keys are produced from the mapped results.\n\n",
         "codeBlocks": {
-          "es6": "const countBy = (arr, fn) =>\r\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => {\r\n    acc[val] = (acc[val] || 0) + 1;\r\n    return acc;\r\n  }, {});",
+          "es6": "const countBy = (arr, fn) =>\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => {\n    acc[val] = (acc[val] || 0) + 1;\n    return acc;\n  }, {});",
           "es5": "var countBy = function countBy(arr, fn) {\n  return arr.map(typeof fn === 'function' ? fn : function (val) {\n    return val[fn];\n  }).reduce(function (acc, val) {\n    acc[val] = (acc[val] || 0) + 1;\n    return acc;\n  }, {});\n};",
-          "example": "countBy([6.1, 4.2, 6.3], Math.floor); // {4: 1, 6: 2}\r\ncountBy(['one', 'two', 'three'], 'length'); // {3: 2, 5: 1}"
+          "example": "countBy([6.1, 4.2, 6.3], Math.floor); // {4: 1, 6: 2}\ncountBy(['one', 'two', 'three'], 'length'); // {3: 2, 5: 1}"
         },
         "tags": [
           "array",
@@ -870,7 +870,7 @@
         ]
       },
       "meta": {
-        "hash": "2dc70fb8b6ac6b30e9a2f0c343ab99b233af3a971ddfa166dd8285a6737741e7"
+        "hash": "d5c19dc814e9776782419f3e560dd132c1fdbf0493162e8a7a05b6ac84991f87"
       }
     },
     {
@@ -881,7 +881,7 @@
         "fileName": "counter.md",
         "text": "Creates a counter with the specified range, step and duration for the specified selector.\n\nCheck if `step` has the proper sign and change it accordingly.\nUse `setInterval()` in combination with `Math.abs()` and `Math.floor()` to calculate the time between each new text draw.\nUse `document.querySelector().innerHTML` to update the value of the selected element.\nOmit the fourth parameter, `step`, to use a default step of `1`.\nOmit the fifth parameter, `duration`, to use a default duration of `2000`ms.\n\n",
         "codeBlocks": {
-          "es6": "const counter = (selector, start, end, step = 1, duration = 2000) => {\r\n  let current = start,\r\n    _step = (end - start) * step < 0 ? -step : step,\r\n    timer = setInterval(() => {\r\n      current += _step;\r\n      document.querySelector(selector).innerHTML = current;\r\n      if (current >= end) document.querySelector(selector).innerHTML = end;\r\n      if (current >= end) clearInterval(timer);\r\n    }, Math.abs(Math.floor(duration / (end - start))));\r\n  return timer;\r\n};",
+          "es6": "const counter = (selector, start, end, step = 1, duration = 2000) => {\n  let current = start,\n    _step = (end - start) * step < 0 ? -step : step,\n    timer = setInterval(() => {\n      current += _step;\n      document.querySelector(selector).innerHTML = current;\n      if (current >= end) document.querySelector(selector).innerHTML = end;\n      if (current >= end) clearInterval(timer);\n    }, Math.abs(Math.floor(duration / (end - start))));\n  return timer;\n};",
           "es5": "var counter = function counter(selector, start, end) {\n  var step = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 1;\n  var duration = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 2000;\n\n  var current = start,\n      _step = (end - start) * step < 0 ? -step : step,\n      timer = setInterval(function () {\n    current += _step;\n    document.querySelector(selector).innerHTML = current;\n    if (current >= end) document.querySelector(selector).innerHTML = end;\n    if (current >= end) clearInterval(timer);\n  }, Math.abs(Math.floor(duration / (end - start))));\n\n  return timer;\n};",
           "example": "counter('#my-id', 1, 1000, 5, 2000); // Creates a 2-second timer for the element with id=\"my-id\""
         },
@@ -891,7 +891,7 @@
         ]
       },
       "meta": {
-        "hash": "881f231c303383291de5f2e3efff58e87caf5f2b0ace76bfa2d0b6f4ac410651"
+        "hash": "3143db5361ae9b8f20ee19ab2d5baeeebb976a195f60110522b558873204142c"
       }
     },
     {
@@ -912,7 +912,7 @@
         ]
       },
       "meta": {
-        "hash": "8375e1ddc19d512beea10d30087756e14d7920f6aaf98a0e1e7ff95e1fb95669"
+        "hash": "1ae0916c575409305f4e1f1a2af7966f0f4b9260a9986711805a936ac6ebd9f7"
       }
     },
     {
@@ -923,7 +923,7 @@
         "fileName": "createDirIfNotExists.md",
         "text": "Creates a directory, if it does not exist.\n\nUse `fs.existsSync()` to check if the directory exists, `fs.mkdirSync()` to create it.\n\n",
         "codeBlocks": {
-          "es6": "const fs = require('fs');\r\nconst createDirIfNotExists = dir => (!fs.existsSync(dir) ? fs.mkdirSync(dir) : undefined);",
+          "es6": "const fs = require('fs');\nconst createDirIfNotExists = dir => (!fs.existsSync(dir) ? fs.mkdirSync(dir) : undefined);",
           "es5": "var fs = require('fs');\n\nvar createDirIfNotExists = function createDirIfNotExists(dir) {\n  return !fs.existsSync(dir) ? fs.mkdirSync(dir) : undefined;\n};",
           "example": "createDirIfNotExists('test'); // creates the directory 'test', if it doesn't exist"
         },
@@ -933,7 +933,7 @@
         ]
       },
       "meta": {
-        "hash": "8eb84f760e2aeab6861a1cc8ad350151dd860833031884e8b8d26264efe6ef78"
+        "hash": "233be96d6436773d7f6ceb16ad0cf63bdc63a961b59fc1faa11707af182ed510"
       }
     },
     {
@@ -944,9 +944,9 @@
         "fileName": "createElement.md",
         "text": "Creates an element from a string (without appending it to the document). \nIf the given string contains multiple elements, only the first one will be returned.\n\nUse `document.createElement()` to create a new element.\nSet its `innerHTML` to the string supplied as the argument. \nUse `ParentNode.firstElementChild` to return the element version of the string.\n\n",
         "codeBlocks": {
-          "es6": "const createElement = str => {\r\n  const el = document.createElement('div');\r\n  el.innerHTML = str;\r\n  return el.firstElementChild;\r\n};",
+          "es6": "const createElement = str => {\n  const el = document.createElement('div');\n  el.innerHTML = str;\n  return el.firstElementChild;\n};",
           "es5": "var createElement = function createElement(str) {\n  var el = document.createElement('div');\n  el.innerHTML = str;\n  return el.firstElementChild;\n};",
-          "example": "const el = createElement(\r\n  `<div class=\"container\">\r\n    <p>Hello!</p>\r\n  </div>`\r\n);\r\nconsole.log(el.className); // 'container'"
+          "example": "const el = createElement(\n  `<div class=\"container\">\n    <p>Hello!</p>\n  </div>`\n);\nconsole.log(el.className); // 'container'"
         },
         "tags": [
           "browser",
@@ -955,7 +955,7 @@
         ]
       },
       "meta": {
-        "hash": "b63204ae9283c6f270a60d4c0068af300f8bb93d3622526ce764f47c0a1e0a7b"
+        "hash": "d162fbc50166f304216db6ea700e5fc7f428ea33d50b204ae921e1c58552a4e0"
       }
     },
     {
@@ -966,9 +966,9 @@
         "fileName": "createEventHub.md",
         "text": "Creates a pub/sub ([publish–subscribe](https://en.wikipedia.org/wiki/Publish%E2%80%93subscribe_pattern)) event hub with `emit`, `on`, and `off` methods.\n\nUse `Object.create(null)` to create an empty `hub` object that does not inherit properties from `Object.prototype`.\nFor `emit`, resolve the array of handlers based on the `event` argument and then run each one with `Array.prototype.forEach()` by passing in the data as an argument.\nFor `on`, create an array for the event if it does not yet exist, then use `Array.prototype.push()` to add the handler\nto the array.\nFor `off`, use `Array.prototype.findIndex()` to find the index of the handler in the event array and remove it using `Array.prototype.splice()`.\n\n",
         "codeBlocks": {
-          "es6": "const createEventHub = () => ({\r\n  hub: Object.create(null),\r\n  emit(event, data) {\r\n    (this.hub[event] || []).forEach(handler => handler(data));\r\n  },\r\n  on(event, handler) {\r\n    if (!this.hub[event]) this.hub[event] = [];\r\n    this.hub[event].push(handler);\r\n  },\r\n  off(event, handler) {\r\n    const i = (this.hub[event] || []).findIndex(h => h === handler);\r\n    if (i > -1) this.hub[event].splice(i, 1);\r\n    if (this.hub[event].length === 0) delete this.hub[event];\r\n  }\r\n});",
+          "es6": "const createEventHub = () => ({\n  hub: Object.create(null),\n  emit(event, data) {\n    (this.hub[event] || []).forEach(handler => handler(data));\n  },\n  on(event, handler) {\n    if (!this.hub[event]) this.hub[event] = [];\n    this.hub[event].push(handler);\n  },\n  off(event, handler) {\n    const i = (this.hub[event] || []).findIndex(h => h === handler);\n    if (i > -1) this.hub[event].splice(i, 1);\n    if (this.hub[event].length === 0) delete this.hub[event];\n  }\n});",
           "es5": "var createEventHub = function createEventHub() {\n  return {\n    hub: Object.create(null),\n    emit: function emit(event, data) {\n      (this.hub[event] || []).forEach(function (handler) {\n        return handler(data);\n      });\n    },\n    on: function on(event, handler) {\n      if (!this.hub[event]) this.hub[event] = [];\n      this.hub[event].push(handler);\n    },\n    off: function off(event, handler) {\n      var i = (this.hub[event] || []).findIndex(function (h) {\n        return h === handler;\n      });\n      if (i > -1) this.hub[event].splice(i, 1);\n      if (this.hub[event].length === 0) delete this.hub[event];\n    }\n  };\n};",
-          "example": "const handler = data => console.log(data);\r\nconst hub = createEventHub();\r\nlet increment = 0;\r\n\r\n// Subscribe: listen for different types of events\r\nhub.on('message', handler);\r\nhub.on('message', () => console.log('Message event fired'));\r\nhub.on('increment', () => increment++);\r\n\r\n// Publish: emit events to invoke all handlers subscribed to them, passing the data to them as an argument\r\nhub.emit('message', 'hello world'); // logs 'hello world' and 'Message event fired'\r\nhub.emit('message', { hello: 'world' }); // logs the object and 'Message event fired'\r\nhub.emit('increment'); // `increment` variable is now 1\r\n\r\n// Unsubscribe: stop a specific handler from listening to the 'message' event\r\nhub.off('message', handler);"
+          "example": "const handler = data => console.log(data);\nconst hub = createEventHub();\nlet increment = 0;\n\n// Subscribe: listen for different types of events\nhub.on('message', handler);\nhub.on('message', () => console.log('Message event fired'));\nhub.on('increment', () => increment++);\n\n// Publish: emit events to invoke all handlers subscribed to them, passing the data to them as an argument\nhub.emit('message', 'hello world'); // logs 'hello world' and 'Message event fired'\nhub.emit('message', { hello: 'world' }); // logs the object and 'Message event fired'\nhub.emit('increment'); // `increment` variable is now 1\n\n// Unsubscribe: stop a specific handler from listening to the 'message' event\nhub.off('message', handler);"
         },
         "tags": [
           "browser",
@@ -977,7 +977,7 @@
         ]
       },
       "meta": {
-        "hash": "5a50e92bc701fd0d7afbd508a8eb4d7764dfd591d3c21426fb4c76a922dd4482"
+        "hash": "bc41a9baac70cfa4415f23550ff0f0ac92ad5aa2192e577437e72c732956ada7"
       }
     },
     {
@@ -988,9 +988,9 @@
         "fileName": "CSVToArray.md",
         "text": "Converts a comma-separated values (CSV) string to a 2D array.\n\nUse `Array.prototype.slice()` and `Array.prototype.indexOf('\\n')` to remove the first row (title row) if `omitFirstRow` is `true`.\nUse `String.prototype.split('\\n')` to create a string for each row, then `String.prototype.split(delimiter)` to separate the values in each row.\nOmit the second argument, `delimiter`, to use a default delimiter of `,`.\nOmit the third argument, `omitFirstRow`, to include the first row (title row) of the CSV string.\n\n",
         "codeBlocks": {
-          "es6": "const CSVToArray = (data, delimiter = ',', omitFirstRow = false) =>\r\n  data\r\n    .slice(omitFirstRow ? data.indexOf('\\n') + 1 : 0)\r\n    .split('\\n')\r\n    .map(v => v.split(delimiter));",
+          "es6": "const CSVToArray = (data, delimiter = ',', omitFirstRow = false) =>\n  data\n    .slice(omitFirstRow ? data.indexOf('\\n') + 1 : 0)\n    .split('\\n')\n    .map(v => v.split(delimiter));",
           "es5": "var CSVToArray = function CSVToArray(data) {\n  var delimiter = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n  var omitFirstRow = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  return data.slice(omitFirstRow ? data.indexOf('\\n') + 1 : 0).split('\\n').map(function (v) {\n    return v.split(delimiter);\n  });\n};",
-          "example": "CSVToArray('a,b\\nc,d'); // [['a','b'],['c','d']];\r\nCSVToArray('a;b\\nc;d', ';'); // [['a','b'],['c','d']];\r\nCSVToArray('col1,col2\\na,b\\nc,d', ',', true); // [['a','b'],['c','d']];"
+          "example": "CSVToArray('a,b\\nc,d'); // [['a','b'],['c','d']];\nCSVToArray('a;b\\nc;d', ';'); // [['a','b'],['c','d']];\nCSVToArray('col1,col2\\na,b\\nc,d', ',', true); // [['a','b'],['c','d']];"
         },
         "tags": [
           "string",
@@ -1000,7 +1000,7 @@
         ]
       },
       "meta": {
-        "hash": "10a7c4f33110b6a3f814d6be178651a3be7cb0220787b2854b18c049b538d7bc"
+        "hash": "3169ab83e588063262fa6a01f7d7df7bd9521345c65a7c7f874f577478c90305"
       }
     },
     {
@@ -1011,9 +1011,9 @@
         "fileName": "CSVToJSON.md",
         "text": "Converts a comma-separated values (CSV) string to a 2D array of objects.\nThe first row of the string is used as the title row.\n\nUse `Array.prototype.slice()` and `Array.prototype.indexOf('\\n')` and `String.prototype.split(delimiter)` to separate the first row (title row) into values.\nUse `String.prototype.split('\\n')` to create a string for each row, then `Array.prototype.map()` and `String.prototype.split(delimiter)` to separate the values in each row.\nUse `Array.prototype.reduce()` to create an object for each row's values, with the keys parsed from the title row.\nOmit the second argument, `delimiter`, to use a default delimiter of `,`.\n\n",
         "codeBlocks": {
-          "es6": "const CSVToJSON = (data, delimiter = ',') => {\r\n  const titles = data.slice(0, data.indexOf('\\n')).split(delimiter);\r\n  return data\r\n    .slice(data.indexOf('\\n') + 1)\r\n    .split('\\n')\r\n    .map(v => {\r\n      const values = v.split(delimiter);\r\n      return titles.reduce((obj, title, index) => ((obj[title] = values[index]), obj), {});\r\n    });\r\n};",
+          "es6": "const CSVToJSON = (data, delimiter = ',') => {\n  const titles = data.slice(0, data.indexOf('\\n')).split(delimiter);\n  return data\n    .slice(data.indexOf('\\n') + 1)\n    .split('\\n')\n    .map(v => {\n      const values = v.split(delimiter);\n      return titles.reduce((obj, title, index) => ((obj[title] = values[index]), obj), {});\n    });\n};",
           "es5": "var CSVToJSON = function CSVToJSON(data) {\n  var delimiter = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n  var titles = data.slice(0, data.indexOf('\\n')).split(delimiter);\n  return data.slice(data.indexOf('\\n') + 1).split('\\n').map(function (v) {\n    var values = v.split(delimiter);\n    return titles.reduce(function (obj, title, index) {\n      return obj[title] = values[index], obj;\n    }, {});\n  });\n};",
-          "example": "CSVToJSON('col1,col2\\na,b\\nc,d'); // [{'col1': 'a', 'col2': 'b'}, {'col1': 'c', 'col2': 'd'}];\r\nCSVToJSON('col1;col2\\na;b\\nc;d', ';'); // [{'col1': 'a', 'col2': 'b'}, {'col1': 'c', 'col2': 'd'}];"
+          "example": "CSVToJSON('col1,col2\\na,b\\nc,d'); // [{'col1': 'a', 'col2': 'b'}, {'col1': 'c', 'col2': 'd'}];\nCSVToJSON('col1;col2\\na;b\\nc;d', ';'); // [{'col1': 'a', 'col2': 'b'}, {'col1': 'c', 'col2': 'd'}];"
         },
         "tags": [
           "string",
@@ -1023,7 +1023,7 @@
         ]
       },
       "meta": {
-        "hash": "8cf59151187aae093b609a2c3f2e7124d541ab5d7fb5c7b3424b3b3f4ec4f39e"
+        "hash": "786d9d7dc8544fd49678b8bb71eb4a068ade86a30b2a58d07bef20da2fc28db1"
       }
     },
     {
@@ -1045,7 +1045,7 @@
         ]
       },
       "meta": {
-        "hash": "ec8356a21b932e91474580ea5f2c4b63420453e1d7c0428c13abe93e05495f79"
+        "hash": "f51d4d8679fadabe84e72547013537a5fcb7bcedd7907f79934fba06405097c7"
       }
     },
     {
@@ -1056,9 +1056,9 @@
         "fileName": "curry.md",
         "text": "Curries a function.\n\nUse recursion.\nIf the number of provided arguments (`args`) is sufficient, call the passed function `fn`.\nOtherwise, return a curried function `fn` that expects the rest of the arguments.\nIf you want to curry a function that accepts a variable number of arguments (a variadic function, e.g. `Math.min()`), you can optionally pass the number of arguments to the second parameter `arity`.\n\n",
         "codeBlocks": {
-          "es6": "const curry = (fn, arity = fn.length, ...args) =>\r\n  arity <= args.length ? fn(...args) : curry.bind(null, fn, arity, ...args);",
+          "es6": "const curry = (fn, arity = fn.length, ...args) =>\n  arity <= args.length ? fn(...args) : curry.bind(null, fn, arity, ...args);",
           "es5": "var curry = function curry(fn) {\n  var arity = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : fn.length;\n\n  for (var _len = arguments.length, args = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {\n    args[_key - 2] = arguments[_key];\n  }\n\n  return arity <= args.length ? fn.apply(void 0, args) : curry.bind.apply(curry, [null, fn, arity].concat(args));\n};",
-          "example": "curry(Math.pow)(2)(10); // 1024\r\ncurry(Math.min, 3)(10)(50)(2); // 2"
+          "example": "curry(Math.pow)(2)(10); // 1024\ncurry(Math.min, 3)(10)(50)(2); // 2"
         },
         "tags": [
           "function",
@@ -1067,7 +1067,7 @@
         ]
       },
       "meta": {
-        "hash": "8e97da9862e249383e01c8f76521f64f718136e22413fc805357090826a6cce7"
+        "hash": "80e76d37fa79511f3256d5e1c113d223fc8875fd9d6cfe8b7530b567def30456"
       }
     },
     {
@@ -1078,7 +1078,7 @@
         "fileName": "dayOfYear.md",
         "text": "Gets the day of the year from a `Date` object.\n\nUse `new Date()` and `Date.prototype.getFullYear()` to get the first day of the year as a `Date` object, subtract it from the provided `date` and divide with the milliseconds in each day to get the result.\nUse `Math.floor()` to appropriately round the resulting day count to an integer.\n\n",
         "codeBlocks": {
-          "es6": "const dayOfYear = date =>\r\n  Math.floor((date - new Date(date.getFullYear(), 0, 0)) / 1000 / 60 / 60 / 24);",
+          "es6": "const dayOfYear = date =>\n  Math.floor((date - new Date(date.getFullYear(), 0, 0)) / 1000 / 60 / 60 / 24);",
           "es5": "var dayOfYear = function dayOfYear(date) {\n  return Math.floor((date - new Date(date.getFullYear(), 0, 0)) / 1000 / 60 / 60 / 24);\n};",
           "example": "dayOfYear(new Date()); // 272"
         },
@@ -1088,7 +1088,7 @@
         ]
       },
       "meta": {
-        "hash": "16f3aea7c85e2373a402c113629b0a9ddae4cd001565eabd8d7dac6d0226a616"
+        "hash": "9057876a6323ed24bbc3db2a6db7ddc8bdf59663493d07935b9c9238d879a689"
       }
     },
     {
@@ -1099,9 +1099,9 @@
         "fileName": "debounce.md",
         "text": "Creates a debounced function that delays invoking the provided function until at least `ms` milliseconds have elapsed since the last time it was invoked.\n\nEach time the debounced function is invoked, clear the current pending timeout with `clearTimeout()` and use `setTimeout()` to create a new timeout that delays invoking the function until at least `ms` milliseconds has elapsed. Use `Function.prototype.apply()` to apply the `this` context to the function and provide the necessary arguments.\nOmit the second argument, `ms`, to set the timeout at a default of 0 ms.\n\n",
         "codeBlocks": {
-          "es6": "const debounce = (fn, ms = 0) => {\r\n  let timeoutId;\r\n  return function(...args) {\r\n    clearTimeout(timeoutId);\r\n    timeoutId = setTimeout(() => fn.apply(this, args), ms);\r\n  };\r\n};",
+          "es6": "const debounce = (fn, ms = 0) => {\n  let timeoutId;\n  return function(...args) {\n    clearTimeout(timeoutId);\n    timeoutId = setTimeout(() => fn.apply(this, args), ms);\n  };\n};",
           "es5": "var debounce = function debounce(fn) {\n  var ms = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var timeoutId;\n  return function () {\n    var _this = this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    clearTimeout(timeoutId);\n    timeoutId = setTimeout(function () {\n      return fn.apply(_this, args);\n    }, ms);\n  };\n};",
-          "example": "window.addEventListener(\r\n  'resize',\r\n  debounce(() => {\r\n    console.log(window.innerWidth);\r\n    console.log(window.innerHeight);\r\n  }, 250)\r\n); // Will log the window dimensions at most every 250ms"
+          "example": "window.addEventListener(\n  'resize',\n  debounce(() => {\n    console.log(window.innerWidth);\n    console.log(window.innerHeight);\n  }, 250)\n); // Will log the window dimensions at most every 250ms"
         },
         "tags": [
           "function",
@@ -1109,7 +1109,7 @@
         ]
       },
       "meta": {
-        "hash": "b6f75281785a4d0803f40d5452e0f8d2a6bfd16acda43ac1e53f9f195c8ecd7f"
+        "hash": "bbf4d763429f499c0e1c3feb381e6291d3643d45613d25812ac5c47789d4d4f9"
       }
     },
     {
@@ -1120,9 +1120,9 @@
         "fileName": "decapitalize.md",
         "text": "Decapitalizes the first letter of a string.\n\nUse array destructuring and `String.toLowerCase()` to decapitalize first letter, `...rest` to get array of characters after first letter and then `Array.prototype.join('')` to make it a string again.\nOmit the `upperRest` parameter to keep the rest of the string intact, or set it to `true` to convert to uppercase.\n\n",
         "codeBlocks": {
-          "es6": "const decapitalize = ([first, ...rest], upperRest = false) =>\r\n  first.toLowerCase() + (upperRest ? rest.join('').toUpperCase() : rest.join(''));",
+          "es6": "const decapitalize = ([first, ...rest], upperRest = false) =>\n  first.toLowerCase() + (upperRest ? rest.join('').toUpperCase() : rest.join(''));",
           "es5": "function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar decapitalize = function decapitalize(_ref) {\n  var _ref2 = _toArray(_ref),\n      first = _ref2[0],\n      rest = _ref2.slice(1);\n\n  var upperRest = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  return first.toLowerCase() + (upperRest ? rest.join('').toUpperCase() : rest.join(''));\n};",
-          "example": "decapitalize('FooBar'); // 'fooBar'\r\ndecapitalize('FooBar', true); // 'fOOBAR'"
+          "example": "decapitalize('FooBar'); // 'fooBar'\ndecapitalize('FooBar', true); // 'fOOBAR'"
         },
         "tags": [
           "string",
@@ -1131,7 +1131,7 @@
         ]
       },
       "meta": {
-        "hash": "504d4200bb420f842b538160e24badcb95ea8fd8a1d2566e09eec9f9156ce2ca"
+        "hash": "cb1b9240e8dae6a351937afeeccb1e200017a3729844b812721b8a8fcffdaa54"
       }
     },
     {
@@ -1142,9 +1142,9 @@
         "fileName": "deepClone.md",
         "text": "Creates a deep clone of an object.\n\nUse recursion.\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.\n\n",
         "codeBlocks": {
-          "es6": "const deepClone = obj => {\r\n  let clone = Object.assign({}, obj);\r\n  Object.keys(clone).forEach(\r\n    key => (clone[key] = typeof obj[key] === 'object' ? deepClone(obj[key]) : obj[key])\r\n  );\r\n  return Array.isArray(obj) && obj.length\r\n    ? (clone.length = obj.length) && Array.from(clone)\r\n    : Array.isArray(obj)\r\n      ? Array.from(obj)\r\n      : clone;\r\n};",
+          "es6": "const deepClone = obj => {\n  let clone = Object.assign({}, obj);\n  Object.keys(clone).forEach(\n    key => (clone[key] = typeof obj[key] === 'object' ? deepClone(obj[key]) : obj[key])\n  );\n  return Array.isArray(obj) && obj.length\n    ? (clone.length = obj.length) && Array.from(clone)\n    : Array.isArray(obj)\n    ? Array.from(obj)\n    : clone;\n};",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar deepClone = function deepClone(obj) {\n  var clone = Object.assign({}, obj);\n  Object.keys(clone).forEach(function (key) {\n    return clone[key] = _typeof(obj[key]) === 'object' ? deepClone(obj[key]) : obj[key];\n  });\n  return Array.isArray(obj) && obj.length ? (clone.length = obj.length) && Array.from(clone) : Array.isArray(obj) ? Array.from(obj) : clone;\n};",
-          "example": "const a = { foo: 'bar', obj: { a: 1, b: 2 } };\r\nconst b = deepClone(a); // a !== b, a.obj !== b.obj"
+          "example": "const a = { foo: 'bar', obj: { a: 1, b: 2 } };\nconst b = deepClone(a); // a !== b, a.obj !== b.obj"
         },
         "tags": [
           "object",
@@ -1153,7 +1153,7 @@
         ]
       },
       "meta": {
-        "hash": "d3746880744d38557e67fe915b31e15c01cd1541eda1ce68ec0e3242ed821ed6"
+        "hash": "cdf3e756a5a73f7e6925d51b141089e991ef579ee8bfff99f194da8fb0ef6dc8"
       }
     },
     {
@@ -1175,7 +1175,7 @@
         ]
       },
       "meta": {
-        "hash": "62f9e1311cb89f88dffcca2236405de454ac35efd99a2a9abe66ea2f99c280e8"
+        "hash": "3581c10be59a1ecac528c7dbbb2b19479193e896f75d7229ed56853f6b2ceb52"
       }
     },
     {
@@ -1186,9 +1186,9 @@
         "fileName": "deepFreeze.md",
         "text": "Deep freezes an object.\n\nCalls `Object.freeze(obj)` recursively on all unfrozen properties of passed object that are `instanceof` object.\n\n",
         "codeBlocks": {
-          "es6": "const deepFreeze = obj =>\r\n  Object.keys(obj).forEach(prop =>\r\n    !(obj[prop] instanceof Object) || Object.isFrozen(obj[prop]) ? null : deepFreeze(obj[prop])\r\n  ) || Object.freeze(obj);",
+          "es6": "const deepFreeze = obj =>\n  Object.keys(obj).forEach(prop =>\n    !(obj[prop] instanceof Object) || Object.isFrozen(obj[prop]) ? null : deepFreeze(obj[prop])\n  ) || Object.freeze(obj);",
           "es5": "var deepFreeze = function deepFreeze(obj) {\n  return Object.keys(obj).forEach(function (prop) {\n    return !(obj[prop] instanceof Object) || Object.isFrozen(obj[prop]) ? null : deepFreeze(obj[prop]);\n  }) || Object.freeze(obj);\n};",
-          "example": "'use strict';\r\n\r\nconst o = deepFreeze([1, [2, 3]]);\r\n\r\no[0] = 3; // not allowed\r\no[1][0] = 4; // not allowed as well"
+          "example": "'use strict';\n\nconst o = deepFreeze([1, [2, 3]]);\n\no[0] = 3; // not allowed\no[1][0] = 4; // not allowed as well"
         },
         "tags": [
           "object",
@@ -1197,7 +1197,7 @@
         ]
       },
       "meta": {
-        "hash": "4e827d3d774cc03fdff9dd9ff6894a797cd31f4c0fd64950cc0a2681989089cf"
+        "hash": "a96d773dc1d2d54b91ccabf3eb4acaf0964d080fc75dcbf74fc032fd40702e9e"
       }
     },
     {
@@ -1210,7 +1210,7 @@
         "codeBlocks": {
           "es6": "const deepGet = (obj, keys) => keys.reduce((xs, x) => (xs && xs[x] ? xs[x] : null), obj);",
           "es5": "var deepGet = function deepGet(obj, keys) {\n  return keys.reduce(function (xs, x) {\n    return xs && xs[x] ? xs[x] : null;\n  }, obj);\n};",
-          "example": "let index = 2;\r\nconst data = {\r\n  foo: {\r\n    foz: [1, 2, 3],\r\n    bar: {\r\n      baz: ['a', 'b', 'c']\r\n    }\r\n  }\r\n};\r\ndeepGet(data, ['foo', 'foz', index]); // get 3\r\ndeepGet(data, ['foo', 'bar', 'baz', 8, 'foz']); // null"
+          "example": "let index = 2;\nconst data = {\n  foo: {\n    foz: [1, 2, 3],\n    bar: {\n      baz: ['a', 'b', 'c']\n    }\n  }\n};\ndeepGet(data, ['foo', 'foz', index]); // get 3\ndeepGet(data, ['foo', 'bar', 'baz', 8, 'foz']); // null"
         },
         "tags": [
           "object",
@@ -1218,7 +1218,7 @@
         ]
       },
       "meta": {
-        "hash": "0047781cef3f32f1dda60562741862b6d6dd97f1959074620e7f3bd193e8da40"
+        "hash": "818735e4b97db79e60544be6339c8e260b630f375b542ea51e1bc60e4171be42"
       }
     },
     {
@@ -1229,9 +1229,9 @@
         "fileName": "deepMapKeys.md",
         "text": "Deep maps an object's keys.\n\nCreates an object with the same values as the provided object and keys generated by running the provided function for each key.\nUse `Object.keys(obj)` to iterate over the object's keys. \nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n\n",
         "codeBlocks": {
-          "es6": "const deepMapKeys = (obj, f) =>\r\n  Array.isArray(obj)\r\n    ? obj.map(val => deepMapKeys(val, f))\r\n    : typeof obj === 'object'\r\n      ? Object.keys(obj).reduce((acc, current) => {\r\n        const val = obj[current];\r\n        acc[f(current)] =\r\n          val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);\r\n        return acc;\r\n      }, {})\r\n      : obj;",
+          "es6": "const deepMapKeys = (obj, f) =>\n  Array.isArray(obj)\n    ? obj.map(val => deepMapKeys(val, f))\n    : typeof obj === 'object'\n    ? Object.keys(obj).reduce((acc, current) => {\n        const val = obj[current];\n        acc[f(current)] =\n          val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);\n        return acc;\n      }, {})\n    : obj;",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar deepMapKeys = function deepMapKeys(obj, f) {\n  return Array.isArray(obj) ? obj.map(function (val) {\n    return deepMapKeys(val, f);\n  }) : _typeof(obj) === 'object' ? Object.keys(obj).reduce(function (acc, current) {\n    var val = obj[current];\n    acc[f(current)] = val !== null && _typeof(val) === 'object' ? deepMapKeys(val, f) : acc[f(current)] = val;\n    return acc;\n  }, {}) : obj;\n};",
-          "example": "const obj = {\r\n  foo: '1',\r\n  nested: {\r\n    child: {\r\n      withArray: [\r\n        {\r\n          grandChild: ['hello']\r\n        }\r\n      ]\r\n    }\r\n  }\r\n};\r\nconst upperKeysObj = deepMapKeys(obj, key => key.toUpperCase());\r\n/*\r\n{\r\n  \"FOO\":\"1\",\r\n  \"NESTED\":{\r\n    \"CHILD\":{\r\n      \"WITHARRAY\":[\r\n        {\r\n          \"GRANDCHILD\":[ 'hello' ]\r\n        }\r\n      ]\r\n    }\r\n  }\r\n}\r\n*/"
+          "example": "const obj = {\n  foo: '1',\n  nested: {\n    child: {\n      withArray: [\n        {\n          grandChild: ['hello']\n        }\n      ]\n    }\n  }\n};\nconst upperKeysObj = deepMapKeys(obj, key => key.toUpperCase());\n/*\n{\n  \"FOO\":\"1\",\n  \"NESTED\":{\n    \"CHILD\":{\n      \"WITHARRAY\":[\n        {\n          \"GRANDCHILD\":[ 'hello' ]\n        }\n      ]\n    }\n  }\n}\n*/"
         },
         "tags": [
           "object",
@@ -1240,7 +1240,7 @@
         ]
       },
       "meta": {
-        "hash": "99b0432028acde981514d3fc7c29a8db18351e4199dd112b7f22ef6c54158980"
+        "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
       }
     },
     {
@@ -1261,7 +1261,7 @@
         ]
       },
       "meta": {
-        "hash": "8ce6adfe5a929a10f301c1ac3f9f16ff7278c8cae764877a0b71bf4980d032fe"
+        "hash": "f891cda1417a4f1c3646c3d7451aad99833062eb28a9fcad4d414b98d1925bc6"
       }
     },
     {
@@ -1274,7 +1274,7 @@
         "codeBlocks": {
           "es6": "const defer = (fn, ...args) => setTimeout(fn, 1, ...args);",
           "es5": "var defer = function defer(fn) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n\n  return setTimeout.apply(void 0, [fn, 1].concat(args));\n};",
-          "example": "// Example A:\r\ndefer(console.log, 'a'), console.log('b'); // logs 'b' then 'a'\r\n\r\n// Example B:\r\ndocument.querySelector('#someElement').innerHTML = 'Hello';\r\nlongRunningFunction(); // Browser will not update the HTML until this has finished\r\ndefer(longRunningFunction); // Browser will update the HTML then run the function"
+          "example": "// Example A:\ndefer(console.log, 'a'), console.log('b'); // logs 'b' then 'a'\n\n// Example B:\ndocument.querySelector('#someElement').innerHTML = 'Hello';\nlongRunningFunction(); // Browser will not update the HTML until this has finished\ndefer(longRunningFunction); // Browser will update the HTML then run the function"
         },
         "tags": [
           "function",
@@ -1282,7 +1282,7 @@
         ]
       },
       "meta": {
-        "hash": "3315e60f3ce1bf23bdb863323f6ecfd9e11e10b456e16d895f49ff19d39f90d2"
+        "hash": "7a750cc36b1a97252c4048a6896e0e01816ccf0bcb6db634db42b4ae5be1ed3b"
       }
     },
     {
@@ -1303,7 +1303,7 @@
         ]
       },
       "meta": {
-        "hash": "e0f35f5ecbd879103c0c11c8daa36511390f300b749885d223e099053a537793"
+        "hash": "2bc5b5959725150f5c678769b6dffc05f44692ad2e201b9ac1ff40c00e5dc419"
       }
     },
     {
@@ -1316,7 +1316,7 @@
         "codeBlocks": {
           "es6": "const delay = (fn, wait, ...args) => setTimeout(fn, wait, ...args);",
           "es5": "var delay = function delay(fn, wait) {\n  for (var _len = arguments.length, args = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {\n    args[_key - 2] = arguments[_key];\n  }\n\n  return setTimeout.apply(void 0, [fn, wait].concat(args));\n};",
-          "example": "delay(\r\n  function(text) {\r\n    console.log(text);\r\n  },\r\n  1000,\r\n  'later'\r\n); // Logs 'later' after one second."
+          "example": "delay(\n  function(text) {\n    console.log(text);\n  },\n  1000,\n  'later'\n); // Logs 'later' after one second."
         },
         "tags": [
           "function",
@@ -1324,7 +1324,7 @@
         ]
       },
       "meta": {
-        "hash": "1b60e100a66cd546827334174e0b2e1506884a61fa8131ea0362b536b80ed8fa"
+        "hash": "cfa17f3a578f2790d22b5054c728a07515678b72eccef8500218b78d8a3d9e4b"
       }
     },
     {
@@ -1335,7 +1335,7 @@
         "fileName": "detectDeviceType.md",
         "text": "Detects whether the website is being opened in a mobile device or a desktop/laptop.\n\nUse a regular expression to test the `navigator.userAgent` property to figure out if the device is a mobile device or a desktop/laptop.\n\n",
         "codeBlocks": {
-          "es6": "const detectDeviceType = () =>\r\n  /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent)\r\n    ? 'Mobile'\r\n    : 'Desktop';",
+          "es6": "const detectDeviceType = () =>\n  /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent)\n    ? 'Mobile'\n    : 'Desktop';",
           "es5": "var detectDeviceType = function detectDeviceType() {\n  return /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent) ? 'Mobile' : 'Desktop';\n};",
           "example": "detectDeviceType(); // \"Mobile\" or \"Desktop\""
         },
@@ -1345,7 +1345,7 @@
         ]
       },
       "meta": {
-        "hash": "e85101f72c32524d41415df0c0a1e39ac60180ce1a495467b39f831176f90853"
+        "hash": "ab72248448b94658fbbe2842d7feb3ec1621703384472f424a2355634d1aa774"
       }
     },
     {
@@ -1356,7 +1356,7 @@
         "fileName": "difference.md",
         "text": "Returns the difference between two arrays.\n\nCreate a `Set` from `b`, then use `Array.prototype.filter()` on `a` to only keep values not contained in `b`.\n\n",
         "codeBlocks": {
-          "es6": "const difference = (a, b) => {\r\n  const s = new Set(b);\r\n  return a.filter(x => !s.has(x));\r\n};",
+          "es6": "const difference = (a, b) => {\n  const s = new Set(b);\n  return a.filter(x => !s.has(x));\n};",
           "es5": "var difference = function difference(a, b) {\n  var s = new Set(b);\n  return a.filter(function (x) {\n    return !s.has(x);\n  });\n};",
           "example": "difference([1, 2, 3], [1, 2, 4]); // [3]"
         },
@@ -1367,7 +1367,7 @@
         ]
       },
       "meta": {
-        "hash": "7fcc26fd4260f148881436b6d181e28bbf01de8a48ef1cf46785deb1e530b6c3"
+        "hash": "7e49ef3e36b2fe6f1cc680e2be782bda7af3e05fa75b4bacf59c63428a6ebf50"
       }
     },
     {
@@ -1378,9 +1378,9 @@
         "fileName": "differenceBy.md",
         "text": "Returns the difference between two arrays, after applying the provided function to each array element of both.\n\nCreate a `Set` by applying `fn` to each element in `b`, then use `Array.prototype.map()` to apply `fn` to each element in `a`, then `Array.prototype.filter()`\n\n",
         "codeBlocks": {
-          "es6": "const differenceBy = (a, b, fn) => {\r\n  const s = new Set(b.map(fn));\r\n  return a.map(fn).filter(el => !s.has(el));\r\n};",
+          "es6": "const differenceBy = (a, b, fn) => {\n  const s = new Set(b.map(fn));\n  return a.map(fn).filter(el => !s.has(el));\n};",
           "es5": "var differenceBy = function differenceBy(a, b, fn) {\n  var s = new Set(b.map(fn));\n  return a.map(fn).filter(function (el) {\n    return !s.has(el);\n  });\n};",
-          "example": "differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [1]\r\ndifferenceBy([{ x: 2 }, { x: 1 }], [{ x: 1 }], v => v.x); // [2]"
+          "example": "differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [1]\ndifferenceBy([{ x: 2 }, { x: 1 }], [{ x: 1 }], v => v.x); // [2]"
         },
         "tags": [
           "array",
@@ -1389,7 +1389,7 @@
         ]
       },
       "meta": {
-        "hash": "f651e1b1c3a15cb76054925e77d3180642bdf256ded282b6b939d825365eb51a"
+        "hash": "1be0503ca3298cf2c05ff64889181fc35e682785476bb5617d439978b80fd35e"
       }
     },
     {
@@ -1411,7 +1411,7 @@
         ]
       },
       "meta": {
-        "hash": "137a16a300464b556916535135f2aafbf5eb3aa5647613d7a50af3333987fd56"
+        "hash": "b265f3860be86344badb79b74074e3dfe37da6b2c4ff95bd8865b6e6f7c0d73b"
       }
     },
     {
@@ -1422,9 +1422,9 @@
         "fileName": "dig.md",
         "text": "Returns the target value in a nested JSON object, based on the given key.\n\nUse the `in` operator to check if `target` exists in `obj`.\nIf found, return the value of `obj[target]`, otherwise use `Object.values(obj)` and `Array.prototype.reduce()` to recursively call `dig` on each nested object until the first matching key/value pair is found.\n\n",
         "codeBlocks": {
-          "es6": "const dig = (obj, target) =>\r\n  target in obj\r\n    ? obj[target]\r\n    : Object.values(obj).reduce((acc, val) => {\r\n      if (acc !== undefined) return acc;\r\n      if (typeof val === 'object') return dig(val, target);\r\n    }, undefined);",
+          "es6": "const dig = (obj, target) =>\n  target in obj\n    ? obj[target]\n    : Object.values(obj).reduce((acc, val) => {\n        if (acc !== undefined) return acc;\n        if (typeof val === 'object') return dig(val, target);\n      }, undefined);",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar dig = function dig(obj, target) {\n  return target in obj ? obj[target] : Object.values(obj).reduce(function (acc, val) {\n    if (acc !== undefined) return acc;\n    if (_typeof(val) === 'object') return dig(val, target);\n  }, undefined);\n};",
-          "example": "const data = {\r\n  level1: {\r\n    level2: {\r\n      level3: 'some data'\r\n    }\r\n  }\r\n};\r\ndig(data, 'level3'); // 'some data'\r\ndig(data, 'level4'); // undefined"
+          "example": "const data = {\n  level1: {\n    level2: {\n      level3: 'some data'\n    }\n  }\n};\ndig(data, 'level3'); // 'some data'\ndig(data, 'level4'); // undefined"
         },
         "tags": [
           "object",
@@ -1433,7 +1433,7 @@
         ]
       },
       "meta": {
-        "hash": "e1f7ca3f54a993d8682fe3a2fc5bccc9da417281efad066b5f0160a689a07b08"
+        "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
       }
     },
     {
@@ -1455,7 +1455,7 @@
         ]
       },
       "meta": {
-        "hash": "c44a93b3effe25dd69f837c6bc6e5b940c48ee6b1de44f426d16b30720f46564"
+        "hash": "adc3d101e4cdb91158dceb8053b684dfdc1f16cedcbf6cf6429fc4ed8a164b59"
       }
     },
     {
@@ -1476,7 +1476,7 @@
         ]
       },
       "meta": {
-        "hash": "f80379e696d64247f73b734705fee11986cec7f37f1f04c6676ed4a9f3866872"
+        "hash": "4a9da71c7d722ae58f12c73771d00cab86e74c3167254451660d26197ba6bd19"
       }
     },
     {
@@ -1489,7 +1489,7 @@
         "codeBlocks": {
           "es6": "const drop = (arr, n = 1) => arr.slice(n);",
           "es5": "var drop = function drop(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return arr.slice(n);\n};",
-          "example": "drop([1, 2, 3]); // [2,3]\r\ndrop([1, 2, 3], 2); // [3]\r\ndrop([1, 2, 3], 42); // []"
+          "example": "drop([1, 2, 3]); // [2,3]\ndrop([1, 2, 3], 2); // [3]\ndrop([1, 2, 3], 42); // []"
         },
         "tags": [
           "array",
@@ -1497,7 +1497,7 @@
         ]
       },
       "meta": {
-        "hash": "37658da68c3bd39a3ba2f588721e93180ffee682f751067bd846275035dbd1c8"
+        "hash": "bf545684ca0c4abe2fc44e3fcaf15df7986430630e306ad3c009e629e63a1fab"
       }
     },
     {
@@ -1510,7 +1510,7 @@
         "codeBlocks": {
           "es6": "const dropRight = (arr, n = 1) => arr.slice(0, -n);",
           "es5": "var dropRight = function dropRight(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return arr.slice(0, -n);\n};",
-          "example": "dropRight([1, 2, 3]); // [1,2]\r\ndropRight([1, 2, 3], 2); // [1]\r\ndropRight([1, 2, 3], 42); // []"
+          "example": "dropRight([1, 2, 3]); // [1,2]\ndropRight([1, 2, 3], 2); // [1]\ndropRight([1, 2, 3], 42); // []"
         },
         "tags": [
           "array",
@@ -1518,7 +1518,7 @@
         ]
       },
       "meta": {
-        "hash": "0d7af0ac37c1c1f827fa8158c3fff9323f3ba6fd6a06866548f3f20b067e5c57"
+        "hash": "36905bae3e3177bb5999580342141975020ea45d7162f240af5cc418425c871a"
       }
     },
     {
@@ -1529,7 +1529,7 @@
         "fileName": "dropRightWhile.md",
         "text": "Removes elements from the end of an array until the passed function returns `true`. Returns the remaining elements in the array.\n\nLoop through the array, using `Array.prototype.slice()` to drop the last element of the array until the returned value from the function is `true`.\nReturns the remaining elements.\n\n",
         "codeBlocks": {
-          "es6": "const dropRightWhile = (arr, func) => {\r\n  let rightIndex = arr.length;\r\n  while (rightIndex-- && !func(arr[rightIndex]));\r\n  return arr.slice(0, rightIndex + 1);\r\n};",
+          "es6": "const dropRightWhile = (arr, func) => {\n  let rightIndex = arr.length;\n  while (rightIndex-- && !func(arr[rightIndex]));\n  return arr.slice(0, rightIndex + 1);\n};",
           "es5": "var dropRightWhile = function dropRightWhile(arr, func) {\n  var rightIndex = arr.length;\n\n  while (rightIndex-- && !func(arr[rightIndex])) {\n    ;\n  }\n\n  return arr.slice(0, rightIndex + 1);\n};",
           "example": "dropRightWhile([1, 2, 3, 4], n => n < 3); // [1, 2]"
         },
@@ -1540,7 +1540,7 @@
         ]
       },
       "meta": {
-        "hash": "549f5445419dee32b101d1553d6f6cc7e2176c9d4112ca207fbb9d5d8b2420c9"
+        "hash": "252b49a7c475d830e22c7e6dbae7df45be37a97b400e93125935c2de5c24b0a1"
       }
     },
     {
@@ -1551,7 +1551,7 @@
         "fileName": "dropWhile.md",
         "text": "Removes elements in an array until the passed function returns `true`. Returns the remaining elements in the array.\n\nLoop through the array, using `Array.prototype.slice()` to drop the first element of the array until the returned value from the function is `true`.\nReturns the remaining elements.\n\n",
         "codeBlocks": {
-          "es6": "const dropWhile = (arr, func) => {\r\n  while (arr.length > 0 && !func(arr[0])) arr = arr.slice(1);\r\n  return arr;\r\n};",
+          "es6": "const dropWhile = (arr, func) => {\n  while (arr.length > 0 && !func(arr[0])) arr = arr.slice(1);\n  return arr;\n};",
           "es5": "var dropWhile = function dropWhile(arr, func) {\n  while (arr.length > 0 && !func(arr[0])) {\n    arr = arr.slice(1);\n  }\n\n  return arr;\n};",
           "example": "dropWhile([1, 2, 3, 4], n => n >= 3); // [3,4]"
         },
@@ -1562,7 +1562,7 @@
         ]
       },
       "meta": {
-        "hash": "0081a0bba609bfdad40ce7b06e33eac15edb926b07d30696fa40fdd8d935179d"
+        "hash": "2433c61d4b168a15de1d89c3d077c51fdb36710dfd4e72465d929e83a5acb09f"
       }
     },
     {
@@ -1575,7 +1575,7 @@
         "codeBlocks": {
           "es6": "const elementContains = (parent, child) => parent !== child && parent.contains(child);",
           "es5": "var elementContains = function elementContains(parent, child) {\n  return parent !== child && parent.contains(child);\n};",
-          "example": "elementContains(document.querySelector('head'), document.querySelector('title')); // true\r\nelementContains(document.querySelector('body'), document.querySelector('body')); // false"
+          "example": "elementContains(document.querySelector('head'), document.querySelector('title')); // true\nelementContains(document.querySelector('body'), document.querySelector('body')); // false"
         },
         "tags": [
           "browser",
@@ -1583,7 +1583,7 @@
         ]
       },
       "meta": {
-        "hash": "66b205760b4153404424a37c0010c97eb52c153ceb3f81acac2009278a90933d"
+        "hash": "2c6c186cf8b62305ab88307d24b413acd96dba006c80ee7835e5fb8e33e72256"
       }
     },
     {
@@ -1594,9 +1594,9 @@
         "fileName": "elementIsVisibleInViewport.md",
         "text": "Returns `true` if the element specified is visible in the viewport, `false` otherwise.\n\nUse `Element.getBoundingClientRect()` and the `window.inner(Width|Height)` values\nto determine if a given element is visible in the viewport.\nOmit the second argument to determine if the element is entirely visible, or specify `true` to determine if\nit is partially visible.\n\n",
         "codeBlocks": {
-          "es6": "const elementIsVisibleInViewport = (el, partiallyVisible = false) => {\r\n  const { top, left, bottom, right } = el.getBoundingClientRect();\r\n  const { innerHeight, innerWidth } = window;\r\n  return partiallyVisible\r\n    ? ((top > 0 && top < innerHeight) || (bottom > 0 && bottom < innerHeight)) &&\r\n        ((left > 0 && left < innerWidth) || (right > 0 && right < innerWidth))\r\n    : top >= 0 && left >= 0 && bottom <= innerHeight && right <= innerWidth;\r\n};",
+          "es6": "const elementIsVisibleInViewport = (el, partiallyVisible = false) => {\n  const { top, left, bottom, right } = el.getBoundingClientRect();\n  const { innerHeight, innerWidth } = window;\n  return partiallyVisible\n    ? ((top > 0 && top < innerHeight) || (bottom > 0 && bottom < innerHeight)) &&\n        ((left > 0 && left < innerWidth) || (right > 0 && right < innerWidth))\n    : top >= 0 && left >= 0 && bottom <= innerHeight && right <= innerWidth;\n};",
           "es5": "var elementIsVisibleInViewport = function elementIsVisibleInViewport(el) {\n  var partiallyVisible = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n\n  var _el$getBoundingClient = el.getBoundingClientRect(),\n      top = _el$getBoundingClient.top,\n      left = _el$getBoundingClient.left,\n      bottom = _el$getBoundingClient.bottom,\n      right = _el$getBoundingClient.right;\n\n  var _window = window,\n      innerHeight = _window.innerHeight,\n      innerWidth = _window.innerWidth;\n  return partiallyVisible ? (top > 0 && top < innerHeight || bottom > 0 && bottom < innerHeight) && (left > 0 && left < innerWidth || right > 0 && right < innerWidth) : top >= 0 && left >= 0 && bottom <= innerHeight && right <= innerWidth;\n};",
-          "example": "// e.g. 100x100 viewport and a 10x10px element at position {top: -1, left: 0, bottom: 9, right: 10}\r\nelementIsVisibleInViewport(el); // false - (not fully visible)\r\nelementIsVisibleInViewport(el, true); // true - (partially visible)"
+          "example": "// e.g. 100x100 viewport and a 10x10px element at position {top: -1, left: 0, bottom: 9, right: 10}\nelementIsVisibleInViewport(el); // false - (not fully visible)\nelementIsVisibleInViewport(el, true); // true - (partially visible)"
         },
         "tags": [
           "browser",
@@ -1604,7 +1604,7 @@
         ]
       },
       "meta": {
-        "hash": "a5845d2eeb8ddf4885b6cbdf2b2e9b876c824e9a67008c08e9fff4005ceb14f4"
+        "hash": "46fed254db32437f3f54938d293aee32ebda0bac4dda24e6af33c039f4bc6f9f"
       }
     },
     {
@@ -1615,9 +1615,9 @@
         "fileName": "elo.md",
         "text": "Computes the new ratings between two or more opponents using the [Elo rating system](https://en.wikipedia.org/wiki/Elo_rating_system). It takes an array\nof pre-ratings and returns an array containing post-ratings.\nThe array should be ordered from best performer to worst performer (winner -> loser).\n\nUse the exponent `**` operator and math operators to compute the expected score (chance of winning).\nof each opponent and compute the new rating for each.\nLoop through the ratings, using each permutation to compute the post-Elo rating for each player in a pairwise fashion. \nOmit the second argument to use the default `kFactor` of 32.\n\n",
         "codeBlocks": {
-          "es6": "const elo = ([...ratings], kFactor = 32, selfRating) => {\r\n  const [a, b] = ratings;\r\n  const expectedScore = (self, opponent) => 1 / (1 + 10 ** ((opponent - self) / 400));\r\n  const newRating = (rating, i) =>\r\n    (selfRating || rating) + kFactor * (i - expectedScore(i ? a : b, i ? b : a));\r\n  if (ratings.length === 2) return [newRating(a, 1), newRating(b, 0)];\r\n\r\n  for (let i = 0, len = ratings.length; i < len; i++) {\r\n    let j = i;\r\n    while (j < len - 1) {\r\n      j++;\r\n      [ratings[i], ratings[j]] = elo([ratings[i], ratings[j]], kFactor);\r\n    }\r\n  }\r\n  return ratings;\r\n};",
+          "es6": "const elo = ([...ratings], kFactor = 32, selfRating) => {\n  const [a, b] = ratings;\n  const expectedScore = (self, opponent) => 1 / (1 + 10 ** ((opponent - self) / 400));\n  const newRating = (rating, i) =>\n    (selfRating || rating) + kFactor * (i - expectedScore(i ? a : b, i ? b : a));\n  if (ratings.length === 2) return [newRating(a, 1), newRating(b, 0)];\n\n  for (let i = 0, len = ratings.length; i < len; i++) {\n    let j = i;\n    while (j < len - 1) {\n      j++;\n      [ratings[i], ratings[j]] = elo([ratings[i], ratings[j]], kFactor);\n    }\n  }\n  return ratings;\n};",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar elo = function elo(_ref) {\n  var _ref2 = _toArray(_ref),\n      ratings = _ref2.slice(0);\n\n  var kFactor = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 32;\n  var selfRating = arguments.length > 2 ? arguments[2] : undefined;\n\n  var _ratings = _slicedToArray(ratings, 2),\n      a = _ratings[0],\n      b = _ratings[1];\n\n  var expectedScore = function expectedScore(self, opponent) {\n    return 1 / (1 + Math.pow(10, (opponent - self) / 400));\n  };\n\n  var newRating = function newRating(rating, i) {\n    return (selfRating || rating) + kFactor * (i - expectedScore(i ? a : b, i ? b : a));\n  };\n\n  if (ratings.length === 2) return [newRating(a, 1), newRating(b, 0)];\n\n  for (var i = 0, len = ratings.length; i < len; i++) {\n    var j = i;\n\n    while (j < len - 1) {\n      j++;\n\n      var _elo = elo([ratings[i], ratings[j]], kFactor);\n\n      var _elo2 = _slicedToArray(_elo, 2);\n\n      ratings[i] = _elo2[0];\n      ratings[j] = _elo2[1];\n    }\n  }\n\n  return ratings;\n};",
-          "example": "// Standard 1v1s\r\nelo([1200, 1200]); // [1216, 1184]\r\nelo([1200, 1200], 64); // [1232, 1168]\r\n// 4 player FFA, all same rank\r\nelo([1200, 1200, 1200, 1200]).map(Math.round); // [1246, 1215, 1185, 1154]\r\n/*\r\nFor teams, each rating can adjusted based on own team's average rating vs.\r\naverage rating of opposing team, with the score being added to their\r\nown individual rating by supplying it as the third argument.\r\n*/"
+          "example": "// Standard 1v1s\nelo([1200, 1200]); // [1216, 1184]\nelo([1200, 1200], 64); // [1232, 1168]\n// 4 player FFA, all same rank\nelo([1200, 1200, 1200, 1200]).map(Math.round); // [1246, 1215, 1185, 1154]\n/*\nFor teams, each rating can adjusted based on own team's average rating vs.\naverage rating of opposing team, with the score being added to their\nown individual rating by supplying it as the third argument.\n*/"
         },
         "tags": [
           "math",
@@ -1626,7 +1626,7 @@
         ]
       },
       "meta": {
-        "hash": "1f9a6da0bb0f3dbaed82dda773e3ed565981e4fc5e169d126d720245fd004c67"
+        "hash": "7f506f1d9999e20da3deebf7d51b80d9f56f9d87bddac6637faf63316bcd1790"
       }
     },
     {
@@ -1637,7 +1637,7 @@
         "fileName": "equals.md",
         "text": "Performs a deep comparison between two values to determine if they are equivalent.\n\nCheck if the two values are identical, if they are both `Date` objects with the same time, using `Date.getTime()` or if they are both non-object values with an equivalent value (strict comparison).\nCheck if only one value is `null` or `undefined` or if their prototypes differ.\nIf none of the above conditions are met, use `Object.keys()` to check if both values have the same number of keys, then use `Array.prototype.every()` to check if every key in the first value exists in the second one and if they are equivalent by calling this method recursively.\n\n",
         "codeBlocks": {
-          "es6": "const equals = (a, b) => {\r\n  if (a === b) return true;\r\n  if (a instanceof Date && b instanceof Date) return a.getTime() === b.getTime();\r\n  if (!a || !b || (typeof a !== 'object' && typeof b !== 'object')) return a === b;\r\n  if (a === null || a === undefined || b === null || b === undefined) return false;\r\n  if (a.prototype !== b.prototype) return false;\r\n  let keys = Object.keys(a);\r\n  if (keys.length !== Object.keys(b).length) return false;\r\n  return keys.every(k => equals(a[k], b[k]));\r\n};",
+          "es6": "const equals = (a, b) => {\n  if (a === b) return true;\n  if (a instanceof Date && b instanceof Date) return a.getTime() === b.getTime();\n  if (!a || !b || (typeof a !== 'object' && typeof b !== 'object')) return a === b;\n  if (a === null || a === undefined || b === null || b === undefined) return false;\n  if (a.prototype !== b.prototype) return false;\n  let keys = Object.keys(a);\n  if (keys.length !== Object.keys(b).length) return false;\n  return keys.every(k => equals(a[k], b[k]));\n};",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar equals = function equals(a, b) {\n  if (a === b) return true;\n  if (a instanceof Date && b instanceof Date) return a.getTime() === b.getTime();\n  if (!a || !b || _typeof(a) !== 'object' && _typeof(b) !== 'object') return a === b;\n  if (a === null || a === undefined || b === null || b === undefined) return false;\n  if (a.prototype !== b.prototype) return false;\n  var keys = Object.keys(a);\n  if (keys.length !== Object.keys(b).length) return false;\n  return keys.every(function (k) {\n    return equals(a[k], b[k]);\n  });\n};",
           "example": "equals({ a: [2, { e: 3 }], b: [4], c: 'foo' }, { a: [2, { e: 3 }], b: [4], c: 'foo' }); // true"
         },
@@ -1649,7 +1649,7 @@
         ]
       },
       "meta": {
-        "hash": "27c7f2a1d8c3e49491710c3bee0cc39158ebb24b8c6c5507fad7094d52b3200d"
+        "hash": "05ce8329709b7b6a70ae9e07146fe1044de6c1fb33e00f7b953bb66b6f605e4d"
       }
     },
     {
@@ -1660,7 +1660,7 @@
         "fileName": "escapeHTML.md",
         "text": "Escapes a string for use in HTML.\n\nUse `String.prototype.replace()` with a regexp that matches the characters that need to be escaped, using a callback function to replace each character instance with its associated escaped character using a dictionary (object).\n\n",
         "codeBlocks": {
-          "es6": "const escapeHTML = str =>\r\n  str.replace(\r\n    /[&<>'\"]/g,\r\n    tag =>\r\n      ({\r\n        '&': '&amp;',\r\n        '<': '&lt;',\r\n        '>': '&gt;',\r\n        \"'\": '&#39;',\r\n        '\"': '&quot;'\r\n      }[tag] || tag)\r\n  );",
+          "es6": "const escapeHTML = str =>\n  str.replace(\n    /[&<>'\"]/g,\n    tag =>\n      ({\n        '&': '&amp;',\n        '<': '&lt;',\n        '>': '&gt;',\n        \"'\": '&#39;',\n        '\"': '&quot;'\n      }[tag] || tag)\n  );",
           "es5": "var escapeHTML = function escapeHTML(str) {\n  return str.replace(/[&<>'\"]/g, function (tag) {\n    return {\n      '&': '&amp;',\n      '<': '&lt;',\n      '>': '&gt;',\n      \"'\": '&#39;',\n      '\"': '&quot;'\n    }[tag] || tag;\n  });\n};",
           "example": "escapeHTML('<a href=\"#\">Me & you</a>'); // '&lt;a href=&quot;#&quot;&gt;Me &amp; you&lt;/a&gt;'"
         },
@@ -1672,7 +1672,7 @@
         ]
       },
       "meta": {
-        "hash": "2e00c83be3e95f6e57f2fa59fc335b7ac4bd2bab8a25c267738b447f929aaeec"
+        "hash": "456a613a9ad94c219753a2ad2ad6f5e1668b974e9f503d221791745c570a35d4"
       }
     },
     {
@@ -1694,7 +1694,7 @@
         ]
       },
       "meta": {
-        "hash": "6673e7e0351a435e0abebc2b0063489721ec1964227b52bcb7700b241803bb44"
+        "hash": "91c52b53fe79cc811678086b90b073f84bf168a1bd59dfa6796462ac96adfb17"
       }
     },
     {
@@ -1715,7 +1715,7 @@
         ]
       },
       "meta": {
-        "hash": "82f8cad5709a9c9c6b0a395848de9d7b7711af0b7f3a2186d3592df55a4d53ff"
+        "hash": "a111e4110ff4fe4895ba42b32ed7cb294ab8a0b1103d43cf5bf2d0c483f2ec7e"
       }
     },
     {
@@ -1726,9 +1726,9 @@
         "fileName": "extendHex.md",
         "text": "Extends a 3-digit color code to a 6-digit color code.\n\nUse `Array.prototype.map()`, `String.prototype.split()` and `Array.prototype.join()` to join the mapped array for converting a 3-digit RGB notated hexadecimal color-code to the 6-digit form.\n`Array.prototype.slice()` is used to remove `#` from string start since it's added once.\n\n",
         "codeBlocks": {
-          "es6": "const extendHex = shortHex =>\r\n  '#' +\r\n  shortHex\r\n    .slice(shortHex.startsWith('#') ? 1 : 0)\r\n    .split('')\r\n    .map(x => x + x)\r\n    .join('');",
+          "es6": "const extendHex = shortHex =>\n  '#' +\n  shortHex\n    .slice(shortHex.startsWith('#') ? 1 : 0)\n    .split('')\n    .map(x => x + x)\n    .join('');",
           "es5": "var extendHex = function extendHex(shortHex) {\n  return '#' + shortHex.slice(shortHex.startsWith('#') ? 1 : 0).split('').map(function (x) {\n    return x + x;\n  }).join('');\n};",
-          "example": "extendHex('#03f'); // '#0033ff'\r\nextendHex('05a'); // '#0055aa'"
+          "example": "extendHex('#03f'); // '#0033ff'\nextendHex('05a'); // '#0055aa'"
         },
         "tags": [
           "utility",
@@ -1737,7 +1737,7 @@
         ]
       },
       "meta": {
-        "hash": "7dd02d067f1a656e66039246ae3fc6ec69768bcd272fdf1b6959156655b0b18d"
+        "hash": "34df599e00a3541dfecf1c0780514006d8d6cadfe28905ead9e782cc3903902c"
       }
     },
     {
@@ -1748,7 +1748,7 @@
         "fileName": "factorial.md",
         "text": "Calculates the factorial of a number.\n\nUse recursion.\nIf `n` is less than or equal to `1`, return `1`.\nOtherwise, return the product of `n` and the factorial of `n - 1`.\nThrows an exception if `n` is a negative number.\n\n",
         "codeBlocks": {
-          "es6": "const factorial = n =>\r\n  n < 0\r\n    ? (() => {\r\n      throw new TypeError('Negative numbers are not allowed!');\r\n    })()\r\n    : n <= 1\r\n      ? 1\r\n      : n * factorial(n - 1);",
+          "es6": "const factorial = n =>\n  n < 0\n    ? (() => {\n        throw new TypeError('Negative numbers are not allowed!');\n      })()\n    : n <= 1\n    ? 1\n    : n * factorial(n - 1);",
           "es5": "var factorial = function factorial(n) {\n  return n < 0 ? function () {\n    throw new TypeError('Negative numbers are not allowed!');\n  }() : n <= 1 ? 1 : n * factorial(n - 1);\n};",
           "example": "factorial(6); // 720"
         },
@@ -1759,7 +1759,7 @@
         ]
       },
       "meta": {
-        "hash": "74fd0eca4f8325581b4d8529c2701ba72224f3cb41029c40c58e07044c2dc245"
+        "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
       }
     },
     {
@@ -1770,7 +1770,7 @@
         "fileName": "fibonacci.md",
         "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\n\nCreate an empty array of the specific length, initializing the first two values (`0` and `1`).\nUse `Array.prototype.reduce()` to add values into the array, using the sum of the last two values, except for the first two.\n\n",
         "codeBlocks": {
-          "es6": "const fibonacci = n =>\r\n  Array.from({ length: n }).reduce(\r\n    (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),\r\n    []\r\n  );",
+          "es6": "const fibonacci = n =>\n  Array.from({ length: n }).reduce(\n    (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),\n    []\n  );",
           "es5": "var fibonacci = function fibonacci(n) {\n  return Array.from({\n    length: n\n  }).reduce(function (acc, val, i) {\n    return acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i);\n  }, []);\n};",
           "example": "fibonacci(6); // [0, 1, 1, 2, 3, 5]"
         },
@@ -1781,7 +1781,7 @@
         ]
       },
       "meta": {
-        "hash": "d74f5f50e4649730596f1450df7f068d354bbdebe0fb102c103d715f33e1f6f1"
+        "hash": "156e9481207c96ff8e9fe054a5d72144933a5a0f4215e721925e3da0054f6be2"
       }
     },
     {
@@ -1823,7 +1823,7 @@
         ]
       },
       "meta": {
-        "hash": "863c3c8f0919a3ed4a7f33f2c993f4d7f0696ba294d66e83bf0396c698dc612e"
+        "hash": "f9abec985874548f8020c4b1a3f657981989c08e1c8d5547f21d1f36566b093c"
       }
     },
     {
@@ -1834,9 +1834,9 @@
         "fileName": "filterNonUniqueBy.md",
         "text": "Filters out the non-unique values in an array, based on a provided comparator function.\n\nUse `Array.prototype.filter()` and `Array.prototype.every()` for an array containing only the unique values, based on the comparator function, `fn`.\nThe comparator function takes four arguments: the values of the two elements being compared and their indexes.\n\n",
         "codeBlocks": {
-          "es6": "const filterNonUniqueBy = (arr, fn) =>\r\n  arr.filter((v, i) => arr.every((x, j) => (i === j) === fn(v, x, i, j)));",
+          "es6": "const filterNonUniqueBy = (arr, fn) =>\n  arr.filter((v, i) => arr.every((x, j) => (i === j) === fn(v, x, i, j)));",
           "es5": "var filterNonUniqueBy = function filterNonUniqueBy(arr, fn) {\n  return arr.filter(function (v, i) {\n    return arr.every(function (x, j) {\n      return i === j === fn(v, x, i, j);\n    });\n  });\n};",
-          "example": "filterNonUniqueBy(\r\n  [\r\n    { id: 0, value: 'a' },\r\n    { id: 1, value: 'b' },\r\n    { id: 2, value: 'c' },\r\n    { id: 1, value: 'd' },\r\n    { id: 0, value: 'e' }\r\n  ],\r\n  (a, b) => a.id == b.id\r\n); // [ { id: 2, value: 'c' } ]"
+          "example": "filterNonUniqueBy(\n  [\n    { id: 0, value: 'a' },\n    { id: 1, value: 'b' },\n    { id: 2, value: 'c' },\n    { id: 1, value: 'd' },\n    { id: 0, value: 'e' }\n  ],\n  (a, b) => a.id == b.id\n); // [ { id: 2, value: 'c' } ]"
         },
         "tags": [
           "array",
@@ -1845,7 +1845,7 @@
         ]
       },
       "meta": {
-        "hash": "7e38e53cd66a42c5463f9eed768be6f2758da11fa4d62e636d9670fdc22311f9"
+        "hash": "9179ddcbbbf42b58c2fa5b2f079154bee2739e5a843ed8be84a8dc0dc9946116"
       }
     },
     {
@@ -1858,7 +1858,7 @@
         "codeBlocks": {
           "es6": "const findKey = (obj, fn) => Object.keys(obj).find(key => fn(obj[key], key, obj));",
           "es5": "var findKey = function findKey(obj, fn) {\n  return Object.keys(obj).find(function (key) {\n    return fn(obj[key], key, obj);\n  });\n};",
-          "example": "findKey(\r\n  {\r\n    barney: { age: 36, active: true },\r\n    fred: { age: 40, active: false },\r\n    pebbles: { age: 1, active: true }\r\n  },\r\n  o => o['active']\r\n); // 'barney'"
+          "example": "findKey(\n  {\n    barney: { age: 36, active: true },\n    fred: { age: 40, active: false },\n    pebbles: { age: 1, active: true }\n  },\n  o => o['active']\n); // 'barney'"
         },
         "tags": [
           "object",
@@ -1867,7 +1867,7 @@
         ]
       },
       "meta": {
-        "hash": "6ad4a3db3f1a369972c89bbd6f0cf759df6ca26c55352472d293cf964cf584ac"
+        "hash": "cd829971748368811b0c202243f3d968be259e24805715b7459657394eb9f302"
       }
     },
     {
@@ -1888,7 +1888,7 @@
         ]
       },
       "meta": {
-        "hash": "10e49db481cce7a77e3035e54524ba78dd8caebefa0b58c3f0a493802ab6ce76"
+        "hash": "2f79feebcfde7153bc7d457358d3ce9f0c544f98ea2cd35553a5d5e9ac88be6e"
       }
     },
     {
@@ -1899,9 +1899,9 @@
         "fileName": "findLastIndex.md",
         "text": "Returns the index of the last element for which the provided function returns a truthy value.\n\nUse `Array.prototype.map()` to map each element to an array with its index and value.\nUse `Array.prototype.filter()` to remove elements for which `fn` returns falsy values, `Array.prototype.pop()` to get the last one.\n`-1` is the default value when not found.\n\n",
         "codeBlocks": {
-          "es6": "const findLastIndex = (arr, fn) =>\r\n  (arr\r\n    .map((val, i) => [i, val])\r\n    .filter(([i, val]) => fn(val, i, arr))\r\n    .pop() || [-1])[0];",
+          "es6": "const findLastIndex = (arr, fn) =>\n  (arr\n    .map((val, i) => [i, val])\n    .filter(([i, val]) => fn(val, i, arr))\n    .pop() || [-1])[0];",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar findLastIndex = function findLastIndex(arr, fn) {\n  return (arr.map(function (val, i) {\n    return [i, val];\n  }).filter(function (_ref) {\n    var _ref2 = _slicedToArray(_ref, 2),\n        i = _ref2[0],\n        val = _ref2[1];\n\n    return fn(val, i, arr);\n  }).pop() || [-1])[0];\n};",
-          "example": "findLastIndex([1, 2, 3, 4], n => n % 2 === 1); // 2 (index of the value 3)\r\nfindLastIndex([1, 2, 3, 4], n => n === 5); // -1 (default value when not found)"
+          "example": "findLastIndex([1, 2, 3, 4], n => n % 2 === 1); // 2 (index of the value 3)\nfindLastIndex([1, 2, 3, 4], n => n === 5); // -1 (default value when not found)"
         },
         "tags": [
           "array",
@@ -1910,7 +1910,7 @@
         ]
       },
       "meta": {
-        "hash": "993ce3d700e503d786cbdb16aa96011e9976db8949d7279b7242d783fdaa1ad5"
+        "hash": "48e20e5a2457427add5094d4fb588bebb98c244178758610678d25fd64b60f6c"
       }
     },
     {
@@ -1921,9 +1921,9 @@
         "fileName": "findLastKey.md",
         "text": "Returns the last key that satisfies the provided testing function.\nOtherwise `undefined` is returned.\n\nUse `Object.keys(obj)` to get all the properties of the object, `Array.prototype.reverse()` to reverse their order and `Array.prototype.find()` to test the provided function for each key-value pair.\nThe callback receives three arguments - the value, the key and the object.\n\n",
         "codeBlocks": {
-          "es6": "const findLastKey = (obj, fn) =>\r\n  Object.keys(obj)\r\n    .reverse()\r\n    .find(key => fn(obj[key], key, obj));",
+          "es6": "const findLastKey = (obj, fn) =>\n  Object.keys(obj)\n    .reverse()\n    .find(key => fn(obj[key], key, obj));",
           "es5": "var findLastKey = function findLastKey(obj, fn) {\n  return Object.keys(obj).reverse().find(function (key) {\n    return fn(obj[key], key, obj);\n  });\n};",
-          "example": "findLastKey(\r\n  {\r\n    barney: { age: 36, active: true },\r\n    fred: { age: 40, active: false },\r\n    pebbles: { age: 1, active: true }\r\n  },\r\n  o => o['active']\r\n); // 'pebbles'"
+          "example": "findLastKey(\n  {\n    barney: { age: 36, active: true },\n    fred: { age: 40, active: false },\n    pebbles: { age: 1, active: true }\n  },\n  o => o['active']\n); // 'pebbles'"
         },
         "tags": [
           "object",
@@ -1932,7 +1932,7 @@
         ]
       },
       "meta": {
-        "hash": "3fac655dd7f00562e93c9c0687176e8861b2eeda2d045afe4d1cfdcbd601da57"
+        "hash": "884ac6ea5ebaf84aa9d83bba6e2848e0b524fa4a39632cd96bf797474caf4b34"
       }
     },
     {
@@ -1943,9 +1943,9 @@
         "fileName": "flatten.md",
         "text": "Flattens an array up to the specified depth.\n\nUse recursion, decrementing `depth` by 1 for each level of depth.\nUse `Array.prototype.reduce()` and `Array.prototype.concat()` to merge elements or arrays.\nBase case, for `depth` equal to `1` stops recursion.\nOmit the second argument, `depth` to flatten only to a depth of `1` (single flatten).\n\n",
         "codeBlocks": {
-          "es6": "const flatten = (arr, depth = 1) =>\r\n  arr.reduce((a, v) => a.concat(depth > 1 && Array.isArray(v) ? flatten(v, depth - 1) : v), []);",
+          "es6": "const flatten = (arr, depth = 1) =>\n  arr.reduce((a, v) => a.concat(depth > 1 && Array.isArray(v) ? flatten(v, depth - 1) : v), []);",
           "es5": "var flatten = function flatten(arr) {\n  var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return arr.reduce(function (a, v) {\n    return a.concat(depth > 1 && Array.isArray(v) ? flatten(v, depth - 1) : v);\n  }, []);\n};",
-          "example": "flatten([1, [2], 3, 4]); // [1, 2, 3, 4]\r\nflatten([1, [2, [3, [4, 5], 6], 7], 8], 2); // [1, 2, 3, [4, 5], 6, 7, 8]"
+          "example": "flatten([1, [2], 3, 4]); // [1, 2, 3, 4]\nflatten([1, [2, [3, [4, 5], 6], 7], 8], 2); // [1, 2, 3, [4, 5], 6, 7, 8]"
         },
         "tags": [
           "array",
@@ -1953,7 +1953,7 @@
         ]
       },
       "meta": {
-        "hash": "05b26757613b43902a86dd1fb1e6941e6f31f276854082de21d695562d8aaaf8"
+        "hash": "e1793f61af6def69138bf162d0efb8f11578e7be5d718e701075dab4c510ceaa"
       }
     },
     {
@@ -1964,7 +1964,7 @@
         "fileName": "flattenObject.md",
         "text": "Flatten an object with the paths for keys.\n\nUse recursion.\nUse `Object.keys(obj)` combined with `Array.prototype.reduce()` to convert every leaf node to a flattened path node.\nIf the value of a key is an object, the function calls itself with the appropriate `prefix` to create the path using `Object.assign()`.\nOtherwise, it adds the appropriate prefixed key-value pair to the accumulator object.\nYou should always omit the second argument, `prefix`, unless you want every key to have a prefix.\n\n",
         "codeBlocks": {
-          "es6": "const flattenObject = (obj, prefix = '') =>\r\n  Object.keys(obj).reduce((acc, k) => {\r\n    const pre = prefix.length ? prefix + '.' : '';\r\n    if (typeof obj[k] === 'object') Object.assign(acc, flattenObject(obj[k], pre + k));\r\n    else acc[pre + k] = obj[k];\r\n    return acc;\r\n  }, {});",
+          "es6": "const flattenObject = (obj, prefix = '') =>\n  Object.keys(obj).reduce((acc, k) => {\n    const pre = prefix.length ? prefix + '.' : '';\n    if (typeof obj[k] === 'object') Object.assign(acc, flattenObject(obj[k], pre + k));\n    else acc[pre + k] = obj[k];\n    return acc;\n  }, {});",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar flattenObject = function flattenObject(obj) {\n  var prefix = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n  return Object.keys(obj).reduce(function (acc, k) {\n    var pre = prefix.length ? prefix + '.' : '';\n    if (_typeof(obj[k]) === 'object') Object.assign(acc, flattenObject(obj[k], pre + k));else acc[pre + k] = obj[k];\n    return acc;\n  }, {});\n};",
           "example": "flattenObject({ a: { b: { c: 1 } }, d: 1 }); // { 'a.b.c': 1, d: 1 }"
         },
@@ -1975,7 +1975,7 @@
         ]
       },
       "meta": {
-        "hash": "256c8a3b631c9766dc318a47e07f5b74c9cfdb84ba0d005da89c6784c136e726"
+        "hash": "5c49020c066977d2f001fb1101301768cb0e1a757ad76982c0cd0ea9b990e27c"
       }
     },
     {
@@ -2008,7 +2008,7 @@
         "fileName": "forEachRight.md",
         "text": "Executes a provided function once for each array element, starting from the array's last element.\n\nUse `Array.prototype.slice(0)` to clone the given array, `Array.prototype.reverse()` to reverse it and `Array.prototype.forEach()` to iterate over the reversed array.\n\n",
         "codeBlocks": {
-          "es6": "const forEachRight = (arr, callback) =>\r\n  arr\r\n    .slice(0)\r\n    .reverse()\r\n    .forEach(callback);",
+          "es6": "const forEachRight = (arr, callback) =>\n  arr\n    .slice(0)\n    .reverse()\n    .forEach(callback);",
           "es5": "var forEachRight = function forEachRight(arr, callback) {\n  return arr.slice(0).reverse().forEach(callback);\n};",
           "example": "forEachRight([1, 2, 3, 4], val => console.log(val)); // '4', '3', '2', '1'"
         },
@@ -2019,7 +2019,7 @@
         ]
       },
       "meta": {
-        "hash": "acefad1c97978d234a1e0c8afc26795467cc01a4f1b107084fb66f5160dfe07d"
+        "hash": "31b710c7f120ba4e484fb3c782ab6cb3da0a47e84521220d474473229103ed5a"
       }
     },
     {
@@ -2030,9 +2030,9 @@
         "fileName": "formatDuration.md",
         "text": "Returns the human readable format of the given number of milliseconds.\n\nDivide `ms` with the appropriate values to obtain the appropriate values for `day`, `hour`, `minute`, `second` and `millisecond`.\nUse `Object.entries()` with `Array.prototype.filter()` to keep only non-zero values.\nUse `Array.prototype.map()` to create the string for each value, pluralizing appropriately.\nUse `String.prototype.join(', ')` to combine the values into a string.\n\n",
         "codeBlocks": {
-          "es6": "const formatDuration = ms => {\r\n  if (ms < 0) ms = -ms;\r\n  const time = {\r\n    day: Math.floor(ms / 86400000),\r\n    hour: Math.floor(ms / 3600000) % 24,\r\n    minute: Math.floor(ms / 60000) % 60,\r\n    second: Math.floor(ms / 1000) % 60,\r\n    millisecond: Math.floor(ms) % 1000\r\n  };\r\n  return Object.entries(time)\r\n    .filter(val => val[1] !== 0)\r\n    .map(([key, val]) => `${val} ${key}${val !== 1 ? 's' : ''}`)\r\n    .join(', ');\r\n};",
+          "es6": "const formatDuration = ms => {\n  if (ms < 0) ms = -ms;\n  const time = {\n    day: Math.floor(ms / 86400000),\n    hour: Math.floor(ms / 3600000) % 24,\n    minute: Math.floor(ms / 60000) % 60,\n    second: Math.floor(ms / 1000) % 60,\n    millisecond: Math.floor(ms) % 1000\n  };\n  return Object.entries(time)\n    .filter(val => val[1] !== 0)\n    .map(([key, val]) => `${val} ${key}${val !== 1 ? 's' : ''}`)\n    .join(', ');\n};",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar formatDuration = function formatDuration(ms) {\n  if (ms < 0) ms = -ms;\n  var time = {\n    day: Math.floor(ms / 86400000),\n    hour: Math.floor(ms / 3600000) % 24,\n    minute: Math.floor(ms / 60000) % 60,\n    second: Math.floor(ms / 1000) % 60,\n    millisecond: Math.floor(ms) % 1000\n  };\n  return Object.entries(time).filter(function (val) {\n    return val[1] !== 0;\n  }).map(function (_ref) {\n    var _ref2 = _slicedToArray(_ref, 2),\n        key = _ref2[0],\n        val = _ref2[1];\n\n    return \"\".concat(val, \" \").concat(key).concat(val !== 1 ? 's' : '');\n  }).join(', ');\n};",
-          "example": "formatDuration(1001); // '1 second, 1 millisecond'\r\nformatDuration(34325055574); // '397 days, 6 hours, 44 minutes, 15 seconds, 574 milliseconds'"
+          "example": "formatDuration(1001); // '1 second, 1 millisecond'\nformatDuration(34325055574); // '397 days, 6 hours, 44 minutes, 15 seconds, 574 milliseconds'"
         },
         "tags": [
           "date",
@@ -2043,7 +2043,7 @@
         ]
       },
       "meta": {
-        "hash": "850ec34ff993bce76b849e1d0b08be8ee2fa11080f281ac420b01ff72d04a264"
+        "hash": "176cd07a9486286924a7393fe631e83471e7123e3b6349309a7c1cee7746d764"
       }
     },
     {
@@ -2054,7 +2054,7 @@
         "fileName": "formToObject.md",
         "text": "Encode a set of form elements as an `object`.\n\nUse the `FormData` constructor to convert the HTML `form` to `FormData`, `Array.from()` to convert to an array.\nCollect the object from the array, using `Array.prototype.reduce()`.\n\n",
         "codeBlocks": {
-          "es6": "const formToObject = form =>\r\n  Array.from(new FormData(form)).reduce(\r\n    (acc, [key, value]) => ({\r\n      ...acc,\r\n      [key]: value\r\n    }),\r\n    {}\r\n  );",
+          "es6": "const formToObject = form =>\n  Array.from(new FormData(form)).reduce(\n    (acc, [key, value]) => ({\n      ...acc,\n      [key]: value\n    }),\n    {}\n  );",
           "es5": "function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(source).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar formToObject = function formToObject(form) {\n  return Array.from(new FormData(form)).reduce(function (acc, _ref) {\n    var _ref2 = _slicedToArray(_ref, 2),\n        key = _ref2[0],\n        value = _ref2[1];\n\n    return _objectSpread({}, acc, _defineProperty({}, key, value));\n  }, {});\n};",
           "example": "formToObject(document.querySelector('#form')); // { email: 'test@email.com', name: 'Test Name' }"
         },
@@ -2065,7 +2065,7 @@
         ]
       },
       "meta": {
-        "hash": "09c228f22a9522dd25ec50f292359bae6430fb659fd52dfc02fb6d8168092275"
+        "hash": "24c79c76a89e64ad0d4a29f542400937bf280f49cd7bbafff3e26b63f0c4ad4d"
       }
     },
     {
@@ -2086,7 +2086,7 @@
         ]
       },
       "meta": {
-        "hash": "a86fbe1c26c290b8c75b012f5b55a169824a9e7e4423648b8b879f4899570e27"
+        "hash": "0f4525106d39a394413f7623eff35661baad618f49d7c2265496153804862c55"
       }
     },
     {
@@ -2097,7 +2097,7 @@
         "fileName": "forOwnRight.md",
         "text": "Iterates over all own properties of an object in reverse, running a callback for each one.\n\nUse `Object.keys(obj)` to get all the properties of the object, `Array.prototype.reverse()` to reverse their order and `Array.prototype.forEach()` to run the provided function for each key-value pair. The callback receives three arguments - the value, the key and the object.\n\n",
         "codeBlocks": {
-          "es6": "const forOwnRight = (obj, fn) =>\r\n  Object.keys(obj)\r\n    .reverse()\r\n    .forEach(key => fn(obj[key], key, obj));",
+          "es6": "const forOwnRight = (obj, fn) =>\n  Object.keys(obj)\n    .reverse()\n    .forEach(key => fn(obj[key], key, obj));",
           "es5": "var forOwnRight = function forOwnRight(obj, fn) {\n  return Object.keys(obj).reverse().forEach(function (key) {\n    return fn(obj[key], key, obj);\n  });\n};",
           "example": "forOwnRight({ foo: 'bar', a: 1 }, v => console.log(v)); // 1, 'bar'"
         },
@@ -2107,7 +2107,7 @@
         ]
       },
       "meta": {
-        "hash": "48ecb0a9da86bd7ac915066fa6d6f84264b0f8ba010794324d2bbc67542f7a43"
+        "hash": "8810b76dac2c4294a0a029e697441ad73aa87f98a7b1698a61f31c62d5981ec8"
       }
     },
     {
@@ -2118,9 +2118,9 @@
         "fileName": "fromCamelCase.md",
         "text": "Converts a string from camelcase.\n\nUse `String.prototype.replace()` to remove underscores, hyphens, and spaces and convert words to camelcase.\nOmit the second argument to use a default `separator` of `_`.\n\n",
         "codeBlocks": {
-          "es6": "const fromCamelCase = (str, separator = '_') =>\r\n  str\r\n    .replace(/([a-z\\d])([A-Z])/g, '$1' + separator + '$2')\r\n    .replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + separator + '$2')\r\n    .toLowerCase();",
+          "es6": "const fromCamelCase = (str, separator = '_') =>\n  str\n    .replace(/([a-z\\d])([A-Z])/g, '$1' + separator + '$2')\n    .replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + separator + '$2')\n    .toLowerCase();",
           "es5": "var fromCamelCase = function fromCamelCase(str) {\n  var separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '_';\n  return str.replace(/([a-z\\d])([A-Z])/g, '$1' + separator + '$2').replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + separator + '$2').toLowerCase();\n};",
-          "example": "fromCamelCase('someDatabaseFieldName', ' '); // 'some database field name'\r\nfromCamelCase('someLabelThatNeedsToBeCamelized', '-'); // 'some-label-that-needs-to-be-camelized'\r\nfromCamelCase('someJavascriptProperty', '_'); // 'some_javascript_property'"
+          "example": "fromCamelCase('someDatabaseFieldName', ' '); // 'some database field name'\nfromCamelCase('someLabelThatNeedsToBeCamelized', '-'); // 'some-label-that-needs-to-be-camelized'\nfromCamelCase('someJavascriptProperty', '_'); // 'some_javascript_property'"
         },
         "tags": [
           "string",
@@ -2128,7 +2128,7 @@
         ]
       },
       "meta": {
-        "hash": "e43014c6f90608b4b6ccb44e3d12560f202138b1078dfea03c3c2b7d8151b58c"
+        "hash": "1b4fe94ee0e82ecd4c77de9ea258ded34a8a834da1bb021b5b25fe84ab8e4eea"
       }
     },
     {
@@ -2150,7 +2150,7 @@
         ]
       },
       "meta": {
-        "hash": "086d293330ee25c0a737a3059968e65adffa91494940e4d94a5959bb4ea48653"
+        "hash": "9f8947652b9c2faba5f1bda82f992bdc81a71c67374fcc843e96ce2a327a28db"
       }
     },
     {
@@ -2161,9 +2161,9 @@
         "fileName": "functions.md",
         "text": "Returns an array of function property names from own (and optionally inherited) enumerable properties of an object.\n\nUse `Object.keys(obj)` to iterate over the object's own properties.\nIf `inherited` is `true`, use `Object.get.PrototypeOf(obj)` to also get the object's inherited properties.\nUse `Array.prototype.filter()` to keep only those properties that are functions.\nOmit the second argument, `inherited`, to not include inherited properties by default.\n\n",
         "codeBlocks": {
-          "es6": "const functions = (obj, inherited = false) =>\r\n  (inherited\r\n    ? [...Object.keys(obj), ...Object.keys(Object.getPrototypeOf(obj))]\r\n    : Object.keys(obj)\r\n  ).filter(key => typeof obj[key] === 'function');",
+          "es6": "const functions = (obj, inherited = false) =>\n  (inherited\n    ? [...Object.keys(obj), ...Object.keys(Object.getPrototypeOf(obj))]\n    : Object.keys(obj)\n  ).filter(key => typeof obj[key] === 'function');",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar functions = function functions(obj) {\n  var inherited = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  return (inherited ? [].concat(_toConsumableArray(Object.keys(obj)), _toConsumableArray(Object.keys(Object.getPrototypeOf(obj)))) : Object.keys(obj)).filter(function (key) {\n    return typeof obj[key] === 'function';\n  });\n};",
-          "example": "function Foo() {\r\n  this.a = () => 1;\r\n  this.b = () => 2;\r\n}\r\nFoo.prototype.c = () => 3;\r\nfunctions(new Foo()); // ['a', 'b']\r\nfunctions(new Foo(), true); // ['a', 'b', 'c']"
+          "example": "function Foo() {\n  this.a = () => 1;\n  this.b = () => 2;\n}\nFoo.prototype.c = () => 3;\nfunctions(new Foo()); // ['a', 'b']\nfunctions(new Foo(), true); // ['a', 'b', 'c']"
         },
         "tags": [
           "object",
@@ -2172,7 +2172,7 @@
         ]
       },
       "meta": {
-        "hash": "59ad552abe8321c20a89f0c9de7d7e47dc54e74c0eb4121a04ea2ab6d1e844e4"
+        "hash": "1ad875e1b31348464b3eedddc0e0a4b0e10154e16b08025fa5e46d94995aa887"
       }
     },
     {
@@ -2183,9 +2183,9 @@
         "fileName": "gcd.md",
         "text": "Calculates the greatest common divisor between two or more numbers/arrays.\n\nThe inner `_gcd` function uses recursion.\nBase case is when `y` equals `0`. In this case, return `x`.\nOtherwise, return the GCD of `y` and the remainder of the division `x/y`.\n\n",
         "codeBlocks": {
-          "es6": "const gcd = (...arr) => {\r\n  const _gcd = (x, y) => (!y ? x : gcd(y, x % y));\r\n  return [...arr].reduce((a, b) => _gcd(a, b));\r\n};",
+          "es6": "const gcd = (...arr) => {\n  const _gcd = (x, y) => (!y ? x : gcd(y, x % y));\n  return [...arr].reduce((a, b) => _gcd(a, b));\n};",
           "es5": "var gcd = function gcd() {\n  var _gcd = function _gcd(x, y) {\n    return !y ? x : gcd(y, x % y);\n  };\n\n  for (var _len = arguments.length, arr = new Array(_len), _key = 0; _key < _len; _key++) {\n    arr[_key] = arguments[_key];\n  }\n\n  return [].concat(arr).reduce(function (a, b) {\n    return _gcd(a, b);\n  });\n};",
-          "example": "gcd(8, 36); // 4\r\ngcd(...[12, 8, 32]); // 4"
+          "example": "gcd(8, 36); // 4\ngcd(...[12, 8, 32]); // 4"
         },
         "tags": [
           "math",
@@ -2194,7 +2194,7 @@
         ]
       },
       "meta": {
-        "hash": "b8be82f028bc074c193da1f760ca7c52d0cbd596d469a49ac92657a8b1dda41a"
+        "hash": "751df689bc853192c8302d245e96684deaf158da463d8cdcbd54f84bb0d7c6dc"
       }
     },
     {
@@ -2205,9 +2205,9 @@
         "fileName": "geometricProgression.md",
         "text": "Initializes an array containing the numbers in the specified range where `start` and `end` are inclusive and the ratio between two terms is `step`.\nReturns an error if `step` equals `1`.\n\nUse `Array.from()`, `Math.log()` and `Math.floor()` to create an array of the desired length, `Array.prototype.map()` to fill with the desired values in a range.\nOmit the second argument, `start`, to use a default value of `1`.\nOmit the third argument, `step`, to use a default value of `2`.\n\n",
         "codeBlocks": {
-          "es6": "const geometricProgression = (end, start = 1, step = 2) =>\r\n  Array.from({ length: Math.floor(Math.log(end / start) / Math.log(step)) + 1 }).map(\r\n    (v, i) => start * step ** i\r\n  );",
+          "es6": "const geometricProgression = (end, start = 1, step = 2) =>\n  Array.from({ length: Math.floor(Math.log(end / start) / Math.log(step)) + 1 }).map(\n    (v, i) => start * step ** i\n  );",
           "es5": "var geometricProgression = function geometricProgression(end) {\n  var start = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  var step = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 2;\n  return Array.from({\n    length: Math.floor(Math.log(end / start) / Math.log(step)) + 1\n  }).map(function (v, i) {\n    return start * Math.pow(step, i);\n  });\n};",
-          "example": "geometricProgression(256); // [1, 2, 4, 8, 16, 32, 64, 128, 256]\r\ngeometricProgression(256, 3); // [3, 6, 12, 24, 48, 96, 192]\r\ngeometricProgression(256, 1, 4); // [1, 4, 16, 64, 256]"
+          "example": "geometricProgression(256); // [1, 2, 4, 8, 16, 32, 64, 128, 256]\ngeometricProgression(256, 3); // [3, 6, 12, 24, 48, 96, 192]\ngeometricProgression(256, 1, 4); // [1, 4, 16, 64, 256]"
         },
         "tags": [
           "math",
@@ -2215,7 +2215,7 @@
         ]
       },
       "meta": {
-        "hash": "dc5a09c89358b5410cab8967467f6e3943b63aedfcb0006631be00a7274cc337"
+        "hash": "dec4fa85a58d11deefd90a66b0ede5ec73ad3e2481d5cf76918d13235c3238d9"
       }
     },
     {
@@ -2226,9 +2226,9 @@
         "fileName": "get.md",
         "text": "Retrieve a set of properties indicated by the given selectors from an object.\n\nUse `Array.prototype.map()` for each selector, `String.prototype.replace()` to replace square brackets with dots, `String.prototype.split('.')` to split each selector, `Array.prototype.filter()` to remove empty values and `Array.prototype.reduce()` to get the value indicated by it.\n\n",
         "codeBlocks": {
-          "es6": "const get = (from, ...selectors) =>\r\n  [...selectors].map(s =>\r\n    s\r\n      .replace(/\\[([^\\[\\]]*)\\]/g, '.$1.')\r\n      .split('.')\r\n      .filter(t => t !== '')\r\n      .reduce((prev, cur) => prev && prev[cur], from)\r\n  );",
+          "es6": "const get = (from, ...selectors) =>\n  [...selectors].map(s =>\n    s\n      .replace(/\\[([^\\[\\]]*)\\]/g, '.$1.')\n      .split('.')\n      .filter(t => t !== '')\n      .reduce((prev, cur) => prev && prev[cur], from)\n  );",
           "es5": "var get = function get(from) {\n  for (var _len = arguments.length, selectors = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    selectors[_key - 1] = arguments[_key];\n  }\n\n  return [].concat(selectors).map(function (s) {\n    return s.replace(/\\[([^\\[\\]]*)\\]/g, '.$1.').split('.').filter(function (t) {\n      return t !== '';\n    }).reduce(function (prev, cur) {\n      return prev && prev[cur];\n    }, from);\n  });\n};",
-          "example": "const obj = { selector: { to: { val: 'val to select' } }, target: [1, 2, { a: 'test' }] };\r\nget(obj, 'selector.to.val', 'target[0]', 'target[2].a'); // ['val to select', 1, 'test']"
+          "example": "const obj = { selector: { to: { val: 'val to select' } }, target: [1, 2, { a: 'test' }] };\nget(obj, 'selector.to.val', 'target[0]', 'target[2].a'); // ['val to select', 1, 'test']"
         },
         "tags": [
           "object",
@@ -2236,7 +2236,7 @@
         ]
       },
       "meta": {
-        "hash": "f85c17ea79b6aa973ac396273c08388b1608ec2bed2d5c865e231cee12171ccd"
+        "hash": "9f1b9128c94cd905327d5f09904f924fee541e8114e298fe7e01855d87cfe3d2"
       }
     },
     {
@@ -2257,7 +2257,7 @@
         ]
       },
       "meta": {
-        "hash": "31951123792158e6ac3aa4a4b6579384da02ea7c1656d8519ec661177764e15b"
+        "hash": "b2802086a18e09907de87f5409547d902ce7f6ae4f5a39cbc8869a662353303e"
       }
     },
     {
@@ -2268,7 +2268,7 @@
         "fileName": "getDaysDiffBetweenDates.md",
         "text": "Returns the difference (in days) between two dates.\n\nCalculate the difference (in days) between two `Date` objects.\n\n",
         "codeBlocks": {
-          "es6": "const getDaysDiffBetweenDates = (dateInitial, dateFinal) =>\r\n  (dateFinal - dateInitial) / (1000 * 3600 * 24);",
+          "es6": "const getDaysDiffBetweenDates = (dateInitial, dateFinal) =>\n  (dateFinal - dateInitial) / (1000 * 3600 * 24);",
           "es5": "var getDaysDiffBetweenDates = function getDaysDiffBetweenDates(dateInitial, dateFinal) {\n  return (dateFinal - dateInitial) / (1000 * 3600 * 24);\n};",
           "example": "getDaysDiffBetweenDates(new Date('2017-12-13'), new Date('2017-12-22')); // 9"
         },
@@ -2278,7 +2278,7 @@
         ]
       },
       "meta": {
-        "hash": "688e47c3386210f391da19cb1acf8d84518693c6254d0acd95c74ed058e72348"
+        "hash": "0a2c0629c3c0661519c08d21768dadd5bebac35c892d980d390b16b60c60a2eb"
       }
     },
     {
@@ -2289,9 +2289,9 @@
         "fileName": "getImages.md",
         "text": "Fetches all images from within an element and puts them into an array\n\nUse `Element.prototype.getElementsByTagName()` to fetch all `<img>` elements inside the provided element, `Array.prototype.map()` to map every `src` attribute of their respective `<img>` element, then create a `Set` to eliminate duplicates and return the array.\n\n",
         "codeBlocks": {
-          "es6": "const getImages = (el, includeDuplicates = false) => {\r\n  const images = [...el.getElementsByTagName('img')].map(img => img.getAttribute('src'));\r\n  return includeDuplicates ? images : [...new Set(images)];\r\n};",
+          "es6": "const getImages = (el, includeDuplicates = false) => {\n  const images = [...el.getElementsByTagName('img')].map(img => img.getAttribute('src'));\n  return includeDuplicates ? images : [...new Set(images)];\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar getImages = function getImages(el) {\n  var includeDuplicates = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n\n  var images = _toConsumableArray(el.getElementsByTagName('img')).map(function (img) {\n    return img.getAttribute('src');\n  });\n\n  return includeDuplicates ? images : _toConsumableArray(new Set(images));\n};",
-          "example": "getImages(document, true); // ['image1.jpg', 'image2.png', 'image1.png', '...']\r\ngetImages(document, false); // ['image1.jpg', 'image2.png', '...']"
+          "example": "getImages(document, true); // ['image1.jpg', 'image2.png', 'image1.png', '...']\ngetImages(document, false); // ['image1.jpg', 'image2.png', '...']"
         },
         "tags": [
           "browser",
@@ -2299,7 +2299,7 @@
         ]
       },
       "meta": {
-        "hash": "1f774c5f8e2910a3aeaf8189c70e0c3f3eb3c11a79ebd2862109fad0d2fb1d44"
+        "hash": "1caa2b9a8817bc11874785cdcf9f676e169caec6487c54124287ce85bb818c93"
       }
     },
     {
@@ -2310,9 +2310,9 @@
         "fileName": "getMeridiemSuffixOfInteger.md",
         "text": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\n\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.\n\n",
         "codeBlocks": {
-          "es6": "const getMeridiemSuffixOfInteger = num =>\r\n  num === 0 || num === 24\r\n    ? 12 + 'am'\r\n    : num === 12\r\n      ? 12 + 'pm'\r\n      : num < 12\r\n        ? (num % 12) + 'am'\r\n        : (num % 12) + 'pm';",
+          "es6": "const getMeridiemSuffixOfInteger = num =>\n  num === 0 || num === 24\n    ? 12 + 'am'\n    : num === 12\n    ? 12 + 'pm'\n    : num < 12\n    ? (num % 12) + 'am'\n    : (num % 12) + 'pm';",
           "es5": "var getMeridiemSuffixOfInteger = function getMeridiemSuffixOfInteger(num) {\n  return num === 0 || num === 24 ? 12 + 'am' : num === 12 ? 12 + 'pm' : num < 12 ? num % 12 + 'am' : num % 12 + 'pm';\n};",
-          "example": "getMeridiemSuffixOfInteger(0); // \"12am\"\r\ngetMeridiemSuffixOfInteger(11); // \"11am\"\r\ngetMeridiemSuffixOfInteger(13); // \"1pm\"\r\ngetMeridiemSuffixOfInteger(25); // \"1pm\""
+          "example": "getMeridiemSuffixOfInteger(0); // \"12am\"\ngetMeridiemSuffixOfInteger(11); // \"11am\"\ngetMeridiemSuffixOfInteger(13); // \"1pm\"\ngetMeridiemSuffixOfInteger(25); // \"1pm\""
         },
         "tags": [
           "date",
@@ -2320,7 +2320,7 @@
         ]
       },
       "meta": {
-        "hash": "302fe6c17675c3e7792b162592bf368a5d0c90a3c46e5bb8783c56c52c2b77f9"
+        "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
       }
     },
     {
@@ -2331,7 +2331,7 @@
         "fileName": "getScrollPosition.md",
         "text": "Returns the scroll position of the current page.\n\nUse `pageXOffset` and `pageYOffset` if they are defined, otherwise `scrollLeft` and `scrollTop`.\nYou can omit `el` to use a default value of `window`.\n\n",
         "codeBlocks": {
-          "es6": "const getScrollPosition = (el = window) => ({\r\n  x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,\r\n  y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop\r\n});",
+          "es6": "const getScrollPosition = (el = window) => ({\n  x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,\n  y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop\n});",
           "es5": "var getScrollPosition = function getScrollPosition() {\n  var el = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : window;\n  return {\n    x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,\n    y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop\n  };\n};",
           "example": "getScrollPosition(); // {x: 0, y: 200}"
         },
@@ -2341,7 +2341,7 @@
         ]
       },
       "meta": {
-        "hash": "cfb1339890d20878f61906660457ca315c0e9d4d7896ea53bbd9ebf3d95abb9e"
+        "hash": "255afa82679e614e1388476fb4392f0e1bb45f11e1c02e965925e231401f1f2c"
       }
     },
     {
@@ -2363,7 +2363,7 @@
         ]
       },
       "meta": {
-        "hash": "6bed676c5c244c645dc7edb01ed828dcf125c61c1ceea755bb425b0cdfabf27f"
+        "hash": "f779277f9fb5fe54aa4b122bf87d73d921cd2550253a5bda3a2b512ebf70a976"
       }
     },
     {
@@ -2374,7 +2374,7 @@
         "fileName": "getType.md",
         "text": "Returns the native type of a value.\n\nReturns lowercased constructor name of value, `\"undefined\"` or `\"null\"` if value is `undefined` or `null`.\n\n",
         "codeBlocks": {
-          "es6": "const getType = v =>\r\n  v === undefined ? 'undefined' : v === null ? 'null' : v.constructor.name.toLowerCase();",
+          "es6": "const getType = v =>\n  v === undefined ? 'undefined' : v === null ? 'null' : v.constructor.name.toLowerCase();",
           "es5": "var getType = function getType(v) {\n  return v === undefined ? 'undefined' : v === null ? 'null' : v.constructor.name.toLowerCase();\n};",
           "example": "getType(new Set([1, 2, 3])); // 'set'"
         },
@@ -2384,7 +2384,7 @@
         ]
       },
       "meta": {
-        "hash": "8168607e9f063a80e9c2e6daf5be71e007a1dd73cbfd3fcf07dc88e7569a29dd"
+        "hash": "7209ddadbe2402ac811e20f69feecbb682ee8ec0545dc4d0839455d4cb790432"
       }
     },
     {
@@ -2395,9 +2395,9 @@
         "fileName": "getURLParameters.md",
         "text": "Returns an object containing the parameters of the current URL.\n\nUse `String.match()` with an appropriate regular expression to get all key-value pairs, `Array.prototype.reduce()` to map and combine them into a single object.\nPass `location.search` as the argument to apply to the current `url`.\n\n",
         "codeBlocks": {
-          "es6": "const getURLParameters = url =>\r\n  (url.match(/([^?=&]+)(=([^&]*))/g) || []).reduce(\r\n    (a, v) => ((a[v.slice(0, v.indexOf('='))] = v.slice(v.indexOf('=') + 1)), a),\r\n    {}\r\n  );",
+          "es6": "const getURLParameters = url =>\n  (url.match(/([^?=&]+)(=([^&]*))/g) || []).reduce(\n    (a, v) => ((a[v.slice(0, v.indexOf('='))] = v.slice(v.indexOf('=') + 1)), a),\n    {}\n  );",
           "es5": "var getURLParameters = function getURLParameters(url) {\n  return (url.match(/([^?=&]+)(=([^&]*))/g) || []).reduce(function (a, v) {\n    return a[v.slice(0, v.indexOf('='))] = v.slice(v.indexOf('=') + 1), a;\n  }, {});\n};",
-          "example": "getURLParameters('http://url.com/page?name=Adam&surname=Smith'); // {name: 'Adam', surname: 'Smith'}\r\ngetURLParameters('google.com'); // {}"
+          "example": "getURLParameters('http://url.com/page?name=Adam&surname=Smith'); // {name: 'Adam', surname: 'Smith'}\ngetURLParameters('google.com'); // {}"
         },
         "tags": [
           "utility",
@@ -2408,7 +2408,7 @@
         ]
       },
       "meta": {
-        "hash": "db9d3a2f018998e9c410fe2fb6fb6bdc0ae44314af0ab9d4067fe10d30583966"
+        "hash": "460d0f75a526126cabbc1a0b7b727b78999332bec7876959519c187cd8db96db"
       }
     },
     {
@@ -2419,9 +2419,9 @@
         "fileName": "groupBy.md",
         "text": "Groups the elements of an array based on the given function.\n\nUse `Array.prototype.map()` to map the values of an array to a function or property name.\nUse `Array.prototype.reduce()` to create an object, where the keys are produced from the mapped results.\n\n",
         "codeBlocks": {
-          "es6": "const groupBy = (arr, fn) =>\r\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val, i) => {\r\n    acc[val] = (acc[val] || []).concat(arr[i]);\r\n    return acc;\r\n  }, {});",
+          "es6": "const groupBy = (arr, fn) =>\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val, i) => {\n    acc[val] = (acc[val] || []).concat(arr[i]);\n    return acc;\n  }, {});",
           "es5": "var groupBy = function groupBy(arr, fn) {\n  return arr.map(typeof fn === 'function' ? fn : function (val) {\n    return val[fn];\n  }).reduce(function (acc, val, i) {\n    acc[val] = (acc[val] || []).concat(arr[i]);\n    return acc;\n  }, {});\n};",
-          "example": "groupBy([6.1, 4.2, 6.3], Math.floor); // {4: [4.2], 6: [6.1, 6.3]}\r\ngroupBy(['one', 'two', 'three'], 'length'); // {3: ['one', 'two'], 5: ['three']}"
+          "example": "groupBy([6.1, 4.2, 6.3], Math.floor); // {4: [4.2], 6: [6.1, 6.3]}\ngroupBy(['one', 'two', 'three'], 'length'); // {3: ['one', 'two'], 5: ['three']}"
         },
         "tags": [
           "array",
@@ -2430,7 +2430,7 @@
         ]
       },
       "meta": {
-        "hash": "ed65c4da8d5ed52650dfd0eb198698c81227ca9dfaad9fee0a5a88fce9d67fe3"
+        "hash": "8f501c922c2d5d7fcb20bc84153e7b392b4209592f54b7bae5c61b77bb107f81"
       }
     },
     {
@@ -2451,7 +2451,7 @@
         ]
       },
       "meta": {
-        "hash": "d9d5dc03b392e24f48ef0d9ba16fc03059b24916728a8cb47ecae09dd82faa5d"
+        "hash": "b4234c37a89fb91b38283fc4ce8c4ccb2d7fb62d522f0becad4dd3d6a62efe56"
       }
     },
     {
@@ -2473,7 +2473,7 @@
         ]
       },
       "meta": {
-        "hash": "6d3bf4ca574efecfcfb36e1b5f3130c0b6e5bdc2604f527585e2c2a3c71f2c1b"
+        "hash": "bb20ea2c4697a6036f1d149063f91a973de3bb5902649ca7ac6c9271a3561375"
       }
     },
     {
@@ -2484,9 +2484,9 @@
         "fileName": "hasFlags.md",
         "text": "Check if the current process's arguments contain the specified flags.\n\nUse `Array.prototype.every()` and `Array.prototype.includes()` to check if `process.argv` contains all the specified flags.\nUse a regular expression to test if the specified flags are prefixed with `-` or `--` and prefix them accordingly.\n\n",
         "codeBlocks": {
-          "es6": "const hasFlags = (...flags) =>\r\n  flags.every(flag => process.argv.includes(/^-{1,2}/.test(flag) ? flag : '--' + flag));",
+          "es6": "const hasFlags = (...flags) =>\n  flags.every(flag => process.argv.includes(/^-{1,2}/.test(flag) ? flag : '--' + flag));",
           "es5": "var hasFlags = function hasFlags() {\n  for (var _len = arguments.length, flags = new Array(_len), _key = 0; _key < _len; _key++) {\n    flags[_key] = arguments[_key];\n  }\n\n  return flags.every(function (flag) {\n    return process.argv.includes(/^-{1,2}/.test(flag) ? flag : '--' + flag);\n  });\n};",
-          "example": "// node myScript.js -s --test --cool=true\r\nhasFlags('-s'); // true\r\nhasFlags('--test', 'cool=true', '-s'); // true\r\nhasFlags('special'); // false"
+          "example": "// node myScript.js -s --test --cool=true\nhasFlags('-s'); // true\nhasFlags('--test', 'cool=true', '-s'); // true\nhasFlags('special'); // false"
         },
         "tags": [
           "node",
@@ -2494,7 +2494,7 @@
         ]
       },
       "meta": {
-        "hash": "96e82bd321e00116ab9e8bd0917d2a3eb47d36ff2cc8f24910fb3747e6f41566"
+        "hash": "45c7a17b5debde35c4b31270a22e1a052fb4b4f1d7c05d10c8045caec96ef550"
       }
     },
     {
@@ -2505,7 +2505,7 @@
         "fileName": "hashBrowser.md",
         "text": "Creates a hash for a value using the [SHA-256](https://en.wikipedia.org/wiki/SHA-2) algorithm. Returns a promise.\n\nUse the [SubtleCrypto](https://developer.mozilla.org/en-US/docs/Web/API/SubtleCrypto) API to create a hash for the given value.\n\n",
         "codeBlocks": {
-          "es6": "const hashBrowser = val =>\r\n  crypto.subtle.digest('SHA-256', new TextEncoder('utf-8').encode(val)).then(h => {\r\n    let hexes = [],\r\n      view = new DataView(h);\r\n    for (let i = 0; i < view.byteLength; i += 4)\r\n      hexes.push(('00000000' + view.getUint32(i).toString(16)).slice(-8));\r\n    return hexes.join('');\r\n  });",
+          "es6": "const hashBrowser = val =>\n  crypto.subtle.digest('SHA-256', new TextEncoder('utf-8').encode(val)).then(h => {\n    let hexes = [],\n      view = new DataView(h);\n    for (let i = 0; i < view.byteLength; i += 4)\n      hexes.push(('00000000' + view.getUint32(i).toString(16)).slice(-8));\n    return hexes.join('');\n  });",
           "es5": "var hashBrowser = function hashBrowser(val) {\n  return crypto.subtle.digest('SHA-256', new TextEncoder('utf-8').encode(val)).then(function (h) {\n    var hexes = [],\n        view = new DataView(h);\n\n    for (var i = 0; i < view.byteLength; i += 4) {\n      hexes.push(('00000000' + view.getUint32(i).toString(16)).slice(-8));\n    }\n\n    return hexes.join('');\n  });\n};",
           "example": "hashBrowser(JSON.stringify({ a: 'a', b: [1, 2, 3, 4], foo: { c: 'bar' } })).then(console.log); // '04aa106279f5977f59f9067fa9712afc4aedc6f5862a8defc34552d8c7206393'"
         },
@@ -2518,7 +2518,7 @@
         ]
       },
       "meta": {
-        "hash": "69474eb1d52d8cf5d74cb68d3786b2721418c1cfa6b9863f710a3c08aab3c12d"
+        "hash": "beb6f68f5a8b63fd90a671758556aa72b5c061b681df049779cdf5631837966c"
       }
     },
     {
@@ -2529,7 +2529,7 @@
         "fileName": "hashNode.md",
         "text": "Creates a hash for a value using the [SHA-256](https://en.wikipedia.org/wiki/SHA-2) algorithm. Returns a promise.\n\nUse `crypto` API to create a hash for the given value, `setTimeout` to prevent blocking on a long operation, and a `Promise` to give it a familiar interface.\n\n",
         "codeBlocks": {
-          "es6": "const crypto = require('crypto');\r\nconst hashNode = val =>\r\n  new Promise(resolve =>\r\n    setTimeout(\r\n      () =>\r\n        resolve(\r\n          crypto\r\n            .createHash('sha256')\r\n            .update(val)\r\n            .digest('hex')\r\n        ),\r\n      0\r\n    )\r\n  );",
+          "es6": "const crypto = require('crypto');\nconst hashNode = val =>\n  new Promise(resolve =>\n    setTimeout(\n      () =>\n        resolve(\n          crypto\n            .createHash('sha256')\n            .update(val)\n            .digest('hex')\n        ),\n      0\n    )\n  );",
           "es5": "var crypto = require('crypto');\n\nvar hashNode = function hashNode(val) {\n  return new Promise(function (resolve) {\n    return setTimeout(function () {\n      return resolve(crypto.createHash('sha256').update(val).digest('hex'));\n    }, 0);\n  });\n};",
           "example": "hashNode(JSON.stringify({ a: 'a', b: [1, 2, 3, 4], foo: { c: 'bar' } })).then(console.log); // '04aa106279f5977f59f9067fa9712afc4aedc6f5862a8defc34552d8c7206393'"
         },
@@ -2541,7 +2541,7 @@
         ]
       },
       "meta": {
-        "hash": "ae6d4cb09a8e1da1a05d958b29f8030536480d0999b1389d48b663151bbea2f8"
+        "hash": "e7b6164cfaacf4869f997747df3e135a1ec4342abf5a56498586513332272a96"
       }
     },
     {
@@ -2562,7 +2562,7 @@
         ]
       },
       "meta": {
-        "hash": "8a257f572247b4025a5064162a0231281c8be01e66741b23aa5a5b7bd037d461"
+        "hash": "ce8a65975fa1d28533405e5518de608bcd3701bd21f97df39bc6e22b0e9bdf78"
       }
     },
     {
@@ -2573,9 +2573,9 @@
         "fileName": "hexToRGB.md",
         "text": "Converts a color code to a `rgb()` or `rgba()` string if alpha value is provided.\n\nUse bitwise right-shift operator and mask bits with `&` (and) operator to convert a hexadecimal color code (with or without prefixed with `#`) to a string with the RGB values. If it's 3-digit color code, first convert to 6-digit version. If an alpha value is provided alongside 6-digit hex, give `rgba()` string in return.\n\n",
         "codeBlocks": {
-          "es6": "const hexToRGB = hex => {\r\n  let alpha = false,\r\n    h = hex.slice(hex.startsWith('#') ? 1 : 0);\r\n  if (h.length === 3) h = [...h].map(x => x + x).join('');\r\n  else if (h.length === 8) alpha = true;\r\n  h = parseInt(h, 16);\r\n  return (\r\n    'rgb' +\r\n    (alpha ? 'a' : '') +\r\n    '(' +\r\n    (h >>> (alpha ? 24 : 16)) +\r\n    ', ' +\r\n    ((h & (alpha ? 0x00ff0000 : 0x00ff00)) >>> (alpha ? 16 : 8)) +\r\n    ', ' +\r\n    ((h & (alpha ? 0x0000ff00 : 0x0000ff)) >>> (alpha ? 8 : 0)) +\r\n    (alpha ? `, ${h & 0x000000ff}` : '') +\r\n    ')'\r\n  );\r\n};",
+          "es6": "const hexToRGB = hex => {\n  let alpha = false,\n    h = hex.slice(hex.startsWith('#') ? 1 : 0);\n  if (h.length === 3) h = [...h].map(x => x + x).join('');\n  else if (h.length === 8) alpha = true;\n  h = parseInt(h, 16);\n  return (\n    'rgb' +\n    (alpha ? 'a' : '') +\n    '(' +\n    (h >>> (alpha ? 24 : 16)) +\n    ', ' +\n    ((h & (alpha ? 0x00ff0000 : 0x00ff00)) >>> (alpha ? 16 : 8)) +\n    ', ' +\n    ((h & (alpha ? 0x0000ff00 : 0x0000ff)) >>> (alpha ? 8 : 0)) +\n    (alpha ? `, ${h & 0x000000ff}` : '') +\n    ')'\n  );\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar hexToRGB = function hexToRGB(hex) {\n  var alpha = false,\n      h = hex.slice(hex.startsWith('#') ? 1 : 0);\n  if (h.length === 3) h = _toConsumableArray(h).map(function (x) {\n    return x + x;\n  }).join('');else if (h.length === 8) alpha = true;\n  h = parseInt(h, 16);\n  return 'rgb' + (alpha ? 'a' : '') + '(' + (h >>> (alpha ? 24 : 16)) + ', ' + ((h & (alpha ? 0x00ff0000 : 0x00ff00)) >>> (alpha ? 16 : 8)) + ', ' + ((h & (alpha ? 0x0000ff00 : 0x0000ff)) >>> (alpha ? 8 : 0)) + (alpha ? \", \".concat(h & 0x000000ff) : '') + ')';\n};",
-          "example": "hexToRGB('#27ae60ff'); // 'rgba(39, 174, 96, 255)'\r\nhexToRGB('27ae60'); // 'rgb(39, 174, 96)'\r\nhexToRGB('#fff'); // 'rgb(255, 255, 255)'"
+          "example": "hexToRGB('#27ae60ff'); // 'rgba(39, 174, 96, 255)'\nhexToRGB('27ae60'); // 'rgb(39, 174, 96)'\nhexToRGB('#fff'); // 'rgb(255, 255, 255)'"
         },
         "tags": [
           "utility",
@@ -2585,7 +2585,7 @@
         ]
       },
       "meta": {
-        "hash": "0762c225818c8ef49001ac6691f6acf7aa86f2f5c310498d2fb86f56bfec3639"
+        "hash": "f61b08541372ded95a947cc570f57f7bbc9c7908ede569d59f294c5b9ef6feb1"
       }
     },
     {
@@ -2607,7 +2607,7 @@
         ]
       },
       "meta": {
-        "hash": "f0f1e093ca1900c17a2b3390604c05dcc8d89f678cc4202ad2ce388f2861a717"
+        "hash": "b2cb8be1a0e2b2d6471762cdac531925aa3c0c695f2ef162e0c8c1f4a1c174aa"
       }
     },
     {
@@ -2618,9 +2618,9 @@
         "fileName": "httpGet.md",
         "text": "Makes a `GET` request to the passed URL.\n\nUse [`XMLHttpRequest`](https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Using_XMLHttpRequest) web api to make a `get` request to the given `url`.\nHandle the `onload` event, by calling the given `callback` the `responseText`.\nHandle the `onerror` event, by running the provided `err` function.\nOmit the third argument, `err`, to log errors to the console's `error` stream by default.\n\n",
         "codeBlocks": {
-          "es6": "const httpGet = (url, callback, err = console.error) => {\r\n  const request = new XMLHttpRequest();\r\n  request.open('GET', url, true);\r\n  request.onload = () => callback(request.responseText);\r\n  request.onerror = () => err(request);\r\n  request.send();\r\n};",
+          "es6": "const httpGet = (url, callback, err = console.error) => {\n  const request = new XMLHttpRequest();\n  request.open('GET', url, true);\n  request.onload = () => callback(request.responseText);\n  request.onerror = () => err(request);\n  request.send();\n};",
           "es5": "var httpGet = function httpGet(url, callback) {\n  var err = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : console.error;\n  var request = new XMLHttpRequest();\n  request.open('GET', url, true);\n\n  request.onload = function () {\n    return callback(request.responseText);\n  };\n\n  request.onerror = function () {\n    return err(request);\n  };\n\n  request.send();\n};",
-          "example": "httpGet(\r\n  'https://jsonplaceholder.typicode.com/posts/1',\r\n  console.log\r\n); /*\r\nLogs: {\r\n  \"userId\": 1,\r\n  \"id\": 1,\r\n  \"title\": \"sunt aut facere repellat provident occaecati excepturi optio reprehenderit\",\r\n  \"body\": \"quia et suscipit\\nsuscipit recusandae consequuntur expedita et cum\\nreprehenderit molestiae ut ut quas totam\\nnostrum rerum est autem sunt rem eveniet architecto\"\r\n}\r\n*/"
+          "example": "httpGet(\n  'https://jsonplaceholder.typicode.com/posts/1',\n  console.log\n); /*\nLogs: {\n  \"userId\": 1,\n  \"id\": 1,\n  \"title\": \"sunt aut facere repellat provident occaecati excepturi optio reprehenderit\",\n  \"body\": \"quia et suscipit\\nsuscipit recusandae consequuntur expedita et cum\\nreprehenderit molestiae ut ut quas totam\\nnostrum rerum est autem sunt rem eveniet architecto\"\n}\n*/"
         },
         "tags": [
           "utility",
@@ -2630,7 +2630,7 @@
         ]
       },
       "meta": {
-        "hash": "99a276135e36f8740fbe0ca8c24364b8fd5b1b529575a1f5c95a43039539917f"
+        "hash": "c138c0e5f16d48997691a98de7c0bc43b228a0b4285f0ab2b26d230e209d1530"
       }
     },
     {
@@ -2641,9 +2641,9 @@
         "fileName": "httpPost.md",
         "text": "Makes a `POST` request to the passed URL.\n\nUse [`XMLHttpRequest`](https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/Using_XMLHttpRequest) web api to make a `post` request to the given `url`.\nSet the value of an `HTTP` request header with `setRequestHeader` method.\nHandle the `onload` event, by calling the given `callback` the `responseText`.\nHandle the `onerror` event, by running the provided `err` function.\nOmit the third argument, `data`, to send no data to the provided `url`.\nOmit the fourth argument, `err`, to log errors to the console's `error` stream by default.\n\n",
         "codeBlocks": {
-          "es6": "const httpPost = (url, data, callback, err = console.error) => {\r\n  const request = new XMLHttpRequest();\r\n  request.open('POST', url, true);\r\n  request.setRequestHeader('Content-type', 'application/json; charset=utf-8');\r\n  request.onload = () => callback(request.responseText);\r\n  request.onerror = () => err(request);\r\n  request.send(data);\r\n};",
+          "es6": "const httpPost = (url, data, callback, err = console.error) => {\n  const request = new XMLHttpRequest();\n  request.open('POST', url, true);\n  request.setRequestHeader('Content-type', 'application/json; charset=utf-8');\n  request.onload = () => callback(request.responseText);\n  request.onerror = () => err(request);\n  request.send(data);\n};",
           "es5": "var httpPost = function httpPost(url, data, callback) {\n  var err = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : console.error;\n  var request = new XMLHttpRequest();\n  request.open('POST', url, true);\n  request.setRequestHeader('Content-type', 'application/json; charset=utf-8');\n\n  request.onload = function () {\n    return callback(request.responseText);\n  };\n\n  request.onerror = function () {\n    return err(request);\n  };\n\n  request.send(data);\n};",
-          "example": "const newPost = {\r\n  userId: 1,\r\n  id: 1337,\r\n  title: 'Foo',\r\n  body: 'bar bar bar'\r\n};\r\nconst data = JSON.stringify(newPost);\r\nhttpPost(\r\n  'https://jsonplaceholder.typicode.com/posts',\r\n  data,\r\n  console.log\r\n); /*\r\nLogs: {\r\n  \"userId\": 1,\r\n  \"id\": 1337,\r\n  \"title\": \"Foo\",\r\n  \"body\": \"bar bar bar\"\r\n}\r\n*/\r\nhttpPost(\r\n  'https://jsonplaceholder.typicode.com/posts',\r\n  null, // does not send a body\r\n  console.log\r\n); /*\r\nLogs: {\r\n  \"id\": 101\r\n}\r\n*/"
+          "example": "const newPost = {\n  userId: 1,\n  id: 1337,\n  title: 'Foo',\n  body: 'bar bar bar'\n};\nconst data = JSON.stringify(newPost);\nhttpPost(\n  'https://jsonplaceholder.typicode.com/posts',\n  data,\n  console.log\n); /*\nLogs: {\n  \"userId\": 1,\n  \"id\": 1337,\n  \"title\": \"Foo\",\n  \"body\": \"bar bar bar\"\n}\n*/\nhttpPost(\n  'https://jsonplaceholder.typicode.com/posts',\n  null, // does not send a body\n  console.log\n); /*\nLogs: {\n  \"id\": 101\n}\n*/"
         },
         "tags": [
           "utility",
@@ -2653,7 +2653,7 @@
         ]
       },
       "meta": {
-        "hash": "4090b3910892bbaf84193464390cfe55a7719b90842e258549e10d808e761112"
+        "hash": "5b29941074f19769531b3320ec8d61e2b2bdc69735fb781bf7e880ff2080ec04"
       }
     },
     {
@@ -2664,7 +2664,7 @@
         "fileName": "httpsRedirect.md",
         "text": "Redirects the page to HTTPS if its currently in HTTP. Also, pressing the back button doesn't take it back to the HTTP page as its replaced in the history.\n\nUse `location.protocol` to get the protocol currently being used. If it's not HTTPS, use `location.replace()` to replace the existing page with the HTTPS version of the page. Use `location.href` to get the full address, split it with `String.prototype.split()` and remove the protocol part of the URL.\n\n",
         "codeBlocks": {
-          "es6": "const httpsRedirect = () => {\r\n  if (location.protocol !== 'https:') location.replace('https://' + location.href.split('//')[1]);\r\n};",
+          "es6": "const httpsRedirect = () => {\n  if (location.protocol !== 'https:') location.replace('https://' + location.href.split('//')[1]);\n};",
           "es5": "var httpsRedirect = function httpsRedirect() {\n  if (location.protocol !== 'https:') location.replace('https://' + location.href.split('//')[1]);\n};",
           "example": "httpsRedirect(); // If you are on http://mydomain.com, you are redirected to https://mydomain.com"
         },
@@ -2675,7 +2675,7 @@
         ]
       },
       "meta": {
-        "hash": "7ebc8d794576aa17a97af78c6509cf0479c9ffd1aadda84381f4612ef8f2d9ef"
+        "hash": "37468f75e3b2200d43906644eacce72a17a0e22441367bf1b8689e01e3c9ee76"
       }
     },
     {
@@ -2686,9 +2686,9 @@
         "fileName": "hz.md",
         "text": "Returns the number of times a function executed per second. \n`hz` is the unit for `hertz`, the unit of frequency defined as one cycle per second.\n\nUse `performance.now()` to get the difference in milliseconds before and after the iteration loop to calculate the time elapsed executing the function `iterations` times. \nReturn the number of cycles per second by converting milliseconds to seconds and dividing it by the time elapsed. \nOmit the second argument, `iterations`, to use the default of 100 iterations.\n\n",
         "codeBlocks": {
-          "es6": "const hz = (fn, iterations = 100) => {\r\n  const before = performance.now();\r\n  for (let i = 0; i < iterations; i++) fn();\r\n  return (1000 * iterations) / (performance.now() - before);\r\n};",
+          "es6": "const hz = (fn, iterations = 100) => {\n  const before = performance.now();\n  for (let i = 0; i < iterations; i++) fn();\n  return (1000 * iterations) / (performance.now() - before);\n};",
           "es5": "var hz = function hz(fn) {\n  var iterations = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 100;\n  var before = performance.now();\n\n  for (var i = 0; i < iterations; i++) {\n    fn();\n  }\n\n  return 1000 * iterations / (performance.now() - before);\n};",
-          "example": "// 10,000 element array\r\nconst numbers = Array(10000)\r\n  .fill()\r\n  .map((_, i) => i);\r\n\r\n// Test functions with the same goal: sum up the elements in the array\r\nconst sumReduce = () => numbers.reduce((acc, n) => acc + n, 0);\r\nconst sumForLoop = () => {\r\n  let sum = 0;\r\n  for (let i = 0; i < numbers.length; i++) sum += numbers[i];\r\n  return sum;\r\n};\r\n\r\n// `sumForLoop` is nearly 10 times faster\r\nMath.round(hz(sumReduce)); // 572\r\nMath.round(hz(sumForLoop)); // 4784"
+          "example": "// 10,000 element array\nconst numbers = Array(10000)\n  .fill()\n  .map((_, i) => i);\n\n// Test functions with the same goal: sum up the elements in the array\nconst sumReduce = () => numbers.reduce((acc, n) => acc + n, 0);\nconst sumForLoop = () => {\n  let sum = 0;\n  for (let i = 0; i < numbers.length; i++) sum += numbers[i];\n  return sum;\n};\n\n// `sumForLoop` is nearly 10 times faster\nMath.round(hz(sumReduce)); // 572\nMath.round(hz(sumForLoop)); // 4784"
         },
         "tags": [
           "function",
@@ -2696,7 +2696,7 @@
         ]
       },
       "meta": {
-        "hash": "ce79f99a81da9fe307882fa227ad489b7ef14ff74aabc349f6279ff495592adf"
+        "hash": "542bc8c7cc17654b02dc9fdcd6791901f61a6907c89e42192f6e5d2a8eba41be"
       }
     },
     {
@@ -2709,7 +2709,7 @@
         "codeBlocks": {
           "es6": "const indentString = (str, count, indent = ' ') => str.replace(/^/gm, indent.repeat(count));",
           "es5": "var indentString = function indentString(str, count) {\n  var indent = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : ' ';\n  return str.replace(/^/gm, indent.repeat(count));\n};",
-          "example": "indentString('Lorem\\nIpsum', 2); // '  Lorem\\n  Ipsum'\r\nindentString('Lorem\\nIpsum', 2, '_'); // '__Lorem\\n__Ipsum'"
+          "example": "indentString('Lorem\\nIpsum', 2); // '  Lorem\\n  Ipsum'\nindentString('Lorem\\nIpsum', 2, '_'); // '__Lorem\\n__Ipsum'"
         },
         "tags": [
           "string",
@@ -2718,7 +2718,7 @@
         ]
       },
       "meta": {
-        "hash": "d9c235b030ed77f98af4e366ca39a3388a7779554b66b4a014a1bd8133c6e9ec"
+        "hash": "544ebe19f71cab5f4b4ad5a6121d4327ebf2b09f04451151e7339c90c8924789"
       }
     },
     {
@@ -2731,7 +2731,7 @@
         "codeBlocks": {
           "es6": "const indexOfAll = (arr, val) => arr.reduce((acc, el, i) => (el === val ? [...acc, i] : acc), []);",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar indexOfAll = function indexOfAll(arr, val) {\n  return arr.reduce(function (acc, el, i) {\n    return el === val ? [].concat(_toConsumableArray(acc), [i]) : acc;\n  }, []);\n};",
-          "example": "indexOfAll([1, 2, 3, 1, 2, 3], 1); // [0,3]\r\nindexOfAll([1, 2, 3], 4); // []"
+          "example": "indexOfAll([1, 2, 3, 1, 2, 3], 1); // [0,3]\nindexOfAll([1, 2, 3], 4); // []"
         },
         "tags": [
           "array",
@@ -2739,7 +2739,7 @@
         ]
       },
       "meta": {
-        "hash": "becbd61f09613887eea56adee4da640bb200e2cf88d3191de99660441b67b70e"
+        "hash": "40c8167847d364d53d84026917aa41947024d180b0fbc70aa7033c1ef348c344"
       }
     },
     {
@@ -2760,7 +2760,7 @@
         ]
       },
       "meta": {
-        "hash": "6f519d1ba04a94b1fcb391898d3b820ae2fbc3caa41658f66b1a2b8895a60143"
+        "hash": "c2479bc7d9e651dde057378ed2641f37b75d5b4fc8ed295997bea8d37d46bba0"
       }
     },
     {
@@ -2771,7 +2771,7 @@
         "fileName": "initialize2DArray.md",
         "text": "Initializes a 2D array of given width and height and value.\n\nUse `Array.prototype.map()` to generate h rows where each is a new array of size w initialize with value. If the value is not provided, default to `null`.\n\n",
         "codeBlocks": {
-          "es6": "const initialize2DArray = (w, h, val = null) =>\r\n  Array.from({ length: h }).map(() => Array.from({ length: w }).fill(val));",
+          "es6": "const initialize2DArray = (w, h, val = null) =>\n  Array.from({ length: h }).map(() => Array.from({ length: w }).fill(val));",
           "es5": "var initialize2DArray = function initialize2DArray(w, h) {\n  var val = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n  return Array.from({\n    length: h\n  }).map(function () {\n    return Array.from({\n      length: w\n    }).fill(val);\n  });\n};",
           "example": "initialize2DArray(2, 2, 0); // [[0,0], [0,0]]"
         },
@@ -2781,7 +2781,7 @@
         ]
       },
       "meta": {
-        "hash": "9eb75fd66cdb9ea7be47349c5c0b31a53eb3aa2bbdb67354432d313b9da65d7b"
+        "hash": "ada7e68c9a5a701265c1ea38dfc253b8ccb7d9c261dffcf9a42cc560b264cabc"
       }
     },
     {
@@ -2792,9 +2792,9 @@
         "fileName": "initializeArrayWithRange.md",
         "text": "Initializes an array containing the numbers in the specified range where `start` and `end` are inclusive with their common difference `step`.\n\nUse `Array.from()` to create an array of the desired length, `(end - start + 1)/step`, and a map function to fill it with the desired values in the given range.\nYou can omit `start` to use a default value of `0`.\nYou can omit `step` to use a default value of `1`.\n\n",
         "codeBlocks": {
-          "es6": "const initializeArrayWithRange = (end, start = 0, step = 1) =>\r\n  Array.from({ length: Math.ceil((end - start + 1) / step) }, (v, i) => i * step + start);",
+          "es6": "const initializeArrayWithRange = (end, start = 0, step = 1) =>\n  Array.from({ length: Math.ceil((end - start + 1) / step) }, (v, i) => i * step + start);",
           "es5": "var initializeArrayWithRange = function initializeArrayWithRange(end) {\n  var start = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var step = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;\n  return Array.from({\n    length: Math.ceil((end - start + 1) / step)\n  }, function (v, i) {\n    return i * step + start;\n  });\n};",
-          "example": "initializeArrayWithRange(5); // [0,1,2,3,4,5]\r\ninitializeArrayWithRange(7, 3); // [3,4,5,6,7]\r\ninitializeArrayWithRange(9, 0, 2); // [0,2,4,6,8]"
+          "example": "initializeArrayWithRange(5); // [0,1,2,3,4,5]\ninitializeArrayWithRange(7, 3); // [3,4,5,6,7]\ninitializeArrayWithRange(9, 0, 2); // [0,2,4,6,8]"
         },
         "tags": [
           "array",
@@ -2803,7 +2803,7 @@
         ]
       },
       "meta": {
-        "hash": "6b251d9f470fe5b1536f5174091b0e17277a159f9c92389031579a4ce9d1892f"
+        "hash": "f4e970fb09664acfd567ee0ebc9867672095c529778b8b9169ed5b13d431c563"
       }
     },
     {
@@ -2814,9 +2814,9 @@
         "fileName": "initializeArrayWithRangeRight.md",
         "text": "Initializes an array containing the numbers in the specified range (in reverse) where `start` and `end` are inclusive with their common difference `step`.\n\nUse `Array.from(Math.ceil((end+1-start)/step))` to create an array of the desired length(the amounts of elements is equal to `(end-start)/step` or `(end+1-start)/step` for inclusive end), `Array.prototype.map()` to fill with the desired values in a range.\nYou can omit `start` to use a default value of `0`.\nYou can omit `step` to use a default value of `1`.\n\n",
         "codeBlocks": {
-          "es6": "const initializeArrayWithRangeRight = (end, start = 0, step = 1) =>\r\n  Array.from({ length: Math.ceil((end + 1 - start) / step) }).map(\r\n    (v, i, arr) => (arr.length - i - 1) * step + start\r\n  );",
+          "es6": "const initializeArrayWithRangeRight = (end, start = 0, step = 1) =>\n  Array.from({ length: Math.ceil((end + 1 - start) / step) }).map(\n    (v, i, arr) => (arr.length - i - 1) * step + start\n  );",
           "es5": "var initializeArrayWithRangeRight = function initializeArrayWithRangeRight(end) {\n  var start = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var step = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;\n  return Array.from({\n    length: Math.ceil((end + 1 - start) / step)\n  }).map(function (v, i, arr) {\n    return (arr.length - i - 1) * step + start;\n  });\n};",
-          "example": "initializeArrayWithRangeRight(5); // [5,4,3,2,1,0]\r\ninitializeArrayWithRangeRight(7, 3); // [7,6,5,4,3]\r\ninitializeArrayWithRangeRight(9, 0, 2); // [8,6,4,2,0]"
+          "example": "initializeArrayWithRangeRight(5); // [5,4,3,2,1,0]\ninitializeArrayWithRangeRight(7, 3); // [7,6,5,4,3]\ninitializeArrayWithRangeRight(9, 0, 2); // [8,6,4,2,0]"
         },
         "tags": [
           "array",
@@ -2825,7 +2825,7 @@
         ]
       },
       "meta": {
-        "hash": "0b70ff3151f64e4a11f201a03d28fb5f3769344912b26b156e22b79b780dac48"
+        "hash": "59cc7791996547b646472153ebb1fb0bee4d177199e6a7311791eab98c58e3be"
       }
     },
     {
@@ -2847,7 +2847,7 @@
         ]
       },
       "meta": {
-        "hash": "8e77ca220ace40c6e4499334bef214c3471f039355b29d22336c5d49b91d7f90"
+        "hash": "0e8321b0286c38321fdb3e27353567cdb03c6767152210e8e14e4925057adfe1"
       }
     },
     {
@@ -2858,9 +2858,9 @@
         "fileName": "initializeNDArray.md",
         "text": "Create a n-dimensional array with given value.\n\nUse recursion.\nUse `Array.prototype.map()` to generate rows where each is a new array initialized using `initializeNDArray`.\n\n",
         "codeBlocks": {
-          "es6": "const initializeNDArray = (val, ...args) =>\r\n  args.length === 0\r\n    ? val\r\n    : Array.from({ length: args[0] }).map(() => initializeNDArray(val, ...args.slice(1)));",
+          "es6": "const initializeNDArray = (val, ...args) =>\n  args.length === 0\n    ? val\n    : Array.from({ length: args[0] }).map(() => initializeNDArray(val, ...args.slice(1)));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar initializeNDArray = function initializeNDArray(val) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n\n  return args.length === 0 ? val : Array.from({\n    length: args[0]\n  }).map(function () {\n    return initializeNDArray.apply(void 0, [val].concat(_toConsumableArray(args.slice(1))));\n  });\n};",
-          "example": "initializeNDArray(1, 3); // [1,1,1]\r\ninitializeNDArray(5, 2, 2, 2); // [[[5,5],[5,5]],[[5,5],[5,5]]]"
+          "example": "initializeNDArray(1, 3); // [1,1,1]\ninitializeNDArray(5, 2, 2, 2); // [[[5,5],[5,5]],[[5,5],[5,5]]]"
         },
         "tags": [
           "array",
@@ -2869,7 +2869,7 @@
         ]
       },
       "meta": {
-        "hash": "d8b34bd8592d22bb0792b2a62ebff9b33a829fef6cc249769bdd2bbc374eb5a7"
+        "hash": "21b455190adbd8b80d2559a88d9ec244ac32544235b7cfed8caca65c11c8ab80"
       }
     },
     {
@@ -2880,9 +2880,9 @@
         "fileName": "inRange.md",
         "text": "Checks if the given number falls within the given range.\n\nUse arithmetic comparison to check if the given number is in the specified range.\nIf the second parameter, `end`, is not specified, the range is considered to be from `0` to `start`.\n\n",
         "codeBlocks": {
-          "es6": "const inRange = (n, start, end = null) => {\r\n  if (end && start > end) [end, start] = [start, end];\r\n  return end == null ? n >= 0 && n < start : n >= start && n < end;\r\n};",
+          "es6": "const inRange = (n, start, end = null) => {\n  if (end && start > end) [end, start] = [start, end];\n  return end == null ? n >= 0 && n < start : n >= start && n < end;\n};",
           "es5": "var inRange = function inRange(n, start) {\n  var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n\n  if (end && start > end) {\n    var _ref = [start, end];\n    end = _ref[0];\n    start = _ref[1];\n  }\n\n  return end == null ? n >= 0 && n < start : n >= start && n < end;\n};",
-          "example": "inRange(3, 2, 5); // true\r\ninRange(3, 4); // true\r\ninRange(2, 3, 5); // false\r\ninRange(3, 2); // false"
+          "example": "inRange(3, 2, 5); // true\ninRange(3, 4); // true\ninRange(2, 3, 5); // false\ninRange(3, 2); // false"
         },
         "tags": [
           "math",
@@ -2890,7 +2890,7 @@
         ]
       },
       "meta": {
-        "hash": "c3ca3f1b04a1b7a199d90eea2e7a17c6989a2ce1c43ba68080fd24ec38307b5a"
+        "hash": "911d4a90c6ded62d063887e772d4017d4612e4fce48e79836ad19fc41e2c1abe"
       }
     },
     {
@@ -2911,7 +2911,7 @@
         ]
       },
       "meta": {
-        "hash": "82772b0d4bc878efc418b9fd9f7c5c99b8da05c4c4a140e3879f34ed9f6a71c1"
+        "hash": "9a2e1d5c50b955f8be4e0ee6b63894525be4904905a62c483789dd4e3d4bb11e"
       }
     },
     {
@@ -2932,7 +2932,7 @@
         ]
       },
       "meta": {
-        "hash": "e11b954b6481ac92e0b23fcd5056635f848255449e2424617598ec370e27f5ba"
+        "hash": "72db2aadee9327a4e794727fd39a254cc9cfcaa4f0819b2d03ad3c39c950264b"
       }
     },
     {
@@ -2943,7 +2943,7 @@
         "fileName": "intersection.md",
         "text": "Returns a list of elements that exist in both arrays.\n\nCreate a `Set` from `b`, then use `Array.prototype.filter()` on `a` to only keep values contained in `b`.\n\n",
         "codeBlocks": {
-          "es6": "const intersection = (a, b) => {\r\n  const s = new Set(b);\r\n  return a.filter(x => s.has(x));\r\n};",
+          "es6": "const intersection = (a, b) => {\n  const s = new Set(b);\n  return a.filter(x => s.has(x));\n};",
           "es5": "var intersection = function intersection(a, b) {\n  var s = new Set(b);\n  return a.filter(function (x) {\n    return s.has(x);\n  });\n};",
           "example": "intersection([1, 2, 3], [4, 3, 2]); // [2, 3]"
         },
@@ -2954,7 +2954,7 @@
         ]
       },
       "meta": {
-        "hash": "6fb46bb2067d6a0e353c6dc0431e64fa7dcc46b0db046a2fa9695d6e2bee4211"
+        "hash": "8d42afae6c90ddcd75a078a39db780eedd9a484103fc2174f7b392613a31085f"
       }
     },
     {
@@ -2965,7 +2965,7 @@
         "fileName": "intersectionBy.md",
         "text": "Returns a list of elements that exist in both arrays, after applying the provided function to each array element of both.\n\nCreate a `Set` by applying `fn` to all elements in `b`, then use `Array.prototype.filter()` on `a` to only keep elements, which produce values contained in `b` when `fn` is applied to them.\n\n",
         "codeBlocks": {
-          "es6": "const intersectionBy = (a, b, fn) => {\r\n  const s = new Set(b.map(fn));\r\n  return a.filter(x => s.has(fn(x)));\r\n};",
+          "es6": "const intersectionBy = (a, b, fn) => {\n  const s = new Set(b.map(fn));\n  return a.filter(x => s.has(fn(x)));\n};",
           "es5": "var intersectionBy = function intersectionBy(a, b, fn) {\n  var s = new Set(b.map(fn));\n  return a.filter(function (x) {\n    return s.has(fn(x));\n  });\n};",
           "example": "intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [2.1]"
         },
@@ -2976,7 +2976,7 @@
         ]
       },
       "meta": {
-        "hash": "aa3877e7f5e7392232aed11b0de72dcbefe536c6e684cb046ae4821afc4c668d"
+        "hash": "ad560d72d29aa86e305bdbd54a7a5b5cde8c57a38386342fd8d6905575de1f7a"
       }
     },
     {
@@ -2998,7 +2998,7 @@
         ]
       },
       "meta": {
-        "hash": "06652ca62bda11d1066252bb1386a2679a5c654b9c764be3f0c14edf1eeb13c0"
+        "hash": "3dd3ad662f52d4189d00c5abea2e3d8f408acc789065d2071d16ff2a442c7c55"
       }
     },
     {
@@ -3009,9 +3009,9 @@
         "fileName": "invertKeyValues.md",
         "text": "Inverts the key-value pairs of an object, without mutating it. The corresponding inverted value of each inverted key is an array of keys responsible for generating the inverted value. If a function is supplied, it is applied to each inverted key.\n\nUse `Object.keys()` and `Array.prototype.reduce()` to invert the key-value pairs of an object and apply the function provided (if any).\nOmit the second argument, `fn`, to get the inverted keys without applying a function to them.\n\n",
         "codeBlocks": {
-          "es6": "const invertKeyValues = (obj, fn) =>\r\n  Object.keys(obj).reduce((acc, key) => {\r\n    const val = fn ? fn(obj[key]) : obj[key];\r\n    acc[val] = acc[val] || [];\r\n    acc[val].push(key);\r\n    return acc;\r\n  }, {});",
+          "es6": "const invertKeyValues = (obj, fn) =>\n  Object.keys(obj).reduce((acc, key) => {\n    const val = fn ? fn(obj[key]) : obj[key];\n    acc[val] = acc[val] || [];\n    acc[val].push(key);\n    return acc;\n  }, {});",
           "es5": "var invertKeyValues = function invertKeyValues(obj, fn) {\n  return Object.keys(obj).reduce(function (acc, key) {\n    var val = fn ? fn(obj[key]) : obj[key];\n    acc[val] = acc[val] || [];\n    acc[val].push(key);\n    return acc;\n  }, {});\n};",
-          "example": "invertKeyValues({ a: 1, b: 2, c: 1 }); // { 1: [ 'a', 'c' ], 2: [ 'b' ] }\r\ninvertKeyValues({ a: 1, b: 2, c: 1 }, value => 'group' + value); // { group1: [ 'a', 'c' ], group2: [ 'b' ] }"
+          "example": "invertKeyValues({ a: 1, b: 2, c: 1 }); // { 1: [ 'a', 'c' ], 2: [ 'b' ] }\ninvertKeyValues({ a: 1, b: 2, c: 1 }, value => 'group' + value); // { group1: [ 'a', 'c' ], group2: [ 'b' ] }"
         },
         "tags": [
           "object",
@@ -3020,7 +3020,7 @@
         ]
       },
       "meta": {
-        "hash": "870c2b24138e45ea3e18e6ae0287828179863963af8aa2f8d51d5ccf477933a1"
+        "hash": "193618c3f15f2aa14ce53dd88ee928aa8f6be6891c5253d7921eb87547ee7dbd"
       }
     },
     {
@@ -3033,7 +3033,7 @@
         "codeBlocks": {
           "es6": "const is = (type, val) => ![, null].includes(val) && val.constructor === type;",
           "es5": "var is = function is(type, val) {\n  return ![, null].includes(val) && val.constructor === type;\n};",
-          "example": "is(Array, [1]); // true\r\nis(ArrayBuffer, new ArrayBuffer()); // true\r\nis(Map, new Map()); // true\r\nis(RegExp, /./g); // true\r\nis(Set, new Set()); // true\r\nis(WeakMap, new WeakMap()); // true\r\nis(WeakSet, new WeakSet()); // true\r\nis(String, ''); // true\r\nis(String, new String('')); // true\r\nis(Number, 1); // true\r\nis(Number, new Number(1)); // true\r\nis(Boolean, true); // true\r\nis(Boolean, new Boolean(true)); // true"
+          "example": "is(Array, [1]); // true\nis(ArrayBuffer, new ArrayBuffer()); // true\nis(Map, new Map()); // true\nis(RegExp, /./g); // true\nis(Set, new Set()); // true\nis(WeakMap, new WeakMap()); // true\nis(WeakSet, new WeakSet()); // true\nis(String, ''); // true\nis(String, new String('')); // true\nis(Number, 1); // true\nis(Number, new Number(1)); // true\nis(Boolean, true); // true\nis(Boolean, new Boolean(true)); // true"
         },
         "tags": [
           "type",
@@ -3043,7 +3043,7 @@
         ]
       },
       "meta": {
-        "hash": "0a9cebcc63f2c9ea95c911503f7db70defaf2e17c9850ee48a91856a7680f4ac"
+        "hash": "c9bbbe9ff32915b2c44849dfe8e1ab3554383cb0b7df9551424ca2597e355f41"
       }
     },
     {
@@ -3056,7 +3056,7 @@
         "codeBlocks": {
           "es6": "const isAbsoluteURL = str => /^[a-z][a-z0-9+.-]*:/.test(str);",
           "es5": "var isAbsoluteURL = function isAbsoluteURL(str) {\n  return /^[a-z][a-z0-9+.-]*:/.test(str);\n};",
-          "example": "isAbsoluteURL('https://google.com'); // true\r\nisAbsoluteURL('ftp://www.myserver.net'); // true\r\nisAbsoluteURL('/foo/bar'); // false"
+          "example": "isAbsoluteURL('https://google.com'); // true\nisAbsoluteURL('ftp://www.myserver.net'); // true\nisAbsoluteURL('/foo/bar'); // false"
         },
         "tags": [
           "string",
@@ -3067,7 +3067,7 @@
         ]
       },
       "meta": {
-        "hash": "2c953de8cfb678cb6affc57a75e5633137bc4d4003a195a79641068c506ced82"
+        "hash": "7523c5d3ab85075efa61efc135bb1c8d85e2a2e5407ddc5768099993d46f13b5"
       }
     },
     {
@@ -3089,7 +3089,7 @@
         ]
       },
       "meta": {
-        "hash": "fa914519e97ba13886c958b664696740832b64f02184335909f257d324e774a0"
+        "hash": "19efe22718bca00459c41fa9df56c3574270c500bdd670873358052ccc870f5b"
       }
     },
     {
@@ -3100,7 +3100,7 @@
         "fileName": "isAnagram.md",
         "text": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n\n",
         "codeBlocks": {
-          "es6": "const isAnagram = (str1, str2) => {\r\n  const normalize = str =>\r\n    str\r\n      .toLowerCase()\r\n      .replace(/[^a-z0-9]/gi, '')\r\n      .split('')\r\n      .sort()\r\n      .join('');\r\n  return normalize(str1) === normalize(str2);\r\n};",
+          "es6": "const isAnagram = (str1, str2) => {\n  const normalize = str =>\n    str\n      .toLowerCase()\n      .replace(/[^a-z0-9]/gi, '')\n      .split('')\n      .sort()\n      .join('');\n  return normalize(str1) === normalize(str2);\n};",
           "es5": "var isAnagram = function isAnagram(str1, str2) {\n  var normalize = function normalize(str) {\n    return str.toLowerCase().replace(/[^a-z0-9]/gi, '').split('').sort().join('');\n  };\n\n  return normalize(str1) === normalize(str2);\n};",
           "example": "isAnagram('iceman', 'cinema'); // true"
         },
@@ -3111,7 +3111,7 @@
         ]
       },
       "meta": {
-        "hash": "c8298979582577c6cb04d4a0e696c5a411c6d02d124bd0c5259a5e5a19987ce8"
+        "hash": "d5d6a4a5652dfb641a7cade70e041e2e91aec06e9184d06f6bb82499bfee0498"
       }
     },
     {
@@ -3124,7 +3124,7 @@
         "codeBlocks": {
           "es6": "const isArrayLike = obj => obj != null && typeof obj[Symbol.iterator] === 'function';",
           "es5": "var isArrayLike = function isArrayLike(obj) {\n  return obj != null && typeof obj[Symbol.iterator] === 'function';\n};",
-          "example": "isArrayLike(document.querySelectorAll('.className')); // true\r\nisArrayLike('abc'); // true\r\nisArrayLike(null); // false"
+          "example": "isArrayLike(document.querySelectorAll('.className')); // true\nisArrayLike('abc'); // true\nisArrayLike(null); // false"
         },
         "tags": [
           "type",
@@ -3133,7 +3133,7 @@
         ]
       },
       "meta": {
-        "hash": "1cd03b507e61ad7af7c3bdaa7357d1f3a330f2dbe1f47ef3e81210d8090eac49"
+        "hash": "0694b883486ca56109cb2c2ad8ed3477c0c4ee84d2fa81884409c40302a13fa7"
       }
     },
     {
@@ -3155,7 +3155,7 @@
         ]
       },
       "meta": {
-        "hash": "6b8403f3c0c9612f665ef2aa7ca93ef10b390673b12dfbe7cd63c077866693dd"
+        "hash": "e0d70480b239a585f907c965214a037ce23ae15f5484ab80930ea9f57cbe529e"
       }
     },
     {
@@ -3168,7 +3168,7 @@
         "codeBlocks": {
           "es6": "const isBoolean = val => typeof val === 'boolean';",
           "es5": "var isBoolean = function isBoolean(val) {\n  return typeof val === 'boolean';\n};",
-          "example": "isBoolean(null); // false\r\nisBoolean(false); // true"
+          "example": "isBoolean(null); // false\nisBoolean(false); // true"
         },
         "tags": [
           "type",
@@ -3176,7 +3176,7 @@
         ]
       },
       "meta": {
-        "hash": "fff9594012d5a6b16d82f50a303fede8d9157a5dfd7964500daf82462db18529"
+        "hash": "2c2e66152db8a6445af911c49a181d4cd5ca92db5bd23f24124d2df06bebbc15"
       }
     },
     {
@@ -3189,7 +3189,7 @@
         "codeBlocks": {
           "es6": "const isBrowser = () => ![typeof window, typeof document].includes('undefined');",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isBrowser = function isBrowser() {\n  return ![typeof window === \"undefined\" ? \"undefined\" : _typeof(window), typeof document === \"undefined\" ? \"undefined\" : _typeof(document)].includes('undefined');\n};",
-          "example": "isBrowser(); // true (browser)\r\nisBrowser(); // false (Node)"
+          "example": "isBrowser(); // true (browser)\nisBrowser(); // false (Node)"
         },
         "tags": [
           "utility",
@@ -3198,7 +3198,7 @@
         ]
       },
       "meta": {
-        "hash": "9d029af76de1d6abe676263147e17d3bd145b4b7f054e104ece4820e0ccd815c"
+        "hash": "6fb24837c043a0cc320a46695ef0e286a558aaf06e9354407569ae61c4a8d0bd"
       }
     },
     {
@@ -3219,7 +3219,7 @@
         ]
       },
       "meta": {
-        "hash": "42ae88827dacdc248ee9cd1443024dbf6e5a6aeaef5b8a14b56a918ed41fc33b"
+        "hash": "3aab66b09df0070568e0ff69717ac0d5c62d88727262419d07b0f50e1a6677e4"
       }
     },
     {
@@ -3240,7 +3240,7 @@
         ]
       },
       "meta": {
-        "hash": "322163bff5324802fe9336d37d0f3e5a5eadcbc944dd1f331ac7bc61121e2bf8"
+        "hash": "e89795b1f8240e97e4ed1825f2cb38deaa356b8c08ecdd3eaaeb6fe243363f7f"
       }
     },
     {
@@ -3251,9 +3251,9 @@
         "fileName": "isDuplexStream.md",
         "text": "Checks if the given argument is a duplex (readable and writable) stream.\n\nCheck if the value is different from `null`, use `typeof` to check if a value is of type `object` and the `pipe` property is of type `function`.\nAdditionally check if the `typeof` the `_read`, `_write` and `_readableState`, `_writableState` properties are `function` and `object` respectively.\n\n",
         "codeBlocks": {
-          "es6": "const isDuplexStream = val =>\r\n  val !== null &&\r\n  typeof val === 'object' &&\r\n  typeof val.pipe === 'function' &&\r\n  typeof val._read === 'function' &&\r\n  typeof val._readableState === 'object' &&\r\n  typeof val._write === 'function' &&\r\n  typeof val._writableState === 'object';",
+          "es6": "const isDuplexStream = val =>\n  val !== null &&\n  typeof val === 'object' &&\n  typeof val.pipe === 'function' &&\n  typeof val._read === 'function' &&\n  typeof val._readableState === 'object' &&\n  typeof val._write === 'function' &&\n  typeof val._writableState === 'object';",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isDuplexStream = function isDuplexStream(val) {\n  return val !== null && _typeof(val) === 'object' && typeof val.pipe === 'function' && typeof val._read === 'function' && _typeof(val._readableState) === 'object' && typeof val._write === 'function' && _typeof(val._writableState) === 'object';\n};",
-          "example": "const Stream = require('stream');\r\nisDuplexStream(new Stream.Duplex()); // true"
+          "example": "const Stream = require('stream');\nisDuplexStream(new Stream.Duplex()); // true"
         },
         "tags": [
           "node",
@@ -3262,7 +3262,7 @@
         ]
       },
       "meta": {
-        "hash": "017ab57b489e09c25de290666a4cc3bf1778b6cc91b6ec1aa1d0bb947f9fe881"
+        "hash": "f2ca078f493b19d44dddd6556e933b056bc9fff56e493a5481c3d943b24f1e01"
       }
     },
     {
@@ -3275,7 +3275,7 @@
         "codeBlocks": {
           "es6": "const isEmpty = val => val == null || !(Object.keys(val) || val).length;",
           "es5": "var isEmpty = function isEmpty(val) {\n  return val == null || !(Object.keys(val) || val).length;\n};",
-          "example": "isEmpty([]); // true\r\nisEmpty({}); // true\r\nisEmpty(''); // true\r\nisEmpty([1, 2]); // false\r\nisEmpty({ a: 1, b: 2 }); // false\r\nisEmpty('text'); // false\r\nisEmpty(123); // true - type is not considered a collection\r\nisEmpty(true); // true - type is not considered a collection"
+          "example": "isEmpty([]); // true\nisEmpty({}); // true\nisEmpty(''); // true\nisEmpty([1, 2]); // false\nisEmpty({ a: 1, b: 2 }); // false\nisEmpty('text'); // false\nisEmpty(123); // true - type is not considered a collection\nisEmpty(true); // true - type is not considered a collection"
         },
         "tags": [
           "type",
@@ -3286,7 +3286,7 @@
         ]
       },
       "meta": {
-        "hash": "84fef40153bb4de500dec68586506aebf1f061311aa3f434b7e459a5833c03a3"
+        "hash": "ff080fab7095a63d01048bca4ed77d033af852303d26668c1ee7f564db8407d1"
       }
     },
     {
@@ -3307,7 +3307,7 @@
         ]
       },
       "meta": {
-        "hash": "e0b7ba393afd4e4e9f701a065b6b39ba1d2980c4a961baf1d23e887754c2705f"
+        "hash": "fa16462c8309a49d282421fd80c995fd3f8a9debaba5e492dd4a3625eecce101"
       }
     },
     {
@@ -3320,7 +3320,7 @@
         "codeBlocks": {
           "es6": "const isFunction = val => typeof val === 'function';",
           "es5": "var isFunction = function isFunction(val) {\n  return typeof val === 'function';\n};",
-          "example": "isFunction('x'); // false\r\nisFunction(x => x); // true"
+          "example": "isFunction('x'); // false\nisFunction(x => x); // true"
         },
         "tags": [
           "type",
@@ -3329,7 +3329,7 @@
         ]
       },
       "meta": {
-        "hash": "9c35f423e20db827fdd3992c9bf5a2ea44a2f96fcf882c632527f75141402f27"
+        "hash": "c9004512c957ceeda55d851452ad2b2d59235648272222fd36ca75d98965f0b6"
       }
     },
     {
@@ -3342,7 +3342,7 @@
         "codeBlocks": {
           "es6": "const isLowerCase = str => str === str.toLowerCase();",
           "es5": "var isLowerCase = function isLowerCase(str) {\n  return str === str.toLowerCase();\n};",
-          "example": "isLowerCase('abc'); // true\r\nisLowerCase('a3@$'); // true\r\nisLowerCase('Ab4'); // false"
+          "example": "isLowerCase('abc'); // true\nisLowerCase('a3@$'); // true\nisLowerCase('Ab4'); // false"
         },
         "tags": [
           "string",
@@ -3351,7 +3351,7 @@
         ]
       },
       "meta": {
-        "hash": "13d2c88a463ecafb88daa204c6553a407d603f13429f7a4118a735fe06dd76ef"
+        "hash": "e47bc176d868f3aab83f762997bf9d355258607594648573d2482faf7fc08826"
       }
     },
     {
@@ -3364,7 +3364,7 @@
         "codeBlocks": {
           "es6": "const isNegativeZero = val => val === 0 && 1 / val === -Infinity;",
           "es5": "var isNegativeZero = function isNegativeZero(val) {\n  return val === 0 && 1 / val === -Infinity;\n};",
-          "example": "isNegativeZero(-0); // true\r\nisNegativeZero(0); // false"
+          "example": "isNegativeZero(-0); // true\nisNegativeZero(0); // false"
         },
         "tags": [
           "math",
@@ -3373,7 +3373,7 @@
         ]
       },
       "meta": {
-        "hash": "757f595af7b08257bf162cadc121fb8507c7ce86317abcaad8e6ea785443b0ad"
+        "hash": "ec55fd2848f1443613e33d59634ecaefc9dc82b721424b5416830a7389e1ce6e"
       }
     },
     {
@@ -3386,7 +3386,7 @@
         "codeBlocks": {
           "es6": "const isNil = val => val === undefined || val === null;",
           "es5": "var isNil = function isNil(val) {\n  return val === undefined || val === null;\n};",
-          "example": "isNil(null); // true\r\nisNil(undefined); // true"
+          "example": "isNil(null); // true\nisNil(undefined); // true"
         },
         "tags": [
           "type",
@@ -3394,7 +3394,7 @@
         ]
       },
       "meta": {
-        "hash": "453dd444f658923f0859fabe9bd297e36460d52374929af99f770c595c40ca92"
+        "hash": "fd508fc1174e19116709b5979af67b3bcc48100b19e5a87e15b9545ba0a56d88"
       }
     },
     {
@@ -3415,7 +3415,7 @@
         ]
       },
       "meta": {
-        "hash": "09f9703d5ca502accfdbc7e44fdbe4ab43a53f49bf4beae6ddb8a853355a9c98"
+        "hash": "ecce7adac512977eb9a1f6ea9644c1e1318ca8611512009fbd55ea38519aa1c3"
       }
     },
     {
@@ -3428,7 +3428,7 @@
         "codeBlocks": {
           "es6": "const isNumber = val => typeof val === 'number' && val === val;",
           "es5": "var isNumber = function isNumber(val) {\n  return typeof val === 'number' && val === val;\n};",
-          "example": "isNumber(1); // true\r\nisNumber('1'); // false\r\nisNumber(NaN); // false"
+          "example": "isNumber(1); // true\nisNumber('1'); // false\nisNumber(NaN); // false"
         },
         "tags": [
           "type",
@@ -3437,7 +3437,7 @@
         ]
       },
       "meta": {
-        "hash": "edfe8a7845b27d27bb6c9f1044225147fd3b4496f782fe9b5747ccb80ea05fcb"
+        "hash": "5c6e6defd17719973b507d6c55cf00f958ea92ea3c55b6d9dff6d0441f53dc9a"
       }
     },
     {
@@ -3450,7 +3450,7 @@
         "codeBlocks": {
           "es6": "const isObject = obj => obj === Object(obj);",
           "es5": "var isObject = function isObject(obj) {\n  return obj === Object(obj);\n};",
-          "example": "isObject([1, 2, 3, 4]); // true\r\nisObject([]); // true\r\nisObject(['Hello!']); // true\r\nisObject({ a: 1 }); // true\r\nisObject({}); // true\r\nisObject(true); // false"
+          "example": "isObject([1, 2, 3, 4]); // true\nisObject([]); // true\nisObject(['Hello!']); // true\nisObject({ a: 1 }); // true\nisObject({}); // true\nisObject(true); // false"
         },
         "tags": [
           "type",
@@ -3459,7 +3459,7 @@
         ]
       },
       "meta": {
-        "hash": "1c37d2c72a52694dee04dac99a7f54626b53a7f35921804b93ed08f433c773de"
+        "hash": "06b78776522f9e213357c031e21568295d7a528871fe05781ae2ac4f7e5d8451"
       }
     },
     {
@@ -3472,7 +3472,7 @@
         "codeBlocks": {
           "es6": "const isObjectLike = val => val !== null && typeof val === 'object';",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isObjectLike = function isObjectLike(val) {\n  return val !== null && _typeof(val) === 'object';\n};",
-          "example": "isObjectLike({}); // true\r\nisObjectLike([1, 2, 3]); // true\r\nisObjectLike(x => x); // false\r\nisObjectLike(null); // false"
+          "example": "isObjectLike({}); // true\nisObjectLike([1, 2, 3]); // true\nisObjectLike(x => x); // false\nisObjectLike(null); // false"
         },
         "tags": [
           "type",
@@ -3481,7 +3481,7 @@
         ]
       },
       "meta": {
-        "hash": "4148719d9c7db0b906695a763582e37117fb10da2128ad85f61a2d1c7c58f98e"
+        "hash": "c3424342e1ccfaff2b8f0b0727595fc2cd8063a185ecc42708fa41a2a7c25fc4"
       }
     },
     {
@@ -3494,7 +3494,7 @@
         "codeBlocks": {
           "es6": "const isPlainObject = val => !!val && typeof val === 'object' && val.constructor === Object;",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isPlainObject = function isPlainObject(val) {\n  return !!val && _typeof(val) === 'object' && val.constructor === Object;\n};",
-          "example": "isPlainObject({ a: 1 }); // true\r\nisPlainObject(new Map()); // false"
+          "example": "isPlainObject({ a: 1 }); // true\nisPlainObject(new Map()); // false"
         },
         "tags": [
           "type",
@@ -3503,7 +3503,7 @@
         ]
       },
       "meta": {
-        "hash": "39cad3beb4b785ece34ffdf1b421c0d2656ea2e3938560029c91201f0d2d849d"
+        "hash": "8a9ef17eda1a977bdd1149a4a782d7d0e7addd8c6db8d4bd3734c9269863b12c"
       }
     },
     {
@@ -3514,7 +3514,7 @@
         "fileName": "isPrime.md",
         "text": "Checks if the provided integer is a prime number.\n\nCheck numbers from `2` to the square root of the given number.\nReturn `false` if any of them divides the given number, else return `true`, unless the number is less than `2`.\n\n",
         "codeBlocks": {
-          "es6": "const isPrime = num => {\r\n  const boundary = Math.floor(Math.sqrt(num));\r\n  for (var i = 2; i <= boundary; i++) if (num % i === 0) return false;\r\n  return num >= 2;\r\n};",
+          "es6": "const isPrime = num => {\n  const boundary = Math.floor(Math.sqrt(num));\n  for (var i = 2; i <= boundary; i++) if (num % i === 0) return false;\n  return num >= 2;\n};",
           "es5": "var isPrime = function isPrime(num) {\n  var boundary = Math.floor(Math.sqrt(num));\n\n  for (var i = 2; i <= boundary; i++) {\n    if (num % i === 0) return false;\n  }\n\n  return num >= 2;\n};",
           "example": "isPrime(11); // true"
         },
@@ -3525,7 +3525,7 @@
         ]
       },
       "meta": {
-        "hash": "527563bf31b2d48471725d2e5e1ce0fe373fb4e43400ba4ab5292de359d48f64"
+        "hash": "aafa416b434137db2540668a13e8a33138cb04d652f29e8793a6c76b6a62983d"
       }
     },
     {
@@ -3538,7 +3538,7 @@
         "codeBlocks": {
           "es6": "const isPrimitive = val => Object(val) !== val;",
           "es5": "var isPrimitive = function isPrimitive(val) {\n  return Object(val) !== val;\n};",
-          "example": "isPrimitive(null); // true\r\nisPrimitive(50); // true\r\nisPrimitive('Hello!'); // true\r\nisPrimitive(false); // true\r\nisPrimitive(Symbol()); // true\r\nisPrimitive([]); // false"
+          "example": "isPrimitive(null); // true\nisPrimitive(50); // true\nisPrimitive('Hello!'); // true\nisPrimitive(false); // true\nisPrimitive(Symbol()); // true\nisPrimitive([]); // false"
         },
         "tags": [
           "type",
@@ -3549,7 +3549,7 @@
         ]
       },
       "meta": {
-        "hash": "4866836ea1c832caeda50a546451012d72b6f9910922bd47bd5fdddc472111df"
+        "hash": "2df9322464af125f8a33dad1f15a7df5ccd7d8f9322efe871dc026974971ac85"
       }
     },
     {
@@ -3560,9 +3560,9 @@
         "fileName": "isPromiseLike.md",
         "text": "Returns `true` if an object looks like a [`Promise`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise), `false` otherwise.\n\nCheck if the object is not `null`, its `typeof` matches either `object` or `function` and if it has a `.then` property, which is also a `function`.\n\n",
         "codeBlocks": {
-          "es6": "const isPromiseLike = obj =>\r\n  obj !== null &&\r\n  (typeof obj === 'object' || typeof obj === 'function') &&\r\n  typeof obj.then === 'function';",
+          "es6": "const isPromiseLike = obj =>\n  obj !== null &&\n  (typeof obj === 'object' || typeof obj === 'function') &&\n  typeof obj.then === 'function';",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isPromiseLike = function isPromiseLike(obj) {\n  return obj !== null && (_typeof(obj) === 'object' || typeof obj === 'function') && typeof obj.then === 'function';\n};",
-          "example": "isPromiseLike({\r\n  then: function() {\r\n    return '';\r\n  }\r\n}); // true\r\nisPromiseLike(null); // false\r\nisPromiseLike({}); // false"
+          "example": "isPromiseLike({\n  then: function() {\n    return '';\n  }\n}); // true\nisPromiseLike(null); // false\nisPromiseLike({}); // false"
         },
         "tags": [
           "type",
@@ -3572,7 +3572,7 @@
         ]
       },
       "meta": {
-        "hash": "9888c4b9583102dbe9b994a88f3ae66f91cd25d254179b5cdc2156e5540400dd"
+        "hash": "3edbaa911db73b703d8af9a0681a18f4c61d65db15cbd5812b78ecd3ac364cef"
       }
     },
     {
@@ -3583,9 +3583,9 @@
         "fileName": "isReadableStream.md",
         "text": "Checks if the given argument is a readable stream.\n\nCheck if the value is different from `null`, use `typeof` to check if the value is of type `object` and the `pipe` property is of type `function`.\nAdditionally check if the `typeof` the `_read` and `_readableState` properties are `function` and `object` respectively.\n\n",
         "codeBlocks": {
-          "es6": "const isReadableStream = val =>\r\n  val !== null &&\r\n  typeof val === 'object' &&\r\n  typeof val.pipe === 'function' &&\r\n  typeof val._read === 'function' &&\r\n  typeof val._readableState === 'object';",
+          "es6": "const isReadableStream = val =>\n  val !== null &&\n  typeof val === 'object' &&\n  typeof val.pipe === 'function' &&\n  typeof val._read === 'function' &&\n  typeof val._readableState === 'object';",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isReadableStream = function isReadableStream(val) {\n  return val !== null && _typeof(val) === 'object' && typeof val.pipe === 'function' && typeof val._read === 'function' && _typeof(val._readableState) === 'object';\n};",
-          "example": "const fs = require('fs');\r\nisReadableStream(fs.createReadStream('test.txt')); // true"
+          "example": "const fs = require('fs');\nisReadableStream(fs.createReadStream('test.txt')); // true"
         },
         "tags": [
           "node",
@@ -3594,7 +3594,7 @@
         ]
       },
       "meta": {
-        "hash": "4111aa90eaf50458f3027fcf2a1d6087d514d73883cba21e404fe3abee4330a9"
+        "hash": "a8199a2ae7965f48651bc7996e810423b2de44467204d481df54f7c8fa2dd44e"
       }
     },
     {
@@ -3616,7 +3616,7 @@
         ]
       },
       "meta": {
-        "hash": "903bd2bd6ec7427a009132313eb83f297793eb5d091d3f3e7f6ba7d9ac1ee34f"
+        "hash": "4accb95c8fb5ac770c73c78b6236938773499c74617df09a1f73a60abd6f44d7"
       }
     },
     {
@@ -3627,9 +3627,9 @@
         "fileName": "isSorted.md",
         "text": "Returns `1` if the array is sorted in ascending order, `-1` if it is sorted in descending order or `0` if it is not sorted.\n\nCalculate the ordering `direction` for the first two elements.\nUse `Object.entries()` to loop over array objects and compare them in pairs.\nReturn `0` if the `direction` changes or the `direction` if the last element is reached.\n\n",
         "codeBlocks": {
-          "es6": "const isSorted = arr => {\r\n  let direction = -(arr[0] - arr[1]);\r\n  for (let [i, val] of arr.entries()) {\r\n    direction = !direction ? -(arr[i - 1] - arr[i]) : direction;\r\n    if (i === arr.length - 1) return !direction ? 0 : direction;\r\n    else if ((val - arr[i + 1]) * direction > 0) return 0;\r\n  }\r\n};",
+          "es6": "const isSorted = arr => {\n  let direction = -(arr[0] - arr[1]);\n  for (let [i, val] of arr.entries()) {\n    direction = !direction ? -(arr[i - 1] - arr[i]) : direction;\n    if (i === arr.length - 1) return !direction ? 0 : direction;\n    else if ((val - arr[i + 1]) * direction > 0) return 0;\n  }\n};",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar isSorted = function isSorted(arr) {\n  var direction = -(arr[0] - arr[1]);\n  var _iteratorNormalCompletion = true;\n  var _didIteratorError = false;\n  var _iteratorError = undefined;\n\n  try {\n    for (var _iterator = arr.entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n      var _step$value = _slicedToArray(_step.value, 2),\n          i = _step$value[0],\n          val = _step$value[1];\n\n      direction = !direction ? -(arr[i - 1] - arr[i]) : direction;\n      if (i === arr.length - 1) return !direction ? 0 : direction;else if ((val - arr[i + 1]) * direction > 0) return 0;\n    }\n  } catch (err) {\n    _didIteratorError = true;\n    _iteratorError = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion && _iterator[\"return\"] != null) {\n        _iterator[\"return\"]();\n      }\n    } finally {\n      if (_didIteratorError) {\n        throw _iteratorError;\n      }\n    }\n  }\n};",
-          "example": "isSorted([0, 1, 2, 2]); // 1\r\nisSorted([4, 3, 2]); // -1\r\nisSorted([4, 3, 5]); // 0"
+          "example": "isSorted([0, 1, 2, 2]); // 1\nisSorted([4, 3, 2]); // -1\nisSorted([4, 3, 5]); // 0"
         },
         "tags": [
           "array",
@@ -3637,7 +3637,7 @@
         ]
       },
       "meta": {
-        "hash": "4264d14eda0f35cbfc392fb32e652258b238955a75b1fcd8e96f84efc376c1fa"
+        "hash": "b916ab345483f3d11d921f5f54da89bbf1c724aceb1d1c16f5b7365794da6e0e"
       }
     },
     {
@@ -3650,7 +3650,7 @@
         "codeBlocks": {
           "es6": "const isStream = val => val !== null && typeof val === 'object' && typeof val.pipe === 'function';",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isStream = function isStream(val) {\n  return val !== null && _typeof(val) === 'object' && typeof val.pipe === 'function';\n};",
-          "example": "const fs = require('fs');\r\nisStream(fs.createReadStream('test.txt')); // true"
+          "example": "const fs = require('fs');\nisStream(fs.createReadStream('test.txt')); // true"
         },
         "tags": [
           "node",
@@ -3659,7 +3659,7 @@
         ]
       },
       "meta": {
-        "hash": "750e4e393fa1238425cbb6395fa4f66644ce834aa0f1da11c973625d0d063feb"
+        "hash": "5e2955867dd0b233a65bf95587e4a190da61629a4cba61e270d36e0a26c7946e"
       }
     },
     {
@@ -3681,7 +3681,7 @@
         ]
       },
       "meta": {
-        "hash": "75054eed566f7b778e9ff3a74ef312191fa94654dbbe91179889e8491326e69e"
+        "hash": "4a29ea0e99857a128109e6cf7d1120bc4cdb6b05be2ce4602715e6c863b1cc3d"
       }
     },
     {
@@ -3702,7 +3702,7 @@
         ]
       },
       "meta": {
-        "hash": "5526bb700ba1f479579c15409c9d0c2adad023d09768009942573e31bb6cd9a5"
+        "hash": "8599f274909a26bd17178514b849ee803959f3c69207fce2951923d1719fbddb"
       }
     },
     {
@@ -3723,7 +3723,7 @@
         ]
       },
       "meta": {
-        "hash": "c95badc9344879a41cabed9dab5064ae1f3e67e9ef4605f1b1ea2f1ae92cee6c"
+        "hash": "aaf7f8a0beaeedb11a5b13b304fa1c51eddf66e103d2b44a1c3648de39fd1e23"
       }
     },
     {
@@ -3744,7 +3744,7 @@
         ]
       },
       "meta": {
-        "hash": "37a1c9fe022a4806af443099471f264451b5885bc0bb974d54c84b1d3bf384f9"
+        "hash": "6ebaa03264b6b2f637f8380b8796ebdc820a2031db72fcfd5d6d657af79b496c"
       }
     },
     {
@@ -3757,7 +3757,7 @@
         "codeBlocks": {
           "es6": "const isUpperCase = str => str === str.toUpperCase();",
           "es5": "var isUpperCase = function isUpperCase(str) {\n  return str === str.toUpperCase();\n};",
-          "example": "isUpperCase('ABC'); // true\r\nisLowerCase('A3@$'); // true\r\nisLowerCase('aB4'); // false"
+          "example": "isUpperCase('ABC'); // true\nisLowerCase('A3@$'); // true\nisLowerCase('aB4'); // false"
         },
         "tags": [
           "string",
@@ -3766,7 +3766,7 @@
         ]
       },
       "meta": {
-        "hash": "0c8c208877079c6d2d9d86bfa4f5de5b911b580680a4a7c6ea2871e133b38631"
+        "hash": "0f90daea28e858946e4c2cb642a84189b47872dfe42c29f708b0aedcf76bc8dd"
       }
     },
     {
@@ -3777,9 +3777,9 @@
         "fileName": "isValidJSON.md",
         "text": "Checks if the provided string is a valid JSON.\n\nUse `JSON.parse()` and a `try... catch` block to check if the provided string is a valid JSON.\n\n",
         "codeBlocks": {
-          "es6": "const isValidJSON = str => {\r\n  try {\r\n    JSON.parse(str);\r\n    return true;\r\n  } catch (e) {\r\n    return false;\r\n  }\r\n};",
+          "es6": "const isValidJSON = str => {\n  try {\n    JSON.parse(str);\n    return true;\n  } catch (e) {\n    return false;\n  }\n};",
           "es5": "var isValidJSON = function isValidJSON(str) {\n  try {\n    JSON.parse(str);\n    return true;\n  } catch (e) {\n    return false;\n  }\n};",
-          "example": "isValidJSON('{\"name\":\"Adam\",\"age\":20}'); // true\r\nisValidJSON('{\"name\":\"Adam\",age:\"20\"}'); // false\r\nisValidJSON(null); // true"
+          "example": "isValidJSON('{\"name\":\"Adam\",\"age\":20}'); // true\nisValidJSON('{\"name\":\"Adam\",age:\"20\"}'); // false\nisValidJSON(null); // true"
         },
         "tags": [
           "type",
@@ -3788,7 +3788,7 @@
         ]
       },
       "meta": {
-        "hash": "ddf2b0fa76d61e808a1e2a16ec58ebb7ce92f95f452b2d32c7902afd38fb7bf2"
+        "hash": "3b695d9ce6aa94aea1a367fba124a615d0132c8894e702f96e042fd6e6349ac1"
       }
     },
     {
@@ -3799,7 +3799,7 @@
         "fileName": "isWeekday.md",
         "text": "Results in a boolean representation of a specific date.\n\nPass the specific date object firstly.\nUse `Date.getDay()` to check weekday by using a modulo operator and then returning a boolean.\n\n",
         "codeBlocks": {
-          "es6": "const isWeekday = (t = new Date()) => {\r\n  return t.getDay() % 6 !== 0;\r\n};",
+          "es6": "const isWeekday = (t = new Date()) => {\n  return t.getDay() % 6 !== 0;\n};",
           "es5": "var isWeekday = function isWeekday() {\n  var t = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : new Date();\n  return t.getDay() % 6 !== 0;\n};",
           "example": "isWeekday(); // true (if current date is 2019-07-19)"
         },
@@ -3809,7 +3809,7 @@
         ]
       },
       "meta": {
-        "hash": "e407c0fbb1c1d54fa8ba1dab0bd1f9f02834c9fc37961ff70d6ff96e3950608b"
+        "hash": "f4b7c801ff0d3a23d10d2cb4de23d63e0d1dd09cd0d014c414a81c5628b8ff8b"
       }
     },
     {
@@ -3820,7 +3820,7 @@
         "fileName": "isWeekend.md",
         "text": "Results in a boolean representation of a specific date.\n\nPass the specific date object firstly.\nUse `Date.getDay()` to check weekend based on the day being returned as 0 - 6 using a modulo operation then return a boolean.\n\n",
         "codeBlocks": {
-          "es6": "const isWeekend = (t = new Date()) => {\r\n  return t.getDay() % 6 === 0;\r\n};",
+          "es6": "const isWeekend = (t = new Date()) => {\n  return t.getDay() % 6 === 0;\n};",
           "es5": "var isWeekend = function isWeekend() {\n  var t = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : new Date();\n  return t.getDay() % 6 === 0;\n};",
           "example": "isWeekend(); // 2018-10-19 (if current date is 2018-10-18)"
         },
@@ -3830,7 +3830,7 @@
         ]
       },
       "meta": {
-        "hash": "6b977bb21dbf98b74bbda83539ddb5c2f17fdfd560ab724d6f994cb293334c90"
+        "hash": "6b2bfb3ce5798f702332f4cf14749b4b044fe7de6ee1d79bc786c1e3fe704dbd"
       }
     },
     {
@@ -3841,9 +3841,9 @@
         "fileName": "isWritableStream.md",
         "text": "Checks if the given argument is a writable stream.\n\nCheck if the value is different from `null`, use `typeof` to check if the value is of type `object` and the `pipe` property is of type `function`.\nAdditionally check if the `typeof` the `_write` and `_writableState` properties are `function` and `object` respectively.\n\n",
         "codeBlocks": {
-          "es6": "const isWritableStream = val =>\r\n  val !== null &&\r\n  typeof val === 'object' &&\r\n  typeof val.pipe === 'function' &&\r\n  typeof val._write === 'function' &&\r\n  typeof val._writableState === 'object';",
+          "es6": "const isWritableStream = val =>\n  val !== null &&\n  typeof val === 'object' &&\n  typeof val.pipe === 'function' &&\n  typeof val._write === 'function' &&\n  typeof val._writableState === 'object';",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isWritableStream = function isWritableStream(val) {\n  return val !== null && _typeof(val) === 'object' && typeof val.pipe === 'function' && typeof val._write === 'function' && _typeof(val._writableState) === 'object';\n};",
-          "example": "const fs = require('fs');\r\nisWritableStream(fs.createWriteStream('test.txt')); // true"
+          "example": "const fs = require('fs');\nisWritableStream(fs.createWriteStream('test.txt')); // true"
         },
         "tags": [
           "node",
@@ -3852,7 +3852,7 @@
         ]
       },
       "meta": {
-        "hash": "6b33ef8f2b82cb0d5b57c4f2bc7279bb00bdc3a63f6c8036733e7efd4f160ca5"
+        "hash": "8f9400b2f8204180520e4cb2d2150ea515eb704d684f483377ba3e5513268bb0"
       }
     },
     {
@@ -3863,9 +3863,9 @@
         "fileName": "join.md",
         "text": "Joins all elements of an array into a string and returns this string.\nUses a separator and an end separator.\n\nUse `Array.prototype.reduce()` to combine elements into a string.\nOmit the second argument, `separator`, to use a default separator of `','`.\nOmit the third argument, `end`, to use the same value as `separator` by default.\n\n",
         "codeBlocks": {
-          "es6": "const join = (arr, separator = ',', end = separator) =>\r\n  arr.reduce(\r\n    (acc, val, i) =>\r\n      i === arr.length - 2\r\n        ? acc + val + end\r\n        : i === arr.length - 1\r\n          ? acc + val\r\n          : acc + val + separator,\r\n    ''\r\n  );",
+          "es6": "const join = (arr, separator = ',', end = separator) =>\n  arr.reduce(\n    (acc, val, i) =>\n      i === arr.length - 2\n        ? acc + val + end\n        : i === arr.length - 1\n        ? acc + val\n        : acc + val + separator,\n    ''\n  );",
           "es5": "var join = function join(arr) {\n  var separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n  var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : separator;\n  return arr.reduce(function (acc, val, i) {\n    return i === arr.length - 2 ? acc + val + end : i === arr.length - 1 ? acc + val : acc + val + separator;\n  }, '');\n};",
-          "example": "join(['pen', 'pineapple', 'apple', 'pen'], ',', '&'); // \"pen,pineapple,apple&pen\"\r\njoin(['pen', 'pineapple', 'apple', 'pen'], ','); // \"pen,pineapple,apple,pen\"\r\njoin(['pen', 'pineapple', 'apple', 'pen']); // \"pen,pineapple,apple,pen\""
+          "example": "join(['pen', 'pineapple', 'apple', 'pen'], ',', '&'); // \"pen,pineapple,apple&pen\"\njoin(['pen', 'pineapple', 'apple', 'pen'], ','); // \"pen,pineapple,apple,pen\"\njoin(['pen', 'pineapple', 'apple', 'pen']); // \"pen,pineapple,apple,pen\""
         },
         "tags": [
           "array",
@@ -3873,7 +3873,7 @@
         ]
       },
       "meta": {
-        "hash": "085152c359856ea4c13ef70f136969d8ce554b21b27164cd04d08f93a6051636"
+        "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
       }
     },
     {
@@ -3884,9 +3884,9 @@
         "fileName": "JSONtoCSV.md",
         "text": "Converts an array of objects to a comma-separated values (CSV) string that contains only the `columns` specified.\n\nUse `Array.prototype.join(delimiter)` to combine all the names in `columns` to create the first row.\nUse `Array.prototype.map()` and `Array.prototype.reduce()` to create a row for each object, substituting non-existent values with empty strings and only mapping values in `columns`.\nUse `Array.prototype.join('\\n')` to combine all rows into a string.\nOmit the third argument, `delimiter`, to use a default delimiter of `,`.\n\n",
         "codeBlocks": {
-          "es6": "const JSONtoCSV = (arr, columns, delimiter = ',') =>\r\n  [\r\n    columns.join(delimiter),\r\n    ...arr.map(obj =>\r\n      columns.reduce(\r\n        (acc, key) => `${acc}${!acc.length ? '' : delimiter}\"${!obj[key] ? '' : obj[key]}\"`,\r\n        ''\r\n      )\r\n    )\r\n  ].join('\\n');",
+          "es6": "const JSONtoCSV = (arr, columns, delimiter = ',') =>\n  [\n    columns.join(delimiter),\n    ...arr.map(obj =>\n      columns.reduce(\n        (acc, key) => `${acc}${!acc.length ? '' : delimiter}\"${!obj[key] ? '' : obj[key]}\"`,\n        ''\n      )\n    )\n  ].join('\\n');",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar JSONtoCSV = function JSONtoCSV(arr, columns) {\n  var delimiter = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : ',';\n  return [columns.join(delimiter)].concat(_toConsumableArray(arr.map(function (obj) {\n    return columns.reduce(function (acc, key) {\n      return \"\".concat(acc).concat(!acc.length ? '' : delimiter, \"\\\"\").concat(!obj[key] ? '' : obj[key], \"\\\"\");\n    }, '');\n  }))).join('\\n');\n};",
-          "example": "JSONtoCSV([{ a: 1, b: 2 }, { a: 3, b: 4, c: 5 }, { a: 6 }, { b: 7 }], ['a', 'b']); // 'a,b\\n\"1\",\"2\"\\n\"3\",\"4\"\\n\"6\",\"\"\\n\"\",\"7\"'\r\nJSONtoCSV([{ a: 1, b: 2 }, { a: 3, b: 4, c: 5 }, { a: 6 }, { b: 7 }], ['a', 'b'], ';'); // 'a;b\\n\"1\";\"2\"\\n\"3\";\"4\"\\n\"6\";\"\"\\n\"\";\"7\"'"
+          "example": "JSONtoCSV([{ a: 1, b: 2 }, { a: 3, b: 4, c: 5 }, { a: 6 }, { b: 7 }], ['a', 'b']); // 'a,b\\n\"1\",\"2\"\\n\"3\",\"4\"\\n\"6\",\"\"\\n\"\",\"7\"'\nJSONtoCSV([{ a: 1, b: 2 }, { a: 3, b: 4, c: 5 }, { a: 6 }, { b: 7 }], ['a', 'b'], ';'); // 'a;b\\n\"1\";\"2\"\\n\"3\";\"4\"\\n\"6\";\"\"\\n\"\";\"7\"'"
         },
         "tags": [
           "array",
@@ -3896,7 +3896,7 @@
         ]
       },
       "meta": {
-        "hash": "fd21c68cbc13ec625b56c4be4ed95ff8374ac1009d28906c818e8366453932b7"
+        "hash": "5b76a1a772d79233e7d8c87d903f1ef48b4c4bc52a05df4d13753ed810795380"
       }
     },
     {
@@ -3907,7 +3907,7 @@
         "fileName": "JSONToFile.md",
         "text": "Writes a JSON object to a file.\n\nUse `fs.writeFile()`, template literals and `JSON.stringify()` to write a `json` object to a `.json` file.\n\n",
         "codeBlocks": {
-          "es6": "const fs = require('fs');\r\nconst JSONToFile = (obj, filename) =>\r\n  fs.writeFile(`${filename}.json`, JSON.stringify(obj, null, 2));",
+          "es6": "const fs = require('fs');\nconst JSONToFile = (obj, filename) =>\n  fs.writeFile(`${filename}.json`, JSON.stringify(obj, null, 2));",
           "es5": "var fs = require('fs');\n\nvar JSONToFile = function JSONToFile(obj, filename) {\n  return fs.writeFile(\"\".concat(filename, \".json\"), JSON.stringify(obj, null, 2));\n};",
           "example": "JSONToFile({ test: 'is passed' }, 'testJsonFile'); // writes the object to 'testJsonFile.json'"
         },
@@ -3918,7 +3918,7 @@
         ]
       },
       "meta": {
-        "hash": "2eb1a4bb3c642315cdf9b5f42c413aa175bf47c6d8c4727ddf935b943a3b238d"
+        "hash": "e7b3dc5eaa43f1ccf6b4863e437b9b4b275ec79fb18623a4c3d0e6ec300d9bcb"
       }
     },
     {
@@ -3939,7 +3939,7 @@
         ]
       },
       "meta": {
-        "hash": "be54f449bc8ff1e0ad9523f41b0f108c1915018a1ae43fd02754e21628097b08"
+        "hash": "e39f9d9a330111b1aa8c32545a9fcb20211563a8f25fdbed2abfb2ce6defad62"
       }
     },
     {
@@ -3950,9 +3950,9 @@
         "fileName": "lcm.md",
         "text": "Returns the least common multiple of two or more numbers.\n\nUse the greatest common divisor (GCD) formula and the fact that `lcm(x,y) = x * y / gcd(x,y)` to determine the least common multiple.\nThe GCD formula uses recursion.\n\n",
         "codeBlocks": {
-          "es6": "const lcm = (...arr) => {\r\n  const gcd = (x, y) => (!y ? x : gcd(y, x % y));\r\n  const _lcm = (x, y) => (x * y) / gcd(x, y);\r\n  return [...arr].reduce((a, b) => _lcm(a, b));\r\n};",
+          "es6": "const lcm = (...arr) => {\n  const gcd = (x, y) => (!y ? x : gcd(y, x % y));\n  const _lcm = (x, y) => (x * y) / gcd(x, y);\n  return [...arr].reduce((a, b) => _lcm(a, b));\n};",
           "es5": "var lcm = function lcm() {\n  var gcd = function gcd(x, y) {\n    return !y ? x : gcd(y, x % y);\n  };\n\n  var _lcm = function _lcm(x, y) {\n    return x * y / gcd(x, y);\n  };\n\n  for (var _len = arguments.length, arr = new Array(_len), _key = 0; _key < _len; _key++) {\n    arr[_key] = arguments[_key];\n  }\n\n  return [].concat(arr).reduce(function (a, b) {\n    return _lcm(a, b);\n  });\n};",
-          "example": "lcm(12, 7); // 84\r\nlcm(...[1, 3, 4, 5]); // 60"
+          "example": "lcm(12, 7); // 84\nlcm(...[1, 3, 4, 5]); // 60"
         },
         "tags": [
           "math",
@@ -3961,7 +3961,7 @@
         ]
       },
       "meta": {
-        "hash": "5b913a0a63e4ec2a745c24e4af7c0dbe044c308a2899fb4535a382520afeb4d3"
+        "hash": "31f59a2480a0c840666af05f87ede6b169aece233b0323e9f03fd79ac7d4bc44"
       }
     },
     {
@@ -3974,7 +3974,7 @@
         "codeBlocks": {
           "es6": "const longestItem = (...vals) => vals.reduce((a, x) => (x.length > a.length ? x : a));",
           "es5": "var longestItem = function longestItem() {\n  for (var _len = arguments.length, vals = new Array(_len), _key = 0; _key < _len; _key++) {\n    vals[_key] = arguments[_key];\n  }\n\n  return vals.reduce(function (a, x) {\n    return x.length > a.length ? x : a;\n  });\n};",
-          "example": "longestItem('this', 'is', 'a', 'testcase'); // 'testcase'\r\nlongestItem(...['a', 'ab', 'abc']); // 'abc'\r\nlongestItem(...['a', 'ab', 'abc'], 'abcd'); // 'abcd'\r\nlongestItem([1, 2, 3], [1, 2], [1, 2, 3, 4, 5]); // [1, 2, 3, 4, 5]\r\nlongestItem([1, 2, 3], 'foobar'); // 'foobar'"
+          "example": "longestItem('this', 'is', 'a', 'testcase'); // 'testcase'\nlongestItem(...['a', 'ab', 'abc']); // 'abc'\nlongestItem(...['a', 'ab', 'abc'], 'abcd'); // 'abcd'\nlongestItem([1, 2, 3], [1, 2], [1, 2, 3, 4, 5]); // [1, 2, 3, 4, 5]\nlongestItem([1, 2, 3], 'foobar'); // 'foobar'"
         },
         "tags": [
           "array",
@@ -3984,7 +3984,7 @@
         ]
       },
       "meta": {
-        "hash": "1cd853b4a92ae93fd5751e1476ae61e5c064cf9fdfd96450c6129e2493104f40"
+        "hash": "1277ce52444adcbc3a7b62d5c9019aa3cf01293e7749b8d0e1871ae2aa6a8c88"
       }
     },
     {
@@ -3995,9 +3995,9 @@
         "fileName": "lowercaseKeys.md",
         "text": "Creates a new object from the specified object, where all the keys are in lowercase.\n\nUse `Object.keys()` and `Array.prototype.reduce()` to create a new object from the specified object.\nConvert each key in the original object to lowercase, using `String.toLowerCase()`.\n\n",
         "codeBlocks": {
-          "es6": "const lowercaseKeys = obj =>\r\n  Object.keys(obj).reduce((acc, key) => {\r\n    acc[key.toLowerCase()] = obj[key];\r\n    return acc;\r\n  }, {});",
+          "es6": "const lowercaseKeys = obj =>\n  Object.keys(obj).reduce((acc, key) => {\n    acc[key.toLowerCase()] = obj[key];\n    return acc;\n  }, {});",
           "es5": "var lowercaseKeys = function lowercaseKeys(obj) {\n  return Object.keys(obj).reduce(function (acc, key) {\n    acc[key.toLowerCase()] = obj[key];\n    return acc;\n  }, {});\n};",
-          "example": "const myObj = { Name: 'Adam', sUrnAME: 'Smith' };\r\nconst myObjLower = lowercaseKeys(myObj); // {name: 'Adam', surname: 'Smith'};"
+          "example": "const myObj = { Name: 'Adam', sUrnAME: 'Smith' };\nconst myObjLower = lowercaseKeys(myObj); // {name: 'Adam', surname: 'Smith'};"
         },
         "tags": [
           "object",
@@ -4005,7 +4005,7 @@
         ]
       },
       "meta": {
-        "hash": "2be5dca5faf7c6f9c58342632db149469c79134820645deaa03b0c3dc6922a27"
+        "hash": "5a7033d47335bedd0239adab9cc2f112a311c28398d46da2bc2196fe61c9ce78"
       }
     },
     {
@@ -4016,9 +4016,9 @@
         "fileName": "luhnCheck.md",
         "text": "Implementation of the [Luhn Algorithm](https://en.wikipedia.org/wiki/Luhn_algorithm) used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers etc.\n\nUse `String.prototype.split('')`, `Array.prototype.reverse()` and `Array.prototype.map()` in combination with `parseInt()` to obtain an array of digits.\nUse `Array.prototype.splice(0,1)` to obtain the last digit.\nUse `Array.prototype.reduce()` to implement the Luhn Algorithm.\nReturn `true` if `sum` is divisible by `10`, `false` otherwise.\n\n",
         "codeBlocks": {
-          "es6": "const luhnCheck = num => {\r\n  let arr = (num + '')\r\n    .split('')\r\n    .reverse()\r\n    .map(x => parseInt(x));\r\n  let lastDigit = arr.splice(0, 1)[0];\r\n  let sum = arr.reduce((acc, val, i) => (i % 2 !== 0 ? acc + val : acc + ((val * 2) % 9) || 9), 0);\r\n  sum += lastDigit;\r\n  return sum % 10 === 0;\r\n};",
+          "es6": "const luhnCheck = num => {\n  let arr = (num + '')\n    .split('')\n    .reverse()\n    .map(x => parseInt(x));\n  let lastDigit = arr.splice(0, 1)[0];\n  let sum = arr.reduce((acc, val, i) => (i % 2 !== 0 ? acc + val : acc + ((val * 2) % 9) || 9), 0);\n  sum += lastDigit;\n  return sum % 10 === 0;\n};",
           "es5": "var luhnCheck = function luhnCheck(num) {\n  var arr = (num + '').split('').reverse().map(function (x) {\n    return parseInt(x);\n  });\n  var lastDigit = arr.splice(0, 1)[0];\n  var sum = arr.reduce(function (acc, val, i) {\n    return i % 2 !== 0 ? acc + val : acc + val * 2 % 9 || 9;\n  }, 0);\n  sum += lastDigit;\n  return sum % 10 === 0;\n};",
-          "example": "luhnCheck('4485275742308327'); // true\r\nluhnCheck(6011329933655299); //  false\r\nluhnCheck(123456789); // false"
+          "example": "luhnCheck('4485275742308327'); // true\nluhnCheck(6011329933655299); //  false\nluhnCheck(123456789); // false"
         },
         "tags": [
           "math",
@@ -4027,7 +4027,7 @@
         ]
       },
       "meta": {
-        "hash": "b0dc3c84b70f6a45c0fb3f292fb2aad7923d88a6026703be6ac79113250b4ef1"
+        "hash": "ab83bac8546d02dfe4227792750f0b4c64cd2c8f8ce6063eef2a3f4357210d63"
       }
     },
     {
@@ -4038,7 +4038,7 @@
         "fileName": "mapKeys.md",
         "text": "Creates an object with keys generated by running the provided function for each key and the same values as the provided object.\n\nUse `Object.keys(obj)` to iterate over the object's keys.\nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n\n",
         "codeBlocks": {
-          "es6": "const mapKeys = (obj, fn) =>\r\n  Object.keys(obj).reduce((acc, k) => {\r\n    acc[fn(obj[k], k, obj)] = obj[k];\r\n    return acc;\r\n  }, {});",
+          "es6": "const mapKeys = (obj, fn) =>\n  Object.keys(obj).reduce((acc, k) => {\n    acc[fn(obj[k], k, obj)] = obj[k];\n    return acc;\n  }, {});",
           "es5": "var mapKeys = function mapKeys(obj, fn) {\n  return Object.keys(obj).reduce(function (acc, k) {\n    acc[fn(obj[k], k, obj)] = obj[k];\n    return acc;\n  }, {});\n};",
           "example": "mapKeys({ a: 1, b: 2 }, (val, key) => key + val); // { a1: 1, b2: 2 }"
         },
@@ -4049,7 +4049,7 @@
         ]
       },
       "meta": {
-        "hash": "8ba6bdab4591d8d7ce4fcfaa5151d07b60c7df6e632c540fd5f676388de38ffb"
+        "hash": "3e721dd4b5fc9a41ed7f3ae6eb888848c8ae557a0feea28f17f945a24ab677ae"
       }
     },
     {
@@ -4060,7 +4060,7 @@
         "fileName": "mapNumRange.md",
         "text": "Maps a number from one range to another range.\n\nReturns `num` mapped between `outMin`-`outMax` from `inMin`-`inMax`.\n\n",
         "codeBlocks": {
-          "es6": "const mapNumRange = (num, inMin, inMax, outMin, outMax) =>\r\n  ((num - inMin) * (outMax - outMin)) / (inMax - inMin) + outMin;",
+          "es6": "const mapNumRange = (num, inMin, inMax, outMin, outMax) =>\n  ((num - inMin) * (outMax - outMin)) / (inMax - inMin) + outMin;",
           "es5": "var mapNumRange = function mapNumRange(num, inMin, inMax, outMin, outMax) {\n  return (num - inMin) * (outMax - outMin) / (inMax - inMin) + outMin;\n};",
           "example": "mapNumRange(5, 0, 10, 0, 100); // 50"
         },
@@ -4070,7 +4070,7 @@
         ]
       },
       "meta": {
-        "hash": "b0da4d48a96e48f9261fa03d1a8da3367db7093781ec35b8bbf10fc5ffd9146d"
+        "hash": "46da170d5f14d8070725e9f31e5b24de72aa4b0b476912d602e0480400638c9c"
       }
     },
     {
@@ -4081,9 +4081,9 @@
         "fileName": "mapObject.md",
         "text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the stringified value as the key and the mapped value.\n\nUse an anonymous inner function scope to declare an undefined memory space, using closures to store a return value. Use a new `Array` to store the array with a map of the function over its data set and a comma operator to return a second step, without needing to move from one context to another (due to closures and order of operations).\n\n",
         "codeBlocks": {
-          "es6": "const mapObject = (arr, fn) =>\r\n  (a => (\r\n    (a = [arr, arr.map(fn)]), a[0].reduce((acc, val, ind) => ((acc[val] = a[1][ind]), acc), {})\r\n  ))();",
+          "es6": "const mapObject = (arr, fn) =>\n  (a => (\n    (a = [arr, arr.map(fn)]), a[0].reduce((acc, val, ind) => ((acc[val] = a[1][ind]), acc), {})\n  ))();",
           "es5": "var mapObject = function mapObject(arr, fn) {\n  return function (a) {\n    return a = [arr, arr.map(fn)], a[0].reduce(function (acc, val, ind) {\n      return acc[val] = a[1][ind], acc;\n    }, {});\n  }();\n};",
-          "example": "const squareIt = arr => mapObject(arr, a => a * a);\r\nsquareIt([1, 2, 3]); // { 1: 1, 2: 4, 3: 9 }"
+          "example": "const squareIt = arr => mapObject(arr, a => a * a);\nsquareIt([1, 2, 3]); // { 1: 1, 2: 4, 3: 9 }"
         },
         "tags": [
           "array",
@@ -4092,7 +4092,7 @@
         ]
       },
       "meta": {
-        "hash": "71290432b76b6857278cdf2c3b656d661df5936428fa6e9b276d4251323ea985"
+        "hash": "3afc30c02480be79ae5fb41e05ee2b1cc6f3b408ccb64a1a192d0ad34148ede2"
       }
     },
     {
@@ -4103,7 +4103,7 @@
         "fileName": "mapString.md",
         "text": "Creates a new string with the results of calling a provided function on every character in the calling string.\n\nUse `String.prototype.split('')` and `Array.prototype.map()` to call the provided function, `fn`, for each character in `str`.\nUse `Array.prototype.join('')` to recombine the array of characters into a string.\nThe callback function, `fn`, takes three arguments (the current character, the index of the current character and the string `mapString` was called upon).\n\n",
         "codeBlocks": {
-          "es6": "const mapString = (str, fn) =>\r\n  str\r\n    .split('')\r\n    .map((c, i) => fn(c, i, str))\r\n    .join('');",
+          "es6": "const mapString = (str, fn) =>\n  str\n    .split('')\n    .map((c, i) => fn(c, i, str))\n    .join('');",
           "es5": "var mapString = function mapString(str, fn) {\n  return str.split('').map(function (c, i) {\n    return fn(c, i, str);\n  }).join('');\n};",
           "example": "mapString('lorem ipsum', c => c.toUpperCase()); // 'LOREM IPSUM'"
         },
@@ -4116,7 +4116,7 @@
         ]
       },
       "meta": {
-        "hash": "f66ca9423759cb1084231cd4f0fe275b766ef64bc78fe4c9afe09d6eece76b3c"
+        "hash": "c4df98d941aeadd165c6a02143d79f7a9bf013f8c221f709aa545bf83495a956"
       }
     },
     {
@@ -4127,9 +4127,9 @@
         "fileName": "mapValues.md",
         "text": "Creates an object with the same keys as the provided object and values generated by running the provided function for each value.\n\nUse `Object.keys(obj)` to iterate over the object's keys.\nUse `Array.prototype.reduce()` to create a new object with the same keys and mapped values using `fn`.\n\n",
         "codeBlocks": {
-          "es6": "const mapValues = (obj, fn) =>\r\n  Object.keys(obj).reduce((acc, k) => {\r\n    acc[k] = fn(obj[k], k, obj);\r\n    return acc;\r\n  }, {});",
+          "es6": "const mapValues = (obj, fn) =>\n  Object.keys(obj).reduce((acc, k) => {\n    acc[k] = fn(obj[k], k, obj);\n    return acc;\n  }, {});",
           "es5": "var mapValues = function mapValues(obj, fn) {\n  return Object.keys(obj).reduce(function (acc, k) {\n    acc[k] = fn(obj[k], k, obj);\n    return acc;\n  }, {});\n};",
-          "example": "const users = {\r\n  fred: { user: 'fred', age: 40 },\r\n  pebbles: { user: 'pebbles', age: 1 }\r\n};\r\nmapValues(users, u => u.age); // { fred: 40, pebbles: 1 }"
+          "example": "const users = {\n  fred: { user: 'fred', age: 40 },\n  pebbles: { user: 'pebbles', age: 1 }\n};\nmapValues(users, u => u.age); // { fred: 40, pebbles: 1 }"
         },
         "tags": [
           "object",
@@ -4138,7 +4138,7 @@
         ]
       },
       "meta": {
-        "hash": "c3e8200967ffc973f3aa5eefe79b0a5263e2a740003fc73640d776adcfe92e7d"
+        "hash": "3853716eb171ac10f5b6dbd0b6afda1342262de305336cd0effd43dc75592f3c"
       }
     },
     {
@@ -4151,7 +4151,7 @@
         "codeBlocks": {
           "es6": "const mask = (cc, num = 4, mask = '*') => `${cc}`.slice(-num).padStart(`${cc}`.length, mask);",
           "es5": "var mask = function mask(cc) {\n  var num = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 4;\n  var mask = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '*';\n  return \"\".concat(cc).slice(-num).padStart(\"\".concat(cc).length, mask);\n};",
-          "example": "mask(1234567890); // '******7890'\r\nmask(1234567890, 3); // '*******890'\r\nmask(1234567890, -4, '$'); // '$$$$567890'"
+          "example": "mask(1234567890); // '******7890'\nmask(1234567890, 3); // '*******890'\nmask(1234567890, -4, '$'); // '$$$$567890'"
         },
         "tags": [
           "string",
@@ -4161,7 +4161,7 @@
         ]
       },
       "meta": {
-        "hash": "d078ae6f6c57027e6e53ca898cac1c7050a5c8676eb6785616b7adc953edd9b7"
+        "hash": "20da2d84848993791b963b0b44a1bbe6746259a6c40675e477a6f0e4ed449ab5"
       }
     },
     {
@@ -4172,9 +4172,9 @@
         "fileName": "matches.md",
         "text": "Compares two objects to determine if the first one contains equivalent property values to the second one.\n\nUse `Object.keys(source)` to get all the keys of the second object, then `Array.prototype.every()`, `Object.hasOwnProperty()` and strict comparison to determine if all keys exist in the first object and have the same values.\n\n",
         "codeBlocks": {
-          "es6": "const matches = (obj, source) =>\r\n  Object.keys(source).every(key => obj.hasOwnProperty(key) && obj[key] === source[key]);",
+          "es6": "const matches = (obj, source) =>\n  Object.keys(source).every(key => obj.hasOwnProperty(key) && obj[key] === source[key]);",
           "es5": "var matches = function matches(obj, source) {\n  return Object.keys(source).every(function (key) {\n    return obj.hasOwnProperty(key) && obj[key] === source[key];\n  });\n};",
-          "example": "matches({ age: 25, hair: 'long', beard: true }, { hair: 'long', beard: true }); // true\r\nmatches({ hair: 'long', beard: true }, { age: 25, hair: 'long', beard: true }); // false"
+          "example": "matches({ age: 25, hair: 'long', beard: true }, { hair: 'long', beard: true }); // true\nmatches({ hair: 'long', beard: true }, { age: 25, hair: 'long', beard: true }); // false"
         },
         "tags": [
           "object",
@@ -4183,7 +4183,7 @@
         ]
       },
       "meta": {
-        "hash": "f107df9c4fddc64bbb78b3fb6a3285be4002b60e83619b5325980ec9a1de23b1"
+        "hash": "45206aac5046169bce32aeeb14785735eb11b42e0bf8d3911531ae1ce6a56282"
       }
     },
     {
@@ -4194,9 +4194,9 @@
         "fileName": "matchesWith.md",
         "text": "Compares two objects to determine if the first one contains equivalent property values to the second one, based on a provided function.\n\nUse `Object.keys(source)` to get all the keys of the second object, then `Array.prototype.every()`, `Object.hasOwnProperty()` and the provided function to determine if all keys exist in the first object and have equivalent values.\nIf no function is provided, the values will be compared using the equality operator.\n\n",
         "codeBlocks": {
-          "es6": "const matchesWith = (obj, source, fn) =>\r\n  Object.keys(source).every(key =>\r\n    obj.hasOwnProperty(key) && fn\r\n      ? fn(obj[key], source[key], key, obj, source)\r\n      : obj[key] == source[key]\r\n  );",
+          "es6": "const matchesWith = (obj, source, fn) =>\n  Object.keys(source).every(key =>\n    obj.hasOwnProperty(key) && fn\n      ? fn(obj[key], source[key], key, obj, source)\n      : obj[key] == source[key]\n  );",
           "es5": "var matchesWith = function matchesWith(obj, source, fn) {\n  return Object.keys(source).every(function (key) {\n    return obj.hasOwnProperty(key) && fn ? fn(obj[key], source[key], key, obj, source) : obj[key] == source[key];\n  });\n};",
-          "example": "const isGreeting = val => /^h(?:i|ello)$/.test(val);\r\nmatchesWith(\r\n  { greeting: 'hello' },\r\n  { greeting: 'hi' },\r\n  (oV, sV) => isGreeting(oV) && isGreeting(sV)\r\n); // true"
+          "example": "const isGreeting = val => /^h(?:i|ello)$/.test(val);\nmatchesWith(\n  { greeting: 'hello' },\n  { greeting: 'hi' },\n  (oV, sV) => isGreeting(oV) && isGreeting(sV)\n); // true"
         },
         "tags": [
           "object",
@@ -4206,7 +4206,7 @@
         ]
       },
       "meta": {
-        "hash": "45598b4b398b946efb0e037258dc8251c10af6075fde11cf1dff91b3fb7c3234"
+        "hash": "27bc40621fd8cb1b6ded57d7bbbbb33590d889ff87a5e418ef2c0ec6e4005505"
       }
     },
     {
@@ -4219,7 +4219,7 @@
         "codeBlocks": {
           "es6": "const maxBy = (arr, fn) => Math.max(...arr.map(typeof fn === 'function' ? fn : val => val[fn]));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar maxBy = function maxBy(arr, fn) {\n  return Math.max.apply(Math, _toConsumableArray(arr.map(typeof fn === 'function' ? fn : function (val) {\n    return val[fn];\n  })));\n};",
-          "example": "maxBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 8\r\nmaxBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 8"
+          "example": "maxBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 8\nmaxBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 8"
         },
         "tags": [
           "math",
@@ -4229,7 +4229,7 @@
         ]
       },
       "meta": {
-        "hash": "a045d114577548ab932a022c5bb42d8aeb40c82667e34744468781f86a937d93"
+        "hash": "bcedf0ea886a7ef2c3a4a925335f087c0bab2e2cb3eb4bc5843f7951cbd5c798"
       }
     },
     {
@@ -4242,7 +4242,7 @@
         "codeBlocks": {
           "es6": "const maxDate = dates => new Date(Math.max(...dates));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar maxDate = function maxDate(dates) {\n  return new Date(Math.max.apply(Math, _toConsumableArray(dates)));\n};",
-          "example": "const array = [\r\n  new Date(2017, 4, 13),\r\n  new Date(2018, 2, 12),\r\n  new Date(2016, 0, 10),\r\n  new Date(2016, 0, 9)\r\n];\r\nmaxDate(array); // 2018-03-11T22:00:00.000Z"
+          "example": "const array = [\n  new Date(2017, 4, 13),\n  new Date(2018, 2, 12),\n  new Date(2016, 0, 10),\n  new Date(2016, 0, 9)\n];\nmaxDate(array); // 2018-03-11T22:00:00.000Z"
         },
         "tags": [
           "date",
@@ -4251,7 +4251,7 @@
         ]
       },
       "meta": {
-        "hash": "b28b5d8280f1c93b2da6c8aae3d4319fa4dfcbad9eddacc4c9744b817506d6d4"
+        "hash": "dc618772c3321607f451b13b124358fd3207f81fbeaa7f2deb3b7cd1da671175"
       }
     },
     {
@@ -4264,7 +4264,7 @@
         "codeBlocks": {
           "es6": "const maxN = (arr, n = 1) => [...arr].sort((a, b) => b - a).slice(0, n);",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar maxN = function maxN(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return _toConsumableArray(arr).sort(function (a, b) {\n    return b - a;\n  }).slice(0, n);\n};",
-          "example": "maxN([1, 2, 3]); // [3]\r\nmaxN([1, 2, 3], 2); // [3,2]"
+          "example": "maxN([1, 2, 3]); // [3]\nmaxN([1, 2, 3], 2); // [3,2]"
         },
         "tags": [
           "array",
@@ -4273,7 +4273,7 @@
         ]
       },
       "meta": {
-        "hash": "8c8ad12415ca77ab4e346e52551d0b3518d69cc8449931f105912fef3469ddcc"
+        "hash": "888b1addde4cd2fa6137733130e9d847a87299d6753ddda5c8dd8c94b542db80"
       }
     },
     {
@@ -4284,7 +4284,7 @@
         "fileName": "median.md",
         "text": "Returns the median of an array of numbers.\n\nFind the middle of the array, use `Array.prototype.sort()` to sort the values.\nReturn the number at the midpoint if `length` is odd, otherwise the average of the two middle numbers.\n\n",
         "codeBlocks": {
-          "es6": "const median = arr => {\r\n  const mid = Math.floor(arr.length / 2),\r\n    nums = [...arr].sort((a, b) => a - b);\r\n  return arr.length % 2 !== 0 ? nums[mid] : (nums[mid - 1] + nums[mid]) / 2;\r\n};",
+          "es6": "const median = arr => {\n  const mid = Math.floor(arr.length / 2),\n    nums = [...arr].sort((a, b) => a - b);\n  return arr.length % 2 !== 0 ? nums[mid] : (nums[mid - 1] + nums[mid]) / 2;\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar median = function median(arr) {\n  var mid = Math.floor(arr.length / 2),\n      nums = _toConsumableArray(arr).sort(function (a, b) {\n    return a - b;\n  });\n\n  return arr.length % 2 !== 0 ? nums[mid] : (nums[mid - 1] + nums[mid]) / 2;\n};",
           "example": "median([5, 6, 50, 1, -5]); // 5"
         },
@@ -4295,7 +4295,7 @@
         ]
       },
       "meta": {
-        "hash": "a67d3f94f7fde42be197e13aeb88fcbe64774bae6f732b19a84df764a3a9208e"
+        "hash": "bf0a5bf2fe4d28262fe7e8f3eec16d24c05a177b06d20937db413c0d404cda12"
       }
     },
     {
@@ -4306,9 +4306,9 @@
         "fileName": "memoize.md",
         "text": "Returns the memoized (cached) function.\n\nCreate an empty cache by instantiating a new `Map` object.\nReturn a function which takes a single argument to be supplied to the memoized function by first checking if the function's output for that specific input value is already cached, or store and return it if not. The `function` keyword must be used in order to allow the memoized function to have its `this` context changed if necessary.\nAllow access to the `cache` by setting it as a property on the returned function.\n\n",
         "codeBlocks": {
-          "es6": "const memoize = fn => {\r\n  const cache = new Map();\r\n  const cached = function(val) {\r\n    return cache.has(val) ? cache.get(val) : cache.set(val, fn.call(this, val)) && cache.get(val);\r\n  };\r\n  cached.cache = cache;\r\n  return cached;\r\n};",
+          "es6": "const memoize = fn => {\n  const cache = new Map();\n  const cached = function(val) {\n    return cache.has(val) ? cache.get(val) : cache.set(val, fn.call(this, val)) && cache.get(val);\n  };\n  cached.cache = cache;\n  return cached;\n};",
           "es5": "var memoize = function memoize(fn) {\n  var cache = new Map();\n\n  var cached = function cached(val) {\n    return cache.has(val) ? cache.get(val) : cache.set(val, fn.call(this, val)) && cache.get(val);\n  };\n\n  cached.cache = cache;\n  return cached;\n};",
-          "example": "// See the `anagrams` snippet.\r\nconst anagramsCached = memoize(anagrams);\r\nanagramsCached('javascript'); // takes a long time\r\nanagramsCached('javascript'); // returns virtually instantly since it's now cached\r\nconsole.log(anagramsCached.cache); // The cached anagrams map"
+          "example": "// See the `anagrams` snippet.\nconst anagramsCached = memoize(anagrams);\nanagramsCached('javascript'); // takes a long time\nanagramsCached('javascript'); // returns virtually instantly since it's now cached\nconsole.log(anagramsCached.cache); // The cached anagrams map"
         },
         "tags": [
           "function",
@@ -4316,7 +4316,7 @@
         ]
       },
       "meta": {
-        "hash": "106ad76871f109faca35b0b89f432d24f56b88127fcbf291da4993fc9e05a455"
+        "hash": "451dd1fad58f3d4984363426a0f77e9a26697f6be944d53ed82d32c71849280e"
       }
     },
     {
@@ -4327,9 +4327,9 @@
         "fileName": "merge.md",
         "text": "Creates a new object from the combination of two or more objects.\n\nUse `Array.prototype.reduce()` combined with `Object.keys(obj)` to iterate over all objects and keys.\nUse `hasOwnProperty()` and `Array.prototype.concat()` to append values for keys existing in multiple objects.\n\n",
         "codeBlocks": {
-          "es6": "const merge = (...objs) =>\r\n  [...objs].reduce(\r\n    (acc, obj) =>\r\n      Object.keys(obj).reduce((a, k) => {\r\n        acc[k] = acc.hasOwnProperty(k) ? [].concat(acc[k]).concat(obj[k]) : obj[k];\r\n        return acc;\r\n      }, {}),\r\n    {}\r\n  );",
+          "es6": "const merge = (...objs) =>\n  [...objs].reduce(\n    (acc, obj) =>\n      Object.keys(obj).reduce((a, k) => {\n        acc[k] = acc.hasOwnProperty(k) ? [].concat(acc[k]).concat(obj[k]) : obj[k];\n        return acc;\n      }, {}),\n    {}\n  );",
           "es5": "var merge = function merge() {\n  for (var _len = arguments.length, objs = new Array(_len), _key = 0; _key < _len; _key++) {\n    objs[_key] = arguments[_key];\n  }\n\n  return [].concat(objs).reduce(function (acc, obj) {\n    return Object.keys(obj).reduce(function (a, k) {\n      acc[k] = acc.hasOwnProperty(k) ? [].concat(acc[k]).concat(obj[k]) : obj[k];\n      return acc;\n    }, {});\n  }, {});\n};",
-          "example": "const object = {\r\n  a: [{ x: 2 }, { y: 4 }],\r\n  b: 1\r\n};\r\nconst other = {\r\n  a: { z: 3 },\r\n  b: [2, 3],\r\n  c: 'foo'\r\n};\r\nmerge(object, other); // { a: [ { x: 2 }, { y: 4 }, { z: 3 } ], b: [ 1, 2, 3 ], c: 'foo' }"
+          "example": "const object = {\n  a: [{ x: 2 }, { y: 4 }],\n  b: 1\n};\nconst other = {\n  a: { z: 3 },\n  b: [2, 3],\n  c: 'foo'\n};\nmerge(object, other); // { a: [ { x: 2 }, { y: 4 }, { z: 3 } ], b: [ 1, 2, 3 ], c: 'foo' }"
         },
         "tags": [
           "object",
@@ -4338,7 +4338,7 @@
         ]
       },
       "meta": {
-        "hash": "4a493ba755b98d89d8dd2a08023fed53d9b3a958f531789a1073ab026b58652d"
+        "hash": "cda4db6e9da35706f6e4b13f2860a210433c8bc2ac6078f9ff63aef6771c72d3"
       }
     },
     {
@@ -4351,7 +4351,7 @@
         "codeBlocks": {
           "es6": "const midpoint = ([x1, y1], [x2, y2]) => [(x1 + x2) / 2, (y1 + y2) / 2];",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar midpoint = function midpoint(_ref, _ref2) {\n  var _ref3 = _slicedToArray(_ref, 2),\n      x1 = _ref3[0],\n      y1 = _ref3[1];\n\n  var _ref4 = _slicedToArray(_ref2, 2),\n      x2 = _ref4[0],\n      y2 = _ref4[1];\n\n  return [(x1 + x2) / 2, (y1 + y2) / 2];\n};",
-          "example": "midpoint([2, 2], [4, 4]); // [3, 3]\r\nmidpoint([4, 4], [6, 6]); // [5, 5]\r\nmidpoint([1, 3], [2, 4]); // [1.5, 3.5]"
+          "example": "midpoint([2, 2], [4, 4]); // [3, 3]\nmidpoint([4, 4], [6, 6]); // [5, 5]\nmidpoint([1, 3], [2, 4]); // [1.5, 3.5]"
         },
         "tags": [
           "math",
@@ -4360,7 +4360,7 @@
         ]
       },
       "meta": {
-        "hash": "012f13ebfdac1cc570e775255b6001a349513dcefcb018ea072c2400c6dabb3f"
+        "hash": "f9db07575860cfcc7fc619788c33821d7adb390d44b68160d6e561bfe41f7316"
       }
     },
     {
@@ -4373,7 +4373,7 @@
         "codeBlocks": {
           "es6": "const minBy = (arr, fn) => Math.min(...arr.map(typeof fn === 'function' ? fn : val => val[fn]));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar minBy = function minBy(arr, fn) {\n  return Math.min.apply(Math, _toConsumableArray(arr.map(typeof fn === 'function' ? fn : function (val) {\n    return val[fn];\n  })));\n};",
-          "example": "minBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 2\r\nminBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 2"
+          "example": "minBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 2\nminBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 2"
         },
         "tags": [
           "math",
@@ -4383,7 +4383,7 @@
         ]
       },
       "meta": {
-        "hash": "a88d5c763dd4cd1bbaf842eefe8a01c02f8e214506e38aeeec056e8925727e7e"
+        "hash": "4c4ea74f666a35184db36bd5084614743446091a699086a5e5280ac2891be1c2"
       }
     },
     {
@@ -4396,7 +4396,7 @@
         "codeBlocks": {
           "es6": "const minDate = dates => new Date(Math.min(...dates));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar minDate = function minDate(dates) {\n  return new Date(Math.min.apply(Math, _toConsumableArray(dates)));\n};",
-          "example": "const array = [\r\n  new Date(2017, 4, 13),\r\n  new Date(2018, 2, 12),\r\n  new Date(2016, 0, 10),\r\n  new Date(2016, 0, 9)\r\n];\r\nminDate(array); // 2016-01-08T22:00:00.000Z"
+          "example": "const array = [\n  new Date(2017, 4, 13),\n  new Date(2018, 2, 12),\n  new Date(2016, 0, 10),\n  new Date(2016, 0, 9)\n];\nminDate(array); // 2016-01-08T22:00:00.000Z"
         },
         "tags": [
           "date",
@@ -4405,7 +4405,7 @@
         ]
       },
       "meta": {
-        "hash": "e6e87f621d9bd69294a345c9470d963ebf798b0eeff3cc0ee666cb3cec829f9f"
+        "hash": "cf59c98e2fc56230399d301d1e3645dd5961389c5c361d763e4a5fce01d22db2"
       }
     },
     {
@@ -4418,7 +4418,7 @@
         "codeBlocks": {
           "es6": "const minN = (arr, n = 1) => [...arr].sort((a, b) => a - b).slice(0, n);",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar minN = function minN(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return _toConsumableArray(arr).sort(function (a, b) {\n    return a - b;\n  }).slice(0, n);\n};",
-          "example": "minN([1, 2, 3]); // [1]\r\nminN([1, 2, 3], 2); // [1,2]"
+          "example": "minN([1, 2, 3]); // [1]\nminN([1, 2, 3], 2); // [1,2]"
         },
         "tags": [
           "array",
@@ -4427,7 +4427,7 @@
         ]
       },
       "meta": {
-        "hash": "402f5830b4ba4b1323e12f394d666c301f57e7f960a6ab4b47a31e20226c367e"
+        "hash": "65bcfbbf3937f35f591285306ec3bfbee46a1738a6a8f097c99bf07150aec198"
       }
     },
     {
@@ -4438,9 +4438,9 @@
         "fileName": "mostPerformant.md",
         "text": "Returns the index of the function in an array of functions which executed the fastest.\n\nUse `Array.prototype.map()` to generate an array where each value is the total time taken to execute the function after `iterations` times. Use the difference in `performance.now()` values before and after to get the total time in milliseconds to a high degree of accuracy.\nUse `Math.min()` to find the minimum execution time, and return the index of that shortest time which corresponds to the index of the most performant function.\nOmit the second argument, `iterations`, to use a default of 10,000 iterations. The more iterations, the more reliable the result but the longer it will take.\n\n",
         "codeBlocks": {
-          "es6": "const mostPerformant = (fns, iterations = 10000) => {\r\n  const times = fns.map(fn => {\r\n    const before = performance.now();\r\n    for (let i = 0; i < iterations; i++) fn();\r\n    return performance.now() - before;\r\n  });\r\n  return times.indexOf(Math.min(...times));\r\n};",
+          "es6": "const mostPerformant = (fns, iterations = 10000) => {\n  const times = fns.map(fn => {\n    const before = performance.now();\n    for (let i = 0; i < iterations; i++) fn();\n    return performance.now() - before;\n  });\n  return times.indexOf(Math.min(...times));\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar mostPerformant = function mostPerformant(fns) {\n  var iterations = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 10000;\n  var times = fns.map(function (fn) {\n    var before = performance.now();\n\n    for (var i = 0; i < iterations; i++) {\n      fn();\n    }\n\n    return performance.now() - before;\n  });\n  return times.indexOf(Math.min.apply(Math, _toConsumableArray(times)));\n};",
-          "example": "mostPerformant([\r\n  () => {\r\n    // Loops through the entire array before returning `false`\r\n    [1, 2, 3, 4, 5, 6, 7, 8, 9, '10'].every(el => typeof el === 'number');\r\n  },\r\n  () => {\r\n    // Only needs to reach index `1` before returning false\r\n    [1, '2', 3, 4, 5, 6, 7, 8, 9, 10].every(el => typeof el === 'number');\r\n  }\r\n]); // 1"
+          "example": "mostPerformant([\n  () => {\n    // Loops through the entire array before returning `false`\n    [1, 2, 3, 4, 5, 6, 7, 8, 9, '10'].every(el => typeof el === 'number');\n  },\n  () => {\n    // Only needs to reach index `1` before returning false\n    [1, '2', 3, 4, 5, 6, 7, 8, 9, 10].every(el => typeof el === 'number');\n  }\n]); // 1"
         },
         "tags": [
           "utility",
@@ -4448,7 +4448,7 @@
         ]
       },
       "meta": {
-        "hash": "b1554b67cbb52506396dd9a73afa120a12e7d6bfa931d47be25dd54b236d47e1"
+        "hash": "120e31fa38796906a99beccdc457e83a8075e6ec72b5a937e03913b2e996ae26"
       }
     },
     {
@@ -4469,7 +4469,7 @@
         ]
       },
       "meta": {
-        "hash": "94d40de94d757fb0871782c64062dee9a5e85d412d8c897ff1f172eae29749ae"
+        "hash": "20deb11c89b14b294b13f9846fde62e4a9ac8df0a71553509431b16b5c88d24a"
       }
     },
     {
@@ -4480,9 +4480,9 @@
         "fileName": "nest.md",
         "text": "Given a flat array of objects linked to one another, it will nest them recursively.\nUseful for nesting comments, such as the ones on reddit.com.\n\nUse recursion.\nUse `Array.prototype.filter()` to filter the items where the `id` matches the `link`, then `Array.prototype.map()` to map each one to a new object that has a `children` property which recursively nests the items based on which ones are children of the current item.\nOmit the second argument, `id`, to default to `null` which indicates the object is not linked to another one (i.e. it is a top level object).\nOmit the third argument, `link`, to use `'parent_id'` as the default property which links the object to another one by its `id`.\n\n",
         "codeBlocks": {
-          "es6": "const nest = (items, id = null, link = 'parent_id') =>\r\n  items\r\n    .filter(item => item[link] === id)\r\n    .map(item => ({ ...item, children: nest(items, item.id) }));",
+          "es6": "const nest = (items, id = null, link = 'parent_id') =>\n  items\n    .filter(item => item[link] === id)\n    .map(item => ({ ...item, children: nest(items, item.id) }));",
           "es5": "function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(source).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar nest = function nest(items) {\n  var id = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n  var link = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'parent_id';\n  return items.filter(function (item) {\n    return item[link] === id;\n  }).map(function (item) {\n    return _objectSpread({}, item, {\n      children: nest(items, item.id)\n    });\n  });\n};",
-          "example": "// One top level comment\r\nconst comments = [\r\n  { id: 1, parent_id: null },\r\n  { id: 2, parent_id: 1 },\r\n  { id: 3, parent_id: 1 },\r\n  { id: 4, parent_id: 2 },\r\n  { id: 5, parent_id: 4 }\r\n];\r\nconst nestedComments = nest(comments); // [{ id: 1, parent_id: null, children: [...] }]"
+          "example": "// One top level comment\nconst comments = [\n  { id: 1, parent_id: null },\n  { id: 2, parent_id: 1 },\n  { id: 3, parent_id: 1 },\n  { id: 4, parent_id: 2 },\n  { id: 5, parent_id: 4 }\n];\nconst nestedComments = nest(comments); // [{ id: 1, parent_id: null, children: [...] }]"
         },
         "tags": [
           "object",
@@ -4490,7 +4490,7 @@
         ]
       },
       "meta": {
-        "hash": "0a86c558a550204d92db07a291dcbb0795476fcadfbea5c9494c16b0b14e193e"
+        "hash": "6133ec3409b8c18ccfc89d857149c7875eb4733803772b43743df3b7c51bd02c"
       }
     },
     {
@@ -4512,7 +4512,7 @@
         ]
       },
       "meta": {
-        "hash": "532864b242c1686e53b8195220ff16296bf232b826338e37aada325ffb180824"
+        "hash": "3c4f99f0a0b9d2103e7ed3553bf7268475135603aa46d2eae204d3f34fe51ffd"
       }
     },
     {
@@ -4525,7 +4525,7 @@
         "codeBlocks": {
           "es6": "const none = (arr, fn = Boolean) => !arr.some(fn);",
           "es5": "var none = function none(arr) {\n  var fn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : Boolean;\n  return !arr.some(fn);\n};",
-          "example": "none([0, 1, 3, 0], x => x == 2); // true\r\nnone([0, 0, 0]); // true"
+          "example": "none([0, 1, 3, 0], x => x == 2); // true\nnone([0, 0, 0]); // true"
         },
         "tags": [
           "array",
@@ -4534,7 +4534,7 @@
         ]
       },
       "meta": {
-        "hash": "06b3572f9804d2eeede2d13f9f17427e7e8430c92be6e99581af3c1fb37bdd78"
+        "hash": "a11f7bdacee4978a1cc579091b04a912962a239dc7bd442518420a4d39c290d5"
       }
     },
     {
@@ -4547,7 +4547,7 @@
         "codeBlocks": {
           "es6": "const nthArg = n => (...args) => args.slice(n)[0];",
           "es5": "var nthArg = function nthArg(n) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return args.slice(n)[0];\n  };\n};",
-          "example": "const third = nthArg(2);\r\nthird(1, 2, 3); // 3\r\nthird(1, 2); // undefined\r\nconst last = nthArg(-1);\r\nlast(1, 2, 3, 4, 5); // 5"
+          "example": "const third = nthArg(2);\nthird(1, 2, 3); // 3\nthird(1, 2); // undefined\nconst last = nthArg(-1);\nlast(1, 2, 3, 4, 5); // 5"
         },
         "tags": [
           "utility",
@@ -4556,7 +4556,7 @@
         ]
       },
       "meta": {
-        "hash": "354a5582a041aa94bacc5aa7f086972261abd23748d7256b25350e3db89cb1b8"
+        "hash": "1885078f5fddc5de00844a837ab3c427f770c5325a70d5362ecab26c1c904125"
       }
     },
     {
@@ -4569,7 +4569,7 @@
         "codeBlocks": {
           "es6": "const nthElement = (arr, n = 0) => (n === -1 ? arr.slice(n) : arr.slice(n, n + 1))[0];",
           "es5": "var nthElement = function nthElement(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  return (n === -1 ? arr.slice(n) : arr.slice(n, n + 1))[0];\n};",
-          "example": "nthElement(['a', 'b', 'c'], 1); // 'b'\r\nnthElement(['a', 'b', 'b'], -3); // 'a'"
+          "example": "nthElement(['a', 'b', 'c'], 1); // 'b'\nnthElement(['a', 'b', 'b'], -3); // 'a'"
         },
         "tags": [
           "array",
@@ -4577,7 +4577,7 @@
         ]
       },
       "meta": {
-        "hash": "626a0a363fc568fa738e5f39b12b9e70a0683ab564a94b957e827265a5f219ea"
+        "hash": "51af30db5952a0473fe9ae72c338b974a88813cbca522ba56d0dc3b4ec6fc51c"
       }
     },
     {
@@ -4599,7 +4599,7 @@
         ]
       },
       "meta": {
-        "hash": "49fe52aac2183f2166ddf62026f8f9a1247a328ebec1d362135a745efc5d8f90"
+        "hash": "99537507288f1e101bfc0f80ba708b415832b27ce060033fbba8bdfc32cc3cea"
       }
     },
     {
@@ -4621,7 +4621,7 @@
         ]
       },
       "meta": {
-        "hash": "87b356d66c3e46065b562ba3bf3ea66e10461d1e5ea7f2cb31c188f2d8863ef9"
+        "hash": "ed97cd30b8004ca41939fabebf535f9017868b261ded4c2081c3367fa0ab1847"
       }
     },
     {
@@ -4632,9 +4632,9 @@
         "fileName": "observeMutations.md",
         "text": "Returns a new MutationObserver and runs the provided callback for each mutation on the specified element.\n\nUse a [`MutationObserver`](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver) to observe mutations on the given element.\nUse `Array.prototype.forEach()` to run the callback for each mutation that is observed.\nOmit the third argument, `options`, to use the default [options](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver#MutationObserverInit) (all `true`).\n\n",
         "codeBlocks": {
-          "es6": "const observeMutations = (element, callback, options) => {\r\n  const observer = new MutationObserver(mutations => mutations.forEach(m => callback(m)));\r\n  observer.observe(\r\n    element,\r\n    Object.assign(\r\n      {\r\n        childList: true,\r\n        attributes: true,\r\n        attributeOldValue: true,\r\n        characterData: true,\r\n        characterDataOldValue: true,\r\n        subtree: true\r\n      },\r\n      options\r\n    )\r\n  );\r\n  return observer;\r\n};",
+          "es6": "const observeMutations = (element, callback, options) => {\n  const observer = new MutationObserver(mutations => mutations.forEach(m => callback(m)));\n  observer.observe(\n    element,\n    Object.assign(\n      {\n        childList: true,\n        attributes: true,\n        attributeOldValue: true,\n        characterData: true,\n        characterDataOldValue: true,\n        subtree: true\n      },\n      options\n    )\n  );\n  return observer;\n};",
           "es5": "var observeMutations = function observeMutations(element, callback, options) {\n  var observer = new MutationObserver(function (mutations) {\n    return mutations.forEach(function (m) {\n      return callback(m);\n    });\n  });\n  observer.observe(element, Object.assign({\n    childList: true,\n    attributes: true,\n    attributeOldValue: true,\n    characterData: true,\n    characterDataOldValue: true,\n    subtree: true\n  }, options));\n  return observer;\n};",
-          "example": "const obs = observeMutations(document, console.log); // Logs all mutations that happen on the page\r\nobs.disconnect(); // Disconnects the observer and stops logging mutations on the page"
+          "example": "const obs = observeMutations(document, console.log); // Logs all mutations that happen on the page\nobs.disconnect(); // Disconnects the observer and stops logging mutations on the page"
         },
         "tags": [
           "browser",
@@ -4643,7 +4643,7 @@
         ]
       },
       "meta": {
-        "hash": "f0c906b0a872d14cf474756a86a646443580c005a947da8d0af9e48932589317"
+        "hash": "98673c6d6bebe907c0ac285f342147f30de01bc326feb5109b6d25739fe473aa"
       }
     },
     {
@@ -4656,7 +4656,7 @@
         "codeBlocks": {
           "es6": "const off = (el, evt, fn, opts = false) => el.removeEventListener(evt, fn, opts);",
           "es5": "var off = function off(el, evt, fn) {\n  var opts = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;\n  return el.removeEventListener(evt, fn, opts);\n};",
-          "example": "const fn = () => console.log('!');\r\ndocument.body.addEventListener('click', fn);\r\noff(document.body, 'click', fn); // no longer logs '!' upon clicking on the page"
+          "example": "const fn = () => console.log('!');\ndocument.body.addEventListener('click', fn);\noff(document.body, 'click', fn); // no longer logs '!' upon clicking on the page"
         },
         "tags": [
           "browser",
@@ -4665,7 +4665,7 @@
         ]
       },
       "meta": {
-        "hash": "d2635dd38b8e45cb4d5ee367946c3fc42c8889889e4a2476e2ab3bf43744e7c2"
+        "hash": "ab081473a5589edddab0b641758744ee5a65bf43cb93eeca23f48e86e0fdbb9c"
       }
     },
     {
@@ -4678,7 +4678,7 @@
         "codeBlocks": {
           "es6": "const offset = (arr, offset) => [...arr.slice(offset), ...arr.slice(0, offset)];",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar offset = function offset(arr, _offset) {\n  return [].concat(_toConsumableArray(arr.slice(_offset)), _toConsumableArray(arr.slice(0, _offset)));\n};",
-          "example": "offset([1, 2, 3, 4, 5], 2); // [3, 4, 5, 1, 2]\r\noffset([1, 2, 3, 4, 5], -2); // [4, 5, 1, 2, 3]"
+          "example": "offset([1, 2, 3, 4, 5], 2); // [3, 4, 5, 1, 2]\noffset([1, 2, 3, 4, 5], -2); // [4, 5, 1, 2, 3]"
         },
         "tags": [
           "array",
@@ -4686,7 +4686,7 @@
         ]
       },
       "meta": {
-        "hash": "66fd11461785a61039569a74c4a105364cb3e955d1b3cae3a16c016f965c5936"
+        "hash": "87cd3d6c458b2ecbb373645230a03c7e0770ca3991c635571ffaae5d7a40987c"
       }
     },
     {
@@ -4697,7 +4697,7 @@
         "fileName": "omit.md",
         "text": "Omits the key-value pairs corresponding to the given keys from an object.\n\nUse `Object.keys(obj)`, `Array.prototype.filter()` and `Array.prototype.includes()` to remove the provided keys.\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.\n\n",
         "codeBlocks": {
-          "es6": "const omit = (obj, arr) =>\r\n  Object.keys(obj)\r\n    .filter(k => !arr.includes(k))\r\n    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});",
+          "es6": "const omit = (obj, arr) =>\n  Object.keys(obj)\n    .filter(k => !arr.includes(k))\n    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});",
           "es5": "var omit = function omit(obj, arr) {\n  return Object.keys(obj).filter(function (k) {\n    return !arr.includes(k);\n  }).reduce(function (acc, key) {\n    return acc[key] = obj[key], acc;\n  }, {});\n};",
           "example": "omit({ a: 1, b: '2', c: 3 }, ['b']); // { 'a': 1, 'c': 3 }"
         },
@@ -4708,7 +4708,7 @@
         ]
       },
       "meta": {
-        "hash": "e017fc7333fc1e16280cb0a9f228f910f960be016b754b6a10793bd9b782c44e"
+        "hash": "64c941025c6bf130b6b6639427cf64c8af5759734118efbbbec9e8d490845a10"
       }
     },
     {
@@ -4719,7 +4719,7 @@
         "fileName": "omitBy.md",
         "text": "Creates an object composed of the properties the given function returns falsy for. The function is invoked with two arguments: (value, key).\n\nUse `Object.keys(obj)` and `Array.prototype.filter()`to remove the keys for which `fn` returns a truthy value.\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.\n\n",
         "codeBlocks": {
-          "es6": "const omitBy = (obj, fn) =>\r\n  Object.keys(obj)\r\n    .filter(k => !fn(obj[k], k))\r\n    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});",
+          "es6": "const omitBy = (obj, fn) =>\n  Object.keys(obj)\n    .filter(k => !fn(obj[k], k))\n    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});",
           "es5": "var omitBy = function omitBy(obj, fn) {\n  return Object.keys(obj).filter(function (k) {\n    return !fn(obj[k], k);\n  }).reduce(function (acc, key) {\n    return acc[key] = obj[key], acc;\n  }, {});\n};",
           "example": "omitBy({ a: 1, b: '2', c: 3 }, x => typeof x === 'number'); // { b: '2' }"
         },
@@ -4731,7 +4731,7 @@
         ]
       },
       "meta": {
-        "hash": "aeb8920f3322ac49ce025d921514de914e7559d235e3842a34108e07c9f2b551"
+        "hash": "2119b62768ca88da15cef3bb1671c65a557d81f224c846bdaa6a75d320577366"
       }
     },
     {
@@ -4742,9 +4742,9 @@
         "fileName": "on.md",
         "text": "Adds an event listener to an element with the ability to use event delegation.\n\nUse `EventTarget.addEventListener()` to add an event listener to an element. If there is a `target` property supplied to the options object, ensure the event target matches the target specified and then invoke the callback by supplying the correct `this` context.\nReturns a reference to the custom delegator function, in order to be possible to use with [`off`](#off).\nOmit `opts` to default to non-delegation behavior and event bubbling.\n\n",
         "codeBlocks": {
-          "es6": "const on = (el, evt, fn, opts = {}) => {\r\n  const delegatorFn = e => e.target.matches(opts.target) && fn.call(e.target, e);\r\n  el.addEventListener(evt, opts.target ? delegatorFn : fn, opts.options || false);\r\n  if (opts.target) return delegatorFn;\r\n};",
+          "es6": "const on = (el, evt, fn, opts = {}) => {\n  const delegatorFn = e => e.target.matches(opts.target) && fn.call(e.target, e);\n  el.addEventListener(evt, opts.target ? delegatorFn : fn, opts.options || false);\n  if (opts.target) return delegatorFn;\n};",
           "es5": "var on = function on(el, evt, fn) {\n  var opts = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n\n  var delegatorFn = function delegatorFn(e) {\n    return e.target.matches(opts.target) && fn.call(e.target, e);\n  };\n\n  el.addEventListener(evt, opts.target ? delegatorFn : fn, opts.options || false);\n  if (opts.target) return delegatorFn;\n};",
-          "example": "const fn = () => console.log('!');\r\non(document.body, 'click', fn); // logs '!' upon clicking the body\r\non(document.body, 'click', fn, { target: 'p' }); // logs '!' upon clicking a `p` element child of the body\r\non(document.body, 'click', fn, { options: true }); // use capturing instead of bubbling"
+          "example": "const fn = () => console.log('!');\non(document.body, 'click', fn); // logs '!' upon clicking the body\non(document.body, 'click', fn, { target: 'p' }); // logs '!' upon clicking a `p` element child of the body\non(document.body, 'click', fn, { options: true }); // use capturing instead of bubbling"
         },
         "tags": [
           "browser",
@@ -4753,7 +4753,7 @@
         ]
       },
       "meta": {
-        "hash": "0a44adda6ccfbf0d8831533d2bc52791c880975710e5af333bba928e06564eab"
+        "hash": "37b8c9323006f3eb66cbfbe240d5020ef0896e312e9f1ed949b200a767324877"
       }
     },
     {
@@ -4764,9 +4764,9 @@
         "fileName": "once.md",
         "text": "Ensures a function is called only once.\n\nUtilizing a closure, use a flag, `called`, and set it to `true` once the function is called for the first time, preventing it from being called again. In order to allow the function to have its `this` context changed (such as in an event listener), the `function` keyword must be used, and the supplied function must have the context applied.\nAllow the function to be supplied with an arbitrary number of arguments using the rest/spread (`...`) operator.\n\n",
         "codeBlocks": {
-          "es6": "const once = fn => {\r\n  let called = false;\r\n  return function(...args) {\r\n    if (called) return;\r\n    called = true;\r\n    return fn.apply(this, args);\r\n  };\r\n};",
+          "es6": "const once = fn => {\n  let called = false;\n  return function(...args) {\n    if (called) return;\n    called = true;\n    return fn.apply(this, args);\n  };\n};",
           "es5": "var once = function once(fn) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return fn.apply(this, args);\n  };\n};",
-          "example": "const startApp = function(event) {\r\n  console.log(this, event); // document.body, MouseEvent\r\n};\r\ndocument.body.addEventListener('click', once(startApp)); // only runs `startApp` once upon click"
+          "example": "const startApp = function(event) {\n  console.log(this, event); // document.body, MouseEvent\n};\ndocument.body.addEventListener('click', once(startApp)); // only runs `startApp` once upon click"
         },
         "tags": [
           "function",
@@ -4774,7 +4774,7 @@
         ]
       },
       "meta": {
-        "hash": "207f55af7db8c445e754dcf7e03d45f10cdff2a22ebd4a0b684e5514b2902704"
+        "hash": "61603245edccd32edad26ecdbf39d3c8d99bde8d2672a1a392508ca9c30c6d22"
       }
     },
     {
@@ -4785,9 +4785,9 @@
         "fileName": "onUserInputChange.md",
         "text": "Run the callback whenever the user input type changes (`mouse` or `touch`). Useful for enabling/disabling code depending on the input device. This process is dynamic and works with hybrid devices (e.g. touchscreen laptops).\n\nUse two event listeners. Assume `mouse` input initially and bind a `touchstart` event listener to the document. \nOn `touchstart`, add a `mousemove` event listener to listen for two consecutive `mousemove` events firing within 20ms, using `performance.now()`.\nRun the callback with the input type as an argument in either of these situations.\n\n",
         "codeBlocks": {
-          "es6": "const onUserInputChange = callback => {\r\n  let type = 'mouse',\r\n    lastTime = 0;\r\n  const mousemoveHandler = () => {\r\n    const now = performance.now();\r\n    if (now - lastTime < 20)\r\n      (type = 'mouse'), callback(type), document.removeEventListener('mousemove', mousemoveHandler);\r\n    lastTime = now;\r\n  };\r\n  document.addEventListener('touchstart', () => {\r\n    if (type === 'touch') return;\r\n    (type = 'touch'), callback(type), document.addEventListener('mousemove', mousemoveHandler);\r\n  });\r\n};",
+          "es6": "const onUserInputChange = callback => {\n  let type = 'mouse',\n    lastTime = 0;\n  const mousemoveHandler = () => {\n    const now = performance.now();\n    if (now - lastTime < 20)\n      (type = 'mouse'), callback(type), document.removeEventListener('mousemove', mousemoveHandler);\n    lastTime = now;\n  };\n  document.addEventListener('touchstart', () => {\n    if (type === 'touch') return;\n    (type = 'touch'), callback(type), document.addEventListener('mousemove', mousemoveHandler);\n  });\n};",
           "es5": "var onUserInputChange = function onUserInputChange(callback) {\n  var type = 'mouse',\n      lastTime = 0;\n\n  var mousemoveHandler = function mousemoveHandler() {\n    var now = performance.now();\n    if (now - lastTime < 20) type = 'mouse', callback(type), document.removeEventListener('mousemove', mousemoveHandler);\n    lastTime = now;\n  };\n\n  document.addEventListener('touchstart', function () {\n    if (type === 'touch') return;\n    type = 'touch', callback(type), document.addEventListener('mousemove', mousemoveHandler);\n  });\n};",
-          "example": "onUserInputChange(type => {\r\n  console.log('The user is now using', type, 'as an input method.');\r\n});"
+          "example": "onUserInputChange(type => {\n  console.log('The user is now using', type, 'as an input method.');\n});"
         },
         "tags": [
           "browser",
@@ -4796,7 +4796,7 @@
         ]
       },
       "meta": {
-        "hash": "6a0a26b90aff163b4bce7f9e4ca69fbeb49971a13183da00907cb4a3e2fe4312"
+        "hash": "f12c78c23280839489bf4dfae847eeab3ceb72fef326b5bca3f2ed1bdcc44ee3"
       }
     },
     {
@@ -4807,9 +4807,9 @@
         "fileName": "orderBy.md",
         "text": "Returns a sorted array of objects ordered by properties and orders.\n\nUses `Array.prototype.sort()`, `Array.prototype.reduce()` on the `props` array with a default value of `0`, use array destructuring to swap the properties position depending on the order passed.\nIf no `orders` array is passed it sort by `'asc'` by default.\n\n",
         "codeBlocks": {
-          "es6": "const orderBy = (arr, props, orders) =>\r\n  [...arr].sort((a, b) =>\r\n    props.reduce((acc, prop, i) => {\r\n      if (acc === 0) {\r\n        const [p1, p2] = orders && orders[i] === 'desc' ? [b[prop], a[prop]] : [a[prop], b[prop]];\r\n        acc = p1 > p2 ? 1 : p1 < p2 ? -1 : 0;\r\n      }\r\n      return acc;\r\n    }, 0)\r\n  );",
+          "es6": "const orderBy = (arr, props, orders) =>\n  [...arr].sort((a, b) =>\n    props.reduce((acc, prop, i) => {\n      if (acc === 0) {\n        const [p1, p2] = orders && orders[i] === 'desc' ? [b[prop], a[prop]] : [a[prop], b[prop]];\n        acc = p1 > p2 ? 1 : p1 < p2 ? -1 : 0;\n      }\n      return acc;\n    }, 0)\n  );",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nfunction _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar orderBy = function orderBy(arr, props, orders) {\n  return _toConsumableArray(arr).sort(function (a, b) {\n    return props.reduce(function (acc, prop, i) {\n      if (acc === 0) {\n        var _ref = orders && orders[i] === 'desc' ? [b[prop], a[prop]] : [a[prop], b[prop]],\n            _ref2 = _slicedToArray(_ref, 2),\n            p1 = _ref2[0],\n            p2 = _ref2[1];\n\n        acc = p1 > p2 ? 1 : p1 < p2 ? -1 : 0;\n      }\n\n      return acc;\n    }, 0);\n  });\n};",
-          "example": "const users = [{ name: 'fred', age: 48 }, { name: 'barney', age: 36 }, { name: 'fred', age: 40 }];\r\norderBy(users, ['name', 'age'], ['asc', 'desc']); // [{name: 'barney', age: 36}, {name: 'fred', age: 48}, {name: 'fred', age: 40}]\r\norderBy(users, ['name', 'age']); // [{name: 'barney', age: 36}, {name: 'fred', age: 40}, {name: 'fred', age: 48}]"
+          "example": "const users = [{ name: 'fred', age: 48 }, { name: 'barney', age: 36 }, { name: 'fred', age: 40 }];\norderBy(users, ['name', 'age'], ['asc', 'desc']); // [{name: 'barney', age: 36}, {name: 'fred', age: 48}, {name: 'fred', age: 40}]\norderBy(users, ['name', 'age']); // [{name: 'barney', age: 36}, {name: 'fred', age: 40}, {name: 'fred', age: 48}]"
         },
         "tags": [
           "object",
@@ -4818,7 +4818,7 @@
         ]
       },
       "meta": {
-        "hash": "3f4ae691f4ba13abcf54388e2897eb67852320ab339d349bf0077d0d44c331c1"
+        "hash": "a53f86761dacc7d0bc184c304dd2e59461a393d45214212d17d02a8df94144b0"
       }
     },
     {
@@ -4831,7 +4831,7 @@
         "codeBlocks": {
           "es6": "const over = (...fns) => (...args) => fns.map(fn => fn.apply(null, args));",
           "es5": "var over = function over() {\n  for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n    fns[_key] = arguments[_key];\n  }\n\n  return function () {\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return fns.map(function (fn) {\n      return fn.apply(null, args);\n    });\n  };\n};",
-          "example": "const minMax = over(Math.min, Math.max);\r\nminMax(1, 2, 3, 4, 5); // [1,5]"
+          "example": "const minMax = over(Math.min, Math.max);\nminMax(1, 2, 3, 4, 5); // [1,5]"
         },
         "tags": [
           "adapter",
@@ -4840,7 +4840,7 @@
         ]
       },
       "meta": {
-        "hash": "9992a09f3d2ac7aa90d182e87f6fcb3a194683121013aa09e8a165623496db97"
+        "hash": "ac660685eb10f64c7e573d0299936ae0bb562e531b2f3a76b048e3bbe9605bcc"
       }
     },
     {
@@ -4853,7 +4853,7 @@
         "codeBlocks": {
           "es6": "const overArgs = (fn, transforms) => (...args) => fn(...args.map((val, i) => transforms[i](val)));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar overArgs = function overArgs(fn, transforms) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return fn.apply(void 0, _toConsumableArray(args.map(function (val, i) {\n      return transforms[i](val);\n    })));\n  };\n};",
-          "example": "const square = n => n * n;\r\nconst double = n => n * 2;\r\nconst fn = overArgs((x, y) => [x, y], [square, double]);\r\nfn(9, 3); // [81, 6]"
+          "example": "const square = n => n * n;\nconst double = n => n * 2;\nconst fn = overArgs((x, y) => [x, y], [square, double]);\nfn(9, 3); // [81, 6]"
         },
         "tags": [
           "adapter",
@@ -4862,7 +4862,7 @@
         ]
       },
       "meta": {
-        "hash": "91fc50c63b8230ee4f6d007c5d8f323a20c11ccb13c27651023175a266b8ba6d"
+        "hash": "8aa05f5b221bb24bb52cf3b75b6087ca664ede628a8cfff2b3193ebe67f6b2e7"
       }
     },
     {
@@ -4873,9 +4873,9 @@
         "fileName": "pad.md",
         "text": "Pads a string on both sides with the specified character, if it's shorter than the specified length.\n\nUse `String.padStart()` and `String.padEnd()` to pad both sides of the given string.\nOmit the third argument, `char`, to use the whitespace character as the default padding character.\n\n",
         "codeBlocks": {
-          "es6": "const pad = (str, length, char = ' ') =>\r\n  str.padStart((str.length + length) / 2, char).padEnd(length, char);",
+          "es6": "const pad = (str, length, char = ' ') =>\n  str.padStart((str.length + length) / 2, char).padEnd(length, char);",
           "es5": "var pad = function pad(str, length) {\n  var _char = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : ' ';\n\n  return str.padStart((str.length + length) / 2, _char).padEnd(length, _char);\n};",
-          "example": "pad('cat', 8); // '  cat   '\r\npad(String(42), 6, '0'); // '004200'\r\npad('foobar', 3); // 'foobar'"
+          "example": "pad('cat', 8); // '  cat   '\npad(String(42), 6, '0'); // '004200'\npad('foobar', 3); // 'foobar'"
         },
         "tags": [
           "string",
@@ -4883,7 +4883,7 @@
         ]
       },
       "meta": {
-        "hash": "942e782f93c1c3e465fc62c6f0bf003c8b5956952c767b784a0c723a3f8e6365"
+        "hash": "04a1e9e83ff8bb138a86e7bb060a19de2593bc4054ce48cfef511eec1052edbe"
       }
     },
     {
@@ -4894,7 +4894,7 @@
         "fileName": "palindrome.md",
         "text": "Returns `true` if the given string is a palindrome, `false` otherwise.\n\nConvert the string to `String.prototype.toLowerCase()` and use `String.prototype.replace()` to remove non-alphanumeric characters from it.\nThen, use the spread operator (`...`) to split the string into individual characters, `Array.prototype.reverse()`, `String.prototype.join('')` and compare it to the original, unreversed string, after converting it to `String.prototype.toLowerCase()`.\n\n",
         "codeBlocks": {
-          "es6": "const palindrome = str => {\r\n  const s = str.toLowerCase().replace(/[\\W_]/g, '');\r\n  return s === [...s].reverse().join('');\r\n};",
+          "es6": "const palindrome = str => {\n  const s = str.toLowerCase().replace(/[\\W_]/g, '');\n  return s === [...s].reverse().join('');\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar palindrome = function palindrome(str) {\n  var s = str.toLowerCase().replace(/[\\W_]/g, '');\n  return s === _toConsumableArray(s).reverse().join('');\n};",
           "example": "palindrome('taco cat'); // true"
         },
@@ -4904,7 +4904,7 @@
         ]
       },
       "meta": {
-        "hash": "c74f0cc1ad16d08f328893f8ec5a0517d4aa2a047025a4b334b6f75bb5209ccb"
+        "hash": "1cb29029bb6d17d5ab853b7f932e39e56639d294d732eff00d621fcffb24adb3"
       }
     },
     {
@@ -4915,7 +4915,7 @@
         "fileName": "parseCookie.md",
         "text": "Parse an HTTP Cookie header string and return an object of all cookie name-value pairs.\n\nUse `String.prototype.split(';')` to separate key-value pairs from each other.\nUse `Array.prototype.map()` and `String.prototype.split('=')` to separate keys from values in each pair.\nUse `Array.prototype.reduce()` and `decodeURIComponent()` to create an object with all key-value pairs.\n\n",
         "codeBlocks": {
-          "es6": "const parseCookie = str =>\r\n  str\r\n    .split(';')\r\n    .map(v => v.split('='))\r\n    .reduce((acc, v) => {\r\n      acc[decodeURIComponent(v[0].trim())] = decodeURIComponent(v[1].trim());\r\n      return acc;\r\n    }, {});",
+          "es6": "const parseCookie = str =>\n  str\n    .split(';')\n    .map(v => v.split('='))\n    .reduce((acc, v) => {\n      acc[decodeURIComponent(v[0].trim())] = decodeURIComponent(v[1].trim());\n      return acc;\n    }, {});",
           "es5": "var parseCookie = function parseCookie(str) {\n  return str.split(';').map(function (v) {\n    return v.split('=');\n  }).reduce(function (acc, v) {\n    acc[decodeURIComponent(v[0].trim())] = decodeURIComponent(v[1].trim());\n    return acc;\n  }, {});\n};",
           "example": "parseCookie('foo=bar; equation=E%3Dmc%5E2'); // { foo: 'bar', equation: 'E=mc^2' }"
         },
@@ -4926,7 +4926,7 @@
         ]
       },
       "meta": {
-        "hash": "3cb5372f26fdeb702119314674734dde44d3152b5c2cd04376ec89c3b9f2146e"
+        "hash": "c25aef075df93042a81bd98ebd7b77aefb91df3f08b9f1d2e7859ec0d95ad55b"
       }
     },
     {
@@ -4939,7 +4939,7 @@
         "codeBlocks": {
           "es6": "const partial = (fn, ...partials) => (...args) => fn(...partials, ...args);",
           "es5": "var partial = function partial(fn) {\n  for (var _len = arguments.length, partials = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    partials[_key - 1] = arguments[_key];\n  }\n\n  return function () {\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return fn.apply(void 0, partials.concat(args));\n  };\n};",
-          "example": "const greet = (greeting, name) => greeting + ' ' + name + '!';\r\nconst greetHello = partial(greet, 'Hello');\r\ngreetHello('John'); // 'Hello John!'"
+          "example": "const greet = (greeting, name) => greeting + ' ' + name + '!';\nconst greetHello = partial(greet, 'Hello');\ngreetHello('John'); // 'Hello John!'"
         },
         "tags": [
           "function",
@@ -4947,7 +4947,7 @@
         ]
       },
       "meta": {
-        "hash": "b023646e12856690040c14b2a68dcc0748d8821f13b9a213e6e5c36da105c5f1"
+        "hash": "fc0a07189064e1026c5a350923b1aa833523c2755eef1d66f9567a15caeebdf8"
       }
     },
     {
@@ -4960,7 +4960,7 @@
         "codeBlocks": {
           "es6": "const partialRight = (fn, ...partials) => (...args) => fn(...args, ...partials);",
           "es5": "var partialRight = function partialRight(fn) {\n  for (var _len = arguments.length, partials = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    partials[_key - 1] = arguments[_key];\n  }\n\n  return function () {\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return fn.apply(void 0, args.concat(partials));\n  };\n};",
-          "example": "const greet = (greeting, name) => greeting + ' ' + name + '!';\r\nconst greetJohn = partialRight(greet, 'John');\r\ngreetJohn('Hello'); // 'Hello John!'"
+          "example": "const greet = (greeting, name) => greeting + ' ' + name + '!';\nconst greetJohn = partialRight(greet, 'John');\ngreetJohn('Hello'); // 'Hello John!'"
         },
         "tags": [
           "function",
@@ -4968,7 +4968,7 @@
         ]
       },
       "meta": {
-        "hash": "efac2221f3e2fc82c5e1eecebd08b1a89ae19982c353a9e5002af729ce45c1b0"
+        "hash": "4d3cd9630e00f8c723b8321f1c17d17c4c7d0b7ad025dbafda492897b8300a24"
       }
     },
     {
@@ -4979,9 +4979,9 @@
         "fileName": "partition.md",
         "text": "Groups the elements into two arrays, depending on the provided function's truthiness for each element.\n\nUse `Array.prototype.reduce()` to create an array of two arrays.\nUse `Array.prototype.push()` to add elements for which `fn` returns `true` to the first array and elements for which `fn` returns `false` to the second one.\n\n",
         "codeBlocks": {
-          "es6": "const partition = (arr, fn) =>\r\n  arr.reduce(\r\n    (acc, val, i, arr) => {\r\n      acc[fn(val, i, arr) ? 0 : 1].push(val);\r\n      return acc;\r\n    },\r\n    [[], []]\r\n  );",
+          "es6": "const partition = (arr, fn) =>\n  arr.reduce(\n    (acc, val, i, arr) => {\n      acc[fn(val, i, arr) ? 0 : 1].push(val);\n      return acc;\n    },\n    [[], []]\n  );",
           "es5": "var partition = function partition(arr, fn) {\n  return arr.reduce(function (acc, val, i, arr) {\n    acc[fn(val, i, arr) ? 0 : 1].push(val);\n    return acc;\n  }, [[], []]);\n};",
-          "example": "const users = [{ user: 'barney', age: 36, active: false }, { user: 'fred', age: 40, active: true }];\r\npartition(users, o => o.active); // [[{ 'user': 'fred',    'age': 40, 'active': true }],[{ 'user': 'barney',  'age': 36, 'active': false }]]"
+          "example": "const users = [{ user: 'barney', age: 36, active: false }, { user: 'fred', age: 40, active: true }];\npartition(users, o => o.active); // [[{ 'user': 'fred',    'age': 40, 'active': true }],[{ 'user': 'barney',  'age': 36, 'active': false }]]"
         },
         "tags": [
           "array",
@@ -4991,7 +4991,7 @@
         ]
       },
       "meta": {
-        "hash": "a7e93f1fcfea5d9bb1f28889a05c023b5d7ab77d8f9d1ceaefb607c5a6e320ed"
+        "hash": "fdaa6d4470e5bb113a2c20008652bf0030d23fbee789ca6c3c4ce0c9be9ae700"
       }
     },
     {
@@ -5002,7 +5002,7 @@
         "fileName": "percentile.md",
         "text": "Uses the percentile formula to calculate how many numbers in the given array are less or equal to the given value.\n\nUse `Array.prototype.reduce()` to calculate how many numbers are below the value and how many are the same value and apply the percentile formula.\n\n",
         "codeBlocks": {
-          "es6": "const percentile = (arr, val) =>\r\n  (100 * arr.reduce((acc, v) => acc + (v < val ? 1 : 0) + (v === val ? 0.5 : 0), 0)) / arr.length;",
+          "es6": "const percentile = (arr, val) =>\n  (100 * arr.reduce((acc, v) => acc + (v < val ? 1 : 0) + (v === val ? 0.5 : 0), 0)) / arr.length;",
           "es5": "var percentile = function percentile(arr, val) {\n  return 100 * arr.reduce(function (acc, v) {\n    return acc + (v < val ? 1 : 0) + (v === val ? 0.5 : 0);\n  }, 0) / arr.length;\n};",
           "example": "percentile([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 6); // 55"
         },
@@ -5012,7 +5012,7 @@
         ]
       },
       "meta": {
-        "hash": "e1ab4e8cd76fb8b5a17d5994be97a77294b2225f711b72f19d294c8e76a8a6c4"
+        "hash": "6fb26c1c3157de2309d5fe08354345d9bd18d175cc29e049cc5f19363f7ed374"
       }
     },
     {
@@ -5023,7 +5023,7 @@
         "fileName": "permutations.md",
         "text": "⚠️ **WARNING**: This function's execution time increases exponentially with each array element. Anything more than 8 to 10 entries will cause your browser to hang as it tries to solve all the different combinations.\n\nGenerates all permutations of an array's elements (contains duplicates).\n\nUse recursion.\nFor each element in the given array, create all the partial permutations for the rest of its elements.\nUse `Array.prototype.map()` to combine the element with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\nBase cases are for array `length` equal to `2` or `1`.\n\n",
         "codeBlocks": {
-          "es6": "const permutations = arr => {\r\n  if (arr.length <= 2) return arr.length === 2 ? [arr, [arr[1], arr[0]]] : arr;\r\n  return arr.reduce(\r\n    (acc, item, i) =>\r\n      acc.concat(\r\n        permutations([...arr.slice(0, i), ...arr.slice(i + 1)]).map(val => [item, ...val])\r\n      ),\r\n    []\r\n  );\r\n};",
+          "es6": "const permutations = arr => {\n  if (arr.length <= 2) return arr.length === 2 ? [arr, [arr[1], arr[0]]] : arr;\n  return arr.reduce(\n    (acc, item, i) =>\n      acc.concat(\n        permutations([...arr.slice(0, i), ...arr.slice(i + 1)]).map(val => [item, ...val])\n      ),\n    []\n  );\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar permutations = function permutations(arr) {\n  if (arr.length <= 2) return arr.length === 2 ? [arr, [arr[1], arr[0]]] : arr;\n  return arr.reduce(function (acc, item, i) {\n    return acc.concat(permutations([].concat(_toConsumableArray(arr.slice(0, i)), _toConsumableArray(arr.slice(i + 1)))).map(function (val) {\n      return [item].concat(_toConsumableArray(val));\n    }));\n  }, []);\n};",
           "example": "permutations([1, 33, 5]); // [ [ 1, 33, 5 ], [ 1, 5, 33 ], [ 33, 1, 5 ], [ 33, 5, 1 ], [ 5, 1, 33 ], [ 5, 33, 1 ] ]"
         },
@@ -5034,7 +5034,7 @@
         ]
       },
       "meta": {
-        "hash": "a39a1384d20d1b7d7766981739e048873e2397038f2ae4022c627c2507394306"
+        "hash": "11c74727c481c0067421afa2864b55b2a40291916ff92529542f572da0e8b8b5"
       }
     },
     {
@@ -5045,7 +5045,7 @@
         "fileName": "pick.md",
         "text": "Picks the key-value pairs corresponding to the given keys from an object.\n\nUse `Array.prototype.reduce()` to convert the filtered/picked keys back to an object with the corresponding key-value pairs if the key exists in the object.\n\n",
         "codeBlocks": {
-          "es6": "const pick = (obj, arr) =>\r\n  arr.reduce((acc, curr) => (curr in obj && (acc[curr] = obj[curr]), acc), {});",
+          "es6": "const pick = (obj, arr) =>\n  arr.reduce((acc, curr) => (curr in obj && (acc[curr] = obj[curr]), acc), {});",
           "es5": "var pick = function pick(obj, arr) {\n  return arr.reduce(function (acc, curr) {\n    return curr in obj && (acc[curr] = obj[curr]), acc;\n  }, {});\n};",
           "example": "pick({ a: 1, b: '2', c: 3 }, ['a', 'c']); // { 'a': 1, 'c': 3 }"
         },
@@ -5056,7 +5056,7 @@
         ]
       },
       "meta": {
-        "hash": "689fb9ba264351fe0262bb13c67a7d01fa1b77421e4903eaf9c8694df629b4f5"
+        "hash": "d8d3bc54bdc1ba649c052658a09ddd415ad88a30409d13489b32684c150cb799"
       }
     },
     {
@@ -5067,7 +5067,7 @@
         "fileName": "pickBy.md",
         "text": "Creates an object composed of the properties the given function returns truthy for. The function is invoked with two arguments: (value, key).\n\nUse `Object.keys(obj)` and `Array.prototype.filter()`to remove the keys for which `fn` returns a falsy value.\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.\n\n",
         "codeBlocks": {
-          "es6": "const pickBy = (obj, fn) =>\r\n  Object.keys(obj)\r\n    .filter(k => fn(obj[k], k))\r\n    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});",
+          "es6": "const pickBy = (obj, fn) =>\n  Object.keys(obj)\n    .filter(k => fn(obj[k], k))\n    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});",
           "es5": "var pickBy = function pickBy(obj, fn) {\n  return Object.keys(obj).filter(function (k) {\n    return fn(obj[k], k);\n  }).reduce(function (acc, key) {\n    return acc[key] = obj[key], acc;\n  }, {});\n};",
           "example": "pickBy({ a: 1, b: '2', c: 3 }, x => typeof x === 'number'); // { 'a': 1, 'c': 3 }"
         },
@@ -5079,7 +5079,7 @@
         ]
       },
       "meta": {
-        "hash": "801e06861fb1a79d5f9de2d575a8321c8ab3f22ce3732cce2a4d1e1a49efb580"
+        "hash": "19851ac642bb32dcc56042f8e4f15184b293e300bd818a07573b8e23d1a1d06e"
       }
     },
     {
@@ -5092,7 +5092,7 @@
         "codeBlocks": {
           "es6": "const pipeAsyncFunctions = (...fns) => arg => fns.reduce((p, f) => p.then(f), Promise.resolve(arg));",
           "es5": "var pipeAsyncFunctions = function pipeAsyncFunctions() {\n  for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n    fns[_key] = arguments[_key];\n  }\n\n  return function (arg) {\n    return fns.reduce(function (p, f) {\n      return p.then(f);\n    }, Promise.resolve(arg));\n  };\n};",
-          "example": "const sum = pipeAsyncFunctions(\r\n  x => x + 1,\r\n  x => new Promise(resolve => setTimeout(() => resolve(x + 2), 1000)),\r\n  x => x + 3,\r\n  async x => (await x) + 4\r\n);\r\n(async() => {\r\n  console.log(await sum(5)); // 15 (after one second)\r\n})();"
+          "example": "const sum = pipeAsyncFunctions(\n  x => x + 1,\n  x => new Promise(resolve => setTimeout(() => resolve(x + 2), 1000)),\n  x => x + 3,\n  async x => (await x) + 4\n);\n(async () => {\n  console.log(await sum(5)); // 15 (after one second)\n})();"
         },
         "tags": [
           "adapter",
@@ -5102,7 +5102,7 @@
         ]
       },
       "meta": {
-        "hash": "2ae867ee87d3921269cbe771886c349f981c325a69af8fe3e1b62a40d1e9f475"
+        "hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
       }
     },
     {
@@ -5115,7 +5115,7 @@
         "codeBlocks": {
           "es6": "const pipeFunctions = (...fns) => fns.reduce((f, g) => (...args) => g(f(...args)));",
           "es5": "var pipeFunctions = function pipeFunctions() {\n  for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n    fns[_key] = arguments[_key];\n  }\n\n  return fns.reduce(function (f, g) {\n    return function () {\n      return g(f.apply(void 0, arguments));\n    };\n  });\n};",
-          "example": "const add5 = x => x + 5;\r\nconst multiply = (x, y) => x * y;\r\nconst multiplyAndAdd5 = pipeFunctions(multiply, add5);\r\nmultiplyAndAdd5(5, 2); // 15"
+          "example": "const add5 = x => x + 5;\nconst multiply = (x, y) => x * y;\nconst multiplyAndAdd5 = pipeFunctions(multiply, add5);\nmultiplyAndAdd5(5, 2); // 15"
         },
         "tags": [
           "adapter",
@@ -5124,7 +5124,7 @@
         ]
       },
       "meta": {
-        "hash": "e095b9c8a733b1eea87323c354ec9880d79e6e3238d9164fb9111bfee11a62e2"
+        "hash": "dbdae1e05f13477865039be627fcd258943cbf2d7926e160de74a3ab5244dba1"
       }
     },
     {
@@ -5135,9 +5135,9 @@
         "fileName": "pluralize.md",
         "text": "Returns the singular or plural form of the word based on the input number. If the first argument is an `object`, it will use a closure by returning a function that can auto-pluralize words that don't simply end in `s` if the supplied dictionary contains the word.\n\nIf `num` is either `-1` or `1`, return the singular form of the word. If `num` is any other number, return the plural form. Omit the third argument to use the default of the singular word + `s`, or supply a custom pluralized word when necessary. If the first argument is an `object`, utilize a closure by returning a function which can use the supplied dictionary to resolve the correct plural form of the word.\n\n",
         "codeBlocks": {
-          "es6": "const pluralize = (val, word, plural = word + 's') => {\r\n  const _pluralize = (num, word, plural = word + 's') =>\r\n    [1, -1].includes(Number(num)) ? word : plural;\r\n  if (typeof val === 'object') return (num, word) => _pluralize(num, word, val[word]);\r\n  return _pluralize(val, word, plural);\r\n};",
+          "es6": "const pluralize = (val, word, plural = word + 's') => {\n  const _pluralize = (num, word, plural = word + 's') =>\n    [1, -1].includes(Number(num)) ? word : plural;\n  if (typeof val === 'object') return (num, word) => _pluralize(num, word, val[word]);\n  return _pluralize(val, word, plural);\n};",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar pluralize = function pluralize(val, word) {\n  var plural = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : word + 's';\n\n  var _pluralize = function _pluralize(num, word) {\n    var plural = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : word + 's';\n    return [1, -1].includes(Number(num)) ? word : plural;\n  };\n\n  if (_typeof(val) === 'object') return function (num, word) {\n    return _pluralize(num, word, val[word]);\n  };\n  return _pluralize(val, word, plural);\n};",
-          "example": "pluralize(0, 'apple'); // 'apples'\r\npluralize(1, 'apple'); // 'apple'\r\npluralize(2, 'apple'); // 'apples'\r\npluralize(2, 'person', 'people'); // 'people'\r\n\r\nconst PLURALS = {\r\n  person: 'people',\r\n  radius: 'radii'\r\n};\r\nconst autoPluralize = pluralize(PLURALS);\r\nautoPluralize(2, 'person'); // 'people'"
+          "example": "pluralize(0, 'apple'); // 'apples'\npluralize(1, 'apple'); // 'apple'\npluralize(2, 'apple'); // 'apples'\npluralize(2, 'person', 'people'); // 'people'\n\nconst PLURALS = {\n  person: 'people',\n  radius: 'radii'\n};\nconst autoPluralize = pluralize(PLURALS);\nautoPluralize(2, 'person'); // 'people'"
         },
         "tags": [
           "string",
@@ -5145,7 +5145,7 @@
         ]
       },
       "meta": {
-        "hash": "4793f68754b84bd85197d5577fc7fb4eb431946cf438a0c25e3e7f317aecd1c0"
+        "hash": "3bcd52927608bd59de8e20369fbd51f39b99d77b19f66de4de8bbc80140ea009"
       }
     },
     {
@@ -5166,7 +5166,7 @@
         ]
       },
       "meta": {
-        "hash": "24ae58cf3c2095792cd7cbe72cf548ee05c032e5b7a2173a57d80f79f143407a"
+        "hash": "b19b526319caff44e7b15c3126128701dedaa76b74cedb50761003268676b5b6"
       }
     },
     {
@@ -5177,7 +5177,7 @@
         "fileName": "prefix.md",
         "text": "Returns the prefixed version (if necessary) of a CSS property that the browser supports.\n\nUse `Array.prototype.findIndex()` on an array of vendor prefix strings to test if `document.body` has one of them defined in its `CSSStyleDeclaration` object, otherwise return `null`.\nUse `String.prototype.charAt()` and `String.prototype.toUpperCase()` to capitalize the property, which will be appended to the vendor prefix string.\n\n",
         "codeBlocks": {
-          "es6": "const prefix = prop => {\r\n  const capitalizedProp = prop.charAt(0).toUpperCase() + prop.slice(1);\r\n  const prefixes = ['', 'webkit', 'moz', 'ms', 'o'];\r\n  const i = prefixes.findIndex(\r\n    prefix => typeof document.body.style[prefix ? prefix + capitalizedProp : prop] !== 'undefined'\r\n  );\r\n  return i !== -1 ? (i === 0 ? prop : prefixes[i] + capitalizedProp) : null;\r\n};",
+          "es6": "const prefix = prop => {\n  const capitalizedProp = prop.charAt(0).toUpperCase() + prop.slice(1);\n  const prefixes = ['', 'webkit', 'moz', 'ms', 'o'];\n  const i = prefixes.findIndex(\n    prefix => typeof document.body.style[prefix ? prefix + capitalizedProp : prop] !== 'undefined'\n  );\n  return i !== -1 ? (i === 0 ? prop : prefixes[i] + capitalizedProp) : null;\n};",
           "es5": "var prefix = function prefix(prop) {\n  var capitalizedProp = prop.charAt(0).toUpperCase() + prop.slice(1);\n  var prefixes = ['', 'webkit', 'moz', 'ms', 'o'];\n  var i = prefixes.findIndex(function (prefix) {\n    return typeof document.body.style[prefix ? prefix + capitalizedProp : prop] !== 'undefined';\n  });\n  return i !== -1 ? i === 0 ? prop : prefixes[i] + capitalizedProp : null;\n};",
           "example": "prefix('appearance'); // 'appearance' on a supported browser, otherwise 'webkitAppearance', 'mozAppearance', 'msAppearance' or 'oAppearance'"
         },
@@ -5188,7 +5188,7 @@
         ]
       },
       "meta": {
-        "hash": "0e954472a648809ebb2ae7682bc2b2b68feda1198176fd27362ea6b2336643cb"
+        "hash": "6668f37f9f1158b2bdd292ad64defea6e33a0b2908ea1e494b191dcaa9f039d6"
       }
     },
     {
@@ -5199,9 +5199,9 @@
         "fileName": "prettyBytes.md",
         "text": "Converts a number in bytes to a human-readable string.\n\nUse an array dictionary of units to be accessed based on the exponent.\nUse `Number.toPrecision()` to truncate the number to a certain number of digits.\nReturn the prettified string by building it up, taking into account the supplied options and whether it is negative or not.\nOmit the second argument, `precision`, to use a default precision of `3` digits.\nOmit the third argument, `addSpace`, to add space between the number and unit by default.\n\n",
         "codeBlocks": {
-          "es6": "const prettyBytes = (num, precision = 3, addSpace = true) => {\r\n  const UNITS = ['B', 'KB', 'MB', 'GB', 'TB', 'PB', 'EB', 'ZB', 'YB'];\r\n  if (Math.abs(num) < 1) return num + (addSpace ? ' ' : '') + UNITS[0];\r\n  const exponent = Math.min(Math.floor(Math.log10(num < 0 ? -num : num) / 3), UNITS.length - 1);\r\n  const n = Number(((num < 0 ? -num : num) / 1000 ** exponent).toPrecision(precision));\r\n  return (num < 0 ? '-' : '') + n + (addSpace ? ' ' : '') + UNITS[exponent];\r\n};",
+          "es6": "const prettyBytes = (num, precision = 3, addSpace = true) => {\n  const UNITS = ['B', 'KB', 'MB', 'GB', 'TB', 'PB', 'EB', 'ZB', 'YB'];\n  if (Math.abs(num) < 1) return num + (addSpace ? ' ' : '') + UNITS[0];\n  const exponent = Math.min(Math.floor(Math.log10(num < 0 ? -num : num) / 3), UNITS.length - 1);\n  const n = Number(((num < 0 ? -num : num) / 1000 ** exponent).toPrecision(precision));\n  return (num < 0 ? '-' : '') + n + (addSpace ? ' ' : '') + UNITS[exponent];\n};",
           "es5": "var prettyBytes = function prettyBytes(num) {\n  var precision = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 3;\n  var addSpace = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n  var UNITS = ['B', 'KB', 'MB', 'GB', 'TB', 'PB', 'EB', 'ZB', 'YB'];\n  if (Math.abs(num) < 1) return num + (addSpace ? ' ' : '') + UNITS[0];\n  var exponent = Math.min(Math.floor(Math.log10(num < 0 ? -num : num) / 3), UNITS.length - 1);\n  var n = Number(((num < 0 ? -num : num) / Math.pow(1000, exponent)).toPrecision(precision));\n  return (num < 0 ? '-' : '') + n + (addSpace ? ' ' : '') + UNITS[exponent];\n};",
-          "example": "prettyBytes(1000); // \"1 KB\"\r\nprettyBytes(-27145424323.5821, 5); // \"-27.145 GB\"\r\nprettyBytes(123456789, 3, false); // \"123MB\""
+          "example": "prettyBytes(1000); // \"1 KB\"\nprettyBytes(-27145424323.5821, 5); // \"-27.145 GB\"\nprettyBytes(123456789, 3, false); // \"123MB\""
         },
         "tags": [
           "utility",
@@ -5211,7 +5211,7 @@
         ]
       },
       "meta": {
-        "hash": "21bea20f75370e46f646bd1ad042a6b998859b4fb92e2e85e526e2d8f31c1269"
+        "hash": "e752de4a4f2b339851e796a5289e7adde51cf7e672b8230fd97bf79cf7330758"
       }
     },
     {
@@ -5222,7 +5222,7 @@
         "fileName": "primes.md",
         "text": "Generates primes up to a given number, using the Sieve of Eratosthenes.\n\nGenerate an array from `2` to the given number. Use `Array.prototype.filter()` to filter out the values divisible by any number from `2` to the square root of the provided number.\n\n",
         "codeBlocks": {
-          "es6": "const primes = num => {\r\n  let arr = Array.from({ length: num - 1 }).map((x, i) => i + 2),\r\n    sqroot = Math.floor(Math.sqrt(num)),\r\n    numsTillSqroot = Array.from({ length: sqroot - 1 }).map((x, i) => i + 2);\r\n  numsTillSqroot.forEach(x => (arr = arr.filter(y => y % x !== 0 || y === x)));\r\n  return arr;\r\n};",
+          "es6": "const primes = num => {\n  let arr = Array.from({ length: num - 1 }).map((x, i) => i + 2),\n    sqroot = Math.floor(Math.sqrt(num)),\n    numsTillSqroot = Array.from({ length: sqroot - 1 }).map((x, i) => i + 2);\n  numsTillSqroot.forEach(x => (arr = arr.filter(y => y % x !== 0 || y === x)));\n  return arr;\n};",
           "es5": "var primes = function primes(num) {\n  var arr = Array.from({\n    length: num - 1\n  }).map(function (x, i) {\n    return i + 2;\n  }),\n      sqroot = Math.floor(Math.sqrt(num)),\n      numsTillSqroot = Array.from({\n    length: sqroot - 1\n  }).map(function (x, i) {\n    return i + 2;\n  });\n  numsTillSqroot.forEach(function (x) {\n    return arr = arr.filter(function (y) {\n      return y % x !== 0 || y === x;\n    });\n  });\n  return arr;\n};",
           "example": "primes(10); // [2,3,5,7]"
         },
@@ -5233,7 +5233,7 @@
         ]
       },
       "meta": {
-        "hash": "23239e0ae5818b195c8875702f9734c0172dffb7d6fa775b50252ece82da3a13"
+        "hash": "8c11b6647c91c22969f8c568cf248a9c3c5b08323fe9491c3fad2cbbce90a8ac"
       }
     },
     {
@@ -5244,9 +5244,9 @@
         "fileName": "promisify.md",
         "text": "Converts an asynchronous function to return a promise.\n\n*In Node 8+, you can use [`util.promisify`](https://nodejs.org/api/util.html#util_util_promisify_original)*\n\nUse currying to return a function returning a `Promise` that calls the original function.\nUse the `...rest` operator to pass in all the parameters.\n\n",
         "codeBlocks": {
-          "es6": "const promisify = func => (...args) =>\r\n  new Promise((resolve, reject) =>\r\n    func(...args, (err, result) => (err ? reject(err) : resolve(result)))\r\n  );",
+          "es6": "const promisify = func => (...args) =>\n  new Promise((resolve, reject) =>\n    func(...args, (err, result) => (err ? reject(err) : resolve(result)))\n  );",
           "es5": "var promisify = function promisify(func) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return new Promise(function (resolve, reject) {\n      return func.apply(void 0, args.concat([function (err, result) {\n        return err ? reject(err) : resolve(result);\n      }]));\n    });\n  };\n};",
-          "example": "const delay = promisify((d, cb) => setTimeout(cb, d));\r\ndelay(2000).then(() => console.log('Hi!')); // // Promise resolves after 2s"
+          "example": "const delay = promisify((d, cb) => setTimeout(cb, d));\ndelay(2000).then(() => console.log('Hi!')); // // Promise resolves after 2s"
         },
         "tags": [
           "adapter",
@@ -5256,7 +5256,7 @@
         ]
       },
       "meta": {
-        "hash": "55a211fb9ee3b4cac66a40ba66f9d7ea466181d16cfd049e80a3e7032d67bd02"
+        "hash": "a6fe92925d4c25fccd29ae85d1c2004f88c73222099091ce30824a917a2fcfa2"
       }
     },
     {
@@ -5267,9 +5267,9 @@
         "fileName": "pull.md",
         "text": "Mutates the original array to filter out the values specified.\n\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\nUse `Array.prototype.length = 0` to mutate the passed in an array by resetting it's length to zero and `Array.prototype.push()` to re-populate it with only the pulled values.\n\n",
         "codeBlocks": {
-          "es6": "const pull = (arr, ...args) => {\r\n  let argState = Array.isArray(args[0]) ? args[0] : args;\r\n  let pulled = arr.filter((v, i) => !argState.includes(v));\r\n  arr.length = 0;\r\n  pulled.forEach(v => arr.push(v));\r\n};",
+          "es6": "const pull = (arr, ...args) => {\n  let argState = Array.isArray(args[0]) ? args[0] : args;\n  let pulled = arr.filter((v, i) => !argState.includes(v));\n  arr.length = 0;\n  pulled.forEach(v => arr.push(v));\n};",
           "es5": "var pull = function pull(arr) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n\n  var argState = Array.isArray(args[0]) ? args[0] : args;\n  var pulled = arr.filter(function (v, i) {\n    return !argState.includes(v);\n  });\n  arr.length = 0;\n  pulled.forEach(function (v) {\n    return arr.push(v);\n  });\n};",
-          "example": "let myArray = ['a', 'b', 'c', 'a', 'b', 'c'];\r\npull(myArray, 'a', 'c'); // myArray = [ 'b', 'b' ]"
+          "example": "let myArray = ['a', 'b', 'c', 'a', 'b', 'c'];\npull(myArray, 'a', 'c'); // myArray = [ 'b', 'b' ]"
         },
         "tags": [
           "array",
@@ -5277,7 +5277,7 @@
         ]
       },
       "meta": {
-        "hash": "db7f0dd117a98eacfc835a644378736c21000fd65a9e49d0f95935eaca996d82"
+        "hash": "5d0655b4a4c1008dbfba8b4e59ae7144dde6ac98f2fcf0a60f4d80135d8feeba"
       }
     },
     {
@@ -5288,9 +5288,9 @@
         "fileName": "pullAtIndex.md",
         "text": "Mutates the original array to filter out the values at the specified indexes.\n\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\nUse `Array.prototype.length = 0` to mutate the passed in an array by resetting it's length to zero and `Array.prototype.push()` to re-populate it with only the pulled values.\nUse `Array.prototype.push()` to keep track of pulled values\n\n",
         "codeBlocks": {
-          "es6": "const pullAtIndex = (arr, pullArr) => {\r\n  let removed = [];\r\n  let pulled = arr\r\n    .map((v, i) => (pullArr.includes(i) ? removed.push(v) : v))\r\n    .filter((v, i) => !pullArr.includes(i));\r\n  arr.length = 0;\r\n  pulled.forEach(v => arr.push(v));\r\n  return removed;\r\n};",
+          "es6": "const pullAtIndex = (arr, pullArr) => {\n  let removed = [];\n  let pulled = arr\n    .map((v, i) => (pullArr.includes(i) ? removed.push(v) : v))\n    .filter((v, i) => !pullArr.includes(i));\n  arr.length = 0;\n  pulled.forEach(v => arr.push(v));\n  return removed;\n};",
           "es5": "var pullAtIndex = function pullAtIndex(arr, pullArr) {\n  var removed = [];\n  var pulled = arr.map(function (v, i) {\n    return pullArr.includes(i) ? removed.push(v) : v;\n  }).filter(function (v, i) {\n    return !pullArr.includes(i);\n  });\n  arr.length = 0;\n  pulled.forEach(function (v) {\n    return arr.push(v);\n  });\n  return removed;\n};",
-          "example": "let myArray = ['a', 'b', 'c', 'd'];\r\nlet pulled = pullAtIndex(myArray, [1, 3]); // myArray = [ 'a', 'c' ] , pulled = [ 'b', 'd' ]"
+          "example": "let myArray = ['a', 'b', 'c', 'd'];\nlet pulled = pullAtIndex(myArray, [1, 3]); // myArray = [ 'a', 'c' ] , pulled = [ 'b', 'd' ]"
         },
         "tags": [
           "array",
@@ -5298,7 +5298,7 @@
         ]
       },
       "meta": {
-        "hash": "51e01a10797899a31b9071ac1834a01f8c911d1a0d5e97dae8873a9fc7df3bb8"
+        "hash": "dacbce5a4a058056f0c33a7975c4bdb586037223f6713d2d27379c9cb2eb93cd"
       }
     },
     {
@@ -5309,9 +5309,9 @@
         "fileName": "pullAtValue.md",
         "text": "Mutates the original array to filter out the values specified. Returns the removed elements.\n\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\nUse `Array.prototype.length = 0` to mutate the passed in an array by resetting it's length to zero and `Array.prototype.push()` to re-populate it with only the pulled values.\nUse `Array.prototype.push()` to keep track of pulled values\n\n",
         "codeBlocks": {
-          "es6": "const pullAtValue = (arr, pullArr) => {\r\n  let removed = [],\r\n    pushToRemove = arr.forEach((v, i) => (pullArr.includes(v) ? removed.push(v) : v)),\r\n    mutateTo = arr.filter((v, i) => !pullArr.includes(v));\r\n  arr.length = 0;\r\n  mutateTo.forEach(v => arr.push(v));\r\n  return removed;\r\n};",
+          "es6": "const pullAtValue = (arr, pullArr) => {\n  let removed = [],\n    pushToRemove = arr.forEach((v, i) => (pullArr.includes(v) ? removed.push(v) : v)),\n    mutateTo = arr.filter((v, i) => !pullArr.includes(v));\n  arr.length = 0;\n  mutateTo.forEach(v => arr.push(v));\n  return removed;\n};",
           "es5": "var pullAtValue = function pullAtValue(arr, pullArr) {\n  var removed = [],\n      pushToRemove = arr.forEach(function (v, i) {\n    return pullArr.includes(v) ? removed.push(v) : v;\n  }),\n      mutateTo = arr.filter(function (v, i) {\n    return !pullArr.includes(v);\n  });\n  arr.length = 0;\n  mutateTo.forEach(function (v) {\n    return arr.push(v);\n  });\n  return removed;\n};",
-          "example": "let myArray = ['a', 'b', 'c', 'd'];\r\nlet pulled = pullAtValue(myArray, ['b', 'd']); // myArray = [ 'a', 'c' ] , pulled = [ 'b', 'd' ]"
+          "example": "let myArray = ['a', 'b', 'c', 'd'];\nlet pulled = pullAtValue(myArray, ['b', 'd']); // myArray = [ 'a', 'c' ] , pulled = [ 'b', 'd' ]"
         },
         "tags": [
           "array",
@@ -5319,7 +5319,7 @@
         ]
       },
       "meta": {
-        "hash": "ff9c2d529aac684e1be07e85e0b038a15976fd4110988c38ea5dba88623a4abb"
+        "hash": "760685e275cac5e2b81b035cfd4799eb8e39483d56d5a483a0a04e19bf46a29d"
       }
     },
     {
@@ -5330,9 +5330,9 @@
         "fileName": "pullBy.md",
         "text": "Mutates the original array to filter out the values specified, based on a given iterator function.\n\nCheck if the last argument provided in a function.\nUse `Array.prototype.map()` to apply the iterator function `fn` to all array elements.\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\nUse `Array.prototype.length = 0` to mutate the passed in an array by resetting it's length to zero and `Array.prototype.push()` to re-populate it with only the pulled values.\n\n",
         "codeBlocks": {
-          "es6": "const pullBy = (arr, ...args) => {\r\n  const length = args.length;\r\n  let fn = length > 1 ? args[length - 1] : undefined;\r\n  fn = typeof fn == 'function' ? (args.pop(), fn) : undefined;\r\n  let argState = (Array.isArray(args[0]) ? args[0] : args).map(val => fn(val));\r\n  let pulled = arr.filter((v, i) => !argState.includes(fn(v)));\r\n  arr.length = 0;\r\n  pulled.forEach(v => arr.push(v));\r\n};",
+          "es6": "const pullBy = (arr, ...args) => {\n  const length = args.length;\n  let fn = length > 1 ? args[length - 1] : undefined;\n  fn = typeof fn == 'function' ? (args.pop(), fn) : undefined;\n  let argState = (Array.isArray(args[0]) ? args[0] : args).map(val => fn(val));\n  let pulled = arr.filter((v, i) => !argState.includes(fn(v)));\n  arr.length = 0;\n  pulled.forEach(v => arr.push(v));\n};",
           "es5": "var pullBy = function pullBy(arr) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n\n  var length = args.length;\n  var fn = length > 1 ? args[length - 1] : undefined;\n  fn = typeof fn == 'function' ? (args.pop(), fn) : undefined;\n  var argState = (Array.isArray(args[0]) ? args[0] : args).map(function (val) {\n    return fn(val);\n  });\n  var pulled = arr.filter(function (v, i) {\n    return !argState.includes(fn(v));\n  });\n  arr.length = 0;\n  pulled.forEach(function (v) {\n    return arr.push(v);\n  });\n};",
-          "example": "var myArray = [{ x: 1 }, { x: 2 }, { x: 3 }, { x: 1 }];\r\npullBy(myArray, [{ x: 1 }, { x: 3 }], o => o.x); // myArray = [{ x: 2 }]"
+          "example": "var myArray = [{ x: 1 }, { x: 2 }, { x: 3 }, { x: 1 }];\npullBy(myArray, [{ x: 1 }, { x: 3 }], o => o.x); // myArray = [{ x: 2 }]"
         },
         "tags": [
           "array",
@@ -5341,7 +5341,7 @@
         ]
       },
       "meta": {
-        "hash": "491d9a1bbb209f949e584cb5c7cadd8f569c43320aa8b01ad41df6462e371104"
+        "hash": "5166b5b5b9812d42c50364953ceb2311cafad66eb8881f21ec7d949396e6effb"
       }
     },
     {
@@ -5362,7 +5362,7 @@
         ]
       },
       "meta": {
-        "hash": "95f0387709679bedde35b88cd1a01c6735f5396484b6335b3013280824454f82"
+        "hash": "1a510a46746f7ea0eafcdc6a06eec78da731788311ef42a70e3a42c2a4080f60"
       }
     },
     {
@@ -5373,7 +5373,7 @@
         "fileName": "randomHexColorCode.md",
         "text": "Generates a random hexadecimal color code.\n\nUse `Math.random` to generate a random 24-bit(6x4bits) hexadecimal number. Use bit shifting and then convert it to an hexadecimal String using `toString(16)`.\n\n",
         "codeBlocks": {
-          "es6": "const randomHexColorCode = () => {\r\n  let n = (Math.random() * 0xfffff * 1000000).toString(16);\r\n  return '#' + n.slice(0, 6);\r\n};",
+          "es6": "const randomHexColorCode = () => {\n  let n = (Math.random() * 0xfffff * 1000000).toString(16);\n  return '#' + n.slice(0, 6);\n};",
           "es5": "var randomHexColorCode = function randomHexColorCode() {\n  var n = (Math.random() * 0xfffff * 1000000).toString(16);\n  return '#' + n.slice(0, 6);\n};",
           "example": "randomHexColorCode(); // \"#e34155\""
         },
@@ -5384,7 +5384,7 @@
         ]
       },
       "meta": {
-        "hash": "e4d04f46463e015d57a5de2ee979a4a44c5dc4d443ed3f6de41cd60542cf3189"
+        "hash": "42788f8392f5511db3641dbe2ab92b2c043b3b5209e95c386c73e5d96eaa63af"
       }
     },
     {
@@ -5395,7 +5395,7 @@
         "fileName": "randomIntArrayInRange.md",
         "text": "Returns an array of n random integers in the specified range.\n\nUse `Array.from()` to create an empty array of the specific length, `Math.random()` to generate a random number and map it to the desired range, using `Math.floor()` to make it an integer.\n\n",
         "codeBlocks": {
-          "es6": "const randomIntArrayInRange = (min, max, n = 1) =>\r\n  Array.from({ length: n }, () => Math.floor(Math.random() * (max - min + 1)) + min);",
+          "es6": "const randomIntArrayInRange = (min, max, n = 1) =>\n  Array.from({ length: n }, () => Math.floor(Math.random() * (max - min + 1)) + min);",
           "es5": "var randomIntArrayInRange = function randomIntArrayInRange(min, max) {\n  var n = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;\n  return Array.from({\n    length: n\n  }, function () {\n    return Math.floor(Math.random() * (max - min + 1)) + min;\n  });\n};",
           "example": "randomIntArrayInRange(12, 35, 10); // [ 34, 14, 27, 17, 30, 27, 20, 26, 21, 14 ]"
         },
@@ -5407,7 +5407,7 @@
         ]
       },
       "meta": {
-        "hash": "a591d8b52d3fda503e8363c0822d1fece87b3738f74a11135489e3442fba3f03"
+        "hash": "7bff02cd849d994da1229f3153cca71b4c054d6774ab732101a5f60a0a04ba3a"
       }
     },
     {
@@ -5430,7 +5430,7 @@
         ]
       },
       "meta": {
-        "hash": "085e5c5ff68151cddf7feb04929c7522e78a6f7008c74089daa821e2f845aa60"
+        "hash": "8d8cca3d593e677c8a4ffc17e9f97b3018f800e7c014daa3462edc152fbbeec7"
       }
     },
     {
@@ -5453,7 +5453,7 @@
         ]
       },
       "meta": {
-        "hash": "3ca3cc3b6bae804c2184cd3548791bd4e3fa701ecf904a46e6982e813e255362"
+        "hash": "c86e3227e32565afb301805798da3a46756e13bff0115b880fcc3175a58d95af"
       }
     },
     {
@@ -5464,9 +5464,9 @@
         "fileName": "readFileLines.md",
         "text": "Returns an array of lines from the specified file.\n\nUse `readFileSync` function in `fs` node package to create a `Buffer` from a file.\nconvert buffer to string using `toString(encoding)` function.\ncreating an array from contents of file by `split`ing file content line by line (each `\\n`).\n\n",
         "codeBlocks": {
-          "es6": "const fs = require('fs');\r\nconst readFileLines = filename =>\r\n  fs\r\n    .readFileSync(filename)\r\n    .toString('UTF8')\r\n    .split('\\n');",
+          "es6": "const fs = require('fs');\nconst readFileLines = filename =>\n  fs\n    .readFileSync(filename)\n    .toString('UTF8')\n    .split('\\n');",
           "es5": "var fs = require('fs');\n\nvar readFileLines = function readFileLines(filename) {\n  return fs.readFileSync(filename).toString('UTF8').split('\\n');\n};",
-          "example": "/*\r\ncontents of test.txt :\r\n  line1\r\n  line2\r\n  line3\r\n  ___________________________\r\n*/\r\nlet arr = readFileLines('test.txt');\r\nconsole.log(arr); // ['line1', 'line2', 'line3']"
+          "example": "/*\ncontents of test.txt :\n  line1\n  line2\n  line3\n  ___________________________\n*/\nlet arr = readFileLines('test.txt');\nconsole.log(arr); // ['line1', 'line2', 'line3']"
         },
         "tags": [
           "node",
@@ -5476,7 +5476,7 @@
         ]
       },
       "meta": {
-        "hash": "3324e2a4ba6ec4d6064ef486bf7dcf72bc52ce46222b0e9580d9c16c06ad26d9"
+        "hash": "d84f789a1b8a11d0fa4daf8e5f015e9839340adfefbc210e2304de8d63649f9e"
       }
     },
     {
@@ -5489,7 +5489,7 @@
         "codeBlocks": {
           "es6": "const rearg = (fn, indexes) => (...args) => fn(...indexes.map(i => args[i]));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar rearg = function rearg(fn, indexes) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return fn.apply(void 0, _toConsumableArray(indexes.map(function (i) {\n      return args[i];\n    })));\n  };\n};",
-          "example": "var rearged = rearg(\r\n  function(a, b, c) {\r\n    return [a, b, c];\r\n  },\r\n  [2, 0, 1]\r\n);\r\nrearged('b', 'c', 'a'); // ['a', 'b', 'c']"
+          "example": "var rearged = rearg(\n  function(a, b, c) {\n    return [a, b, c];\n  },\n  [2, 0, 1]\n);\nrearged('b', 'c', 'a'); // ['a', 'b', 'c']"
         },
         "tags": [
           "adapter",
@@ -5498,7 +5498,7 @@
         ]
       },
       "meta": {
-        "hash": "933193aefe648a9269c542b816e28171aaf042f32ee6b045c157ba1e20e6cfa1"
+        "hash": "5f2f2e33d269de787a1aaa245c6324030cc5cbe8345b46352a218f3f2453c220"
       }
     },
     {
@@ -5509,9 +5509,9 @@
         "fileName": "recordAnimationFrames.md",
         "text": "Invokes the provided callback on each animation frame.\n\nUse recursion. \nProvided that `running` is `true`, continue invoking `window.requestAnimationFrame()` which invokes the provided callback. \nReturn an object with two methods `start` and `stop` to allow manual control of the recording. \nOmit the second argument, `autoStart`, to implicitly call `start` when the function is invoked.\n\n",
         "codeBlocks": {
-          "es6": "const recordAnimationFrames = (callback, autoStart = true) => {\r\n  let running = true,\r\n    raf;\r\n  const stop = () => {\r\n    running = false;\r\n    cancelAnimationFrame(raf);\r\n  };\r\n  const start = () => {\r\n    running = true;\r\n    run();\r\n  };\r\n  const run = () => {\r\n    raf = requestAnimationFrame(() => {\r\n      callback();\r\n      if (running) run();\r\n    });\r\n  };\r\n  if (autoStart) start();\r\n  return { start, stop };\r\n};",
+          "es6": "const recordAnimationFrames = (callback, autoStart = true) => {\n  let running = true,\n    raf;\n  const stop = () => {\n    running = false;\n    cancelAnimationFrame(raf);\n  };\n  const start = () => {\n    running = true;\n    run();\n  };\n  const run = () => {\n    raf = requestAnimationFrame(() => {\n      callback();\n      if (running) run();\n    });\n  };\n  if (autoStart) start();\n  return { start, stop };\n};",
           "es5": "var recordAnimationFrames = function recordAnimationFrames(callback) {\n  var autoStart = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n  var running = true,\n      raf;\n\n  var stop = function stop() {\n    running = false;\n    cancelAnimationFrame(raf);\n  };\n\n  var start = function start() {\n    running = true;\n    run();\n  };\n\n  var run = function run() {\n    raf = requestAnimationFrame(function () {\n      callback();\n      if (running) run();\n    });\n  };\n\n  if (autoStart) start();\n  return {\n    start: start,\n    stop: stop\n  };\n};",
-          "example": "const cb = () => console.log('Animation frame fired');\r\nconst recorder = recordAnimationFrames(cb); // logs 'Animation frame fired' on each animation frame\r\nrecorder.stop(); // stops logging\r\nrecorder.start(); // starts again\r\nconst recorder2 = recordAnimationFrames(cb, false); // `start` needs to be explicitly called to begin recording frames"
+          "example": "const cb = () => console.log('Animation frame fired');\nconst recorder = recordAnimationFrames(cb); // logs 'Animation frame fired' on each animation frame\nrecorder.stop(); // stops logging\nrecorder.start(); // starts again\nconst recorder2 = recordAnimationFrames(cb, false); // `start` needs to be explicitly called to begin recording frames"
         },
         "tags": [
           "browser",
@@ -5520,7 +5520,7 @@
         ]
       },
       "meta": {
-        "hash": "9c5af9cecb532126a2bb07d8e963c53a6ff6e7d9ea2f2b58d84bae752e5889ff"
+        "hash": "b780a5af9c22faa9601191aff53c24d55f5e88b62ac79fd2e02517f9a724b502"
       }
     },
     {
@@ -5531,7 +5531,7 @@
         "fileName": "redirect.md",
         "text": "Redirects to a specified URL.\n\nUse `window.location.href` or `window.location.replace()` to redirect to `url`.\nPass a second argument to simulate a link click (`true` - default) or an HTTP redirect (`false`).\n\n",
         "codeBlocks": {
-          "es6": "const redirect = (url, asLink = true) =>\r\n  asLink ? (window.location.href = url) : window.location.replace(url);",
+          "es6": "const redirect = (url, asLink = true) =>\n  asLink ? (window.location.href = url) : window.location.replace(url);",
           "es5": "var redirect = function redirect(url) {\n  var asLink = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n  return asLink ? window.location.href = url : window.location.replace(url);\n};",
           "example": "redirect('https://google.com');"
         },
@@ -5542,7 +5542,7 @@
         ]
       },
       "meta": {
-        "hash": "f2520d4ce2bb10e791172f56e710ae5e8eca833c0056a1971770cfec1b207345"
+        "hash": "b5eb860bad14f54d114103321b8135e474057c63b703dfb06183a97530af402f"
       }
     },
     {
@@ -5553,9 +5553,9 @@
         "fileName": "reducedFilter.md",
         "text": "Filter an array of objects based on a condition while also filtering out unspecified keys.\n\nUse `Array.prototype.filter()` to filter the array based on the predicate `fn` so that it returns the objects for which the condition returned a truthy value.\nOn the filtered array, use `Array.prototype.map()` to return the new object using `Array.prototype.reduce()` to filter out the keys which were not supplied as the `keys` argument.\n\n",
         "codeBlocks": {
-          "es6": "const reducedFilter = (data, keys, fn) =>\r\n  data.filter(fn).map(el =>\r\n    keys.reduce((acc, key) => {\r\n      acc[key] = el[key];\r\n      return acc;\r\n    }, {})\r\n  );",
+          "es6": "const reducedFilter = (data, keys, fn) =>\n  data.filter(fn).map(el =>\n    keys.reduce((acc, key) => {\n      acc[key] = el[key];\n      return acc;\n    }, {})\n  );",
           "es5": "var reducedFilter = function reducedFilter(data, keys, fn) {\n  return data.filter(fn).map(function (el) {\n    return keys.reduce(function (acc, key) {\n      acc[key] = el[key];\n      return acc;\n    }, {});\n  });\n};",
-          "example": "const data = [\r\n  {\r\n    id: 1,\r\n    name: 'john',\r\n    age: 24\r\n  },\r\n  {\r\n    id: 2,\r\n    name: 'mike',\r\n    age: 50\r\n  }\r\n];\r\n\r\nreducedFilter(data, ['id', 'name'], item => item.age > 24); // [{ id: 2, name: 'mike'}]"
+          "example": "const data = [\n  {\n    id: 1,\n    name: 'john',\n    age: 24\n  },\n  {\n    id: 2,\n    name: 'mike',\n    age: 50\n  }\n];\n\nreducedFilter(data, ['id', 'name'], item => item.age > 24); // [{ id: 2, name: 'mike'}]"
         },
         "tags": [
           "array",
@@ -5563,7 +5563,7 @@
         ]
       },
       "meta": {
-        "hash": "1e54e88b1bf869e6ad9d1eabdf9b435f0df278472b8ba17a6cd10874787bd035"
+        "hash": "eb9a81be04298dc36d5b01dbbff22b9aac19d5ef1f1c752ef4c48e6a2cc0ea32"
       }
     },
     {
@@ -5574,7 +5574,7 @@
         "fileName": "reduceSuccessive.md",
         "text": "Applies a function against an accumulator and each element in the array (from left to right), returning an array of successively reduced values.\n\nUse `Array.prototype.reduce()` to apply the given function to the given array, storing each new result.\n\n",
         "codeBlocks": {
-          "es6": "const reduceSuccessive = (arr, fn, acc) =>\r\n  arr.reduce((res, val, i, arr) => (res.push(fn(res.slice(-1)[0], val, i, arr)), res), [acc]);",
+          "es6": "const reduceSuccessive = (arr, fn, acc) =>\n  arr.reduce((res, val, i, arr) => (res.push(fn(res.slice(-1)[0], val, i, arr)), res), [acc]);",
           "es5": "var reduceSuccessive = function reduceSuccessive(arr, fn, acc) {\n  return arr.reduce(function (res, val, i, arr) {\n    return res.push(fn(res.slice(-1)[0], val, i, arr)), res;\n  }, [acc]);\n};",
           "example": "reduceSuccessive([1, 2, 3, 4, 5, 6], (acc, val) => acc + val, 0); // [0, 1, 3, 6, 10, 15, 21]"
         },
@@ -5585,7 +5585,7 @@
         ]
       },
       "meta": {
-        "hash": "e3deca71de3504628af78f647366bbd8229f7340a98319583e2cbeec7b010de3"
+        "hash": "276b7cc7252a0c5202520e4903d8083153240ca6fd035eb709eaf5bf6cc1eccc"
       }
     },
     {
@@ -5596,9 +5596,9 @@
         "fileName": "reduceWhich.md",
         "text": "Returns the minimum/maximum value of an array, after applying the provided function to set comparing rule.\n\nUse `Array.prototype.reduce()` in combination with the `comparator` function to get the appropriate element in the array.\nYou can omit the second parameter, `comparator`, to use the default one that returns the minimum element in the array.\n\n",
         "codeBlocks": {
-          "es6": "const reduceWhich = (arr, comparator = (a, b) => a - b) =>\r\n  arr.reduce((a, b) => (comparator(a, b) >= 0 ? b : a));",
+          "es6": "const reduceWhich = (arr, comparator = (a, b) => a - b) =>\n  arr.reduce((a, b) => (comparator(a, b) >= 0 ? b : a));",
           "es5": "var reduceWhich = function reduceWhich(arr) {\n  var comparator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (a, b) {\n    return a - b;\n  };\n  return arr.reduce(function (a, b) {\n    return comparator(a, b) >= 0 ? b : a;\n  });\n};",
-          "example": "reduceWhich([1, 3, 2]); // 1\r\nreduceWhich([1, 3, 2], (a, b) => b - a); // 3\r\nreduceWhich(\r\n  [{ name: 'Tom', age: 12 }, { name: 'Jack', age: 18 }, { name: 'Lucy', age: 9 }],\r\n  (a, b) => a.age - b.age\r\n); // {name: \"Lucy\", age: 9}"
+          "example": "reduceWhich([1, 3, 2]); // 1\nreduceWhich([1, 3, 2], (a, b) => b - a); // 3\nreduceWhich(\n  [{ name: 'Tom', age: 12 }, { name: 'Jack', age: 18 }, { name: 'Lucy', age: 9 }],\n  (a, b) => a.age - b.age\n); // {name: \"Lucy\", age: 9}"
         },
         "tags": [
           "array",
@@ -5607,7 +5607,7 @@
         ]
       },
       "meta": {
-        "hash": "5aa0c74fdcd007ad744e305c081e92f85b58cba65becf61d185a739183d4e4e6"
+        "hash": "4da6106d2a999166888ef3f2d1cfaa3b32666ef12bbdfddac832cd0b8c7404d4"
       }
     },
     {
@@ -5620,7 +5620,7 @@
         "codeBlocks": {
           "es6": "const reject = (pred, array) => array.filter((...args) => !pred(...args));",
           "es5": "var reject = function reject(pred, array) {\n  return array.filter(function () {\n    return !pred.apply(void 0, arguments);\n  });\n};",
-          "example": "reject(x => x % 2 === 0, [1, 2, 3, 4, 5]); // [1, 3, 5]\r\nreject(word => word.length > 4, ['Apple', 'Pear', 'Kiwi', 'Banana']); // ['Pear', 'Kiwi']"
+          "example": "reject(x => x % 2 === 0, [1, 2, 3, 4, 5]); // [1, 3, 5]\nreject(word => word.length > 4, ['Apple', 'Pear', 'Kiwi', 'Banana']); // ['Pear', 'Kiwi']"
         },
         "tags": [
           "array",
@@ -5628,7 +5628,7 @@
         ]
       },
       "meta": {
-        "hash": "74726cbaed0b640625a4e7490a5a02dd4b0b37ef44810c4e2e4d2289c418e158"
+        "hash": "dd81177b97db5628ce070cf138e38f6c51ecb82790609e2b939c45b769942407"
       }
     },
     {
@@ -5639,7 +5639,7 @@
         "fileName": "remove.md",
         "text": "Removes elements from an array for which the given function returns `false`.\n\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\nThe `func` is invoked with three arguments (`value, index, array`).\n\n",
         "codeBlocks": {
-          "es6": "const remove = (arr, func) =>\r\n  Array.isArray(arr)\r\n    ? arr.filter(func).reduce((acc, val) => {\r\n      arr.splice(arr.indexOf(val), 1);\r\n      return acc.concat(val);\r\n    }, [])\r\n    : [];",
+          "es6": "const remove = (arr, func) =>\n  Array.isArray(arr)\n    ? arr.filter(func).reduce((acc, val) => {\n        arr.splice(arr.indexOf(val), 1);\n        return acc.concat(val);\n      }, [])\n    : [];",
           "es5": "var remove = function remove(arr, func) {\n  return Array.isArray(arr) ? arr.filter(func).reduce(function (acc, val) {\n    arr.splice(arr.indexOf(val), 1);\n    return acc.concat(val);\n  }, []) : [];\n};",
           "example": "remove([1, 2, 3, 4], n => n % 2 === 0); // [2, 4]"
         },
@@ -5649,7 +5649,7 @@
         ]
       },
       "meta": {
-        "hash": "f517d3f98a3936e76bdf8600349b7f11b3aecc050aab3cef0e6787c088e4eb4f"
+        "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
       }
     },
     {
@@ -5671,7 +5671,7 @@
         ]
       },
       "meta": {
-        "hash": "ed60bea0708a82dc49ae81fee1abdef76686f1db3a01f2ca0b84315f820ee142"
+        "hash": "b557e3d59a04dac19161e9d69b5c347a758ad491c2214d56437d1592614f6944"
       }
     },
     {
@@ -5682,9 +5682,9 @@
         "fileName": "renameKeys.md",
         "text": "Replaces the names of multiple object keys with the values provided.\n\nUse `Object.keys()` in combination with `Array.prototype.reduce()` and the spread operator (`...`) to get the object's keys and rename them according to `keysMap`.\n\n",
         "codeBlocks": {
-          "es6": "const renameKeys = (keysMap, obj) =>\r\n  Object.keys(obj).reduce(\r\n    (acc, key) => ({\r\n      ...acc,\r\n      ...{ [keysMap[key] || key]: obj[key] }\r\n    }),\r\n    {}\r\n  );",
+          "es6": "const renameKeys = (keysMap, obj) =>\n  Object.keys(obj).reduce(\n    (acc, key) => ({\n      ...acc,\n      ...{ [keysMap[key] || key]: obj[key] }\n    }),\n    {}\n  );",
           "es5": "function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(source).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar renameKeys = function renameKeys(keysMap, obj) {\n  return Object.keys(obj).reduce(function (acc, key) {\n    return _objectSpread({}, acc, {}, _defineProperty({}, keysMap[key] || key, obj[key]));\n  }, {});\n};",
-          "example": "const obj = { name: 'Bobo', job: 'Front-End Master', shoeSize: 100 };\r\nrenameKeys({ name: 'firstName', job: 'passion' }, obj); // { firstName: 'Bobo', passion: 'Front-End Master', shoeSize: 100 }"
+          "example": "const obj = { name: 'Bobo', job: 'Front-End Master', shoeSize: 100 };\nrenameKeys({ name: 'firstName', job: 'passion' }, obj); // { firstName: 'Bobo', passion: 'Front-End Master', shoeSize: 100 }"
         },
         "tags": [
           "object",
@@ -5692,7 +5692,7 @@
         ]
       },
       "meta": {
-        "hash": "5b15a629b2d460b6fab5a5aebc7f34c950768a6b2cb39ef8155213d07dee45ac"
+        "hash": "d425dd9806d3ae9b3ac08404c43cf28c48084835ffbce5fbd01f04ee1d7a7e5a"
       }
     },
     {
@@ -5714,7 +5714,7 @@
         ]
       },
       "meta": {
-        "hash": "9da8bdbec4cbacdf94ca37ef353266e32cc8a249bd59f7b36cf4b7d9cda8ff2d"
+        "hash": "f608179567e28f0c7de78fce112c5dda6cf01989f9d8499119c80bdd119b0c8d"
       }
     },
     {
@@ -5735,7 +5735,7 @@
         ]
       },
       "meta": {
-        "hash": "521c70b2f2dff91faaff89c3b6c577e8aa467d54dcd2c42b00f318a1e6929dca"
+        "hash": "592446fabae44d631396de3441738710626c4d274eaabe3dfdb9b822ce3a5179"
       }
     },
     {
@@ -5756,7 +5756,7 @@
         ]
       },
       "meta": {
-        "hash": "aa3ecd00b757c4e84f3450c97b0ecb66c5ad661bda9515e735bfa2a5f9fdb4e1"
+        "hash": "8e1d9b3d05e81deb58e6608a0dbf9a336deb73e17820490defc4e98b1febf8e1"
       }
     },
     {
@@ -5767,9 +5767,9 @@
         "fileName": "runAsync.md",
         "text": "Runs a function in a separate thread by using a [Web Worker](https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Using_web_workers), allowing long running functions to not block the UI.\n\nCreate a new `Worker` using a `Blob` object URL, the contents of which should be the stringified version of the supplied function.\nImmediately post the return value of calling the function back.\nReturn a promise, listening for `onmessage` and `onerror` events and resolving the data posted back from the worker, or throwing an error.\n\n",
         "codeBlocks": {
-          "es6": "const runAsync = fn => {\r\n  const worker = new Worker(\r\n    URL.createObjectURL(new Blob([`postMessage((${fn})());`]), {\r\n      type: 'application/javascript; charset=utf-8'\r\n    })\r\n  );\r\n  return new Promise((res, rej) => {\r\n    worker.onmessage = ({ data }) => {\r\n      res(data), worker.terminate();\r\n    };\r\n    worker.onerror = err => {\r\n      rej(err), worker.terminate();\r\n    };\r\n  });\r\n};",
+          "es6": "const runAsync = fn => {\n  const worker = new Worker(\n    URL.createObjectURL(new Blob([`postMessage((${fn})());`]), {\n      type: 'application/javascript; charset=utf-8'\n    })\n  );\n  return new Promise((res, rej) => {\n    worker.onmessage = ({ data }) => {\n      res(data), worker.terminate();\n    };\n    worker.onerror = err => {\n      rej(err), worker.terminate();\n    };\n  });\n};",
           "es5": "var runAsync = function runAsync(fn) {\n  var worker = new Worker(URL.createObjectURL(new Blob([\"postMessage((\".concat(fn, \")());\")]), {\n    type: 'application/javascript; charset=utf-8'\n  }));\n  return new Promise(function (res, rej) {\n    worker.onmessage = function (_ref) {\n      var data = _ref.data;\n      res(data), worker.terminate();\n    };\n\n    worker.onerror = function (err) {\n      rej(err), worker.terminate();\n    };\n  });\n};",
-          "example": "const longRunningFunction = () => {\r\n  let result = 0;\r\n  for (let i = 0; i < 1000; i++)\r\n    for (let j = 0; j < 700; j++) for (let k = 0; k < 300; k++) result = result + i + j + k;\r\n\r\n  return result;\r\n};\r\n/*\r\n  NOTE: Since the function is running in a different context, closures are not supported.\r\n  The function supplied to `runAsync` gets stringified, so everything becomes literal.\r\n  All variables and functions must be defined inside.\r\n*/\r\nrunAsync(longRunningFunction).then(console.log); // 209685000000\r\nrunAsync(() => 10 ** 3).then(console.log); // 1000\r\nlet outsideVariable = 50;\r\nrunAsync(() => typeof outsideVariable).then(console.log); // 'undefined'"
+          "example": "const longRunningFunction = () => {\n  let result = 0;\n  for (let i = 0; i < 1000; i++)\n    for (let j = 0; j < 700; j++) for (let k = 0; k < 300; k++) result = result + i + j + k;\n\n  return result;\n};\n/*\n  NOTE: Since the function is running in a different context, closures are not supported.\n  The function supplied to `runAsync` gets stringified, so everything becomes literal.\n  All variables and functions must be defined inside.\n*/\nrunAsync(longRunningFunction).then(console.log); // 209685000000\nrunAsync(() => 10 ** 3).then(console.log); // 1000\nlet outsideVariable = 50;\nrunAsync(() => typeof outsideVariable).then(console.log); // 'undefined'"
         },
         "tags": [
           "browser",
@@ -5780,7 +5780,7 @@
         ]
       },
       "meta": {
-        "hash": "1f749d57291f610c6380012dc78913edb7d7a7b71f55a1606fc618e691e68938"
+        "hash": "e8e3b0389a64049fccb2dec854868d94ce03c2ff9e9fdcef9b9b5e9477a7602b"
       }
     },
     {
@@ -5793,7 +5793,7 @@
         "codeBlocks": {
           "es6": "const runPromisesInSeries = ps => ps.reduce((p, next) => p.then(next), Promise.resolve());",
           "es5": "var runPromisesInSeries = function runPromisesInSeries(ps) {\n  return ps.reduce(function (p, next) {\n    return p.then(next);\n  }, Promise.resolve());\n};",
-          "example": "const delay = d => new Promise(r => setTimeout(r, d));\r\nrunPromisesInSeries([() => delay(1000), () => delay(2000)]); // Executes each promise sequentially, taking a total of 3 seconds to complete"
+          "example": "const delay = d => new Promise(r => setTimeout(r, d));\nrunPromisesInSeries([() => delay(1000), () => delay(2000)]); // Executes each promise sequentially, taking a total of 3 seconds to complete"
         },
         "tags": [
           "function",
@@ -5802,7 +5802,7 @@
         ]
       },
       "meta": {
-        "hash": "6db84d84544102f610a0a15e1397d924847641ce498592dc6dcce063e40afa00"
+        "hash": "0999832f2ad6dd8f9726494cffed82f85db80121f81b7d7ba43f184911abaf05"
       }
     },
     {
@@ -5824,7 +5824,7 @@
         ]
       },
       "meta": {
-        "hash": "91ad0dd9346dae495eda8f582d172261f2742f30e69b683582c517cd77ca7fe5"
+        "hash": "c17b6181734f37fd452c486dc37b85500aeffeb6472874cd4ff1b71bd79288b1"
       }
     },
     {
@@ -5835,9 +5835,9 @@
         "fileName": "sampleSize.md",
         "text": "Gets `n` random elements at unique keys from `array` up to the size of `array`.\n\nShuffle the array using the [Fisher-Yates algorithm](https://github.com/30-seconds/30-seconds-of-code#shuffle).\nUse `Array.prototype.slice()` to get the first `n` elements.\nOmit the second argument, `n` to get only one element at random from the array.\n\n",
         "codeBlocks": {
-          "es6": "const sampleSize = ([...arr], n = 1) => {\r\n  let m = arr.length;\r\n  while (m) {\r\n    const i = Math.floor(Math.random() * m--);\r\n    [arr[m], arr[i]] = [arr[i], arr[m]];\r\n  }\r\n  return arr.slice(0, n);\r\n};",
+          "es6": "const sampleSize = ([...arr], n = 1) => {\n  let m = arr.length;\n  while (m) {\n    const i = Math.floor(Math.random() * m--);\n    [arr[m], arr[i]] = [arr[i], arr[m]];\n  }\n  return arr.slice(0, n);\n};",
           "es5": "function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar sampleSize = function sampleSize(_ref) {\n  var _ref2 = _toArray(_ref),\n      arr = _ref2.slice(0);\n\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  var m = arr.length;\n\n  while (m) {\n    var i = Math.floor(Math.random() * m--);\n    var _ref3 = [arr[i], arr[m]];\n    arr[m] = _ref3[0];\n    arr[i] = _ref3[1];\n  }\n\n  return arr.slice(0, n);\n};",
-          "example": "sampleSize([1, 2, 3], 2); // [3,1]\r\nsampleSize([1, 2, 3], 4); // [2,3,1]"
+          "example": "sampleSize([1, 2, 3], 2); // [3,1]\nsampleSize([1, 2, 3], 4); // [2,3,1]"
         },
         "tags": [
           "array",
@@ -5846,7 +5846,7 @@
         ]
       },
       "meta": {
-        "hash": "fb360301d5ee69004b94bedfb05c757c444f2e48bb72a923bf0a9f8eebca51e0"
+        "hash": "dbca8b17910aa993f1a5746193a915a46b0825a8d69210e3d99d9fbcb484b919"
       }
     },
     {
@@ -5857,7 +5857,7 @@
         "fileName": "scrollToTop.md",
         "text": "Smooth-scrolls to the top of the page.\n\nGet distance from top using `document.documentElement.scrollTop` or `document.body.scrollTop`.\nScroll by a fraction of the distance from the top. Use `window.requestAnimationFrame()` to animate the scrolling.\n\n",
         "codeBlocks": {
-          "es6": "const scrollToTop = () => {\r\n  const c = document.documentElement.scrollTop || document.body.scrollTop;\r\n  if (c > 0) {\r\n    window.requestAnimationFrame(scrollToTop);\r\n    window.scrollTo(0, c - c / 8);\r\n  }\r\n};",
+          "es6": "const scrollToTop = () => {\n  const c = document.documentElement.scrollTop || document.body.scrollTop;\n  if (c > 0) {\n    window.requestAnimationFrame(scrollToTop);\n    window.scrollTo(0, c - c / 8);\n  }\n};",
           "es5": "var scrollToTop = function scrollToTop() {\n  var c = document.documentElement.scrollTop || document.body.scrollTop;\n\n  if (c > 0) {\n    window.requestAnimationFrame(scrollToTop);\n    window.scrollTo(0, c - c / 8);\n  }\n};",
           "example": "scrollToTop();"
         },
@@ -5867,7 +5867,7 @@
         ]
       },
       "meta": {
-        "hash": "8e8f218a9508afd3d1f8a412bcf957fa1de69672c33b6a1fdfe7c3c1d2ed729a"
+        "hash": "2e8250f339e49af92c10c877ae4dbc9d2889ed14bdab24f96bfda82a095d4989"
       }
     },
     {
@@ -5878,7 +5878,7 @@
         "fileName": "sdbm.md",
         "text": "Hashes the input string into a whole number.\n\nUse `String.prototype.split('')` and `Array.prototype.reduce()` to create a hash of the input string, utilizing bit shifting.\n\n",
         "codeBlocks": {
-          "es6": "const sdbm = str => {\r\n  let arr = str.split('');\r\n  return arr.reduce(\r\n    (hashCode, currentVal) =>\r\n      (hashCode = currentVal.charCodeAt(0) + (hashCode << 6) + (hashCode << 16) - hashCode),\r\n    0\r\n  );\r\n};",
+          "es6": "const sdbm = str => {\n  let arr = str.split('');\n  return arr.reduce(\n    (hashCode, currentVal) =>\n      (hashCode = currentVal.charCodeAt(0) + (hashCode << 6) + (hashCode << 16) - hashCode),\n    0\n  );\n};",
           "es5": "var sdbm = function sdbm(str) {\n  var arr = str.split('');\n  return arr.reduce(function (hashCode, currentVal) {\n    return hashCode = currentVal.charCodeAt(0) + (hashCode << 6) + (hashCode << 16) - hashCode;\n  }, 0);\n};",
           "example": "sdbm('name'); // -3521204949"
         },
@@ -5889,7 +5889,7 @@
         ]
       },
       "meta": {
-        "hash": "3b1c0ae1f6e1266de289f5bb290e18ba1493515057e38859d2eb5b4e5af31918"
+        "hash": "58d91b4760b4af29df95cf1b073166c02660f9af3d46c950fba64b922c999ba1"
       }
     },
     {
@@ -5911,7 +5911,7 @@
         ]
       },
       "meta": {
-        "hash": "10bdf588cc2ad6d5b1547bd68de50827b8df26c793aa9eda2b73162118df9bd5"
+        "hash": "defdaa306864196a4f561c37c4c7f74ffc159406c4538a0f7e1f3f153840eebe"
       }
     },
     {
@@ -5922,7 +5922,7 @@
         "fileName": "serializeForm.md",
         "text": "Encode a set of form elements as a query string.\n\nUse the `FormData` constructor to convert the HTML `form` to `FormData`, `Array.from()` to convert to an array, passing a map function as the second argument.\nUse `Array.prototype.map()` and `window.encodeURIComponent()` to encode each field's value.\nUse `Array.prototype.join()` with appropriate argumens to produce an appropriate query string.\n\n",
         "codeBlocks": {
-          "es6": "const serializeForm = form =>\r\n  Array.from(new FormData(form), field => field.map(encodeURIComponent).join('=')).join('&');",
+          "es6": "const serializeForm = form =>\n  Array.from(new FormData(form), field => field.map(encodeURIComponent).join('=')).join('&');",
           "es5": "var serializeForm = function serializeForm(form) {\n  return Array.from(new FormData(form), function (field) {\n    return field.map(encodeURIComponent).join('=');\n  }).join('&');\n};",
           "example": "serializeForm(document.querySelector('#form')); // email=test%40email.com&name=Test%20Name"
         },
@@ -5933,7 +5933,7 @@
         ]
       },
       "meta": {
-        "hash": "72cf967e93347774db9f22ae7a18826eacf89903e19fbe76ce84419231eeb438"
+        "hash": "8edd4093e584bbfae52b464e55a335c0af33861ee2d580d4ec005b85cd7491ee"
       }
     },
     {
@@ -5954,7 +5954,7 @@
         ]
       },
       "meta": {
-        "hash": "009fbae4f246327f079fe6ada816acef2c48b5e3b3c4d0b5793c5de6d1e8f311"
+        "hash": "8f531d87240d659970223c06c464bb1434fb3096e365d48dccb5c386a39e1ac4"
       }
     },
     {
@@ -5967,7 +5967,7 @@
         "codeBlocks": {
           "es6": "const shallowClone = obj => Object.assign({}, obj);",
           "es5": "var shallowClone = function shallowClone(obj) {\n  return Object.assign({}, obj);\n};",
-          "example": "const a = { x: true, y: 1 };\r\nconst b = shallowClone(a); // a !== b"
+          "example": "const a = { x: true, y: 1 };\nconst b = shallowClone(a); // a !== b"
         },
         "tags": [
           "object",
@@ -5975,7 +5975,7 @@
         ]
       },
       "meta": {
-        "hash": "06a565ce2693a6eb5b0b78505178bebe6e04d0cbe48a809f0ab440b4898299eb"
+        "hash": "4a19fb8e2ef816c5dfa373d3f0cbcb223c34fe8fe2861f09f139edb18bfb2978"
       }
     },
     {
@@ -5986,9 +5986,9 @@
         "fileName": "shank.md",
         "text": "Has the same functionality as [`Array.prototype.splice()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice), but returning a new array instead of mutating the original array.\n\nUse `Array.prototype.slice()` and `Array.prototype.concat()` to get a new array with the new contents after removing existing elements and/or adding new elements.\nOmit the second argument, `index`, to start at `0`.\nOmit the third argument, `delCount`, to remove `0` elements.\nOmit the fourth argument, `elements`, in order to not add any new elements.\n\n",
         "codeBlocks": {
-          "es6": "const shank = (arr, index = 0, delCount = 0, ...elements) =>\r\n  arr\r\n    .slice(0, index)\r\n    .concat(elements)\r\n    .concat(arr.slice(index + delCount));",
+          "es6": "const shank = (arr, index = 0, delCount = 0, ...elements) =>\n  arr\n    .slice(0, index)\n    .concat(elements)\n    .concat(arr.slice(index + delCount));",
           "es5": "var shank = function shank(arr) {\n  var index = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var delCount = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n\n  for (var _len = arguments.length, elements = new Array(_len > 3 ? _len - 3 : 0), _key = 3; _key < _len; _key++) {\n    elements[_key - 3] = arguments[_key];\n  }\n\n  return arr.slice(0, index).concat(elements).concat(arr.slice(index + delCount));\n};",
-          "example": "const names = ['alpha', 'bravo', 'charlie'];\r\nconst namesAndDelta = shank(names, 1, 0, 'delta'); // [ 'alpha', 'delta', 'bravo', 'charlie' ]\r\nconst namesNoBravo = shank(names, 1, 1); // [ 'alpha', 'charlie' ]\r\nconsole.log(names); // ['alpha', 'bravo', 'charlie']"
+          "example": "const names = ['alpha', 'bravo', 'charlie'];\nconst namesAndDelta = shank(names, 1, 0, 'delta'); // [ 'alpha', 'delta', 'bravo', 'charlie' ]\nconst namesNoBravo = shank(names, 1, 1); // [ 'alpha', 'charlie' ]\nconsole.log(names); // ['alpha', 'bravo', 'charlie']"
         },
         "tags": [
           "array",
@@ -5996,7 +5996,7 @@
         ]
       },
       "meta": {
-        "hash": "f6e68a989853c35ee3491e35d4f04721b2bbda789007d577e646b94ae156ebd5"
+        "hash": "65d097127b81a7fd3bfbaf79e804ce09114ef4ad08e27d64fa98891f4d68cb6b"
       }
     },
     {
@@ -6018,7 +6018,7 @@
         ]
       },
       "meta": {
-        "hash": "6c42a2c08286e2289b1478536f06888b6fbd55981bc52a21ba9e47e3cecc38a6"
+        "hash": "541411afec987a2cf11bfa2d3d6a4f5f3e1b4f3e7363dd57281715bbf433cc40"
       }
     },
     {
@@ -6029,9 +6029,9 @@
         "fileName": "shuffle.md",
         "text": "Randomizes the order of the values of an array, returning a new array.\n\nUses the [Fisher-Yates algorithm](https://github.com/30-seconds/30-seconds-of-code#shuffle) to reorder the elements of the array.\n\n",
         "codeBlocks": {
-          "es6": "const shuffle = ([...arr]) => {\r\n  let m = arr.length;\r\n  while (m) {\r\n    const i = Math.floor(Math.random() * m--);\r\n    [arr[m], arr[i]] = [arr[i], arr[m]];\r\n  }\r\n  return arr;\r\n};",
+          "es6": "const shuffle = ([...arr]) => {\n  let m = arr.length;\n  while (m) {\n    const i = Math.floor(Math.random() * m--);\n    [arr[m], arr[i]] = [arr[i], arr[m]];\n  }\n  return arr;\n};",
           "es5": "function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar shuffle = function shuffle(_ref) {\n  var _ref2 = _toArray(_ref),\n      arr = _ref2.slice(0);\n\n  var m = arr.length;\n\n  while (m) {\n    var i = Math.floor(Math.random() * m--);\n    var _ref3 = [arr[i], arr[m]];\n    arr[m] = _ref3[0];\n    arr[i] = _ref3[1];\n  }\n\n  return arr;\n};",
-          "example": "const foo = [1, 2, 3];\r\nshuffle(foo); // [2, 3, 1], foo = [1, 2, 3]"
+          "example": "const foo = [1, 2, 3];\nshuffle(foo); // [2, 3, 1], foo = [1, 2, 3]"
         },
         "tags": [
           "array",
@@ -6040,7 +6040,7 @@
         ]
       },
       "meta": {
-        "hash": "8609761438b95c3a9654c82f378dd85aa4c37515295335bf33fac8d0bb178d58"
+        "hash": "10ea54fc484a0ccc346126ff9665835da5ef5bfa6f75fdea98bfaacfb2dbb65e"
       }
     },
     {
@@ -6062,7 +6062,7 @@
         ]
       },
       "meta": {
-        "hash": "85d98f2847d65eda437b656cf76e5ca9964c021b235f8656f043fceefd2f5fef"
+        "hash": "9a8cf04ac3d6a593ef6e5169338c96feaec5b19a799256cbc26543f1fac8234a"
       }
     },
     {
@@ -6073,9 +6073,9 @@
         "fileName": "size.md",
         "text": "Get size of arrays, objects or strings.\n\nGet type of `val` (`array`, `object` or `string`). \nUse `length` property for arrays.\nUse `length` or `size` value if available or number of keys for objects.\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\nSplit strings into array of characters with `split('')` and return its length.\n\n",
         "codeBlocks": {
-          "es6": "const size = val =>\r\n  Array.isArray(val)\r\n    ? val.length\r\n    : val && typeof val === 'object'\r\n      ? val.size || val.length || Object.keys(val).length\r\n      : typeof val === 'string'\r\n        ? new Blob([val]).size\r\n        : 0;",
+          "es6": "const size = val =>\n  Array.isArray(val)\n    ? val.length\n    : val && typeof val === 'object'\n    ? val.size || val.length || Object.keys(val).length\n    : typeof val === 'string'\n    ? new Blob([val]).size\n    : 0;",
           "es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar size = function size(val) {\n  return Array.isArray(val) ? val.length : val && _typeof(val) === 'object' ? val.size || val.length || Object.keys(val).length : typeof val === 'string' ? new Blob([val]).size : 0;\n};",
-          "example": "size([1, 2, 3, 4, 5]); // 5\r\nsize('size'); // 4\r\nsize({ one: 1, two: 2, three: 3 }); // 3"
+          "example": "size([1, 2, 3, 4, 5]); // 5\nsize('size'); // 4\nsize({ one: 1, two: 2, three: 3 }); // 3"
         },
         "tags": [
           "object",
@@ -6085,7 +6085,7 @@
         ]
       },
       "meta": {
-        "hash": "40b0766f31c03c088f2e8214991eb3595f4b1805b8c982e0039e05a9e722fbbd"
+        "hash": "fc085a3110ffbbfa36c63ce282a3ab59e96d101eb4f489a59b68c1fda1814c14"
       }
     },
     {
@@ -6098,7 +6098,7 @@
         "codeBlocks": {
           "es6": "const sleep = ms => new Promise(resolve => setTimeout(resolve, ms));",
           "es5": "var sleep = function sleep(ms) {\n  return new Promise(function (resolve) {\n    return setTimeout(resolve, ms);\n  });\n};",
-          "example": "async function sleepyWork() {\r\n  console.log(\"I'm going to sleep for 1 second.\");\r\n  await sleep(1000);\r\n  console.log('I woke up after 1 second.');\r\n}"
+          "example": "async function sleepyWork() {\n  console.log(\"I'm going to sleep for 1 second.\");\n  await sleep(1000);\n  console.log('I woke up after 1 second.');\n}"
         },
         "tags": [
           "function",
@@ -6107,7 +6107,7 @@
         ]
       },
       "meta": {
-        "hash": "2d69647f24b144e1b0f44eeb97c1dc802bfe302a1fd169400dc9e576f0bbb68d"
+        "hash": "07393d7a0e2d433b57abea9792aef5165990bf0ba81eb4e45a01cabceffdaed6"
       }
     },
     {
@@ -6118,9 +6118,9 @@
         "fileName": "smoothScroll.md",
         "text": "Smoothly scrolls the element on which it's called into the visible area of the browser window.\n\nUse `.scrollIntoView` method to scroll the element. \nPass `{ behavior: 'smooth' }` to `.scrollIntoView` so it scrolls smoothly.\n\n",
         "codeBlocks": {
-          "es6": "const smoothScroll = element =>\r\n  document.querySelector(element).scrollIntoView({\r\n    behavior: 'smooth'\r\n  });",
+          "es6": "const smoothScroll = element =>\n  document.querySelector(element).scrollIntoView({\n    behavior: 'smooth'\n  });",
           "es5": "var smoothScroll = function smoothScroll(element) {\n  return document.querySelector(element).scrollIntoView({\n    behavior: 'smooth'\n  });\n};",
-          "example": "smoothScroll('#fooBar'); // scrolls smoothly to the element with the id fooBar\r\nsmoothScroll('.fooBar'); // scrolls smoothly to the first element with a class of fooBar"
+          "example": "smoothScroll('#fooBar'); // scrolls smoothly to the element with the id fooBar\nsmoothScroll('.fooBar'); // scrolls smoothly to the first element with a class of fooBar"
         },
         "tags": [
           "browser",
@@ -6129,7 +6129,7 @@
         ]
       },
       "meta": {
-        "hash": "03f1b8a9529065a07da32a328eed66576cae63570e6e05306b416c6f0bb8d3c3"
+        "hash": "e7d3354d7f5e16a3e7f26ebde9fa93a58c806f2eb7767e9f4269136a408dacb3"
       }
     },
     {
@@ -6150,7 +6150,7 @@
         ]
       },
       "meta": {
-        "hash": "618a73ecb0908fd27644f468d38fccb095cbfa7a90962329684f3045cf681909"
+        "hash": "5aaca9e4e7703fd856345cd3cd124f7db9d3d9b33fc8971ded6e0692f1a5df79"
       }
     },
     {
@@ -6161,9 +6161,9 @@
         "fileName": "sortedIndex.md",
         "text": "Returns the lowest index at which value should be inserted into array in order to maintain its sort order.\n\nCheck if the array is sorted in descending order (loosely).\nUse `Array.prototype.findIndex()` to find the appropriate index where the element should be inserted.\n\n",
         "codeBlocks": {
-          "es6": "const sortedIndex = (arr, n) => {\r\n  const isDescending = arr[0] > arr[arr.length - 1];\r\n  const index = arr.findIndex(el => (isDescending ? n >= el : n <= el));\r\n  return index === -1 ? arr.length : index;\r\n};",
+          "es6": "const sortedIndex = (arr, n) => {\n  const isDescending = arr[0] > arr[arr.length - 1];\n  const index = arr.findIndex(el => (isDescending ? n >= el : n <= el));\n  return index === -1 ? arr.length : index;\n};",
           "es5": "var sortedIndex = function sortedIndex(arr, n) {\n  var isDescending = arr[0] > arr[arr.length - 1];\n  var index = arr.findIndex(function (el) {\n    return isDescending ? n >= el : n <= el;\n  });\n  return index === -1 ? arr.length : index;\n};",
-          "example": "sortedIndex([5, 3, 2, 1], 4); // 1\r\nsortedIndex([30, 50], 40); // 1"
+          "example": "sortedIndex([5, 3, 2, 1], 4); // 1\nsortedIndex([30, 50], 40); // 1"
         },
         "tags": [
           "array",
@@ -6172,7 +6172,7 @@
         ]
       },
       "meta": {
-        "hash": "82c817c0a9054abc71403d326027460453911ca37deb01b3f1cba56b29548f75"
+        "hash": "86849a05d8395934e7f83d52d2c70a9b9d7982db85cfc264ffb4410c03496f79"
       }
     },
     {
@@ -6183,7 +6183,7 @@
         "fileName": "sortedIndexBy.md",
         "text": "Returns the lowest index at which value should be inserted into array in order to maintain its sort order, based on a provided iterator function.\n\nCheck if the array is sorted in descending order (loosely).\nUse `Array.prototype.findIndex()` to find the appropriate index where the element should be inserted, based on the iterator function `fn`.\n\n",
         "codeBlocks": {
-          "es6": "const sortedIndexBy = (arr, n, fn) => {\r\n  const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);\r\n  const val = fn(n);\r\n  const index = arr.findIndex(el => (isDescending ? val >= fn(el) : val <= fn(el)));\r\n  return index === -1 ? arr.length : index;\r\n};",
+          "es6": "const sortedIndexBy = (arr, n, fn) => {\n  const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);\n  const val = fn(n);\n  const index = arr.findIndex(el => (isDescending ? val >= fn(el) : val <= fn(el)));\n  return index === -1 ? arr.length : index;\n};",
           "es5": "var sortedIndexBy = function sortedIndexBy(arr, n, fn) {\n  var isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);\n  var val = fn(n);\n  var index = arr.findIndex(function (el) {\n    return isDescending ? val >= fn(el) : val <= fn(el);\n  });\n  return index === -1 ? arr.length : index;\n};",
           "example": "sortedIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 0"
         },
@@ -6195,7 +6195,7 @@
         ]
       },
       "meta": {
-        "hash": "e0b03c8a78dae5936f1c8b7bc4efd8db999f895af28de7c6756745292096ae4e"
+        "hash": "1b3e4c56abe1a9a8d3fa17798c1efc281f0294be4e2877e8e8c323dfcb4ca591"
       }
     },
     {
@@ -6206,7 +6206,7 @@
         "fileName": "sortedLastIndex.md",
         "text": "Returns the highest index at which value should be inserted into array in order to maintain its sort order.\n\nCheck if the array is sorted in descending order (loosely).\nUse `Array.prototype.reverse()` and `Array.prototype.findIndex()` to find the appropriate last index where the element should be inserted.\n\n",
         "codeBlocks": {
-          "es6": "const sortedLastIndex = (arr, n) => {\r\n  const isDescending = arr[0] > arr[arr.length - 1];\r\n  const index = arr.reverse().findIndex(el => (isDescending ? n <= el : n >= el));\r\n  return index === -1 ? 0 : arr.length - index;\r\n};",
+          "es6": "const sortedLastIndex = (arr, n) => {\n  const isDescending = arr[0] > arr[arr.length - 1];\n  const index = arr.reverse().findIndex(el => (isDescending ? n <= el : n >= el));\n  return index === -1 ? 0 : arr.length - index;\n};",
           "es5": "var sortedLastIndex = function sortedLastIndex(arr, n) {\n  var isDescending = arr[0] > arr[arr.length - 1];\n  var index = arr.reverse().findIndex(function (el) {\n    return isDescending ? n <= el : n >= el;\n  });\n  return index === -1 ? 0 : arr.length - index;\n};",
           "example": "sortedLastIndex([10, 20, 30, 30, 40], 30); // 4"
         },
@@ -6217,7 +6217,7 @@
         ]
       },
       "meta": {
-        "hash": "377ff7e20fbeaa0cc33532704e5c24a120506f62c921a27c5b92f6d853d3f79b"
+        "hash": "82ced04bfc70d243245fad7f3ebf9ef5945bd102d74e77102f917687b3e53d22"
       }
     },
     {
@@ -6228,7 +6228,7 @@
         "fileName": "sortedLastIndexBy.md",
         "text": "Returns the highest index at which value should be inserted into array in order to maintain its sort order, based on a provided iterator function.\n\nCheck if the array is sorted in descending order (loosely).\nUse `Array.prototype.map()` to apply the iterator function to all elements of the array.\nUse `Array.prototype.reverse()` and `Array.prototype.findIndex()` to find the appropriate last index where the element should be inserted, based on the provided iterator function.\n\n",
         "codeBlocks": {
-          "es6": "const sortedLastIndexBy = (arr, n, fn) => {\r\n  const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);\r\n  const val = fn(n);\r\n  const index = arr\r\n    .map(fn)\r\n    .reverse()\r\n    .findIndex(el => (isDescending ? val <= el : val >= el));\r\n  return index === -1 ? 0 : arr.length - index;\r\n};",
+          "es6": "const sortedLastIndexBy = (arr, n, fn) => {\n  const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);\n  const val = fn(n);\n  const index = arr\n    .map(fn)\n    .reverse()\n    .findIndex(el => (isDescending ? val <= el : val >= el));\n  return index === -1 ? 0 : arr.length - index;\n};",
           "es5": "var sortedLastIndexBy = function sortedLastIndexBy(arr, n, fn) {\n  var isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);\n  var val = fn(n);\n  var index = arr.map(fn).reverse().findIndex(function (el) {\n    return isDescending ? val <= el : val >= el;\n  });\n  return index === -1 ? 0 : arr.length - index;\n};",
           "example": "sortedLastIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 1"
         },
@@ -6240,7 +6240,7 @@
         ]
       },
       "meta": {
-        "hash": "5f2384a35ac811d2d21a38d6b2123d40bb68c9caa30fe60e9f2bf5ed18b4b548"
+        "hash": "517118a841e0a4f3feb0e73d2d7012fc48c9cb655129002b399a2c5c3fd7a3f6"
       }
     },
     {
@@ -6261,7 +6261,7 @@
         ]
       },
       "meta": {
-        "hash": "a1f2b6de37cd283c80bd3715299f5cfb0c929bfd4b1bd34c9792e4e6d6b88c54"
+        "hash": "0c21e5e8c3549051085ada0effdfa8f3e19a266778967ef46697c7b9b78b5227"
       }
     },
     {
@@ -6293,9 +6293,9 @@
         "fileName": "stableSort.md",
         "text": "Performs stable sorting of an array, preserving the initial indexes of items when their values are the same.\nDoes not mutate the original array, but returns a new array instead.\n\nUse `Array.prototype.map()` to pair each element of the input array with its corresponding index.\nUse `Array.prototype.sort()` and a `compare` function to sort the list, preserving their initial order if the items compared are equal.\nUse `Array.prototype.map()` to convert back to the initial array items.\n\n",
         "codeBlocks": {
-          "es6": "const stableSort = (arr, compare) =>\r\n  arr\r\n    .map((item, index) => ({ item, index }))\r\n    .sort((a, b) => compare(a.item, b.item) || a.index - b.index)\r\n    .map(({ item }) => item);",
+          "es6": "const stableSort = (arr, compare) =>\n  arr\n    .map((item, index) => ({ item, index }))\n    .sort((a, b) => compare(a.item, b.item) || a.index - b.index)\n    .map(({ item }) => item);",
           "es5": "var stableSort = function stableSort(arr, compare) {\n  return arr.map(function (item, index) {\n    return {\n      item: item,\n      index: index\n    };\n  }).sort(function (a, b) {\n    return compare(a.item, b.item) || a.index - b.index;\n  }).map(function (_ref) {\n    var item = _ref.item;\n    return item;\n  });\n};",
-          "example": "const arr = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];\r\nconst stable = stableSort(arr, () => 0); // [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]"
+          "example": "const arr = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];\nconst stable = stableSort(arr, () => 0); // [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]"
         },
         "tags": [
           "array",
@@ -6305,7 +6305,7 @@
         ]
       },
       "meta": {
-        "hash": "3789c451767caa84f152a24d2122c7c47b01f7b3ac8a285e6be6670395f1e8c1"
+        "hash": "4f0ace59a000b0898eab157f0d5232fb8e0a19d854baf8496442a2928c15f87d"
       }
     },
     {
@@ -6316,9 +6316,9 @@
         "fileName": "standardDeviation.md",
         "text": "Returns the standard deviation of an array of numbers.\n\nUse `Array.prototype.reduce()` to calculate the mean, variance and the sum of the variance of the values, the variance of the values, then\ndetermine the standard deviation.\nYou can omit the second argument to get the sample standard deviation or set it to `true` to get the population standard deviation.\n\n",
         "codeBlocks": {
-          "es6": "const standardDeviation = (arr, usePopulation = false) => {\r\n  const mean = arr.reduce((acc, val) => acc + val, 0) / arr.length;\r\n  return Math.sqrt(\r\n    arr.reduce((acc, val) => acc.concat((val - mean) ** 2), []).reduce((acc, val) => acc + val, 0) /\r\n      (arr.length - (usePopulation ? 0 : 1))\r\n  );\r\n};",
+          "es6": "const standardDeviation = (arr, usePopulation = false) => {\n  const mean = arr.reduce((acc, val) => acc + val, 0) / arr.length;\n  return Math.sqrt(\n    arr.reduce((acc, val) => acc.concat((val - mean) ** 2), []).reduce((acc, val) => acc + val, 0) /\n      (arr.length - (usePopulation ? 0 : 1))\n  );\n};",
           "es5": "var standardDeviation = function standardDeviation(arr) {\n  var usePopulation = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  var mean = arr.reduce(function (acc, val) {\n    return acc + val;\n  }, 0) / arr.length;\n  return Math.sqrt(arr.reduce(function (acc, val) {\n    return acc.concat(Math.pow(val - mean, 2));\n  }, []).reduce(function (acc, val) {\n    return acc + val;\n  }, 0) / (arr.length - (usePopulation ? 0 : 1)));\n};",
-          "example": "standardDeviation([10, 2, 38, 23, 38, 23, 21]); // 13.284434142114991 (sample)\r\nstandardDeviation([10, 2, 38, 23, 38, 23, 21], true); // 12.29899614287479 (population)"
+          "example": "standardDeviation([10, 2, 38, 23, 38, 23, 21]); // 13.284434142114991 (sample)\nstandardDeviation([10, 2, 38, 23, 38, 23, 21], true); // 12.29899614287479 (population)"
         },
         "tags": [
           "math",
@@ -6327,7 +6327,7 @@
         ]
       },
       "meta": {
-        "hash": "da5a92fce068814a2ae0398bb3e7863f8a29d3c3a59e543ebf300dc92e28ed0c"
+        "hash": "f0fe3943b1ac2f0935a3a5a3b7004f88f168faebe9bb4088f4dc441a06975cbb"
       }
     },
     {
@@ -6338,7 +6338,7 @@
         "fileName": "stringPermutations.md",
         "text": "⚠️ **WARNING**: This function's execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your browser to hang as it tries to solve all the different combinations.\n\nGenerates all permutations of a string (contains duplicates).\n\nUse recursion.\nFor each letter in the given string, create all the partial permutations for the rest of its letters.\nUse `Array.prototype.map()` to combine the letter with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\nBase cases are for string `length` equal to `2` or `1`.\n\n",
         "codeBlocks": {
-          "es6": "const stringPermutations = str => {\r\n  if (str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];\r\n  return str\r\n    .split('')\r\n    .reduce(\r\n      (acc, letter, i) =>\r\n        acc.concat(stringPermutations(str.slice(0, i) + str.slice(i + 1)).map(val => letter + val)),\r\n      []\r\n    );\r\n};",
+          "es6": "const stringPermutations = str => {\n  if (str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];\n  return str\n    .split('')\n    .reduce(\n      (acc, letter, i) =>\n        acc.concat(stringPermutations(str.slice(0, i) + str.slice(i + 1)).map(val => letter + val)),\n      []\n    );\n};",
           "es5": "var stringPermutations = function stringPermutations(str) {\n  if (str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];\n  return str.split('').reduce(function (acc, letter, i) {\n    return acc.concat(stringPermutations(str.slice(0, i) + str.slice(i + 1)).map(function (val) {\n      return letter + val;\n    }));\n  }, []);\n};",
           "example": "stringPermutations('abc'); // ['abc','acb','bac','bca','cab','cba']"
         },
@@ -6349,7 +6349,7 @@
         ]
       },
       "meta": {
-        "hash": "40f5651f71b9f0a9fe80bd6d26a8a4bd0621f9f44d3c9a8a2c015fcc5c55f264"
+        "hash": "f3072433cbe87501a6a466eb07faad4e739a8a3ccb6c05cc177176642a57bacd"
       }
     },
     {
@@ -6372,7 +6372,7 @@
         ]
       },
       "meta": {
-        "hash": "6c0aa0490c794c72862d69205655df84c505d9c7ba7a93456c20860af18f0632"
+        "hash": "a33dbe87821f5017cf4238c69d9effcfe993698f055fec5e915f4fff68c01e34"
       }
     },
     {
@@ -6385,7 +6385,7 @@
         "codeBlocks": {
           "es6": "const sum = (...arr) => [...arr].reduce((acc, val) => acc + val, 0);",
           "es5": "var sum = function sum() {\n  for (var _len = arguments.length, arr = new Array(_len), _key = 0; _key < _len; _key++) {\n    arr[_key] = arguments[_key];\n  }\n\n  return [].concat(arr).reduce(function (acc, val) {\n    return acc + val;\n  }, 0);\n};",
-          "example": "sum(1, 2, 3, 4); // 10\r\nsum(...[1, 2, 3, 4]); // 10"
+          "example": "sum(1, 2, 3, 4); // 10\nsum(...[1, 2, 3, 4]); // 10"
         },
         "tags": [
           "math",
@@ -6394,7 +6394,7 @@
         ]
       },
       "meta": {
-        "hash": "df18682eaa04fc0695f08814c7ff5464db1d2bf5b3b4087cff2ca6b574da5111"
+        "hash": "a3ba3ba8f7bb293e1560c3140da2b50ac739ac4e5fb10c857f837b6dc54b029b"
       }
     },
     {
@@ -6405,9 +6405,9 @@
         "fileName": "sumBy.md",
         "text": "Returns the sum of an array, after mapping each element to a value using the provided function.\n\nUse `Array.prototype.map()` to map each element to the value returned by `fn`, `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`.\n\n",
         "codeBlocks": {
-          "es6": "const sumBy = (arr, fn) =>\r\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => acc + val, 0);",
+          "es6": "const sumBy = (arr, fn) =>\n  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => acc + val, 0);",
           "es5": "var sumBy = function sumBy(arr, fn) {\n  return arr.map(typeof fn === 'function' ? fn : function (val) {\n    return val[fn];\n  }).reduce(function (acc, val) {\n    return acc + val;\n  }, 0);\n};",
-          "example": "sumBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 20\r\nsumBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 20"
+          "example": "sumBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], o => o.n); // 20\nsumBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 20"
         },
         "tags": [
           "math",
@@ -6417,7 +6417,7 @@
         ]
       },
       "meta": {
-        "hash": "f33391684fe093ac09dabf9cb6989ac7f14f723df2bde7394f545cc7b0b05262"
+        "hash": "3e92614cb14073c51991cb6978e6a7e5871a00f1f24a886046f441fdc4633175"
       }
     },
     {
@@ -6428,9 +6428,9 @@
         "fileName": "sumPower.md",
         "text": "Returns the sum of the powers of all the numbers from `start` to `end` (both inclusive).\n\nUse `Array.prototype.fill()` to create an array of all the numbers in the target range, `Array.prototype.map()` and the exponent operator (`**`) to raise them to `power` and `Array.prototype.reduce()` to add them together.\nOmit the second argument, `power`, to use a default power of `2`.\nOmit the third argument, `start`, to use a default starting value of `1`.\n\n",
         "codeBlocks": {
-          "es6": "const sumPower = (end, power = 2, start = 1) =>\r\n  Array(end + 1 - start)\r\n    .fill(0)\r\n    .map((x, i) => (i + start) ** power)\r\n    .reduce((a, b) => a + b, 0);",
+          "es6": "const sumPower = (end, power = 2, start = 1) =>\n  Array(end + 1 - start)\n    .fill(0)\n    .map((x, i) => (i + start) ** power)\n    .reduce((a, b) => a + b, 0);",
           "es5": "var sumPower = function sumPower(end) {\n  var power = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var start = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;\n  return Array(end + 1 - start).fill(0).map(function (x, i) {\n    return Math.pow(i + start, power);\n  }).reduce(function (a, b) {\n    return a + b;\n  }, 0);\n};",
-          "example": "sumPower(10); // 385\r\nsumPower(10, 3); // 3025\r\nsumPower(10, 3, 5); // 2925"
+          "example": "sumPower(10); // 385\nsumPower(10, 3); // 3025\nsumPower(10, 3, 5); // 2925"
         },
         "tags": [
           "math",
@@ -6438,7 +6438,7 @@
         ]
       },
       "meta": {
-        "hash": "366850ca91f713d2e8fb174e9f8bd5a7748a434399ff7c1b5075955a08078521"
+        "hash": "5ba3bb9fbfb3e5b61195b6e72e5b8f9f3e86b1a9b478e52f2429c4399718d118"
       }
     },
     {
@@ -6449,9 +6449,9 @@
         "fileName": "symmetricDifference.md",
         "text": "Returns the symmetric difference between two arrays, without filtering out duplicate values.\n\nCreate a `Set` from each array, then use `Array.prototype.filter()` on each of them to only keep values not contained in the other.\n\n",
         "codeBlocks": {
-          "es6": "const symmetricDifference = (a, b) => {\r\n  const sA = new Set(a),\r\n    sB = new Set(b);\r\n  return [...a.filter(x => !sB.has(x)), ...b.filter(x => !sA.has(x))];\r\n};",
+          "es6": "const symmetricDifference = (a, b) => {\n  const sA = new Set(a),\n    sB = new Set(b);\n  return [...a.filter(x => !sB.has(x)), ...b.filter(x => !sA.has(x))];\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar symmetricDifference = function symmetricDifference(a, b) {\n  var sA = new Set(a),\n      sB = new Set(b);\n  return [].concat(_toConsumableArray(a.filter(function (x) {\n    return !sB.has(x);\n  })), _toConsumableArray(b.filter(function (x) {\n    return !sA.has(x);\n  })));\n};",
-          "example": "symmetricDifference([1, 2, 3], [1, 2, 4]); // [3, 4]\r\nsymmetricDifference([1, 2, 2], [1, 3, 1]); // [2, 2, 3]"
+          "example": "symmetricDifference([1, 2, 3], [1, 2, 4]); // [3, 4]\nsymmetricDifference([1, 2, 2], [1, 3, 1]); // [2, 2, 3]"
         },
         "tags": [
           "array",
@@ -6460,7 +6460,7 @@
         ]
       },
       "meta": {
-        "hash": "b8e93a3c40ea05f379ab326d9ed2e4ac14949f7154d4e7fc2d17efa6a5481799"
+        "hash": "7f920d42aa9408822b33d9790b0664f7f289989a363f21e9a1a87cb88510fb54"
       }
     },
     {
@@ -6471,7 +6471,7 @@
         "fileName": "symmetricDifferenceBy.md",
         "text": "Returns the symmetric difference between two arrays, after applying the provided function to each array element of both.\n\nCreate a `Set` by applying `fn` to each array's elements, then use `Array.prototype.filter()` on each of them to only keep values not contained in the other.\n\n",
         "codeBlocks": {
-          "es6": "const symmetricDifferenceBy = (a, b, fn) => {\r\n  const sA = new Set(a.map(v => fn(v))),\r\n    sB = new Set(b.map(v => fn(v)));\r\n  return [...a.filter(x => !sB.has(fn(x))), ...b.filter(x => !sA.has(fn(x)))];\r\n};",
+          "es6": "const symmetricDifferenceBy = (a, b, fn) => {\n  const sA = new Set(a.map(v => fn(v))),\n    sB = new Set(b.map(v => fn(v)));\n  return [...a.filter(x => !sB.has(fn(x))), ...b.filter(x => !sA.has(fn(x)))];\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar symmetricDifferenceBy = function symmetricDifferenceBy(a, b, fn) {\n  var sA = new Set(a.map(function (v) {\n    return fn(v);\n  })),\n      sB = new Set(b.map(function (v) {\n    return fn(v);\n  }));\n  return [].concat(_toConsumableArray(a.filter(function (x) {\n    return !sB.has(fn(x));\n  })), _toConsumableArray(b.filter(function (x) {\n    return !sA.has(fn(x));\n  })));\n};",
           "example": "symmetricDifferenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [ 1.2, 3.4 ]"
         },
@@ -6482,7 +6482,7 @@
         ]
       },
       "meta": {
-        "hash": "9fae38c78ae503c8e43dff66b18620706576f08fe7367af6ecceb11a20e518e9"
+        "hash": "f31a5937c12873095d7e167410eab03efdffb4bf6eb0561881a66111ddc750a7"
       }
     },
     {
@@ -6493,9 +6493,9 @@
         "fileName": "symmetricDifferenceWith.md",
         "text": "Returns the symmetric difference between two arrays, using a provided function as a comparator.\n\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` to find the appropriate values.\n\n",
         "codeBlocks": {
-          "es6": "const symmetricDifferenceWith = (arr, val, comp) => [\r\n  ...arr.filter(a => val.findIndex(b => comp(a, b)) === -1),\r\n  ...val.filter(a => arr.findIndex(b => comp(a, b)) === -1)\r\n];",
+          "es6": "const symmetricDifferenceWith = (arr, val, comp) => [\n  ...arr.filter(a => val.findIndex(b => comp(a, b)) === -1),\n  ...val.filter(a => arr.findIndex(b => comp(a, b)) === -1)\n];",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar symmetricDifferenceWith = function symmetricDifferenceWith(arr, val, comp) {\n  return [].concat(_toConsumableArray(arr.filter(function (a) {\n    return val.findIndex(function (b) {\n      return comp(a, b);\n    }) === -1;\n  })), _toConsumableArray(val.filter(function (a) {\n    return arr.findIndex(function (b) {\n      return comp(a, b);\n    }) === -1;\n  })));\n};",
-          "example": "symmetricDifferenceWith(\r\n  [1, 1.2, 1.5, 3, 0],\r\n  [1.9, 3, 0, 3.9],\r\n  (a, b) => Math.round(a) === Math.round(b)\r\n); // [1, 1.2, 3.9]"
+          "example": "symmetricDifferenceWith(\n  [1, 1.2, 1.5, 3, 0],\n  [1.9, 3, 0, 3.9],\n  (a, b) => Math.round(a) === Math.round(b)\n); // [1, 1.2, 3.9]"
         },
         "tags": [
           "array",
@@ -6504,7 +6504,7 @@
         ]
       },
       "meta": {
-        "hash": "d9125d25ac50396ddd1efa084257c92729a5ddb8c50fbc681d242ce2b805cf25"
+        "hash": "2d54a197d2cd14bddc7daf88f64413ad8c3b4a42fdee91a0a5cf45d71688d8cf"
       }
     },
     {
@@ -6517,7 +6517,7 @@
         "codeBlocks": {
           "es6": "const tail = arr => (arr.length > 1 ? arr.slice(1) : arr);",
           "es5": "var tail = function tail(arr) {\n  return arr.length > 1 ? arr.slice(1) : arr;\n};",
-          "example": "tail([1, 2, 3]); // [2,3]\r\ntail([1]); // [1]"
+          "example": "tail([1, 2, 3]); // [2,3]\ntail([1]); // [1]"
         },
         "tags": [
           "array",
@@ -6525,7 +6525,7 @@
         ]
       },
       "meta": {
-        "hash": "1e70ae6e7bd4ed20eea6aa70d73df0a73e71d5af12ede047786ec894eb8a5a1d"
+        "hash": "200a7d0c4ccca7ad8f80c9489ed461d46d5ad0ca75184d18c3414437fd99bad2"
       }
     },
     {
@@ -6538,7 +6538,7 @@
         "codeBlocks": {
           "es6": "const take = (arr, n = 1) => arr.slice(0, n);",
           "es5": "var take = function take(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return arr.slice(0, n);\n};",
-          "example": "take([1, 2, 3], 5); // [1, 2, 3]\r\ntake([1, 2, 3], 0); // []"
+          "example": "take([1, 2, 3], 5); // [1, 2, 3]\ntake([1, 2, 3], 0); // []"
         },
         "tags": [
           "array",
@@ -6546,7 +6546,7 @@
         ]
       },
       "meta": {
-        "hash": "c680328d56d076e2e8ca088a6ba2d847e154b1e685f906007043e1067393ac75"
+        "hash": "670d66a804a498c3826e65fe1cb8917832f72ff3a41cdee9f3c29f357aadb7fb"
       }
     },
     {
@@ -6559,7 +6559,7 @@
         "codeBlocks": {
           "es6": "const takeRight = (arr, n = 1) => arr.slice(arr.length - n, arr.length);",
           "es5": "var takeRight = function takeRight(arr) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return arr.slice(arr.length - n, arr.length);\n};",
-          "example": "takeRight([1, 2, 3], 2); // [ 2, 3 ]\r\ntakeRight([1, 2, 3]); // [3]"
+          "example": "takeRight([1, 2, 3], 2); // [ 2, 3 ]\ntakeRight([1, 2, 3]); // [3]"
         },
         "tags": [
           "array",
@@ -6567,7 +6567,7 @@
         ]
       },
       "meta": {
-        "hash": "f5876f1de114686d4fc591cb3495a4b67940e54bb0b5e081a355a6fb788fe6b7"
+        "hash": "4c83bc03b1146f6a9f49f12855a4118dd32367b6b6d46e64e94959404411e823"
       }
     },
     {
@@ -6578,7 +6578,7 @@
         "fileName": "takeRightWhile.md",
         "text": "Removes elements from the end of an array until the passed function returns `true`. Returns the removed elements.\n\nLoop through the array, using a `Array.prototype.reduceRight()` and accumulating elements while the function returns falsy value.\n\n",
         "codeBlocks": {
-          "es6": "const takeRightWhile = (arr, func) =>\r\n  arr.reduceRight((acc, el) => (func(el) ? acc : [el, ...acc]), []);",
+          "es6": "const takeRightWhile = (arr, func) =>\n  arr.reduceRight((acc, el) => (func(el) ? acc : [el, ...acc]), []);",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar takeRightWhile = function takeRightWhile(arr, func) {\n  return arr.reduceRight(function (acc, el) {\n    return func(el) ? acc : [el].concat(_toConsumableArray(acc));\n  }, []);\n};",
           "example": "takeRightWhile([1, 2, 3, 4], n => n < 3); // [3, 4]"
         },
@@ -6589,7 +6589,7 @@
         ]
       },
       "meta": {
-        "hash": "1bfc91fad9d599076ff5a58f19c2db755db842bf38763fae83f9ad607cc47c6f"
+        "hash": "ee5e3e006f3b756090a5f3f02cd0d2ea06da048dd0550277c25719b83ceeeaf6"
       }
     },
     {
@@ -6600,7 +6600,7 @@
         "fileName": "takeWhile.md",
         "text": "Removes elements in an array until the passed function returns `true`. Returns the removed elements.\n\nLoop through the array, using a `for...of` loop over `Array.prototype.entries()` until the returned value from the function is `true`.\nReturn the removed elements, using `Array.prototype.slice()`.\n\n",
         "codeBlocks": {
-          "es6": "const takeWhile = (arr, func) => {\r\n  for (const [i, val] of arr.entries()) if (func(val)) return arr.slice(0, i);\r\n  return arr;\r\n};",
+          "es6": "const takeWhile = (arr, func) => {\n  for (const [i, val] of arr.entries()) if (func(val)) return arr.slice(0, i);\n  return arr;\n};",
           "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar takeWhile = function takeWhile(arr, func) {\n  var _iteratorNormalCompletion = true;\n  var _didIteratorError = false;\n  var _iteratorError = undefined;\n\n  try {\n    for (var _iterator = arr.entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n      var _step$value = _slicedToArray(_step.value, 2),\n          i = _step$value[0],\n          val = _step$value[1];\n\n      if (func(val)) return arr.slice(0, i);\n    }\n  } catch (err) {\n    _didIteratorError = true;\n    _iteratorError = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion && _iterator[\"return\"] != null) {\n        _iterator[\"return\"]();\n      }\n    } finally {\n      if (_didIteratorError) {\n        throw _iteratorError;\n      }\n    }\n  }\n\n  return arr;\n};",
           "example": "takeWhile([1, 2, 3, 4], n => n >= 3); // [1, 2]"
         },
@@ -6611,7 +6611,7 @@
         ]
       },
       "meta": {
-        "hash": "4759e12c906e134d6445bb9f84bc0c40815e5a2381f3cfedb76681393e35381c"
+        "hash": "1131730353754c8cdb3f3c2d81eb750fbfc99020ff7266987253e857b9aee6c5"
       }
     },
     {
@@ -6622,9 +6622,9 @@
         "fileName": "throttle.md",
         "text": "Creates a throttled function that only invokes the provided function at most once per every `wait` milliseconds\n\nUse `setTimeout()` and `clearTimeout()` to throttle the given method, `fn`.\nUse `Function.prototype.apply()` to apply the `this` context to the function and provide the necessary `arguments`.\nUse `Date.now()` to keep track of the last time the throttled function was invoked.\nOmit the second argument, `wait`, to set the timeout at a default of 0 ms.\n\n",
         "codeBlocks": {
-          "es6": "const throttle = (fn, wait) => {\r\n  let inThrottle, lastFn, lastTime;\r\n  return function() {\r\n    const context = this,\r\n      args = arguments;\r\n    if (!inThrottle) {\r\n      fn.apply(context, args);\r\n      lastTime = Date.now();\r\n      inThrottle = true;\r\n    } else {\r\n      clearTimeout(lastFn);\r\n      lastFn = setTimeout(function() {\r\n        if (Date.now() - lastTime >= wait) {\r\n          fn.apply(context, args);\r\n          lastTime = Date.now();\r\n        }\r\n      }, Math.max(wait - (Date.now() - lastTime), 0));\r\n    }\r\n  };\r\n};",
+          "es6": "const throttle = (fn, wait) => {\n  let inThrottle, lastFn, lastTime;\n  return function() {\n    const context = this,\n      args = arguments;\n    if (!inThrottle) {\n      fn.apply(context, args);\n      lastTime = Date.now();\n      inThrottle = true;\n    } else {\n      clearTimeout(lastFn);\n      lastFn = setTimeout(function() {\n        if (Date.now() - lastTime >= wait) {\n          fn.apply(context, args);\n          lastTime = Date.now();\n        }\n      }, Math.max(wait - (Date.now() - lastTime), 0));\n    }\n  };\n};",
           "es5": "var throttle = function throttle(fn, wait) {\n  var inThrottle, lastFn, lastTime;\n  return function () {\n    var context = this,\n        args = arguments;\n\n    if (!inThrottle) {\n      fn.apply(context, args);\n      lastTime = Date.now();\n      inThrottle = true;\n    } else {\n      clearTimeout(lastFn);\n      lastFn = setTimeout(function () {\n        if (Date.now() - lastTime >= wait) {\n          fn.apply(context, args);\n          lastTime = Date.now();\n        }\n      }, Math.max(wait - (Date.now() - lastTime), 0));\n    }\n  };\n};",
-          "example": "window.addEventListener(\r\n  'resize',\r\n  throttle(function(evt) {\r\n    console.log(window.innerWidth);\r\n    console.log(window.innerHeight);\r\n  }, 250)\r\n); // Will log the window dimensions at most every 250ms"
+          "example": "window.addEventListener(\n  'resize',\n  throttle(function(evt) {\n    console.log(window.innerWidth);\n    console.log(window.innerHeight);\n  }, 250)\n); // Will log the window dimensions at most every 250ms"
         },
         "tags": [
           "function",
@@ -6632,7 +6632,7 @@
         ]
       },
       "meta": {
-        "hash": "b076b44e9bcfaff686b2edd329bd22938fa5a50ae7db2e21201e7233ec3addaf"
+        "hash": "0ff3f88fae6144b972137023cf882931df405a09413c1c48bdcb7ed78c1977aa"
       }
     },
     {
@@ -6643,9 +6643,9 @@
         "fileName": "times.md",
         "text": "Iterates over a callback `n` times\n\nUse `Function.call()` to call `fn` `n` times or until it returns `false`.\nOmit the last argument, `context`, to use an `undefined` object (or the global object in non-strict mode).\n\n",
         "codeBlocks": {
-          "es6": "const times = (n, fn, context = undefined) => {\r\n  let i = 0;\r\n  while (fn.call(context, i) !== false && ++i < n) {}\r\n};",
+          "es6": "const times = (n, fn, context = undefined) => {\n  let i = 0;\n  while (fn.call(context, i) !== false && ++i < n) {}\n};",
           "es5": "var times = function times(n, fn) {\n  var context = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : undefined;\n  var i = 0;\n\n  while (fn.call(context, i) !== false && ++i < n) {}\n};",
-          "example": "var output = '';\r\ntimes(5, i => (output += i));\r\nconsole.log(output); // 01234"
+          "example": "var output = '';\ntimes(5, i => (output += i));\nconsole.log(output); // 01234"
         },
         "tags": [
           "function",
@@ -6653,7 +6653,7 @@
         ]
       },
       "meta": {
-        "hash": "b8167f33f791a4890383b967fbe55eacc3f9fb9f1d866f669c184aab4a703e71"
+        "hash": "f4f19054ff681f91e6d45f0b08ce964192b96eac5a6807df85877457cb4b366c"
       }
     },
     {
@@ -6664,7 +6664,7 @@
         "fileName": "timeTaken.md",
         "text": "Measures the time taken by a function to execute.\n\nUse `console.time()` and `console.timeEnd()` to measure the difference between the start and end times to determine how long the callback took to execute.\n\n",
         "codeBlocks": {
-          "es6": "const timeTaken = callback => {\r\n  console.time('timeTaken');\r\n  const r = callback();\r\n  console.timeEnd('timeTaken');\r\n  return r;\r\n};",
+          "es6": "const timeTaken = callback => {\n  console.time('timeTaken');\n  const r = callback();\n  console.timeEnd('timeTaken');\n  return r;\n};",
           "es5": "var timeTaken = function timeTaken(callback) {\n  console.time('timeTaken');\n  var r = callback();\n  console.timeEnd('timeTaken');\n  return r;\n};",
           "example": "timeTaken(() => Math.pow(2, 10)); // 1024, (logged): timeTaken: 0.02099609375ms"
         },
@@ -6674,7 +6674,7 @@
         ]
       },
       "meta": {
-        "hash": "f4d53ad4fb4f62d81c2ae71a6e63d0e9743611ffb1692e8cc69a942740046051"
+        "hash": "26246364ba1e8e3f52a51c8e1f329af721b05a5d307ed88bf31ccd2620c0deee"
       }
     },
     {
@@ -6685,9 +6685,9 @@
         "fileName": "toCamelCase.md",
         "text": "Converts a string to camelcase.\n\nBreak the string into words and combine them capitalizing the first letter of each word, using a regexp.\n\n",
         "codeBlocks": {
-          "es6": "const toCamelCase = str => {\r\n  let s =\r\n    str &&\r\n    str\r\n      .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\r\n      .map(x => x.slice(0, 1).toUpperCase() + x.slice(1).toLowerCase())\r\n      .join('');\r\n  return s.slice(0, 1).toLowerCase() + s.slice(1);\r\n};",
+          "es6": "const toCamelCase = str => {\n  let s =\n    str &&\n    str\n      .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\n      .map(x => x.slice(0, 1).toUpperCase() + x.slice(1).toLowerCase())\n      .join('');\n  return s.slice(0, 1).toLowerCase() + s.slice(1);\n};",
           "es5": "var toCamelCase = function toCamelCase(str) {\n  var s = str && str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function (x) {\n    return x.slice(0, 1).toUpperCase() + x.slice(1).toLowerCase();\n  }).join('');\n  return s.slice(0, 1).toLowerCase() + s.slice(1);\n};",
-          "example": "toCamelCase('some_database_field_name'); // 'someDatabaseFieldName'\r\ntoCamelCase('Some label that needs to be camelized'); // 'someLabelThatNeedsToBeCamelized'\r\ntoCamelCase('some-javascript-property'); // 'someJavascriptProperty'\r\ntoCamelCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'someMixedStringWithSpacesUnderscoresAndHyphens'"
+          "example": "toCamelCase('some_database_field_name'); // 'someDatabaseFieldName'\ntoCamelCase('Some label that needs to be camelized'); // 'someLabelThatNeedsToBeCamelized'\ntoCamelCase('some-javascript-property'); // 'someJavascriptProperty'\ntoCamelCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'someMixedStringWithSpacesUnderscoresAndHyphens'"
         },
         "tags": [
           "string",
@@ -6696,7 +6696,7 @@
         ]
       },
       "meta": {
-        "hash": "2b9492d4623bde93a43fcd9980d078eded1b4c936eca1e250d8d0df4f4f77d63"
+        "hash": "5a38a98081a22fe5a56d272038bc1f7dadab097b1cf4c16c34286e9d51c26331"
       }
     },
     {
@@ -6707,9 +6707,9 @@
         "fileName": "toCurrency.md",
         "text": "Take a number and return specified currency formatting.\n\nUse `Intl.NumberFormat` to enable country / currency sensitive formatting.\n\n",
         "codeBlocks": {
-          "es6": "const toCurrency = (n, curr, LanguageFormat = undefined) =>\r\n  Intl.NumberFormat(LanguageFormat, { style: 'currency', currency: curr }).format(n);",
+          "es6": "const toCurrency = (n, curr, LanguageFormat = undefined) =>\n  Intl.NumberFormat(LanguageFormat, { style: 'currency', currency: curr }).format(n);",
           "es5": "var toCurrency = function toCurrency(n, curr) {\n  var LanguageFormat = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : undefined;\n  return Intl.NumberFormat(LanguageFormat, {\n    style: 'currency',\n    currency: curr\n  }).format(n);\n};",
-          "example": "toCurrency(123456.789, 'EUR'); // €123,456.79  | currency: Euro | currencyLangFormat: Local\r\ntoCurrency(123456.789, 'USD', 'en-us'); // $123,456.79  | currency: US Dollar | currencyLangFormat: English (United States)\r\ntoCurrency(123456.789, 'USD', 'fa'); // ۱۲۳٬۴۵۶٫۷۹ ؜$ | currency: US Dollar | currencyLangFormat: Farsi\r\ntoCurrency(322342436423.2435, 'JPY'); // ¥322,342,436,423 | currency: Japanese Yen | currencyLangFormat: Local\r\ntoCurrency(322342436423.2435, 'JPY', 'fi'); // 322 342 436 423 ¥ | currency: Japanese Yen | currencyLangFormat: Finnish"
+          "example": "toCurrency(123456.789, 'EUR'); // €123,456.79  | currency: Euro | currencyLangFormat: Local\ntoCurrency(123456.789, 'USD', 'en-us'); // $123,456.79  | currency: US Dollar | currencyLangFormat: English (United States)\ntoCurrency(123456.789, 'USD', 'fa'); // ۱۲۳٬۴۵۶٫۷۹ ؜$ | currency: US Dollar | currencyLangFormat: Farsi\ntoCurrency(322342436423.2435, 'JPY'); // ¥322,342,436,423 | currency: Japanese Yen | currencyLangFormat: Local\ntoCurrency(322342436423.2435, 'JPY', 'fi'); // 322 342 436 423 ¥ | currency: Japanese Yen | currencyLangFormat: Finnish"
         },
         "tags": [
           "utility",
@@ -6717,7 +6717,7 @@
         ]
       },
       "meta": {
-        "hash": "82f1ee7e0691ac78fcb4f4fd1ec6328023f5079bdcd5235f9ef2ee4bfcb35619"
+        "hash": "2f817f7dc3ca24a50bfaa1a59dec3ec6d8ee3392ac2d7f3ecae3a93a9c96f09c"
       }
     },
     {
@@ -6739,7 +6739,7 @@
         ]
       },
       "meta": {
-        "hash": "ab620b01c52481708880d3741a6c2bbb12db547ef5f3b24eb9cd16e907f2c65b"
+        "hash": "426eb2319298548df80de3db701eb3c130abd4ff9613a87bd2ae55f76aae7039"
       }
     },
     {
@@ -6760,7 +6760,7 @@
         ]
       },
       "meta": {
-        "hash": "476069d28b960fdd4d65414ccc582c76096a4a6662421c74a72a72a043486412"
+        "hash": "994b3e4bd75982d26fef1b3812890b90118c8d89aec6e8a666ce7e132c382081"
       }
     },
     {
@@ -6771,9 +6771,9 @@
         "fileName": "toHash.md",
         "text": "Reduces a given Array-like into a value hash (keyed data store).\n\nGiven an Iterable or Array-like structure, call `Array.prototype.reduce.call()` on the provided object to step over it and return an Object, keyed by the reference value.\n\n",
         "codeBlocks": {
-          "es6": "const toHash = (object, key) =>\r\n  Array.prototype.reduce.call(\r\n    object,\r\n    (acc, data, index) => ((acc[!key ? index : data[key]] = data), acc),\r\n    {}\r\n  );",
+          "es6": "const toHash = (object, key) =>\n  Array.prototype.reduce.call(\n    object,\n    (acc, data, index) => ((acc[!key ? index : data[key]] = data), acc),\n    {}\n  );",
           "es5": "var toHash = function toHash(object, key) {\n  return Array.prototype.reduce.call(object, function (acc, data, index) {\n    return acc[!key ? index : data[key]] = data, acc;\n  }, {});\n};",
-          "example": "toHash([4, 3, 2, 1]); // { 0: 4, 1: 3, 2: 2, 3: 1 }\r\ntoHash([{ a: 'label' }], 'a'); // { label: { a: 'label' } }\r\n// A more in depth example:\r\nlet users = [{ id: 1, first: 'Jon' }, { id: 2, first: 'Joe' }, { id: 3, first: 'Moe' }];\r\nlet managers = [{ manager: 1, employees: [2, 3] }];\r\n// We use function here because we want a bindable reference, but a closure referencing the hash would work, too.\r\nmanagers.forEach(\r\n  manager =>\r\n    (manager.employees = manager.employees.map(function(id) {\r\n      return this[id];\r\n    }, toHash(users, 'id')))\r\n);\r\nmanagers; // [ { manager:1, employees: [ { id: 2, first: \"Joe\" }, { id: 3, first: \"Moe\" } ] } ]"
+          "example": "toHash([4, 3, 2, 1]); // { 0: 4, 1: 3, 2: 2, 3: 1 }\ntoHash([{ a: 'label' }], 'a'); // { label: { a: 'label' } }\n// A more in depth example:\nlet users = [{ id: 1, first: 'Jon' }, { id: 2, first: 'Joe' }, { id: 3, first: 'Moe' }];\nlet managers = [{ manager: 1, employees: [2, 3] }];\n// We use function here because we want a bindable reference, but a closure referencing the hash would work, too.\nmanagers.forEach(\n  manager =>\n    (manager.employees = manager.employees.map(function(id) {\n      return this[id];\n    }, toHash(users, 'id')))\n);\nmanagers; // [ { manager:1, employees: [ { id: 2, first: \"Joe\" }, { id: 3, first: \"Moe\" } ] } ]"
         },
         "tags": [
           "array",
@@ -6781,7 +6781,7 @@
         ]
       },
       "meta": {
-        "hash": "2fbfe0bedd6f3f740fd23d5cbcf04b101ced73bed5c857ae526974a117813545"
+        "hash": "4d9656f6d96e3cdd49ab1df4389315e004c5a134fe22ad1036befb6168ee1e54"
       }
     },
     {
@@ -6792,9 +6792,9 @@
         "fileName": "toKebabCase.md",
         "text": "Converts a string to kebab case.\n\nBreak the string into words and combine them adding `-` as a separator, using a regexp.\n\n",
         "codeBlocks": {
-          "es6": "const toKebabCase = str =>\r\n  str &&\r\n  str\r\n    .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\r\n    .map(x => x.toLowerCase())\r\n    .join('-');",
+          "es6": "const toKebabCase = str =>\n  str &&\n  str\n    .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\n    .map(x => x.toLowerCase())\n    .join('-');",
           "es5": "var toKebabCase = function toKebabCase(str) {\n  return str && str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function (x) {\n    return x.toLowerCase();\n  }).join('-');\n};",
-          "example": "toKebabCase('camelCase'); // 'camel-case'\r\ntoKebabCase('some text'); // 'some-text'\r\ntoKebabCase('some-mixed_string With spaces_underscores-and-hyphens'); // 'some-mixed-string-with-spaces-underscores-and-hyphens'\r\ntoKebabCase('AllThe-small Things'); // \"all-the-small-things\"\r\ntoKebabCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML'); // \"i-am-listening-to-fm-while-loading-different-url-on-my-browser-and-also-editing-xml-and-html\""
+          "example": "toKebabCase('camelCase'); // 'camel-case'\ntoKebabCase('some text'); // 'some-text'\ntoKebabCase('some-mixed_string With spaces_underscores-and-hyphens'); // 'some-mixed-string-with-spaces-underscores-and-hyphens'\ntoKebabCase('AllThe-small Things'); // \"all-the-small-things\"\ntoKebabCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML'); // \"i-am-listening-to-fm-while-loading-different-url-on-my-browser-and-also-editing-xml-and-html\""
         },
         "tags": [
           "string",
@@ -6803,7 +6803,7 @@
         ]
       },
       "meta": {
-        "hash": "c5b8ef27942b0caada88baf6864ebcb8105b6e9379547e4479e9ee6b7b02ac68"
+        "hash": "0981cb8583c317d56894840bb31fd83e820b56fd7eef18d96db1edcb0a222860"
       }
     },
     {
@@ -6814,7 +6814,7 @@
         "fileName": "tomorrow.md",
         "text": "Results in a string representation of tomorrow's date.\n\nUse `new Date()` to get the current date, increment by one using `Date.getDate()` and set the value to the result using `Date.setDate()`. \nUse `Date.prototype.toISOString()` to return a string in `yyyy-mm-dd` format.\n\n",
         "codeBlocks": {
-          "es6": "const tomorrow = () => {\r\n  let t = new Date();\r\n  t.setDate(t.getDate() + 1);\r\n  return t.toISOString().split('T')[0];\r\n};",
+          "es6": "const tomorrow = () => {\n  let t = new Date();\n  t.setDate(t.getDate() + 1);\n  return t.toISOString().split('T')[0];\n};",
           "es5": "var tomorrow = function tomorrow() {\n  var t = new Date();\n  t.setDate(t.getDate() + 1);\n  return t.toISOString().split('T')[0];\n};",
           "example": "tomorrow(); // 2018-10-19 (if current date is 2018-10-18)"
         },
@@ -6824,7 +6824,7 @@
         ]
       },
       "meta": {
-        "hash": "9c126e9e3250d0331bf204ceae7e1aa36dc094cf80dbf8087937196eaf7df12e"
+        "hash": "79e76e143e7f595b4d2c5be657629728cd5fb2cc4248706dedb7e0c8e9512d3c"
       }
     },
     {
@@ -6835,7 +6835,7 @@
         "fileName": "toOrdinalSuffix.md",
         "text": "Adds an ordinal suffix to a number.\n\nUse the modulo operator (`%`) to find values of single and tens digits.\nFind which ordinal pattern digits match.\nIf digit is found in teens pattern, use teens ordinal.\n\n",
         "codeBlocks": {
-          "es6": "const toOrdinalSuffix = num => {\r\n  const int = parseInt(num),\r\n    digits = [int % 10, int % 100],\r\n    ordinals = ['st', 'nd', 'rd', 'th'],\r\n    oPattern = [1, 2, 3, 4],\r\n    tPattern = [11, 12, 13, 14, 15, 16, 17, 18, 19];\r\n  return oPattern.includes(digits[0]) && !tPattern.includes(digits[1])\r\n    ? int + ordinals[digits[0] - 1]\r\n    : int + ordinals[3];\r\n};",
+          "es6": "const toOrdinalSuffix = num => {\n  const int = parseInt(num),\n    digits = [int % 10, int % 100],\n    ordinals = ['st', 'nd', 'rd', 'th'],\n    oPattern = [1, 2, 3, 4],\n    tPattern = [11, 12, 13, 14, 15, 16, 17, 18, 19];\n  return oPattern.includes(digits[0]) && !tPattern.includes(digits[1])\n    ? int + ordinals[digits[0] - 1]\n    : int + ordinals[3];\n};",
           "es5": "var toOrdinalSuffix = function toOrdinalSuffix(num) {\n  var _int = parseInt(num),\n      digits = [_int % 10, _int % 100],\n      ordinals = ['st', 'nd', 'rd', 'th'],\n      oPattern = [1, 2, 3, 4],\n      tPattern = [11, 12, 13, 14, 15, 16, 17, 18, 19];\n\n  return oPattern.includes(digits[0]) && !tPattern.includes(digits[1]) ? _int + ordinals[digits[0] - 1] : _int + ordinals[3];\n};",
           "example": "toOrdinalSuffix('123'); // \"123rd\""
         },
@@ -6846,7 +6846,7 @@
         ]
       },
       "meta": {
-        "hash": "0f75f320bb49b6ab79185cddddf6d9bfef90e53d4aa8b5884f96f260e184b442"
+        "hash": "0ebd3351685fd96bf678c2baa38fabc9aa18bd6a3fa6674ea0bae9663424ea5f"
       }
     },
     {
@@ -6857,9 +6857,9 @@
         "fileName": "toSafeInteger.md",
         "text": "Converts a value to a safe integer.\n\nUse `Math.max()` and `Math.min()` to find the closest safe value.\nUse `Math.round()` to convert to an integer.\n\n",
         "codeBlocks": {
-          "es6": "const toSafeInteger = num =>\r\n  Math.round(Math.max(Math.min(num, Number.MAX_SAFE_INTEGER), Number.MIN_SAFE_INTEGER));",
+          "es6": "const toSafeInteger = num =>\n  Math.round(Math.max(Math.min(num, Number.MAX_SAFE_INTEGER), Number.MIN_SAFE_INTEGER));",
           "es5": "var toSafeInteger = function toSafeInteger(num) {\n  return Math.round(Math.max(Math.min(num, Number.MAX_SAFE_INTEGER), Number.MIN_SAFE_INTEGER));\n};",
-          "example": "toSafeInteger('3.2'); // 3\r\ntoSafeInteger(Infinity); // 9007199254740991"
+          "example": "toSafeInteger('3.2'); // 3\ntoSafeInteger(Infinity); // 9007199254740991"
         },
         "tags": [
           "math",
@@ -6867,7 +6867,7 @@
         ]
       },
       "meta": {
-        "hash": "9f15503a0b607766e642534c47394b09f3727394f43e9e7fb06e3d53b5ebc908"
+        "hash": "ebe1997777f4fb4c97cd5ae23a0cc590a0aab8f6762ae1d39c17f27bf2efe1c6"
       }
     },
     {
@@ -6878,9 +6878,9 @@
         "fileName": "toSnakeCase.md",
         "text": "Converts a string to snake case.\n\nBreak the string into words and combine them adding `_` as a separator, using a regexp.\n\n",
         "codeBlocks": {
-          "es6": "const toSnakeCase = str =>\r\n  str &&\r\n  str\r\n    .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\r\n    .map(x => x.toLowerCase())\r\n    .join('_');",
+          "es6": "const toSnakeCase = str =>\n  str &&\n  str\n    .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\n    .map(x => x.toLowerCase())\n    .join('_');",
           "es5": "var toSnakeCase = function toSnakeCase(str) {\n  return str && str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function (x) {\n    return x.toLowerCase();\n  }).join('_');\n};",
-          "example": "toSnakeCase('camelCase'); // 'camel_case'\r\ntoSnakeCase('some text'); // 'some_text'\r\ntoSnakeCase('some-mixed_string With spaces_underscores-and-hyphens'); // 'some_mixed_string_with_spaces_underscores_and_hyphens'\r\ntoSnakeCase('AllThe-small Things'); // \"all_the_smal_things\"\r\ntoSnakeCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML'); // \"i_am_listening_to_fm_while_loading_different_url_on_my_browser_and_also_editing_some_xml_and_html\""
+          "example": "toSnakeCase('camelCase'); // 'camel_case'\ntoSnakeCase('some text'); // 'some_text'\ntoSnakeCase('some-mixed_string With spaces_underscores-and-hyphens'); // 'some_mixed_string_with_spaces_underscores_and_hyphens'\ntoSnakeCase('AllThe-small Things'); // \"all_the_smal_things\"\ntoSnakeCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML'); // \"i_am_listening_to_fm_while_loading_different_url_on_my_browser_and_also_editing_some_xml_and_html\""
         },
         "tags": [
           "string",
@@ -6889,7 +6889,7 @@
         ]
       },
       "meta": {
-        "hash": "d93f6fcf097149f6ae8dd2c317f4dce6a09c91f1fa19ddb1b5419d9d2b3390ae"
+        "hash": "84b49b4a42fc39414edc473addc5de9a956e3ad26496133bd721c8d691352def"
       }
     },
     {
@@ -6900,9 +6900,9 @@
         "fileName": "toTitleCase.md",
         "text": "Converts a string to title case.\n\nBreak the string into words, using a regexp, and combine them capitalizing the first letter of each word and adding a whitespace between them.\n\n",
         "codeBlocks": {
-          "es6": "const toTitleCase = str =>\r\n  str\r\n    .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\r\n    .map(x => x.charAt(0).toUpperCase() + x.slice(1))\r\n    .join(' ');",
+          "es6": "const toTitleCase = str =>\n  str\n    .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)\n    .map(x => x.charAt(0).toUpperCase() + x.slice(1))\n    .join(' ');",
           "es5": "var toTitleCase = function toTitleCase(str) {\n  return str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function (x) {\n    return x.charAt(0).toUpperCase() + x.slice(1);\n  }).join(' ');\n};",
-          "example": "toTitleCase('some_database_field_name'); // 'Some Database Field Name'\r\ntoTitleCase('Some label that needs to be title-cased'); // 'Some Label That Needs To Be Title Cased'\r\ntoTitleCase('some-package-name'); // 'Some Package Name'\r\ntoTitleCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'Some Mixed String With Spaces Underscores And Hyphens'"
+          "example": "toTitleCase('some_database_field_name'); // 'Some Database Field Name'\ntoTitleCase('Some label that needs to be title-cased'); // 'Some Label That Needs To Be Title Cased'\ntoTitleCase('some-package-name'); // 'Some Package Name'\ntoTitleCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'Some Mixed String With Spaces Underscores And Hyphens'"
         },
         "tags": [
           "string",
@@ -6911,7 +6911,7 @@
         ]
       },
       "meta": {
-        "hash": "35ce1d82eafc92f53b48cde75cfcadf36ef9c5946ce9c7fe05d35bc2390d0c6d"
+        "hash": "9ec5b60fcad2b633dfdbb342bf3fad8f3b63d2e06da09781c73481283f0cab1b"
       }
     },
     {
@@ -6924,7 +6924,7 @@
         "codeBlocks": {
           "es6": "const transform = (obj, fn, acc) => Object.keys(obj).reduce((a, k) => fn(a, obj[k], k, obj), acc);",
           "es5": "var transform = function transform(obj, fn, acc) {\n  return Object.keys(obj).reduce(function (a, k) {\n    return fn(a, obj[k], k, obj);\n  }, acc);\n};",
-          "example": "transform(\r\n  { a: 1, b: 2, c: 1 },\r\n  (r, v, k) => {\r\n    (r[v] || (r[v] = [])).push(k);\r\n    return r;\r\n  },\r\n  {}\r\n); // { '1': ['a', 'c'], '2': ['b'] }"
+          "example": "transform(\n  { a: 1, b: 2, c: 1 },\n  (r, v, k) => {\n    (r[v] || (r[v] = [])).push(k);\n    return r;\n  },\n  {}\n); // { '1': ['a', 'c'], '2': ['b'] }"
         },
         "tags": [
           "object",
@@ -6933,7 +6933,7 @@
         ]
       },
       "meta": {
-        "hash": "637dad1e69df73a391ae68895d0ecfaf22a549256addafd953858f002d9de291"
+        "hash": "2186f42e4ed6452b13986c08af41e7e98b6fb6528ca1994e2ee843d0453ef695"
       }
     },
     {
@@ -6944,9 +6944,9 @@
         "fileName": "triggerEvent.md",
         "text": "Triggers a specific event on a given element, optionally passing custom data.\n\nUse `new CustomEvent()` to create an event from the specified `eventType` and details.\nUse `el.dispatchEvent()` to trigger the newly created event on the given element.\nOmit the third argument, `detail`, if you do not want to pass custom data to the triggered event.\n\n",
         "codeBlocks": {
-          "es6": "const triggerEvent = (el, eventType, detail) =>\r\n  el.dispatchEvent(new CustomEvent(eventType, { detail }));",
+          "es6": "const triggerEvent = (el, eventType, detail) =>\n  el.dispatchEvent(new CustomEvent(eventType, { detail }));",
           "es5": "var triggerEvent = function triggerEvent(el, eventType, detail) {\n  return el.dispatchEvent(new CustomEvent(eventType, {\n    detail: detail\n  }));\n};",
-          "example": "triggerEvent(document.getElementById('myId'), 'click');\r\ntriggerEvent(document.getElementById('myId'), 'click', { username: 'bob' });"
+          "example": "triggerEvent(document.getElementById('myId'), 'click');\ntriggerEvent(document.getElementById('myId'), 'click', { username: 'bob' });"
         },
         "tags": [
           "browser",
@@ -6955,7 +6955,7 @@
         ]
       },
       "meta": {
-        "hash": "3b2078d891329f1c08e5fa63e9789d6bd4c240b1415c383f91e431e23a71d306"
+        "hash": "61673214d218ca447cac81b95b6766264b66fd141462fbd5e3814e4c6cf7ded2"
       }
     },
     {
@@ -6966,7 +6966,7 @@
         "fileName": "truncateString.md",
         "text": "Truncates a string up to a specified length.\n\nDetermine if the string's `length` is greater than `num`.\nReturn the string truncated to the desired length, with `'...'` appended to the end or the original string.\n\n",
         "codeBlocks": {
-          "es6": "const truncateString = (str, num) =>\r\n  str.length > num ? str.slice(0, num > 3 ? num - 3 : num) + '...' : str;",
+          "es6": "const truncateString = (str, num) =>\n  str.length > num ? str.slice(0, num > 3 ? num - 3 : num) + '...' : str;",
           "es5": "var truncateString = function truncateString(str, num) {\n  return str.length > num ? str.slice(0, num > 3 ? num - 3 : num) + '...' : str;\n};",
           "example": "truncateString('boomerang', 7); // 'boom...'"
         },
@@ -6976,7 +6976,7 @@
         ]
       },
       "meta": {
-        "hash": "3d14dbb3b40bc7432d7e1ad7363c89da0678c9c8e384f6ae2e886bc3b8960250"
+        "hash": "6f9ea1ee77d87c9b78e7b069bf27cf8bafd269023f3f7b675a65791446d7d2d3"
       }
     },
     {
@@ -6999,7 +6999,7 @@
         ]
       },
       "meta": {
-        "hash": "1c5cd5a4487b6faba52b0aa508548f63ebb3fc6d45e450ecd3fc20a58e472a3d"
+        "hash": "7e4b72845da78eb0665de207c9d94c2f728d945be47d6dd13a14b53101e7a6a4"
       }
     },
     {
@@ -7021,7 +7021,7 @@
         ]
       },
       "meta": {
-        "hash": "bd434f04c55ba07e748a4a32ccc0476ec54c97d0502cbb1c60ca7386b0da15d5"
+        "hash": "73046804bd1b91d397ee382d19eb59798f17319c1acf74393a550286be8cf087"
       }
     },
     {
@@ -7032,9 +7032,9 @@
         "fileName": "uncurry.md",
         "text": "Uncurries a function up to depth `n`.\n\nReturn a variadic function.\nUse `Array.prototype.reduce()` on the provided arguments to call each subsequent curry level of the function.\nIf the `length` of the provided arguments is less than `n` throw an error.\nOtherwise, call `fn` with the proper amount of arguments, using `Array.prototype.slice(0, n)`.\nOmit the second argument, `n`, to uncurry up to depth `1`.\n\n",
         "codeBlocks": {
-          "es6": "const uncurry = (fn, n = 1) => (...args) => {\r\n  const next = acc => args => args.reduce((x, y) => x(y), acc);\r\n  if (n > args.length) throw new RangeError('Arguments too few!');\r\n  return next(fn)(args.slice(0, n));\r\n};",
+          "es6": "const uncurry = (fn, n = 1) => (...args) => {\n  const next = acc => args => args.reduce((x, y) => x(y), acc);\n  if (n > args.length) throw new RangeError('Arguments too few!');\n  return next(fn)(args.slice(0, n));\n};",
           "es5": "var uncurry = function uncurry(fn) {\n  var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;\n  return function () {\n    var next = function next(acc) {\n      return function (args) {\n        return args.reduce(function (x, y) {\n          return x(y);\n        }, acc);\n      };\n    };\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    if (n > args.length) throw new RangeError('Arguments too few!');\n    return next(fn)(args.slice(0, n));\n  };\n};",
-          "example": "const add = x => y => z => x + y + z;\r\nconst uncurriedAdd = uncurry(add, 3);\r\nuncurriedAdd(1, 2, 3); // 6"
+          "example": "const add = x => y => z => x + y + z;\nconst uncurriedAdd = uncurry(add, 3);\nuncurriedAdd(1, 2, 3); // 6"
         },
         "tags": [
           "function",
@@ -7042,7 +7042,7 @@
         ]
       },
       "meta": {
-        "hash": "53730181591b9ac48200bb5331a45cd3ca70c00ec2aa57cc148eaaa2992ee17f"
+        "hash": "9947959c989195fe0581aa57ea3456f90d3c0e10a2f6e772f3a891ac81574f34"
       }
     },
     {
@@ -7053,7 +7053,7 @@
         "fileName": "unescapeHTML.md",
         "text": "Unescapes escaped HTML characters.\n\nUse `String.prototype.replace()` with a regex that matches the characters that need to be unescaped, using a callback function to replace each escaped character instance with its associated unescaped character using a dictionary (object).\n\n",
         "codeBlocks": {
-          "es6": "const unescapeHTML = str =>\r\n  str.replace(\r\n    /&amp;|&lt;|&gt;|&#39;|&quot;/g,\r\n    tag =>\r\n      ({\r\n        '&amp;': '&',\r\n        '&lt;': '<',\r\n        '&gt;': '>',\r\n        '&#39;': \"'\",\r\n        '&quot;': '\"'\r\n      }[tag] || tag)\r\n  );",
+          "es6": "const unescapeHTML = str =>\n  str.replace(\n    /&amp;|&lt;|&gt;|&#39;|&quot;/g,\n    tag =>\n      ({\n        '&amp;': '&',\n        '&lt;': '<',\n        '&gt;': '>',\n        '&#39;': \"'\",\n        '&quot;': '\"'\n      }[tag] || tag)\n  );",
           "es5": "var unescapeHTML = function unescapeHTML(str) {\n  return str.replace(/&amp;|&lt;|&gt;|&#39;|&quot;/g, function (tag) {\n    return {\n      '&amp;': '&',\n      '&lt;': '<',\n      '&gt;': '>',\n      '&#39;': \"'\",\n      '&quot;': '\"'\n    }[tag] || tag;\n  });\n};",
           "example": "unescapeHTML('&lt;a href=&quot;#&quot;&gt;Me &amp; you&lt;/a&gt;'); // '<a href=\"#\">Me & you</a>'"
         },
@@ -7064,7 +7064,7 @@
         ]
       },
       "meta": {
-        "hash": "b4732de7e076c350b70e3070dd0a0f127503796de26c2d34134a6e25e15f626d"
+        "hash": "f469a318ae70e50251f0430c34d8fe0f57ca9158c2a8619ba146d2246adee8d5"
       }
     },
     {
@@ -7075,7 +7075,7 @@
         "fileName": "unflattenObject.md",
         "text": "Unflatten an object with the paths for keys.\n\nUse `Object.keys(obj)` combined with `Array.prototype.reduce()` to convert flattened path node to a leaf node.\nIf the value of a key contains a dot delimiter (`.`), use `Array.prototype.split('.')`, string transformations and `JSON.parse()` to create an object, then `Object.assign()` to create the leaf node.\nOtherwise, add the appropriate key-value pair to the accumulator object.\n\n",
         "codeBlocks": {
-          "es6": "const unflattenObject = obj =>\r\n  Object.keys(obj).reduce((acc, k) => {\r\n    if (k.indexOf('.') !== -1) {\r\n      const keys = k.split('.');\r\n      Object.assign(\r\n        acc,\r\n        JSON.parse(\r\n          '{' +\r\n            keys.map((v, i) => (i !== keys.length - 1 ? `\"${v}\":{` : `\"${v}\":`)).join('') +\r\n            obj[k] +\r\n            '}'.repeat(keys.length)\r\n        )\r\n      );\r\n    } else acc[k] = obj[k];\r\n    return acc;\r\n  }, {});",
+          "es6": "const unflattenObject = obj =>\n  Object.keys(obj).reduce((acc, k) => {\n    if (k.indexOf('.') !== -1) {\n      const keys = k.split('.');\n      Object.assign(\n        acc,\n        JSON.parse(\n          '{' +\n            keys.map((v, i) => (i !== keys.length - 1 ? `\"${v}\":{` : `\"${v}\":`)).join('') +\n            obj[k] +\n            '}'.repeat(keys.length)\n        )\n      );\n    } else acc[k] = obj[k];\n    return acc;\n  }, {});",
           "es5": "var unflattenObject = function unflattenObject(obj) {\n  return Object.keys(obj).reduce(function (acc, k) {\n    if (k.indexOf('.') !== -1) {\n      var keys = k.split('.');\n      Object.assign(acc, JSON.parse('{' + keys.map(function (v, i) {\n        return i !== keys.length - 1 ? \"\\\"\".concat(v, \"\\\":{\") : \"\\\"\".concat(v, \"\\\":\");\n      }).join('') + obj[k] + '}'.repeat(keys.length)));\n    } else acc[k] = obj[k];\n\n    return acc;\n  }, {});\n};",
           "example": "unflattenObject({ 'a.b.c': 1, d: 1 }); // { a: { b: { c: 1 } }, d: 1 }"
         },
@@ -7085,7 +7085,7 @@
         ]
       },
       "meta": {
-        "hash": "264bd6b7e7c883a80866f7f59a00b07b64f296bcd244d054c0f46ff0a86f020a"
+        "hash": "bc549ec3e2504bca06ef5ce7f1424b3b7dcd8959ebe983eeb576cda7eb5f6017"
       }
     },
     {
@@ -7096,9 +7096,9 @@
         "fileName": "unfold.md",
         "text": "Builds an array, using an iterator function and an initial seed value.\n\nUse a `while` loop and `Array.prototype.push()` to call the function repeatedly until it returns `false`.\nThe iterator function accepts one argument (`seed`) and must always return an array with two elements ([`value`, `nextSeed`]) or `false` to terminate.\n\n",
         "codeBlocks": {
-          "es6": "const unfold = (fn, seed) => {\r\n  let result = [],\r\n    val = [null, seed];\r\n  while ((val = fn(val[1]))) result.push(val[0]);\r\n  return result;\r\n};",
+          "es6": "const unfold = (fn, seed) => {\n  let result = [],\n    val = [null, seed];\n  while ((val = fn(val[1]))) result.push(val[0]);\n  return result;\n};",
           "es5": "var unfold = function unfold(fn, seed) {\n  var result = [],\n      val = [null, seed];\n\n  while (val = fn(val[1])) {\n    result.push(val[0]);\n  }\n\n  return result;\n};",
-          "example": "var f = n => (n > 50 ? false : [-n, n + 10]);\r\nunfold(f, 10); // [-10, -20, -30, -40, -50]"
+          "example": "var f = n => (n > 50 ? false : [-n, n + 10]);\nunfold(f, 10); // [-10, -20, -30, -40, -50]"
         },
         "tags": [
           "function",
@@ -7107,7 +7107,7 @@
         ]
       },
       "meta": {
-        "hash": "112ed48b23b273b53473604f54baf0481f8c2e493ea3ee78ab4b68c39f84320c"
+        "hash": "c1003c7baca5e5492e603c28aaa822cf24393036d6322fd90591519f9e7c74d9"
       }
     },
     {
@@ -7129,7 +7129,7 @@
         ]
       },
       "meta": {
-        "hash": "1110cf18c16f20e694cc0563d611dcfed248caea4607cdae909f9102f892ab1b"
+        "hash": "9b1bc0a79c182b07f6c9142ceb346a2958e1902c7b5defa906f071573583dcb7"
       }
     },
     {
@@ -7140,7 +7140,7 @@
         "fileName": "unionBy.md",
         "text": "Returns every element that exists in any of the two arrays once, after applying the provided function to each array element of both.\n\nCreate a `Set` by applying all `fn` to all values of `a`.\nCreate a `Set` from `a` and all elements in `b` whose value, after applying `fn` does not match a value in the previously created set.\nReturn the last set converted to an array.\n\n",
         "codeBlocks": {
-          "es6": "const unionBy = (a, b, fn) => {\r\n  const s = new Set(a.map(fn));\r\n  return Array.from(new Set([...a, ...b.filter(x => !s.has(fn(x)))]));\r\n};",
+          "es6": "const unionBy = (a, b, fn) => {\n  const s = new Set(a.map(fn));\n  return Array.from(new Set([...a, ...b.filter(x => !s.has(fn(x)))]));\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar unionBy = function unionBy(a, b, fn) {\n  var s = new Set(a.map(fn));\n  return Array.from(new Set([].concat(_toConsumableArray(a), _toConsumableArray(b.filter(function (x) {\n    return !s.has(fn(x));\n  })))));\n};",
           "example": "unionBy([2.1], [1.2, 2.3], Math.floor); // [2.1, 1.2]"
         },
@@ -7151,7 +7151,7 @@
         ]
       },
       "meta": {
-        "hash": "3f979ac8d6aa0c3063f43cb9f04afb749ac20c5380b137575baf8d5bd6df2c66"
+        "hash": "db6fe4b924d30c2d844e7c55a1b73250c323ccccaa22ae15d936ce653a5c7a15"
       }
     },
     {
@@ -7162,7 +7162,7 @@
         "fileName": "unionWith.md",
         "text": "Returns every element that exists in any of the two arrays once, using a provided comparator function.\n\nCreate a `Set` with all values of `a` and values in `b` for which the comparator finds no matches in `a`, using `Array.prototype.findIndex()`.\n\n",
         "codeBlocks": {
-          "es6": "const unionWith = (a, b, comp) =>\r\n  Array.from(new Set([...a, ...b.filter(x => a.findIndex(y => comp(x, y)) === -1)]));",
+          "es6": "const unionWith = (a, b, comp) =>\n  Array.from(new Set([...a, ...b.filter(x => a.findIndex(y => comp(x, y)) === -1)]));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar unionWith = function unionWith(a, b, comp) {\n  return Array.from(new Set([].concat(_toConsumableArray(a), _toConsumableArray(b.filter(function (x) {\n    return a.findIndex(function (y) {\n      return comp(x, y);\n    }) === -1;\n  })))));\n};",
           "example": "unionWith([1, 1.2, 1.5, 3, 0], [1.9, 3, 0, 3.9], (a, b) => Math.round(a) === Math.round(b)); // [1, 1.2, 1.5, 3, 0, 3.9]"
         },
@@ -7173,7 +7173,7 @@
         ]
       },
       "meta": {
-        "hash": "5f9ae7bec326eec143bbdf370c563d6b4dff298867366c20111b60bd7d5ee37b"
+        "hash": "2784f965f4f4c04998f63b440c6554613bb2042ea1b45a461775c8ffc9e2ec29"
       }
     },
     {
@@ -7194,7 +7194,7 @@
         ]
       },
       "meta": {
-        "hash": "b0f9c2c8468e300e3cf598b254f781dde03fe66bc68b2df7241ea711b82f230e"
+        "hash": "474b3568e2a842246ff6ab2800aeec3f82353732080bb63911adb142d273e34c"
       }
     },
     {
@@ -7205,9 +7205,9 @@
         "fileName": "uniqueElementsBy.md",
         "text": "Returns all unique values of an array, based on a provided comparator function.\n\nUse `Array.prototype.reduce()` and `Array.prototype.some()` for an array containing only the first unique occurrence of each value, based on the comparator function, `fn`.\nThe comparator function takes two arguments: the values of the two elements being compared.\n\n",
         "codeBlocks": {
-          "es6": "const uniqueElementsBy = (arr, fn) =>\r\n  arr.reduce((acc, v) => {\r\n    if (!acc.some(x => fn(v, x))) acc.push(v);\r\n    return acc;\r\n  }, []);",
+          "es6": "const uniqueElementsBy = (arr, fn) =>\n  arr.reduce((acc, v) => {\n    if (!acc.some(x => fn(v, x))) acc.push(v);\n    return acc;\n  }, []);",
           "es5": "var uniqueElementsBy = function uniqueElementsBy(arr, fn) {\n  return arr.reduce(function (acc, v) {\n    if (!acc.some(function (x) {\n      return fn(v, x);\n    })) acc.push(v);\n    return acc;\n  }, []);\n};",
-          "example": "uniqueElementsBy(\r\n  [\r\n    { id: 0, value: 'a' },\r\n    { id: 1, value: 'b' },\r\n    { id: 2, value: 'c' },\r\n    { id: 1, value: 'd' },\r\n    { id: 0, value: 'e' }\r\n  ],\r\n  (a, b) => a.id == b.id\r\n); // [ { id: 0, value: 'a' }, { id: 1, value: 'b' }, { id: 2, value: 'c' } ]"
+          "example": "uniqueElementsBy(\n  [\n    { id: 0, value: 'a' },\n    { id: 1, value: 'b' },\n    { id: 2, value: 'c' },\n    { id: 1, value: 'd' },\n    { id: 0, value: 'e' }\n  ],\n  (a, b) => a.id == b.id\n); // [ { id: 0, value: 'a' }, { id: 1, value: 'b' }, { id: 2, value: 'c' } ]"
         },
         "tags": [
           "array",
@@ -7216,7 +7216,7 @@
         ]
       },
       "meta": {
-        "hash": "06ff0d53ab6a331d8ce2328bc6b3508499643b949619b3cde76c76b62ce3dc9e"
+        "hash": "a506c398c0d84b8c6926b70e62f28ca6180a02d010088c89fc9c8d7e2706e0bc"
       }
     },
     {
@@ -7227,9 +7227,9 @@
         "fileName": "uniqueElementsByRight.md",
         "text": "Returns all unique values of an array, based on a provided comparator function, starting from the right.\n\nUse `Array.prototype.reduceRight()` and `Array.prototype.some()` for an array containing only the last unique occurrence of each value, based on the comparator function, `fn`.\nThe comparator function takes two arguments: the values of the two elements being compared.\n\n",
         "codeBlocks": {
-          "es6": "const uniqueElementsByRight = (arr, fn) =>\r\n  arr.reduceRight((acc, v) => {\r\n    if (!acc.some(x => fn(v, x))) acc.push(v);\r\n    return acc;\r\n  }, []);",
+          "es6": "const uniqueElementsByRight = (arr, fn) =>\n  arr.reduceRight((acc, v) => {\n    if (!acc.some(x => fn(v, x))) acc.push(v);\n    return acc;\n  }, []);",
           "es5": "var uniqueElementsByRight = function uniqueElementsByRight(arr, fn) {\n  return arr.reduceRight(function (acc, v) {\n    if (!acc.some(function (x) {\n      return fn(v, x);\n    })) acc.push(v);\n    return acc;\n  }, []);\n};",
-          "example": "uniqueElementsByRight(\r\n  [\r\n    { id: 0, value: 'a' },\r\n    { id: 1, value: 'b' },\r\n    { id: 2, value: 'c' },\r\n    { id: 1, value: 'd' },\r\n    { id: 0, value: 'e' }\r\n  ],\r\n  (a, b) => a.id == b.id\r\n); // [ { id: 0, value: 'e' }, { id: 1, value: 'd' }, { id: 2, value: 'c' } ]"
+          "example": "uniqueElementsByRight(\n  [\n    { id: 0, value: 'a' },\n    { id: 1, value: 'b' },\n    { id: 2, value: 'c' },\n    { id: 1, value: 'd' },\n    { id: 0, value: 'e' }\n  ],\n  (a, b) => a.id == b.id\n); // [ { id: 0, value: 'e' }, { id: 1, value: 'd' }, { id: 2, value: 'c' } ]"
         },
         "tags": [
           "array",
@@ -7238,7 +7238,7 @@
         ]
       },
       "meta": {
-        "hash": "91b32837e695469deacf85acb7c3bbf135ac4f60a400f3f2d172da5b3b16acd1"
+        "hash": "59867a867b440985ad221def644ec15594908db1d2ae413fc8a41f2669e3798a"
       }
     },
     {
@@ -7249,9 +7249,9 @@
         "fileName": "uniqueSymmetricDifference.md",
         "text": "Returns the unique symmetric difference between two arrays, not containing duplicate values from either array.\n\nUse `Array.prototype.filter()` and `Array.prototype.includes()` on each array to remove values contained in the other, then create a `Set` from the results, removing duplicate values.\n\n",
         "codeBlocks": {
-          "es6": "const uniqueSymmetricDifference = (a, b) => [\r\n  ...new Set([...a.filter(v => !b.includes(v)), ...b.filter(v => !a.includes(v))])\r\n];",
+          "es6": "const uniqueSymmetricDifference = (a, b) => [\n  ...new Set([...a.filter(v => !b.includes(v)), ...b.filter(v => !a.includes(v))])\n];",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar uniqueSymmetricDifference = function uniqueSymmetricDifference(a, b) {\n  return _toConsumableArray(new Set([].concat(_toConsumableArray(a.filter(function (v) {\n    return !b.includes(v);\n  })), _toConsumableArray(b.filter(function (v) {\n    return !a.includes(v);\n  })))));\n};",
-          "example": "uniqueSymmetricDifference([1, 2, 3], [1, 2, 4]); // [3, 4]\r\nuniqueSymmetricDifference([1, 2, 2], [1, 3, 1]); // [2, 3]"
+          "example": "uniqueSymmetricDifference([1, 2, 3], [1, 2, 4]); // [3, 4]\nuniqueSymmetricDifference([1, 2, 2], [1, 3, 1]); // [2, 3]"
         },
         "tags": [
           "array",
@@ -7260,7 +7260,7 @@
         ]
       },
       "meta": {
-        "hash": "b716a5ba1d108566843faebee7f3e9a7f58298867dbabdeef05f9ab564ae7c5f"
+        "hash": "553400fbd0f95322a82a87440dcaef7c25277740e3116027b5d23731a926cc61"
       }
     },
     {
@@ -7282,7 +7282,7 @@
         ]
       },
       "meta": {
-        "hash": "b36830b8ef8952e7efe53cda6f70c7d557c9c4990892d92404f867f41e080602"
+        "hash": "fc0e9c9b78dfc63137bd1a7bf71d03089d732356803f16af37febce1adefda9a"
       }
     },
     {
@@ -7293,9 +7293,9 @@
         "fileName": "unzip.md",
         "text": "Creates an array of arrays, ungrouping the elements in an array produced by [zip](#zip).\n\nUse `Math.max.apply()` to get the longest subarray in the array, `Array.prototype.map()` to make each element an array.\nUse `Array.prototype.reduce()` and `Array.prototype.forEach()` to map grouped values to individual arrays.\n\n",
         "codeBlocks": {
-          "es6": "const unzip = arr =>\r\n  arr.reduce(\r\n    (acc, val) => (val.forEach((v, i) => acc[i].push(v)), acc),\r\n    Array.from({\r\n      length: Math.max(...arr.map(x => x.length))\r\n    }).map(x => [])\r\n  );",
+          "es6": "const unzip = arr =>\n  arr.reduce(\n    (acc, val) => (val.forEach((v, i) => acc[i].push(v)), acc),\n    Array.from({\n      length: Math.max(...arr.map(x => x.length))\n    }).map(x => [])\n  );",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar unzip = function unzip(arr) {\n  return arr.reduce(function (acc, val) {\n    return val.forEach(function (v, i) {\n      return acc[i].push(v);\n    }), acc;\n  }, Array.from({\n    length: Math.max.apply(Math, _toConsumableArray(arr.map(function (x) {\n      return x.length;\n    })))\n  }).map(function (x) {\n    return [];\n  }));\n};",
-          "example": "unzip([['a', 1, true], ['b', 2, false]]); // [['a', 'b'], [1, 2], [true, false]]\r\nunzip([['a', 1, true], ['b', 2]]); // [['a', 'b'], [1, 2], [true]]"
+          "example": "unzip([['a', 1, true], ['b', 2, false]]); // [['a', 'b'], [1, 2], [true, false]]\nunzip([['a', 1, true], ['b', 2]]); // [['a', 'b'], [1, 2], [true]]"
         },
         "tags": [
           "array",
@@ -7303,7 +7303,7 @@
         ]
       },
       "meta": {
-        "hash": "e5a3523a7f3ff4e4dec462d925e8330e083840ad9e3a1b5f1c41e1af2c86c1c4"
+        "hash": "5165ec928d2bf1d48f21f8591df40cc466e2821064e5180aa598bb5aff4d642a"
       }
     },
     {
@@ -7314,7 +7314,7 @@
         "fileName": "unzipWith.md",
         "text": "Creates an array of elements, ungrouping the elements in an array produced by [zip](#zip) and applying the provided function.\n\nUse `Math.max.apply()` to get the longest subarray in the array, `Array.prototype.map()` to make each element an array.\nUse `Array.prototype.reduce()` and `Array.prototype.forEach()` to map grouped values to individual arrays.\nUse `Array.prototype.map()` and the spread operator (`...`) to apply `fn` to each individual group of elements.\n\n",
         "codeBlocks": {
-          "es6": "const unzipWith = (arr, fn) =>\r\n  arr\r\n    .reduce(\r\n      (acc, val) => (val.forEach((v, i) => acc[i].push(v)), acc),\r\n      Array.from({\r\n        length: Math.max(...arr.map(x => x.length))\r\n      }).map(x => [])\r\n    )\r\n    .map(val => fn(...val));",
+          "es6": "const unzipWith = (arr, fn) =>\n  arr\n    .reduce(\n      (acc, val) => (val.forEach((v, i) => acc[i].push(v)), acc),\n      Array.from({\n        length: Math.max(...arr.map(x => x.length))\n      }).map(x => [])\n    )\n    .map(val => fn(...val));",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar unzipWith = function unzipWith(arr, fn) {\n  return arr.reduce(function (acc, val) {\n    return val.forEach(function (v, i) {\n      return acc[i].push(v);\n    }), acc;\n  }, Array.from({\n    length: Math.max.apply(Math, _toConsumableArray(arr.map(function (x) {\n      return x.length;\n    })))\n  }).map(function (x) {\n    return [];\n  })).map(function (val) {\n    return fn.apply(void 0, _toConsumableArray(val));\n  });\n};",
           "example": "unzipWith([[1, 10, 100], [2, 20, 200]], (...args) => args.reduce((acc, v) => acc + v, 0)); // [3, 30, 300]"
         },
@@ -7325,7 +7325,7 @@
         ]
       },
       "meta": {
-        "hash": "4c5cd7ebb60e373668ca1999ff7f7da9ec0a991334bf7e52f84b392f36c9a7be"
+        "hash": "12bf4549e753e503e1798b21dcebc3bc2026ee3e6f391887d4bb0fa99211e2f6"
       }
     },
     {
@@ -7336,7 +7336,7 @@
         "fileName": "URLJoin.md",
         "text": "Joins all given URL segments together, then normalizes the resulting URL.\n\nUse `String.prototype.join('/')` to combine URL segments, then a series of `String.prototype.replace()` calls with various regexps to normalize the resulting URL (remove double slashes, add proper slashes for protocol, remove slashes before parameters, combine parameters with `'&'` and normalize first parameter delimiter).\n\n",
         "codeBlocks": {
-          "es6": "const URLJoin = (...args) =>\r\n  args\r\n    .join('/')\r\n    .replace(/[\\/]+/g, '/')\r\n    .replace(/^(.+):\\//, '$1://')\r\n    .replace(/^file:/, 'file:/')\r\n    .replace(/\\/(\\?|&|#[^!])/g, '$1')\r\n    .replace(/\\?/g, '&')\r\n    .replace('&', '?');",
+          "es6": "const URLJoin = (...args) =>\n  args\n    .join('/')\n    .replace(/[\\/]+/g, '/')\n    .replace(/^(.+):\\//, '$1://')\n    .replace(/^file:/, 'file:/')\n    .replace(/\\/(\\?|&|#[^!])/g, '$1')\n    .replace(/\\?/g, '&')\n    .replace('&', '?');",
           "es5": "var URLJoin = function URLJoin() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  return args.join('/').replace(/[\\/]+/g, '/').replace(/^(.+):\\//, '$1://').replace(/^file:/, 'file:/').replace(/\\/(\\?|&|#[^!])/g, '$1').replace(/\\?/g, '&').replace('&', '?');\n};",
           "example": "URLJoin('http://www.google.com', 'a', '/b/cd', '?foo=123', '?bar=foo'); // 'http://www.google.com/a/b/cd?foo=123&bar=foo'"
         },
@@ -7348,7 +7348,7 @@
         ]
       },
       "meta": {
-        "hash": "919f1c91d452aaa1bd6409f55cdf8a7bda8c247640712af424751680ea266089"
+        "hash": "6050cfa3a2a39089151bacfce1f5cedaec12f5da253dbc20a56dfaf50cb8924b"
       }
     },
     {
@@ -7359,7 +7359,7 @@
         "fileName": "UUIDGeneratorBrowser.md",
         "text": "Generates a UUID in a browser.\n\nUse `crypto` API to generate a UUID, compliant with [RFC4122](https://www.ietf.org/rfc/rfc4122.txt) version 4.\n\n",
         "codeBlocks": {
-          "es6": "const UUIDGeneratorBrowser = () =>\r\n  ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, c =>\r\n    (c ^ (crypto.getRandomValues(new Uint8Array(1))[0] & (15 >> (c / 4)))).toString(16)\r\n  );",
+          "es6": "const UUIDGeneratorBrowser = () =>\n  ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, c =>\n    (c ^ (crypto.getRandomValues(new Uint8Array(1))[0] & (15 >> (c / 4)))).toString(16)\n  );",
           "es5": "var UUIDGeneratorBrowser = function UUIDGeneratorBrowser() {\n  return ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, function (c) {\n    return (c ^ crypto.getRandomValues(new Uint8Array(1))[0] & 15 >> c / 4).toString(16);\n  });\n};",
           "example": "UUIDGeneratorBrowser(); // '7982fcfe-5721-4632-bede-6000885be57d'"
         },
@@ -7371,7 +7371,7 @@
         ]
       },
       "meta": {
-        "hash": "c3a3f772340a13d3911760b188e51328f98b5529b7ab4a8bbe5ec7654e090ed3"
+        "hash": "9f84a12da85558ebdb189097dbc581b338e07d52eedc5975f1001133b123aad2"
       }
     },
     {
@@ -7382,7 +7382,7 @@
         "fileName": "UUIDGeneratorNode.md",
         "text": "Generates a UUID in Node.JS.\n\nUse `crypto` API to generate a UUID, compliant with [RFC4122](https://www.ietf.org/rfc/rfc4122.txt) version 4.\n\n",
         "codeBlocks": {
-          "es6": "const crypto = require('crypto');\r\nconst UUIDGeneratorNode = () =>\r\n  ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, c =>\r\n    (c ^ (crypto.randomBytes(1)[0] & (15 >> (c / 4)))).toString(16)\r\n  );",
+          "es6": "const crypto = require('crypto');\nconst UUIDGeneratorNode = () =>\n  ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, c =>\n    (c ^ (crypto.randomBytes(1)[0] & (15 >> (c / 4)))).toString(16)\n  );",
           "es5": "var crypto = require('crypto');\n\nvar UUIDGeneratorNode = function UUIDGeneratorNode() {\n  return ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, function (c) {\n    return (c ^ crypto.randomBytes(1)[0] & 15 >> c / 4).toString(16);\n  });\n};",
           "example": "UUIDGeneratorNode(); // '79c7c136-60ee-40a2-beb2-856f1feabefc'"
         },
@@ -7394,7 +7394,7 @@
         ]
       },
       "meta": {
-        "hash": "30bb3a014903751a7883715528d1159ca97c2f424c6b18517cc04c0eda858e8f"
+        "hash": "79604b0f854a91af789fea8416c7099acfb3633259ef387f52a21337d2242478"
       }
     },
     {
@@ -7416,7 +7416,7 @@
         ]
       },
       "meta": {
-        "hash": "8596bd507a5c337cbf60ac6ca002660f9d772121fe99c7c43d0a319db4e10849"
+        "hash": "73fc55564fa0b59a71553aa442bda666cbcddbcd618f9ca53c2b55e42a7c26ca"
       }
     },
     {
@@ -7427,7 +7427,7 @@
         "fileName": "vectorDistance.md",
         "text": "Returns the distance between two vectors.\n\nUse `Array.prototype.reduce()`, `Math.pow()` and `Math.sqrt()` to calculate the Euclidean distance between two vectors.\n\n",
         "codeBlocks": {
-          "es6": "const vectorDistance = (...coords) => {\r\n  let pointLength = Math.trunc(coords.length / 2);\r\n  let sum = coords\r\n    .slice(0, pointLength)\r\n    .reduce((acc, val, i) => acc + Math.pow(val - coords[pointLength + i], 2), 0);\r\n  return Math.sqrt(sum);\r\n};",
+          "es6": "const vectorDistance = (...coords) => {\n  let pointLength = Math.trunc(coords.length / 2);\n  let sum = coords\n    .slice(0, pointLength)\n    .reduce((acc, val, i) => acc + Math.pow(val - coords[pointLength + i], 2), 0);\n  return Math.sqrt(sum);\n};",
           "es5": "var vectorDistance = function vectorDistance() {\n  for (var _len = arguments.length, coords = new Array(_len), _key = 0; _key < _len; _key++) {\n    coords[_key] = arguments[_key];\n  }\n\n  var pointLength = Math.trunc(coords.length / 2);\n  var sum = coords.slice(0, pointLength).reduce(function (acc, val, i) {\n    return acc + Math.pow(val - coords[pointLength + i], 2);\n  }, 0);\n  return Math.sqrt(sum);\n};",
           "example": "vectorDistance(10, 0, 5, 20, 0, 10); // 11.180339887498949"
         },
@@ -7437,7 +7437,7 @@
         ]
       },
       "meta": {
-        "hash": "9d990d7de46d6cc19f27b635f3edfc4e9d12b5d97fe7f75b6bdd6ecbcb7ae101"
+        "hash": "a2c8560a2e285ebe11caad3a46c07ee0e41a64bd850b2e5a4f5aebc12da09dcc"
       }
     },
     {
@@ -7450,7 +7450,7 @@
         "codeBlocks": {
           "es6": "const when = (pred, whenTrue) => x => (pred(x) ? whenTrue(x) : x);",
           "es5": "var when = function when(pred, whenTrue) {\n  return function (x) {\n    return pred(x) ? whenTrue(x) : x;\n  };\n};",
-          "example": "const doubleEvenNumbers = when(x => x % 2 === 0, x => x * 2);\r\ndoubleEvenNumbers(2); // 4\r\ndoubleEvenNumbers(1); // 1"
+          "example": "const doubleEvenNumbers = when(x => x % 2 === 0, x => x * 2);\ndoubleEvenNumbers(2); // 4\ndoubleEvenNumbers(1); // 1"
         },
         "tags": [
           "function",
@@ -7458,7 +7458,7 @@
         ]
       },
       "meta": {
-        "hash": "9405ea116f261da51ff2aeb33bc85c1f660336e9c545f9e349e4c24a173694d3"
+        "hash": "4ec8d33670ad1c716f00c72100c27c43a0031eb8ee411699aa4740df3bfe9659"
       }
     },
     {
@@ -7479,7 +7479,7 @@
         ]
       },
       "meta": {
-        "hash": "3d0ca97e0ac21dc80e159c16fbfd3d96971e18bd3a0916a15d4e9f607c374b06"
+        "hash": "54f15178f6196172218aeffd14defe4e9af475ee3e29f0857ada823f618d3c8f"
       }
     },
     {
@@ -7492,7 +7492,7 @@
         "codeBlocks": {
           "es6": "const words = (str, pattern = /[^a-zA-Z-]+/) => str.split(pattern).filter(Boolean);",
           "es5": "var words = function words(str) {\n  var pattern = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : /[^a-zA-Z-]+/;\n  return str.split(pattern).filter(Boolean);\n};",
-          "example": "words('I love javaScript!!'); // [\"I\", \"love\", \"javaScript\"]\r\nwords('python, javaScript & coffee'); // [\"python\", \"javaScript\", \"coffee\"]"
+          "example": "words('I love javaScript!!'); // [\"I\", \"love\", \"javaScript\"]\nwords('python, javaScript & coffee'); // [\"python\", \"javaScript\", \"coffee\"]"
         },
         "tags": [
           "string",
@@ -7501,7 +7501,7 @@
         ]
       },
       "meta": {
-        "hash": "6ec0d898d6cd10a0803beb1d593f79d8587544286dbb9a5c7855224d01f0df67"
+        "hash": "b072b9cad23554279e7601cafb20813d6675459293aab607a22c820a2f2a0eb9"
       }
     },
     {
@@ -7523,7 +7523,7 @@
         ]
       },
       "meta": {
-        "hash": "3b24a5017fdefa96faab4977d6d16050b21e1c894257974b785d9415705c3aa2"
+        "hash": "8202d07045f90d897db21799a4daa0de39613c035b4ed1e92ab65c8cd5ce2e15"
       }
     },
     {
@@ -7534,9 +7534,9 @@
         "fileName": "yesNo.md",
         "text": "Returns `true` if the string is `y`/`yes` or `false` if the string is `n`/`no`.\n\nUse `RegExp.test()` to check if the string evaluates to `y/yes` or `n/no`.\nOmit the second argument, `def` to set the default answer as `no`.\n\n",
         "codeBlocks": {
-          "es6": "const yesNo = (val, def = false) =>\r\n  /^(y|yes)$/i.test(val) ? true : /^(n|no)$/i.test(val) ? false : def;",
+          "es6": "const yesNo = (val, def = false) =>\n  /^(y|yes)$/i.test(val) ? true : /^(n|no)$/i.test(val) ? false : def;",
           "es5": "var yesNo = function yesNo(val) {\n  var def = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  return /^(y|yes)$/i.test(val) ? true : /^(n|no)$/i.test(val) ? false : def;\n};",
-          "example": "yesNo('Y'); // true\r\nyesNo('yes'); // true\r\nyesNo('No'); // false\r\nyesNo('Foo', true); // true"
+          "example": "yesNo('Y'); // true\nyesNo('yes'); // true\nyesNo('No'); // false\nyesNo('Foo', true); // true"
         },
         "tags": [
           "utility",
@@ -7545,7 +7545,7 @@
         ]
       },
       "meta": {
-        "hash": "23c21fc71824198eb77fad9d6cc159975a7b1d70db912877a0ae035e870f7379"
+        "hash": "6365f144def8abb711b890f8689ff8c9f1f1aee092525583fa913057ba623472"
       }
     },
     {
@@ -7556,7 +7556,7 @@
         "fileName": "yesterday.md",
         "text": "Results in a string representation of yesterday's date.\n\nUse `new Date()` to get the current date, decrement by one using `Date.getDate()` and set the value to the result using `Date.setDate()`.\nUse `Date.prototype.toISOString()` to return a string in `yyyy-mm-dd` format.\n\n",
         "codeBlocks": {
-          "es6": "const yesterday = () => {\r\n  let t = new Date();\r\n  t.setDate(t.getDate() - 1);\r\n  return t.toISOString().split('T')[0];\r\n};",
+          "es6": "const yesterday = () => {\n  let t = new Date();\n  t.setDate(t.getDate() - 1);\n  return t.toISOString().split('T')[0];\n};",
           "es5": "var yesterday = function yesterday() {\n  var t = new Date();\n  t.setDate(t.getDate() - 1);\n  return t.toISOString().split('T')[0];\n};",
           "example": "yesterday(); // 2018-10-17 (if current date is 2018-10-18)"
         },
@@ -7566,7 +7566,7 @@
         ]
       },
       "meta": {
-        "hash": "6dc856b968d246b98ce60715240955d6744837c36736d2a718edbe7fd420c799"
+        "hash": "033e90570af5f5ed3d8c0ea4407d6ccaea760372562c5633a24bf08e1f8782d3"
       }
     },
     {
@@ -7577,9 +7577,9 @@
         "fileName": "zip.md",
         "text": "Creates an array of elements, grouped based on the position in the original arrays.\n\nUse `Math.max.apply()` to get the longest array in the arguments.\nCreates an array with that length as return value and use `Array.from()` with a map-function to create an array of grouped elements.\nIf lengths of the argument-arrays vary, `undefined` is used where no value could be found.\n\n",
         "codeBlocks": {
-          "es6": "const zip = (...arrays) => {\r\n  const maxLength = Math.max(...arrays.map(x => x.length));\r\n  return Array.from({ length: maxLength }).map((_, i) => {\r\n    return Array.from({ length: arrays.length }, (_, k) => arrays[k][i]);\r\n  });\r\n};",
+          "es6": "const zip = (...arrays) => {\n  const maxLength = Math.max(...arrays.map(x => x.length));\n  return Array.from({ length: maxLength }).map((_, i) => {\n    return Array.from({ length: arrays.length }, (_, k) => arrays[k][i]);\n  });\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar zip = function zip() {\n  for (var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++) {\n    arrays[_key] = arguments[_key];\n  }\n\n  var maxLength = Math.max.apply(Math, _toConsumableArray(arrays.map(function (x) {\n    return x.length;\n  })));\n  return Array.from({\n    length: maxLength\n  }).map(function (_, i) {\n    return Array.from({\n      length: arrays.length\n    }, function (_, k) {\n      return arrays[k][i];\n    });\n  });\n};",
-          "example": "zip(['a', 'b'], [1, 2], [true, false]); // [['a', 1, true], ['b', 2, false]]\r\nzip(['a'], [1, 2], [true, false]); // [['a', 1, true], [undefined, 2, false]]"
+          "example": "zip(['a', 'b'], [1, 2], [true, false]); // [['a', 1, true], ['b', 2, false]]\nzip(['a'], [1, 2], [true, false]); // [['a', 1, true], [undefined, 2, false]]"
         },
         "tags": [
           "array",
@@ -7587,7 +7587,7 @@
         ]
       },
       "meta": {
-        "hash": "f73f7ab8ab477f0ff1becac163dc817944ed313df9774e1396a2fb6257fe0a63"
+        "hash": "ec0b5750affd681f1eed8dd7a4711c103675f559da38aab23162d5270567d329"
       }
     },
     {
@@ -7598,9 +7598,9 @@
         "fileName": "zipObject.md",
         "text": "Given an array of valid property identifiers and an array of values, return an object associating the properties to the values.\n\nSince an object can have undefined values but not undefined property pointers, the array of properties is used to decide the structure of the resulting object using `Array.prototype.reduce()`.\n\n",
         "codeBlocks": {
-          "es6": "const zipObject = (props, values) =>\r\n  props.reduce((obj, prop, index) => ((obj[prop] = values[index]), obj), {});",
+          "es6": "const zipObject = (props, values) =>\n  props.reduce((obj, prop, index) => ((obj[prop] = values[index]), obj), {});",
           "es5": "var zipObject = function zipObject(props, values) {\n  return props.reduce(function (obj, prop, index) {\n    return obj[prop] = values[index], obj;\n  }, {});\n};",
-          "example": "zipObject(['a', 'b', 'c'], [1, 2]); // {a: 1, b: 2, c: undefined}\r\nzipObject(['a', 'b'], [1, 2, 3]); // {a: 1, b: 2}"
+          "example": "zipObject(['a', 'b', 'c'], [1, 2]); // {a: 1, b: 2, c: undefined}\nzipObject(['a', 'b'], [1, 2, 3]); // {a: 1, b: 2}"
         },
         "tags": [
           "array",
@@ -7609,7 +7609,7 @@
         ]
       },
       "meta": {
-        "hash": "dd3efa6bab11e40fd0fc7cb93816ae0af75c703dc5aaa689405e7bff90b9f0f6"
+        "hash": "f2c7e2c6a8e566946e631c92b295c76cc406650347ec0e21318522f26094acd7"
       }
     },
     {
@@ -7620,9 +7620,9 @@
         "fileName": "zipWith.md",
         "text": "Creates an array of elements, grouped based on the position in the original arrays and using function as the last value to specify how grouped values should be combined.\n\nCheck if the last argument provided is a function.\nUse `Math.max()` to get the longest array in the arguments.\nCreates an array with that length as return value and use `Array.from()` with a map-function to create an array of grouped elements.\nIf lengths of the argument-arrays vary, `undefined` is used where no value could be found.\nThe function is invoked with the elements of each group `(...group)`.\n\n",
         "codeBlocks": {
-          "es6": "const zipWith = (...array) => {\r\n  const fn = typeof array[array.length - 1] === 'function' ? array.pop() : undefined;\r\n  return Array.from({ length: Math.max(...array.map(a => a.length)) }, (_, i) =>\r\n    fn ? fn(...array.map(a => a[i])) : array.map(a => a[i])\r\n  );\r\n};",
+          "es6": "const zipWith = (...array) => {\n  const fn = typeof array[array.length - 1] === 'function' ? array.pop() : undefined;\n  return Array.from({ length: Math.max(...array.map(a => a.length)) }, (_, i) =>\n    fn ? fn(...array.map(a => a[i])) : array.map(a => a[i])\n  );\n};",
           "es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar zipWith = function zipWith() {\n  for (var _len = arguments.length, array = new Array(_len), _key = 0; _key < _len; _key++) {\n    array[_key] = arguments[_key];\n  }\n\n  var fn = typeof array[array.length - 1] === 'function' ? array.pop() : undefined;\n  return Array.from({\n    length: Math.max.apply(Math, _toConsumableArray(array.map(function (a) {\n      return a.length;\n    })))\n  }, function (_, i) {\n    return fn ? fn.apply(void 0, _toConsumableArray(array.map(function (a) {\n      return a[i];\n    }))) : array.map(function (a) {\n      return a[i];\n    });\n  });\n};",
-          "example": "zipWith([1, 2], [10, 20], [100, 200], (a, b, c) => a + b + c); // [111,222]\r\nzipWith(\r\n  [1, 2, 3],\r\n  [10, 20],\r\n  [100, 200],\r\n  (a, b, c) => (a != null ? a : 'a') + (b != null ? b : 'b') + (c != null ? c : 'c')\r\n); // [111, 222, '3bc']"
+          "example": "zipWith([1, 2], [10, 20], [100, 200], (a, b, c) => a + b + c); // [111,222]\nzipWith(\n  [1, 2, 3],\n  [10, 20],\n  [100, 200],\n  (a, b, c) => (a != null ? a : 'a') + (b != null ? b : 'b') + (c != null ? c : 'c')\n); // [111, 222, '3bc']"
         },
         "tags": [
           "array",
@@ -7631,7 +7631,7 @@
         ]
       },
       "meta": {
-        "hash": "d6aae10a70618948763d65d9eb3b0b7704efec8a0c9287a45bdbfc4fbd6dc34c"
+        "hash": "457830ee4df5b57b6605c4133b863cc3f3eebf0031ccd1358fae3c6f5cb3c75e"
       }
     }
   ],
diff --git a/vscode_snippets/snippets.json b/vscode_snippets/snippets.json
index b0797a57e..6c7f245cd 100644
--- a/vscode_snippets/snippets.json
+++ b/vscode_snippets/snippets.json
@@ -511,8 +511,8 @@
       "  return Array.isArray(obj) && obj.length",
       "    ? (clone.length = obj.length) && Array.from(clone)",
       "    : Array.isArray(obj)",
-      "      ? Array.from(obj)",
-      "      : clone;",
+      "    ? Array.from(obj)",
+      "    : clone;",
       "};"
     ],
     "description": "Creates a deep clone of an object.\n\nUse recursion.\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.\n"
@@ -548,13 +548,13 @@
       "  Array.isArray(obj)",
       "    ? obj.map(val => deepMapKeys(val, f))",
       "    : typeof obj === 'object'",
-      "      ? Object.keys(obj).reduce((acc, current) => {",
+      "    ? Object.keys(obj).reduce((acc, current) => {",
       "        const val = obj[current];",
       "        acc[f(current)] =",
       "          val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);",
       "        return acc;",
       "      }, {})",
-      "      : obj;"
+      "    : obj;"
     ],
     "description": "Deep maps an object's keys.\n\nCreates an object with the same values as the provided object and keys generated by running the provided function for each key.\nUse `Object.keys(obj)` to iterate over the object's keys. \nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n"
   },
@@ -630,9 +630,9 @@
       "  target in obj",
       "    ? obj[target]",
       "    : Object.values(obj).reduce((acc, val) => {",
-      "      if (acc !== undefined) return acc;",
-      "      if (typeof val === 'object') return dig(val, target);",
-      "    }, undefined);"
+      "        if (acc !== undefined) return acc;",
+      "        if (typeof val === 'object') return dig(val, target);",
+      "      }, undefined);"
     ],
     "description": "Returns the target value in a nested JSON object, based on the given key.\n\nUse the `in` operator to check if `target` exists in `obj`.\nIf found, return the value of `obj[target]`, otherwise use `Object.values(obj)` and `Array.prototype.reduce()` to recursively call `dig` on each nested object until the first matching key/value pair is found.\n"
   },
@@ -795,11 +795,11 @@
       "const factorial = n =>",
       "  n < 0",
       "    ? (() => {",
-      "      throw new TypeError('Negative numbers are not allowed!');",
-      "    })()",
+      "        throw new TypeError('Negative numbers are not allowed!');",
+      "      })()",
       "    : n <= 1",
-      "      ? 1",
-      "      : n * factorial(n - 1);"
+      "    ? 1",
+      "    : n * factorial(n - 1);"
     ],
     "description": "Calculates the factorial of a number.\n\nUse recursion.\nIf `n` is less than or equal to `1`, return `1`.\nOtherwise, return the product of `n` and the factorial of `n - 1`.\nThrows an exception if `n` is a negative number.\n"
   },
@@ -1056,10 +1056,10 @@
       "  num === 0 || num === 24",
       "    ? 12 + 'am'",
       "    : num === 12",
-      "      ? 12 + 'pm'",
-      "      : num < 12",
-      "        ? (num % 12) + 'am'",
-      "        : (num % 12) + 'pm';"
+      "    ? 12 + 'pm'",
+      "    : num < 12",
+      "    ? (num % 12) + 'am'",
+      "    : (num % 12) + 'pm';"
     ],
     "description": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\n\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.\n"
   },
@@ -1706,8 +1706,8 @@
       "      i === arr.length - 2",
       "        ? acc + val + end",
       "        : i === arr.length - 1",
-      "          ? acc + val",
-      "          : acc + val + separator,",
+      "        ? acc + val",
+      "        : acc + val + separator,",
       "    ''",
       "  );"
     ],
@@ -2538,9 +2538,9 @@
       "const remove = (arr, func) =>",
       "  Array.isArray(arr)",
       "    ? arr.filter(func).reduce((acc, val) => {",
-      "      arr.splice(arr.indexOf(val), 1);",
-      "      return acc.concat(val);",
-      "    }, [])",
+      "        arr.splice(arr.indexOf(val), 1);",
+      "        return acc.concat(val);",
+      "      }, [])",
       "    : [];"
     ],
     "description": "Removes elements from an array for which the given function returns `false`.\n\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\nThe `func` is invoked with three arguments (`value, index, array`).\n"
@@ -2738,10 +2738,10 @@
       "  Array.isArray(val)",
       "    ? val.length",
       "    : val && typeof val === 'object'",
-      "      ? val.size || val.length || Object.keys(val).length",
-      "      : typeof val === 'string'",
-      "        ? new Blob([val]).size",
-      "        : 0;"
+      "    ? val.size || val.length || Object.keys(val).length",
+      "    : typeof val === 'string'",
+      "    ? new Blob([val]).size",
+      "    : 0;"
     ],
     "description": "Get size of arrays, objects or strings.\n\nGet type of `val` (`array`, `object` or `string`). \nUse `length` property for arrays.\nUse `length` or `size` value if available or number of keys for objects.\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\nSplit strings into array of characters with `split('')` and return its length.\n"
   },