From 239b94735557e99556d860d53ab6c406fe77e567 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Thu, 1 Nov 2018 14:14:00 +0000
Subject: [PATCH 01/16] Travis build: 725 [cron]

---
 dist/_30s.es5.js              |   15 +-
 dist/_30s.es5.min.js          |    2 +-
 dist/_30s.esm.js              |   10 +-
 dist/_30s.js                  |   10 +-
 snippet_data/snippetList.json |  714 +++---
 snippet_data/snippets.json    | 2238 +++++++++---------
 snippets_archive/README.md    |   78 +-
 test/testlog                  | 4167 +++++++++++++++++----------------
 vscode_snippets/snippets.json |  658 +++---
 9 files changed, 3993 insertions(+), 3899 deletions(-)

diff --git a/dist/_30s.es5.js b/dist/_30s.es5.js
index e58fa4e25..e9b0a92a5 100644
--- a/dist/_30s.es5.js
+++ b/dist/_30s.es5.js
@@ -1481,12 +1481,12 @@
     });
   };
 
-  var longestItem = function longestItem(val) {
-    for (var _len29 = arguments.length, vals = new Array(_len29 > 1 ? _len29 - 1 : 0), _key29 = 1; _key29 < _len29; _key29++) {
-      vals[_key29 - 1] = arguments[_key29];
+  var longestItem = function longestItem() {
+    for (var _len29 = arguments.length, vals = new Array(_len29), _key29 = 0; _key29 < _len29; _key29++) {
+      vals[_key29] = arguments[_key29];
     }
 
-    return [val].concat(vals).reduce(function (a, x) {
+    return vals.reduce(function (a, x) {
       return x.length > a.length ? x : a;
     });
   };
@@ -2633,6 +2633,12 @@
     }).join('_');
   };
 
+  var toTitleCase = function toTitleCase(str) {
+    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) {
+      return x.charAt(0).toUpperCase() + x.slice(1);
+    }).join(' ');
+  };
+
   var toggleClass = function toggleClass(el, className) {
     return el.classList.toggle(className);
   };
@@ -3199,6 +3205,7 @@
     toOrdinalSuffix: toOrdinalSuffix,
     toSafeInteger: toSafeInteger,
     toSnakeCase: toSnakeCase,
+    toTitleCase: toTitleCase,
     toggleClass: toggleClass,
     tomorrow: tomorrow,
     transform: transform,
diff --git a/dist/_30s.es5.min.js b/dist/_30s.es5.min.js
index 6e76c18d2..60fce005a 100644
--- a/dist/_30s.es5.min.js
+++ b/dist/_30s.es5.min.js
@@ -1 +1 @@
-(function(e,t){'object'==typeof exports&&'undefined'!=typeof module?t():'function'==typeof define&&define.amd?define(t):t()})(this,function(){'use strict';function e(t){return e='function'==typeof Symbol&&'symbol'==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&'function'==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?'symbol':typeof e},e(t)}function t(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}function n(e){for(var n=1;n<arguments.length;n++){var i=null==arguments[n]?{}:arguments[n],r=Object.keys(i);'function'==typeof Object.getOwnPropertySymbols&&(r=r.concat(Object.getOwnPropertySymbols(i).filter(function(e){return Object.getOwnPropertyDescriptor(i,e).enumerable}))),r.forEach(function(n){t(e,n,i[n])})}return e}function r(e,t){return a(e)||s(e,t)||p()}function l(e){return a(e)||c(e)||p()}function o(e){return i(e)||c(e)||d()}function i(e){if(Array.isArray(e)){for(var t=0,n=Array(e.length);t<e.length;t++)n[t]=e[t];return n}}function a(e){if(Array.isArray(e))return e}function c(e){if(Symbol.iterator in Object(e)||'[object Arguments]'===Object.prototype.toString.call(e))return Array.from(e)}function s(e,t){var n=[],i=!0,r=!1,a=void 0;try{for(var l,o=e[Symbol.iterator]();!(i=(l=o.next()).done)&&(n.push(l.value),!(t&&n.length===t));i=!0);}catch(e){r=!0,a=e}finally{try{i||null==o['return']||o['return']()}finally{if(r)throw a}}return n}function d(){throw new TypeError('Invalid attempt to spread non-iterable instance')}function p(){throw new TypeError('Invalid attempt to destructure non-iterable instance')}var h=Math.sqrt,g=Math.pow,u=Math.PI,y=Math.floor,m=Math.min,k=Math.max,b=Math.ceil,_=Math.round,v=Math.abs,j='undefined'!=typeof require&&require('fs'),S='undefined'!=typeof require&&require('crypto'),x=function t(n,i){return i in n?n[i]:Object.values(n).reduce(function(n,r){return void 0===n?'object'===e(r)?t(r,i):void 0:n},void 0)},C=function t(n,i){if(n===i)return!0;if(n instanceof Date&&i instanceof Date)return n.getTime()===i.getTime();if(!n||!i||'object'!==e(n)&&'object'!==e(i))return n===i;if(null===n||void 0===n||null===i||void 0===i)return!1;if(n.prototype!==i.prototype)return!1;var r=Object.keys(n);return r.length===Object.keys(i).length&&r.every(function(e){return t(n[e],i[e])})},w=function(){return!['undefined'==typeof window?'undefined':e(window),'undefined'==typeof document?'undefined':e(document)].includes('undefined')},E=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe&&'function'==typeof t._read&&'object'===e(t._readableState)&&'function'==typeof t._write&&'object'===e(t._writableState)},A=function(t){return null!==t&&'object'===e(t)},L=function(t){return!!t&&'object'===e(t)&&t.constructor===Object},T=function(t){return null!==t&&('object'===e(t)||'function'==typeof t)&&'function'==typeof t.then},I=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe&&'function'==typeof t._read&&'object'===e(t._readableState)},O=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe},B=function(t){return'symbol'===e(t)},R=function(){return'TRAVIS'in process.env&&'CI'in process.env},D=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe&&'function'==typeof t._write&&'object'===e(t._writableState)},N=function(t,n){var i=2<arguments.length&&void 0!==arguments[2]?arguments[2]:n+'s',r=function(e,t){var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:t+'s';return[1,-1].includes(+e)?t:n};return'object'===e(t)?function(e,n){return r(e,n,t[n])}:r(t,n,i)},z=function(t){return Array.isArray(t)?t.length:t&&'object'===e(t)?t.size||t.length||Object.keys(t).length:'string'==typeof t?new Blob([t]).size:0};module.exports={CSVToArray:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',',n=!!(2<arguments.length&&arguments[2]!==void 0)&&arguments[2];return e.slice(n?e.indexOf('\n')+1:0).split('\n').map(function(e){return e.split(t)})},CSVToJSON:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',',n=e.slice(0,e.indexOf('\n')).split(t);return e.slice(e.indexOf('\n')+1).split('\n').map(function(e){var i=e.split(t);return n.reduce(function(e,t,n){return e[t]=i[n],e},{})})},JSONToFile:function(e,t){return j.writeFile(''.concat(t,'.json'),JSON.stringify(e,null,2))},JSONtoCSV:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:',';return[t.join(n)].concat(o(e.map(function(e){return t.reduce(function(t,i){return''.concat(t).concat(t.length?n:'','"').concat(e[i]?e[i]:'','"')},'')}))).join('\n')},RGBToHex:function(e,t,n){return((e<<16)+(t<<8)+n).toString(16).padStart(6,'0')},URLJoin:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.join('/').replace(/[\/]+/g,'/').replace(/^(.+):\//,'$1://').replace(/^file:/,'file:/').replace(/\/(\?|&|#[^!])/g,'$1').replace(/\?/g,'&').replace('&','?')},UUIDGeneratorBrowser:function(){return'10000000-1000-4000-8000-100000000000'.replace(/[018]/g,function(e){return(e^S.getRandomValues(new Uint8Array(1))[0]&15>>e/4).toString(16)})},UUIDGeneratorNode:function(){return'10000000-1000-4000-8000-100000000000'.replace(/[018]/g,function(e){return(e^S.randomBytes(1)[0]&15>>e/4).toString(16)})},all:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:Boolean;return e.every(t)},allEqual:function(e){return e.every(function(t){return t===e[0]})},any:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:Boolean;return e.some(t)},approximatelyEqual:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:.001;return v(e-t)<n},arrayToCSV:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',';return e.map(function(e){return e.map(function(e){return'"'.concat(e,'"')}).join(t)}).join('\n')},arrayToHtmlList:function(e,t){return function(n){return n=document.querySelector('#'+t),n.innerHTML+=e.map(function(e){return'<li>'.concat(e,'</li>')}).join('')}()},ary:function(e,t){return function(){for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(void 0,o(i.slice(0,t)))}},atob:function(e){return Buffer.from(e,'base64').toString('binary')},attempt:function(e){try{for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return e.apply(void 0,n)}catch(t){return t instanceof Error?t:new Error(t)}},average:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return e+t},0)/t.length},averageBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(e,t){return e+t},0)/e.length},bifurcate:function(e,t){return e.reduce(function(e,n,r){return e[t[r]?0:1].push(n),e},[[],[]])},bifurcateBy:function(e,t){return e.reduce(function(e,n,r){return e[t(n,r)?0:1].push(n),e},[[],[]])},bind:function(e,t){for(var n=arguments.length,i=Array(2<n?n-2:0),r=2;r<n;r++)i[r-2]=arguments[r];return function(){for(var n=arguments.length,r=Array(n),a=0;a<n;a++)r[a]=arguments[a];return e.apply(t,i.concat(r))}},bindAll:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return n.forEach(function(t){return f=e[t],e[t]=function(){return f.apply(e)}})},bindKey:function(e,t){for(var n=arguments.length,i=Array(2<n?n-2:0),r=2;r<n;r++)i[r-2]=arguments[r];return function(){for(var n=arguments.length,r=Array(n),a=0;a<n;a++)r[a]=arguments[a];return e[t].apply(e,i.concat(r))}},binomialCoefficient:function(e,t){var n=Number.isNaN;if(n(e)||n(t))return NaN;if(0>t||t>e)return 0;if(0===t||t===e)return 1;if(1===t||t===e-1)return e;e-t<t&&(t=e-t);for(var i=e,r=2;r<=t;r++)i*=(e-r+1)/r;return _(i)},bottomVisible:function(){return document.documentElement.clientHeight+window.scrollY>=(document.documentElement.scrollHeight||document.documentElement.clientHeight)},btoa:function(e){return Buffer.from(e,'binary').toString('base64')},byteSize:function(e){return new Blob([e]).size},call:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return function(t){return t[e].apply(t,n)}},capitalize:function(e){var t=l(e),n=t[0],i=t.slice(1),r=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return n.toUpperCase()+(r?i.join('').toLowerCase():i.join(''))},capitalizeEveryWord:function(e){return e.replace(/\b[a-z]/g,function(e){return e.toUpperCase()})},castArray:function(e){return Array.isArray(e)?e:[e]},chainAsync:function(e){var t=0,n=function n(){return e[t++](n)};n()},chunk:function(e,t){return Array.from({length:b(e.length/t)},function(n,r){return e.slice(r*t,r*t+t)})},clampNumber:function(e,t,n){return k(m(e,k(t,n)),m(t,n))},cloneRegExp:function(e){return new RegExp(e.source,e.flags)},coalesce:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.find(function(e){return![void 0,null].includes(e)})},coalesceFactory:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return n.find(e)}},collectInto:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return e(n)}},colorize:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return{black:'\x1B[30m'.concat(t.join(' ')),red:'\x1B[31m'.concat(t.join(' ')),green:'\x1B[32m'.concat(t.join(' ')),yellow:'\x1B[33m'.concat(t.join(' ')),blue:'\x1B[34m'.concat(t.join(' ')),magenta:'\x1B[35m'.concat(t.join(' ')),cyan:'\x1B[36m'.concat(t.join(' ')),white:'\x1B[37m'.concat(t.join(' ')),bgBlack:'\x1B[40m'.concat(t.join(' '),'\x1B[0m'),bgRed:'\x1B[41m'.concat(t.join(' '),'\x1B[0m'),bgGreen:'\x1B[42m'.concat(t.join(' '),'\x1B[0m'),bgYellow:'\x1B[43m'.concat(t.join(' '),'\x1B[0m'),bgBlue:'\x1B[44m'.concat(t.join(' '),'\x1B[0m'),bgMagenta:'\x1B[45m'.concat(t.join(' '),'\x1B[0m'),bgCyan:'\x1B[46m'.concat(t.join(' '),'\x1B[0m'),bgWhite:'\x1B[47m'.concat(t.join(' '),'\x1B[0m')}},compact:function(e){return e.filter(Boolean)},compose:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return function(){return e(t.apply(void 0,arguments))}})},composeRight:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return function(){return t(e.apply(void 0,arguments))}})},converge:function(e,t){return function(){for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(void 0,o(t.map(function(e){return e.apply(null,i)})))}},copyToClipboard:function(e){var t=document.createElement('textarea');t.value=e,t.setAttribute('readonly',''),t.style.position='absolute',t.style.left='-9999px',document.body.appendChild(t);var n=!!(0<document.getSelection().rangeCount)&&document.getSelection().getRangeAt(0);t.select(),document.execCommand('copy'),document.body.removeChild(t),n&&(document.getSelection().removeAllRanges(),document.getSelection().addRange(n))},countBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(e,t){return e[t]=(e[t]||0)+1,e},{})},countOccurrences:function(e,t){return e.reduce(function(e,n){return n===t?e+1:e},0)},counter:function(e,t,n){var i=3<arguments.length&&arguments[3]!==void 0?arguments[3]:1,r=4<arguments.length&&arguments[4]!==void 0?arguments[4]:2e3,a=t,l=0>(n-t)*i?-i:i,o=setInterval(function(){a+=l,document.querySelector(e).innerHTML=a,a>=n&&(document.querySelector(e).innerHTML=n),a>=n&&clearInterval(o)},v(y(r/(n-t))));return o},createElement:function(e){var t=document.createElement('div');return t.innerHTML=e,t.firstElementChild},createEventHub:function(){return{hub:Object.create(null),emit:function(e,t){(this.hub[e]||[]).forEach(function(e){return e(t)})},on:function(e,t){this.hub[e]||(this.hub[e]=[]),this.hub[e].push(t)},off:function(e,t){var n=(this.hub[e]||[]).findIndex(function(e){return e===t});-1<n&&this.hub[e].splice(n,1)}}},currentURL:function(){return window.location.href},curry:function e(t){for(var n=1<arguments.length&&arguments[1]!==void 0?arguments[1]:t.length,i=arguments.length,r=Array(2<i?i-2:0),a=2;a<i;a++)r[a-2]=arguments[a];return n<=r.length?t.apply(void 0,r):e.bind.apply(e,[null,t,n].concat(r))},dayOfYear:function(e){return y((e-new Date(e.getFullYear(),0,0))/1e3/60/60/24)},debounce:function(e){var t,n=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return function(){for(var i=this,r=arguments.length,a=Array(r),l=0;l<r;l++)a[l]=arguments[l];clearTimeout(t),t=setTimeout(function(){return e.apply(i,a)},n)}},decapitalize:function(e){var t=l(e),n=t[0],i=t.slice(1),r=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return n.toLowerCase()+(r?i.join('').toUpperCase():i.join(''))},deepClone:function t(n){var i=Object.assign({},n);return Object.keys(i).forEach(function(r){return i[r]='object'===e(n[r])?t(n[r]):n[r]}),Array.isArray(n)?(i.length=n.length)&&Array.from(i):i},deepFlatten:function e(t){var n;return(n=[]).concat.apply(n,o(t.map(function(t){return Array.isArray(t)?e(t):t})))},deepFreeze:function e(t){return Object.keys(t).forEach(function(n){return!(t[n]instanceof Object)||Object.isFrozen(t[n])?null:e(t[n])})||Object.freeze(t)},defaults:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return Object.assign.apply(Object,[{},e].concat(o(n.reverse()),[e]))},defer:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return setTimeout.apply(void 0,[e,1].concat(n))},degreesToRads:function(e){return e*u/180},delay:function(e,t){for(var n=arguments.length,i=Array(2<n?n-2:0),r=2;r<n;r++)i[r-2]=arguments[r];return setTimeout.apply(void 0,[e,t].concat(i))},detectDeviceType:function(){return /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent)?'Mobile':'Desktop'},difference:function(e,t){var n=new Set(t);return e.filter(function(e){return!n.has(e)})},differenceBy:function(e,t,n){var i=new Set(t.map(n));return e.filter(function(e){return!i.has(n(e))})},differenceWith:function(e,t,n){return e.filter(function(e){return-1===t.findIndex(function(t){return n(e,t)})})},dig:x,digitize:function(e){return o(''.concat(e)).map(function(e){return parseInt(e)})},distance:function(e,t,n,i){return Math.hypot(n-e,i-t)},drop:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(t)},dropRight:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(0,-t)},dropRightWhile:function(e,t){for(;0<e.length&&!t(e[e.length-1]);)e=e.slice(0,-1);return e},dropWhile:function(e,t){for(;0<e.length&&!t(e[0]);)e=e.slice(1);return e},elementContains:function(e,t){return e!==t&&e.contains(t)},elementIsVisibleInViewport:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1],n=e.getBoundingClientRect(),i=n.top,r=n.left,a=n.bottom,l=n.right,o=window,c=o.innerHeight,s=o.innerWidth;return t?(0<i&&i<c||0<a&&a<c)&&(0<r&&r<s||0<l&&l<s):0<=i&&0<=r&&a<=c&&l<=s},elo:function e(t){var n=l(t),o=n.slice(0),c=1<arguments.length&&arguments[1]!==void 0?arguments[1]:32,s=2<arguments.length?arguments[2]:void 0,d=r(o,2),p=d[0],a=d[1],h=function(e,t){return 1/(1+g(10,(t-e)/400))},u=function(e,t){return(s||e)+c*(t-h(t?p:a,t?a:p))};if(2===o.length)return[u(p,1),u(a,0)];for(var y,m=0,i=o.length;m<i;m++)for(y=m;y<i-1;){y++;var k=e([o[m],o[y]],c),b=r(k,2);o[m]=b[0],o[y]=b[1]}return o},equals:C,escapeHTML:function(e){return e.replace(/[&<>'"]/g,function(e){return{"&":'&amp;',"<":'&lt;',">":'&gt;',"'":'&#39;','"':'&quot;'}[e]||e})},escapeRegExp:function(e){return e.replace(/[.*+?^${}()|[\]\\]/g,'\\$&')},everyNth:function(e,t){return e.filter(function(n,e){return e%t==t-1})},extendHex:function(e){return'#'+e.slice(e.startsWith('#')?1:0).split('').map(function(e){return e+e}).join('')},factorial:function e(t){return 0>t?function(){throw new TypeError('Negative numbers are not allowed!')}():1>=t?1:t*e(t-1)},fibonacci:function(e){return Array.from({length:e}).reduce(function(e,t,n){return e.concat(1<n?e[n-1]+e[n-2]:n)},[])},filterNonUnique:function(e){return e.filter(function(t){return e.indexOf(t)===e.lastIndexOf(t)})},filterNonUniqueBy:function(e,t){return e.filter(function(n,r){return e.every(function(e,i){return r===i===t(n,e,r,i)})})},findKey:function(e,t){return Object.keys(e).find(function(n){return t(e[n],n,e)})},findLast:function(e,t){return e.filter(t).pop()},findLastIndex:function(e,t){return e.map(function(e,t){return[t,e]}).filter(function(n){var a=r(n,2),l=a[0],i=a[1];return t(i,l,e)}).pop()[0]},findLastKey:function(e,t){return Object.keys(e).reverse().find(function(n){return t(e[n],n,e)})},flatten:function e(t){var n=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return t.reduce(function(t,i){return t.concat(1<n&&Array.isArray(i)?e(i,n-1):i)},[])},flattenObject:function t(n){var i=1<arguments.length&&arguments[1]!==void 0?arguments[1]:'';return Object.keys(n).reduce(function(r,a){var l=i.length?i+'.':'';return'object'===e(n[a])?Object.assign(r,t(n[a],l+a)):r[l+a]=n[a],r},{})},flip:function(e){return function(t){for(var n=arguments.length,i=Array(1<n?n-1:0),r=1;r<n;r++)i[r-1]=arguments[r];return e.apply(void 0,i.concat([t]))}},forEachRight:function(e,t){return e.slice(0).reverse().forEach(t)},forOwn:function(e,t){return Object.keys(e).forEach(function(n){return t(e[n],n,e)})},forOwnRight:function(e,t){return Object.keys(e).reverse().forEach(function(n){return t(e[n],n,e)})},formatDuration:function(e){0>e&&(e=-e);var t={day:y(e/864e5),hour:y(e/36e5)%24,minute:y(e/6e4)%60,second:y(e/1e3)%60,millisecond:y(e)%1e3};return Object.entries(t).filter(function(e){return 0!==e[1]}).map(function(e){var t=r(e,2),n=t[0],i=t[1];return''.concat(i,' ').concat(n).concat(1===i?'':'s')}).join(', ')},fromCamelCase:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:'_';return e.replace(/([a-z\d])([A-Z])/g,'$1'+t+'$2').replace(/([A-Z]+)([A-Z][a-z\d]+)/g,'$1'+t+'$2').toLowerCase()},functionName:function(e){return console.debug(e.name),e},functions:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return(t?o(Object.keys(e)).concat(o(Object.keys(Object.getPrototypeOf(e)))):Object.keys(e)).filter(function(t){return'function'==typeof e[t]})},gcd:function e(){for(var t=function(t,n){return n?e(n,t%n):t},n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return i.concat().reduce(function(e,n){return t(e,n)})},geometricProgression:function(e){var t=Math.log,n=1<arguments.length&&void 0!==arguments[1]?arguments[1]:1,r=2<arguments.length&&void 0!==arguments[2]?arguments[2]:2;return Array.from({length:y(t(e/n)/t(r))+1}).map(function(e,t){return n*g(r,t)})},get:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return n.concat().map(function(t){return t.replace(/\[([^\[\]]*)\]/g,'.$1.').split('.').filter(function(e){return''!==e}).reduce(function(e,t){return e&&e[t]},e)})},getColonTimeFromDate:function(e){return e.toTimeString().slice(0,8)},getDaysDiffBetweenDates:function(e,t){return(t-e)/86400000},getImages:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1],n=o(e.getElementsByTagName('img')).map(function(e){return e.getAttribute('src')});return t?n:o(new Set(n))},getMeridiemSuffixOfInteger:function(e){return 0===e||24===e?'12am':12===e?'12pm':12>e?e%12+'am':e%12+'pm'},getScrollPosition:function(){var e=0<arguments.length&&arguments[0]!==void 0?arguments[0]:window;return{x:e.pageXOffset===void 0?e.scrollLeft:e.pageXOffset,y:e.pageYOffset===void 0?e.scrollTop:e.pageYOffset}},getStyle:function(e,t){return getComputedStyle(e)[t]},getType:function(e){return e===void 0?'undefined':null===e?'null':e.constructor.name.toLowerCase()},getURLParameters:function(e){return(e.match(/([^?=&]+)(=([^&]*))/g)||[]).reduce(function(e,t){return e[t.slice(0,t.indexOf('='))]=t.slice(t.indexOf('=')+1),e},{})},groupBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(t,n,r){return t[n]=(t[n]||[]).concat(e[r]),t},{})},hammingDistance:function(e,t){return((e^t).toString(2).match(/1/g)||'').length},hasClass:function(e,t){return e.classList.contains(t)},hasFlags:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.every(function(e){return process.argv.includes(/^-{1,2}/.test(e)?e:'--'+e)})},hashBrowser:function(e){return S.subtle.digest('SHA-256',new TextEncoder('utf-8').encode(e)).then(function(e){for(var t=[],n=new DataView(e),r=0;r<n.byteLength;r+=4)t.push(('00000000'+n.getUint32(r).toString(16)).slice(-8));return t.join('')})},hashNode:function(e){return new Promise(function(t){return setTimeout(function(){return t(S.createHash('sha256').update(e).digest('hex'))},0)})},head:function(e){return e[0]},hexToRGB:function(e){var t=!1,n=e.slice(e.startsWith('#')?1:0);return 3===n.length?n=o(n).map(function(e){return e+e}).join(''):8===n.length&&(t=!0),n=parseInt(n,16),'rgb'+(t?'a':'')+'('+(n>>>(t?24:16))+', '+((n&(t?16711680:65280))>>>(t?16:8))+', '+((n&(t?65280:255))>>>(t?8:0))+(t?', '.concat(255&n):'')+')'},hide:function(e){return e.forEach(function(t){return t.style.display='none'})},httpGet:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:console.error,i=new XMLHttpRequest;i.open('GET',e,!0),i.onload=function(){return t(i.responseText)},i.onerror=function(){return n(i)},i.send()},httpPost:function(e,t,n){var i=3<arguments.length&&arguments[3]!==void 0?arguments[3]:console.error,r=new XMLHttpRequest;r.open('POST',e,!0),r.setRequestHeader('Content-type','application/json; charset=utf-8'),r.onload=function(){return n(r.responseText)},r.onerror=function(){return i(r)},r.send(t)},httpsRedirect:function(){'https:'!==location.protocol&&location.replace('https://'+location.href.split('//')[1])},hz:function(e){for(var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:100,n=performance.now(),r=0;r<t;r++)e();return 1e3*t/(performance.now()-n)},inRange:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:null;if(n&&t>n){var i=[t,n];n=i[0],t=i[1]}return null==n?0<=e&&e<t:e>=t&&e<n},indentString:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:' ';return e.replace(/^/gm,n.repeat(t))},indexOfAll:function(e,t){return e.reduce(function(e,n,r){return n===t?o(e).concat([r]):e},[])},initial:function(e){return e.slice(0,-1)},initialize2DArray:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:null;return Array.from({length:t}).map(function(){return Array.from({length:e}).fill(n)})},initializeArrayWithRange:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array.from({length:b((e-t+1)/n)},function(e,r){return r*n+t})},initializeArrayWithRangeRight:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array.from({length:b((e+1-t)/n)}).map(function(e,r,i){return(i.length-r-1)*n+t})},initializeArrayWithValues:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return Array(e).fill(t)},initializeNDArray:function e(t){for(var n=arguments.length,i=Array(1<n?n-1:0),r=1;r<n;r++)i[r-1]=arguments[r];return 0===i.length?t:Array.from({length:i[0]}).map(function(){return e.apply(void 0,[t].concat(o(i.slice(1))))})},insertAfter:function(e,t){return e.insertAdjacentHTML('afterend',t)},insertBefore:function(e,t){return e.insertAdjacentHTML('beforebegin',t)},intersection:function(e,t){var n=new Set(t);return e.filter(function(e){return n.has(e)})},intersectionBy:function(e,t,n){var i=new Set(t.map(n));return e.filter(function(e){return i.has(n(e))})},intersectionWith:function(e,t,n){return e.filter(function(e){return-1!==t.findIndex(function(t){return n(e,t)})})},invertKeyValues:function(e,t){return Object.keys(e).reduce(function(n,i){var r=t?t(e[i]):e[i];return n[r]=n[r]||[],n[r].push(i),n},{})},is:function(e,t){return![,null].includes(t)&&t.constructor===e},isAbsoluteURL:function(e){return /^[a-z][a-z0-9+.-]*:/.test(e)},isAfterDate:function(e,t){return e>t},isAnagram:function(e,t){var n=function(e){return e.toLowerCase().replace(/[^a-z0-9]/gi,'').split('').sort().join('')};return n(e)===n(t)},isArrayLike:function(e){return null!=e&&'function'==typeof e[Symbol.iterator]},isBeforeDate:function(e,t){return e<t},isBoolean:function(e){return'boolean'==typeof e},isBrowser:w,isBrowserTabFocused:function(){return!document.hidden},isDivisible:function(e,t){return 0==e%t},isDuplexStream:E,isEmpty:function(e){return null==e||!(Object.keys(e)||e).length},isEven:function(e){return 0==e%2},isFunction:function(e){return'function'==typeof e},isLowerCase:function(e){return e===e.toLowerCase()},isNil:function(e){return e===void 0||null===e},isNull:function(e){return null===e},isNumber:function(e){return'number'==typeof e},isObject:function(e){return e===Object(e)},isObjectLike:A,isPlainObject:L,isPrime:function(e){for(var t=y(h(e)),n=2;n<=t;n++)if(0==e%n)return!1;return 2<=e},isPrimitive:function(e){return Object(e)!==e},isPromiseLike:T,isReadableStream:I,isSameDate:function(e,t){return e.toISOString()===t.toISOString()},isSorted:function(e){var t=-(e[0]-e[1]),n=!0,a=!1,l=void 0;try{for(var o,c=e.entries()[Symbol.iterator]();!(n=(o=c.next()).done);n=!0){var s=r(o.value,2),d=s[0],i=s[1];if(t=t?t:-(e[d-1]-e[d]),d===e.length-1)return t?t:0;if(0<(i-e[d+1])*t)return 0}}catch(e){a=!0,l=e}finally{try{n||null==c.return||c.return()}finally{if(a)throw l}}},isStream:O,isString:function(e){return'string'==typeof e},isSymbol:B,isTravisCI:R,isUndefined:function(e){return e===void 0},isUpperCase:function(e){return e===e.toUpperCase()},isValidJSON:function(e){try{return JSON.parse(e),!0}catch(t){return!1}},isWritableStream:D,join:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',',n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:t;return e.reduce(function(r,a,l){return l===e.length-2?r+a+n:l===e.length-1?r+a:r+a+t},'')},last:function(e){return e[e.length-1]},lcm:function(){for(var e=function e(t,n){return n?e(n,t%n):t},t=function(t,n){return t*n/e(t,n)},n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return i.concat().reduce(function(e,n){return t(e,n)})},longestItem:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return[e].concat(n).reduce(function(e,t){return t.length>e.length?t:e})},lowercaseKeys:function(e){return Object.keys(e).reduce(function(t,n){return t[n.toLowerCase()]=e[n],t},{})},luhnCheck:function(e){var t=(e+'').split('').reverse().map(function(e){return parseInt(e)}),n=t.splice(0,1)[0],i=t.reduce(function(e,t,n){return 0==n%2?e+2*t%9||9:e+t},0);return i+=n,0==i%10},mapKeys:function(e,t){return Object.keys(e).reduce(function(n,i){return n[t(e[i],i,e)]=e[i],n},{})},mapObject:function(e,t){return function(n){return n=[e,e.map(t)],n[0].reduce(function(e,t,i){return e[t]=n[1][i],e},{})}()},mapString:function(e,t){return e.split('').map(function(n,r){return t(n,r,e)}).join('')},mapValues:function(e,t){return Object.keys(e).reduce(function(n,i){return n[i]=t(e[i],i,e),n},{})},mask:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:4,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:'*';return''.concat(e).slice(-t).padStart(''.concat(e).length,n)},matches:function(e,t){return Object.keys(t).every(function(n){return e.hasOwnProperty(n)&&e[n]===t[n]})},matchesWith:function(e,t,n){return Object.keys(t).every(function(i){return e.hasOwnProperty(i)&&n?n(e[i],t[i],i,e,t):e[i]==t[i]})},maxBy:function(e,t){return k.apply(Math,o(e.map('function'==typeof t?t:function(e){return e[t]})))},maxDate:function(){for(var e,t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return new Date((e=k).apply.apply(e,[null].concat(n)))},maxN:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return o(e).sort(function(e,t){return t-e}).slice(0,t)},median:function(e){var t=y(e.length/2),n=o(e).sort(function(e,t){return e-t});return 0==e.length%2?(n[t-1]+n[t])/2:n[t]},memoize:function(e){var t=new Map,n=function(n){return t.has(n)?t.get(n):t.set(n,e.call(this,n))&&t.get(n)};return n.cache=t,n},merge:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.concat().reduce(function(e,t){return Object.keys(t).reduce(function(n,i){return e[i]=e.hasOwnProperty(i)?[].concat(e[i]).concat(t[i]):t[i],e},{})},{})},minBy:function(e,t){return m.apply(Math,o(e.map('function'==typeof t?t:function(e){return e[t]})))},minDate:function(){for(var e,t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return new Date((e=m).apply.apply(e,[null].concat(n)))},minN:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return o(e).sort(function(e,t){return e-t}).slice(0,t)},mostPerformant:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1e4,n=e.map(function(e){for(var n=performance.now(),r=0;r<t;r++)e();return performance.now()-n});return n.indexOf(m.apply(Math,o(n)))},negate:function(e){return function(){return!e.apply(void 0,arguments)}},nest:function e(t){var i=1<arguments.length&&arguments[1]!==void 0?arguments[1]:null,r=2<arguments.length&&arguments[2]!==void 0?arguments[2]:'parent_id';return t.filter(function(e){return e[r]===i}).map(function(i){return n({},i,{children:e(t,i.id)})})},nodeListToArray:function(e){return o(e)},none:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:Boolean;return!e.some(t)},nthArg:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return n.slice(e)[0]}},nthElement:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return(-1===t?e.slice(t):e.slice(t,t+1))[0]},objectFromPairs:function(e){return e.reduce(function(e,t){var n=r(t,2),i=n[0],a=n[1];return e[i]=a,e},{})},objectToPairs:function(e){return Object.keys(e).map(function(t){return[t,e[t]]})},observeMutations:function(e,t,n){var i=new MutationObserver(function(e){return e.forEach(function(e){return t(e)})});return i.observe(e,Object.assign({childList:!0,attributes:!0,attributeOldValue:!0,characterData:!0,characterDataOldValue:!0,subtree:!0},n)),i},off:function(e,t,n){var i=!!(3<arguments.length&&arguments[3]!==void 0)&&arguments[3];return e.removeEventListener(t,n,i)},offset:function(e,t){return o(e.slice(t)).concat(o(e.slice(0,t)))},omit:function(e,t){return Object.keys(e).filter(function(e){return!t.includes(e)}).reduce(function(t,n){return t[n]=e[n],t},{})},omitBy:function(e,t){return Object.keys(e).filter(function(n){return!t(e[n],n)}).reduce(function(t,n){return t[n]=e[n],t},{})},on:function(e,t,n){var i=3<arguments.length&&void 0!==arguments[3]?arguments[3]:{},r=function(t){return t.target.matches(i.target)&&n.call(t.target,t)};if(e.addEventListener(t,i.target?r:n,i.options||!1),i.target)return r},onUserInputChange:function(e){var t='mouse',n=0,i=function i(){var r=performance.now();20>r-n&&(t='mouse',e(t),document.removeEventListener('mousemove',i)),n=r};document.addEventListener('touchstart',function(){'touch'==t||(t='touch',e(t),document.addEventListener('mousemove',i))})},once:function(e){var t=!1;return function(){if(!t){t=!0;for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(this,i)}}},orderBy:function(e,t,n){return o(e).sort(function(e,a){return t.reduce(function(t,l,o){if(0===t){var i=n&&'desc'===n[o]?[a[l],e[l]]:[e[l],a[l]],c=r(i,2),s=c[0],d=c[1];t=s>d?1:s<d?-1:0}return t},0)})},over:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return function(){for(var e=arguments.length,n=Array(e),i=0;i<e;i++)n[i]=arguments[i];return t.map(function(e){return e.apply(null,n)})}},overArgs:function(e,t){return function(){for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(void 0,o(i.map(function(e,n){return t[n](e)})))}},pad:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:' ';return e.padStart((e.length+t)/2,n).padEnd(t,n)},palindrome:function(e){var t=e.toLowerCase().replace(/[\W_]/g,'');return t===o(t).reverse().join('')},parseCookie:function(e){return e.split(';').map(function(e){return e.split('=')}).reduce(function(e,t){return e[decodeURIComponent(t[0].trim())]=decodeURIComponent(t[1].trim()),e},{})},partial:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return function(){for(var t=arguments.length,i=Array(t),r=0;r<t;r++)i[r]=arguments[r];return e.apply(void 0,n.concat(i))}},partialRight:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return function(){for(var t=arguments.length,i=Array(t),r=0;r<t;r++)i[r]=arguments[r];return e.apply(void 0,i.concat(n))}},partition:function(e,t){return e.reduce(function(e,n,r,i){return e[t(n,r,i)?0:1].push(n),e},[[],[]])},percentile:function(e,t){return 100*e.reduce(function(e,n){return e+(n<t?1:0)+(n===t?.5:0)},0)/e.length},permutations:function e(t){return 2>=t.length?2===t.length?[t,[t[1],t[0]]]:t:t.reduce(function(n,r,a){return n.concat(e(o(t.slice(0,a)).concat(o(t.slice(a+1)))).map(function(e){return[r].concat(o(e))}))},[])},pick:function(e,t){return t.reduce(function(t,n){return n in e&&(t[n]=e[n]),t},{})},pickBy:function(e,t){return Object.keys(e).filter(function(n){return t(e[n],n)}).reduce(function(t,n){return t[n]=e[n],t},{})},pipeAsyncFunctions:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return function(e){return t.reduce(function(e,t){return e.then(t)},Promise.resolve(e))}},pipeFunctions:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return function(){return t(e.apply(void 0,arguments))}})},pluralize:N,powerset:function(e){return e.reduce(function(e,t){return e.concat(e.map(function(e){return[t].concat(e)}))},[[]])},prefix:function(e){var t=e.charAt(0).toUpperCase()+e.slice(1),n=['','webkit','moz','ms','o'],r=n.findIndex(function(n){return'undefined'!=typeof document.body.style[n?n+t:e]});return-1===r?null:0===r?e:n[r]+t},prettyBytes:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:3,i=!(2<arguments.length&&arguments[2]!==void 0)||arguments[2],r=['B','KB','MB','GB','TB','PB','EB','ZB','YB'];if(1>v(e))return e+(i?' ':'')+r[0];var a=m(y(Math.log10(0>e?-e:e)/3),r.length-1),l=+((0>e?-e:e)/g(1e3,a)).toPrecision(t);return(0>e?'-':'')+l+(i?' ':'')+r[a]},primes:function(e){var t=Array.from({length:e-1}).map(function(e,t){return t+2}),n=y(h(e)),i=Array.from({length:n-1}).map(function(e,t){return t+2});return i.forEach(function(e){return t=t.filter(function(t){return 0!=t%e||t===e})}),t},promisify:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return new Promise(function(t,i){return e.apply(void 0,n.concat([function(e,n){return e?i(e):t(n)}]))})}},pull:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];var r=Array.isArray(n[0])?n[0]:n,a=e.filter(function(e){return!r.includes(e)});e.length=0,a.forEach(function(t){return e.push(t)})},pullAtIndex:function(e,t){var n=[],i=e.map(function(e,r){return t.includes(r)?n.push(e):e}).filter(function(e,n){return!t.includes(n)});return e.length=0,i.forEach(function(t){return e.push(t)}),n},pullAtValue:function(e,t){var n=[],i=e.forEach(function(e){return t.includes(e)?n.push(e):e}),r=e.filter(function(e){return!t.includes(e)});return e.length=0,r.forEach(function(t){return e.push(t)}),n},pullBy:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];var r=n.length,a=1<r?n[r-1]:void 0;a='function'==typeof a?(n.pop(),a):void 0;var l=(Array.isArray(n[0])?n[0]:n).map(function(e){return a(e)}),o=e.filter(function(e){return!l.includes(a(e))});e.length=0,o.forEach(function(t){return e.push(t)})},radsToDegrees:function(e){return 180*e/u},randomHexColorCode:function(){var e=(1e6*(1048575*Math.random())).toString(16);return'#'+e.slice(0,6)},randomIntArrayInRange:function(e,t){var i=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array.from({length:i},function(){return y(Math.random()*(t-e+1))+e})},randomIntegerInRange:function(e,t){return y(Math.random()*(t-e+1))+e},randomNumberInRange:function(e,t){return Math.random()*(t-e)+e},readFileLines:function(e){return j.readFileSync(e).toString('UTF8').split('\n')},rearg:function(e,t){return function(){for(var n=arguments.length,r=Array(n),i=0;i<n;i++)r[i]=arguments[i];return e.apply(void 0,o(t.map(function(e){return r[e]})))}},recordAnimationFrames:function(e){var t,n=!(1<arguments.length&&void 0!==arguments[1])||arguments[1],i=!0,r=function(){i=!1,cancelAnimationFrame(t)},a=function(){i=!0,l()},l=function n(){t=requestAnimationFrame(function(){e(),i&&n()})};return n&&a(),{start:a,stop:r}},redirect:function(e){var t=!(1<arguments.length&&arguments[1]!==void 0)||arguments[1];return t?window.location.href=e:window.location.replace(e)},reduceSuccessive:function(e,t,n){return e.reduce(function(e,n,r,i){return e.push(t(e.slice(-1)[0],n,r,i)),e},[n])},reduceWhich:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:function(e,t){return e-t};return e.reduce(function(e,n){return 0<=t(e,n)?n:e})},reducedFilter:function(e,t,n){return e.filter(n).map(function(e){return t.reduce(function(t,n){return t[n]=e[n],t},{})})},reject:function(e,t){return t.filter(function(){return!e.apply(void 0,arguments)})},remove:function(e,t){return Array.isArray(e)?e.filter(t).reduce(function(t,n){return e.splice(e.indexOf(n),1),t.concat(n)},[]):[]},removeNonASCII:function(e){return e.replace(/[^\x20-\x7E]/g,'')},renameKeys:function(e,i){return Object.keys(i).reduce(function(r,a){return n({},r,t({},e[a]||a,i[a]))},{})},reverseString:function(e){return o(e).reverse().join('')},round:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return+''.concat(_(''.concat(e,'e').concat(t)),'e-').concat(t)},runAsync:function(e){var t=new Worker(URL.createObjectURL(new Blob(['postMessage(('.concat(e,')());')]),{type:'application/javascript; charset=utf-8'}));return new Promise(function(e,n){t.onmessage=function(n){var i=n.data;e(i),t.terminate()},t.onerror=function(e){n(e),t.terminate()}})},runPromisesInSeries:function(e){return e.reduce(function(e,t){return e.then(t)},Promise.resolve())},sample:function(e){return e[y(Math.random()*e.length)]},sampleSize:function(e){for(var t=l(e),r=t.slice(0),a=1<arguments.length&&void 0!==arguments[1]?arguments[1]:1,n=r.length;n;){var o=y(Math.random()*n--),i=[r[o],r[n]];r[n]=i[0],r[o]=i[1]}return r.slice(0,a)},scrollToTop:function e(){var t=document.documentElement.scrollTop||document.body.scrollTop;0<t&&(window.requestAnimationFrame(e),window.scrollTo(0,t-t/8))},sdbm:function(e){var t=e.split('');return t.reduce(function(e,t){return e=t.charCodeAt(0)+(e<<6)+(e<<16)-e},0)},serializeCookie:function(e,t){return''.concat(encodeURIComponent(e),'=').concat(encodeURIComponent(t))},setStyle:function(e,t,n){return e.style[t]=n},shallowClone:function(e){return Object.assign({},e)},shank:function(e){for(var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:0,i=arguments.length,r=Array(3<i?i-3:0),a=3;a<i;a++)r[a-3]=arguments[a];return e.slice(0,t).concat(r).concat(e.slice(t+n))},show:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.concat().forEach(function(t){return t.style.display=''})},shuffle:function(e){for(var t=l(e),n=t.slice(0),r=n.length;r;){var a=y(Math.random()*r--),i=[n[a],n[r]];n[r]=i[0],n[a]=i[1]}return n},similarity:function(e,t){return e.filter(function(e){return t.includes(e)})},size:z,sleep:function(e){return new Promise(function(t){return setTimeout(t,e)})},smoothScroll:function(e){return document.querySelector(e).scrollIntoView({behavior:'smooth'})},sortCharactersInString:function(e){return o(e).sort(function(e,t){return e.localeCompare(t)}).join('')},sortedIndex:function(e,t){var n=e[0]>e[e.length-1],i=e.findIndex(function(e){return n?t>=e:t<=e});return-1===i?e.length:i},sortedIndexBy:function(e,t,n){var i=n(e[0])>n(e[e.length-1]),r=n(t),a=e.findIndex(function(e){return i?r>=n(e):r<=n(e)});return-1===a?e.length:a},sortedLastIndex:function(e,t){var n=e[0]>e[e.length-1],i=e.reverse().findIndex(function(e){return n?t<=e:t>=e});return-1===i?0:e.length-i},sortedLastIndexBy:function(e,t,n){var i=n(e[0])>n(e[e.length-1]),r=n(t),a=e.map(n).reverse().findIndex(function(e){return i?r<=e:r>=e});return-1===a?0:e.length-a},splitLines:function(e){return e.split(/\r?\n/)},spreadOver:function(e){return function(t){return e.apply(void 0,o(t))}},stableSort:function(e,t){return e.map(function(e,t){return{item:e,index:t}}).sort(function(e,n){return t(e.item,n.item)||e.index-n.index}).map(function(e){var t=e.item;return t})},standardDeviation:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1],n=e.reduce(function(e,t){return e+t},0)/e.length;return h(e.reduce(function(e,t){return e.concat(g(t-n,2))},[]).reduce(function(e,t){return e+t},0)/(e.length-(t?0:1)))},stringPermutations:function e(t){return 2>=t.length?2===t.length?[t,t[1]+t[0]]:[t]:t.split('').reduce(function(n,r,a){return n.concat(e(t.slice(0,a)+t.slice(a+1)).map(function(e){return r+e}))},[])},stripHTMLTags:function(e){return e.replace(/<[^>]*>/g,'')},sum:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.concat().reduce(function(e,t){return e+t},0)},sumBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(e,t){return e+t},0)},sumPower:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:2,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array(e+1-n).fill(0).map(function(e,r){return g(r+n,t)}).reduce(function(e,t){return e+t},0)},symmetricDifference:function(e,t){var n=new Set(e),i=new Set(t);return o(e.filter(function(e){return!i.has(e)})).concat(o(t.filter(function(e){return!n.has(e)})))},symmetricDifferenceBy:function(e,t,n){var i=new Set(e.map(function(e){return n(e)})),r=new Set(t.map(function(e){return n(e)}));return o(e.filter(function(e){return!r.has(n(e))})).concat(o(t.filter(function(e){return!i.has(n(e))})))},symmetricDifferenceWith:function(e,t,n){return o(e.filter(function(e){return-1===t.findIndex(function(t){return n(e,t)})})).concat(o(t.filter(function(t){return-1===e.findIndex(function(e){return n(t,e)})})))},tail:function(e){return 1<e.length?e.slice(1):e},take:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(0,t)},takeRight:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(e.length-t,e.length)},takeRightWhile:function(e,t){return e.reduceRight(function(e,n){return t(n)?e:[n].concat(o(e))},[])},takeWhile:function(e,t){var n=!0,a=!1,l=void 0;try{for(var o,c=e.entries()[Symbol.iterator]();!(n=(o=c.next()).done);n=!0){var s=r(o.value,2),d=s[0],i=s[1];if(t(i))return e.slice(0,d)}}catch(e){a=!0,l=e}finally{try{n||null==c.return||c.return()}finally{if(a)throw l}}return e},throttle:function(e,t){var n,i,r;return function(){var a=this,l=arguments;n?(clearTimeout(i),i=setTimeout(function(){Date.now()-r>=t&&(e.apply(a,l),r=Date.now())},k(t-(Date.now()-r),0))):(e.apply(a,l),r=Date.now(),n=!0)}},timeTaken:function(e){console.time('timeTaken');var t=e();return console.timeEnd('timeTaken'),t},times:function(e,t){for(var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:void 0,r=0;!1!==t.call(n,r)&&++r<e;);},toCamelCase:function(e){var t=e&&e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.slice(0,1).toUpperCase()+e.slice(1).toLowerCase()}).join('');return t.slice(0,1).toLowerCase()+t.slice(1)},toCurrency:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:void 0;return Intl.NumberFormat(n,{style:'currency',currency:t}).format(e)},toDecimalMark:function(e){return e.toLocaleString('en-US')},toHash:function(e,t){return Array.prototype.reduce.call(e,function(e,n,i){return e[t?n[t]:i]=n,e},{})},toKebabCase:function(e){return e&&e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.toLowerCase()}).join('-')},toOrdinalSuffix:function(e){var t=parseInt(e),n=[t%10,t%100],i=['st','nd','rd','th'];return[1,2,3,4].includes(n[0])&&![11,12,13,14,15,16,17,18,19].includes(n[1])?t+i[n[0]-1]:t+i[3]},toSafeInteger:function(e){return _(k(m(e,Number.MAX_SAFE_INTEGER),Number.MIN_SAFE_INTEGER))},toSnakeCase:function(e){return e&&e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.toLowerCase()}).join('_')},toggleClass:function(e,t){return e.classList.toggle(t)},tomorrow:function(){var e=!!(0<arguments.length&&arguments[0]!==void 0)&&arguments[0],n=new Date;n.setDate(n.getDate()+1);var t=''.concat(n.getFullYear(),'-').concat((n.getMonth()+1+'').padStart(2,'0'),'-').concat((n.getDate()+'').padStart(2,'0'));return e?''.concat(t,'T00:00:00'):t},transform:function(e,t,n){return Object.keys(e).reduce(function(n,i){return t(n,e[i],i,e)},n)},triggerEvent:function(e,t,n){return e.dispatchEvent(new CustomEvent(t,{detail:n}))},truncateString:function(e,t){return e.length>t?e.slice(0,3<t?t-3:t)+'...':e},truthCheckCollection:function(e,t){return e.every(function(e){return e[t]})},unary:function(e){return function(t){return e(t)}},uncurry:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return function(){for(var n=function(e){return function(t){return t.reduce(function(e,t){return e(t)},e)}},i=arguments.length,r=Array(i),a=0;a<i;a++)r[a]=arguments[a];if(t>r.length)throw new RangeError('Arguments too few!');return n(e)(r.slice(0,t))}},unescapeHTML:function(e){return e.replace(/&amp;|&lt;|&gt;|&#39;|&quot;/g,function(e){return{"&amp;":'&',"&lt;":'<',"&gt;":'>',"&#39;":'\'',"&quot;":'"'}[e]||e})},unflattenObject:function(e){return Object.keys(e).reduce(function(t,n){if(-1!==n.indexOf('.')){var r=n.split('.');Object.assign(t,JSON.parse('{'+r.map(function(e,t){return t===r.length-1?'"'.concat(e,'":'):'"'.concat(e,'":{')}).join('')+e[n]+'}'.repeat(r.length)))}else t[n]=e[n];return t},{})},unfold:function(e,t){for(var n=[],i=[null,t];i=e(i[1]);)n.push(i[0]);return n},union:function(e,t){return Array.from(new Set(o(e).concat(o(t))))},unionBy:function(e,t,n){var i=new Set(e.map(n));return Array.from(new Set(o(e).concat(o(t.filter(function(e){return!i.has(n(e))})))))},unionWith:function(e,t,n){return Array.from(new Set(o(e).concat(o(t.filter(function(t){return-1===e.findIndex(function(e){return n(t,e)})})))))},uniqueElements:function(e){return o(new Set(e))},uniqueElementsBy:function(e,t){return e.reduce(function(e,n){return e.some(function(e){return t(n,e)})||e.push(n),e},[])},uniqueElementsByRight:function(e,t){return e.reduceRight(function(e,n){return e.some(function(e){return t(n,e)})||e.push(n),e},[])},uniqueSymmetricDifference:function(e,t){return o(new Set(o(e.filter(function(e){return!t.includes(e)})).concat(o(t.filter(function(t){return!e.includes(t)})))))},untildify:function(e){return e.replace(/^~($|\/|\\)/,''.concat(require('os').homedir(),'$1'))},unzip:function(e){return e.reduce(function(e,t){return t.forEach(function(t,n){return e[n].push(t)}),e},Array.from({length:k.apply(Math,o(e.map(function(e){return e.length})))}).map(function(){return[]}))},unzipWith:function(e,t){return e.reduce(function(e,t){return t.forEach(function(t,n){return e[n].push(t)}),e},Array.from({length:k.apply(Math,o(e.map(function(e){return e.length})))}).map(function(){return[]})).map(function(e){return t.apply(void 0,o(e))})},validateNumber:function(e){return!isNaN(parseFloat(e))&&isFinite(e)&&+e==e},when:function(e,t){return function(n){return e(n)?t(n):n}},without:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return e.filter(function(e){return!n.includes(e)})},words:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:/[^a-zA-Z-]+/;return e.split(t).filter(Boolean)},xProd:function(e,t){return e.reduce(function(e,n){return e.concat(t.map(function(e){return[n,e]}))},[])},yesNo:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return!!/^(y|yes)$/i.test(e)||!/^(n|no)$/i.test(e)&&t},zip:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];var i=k.apply(Math,o(t.map(function(e){return e.length})));return Array.from({length:i}).map(function(e,n){return Array.from({length:t.length},function(e,i){return t[i][n]})})},zipObject:function(e,t){return e.reduce(function(e,n,i){return e[n]=t[i],e},{})},zipWith:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];var r='function'==typeof t[t.length-1]?t.pop():void 0;return Array.from({length:k.apply(Math,o(t.map(function(e){return e.length})))},function(e,n){return r?r.apply(void 0,o(t.map(function(e){return e[n]}))):t.map(function(e){return e[n]})})}}});
+(function(e,t){'object'==typeof exports&&'undefined'!=typeof module?t():'function'==typeof define&&define.amd?define(t):t()})(this,function(){'use strict';function e(t){return e='function'==typeof Symbol&&'symbol'==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&'function'==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?'symbol':typeof e},e(t)}function t(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}function n(e){for(var n=1;n<arguments.length;n++){var i=null==arguments[n]?{}:arguments[n],r=Object.keys(i);'function'==typeof Object.getOwnPropertySymbols&&(r=r.concat(Object.getOwnPropertySymbols(i).filter(function(e){return Object.getOwnPropertyDescriptor(i,e).enumerable}))),r.forEach(function(n){t(e,n,i[n])})}return e}function r(e,t){return a(e)||s(e,t)||p()}function l(e){return a(e)||c(e)||p()}function o(e){return i(e)||c(e)||d()}function i(e){if(Array.isArray(e)){for(var t=0,n=Array(e.length);t<e.length;t++)n[t]=e[t];return n}}function a(e){if(Array.isArray(e))return e}function c(e){if(Symbol.iterator in Object(e)||'[object Arguments]'===Object.prototype.toString.call(e))return Array.from(e)}function s(e,t){var n=[],i=!0,r=!1,a=void 0;try{for(var l,o=e[Symbol.iterator]();!(i=(l=o.next()).done)&&(n.push(l.value),!(t&&n.length===t));i=!0);}catch(e){r=!0,a=e}finally{try{i||null==o['return']||o['return']()}finally{if(r)throw a}}return n}function d(){throw new TypeError('Invalid attempt to spread non-iterable instance')}function p(){throw new TypeError('Invalid attempt to destructure non-iterable instance')}var h=Math.sqrt,g=Math.pow,u=Math.PI,y=Math.floor,m=Math.min,k=Math.max,b=Math.ceil,_=Math.round,v=Math.abs,j='undefined'!=typeof require&&require('fs'),S='undefined'!=typeof require&&require('crypto'),C=function t(n,i){return i in n?n[i]:Object.values(n).reduce(function(n,r){return void 0===n?'object'===e(r)?t(r,i):void 0:n},void 0)},x=function t(n,i){if(n===i)return!0;if(n instanceof Date&&i instanceof Date)return n.getTime()===i.getTime();if(!n||!i||'object'!==e(n)&&'object'!==e(i))return n===i;if(null===n||void 0===n||null===i||void 0===i)return!1;if(n.prototype!==i.prototype)return!1;var r=Object.keys(n);return r.length===Object.keys(i).length&&r.every(function(e){return t(n[e],i[e])})},w=function(){return!['undefined'==typeof window?'undefined':e(window),'undefined'==typeof document?'undefined':e(document)].includes('undefined')},E=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe&&'function'==typeof t._read&&'object'===e(t._readableState)&&'function'==typeof t._write&&'object'===e(t._writableState)},A=function(t){return null!==t&&'object'===e(t)},T=function(t){return!!t&&'object'===e(t)&&t.constructor===Object},L=function(t){return null!==t&&('object'===e(t)||'function'==typeof t)&&'function'==typeof t.then},I=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe&&'function'==typeof t._read&&'object'===e(t._readableState)},O=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe},B=function(t){return'symbol'===e(t)},R=function(){return'TRAVIS'in process.env&&'CI'in process.env},D=function(t){return null!==t&&'object'===e(t)&&'function'==typeof t.pipe&&'function'==typeof t._write&&'object'===e(t._writableState)},N=function(t,n){var i=2<arguments.length&&void 0!==arguments[2]?arguments[2]:n+'s',r=function(e,t){var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:t+'s';return[1,-1].includes(+e)?t:n};return'object'===e(t)?function(e,n){return r(e,n,t[n])}:r(t,n,i)},z=function(t){return Array.isArray(t)?t.length:t&&'object'===e(t)?t.size||t.length||Object.keys(t).length:'string'==typeof t?new Blob([t]).size:0};module.exports={CSVToArray:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',',n=!!(2<arguments.length&&arguments[2]!==void 0)&&arguments[2];return e.slice(n?e.indexOf('\n')+1:0).split('\n').map(function(e){return e.split(t)})},CSVToJSON:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',',n=e.slice(0,e.indexOf('\n')).split(t);return e.slice(e.indexOf('\n')+1).split('\n').map(function(e){var i=e.split(t);return n.reduce(function(e,t,n){return e[t]=i[n],e},{})})},JSONToFile:function(e,t){return j.writeFile(''.concat(t,'.json'),JSON.stringify(e,null,2))},JSONtoCSV:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:',';return[t.join(n)].concat(o(e.map(function(e){return t.reduce(function(t,i){return''.concat(t).concat(t.length?n:'','"').concat(e[i]?e[i]:'','"')},'')}))).join('\n')},RGBToHex:function(e,t,n){return((e<<16)+(t<<8)+n).toString(16).padStart(6,'0')},URLJoin:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.join('/').replace(/[\/]+/g,'/').replace(/^(.+):\//,'$1://').replace(/^file:/,'file:/').replace(/\/(\?|&|#[^!])/g,'$1').replace(/\?/g,'&').replace('&','?')},UUIDGeneratorBrowser:function(){return'10000000-1000-4000-8000-100000000000'.replace(/[018]/g,function(e){return(e^S.getRandomValues(new Uint8Array(1))[0]&15>>e/4).toString(16)})},UUIDGeneratorNode:function(){return'10000000-1000-4000-8000-100000000000'.replace(/[018]/g,function(e){return(e^S.randomBytes(1)[0]&15>>e/4).toString(16)})},all:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:Boolean;return e.every(t)},allEqual:function(e){return e.every(function(t){return t===e[0]})},any:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:Boolean;return e.some(t)},approximatelyEqual:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:.001;return v(e-t)<n},arrayToCSV:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',';return e.map(function(e){return e.map(function(e){return'"'.concat(e,'"')}).join(t)}).join('\n')},arrayToHtmlList:function(e,t){return function(n){return n=document.querySelector('#'+t),n.innerHTML+=e.map(function(e){return'<li>'.concat(e,'</li>')}).join('')}()},ary:function(e,t){return function(){for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(void 0,o(i.slice(0,t)))}},atob:function(e){return Buffer.from(e,'base64').toString('binary')},attempt:function(e){try{for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return e.apply(void 0,n)}catch(t){return t instanceof Error?t:new Error(t)}},average:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return e+t},0)/t.length},averageBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(e,t){return e+t},0)/e.length},bifurcate:function(e,t){return e.reduce(function(e,n,r){return e[t[r]?0:1].push(n),e},[[],[]])},bifurcateBy:function(e,t){return e.reduce(function(e,n,r){return e[t(n,r)?0:1].push(n),e},[[],[]])},bind:function(e,t){for(var n=arguments.length,i=Array(2<n?n-2:0),r=2;r<n;r++)i[r-2]=arguments[r];return function(){for(var n=arguments.length,r=Array(n),a=0;a<n;a++)r[a]=arguments[a];return e.apply(t,i.concat(r))}},bindAll:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return n.forEach(function(t){return f=e[t],e[t]=function(){return f.apply(e)}})},bindKey:function(e,t){for(var n=arguments.length,i=Array(2<n?n-2:0),r=2;r<n;r++)i[r-2]=arguments[r];return function(){for(var n=arguments.length,r=Array(n),a=0;a<n;a++)r[a]=arguments[a];return e[t].apply(e,i.concat(r))}},binomialCoefficient:function(e,t){var n=Number.isNaN;if(n(e)||n(t))return NaN;if(0>t||t>e)return 0;if(0===t||t===e)return 1;if(1===t||t===e-1)return e;e-t<t&&(t=e-t);for(var i=e,r=2;r<=t;r++)i*=(e-r+1)/r;return _(i)},bottomVisible:function(){return document.documentElement.clientHeight+window.scrollY>=(document.documentElement.scrollHeight||document.documentElement.clientHeight)},btoa:function(e){return Buffer.from(e,'binary').toString('base64')},byteSize:function(e){return new Blob([e]).size},call:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return function(t){return t[e].apply(t,n)}},capitalize:function(e){var t=l(e),n=t[0],i=t.slice(1),r=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return n.toUpperCase()+(r?i.join('').toLowerCase():i.join(''))},capitalizeEveryWord:function(e){return e.replace(/\b[a-z]/g,function(e){return e.toUpperCase()})},castArray:function(e){return Array.isArray(e)?e:[e]},chainAsync:function(e){var t=0,n=function n(){return e[t++](n)};n()},chunk:function(e,t){return Array.from({length:b(e.length/t)},function(n,r){return e.slice(r*t,r*t+t)})},clampNumber:function(e,t,n){return k(m(e,k(t,n)),m(t,n))},cloneRegExp:function(e){return new RegExp(e.source,e.flags)},coalesce:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.find(function(e){return![void 0,null].includes(e)})},coalesceFactory:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return n.find(e)}},collectInto:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return e(n)}},colorize:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return{black:'\x1B[30m'.concat(t.join(' ')),red:'\x1B[31m'.concat(t.join(' ')),green:'\x1B[32m'.concat(t.join(' ')),yellow:'\x1B[33m'.concat(t.join(' ')),blue:'\x1B[34m'.concat(t.join(' ')),magenta:'\x1B[35m'.concat(t.join(' ')),cyan:'\x1B[36m'.concat(t.join(' ')),white:'\x1B[37m'.concat(t.join(' ')),bgBlack:'\x1B[40m'.concat(t.join(' '),'\x1B[0m'),bgRed:'\x1B[41m'.concat(t.join(' '),'\x1B[0m'),bgGreen:'\x1B[42m'.concat(t.join(' '),'\x1B[0m'),bgYellow:'\x1B[43m'.concat(t.join(' '),'\x1B[0m'),bgBlue:'\x1B[44m'.concat(t.join(' '),'\x1B[0m'),bgMagenta:'\x1B[45m'.concat(t.join(' '),'\x1B[0m'),bgCyan:'\x1B[46m'.concat(t.join(' '),'\x1B[0m'),bgWhite:'\x1B[47m'.concat(t.join(' '),'\x1B[0m')}},compact:function(e){return e.filter(Boolean)},compose:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return function(){return e(t.apply(void 0,arguments))}})},composeRight:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return function(){return t(e.apply(void 0,arguments))}})},converge:function(e,t){return function(){for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(void 0,o(t.map(function(e){return e.apply(null,i)})))}},copyToClipboard:function(e){var t=document.createElement('textarea');t.value=e,t.setAttribute('readonly',''),t.style.position='absolute',t.style.left='-9999px',document.body.appendChild(t);var n=!!(0<document.getSelection().rangeCount)&&document.getSelection().getRangeAt(0);t.select(),document.execCommand('copy'),document.body.removeChild(t),n&&(document.getSelection().removeAllRanges(),document.getSelection().addRange(n))},countBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(e,t){return e[t]=(e[t]||0)+1,e},{})},countOccurrences:function(e,t){return e.reduce(function(e,n){return n===t?e+1:e},0)},counter:function(e,t,n){var i=3<arguments.length&&arguments[3]!==void 0?arguments[3]:1,r=4<arguments.length&&arguments[4]!==void 0?arguments[4]:2e3,a=t,l=0>(n-t)*i?-i:i,o=setInterval(function(){a+=l,document.querySelector(e).innerHTML=a,a>=n&&(document.querySelector(e).innerHTML=n),a>=n&&clearInterval(o)},v(y(r/(n-t))));return o},createElement:function(e){var t=document.createElement('div');return t.innerHTML=e,t.firstElementChild},createEventHub:function(){return{hub:Object.create(null),emit:function(e,t){(this.hub[e]||[]).forEach(function(e){return e(t)})},on:function(e,t){this.hub[e]||(this.hub[e]=[]),this.hub[e].push(t)},off:function(e,t){var n=(this.hub[e]||[]).findIndex(function(e){return e===t});-1<n&&this.hub[e].splice(n,1)}}},currentURL:function(){return window.location.href},curry:function e(t){for(var n=1<arguments.length&&arguments[1]!==void 0?arguments[1]:t.length,i=arguments.length,r=Array(2<i?i-2:0),a=2;a<i;a++)r[a-2]=arguments[a];return n<=r.length?t.apply(void 0,r):e.bind.apply(e,[null,t,n].concat(r))},dayOfYear:function(e){return y((e-new Date(e.getFullYear(),0,0))/1e3/60/60/24)},debounce:function(e){var t,n=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return function(){for(var i=this,r=arguments.length,a=Array(r),l=0;l<r;l++)a[l]=arguments[l];clearTimeout(t),t=setTimeout(function(){return e.apply(i,a)},n)}},decapitalize:function(e){var t=l(e),n=t[0],i=t.slice(1),r=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return n.toLowerCase()+(r?i.join('').toUpperCase():i.join(''))},deepClone:function t(n){var i=Object.assign({},n);return Object.keys(i).forEach(function(r){return i[r]='object'===e(n[r])?t(n[r]):n[r]}),Array.isArray(n)?(i.length=n.length)&&Array.from(i):i},deepFlatten:function e(t){var n;return(n=[]).concat.apply(n,o(t.map(function(t){return Array.isArray(t)?e(t):t})))},deepFreeze:function e(t){return Object.keys(t).forEach(function(n){return!(t[n]instanceof Object)||Object.isFrozen(t[n])?null:e(t[n])})||Object.freeze(t)},defaults:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return Object.assign.apply(Object,[{},e].concat(o(n.reverse()),[e]))},defer:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return setTimeout.apply(void 0,[e,1].concat(n))},degreesToRads:function(e){return e*u/180},delay:function(e,t){for(var n=arguments.length,i=Array(2<n?n-2:0),r=2;r<n;r++)i[r-2]=arguments[r];return setTimeout.apply(void 0,[e,t].concat(i))},detectDeviceType:function(){return /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent)?'Mobile':'Desktop'},difference:function(e,t){var n=new Set(t);return e.filter(function(e){return!n.has(e)})},differenceBy:function(e,t,n){var i=new Set(t.map(n));return e.filter(function(e){return!i.has(n(e))})},differenceWith:function(e,t,n){return e.filter(function(e){return-1===t.findIndex(function(t){return n(e,t)})})},dig:C,digitize:function(e){return o(''.concat(e)).map(function(e){return parseInt(e)})},distance:function(e,t,n,i){return Math.hypot(n-e,i-t)},drop:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(t)},dropRight:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(0,-t)},dropRightWhile:function(e,t){for(;0<e.length&&!t(e[e.length-1]);)e=e.slice(0,-1);return e},dropWhile:function(e,t){for(;0<e.length&&!t(e[0]);)e=e.slice(1);return e},elementContains:function(e,t){return e!==t&&e.contains(t)},elementIsVisibleInViewport:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1],n=e.getBoundingClientRect(),i=n.top,r=n.left,a=n.bottom,l=n.right,o=window,c=o.innerHeight,s=o.innerWidth;return t?(0<i&&i<c||0<a&&a<c)&&(0<r&&r<s||0<l&&l<s):0<=i&&0<=r&&a<=c&&l<=s},elo:function e(t){var n=l(t),o=n.slice(0),c=1<arguments.length&&arguments[1]!==void 0?arguments[1]:32,s=2<arguments.length?arguments[2]:void 0,d=r(o,2),p=d[0],a=d[1],h=function(e,t){return 1/(1+g(10,(t-e)/400))},u=function(e,t){return(s||e)+c*(t-h(t?p:a,t?a:p))};if(2===o.length)return[u(p,1),u(a,0)];for(var y,m=0,i=o.length;m<i;m++)for(y=m;y<i-1;){y++;var k=e([o[m],o[y]],c),b=r(k,2);o[m]=b[0],o[y]=b[1]}return o},equals:x,escapeHTML:function(e){return e.replace(/[&<>'"]/g,function(e){return{"&":'&amp;',"<":'&lt;',">":'&gt;',"'":'&#39;','"':'&quot;'}[e]||e})},escapeRegExp:function(e){return e.replace(/[.*+?^${}()|[\]\\]/g,'\\$&')},everyNth:function(e,t){return e.filter(function(n,e){return e%t==t-1})},extendHex:function(e){return'#'+e.slice(e.startsWith('#')?1:0).split('').map(function(e){return e+e}).join('')},factorial:function e(t){return 0>t?function(){throw new TypeError('Negative numbers are not allowed!')}():1>=t?1:t*e(t-1)},fibonacci:function(e){return Array.from({length:e}).reduce(function(e,t,n){return e.concat(1<n?e[n-1]+e[n-2]:n)},[])},filterNonUnique:function(e){return e.filter(function(t){return e.indexOf(t)===e.lastIndexOf(t)})},filterNonUniqueBy:function(e,t){return e.filter(function(n,r){return e.every(function(e,i){return r===i===t(n,e,r,i)})})},findKey:function(e,t){return Object.keys(e).find(function(n){return t(e[n],n,e)})},findLast:function(e,t){return e.filter(t).pop()},findLastIndex:function(e,t){return e.map(function(e,t){return[t,e]}).filter(function(n){var a=r(n,2),l=a[0],i=a[1];return t(i,l,e)}).pop()[0]},findLastKey:function(e,t){return Object.keys(e).reverse().find(function(n){return t(e[n],n,e)})},flatten:function e(t){var n=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return t.reduce(function(t,i){return t.concat(1<n&&Array.isArray(i)?e(i,n-1):i)},[])},flattenObject:function t(n){var i=1<arguments.length&&arguments[1]!==void 0?arguments[1]:'';return Object.keys(n).reduce(function(r,a){var l=i.length?i+'.':'';return'object'===e(n[a])?Object.assign(r,t(n[a],l+a)):r[l+a]=n[a],r},{})},flip:function(e){return function(t){for(var n=arguments.length,i=Array(1<n?n-1:0),r=1;r<n;r++)i[r-1]=arguments[r];return e.apply(void 0,i.concat([t]))}},forEachRight:function(e,t){return e.slice(0).reverse().forEach(t)},forOwn:function(e,t){return Object.keys(e).forEach(function(n){return t(e[n],n,e)})},forOwnRight:function(e,t){return Object.keys(e).reverse().forEach(function(n){return t(e[n],n,e)})},formatDuration:function(e){0>e&&(e=-e);var t={day:y(e/864e5),hour:y(e/36e5)%24,minute:y(e/6e4)%60,second:y(e/1e3)%60,millisecond:y(e)%1e3};return Object.entries(t).filter(function(e){return 0!==e[1]}).map(function(e){var t=r(e,2),n=t[0],i=t[1];return''.concat(i,' ').concat(n).concat(1===i?'':'s')}).join(', ')},fromCamelCase:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:'_';return e.replace(/([a-z\d])([A-Z])/g,'$1'+t+'$2').replace(/([A-Z]+)([A-Z][a-z\d]+)/g,'$1'+t+'$2').toLowerCase()},functionName:function(e){return console.debug(e.name),e},functions:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return(t?o(Object.keys(e)).concat(o(Object.keys(Object.getPrototypeOf(e)))):Object.keys(e)).filter(function(t){return'function'==typeof e[t]})},gcd:function e(){for(var t=function(t,n){return n?e(n,t%n):t},n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return i.concat().reduce(function(e,n){return t(e,n)})},geometricProgression:function(e){var t=Math.log,n=1<arguments.length&&void 0!==arguments[1]?arguments[1]:1,r=2<arguments.length&&void 0!==arguments[2]?arguments[2]:2;return Array.from({length:y(t(e/n)/t(r))+1}).map(function(e,t){return n*g(r,t)})},get:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return n.concat().map(function(t){return t.replace(/\[([^\[\]]*)\]/g,'.$1.').split('.').filter(function(e){return''!==e}).reduce(function(e,t){return e&&e[t]},e)})},getColonTimeFromDate:function(e){return e.toTimeString().slice(0,8)},getDaysDiffBetweenDates:function(e,t){return(t-e)/86400000},getImages:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1],n=o(e.getElementsByTagName('img')).map(function(e){return e.getAttribute('src')});return t?n:o(new Set(n))},getMeridiemSuffixOfInteger:function(e){return 0===e||24===e?'12am':12===e?'12pm':12>e?e%12+'am':e%12+'pm'},getScrollPosition:function(){var e=0<arguments.length&&arguments[0]!==void 0?arguments[0]:window;return{x:e.pageXOffset===void 0?e.scrollLeft:e.pageXOffset,y:e.pageYOffset===void 0?e.scrollTop:e.pageYOffset}},getStyle:function(e,t){return getComputedStyle(e)[t]},getType:function(e){return e===void 0?'undefined':null===e?'null':e.constructor.name.toLowerCase()},getURLParameters:function(e){return(e.match(/([^?=&]+)(=([^&]*))/g)||[]).reduce(function(e,t){return e[t.slice(0,t.indexOf('='))]=t.slice(t.indexOf('=')+1),e},{})},groupBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(t,n,r){return t[n]=(t[n]||[]).concat(e[r]),t},{})},hammingDistance:function(e,t){return((e^t).toString(2).match(/1/g)||'').length},hasClass:function(e,t){return e.classList.contains(t)},hasFlags:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.every(function(e){return process.argv.includes(/^-{1,2}/.test(e)?e:'--'+e)})},hashBrowser:function(e){return S.subtle.digest('SHA-256',new TextEncoder('utf-8').encode(e)).then(function(e){for(var t=[],n=new DataView(e),r=0;r<n.byteLength;r+=4)t.push(('00000000'+n.getUint32(r).toString(16)).slice(-8));return t.join('')})},hashNode:function(e){return new Promise(function(t){return setTimeout(function(){return t(S.createHash('sha256').update(e).digest('hex'))},0)})},head:function(e){return e[0]},hexToRGB:function(e){var t=!1,n=e.slice(e.startsWith('#')?1:0);return 3===n.length?n=o(n).map(function(e){return e+e}).join(''):8===n.length&&(t=!0),n=parseInt(n,16),'rgb'+(t?'a':'')+'('+(n>>>(t?24:16))+', '+((n&(t?16711680:65280))>>>(t?16:8))+', '+((n&(t?65280:255))>>>(t?8:0))+(t?', '.concat(255&n):'')+')'},hide:function(e){return e.forEach(function(t){return t.style.display='none'})},httpGet:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:console.error,i=new XMLHttpRequest;i.open('GET',e,!0),i.onload=function(){return t(i.responseText)},i.onerror=function(){return n(i)},i.send()},httpPost:function(e,t,n){var i=3<arguments.length&&arguments[3]!==void 0?arguments[3]:console.error,r=new XMLHttpRequest;r.open('POST',e,!0),r.setRequestHeader('Content-type','application/json; charset=utf-8'),r.onload=function(){return n(r.responseText)},r.onerror=function(){return i(r)},r.send(t)},httpsRedirect:function(){'https:'!==location.protocol&&location.replace('https://'+location.href.split('//')[1])},hz:function(e){for(var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:100,n=performance.now(),r=0;r<t;r++)e();return 1e3*t/(performance.now()-n)},inRange:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:null;if(n&&t>n){var i=[t,n];n=i[0],t=i[1]}return null==n?0<=e&&e<t:e>=t&&e<n},indentString:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:' ';return e.replace(/^/gm,n.repeat(t))},indexOfAll:function(e,t){return e.reduce(function(e,n,r){return n===t?o(e).concat([r]):e},[])},initial:function(e){return e.slice(0,-1)},initialize2DArray:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:null;return Array.from({length:t}).map(function(){return Array.from({length:e}).fill(n)})},initializeArrayWithRange:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array.from({length:b((e-t+1)/n)},function(e,r){return r*n+t})},initializeArrayWithRangeRight:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array.from({length:b((e+1-t)/n)}).map(function(e,r,i){return(i.length-r-1)*n+t})},initializeArrayWithValues:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return Array(e).fill(t)},initializeNDArray:function e(t){for(var n=arguments.length,i=Array(1<n?n-1:0),r=1;r<n;r++)i[r-1]=arguments[r];return 0===i.length?t:Array.from({length:i[0]}).map(function(){return e.apply(void 0,[t].concat(o(i.slice(1))))})},insertAfter:function(e,t){return e.insertAdjacentHTML('afterend',t)},insertBefore:function(e,t){return e.insertAdjacentHTML('beforebegin',t)},intersection:function(e,t){var n=new Set(t);return e.filter(function(e){return n.has(e)})},intersectionBy:function(e,t,n){var i=new Set(t.map(n));return e.filter(function(e){return i.has(n(e))})},intersectionWith:function(e,t,n){return e.filter(function(e){return-1!==t.findIndex(function(t){return n(e,t)})})},invertKeyValues:function(e,t){return Object.keys(e).reduce(function(n,i){var r=t?t(e[i]):e[i];return n[r]=n[r]||[],n[r].push(i),n},{})},is:function(e,t){return![,null].includes(t)&&t.constructor===e},isAbsoluteURL:function(e){return /^[a-z][a-z0-9+.-]*:/.test(e)},isAfterDate:function(e,t){return e>t},isAnagram:function(e,t){var n=function(e){return e.toLowerCase().replace(/[^a-z0-9]/gi,'').split('').sort().join('')};return n(e)===n(t)},isArrayLike:function(e){return null!=e&&'function'==typeof e[Symbol.iterator]},isBeforeDate:function(e,t){return e<t},isBoolean:function(e){return'boolean'==typeof e},isBrowser:w,isBrowserTabFocused:function(){return!document.hidden},isDivisible:function(e,t){return 0==e%t},isDuplexStream:E,isEmpty:function(e){return null==e||!(Object.keys(e)||e).length},isEven:function(e){return 0==e%2},isFunction:function(e){return'function'==typeof e},isLowerCase:function(e){return e===e.toLowerCase()},isNil:function(e){return e===void 0||null===e},isNull:function(e){return null===e},isNumber:function(e){return'number'==typeof e},isObject:function(e){return e===Object(e)},isObjectLike:A,isPlainObject:T,isPrime:function(e){for(var t=y(h(e)),n=2;n<=t;n++)if(0==e%n)return!1;return 2<=e},isPrimitive:function(e){return Object(e)!==e},isPromiseLike:L,isReadableStream:I,isSameDate:function(e,t){return e.toISOString()===t.toISOString()},isSorted:function(e){var t=-(e[0]-e[1]),n=!0,a=!1,l=void 0;try{for(var o,c=e.entries()[Symbol.iterator]();!(n=(o=c.next()).done);n=!0){var s=r(o.value,2),d=s[0],i=s[1];if(t=t?t:-(e[d-1]-e[d]),d===e.length-1)return t?t:0;if(0<(i-e[d+1])*t)return 0}}catch(e){a=!0,l=e}finally{try{n||null==c.return||c.return()}finally{if(a)throw l}}},isStream:O,isString:function(e){return'string'==typeof e},isSymbol:B,isTravisCI:R,isUndefined:function(e){return e===void 0},isUpperCase:function(e){return e===e.toUpperCase()},isValidJSON:function(e){try{return JSON.parse(e),!0}catch(t){return!1}},isWritableStream:D,join:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:',',n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:t;return e.reduce(function(r,a,l){return l===e.length-2?r+a+n:l===e.length-1?r+a:r+a+t},'')},last:function(e){return e[e.length-1]},lcm:function(){for(var e=function e(t,n){return n?e(n,t%n):t},t=function(t,n){return t*n/e(t,n)},n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return i.concat().reduce(function(e,n){return t(e,n)})},longestItem:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return t.length>e.length?t:e})},lowercaseKeys:function(e){return Object.keys(e).reduce(function(t,n){return t[n.toLowerCase()]=e[n],t},{})},luhnCheck:function(e){var t=(e+'').split('').reverse().map(function(e){return parseInt(e)}),n=t.splice(0,1)[0],i=t.reduce(function(e,t,n){return 0==n%2?e+2*t%9||9:e+t},0);return i+=n,0==i%10},mapKeys:function(e,t){return Object.keys(e).reduce(function(n,i){return n[t(e[i],i,e)]=e[i],n},{})},mapObject:function(e,t){return function(n){return n=[e,e.map(t)],n[0].reduce(function(e,t,i){return e[t]=n[1][i],e},{})}()},mapString:function(e,t){return e.split('').map(function(n,r){return t(n,r,e)}).join('')},mapValues:function(e,t){return Object.keys(e).reduce(function(n,i){return n[i]=t(e[i],i,e),n},{})},mask:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:4,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:'*';return''.concat(e).slice(-t).padStart(''.concat(e).length,n)},matches:function(e,t){return Object.keys(t).every(function(n){return e.hasOwnProperty(n)&&e[n]===t[n]})},matchesWith:function(e,t,n){return Object.keys(t).every(function(i){return e.hasOwnProperty(i)&&n?n(e[i],t[i],i,e,t):e[i]==t[i]})},maxBy:function(e,t){return k.apply(Math,o(e.map('function'==typeof t?t:function(e){return e[t]})))},maxDate:function(){for(var e,t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return new Date((e=k).apply.apply(e,[null].concat(n)))},maxN:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return o(e).sort(function(e,t){return t-e}).slice(0,t)},median:function(e){var t=y(e.length/2),n=o(e).sort(function(e,t){return e-t});return 0==e.length%2?(n[t-1]+n[t])/2:n[t]},memoize:function(e){var t=new Map,n=function(n){return t.has(n)?t.get(n):t.set(n,e.call(this,n))&&t.get(n)};return n.cache=t,n},merge:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.concat().reduce(function(e,t){return Object.keys(t).reduce(function(n,i){return e[i]=e.hasOwnProperty(i)?[].concat(e[i]).concat(t[i]):t[i],e},{})},{})},minBy:function(e,t){return m.apply(Math,o(e.map('function'==typeof t?t:function(e){return e[t]})))},minDate:function(){for(var e,t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return new Date((e=m).apply.apply(e,[null].concat(n)))},minN:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return o(e).sort(function(e,t){return e-t}).slice(0,t)},mostPerformant:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1e4,n=e.map(function(e){for(var n=performance.now(),r=0;r<t;r++)e();return performance.now()-n});return n.indexOf(m.apply(Math,o(n)))},negate:function(e){return function(){return!e.apply(void 0,arguments)}},nest:function e(t){var i=1<arguments.length&&arguments[1]!==void 0?arguments[1]:null,r=2<arguments.length&&arguments[2]!==void 0?arguments[2]:'parent_id';return t.filter(function(e){return e[r]===i}).map(function(i){return n({},i,{children:e(t,i.id)})})},nodeListToArray:function(e){return o(e)},none:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:Boolean;return!e.some(t)},nthArg:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return n.slice(e)[0]}},nthElement:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return(-1===t?e.slice(t):e.slice(t,t+1))[0]},objectFromPairs:function(e){return e.reduce(function(e,t){var n=r(t,2),i=n[0],a=n[1];return e[i]=a,e},{})},objectToPairs:function(e){return Object.keys(e).map(function(t){return[t,e[t]]})},observeMutations:function(e,t,n){var i=new MutationObserver(function(e){return e.forEach(function(e){return t(e)})});return i.observe(e,Object.assign({childList:!0,attributes:!0,attributeOldValue:!0,characterData:!0,characterDataOldValue:!0,subtree:!0},n)),i},off:function(e,t,n){var i=!!(3<arguments.length&&arguments[3]!==void 0)&&arguments[3];return e.removeEventListener(t,n,i)},offset:function(e,t){return o(e.slice(t)).concat(o(e.slice(0,t)))},omit:function(e,t){return Object.keys(e).filter(function(e){return!t.includes(e)}).reduce(function(t,n){return t[n]=e[n],t},{})},omitBy:function(e,t){return Object.keys(e).filter(function(n){return!t(e[n],n)}).reduce(function(t,n){return t[n]=e[n],t},{})},on:function(e,t,n){var i=3<arguments.length&&void 0!==arguments[3]?arguments[3]:{},r=function(t){return t.target.matches(i.target)&&n.call(t.target,t)};if(e.addEventListener(t,i.target?r:n,i.options||!1),i.target)return r},onUserInputChange:function(e){var t='mouse',n=0,i=function i(){var r=performance.now();20>r-n&&(t='mouse',e(t),document.removeEventListener('mousemove',i)),n=r};document.addEventListener('touchstart',function(){'touch'==t||(t='touch',e(t),document.addEventListener('mousemove',i))})},once:function(e){var t=!1;return function(){if(!t){t=!0;for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(this,i)}}},orderBy:function(e,t,n){return o(e).sort(function(e,a){return t.reduce(function(t,l,o){if(0===t){var i=n&&'desc'===n[o]?[a[l],e[l]]:[e[l],a[l]],c=r(i,2),s=c[0],d=c[1];t=s>d?1:s<d?-1:0}return t},0)})},over:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return function(){for(var e=arguments.length,n=Array(e),i=0;i<e;i++)n[i]=arguments[i];return t.map(function(e){return e.apply(null,n)})}},overArgs:function(e,t){return function(){for(var n=arguments.length,i=Array(n),r=0;r<n;r++)i[r]=arguments[r];return e.apply(void 0,o(i.map(function(e,n){return t[n](e)})))}},pad:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:' ';return e.padStart((e.length+t)/2,n).padEnd(t,n)},palindrome:function(e){var t=e.toLowerCase().replace(/[\W_]/g,'');return t===o(t).reverse().join('')},parseCookie:function(e){return e.split(';').map(function(e){return e.split('=')}).reduce(function(e,t){return e[decodeURIComponent(t[0].trim())]=decodeURIComponent(t[1].trim()),e},{})},partial:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return function(){for(var t=arguments.length,i=Array(t),r=0;r<t;r++)i[r]=arguments[r];return e.apply(void 0,n.concat(i))}},partialRight:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return function(){for(var t=arguments.length,i=Array(t),r=0;r<t;r++)i[r]=arguments[r];return e.apply(void 0,i.concat(n))}},partition:function(e,t){return e.reduce(function(e,n,r,i){return e[t(n,r,i)?0:1].push(n),e},[[],[]])},percentile:function(e,t){return 100*e.reduce(function(e,n){return e+(n<t?1:0)+(n===t?.5:0)},0)/e.length},permutations:function e(t){return 2>=t.length?2===t.length?[t,[t[1],t[0]]]:t:t.reduce(function(n,r,a){return n.concat(e(o(t.slice(0,a)).concat(o(t.slice(a+1)))).map(function(e){return[r].concat(o(e))}))},[])},pick:function(e,t){return t.reduce(function(t,n){return n in e&&(t[n]=e[n]),t},{})},pickBy:function(e,t){return Object.keys(e).filter(function(n){return t(e[n],n)}).reduce(function(t,n){return t[n]=e[n],t},{})},pipeAsyncFunctions:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return function(e){return t.reduce(function(e,t){return e.then(t)},Promise.resolve(e))}},pipeFunctions:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce(function(e,t){return function(){return t(e.apply(void 0,arguments))}})},pluralize:N,powerset:function(e){return e.reduce(function(e,t){return e.concat(e.map(function(e){return[t].concat(e)}))},[[]])},prefix:function(e){var t=e.charAt(0).toUpperCase()+e.slice(1),n=['','webkit','moz','ms','o'],r=n.findIndex(function(n){return'undefined'!=typeof document.body.style[n?n+t:e]});return-1===r?null:0===r?e:n[r]+t},prettyBytes:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:3,i=!(2<arguments.length&&arguments[2]!==void 0)||arguments[2],r=['B','KB','MB','GB','TB','PB','EB','ZB','YB'];if(1>v(e))return e+(i?' ':'')+r[0];var a=m(y(Math.log10(0>e?-e:e)/3),r.length-1),l=+((0>e?-e:e)/g(1e3,a)).toPrecision(t);return(0>e?'-':'')+l+(i?' ':'')+r[a]},primes:function(e){var t=Array.from({length:e-1}).map(function(e,t){return t+2}),n=y(h(e)),i=Array.from({length:n-1}).map(function(e,t){return t+2});return i.forEach(function(e){return t=t.filter(function(t){return 0!=t%e||t===e})}),t},promisify:function(e){return function(){for(var t=arguments.length,n=Array(t),i=0;i<t;i++)n[i]=arguments[i];return new Promise(function(t,i){return e.apply(void 0,n.concat([function(e,n){return e?i(e):t(n)}]))})}},pull:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];var r=Array.isArray(n[0])?n[0]:n,a=e.filter(function(e){return!r.includes(e)});e.length=0,a.forEach(function(t){return e.push(t)})},pullAtIndex:function(e,t){var n=[],i=e.map(function(e,r){return t.includes(r)?n.push(e):e}).filter(function(e,n){return!t.includes(n)});return e.length=0,i.forEach(function(t){return e.push(t)}),n},pullAtValue:function(e,t){var n=[],i=e.forEach(function(e){return t.includes(e)?n.push(e):e}),r=e.filter(function(e){return!t.includes(e)});return e.length=0,r.forEach(function(t){return e.push(t)}),n},pullBy:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];var r=n.length,a=1<r?n[r-1]:void 0;a='function'==typeof a?(n.pop(),a):void 0;var l=(Array.isArray(n[0])?n[0]:n).map(function(e){return a(e)}),o=e.filter(function(e){return!l.includes(a(e))});e.length=0,o.forEach(function(t){return e.push(t)})},radsToDegrees:function(e){return 180*e/u},randomHexColorCode:function(){var e=(1e6*(1048575*Math.random())).toString(16);return'#'+e.slice(0,6)},randomIntArrayInRange:function(e,t){var i=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array.from({length:i},function(){return y(Math.random()*(t-e+1))+e})},randomIntegerInRange:function(e,t){return y(Math.random()*(t-e+1))+e},randomNumberInRange:function(e,t){return Math.random()*(t-e)+e},readFileLines:function(e){return j.readFileSync(e).toString('UTF8').split('\n')},rearg:function(e,t){return function(){for(var n=arguments.length,r=Array(n),i=0;i<n;i++)r[i]=arguments[i];return e.apply(void 0,o(t.map(function(e){return r[e]})))}},recordAnimationFrames:function(e){var t,n=!(1<arguments.length&&void 0!==arguments[1])||arguments[1],i=!0,r=function(){i=!1,cancelAnimationFrame(t)},a=function(){i=!0,l()},l=function n(){t=requestAnimationFrame(function(){e(),i&&n()})};return n&&a(),{start:a,stop:r}},redirect:function(e){var t=!(1<arguments.length&&arguments[1]!==void 0)||arguments[1];return t?window.location.href=e:window.location.replace(e)},reduceSuccessive:function(e,t,n){return e.reduce(function(e,n,r,i){return e.push(t(e.slice(-1)[0],n,r,i)),e},[n])},reduceWhich:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:function(e,t){return e-t};return e.reduce(function(e,n){return 0<=t(e,n)?n:e})},reducedFilter:function(e,t,n){return e.filter(n).map(function(e){return t.reduce(function(t,n){return t[n]=e[n],t},{})})},reject:function(e,t){return t.filter(function(){return!e.apply(void 0,arguments)})},remove:function(e,t){return Array.isArray(e)?e.filter(t).reduce(function(t,n){return e.splice(e.indexOf(n),1),t.concat(n)},[]):[]},removeNonASCII:function(e){return e.replace(/[^\x20-\x7E]/g,'')},renameKeys:function(e,i){return Object.keys(i).reduce(function(r,a){return n({},r,t({},e[a]||a,i[a]))},{})},reverseString:function(e){return o(e).reverse().join('')},round:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0;return+''.concat(_(''.concat(e,'e').concat(t)),'e-').concat(t)},runAsync:function(e){var t=new Worker(URL.createObjectURL(new Blob(['postMessage(('.concat(e,')());')]),{type:'application/javascript; charset=utf-8'}));return new Promise(function(e,n){t.onmessage=function(n){var i=n.data;e(i),t.terminate()},t.onerror=function(e){n(e),t.terminate()}})},runPromisesInSeries:function(e){return e.reduce(function(e,t){return e.then(t)},Promise.resolve())},sample:function(e){return e[y(Math.random()*e.length)]},sampleSize:function(e){for(var t=l(e),r=t.slice(0),a=1<arguments.length&&void 0!==arguments[1]?arguments[1]:1,n=r.length;n;){var o=y(Math.random()*n--),i=[r[o],r[n]];r[n]=i[0],r[o]=i[1]}return r.slice(0,a)},scrollToTop:function e(){var t=document.documentElement.scrollTop||document.body.scrollTop;0<t&&(window.requestAnimationFrame(e),window.scrollTo(0,t-t/8))},sdbm:function(e){var t=e.split('');return t.reduce(function(e,t){return e=t.charCodeAt(0)+(e<<6)+(e<<16)-e},0)},serializeCookie:function(e,t){return''.concat(encodeURIComponent(e),'=').concat(encodeURIComponent(t))},setStyle:function(e,t,n){return e.style[t]=n},shallowClone:function(e){return Object.assign({},e)},shank:function(e){for(var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:0,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:0,i=arguments.length,r=Array(3<i?i-3:0),a=3;a<i;a++)r[a-3]=arguments[a];return e.slice(0,t).concat(r).concat(e.slice(t+n))},show:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.concat().forEach(function(t){return t.style.display=''})},shuffle:function(e){for(var t=l(e),n=t.slice(0),r=n.length;r;){var a=y(Math.random()*r--),i=[n[a],n[r]];n[r]=i[0],n[a]=i[1]}return n},similarity:function(e,t){return e.filter(function(e){return t.includes(e)})},size:z,sleep:function(e){return new Promise(function(t){return setTimeout(t,e)})},smoothScroll:function(e){return document.querySelector(e).scrollIntoView({behavior:'smooth'})},sortCharactersInString:function(e){return o(e).sort(function(e,t){return e.localeCompare(t)}).join('')},sortedIndex:function(e,t){var n=e[0]>e[e.length-1],i=e.findIndex(function(e){return n?t>=e:t<=e});return-1===i?e.length:i},sortedIndexBy:function(e,t,n){var i=n(e[0])>n(e[e.length-1]),r=n(t),a=e.findIndex(function(e){return i?r>=n(e):r<=n(e)});return-1===a?e.length:a},sortedLastIndex:function(e,t){var n=e[0]>e[e.length-1],i=e.reverse().findIndex(function(e){return n?t<=e:t>=e});return-1===i?0:e.length-i},sortedLastIndexBy:function(e,t,n){var i=n(e[0])>n(e[e.length-1]),r=n(t),a=e.map(n).reverse().findIndex(function(e){return i?r<=e:r>=e});return-1===a?0:e.length-a},splitLines:function(e){return e.split(/\r?\n/)},spreadOver:function(e){return function(t){return e.apply(void 0,o(t))}},stableSort:function(e,t){return e.map(function(e,t){return{item:e,index:t}}).sort(function(e,n){return t(e.item,n.item)||e.index-n.index}).map(function(e){var t=e.item;return t})},standardDeviation:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1],n=e.reduce(function(e,t){return e+t},0)/e.length;return h(e.reduce(function(e,t){return e.concat(g(t-n,2))},[]).reduce(function(e,t){return e+t},0)/(e.length-(t?0:1)))},stringPermutations:function e(t){return 2>=t.length?2===t.length?[t,t[1]+t[0]]:[t]:t.split('').reduce(function(n,r,a){return n.concat(e(t.slice(0,a)+t.slice(a+1)).map(function(e){return r+e}))},[])},stripHTMLTags:function(e){return e.replace(/<[^>]*>/g,'')},sum:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.concat().reduce(function(e,t){return e+t},0)},sumBy:function(e,t){return e.map('function'==typeof t?t:function(e){return e[t]}).reduce(function(e,t){return e+t},0)},sumPower:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:2,n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:1;return Array(e+1-n).fill(0).map(function(e,r){return g(r+n,t)}).reduce(function(e,t){return e+t},0)},symmetricDifference:function(e,t){var n=new Set(e),i=new Set(t);return o(e.filter(function(e){return!i.has(e)})).concat(o(t.filter(function(e){return!n.has(e)})))},symmetricDifferenceBy:function(e,t,n){var i=new Set(e.map(function(e){return n(e)})),r=new Set(t.map(function(e){return n(e)}));return o(e.filter(function(e){return!r.has(n(e))})).concat(o(t.filter(function(e){return!i.has(n(e))})))},symmetricDifferenceWith:function(e,t,n){return o(e.filter(function(e){return-1===t.findIndex(function(t){return n(e,t)})})).concat(o(t.filter(function(t){return-1===e.findIndex(function(e){return n(t,e)})})))},tail:function(e){return 1<e.length?e.slice(1):e},take:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(0,t)},takeRight:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return e.slice(e.length-t,e.length)},takeRightWhile:function(e,t){return e.reduceRight(function(e,n){return t(n)?e:[n].concat(o(e))},[])},takeWhile:function(e,t){var n=!0,a=!1,l=void 0;try{for(var o,c=e.entries()[Symbol.iterator]();!(n=(o=c.next()).done);n=!0){var s=r(o.value,2),d=s[0],i=s[1];if(t(i))return e.slice(0,d)}}catch(e){a=!0,l=e}finally{try{n||null==c.return||c.return()}finally{if(a)throw l}}return e},throttle:function(e,t){var n,i,r;return function(){var a=this,l=arguments;n?(clearTimeout(i),i=setTimeout(function(){Date.now()-r>=t&&(e.apply(a,l),r=Date.now())},k(t-(Date.now()-r),0))):(e.apply(a,l),r=Date.now(),n=!0)}},timeTaken:function(e){console.time('timeTaken');var t=e();return console.timeEnd('timeTaken'),t},times:function(e,t){for(var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:void 0,r=0;!1!==t.call(n,r)&&++r<e;);},toCamelCase:function(e){var t=e&&e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.slice(0,1).toUpperCase()+e.slice(1).toLowerCase()}).join('');return t.slice(0,1).toLowerCase()+t.slice(1)},toCurrency:function(e,t){var n=2<arguments.length&&arguments[2]!==void 0?arguments[2]:void 0;return Intl.NumberFormat(n,{style:'currency',currency:t}).format(e)},toDecimalMark:function(e){return e.toLocaleString('en-US')},toHash:function(e,t){return Array.prototype.reduce.call(e,function(e,n,i){return e[t?n[t]:i]=n,e},{})},toKebabCase:function(e){return e&&e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.toLowerCase()}).join('-')},toOrdinalSuffix:function(e){var t=parseInt(e),n=[t%10,t%100],i=['st','nd','rd','th'];return[1,2,3,4].includes(n[0])&&![11,12,13,14,15,16,17,18,19].includes(n[1])?t+i[n[0]-1]:t+i[3]},toSafeInteger:function(e){return _(k(m(e,Number.MAX_SAFE_INTEGER),Number.MIN_SAFE_INTEGER))},toSnakeCase:function(e){return e&&e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.toLowerCase()}).join('_')},toTitleCase:function(e){return e.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g).map(function(e){return e.charAt(0).toUpperCase()+e.slice(1)}).join(' ')},toggleClass:function(e,t){return e.classList.toggle(t)},tomorrow:function(){var e=!!(0<arguments.length&&arguments[0]!==void 0)&&arguments[0],n=new Date;n.setDate(n.getDate()+1);var t=''.concat(n.getFullYear(),'-').concat((n.getMonth()+1+'').padStart(2,'0'),'-').concat((n.getDate()+'').padStart(2,'0'));return e?''.concat(t,'T00:00:00'):t},transform:function(e,t,n){return Object.keys(e).reduce(function(n,i){return t(n,e[i],i,e)},n)},triggerEvent:function(e,t,n){return e.dispatchEvent(new CustomEvent(t,{detail:n}))},truncateString:function(e,t){return e.length>t?e.slice(0,3<t?t-3:t)+'...':e},truthCheckCollection:function(e,t){return e.every(function(e){return e[t]})},unary:function(e){return function(t){return e(t)}},uncurry:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:1;return function(){for(var n=function(e){return function(t){return t.reduce(function(e,t){return e(t)},e)}},i=arguments.length,r=Array(i),a=0;a<i;a++)r[a]=arguments[a];if(t>r.length)throw new RangeError('Arguments too few!');return n(e)(r.slice(0,t))}},unescapeHTML:function(e){return e.replace(/&amp;|&lt;|&gt;|&#39;|&quot;/g,function(e){return{"&amp;":'&',"&lt;":'<',"&gt;":'>',"&#39;":'\'',"&quot;":'"'}[e]||e})},unflattenObject:function(e){return Object.keys(e).reduce(function(t,n){if(-1!==n.indexOf('.')){var r=n.split('.');Object.assign(t,JSON.parse('{'+r.map(function(e,t){return t===r.length-1?'"'.concat(e,'":'):'"'.concat(e,'":{')}).join('')+e[n]+'}'.repeat(r.length)))}else t[n]=e[n];return t},{})},unfold:function(e,t){for(var n=[],i=[null,t];i=e(i[1]);)n.push(i[0]);return n},union:function(e,t){return Array.from(new Set(o(e).concat(o(t))))},unionBy:function(e,t,n){var i=new Set(e.map(n));return Array.from(new Set(o(e).concat(o(t.filter(function(e){return!i.has(n(e))})))))},unionWith:function(e,t,n){return Array.from(new Set(o(e).concat(o(t.filter(function(t){return-1===e.findIndex(function(e){return n(t,e)})})))))},uniqueElements:function(e){return o(new Set(e))},uniqueElementsBy:function(e,t){return e.reduce(function(e,n){return e.some(function(e){return t(n,e)})||e.push(n),e},[])},uniqueElementsByRight:function(e,t){return e.reduceRight(function(e,n){return e.some(function(e){return t(n,e)})||e.push(n),e},[])},uniqueSymmetricDifference:function(e,t){return o(new Set(o(e.filter(function(e){return!t.includes(e)})).concat(o(t.filter(function(t){return!e.includes(t)})))))},untildify:function(e){return e.replace(/^~($|\/|\\)/,''.concat(require('os').homedir(),'$1'))},unzip:function(e){return e.reduce(function(e,t){return t.forEach(function(t,n){return e[n].push(t)}),e},Array.from({length:k.apply(Math,o(e.map(function(e){return e.length})))}).map(function(){return[]}))},unzipWith:function(e,t){return e.reduce(function(e,t){return t.forEach(function(t,n){return e[n].push(t)}),e},Array.from({length:k.apply(Math,o(e.map(function(e){return e.length})))}).map(function(){return[]})).map(function(e){return t.apply(void 0,o(e))})},validateNumber:function(e){return!isNaN(parseFloat(e))&&isFinite(e)&&+e==e},when:function(e,t){return function(n){return e(n)?t(n):n}},without:function(e){for(var t=arguments.length,n=Array(1<t?t-1:0),i=1;i<t;i++)n[i-1]=arguments[i];return e.filter(function(e){return!n.includes(e)})},words:function(e){var t=1<arguments.length&&arguments[1]!==void 0?arguments[1]:/[^a-zA-Z-]+/;return e.split(t).filter(Boolean)},xProd:function(e,t){return e.reduce(function(e,n){return e.concat(t.map(function(e){return[n,e]}))},[])},yesNo:function(e){var t=!!(1<arguments.length&&arguments[1]!==void 0)&&arguments[1];return!!/^(y|yes)$/i.test(e)||!/^(n|no)$/i.test(e)&&t},zip:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];var i=k.apply(Math,o(t.map(function(e){return e.length})));return Array.from({length:i}).map(function(e,n){return Array.from({length:t.length},function(e,i){return t[i][n]})})},zipObject:function(e,t){return e.reduce(function(e,n,i){return e[n]=t[i],e},{})},zipWith:function(){for(var e=arguments.length,t=Array(e),n=0;n<e;n++)t[n]=arguments[n];var r='function'==typeof t[t.length-1]?t.pop():void 0;return Array.from({length:k.apply(Math,o(t.map(function(e){return e.length})))},function(e,n){return r?r.apply(void 0,o(t.map(function(e){return e[n]}))):t.map(function(e){return e[n]})})}}});
diff --git a/dist/_30s.esm.js b/dist/_30s.esm.js
index 9494e9f61..6ce94767f 100644
--- a/dist/_30s.esm.js
+++ b/dist/_30s.esm.js
@@ -642,8 +642,7 @@ const lcm = (...arr) => {
   const _lcm = (x, y) => (x * y) / gcd(x, y);
   return [...arr].reduce((a, b) => _lcm(a, b));
 };
-const longestItem = (val, ...vals) =>
-  [val, ...vals].reduce((a, x) => (x.length > a.length ? x : a));
+const longestItem = (...vals) => vals.reduce((a, x) => (x.length > a.length ? x : a));
 const lowercaseKeys = obj =>
   Object.keys(obj).reduce((acc, key) => {
     acc[key.toLowerCase()] = obj[key];
@@ -1204,6 +1203,11 @@ const toSnakeCase = str =>
     .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
     .map(x => x.toLowerCase())
     .join('_');
+const toTitleCase = 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(x => x.charAt(0).toUpperCase() + x.slice(1))
+    .join(' ');
 const toggleClass = (el, className) => el.classList.toggle(className);
 const tomorrow = (long = false) => {
   let t = new Date();
@@ -1321,4 +1325,4 @@ const zipWith = (...array) => {
 };
 
 
-module.exports = {CSVToArray,CSVToJSON,JSONToFile,JSONtoCSV,RGBToHex,URLJoin,UUIDGeneratorBrowser,UUIDGeneratorNode,all,allEqual,any,approximatelyEqual,arrayToCSV,arrayToHtmlList,ary,atob,attempt,average,averageBy,bifurcate,bifurcateBy,bind,bindAll,bindKey,binomialCoefficient,bottomVisible,btoa,byteSize,call,capitalize,capitalizeEveryWord,castArray,chainAsync,chunk,clampNumber,cloneRegExp,coalesce,coalesceFactory,collectInto,colorize,compact,compose,composeRight,converge,copyToClipboard,countBy,countOccurrences,counter,createElement,createEventHub,currentURL,curry,dayOfYear,debounce,decapitalize,deepClone,deepFlatten,deepFreeze,defaults,defer,degreesToRads,delay,detectDeviceType,difference,differenceBy,differenceWith,dig,digitize,distance,drop,dropRight,dropRightWhile,dropWhile,elementContains,elementIsVisibleInViewport,elo,equals,escapeHTML,escapeRegExp,everyNth,extendHex,factorial,fibonacci,filterNonUnique,filterNonUniqueBy,findKey,findLast,findLastIndex,findLastKey,flatten,flattenObject,flip,forEachRight,forOwn,forOwnRight,formatDuration,fromCamelCase,functionName,functions,gcd,geometricProgression,get,getColonTimeFromDate,getDaysDiffBetweenDates,getImages,getMeridiemSuffixOfInteger,getScrollPosition,getStyle,getType,getURLParameters,groupBy,hammingDistance,hasClass,hasFlags,hashBrowser,hashNode,head,hexToRGB,hide,httpGet,httpPost,httpsRedirect,hz,inRange,indentString,indexOfAll,initial,initialize2DArray,initializeArrayWithRange,initializeArrayWithRangeRight,initializeArrayWithValues,initializeNDArray,insertAfter,insertBefore,intersection,intersectionBy,intersectionWith,invertKeyValues,is,isAbsoluteURL,isAfterDate,isAnagram,isArrayLike,isBeforeDate,isBoolean,isBrowser,isBrowserTabFocused,isDivisible,isDuplexStream,isEmpty,isEven,isFunction,isLowerCase,isNil,isNull,isNumber,isObject,isObjectLike,isPlainObject,isPrime,isPrimitive,isPromiseLike,isReadableStream,isSameDate,isSorted,isStream,isString,isSymbol,isTravisCI,isUndefined,isUpperCase,isValidJSON,isWritableStream,join,last,lcm,longestItem,lowercaseKeys,luhnCheck,mapKeys,mapObject,mapString,mapValues,mask,matches,matchesWith,maxBy,maxDate,maxN,median,memoize,merge,minBy,minDate,minN,mostPerformant,negate,nest,nodeListToArray,none,nthArg,nthElement,objectFromPairs,objectToPairs,observeMutations,off,offset,omit,omitBy,on,onUserInputChange,once,orderBy,over,overArgs,pad,palindrome,parseCookie,partial,partialRight,partition,percentile,permutations,pick,pickBy,pipeAsyncFunctions,pipeFunctions,pluralize,powerset,prefix,prettyBytes,primes,promisify,pull,pullAtIndex,pullAtValue,pullBy,radsToDegrees,randomHexColorCode,randomIntArrayInRange,randomIntegerInRange,randomNumberInRange,readFileLines,rearg,recordAnimationFrames,redirect,reduceSuccessive,reduceWhich,reducedFilter,reject,remove,removeNonASCII,renameKeys,reverseString,round,runAsync,runPromisesInSeries,sample,sampleSize,scrollToTop,sdbm,serializeCookie,setStyle,shallowClone,shank,show,shuffle,similarity,size,sleep,smoothScroll,sortCharactersInString,sortedIndex,sortedIndexBy,sortedLastIndex,sortedLastIndexBy,splitLines,spreadOver,stableSort,standardDeviation,stringPermutations,stripHTMLTags,sum,sumBy,sumPower,symmetricDifference,symmetricDifferenceBy,symmetricDifferenceWith,tail,take,takeRight,takeRightWhile,takeWhile,throttle,timeTaken,times,toCamelCase,toCurrency,toDecimalMark,toHash,toKebabCase,toOrdinalSuffix,toSafeInteger,toSnakeCase,toggleClass,tomorrow,transform,triggerEvent,truncateString,truthCheckCollection,unary,uncurry,unescapeHTML,unflattenObject,unfold,union,unionBy,unionWith,uniqueElements,uniqueElementsBy,uniqueElementsByRight,uniqueSymmetricDifference,untildify,unzip,unzipWith,validateNumber,when,without,words,xProd,yesNo,zip,zipObject,zipWith};
+module.exports = {CSVToArray,CSVToJSON,JSONToFile,JSONtoCSV,RGBToHex,URLJoin,UUIDGeneratorBrowser,UUIDGeneratorNode,all,allEqual,any,approximatelyEqual,arrayToCSV,arrayToHtmlList,ary,atob,attempt,average,averageBy,bifurcate,bifurcateBy,bind,bindAll,bindKey,binomialCoefficient,bottomVisible,btoa,byteSize,call,capitalize,capitalizeEveryWord,castArray,chainAsync,chunk,clampNumber,cloneRegExp,coalesce,coalesceFactory,collectInto,colorize,compact,compose,composeRight,converge,copyToClipboard,countBy,countOccurrences,counter,createElement,createEventHub,currentURL,curry,dayOfYear,debounce,decapitalize,deepClone,deepFlatten,deepFreeze,defaults,defer,degreesToRads,delay,detectDeviceType,difference,differenceBy,differenceWith,dig,digitize,distance,drop,dropRight,dropRightWhile,dropWhile,elementContains,elementIsVisibleInViewport,elo,equals,escapeHTML,escapeRegExp,everyNth,extendHex,factorial,fibonacci,filterNonUnique,filterNonUniqueBy,findKey,findLast,findLastIndex,findLastKey,flatten,flattenObject,flip,forEachRight,forOwn,forOwnRight,formatDuration,fromCamelCase,functionName,functions,gcd,geometricProgression,get,getColonTimeFromDate,getDaysDiffBetweenDates,getImages,getMeridiemSuffixOfInteger,getScrollPosition,getStyle,getType,getURLParameters,groupBy,hammingDistance,hasClass,hasFlags,hashBrowser,hashNode,head,hexToRGB,hide,httpGet,httpPost,httpsRedirect,hz,inRange,indentString,indexOfAll,initial,initialize2DArray,initializeArrayWithRange,initializeArrayWithRangeRight,initializeArrayWithValues,initializeNDArray,insertAfter,insertBefore,intersection,intersectionBy,intersectionWith,invertKeyValues,is,isAbsoluteURL,isAfterDate,isAnagram,isArrayLike,isBeforeDate,isBoolean,isBrowser,isBrowserTabFocused,isDivisible,isDuplexStream,isEmpty,isEven,isFunction,isLowerCase,isNil,isNull,isNumber,isObject,isObjectLike,isPlainObject,isPrime,isPrimitive,isPromiseLike,isReadableStream,isSameDate,isSorted,isStream,isString,isSymbol,isTravisCI,isUndefined,isUpperCase,isValidJSON,isWritableStream,join,last,lcm,longestItem,lowercaseKeys,luhnCheck,mapKeys,mapObject,mapString,mapValues,mask,matches,matchesWith,maxBy,maxDate,maxN,median,memoize,merge,minBy,minDate,minN,mostPerformant,negate,nest,nodeListToArray,none,nthArg,nthElement,objectFromPairs,objectToPairs,observeMutations,off,offset,omit,omitBy,on,onUserInputChange,once,orderBy,over,overArgs,pad,palindrome,parseCookie,partial,partialRight,partition,percentile,permutations,pick,pickBy,pipeAsyncFunctions,pipeFunctions,pluralize,powerset,prefix,prettyBytes,primes,promisify,pull,pullAtIndex,pullAtValue,pullBy,radsToDegrees,randomHexColorCode,randomIntArrayInRange,randomIntegerInRange,randomNumberInRange,readFileLines,rearg,recordAnimationFrames,redirect,reduceSuccessive,reduceWhich,reducedFilter,reject,remove,removeNonASCII,renameKeys,reverseString,round,runAsync,runPromisesInSeries,sample,sampleSize,scrollToTop,sdbm,serializeCookie,setStyle,shallowClone,shank,show,shuffle,similarity,size,sleep,smoothScroll,sortCharactersInString,sortedIndex,sortedIndexBy,sortedLastIndex,sortedLastIndexBy,splitLines,spreadOver,stableSort,standardDeviation,stringPermutations,stripHTMLTags,sum,sumBy,sumPower,symmetricDifference,symmetricDifferenceBy,symmetricDifferenceWith,tail,take,takeRight,takeRightWhile,takeWhile,throttle,timeTaken,times,toCamelCase,toCurrency,toDecimalMark,toHash,toKebabCase,toOrdinalSuffix,toSafeInteger,toSnakeCase,toTitleCase,toggleClass,tomorrow,transform,triggerEvent,truncateString,truthCheckCollection,unary,uncurry,unescapeHTML,unflattenObject,unfold,union,unionBy,unionWith,uniqueElements,uniqueElementsBy,uniqueElementsByRight,uniqueSymmetricDifference,untildify,unzip,unzipWith,validateNumber,when,without,words,xProd,yesNo,zip,zipObject,zipWith};
diff --git a/dist/_30s.js b/dist/_30s.js
index 7e060f1c0..43f261b68 100644
--- a/dist/_30s.js
+++ b/dist/_30s.js
@@ -648,8 +648,7 @@
     const _lcm = (x, y) => (x * y) / gcd(x, y);
     return [...arr].reduce((a, b) => _lcm(a, b));
   };
-  const longestItem = (val, ...vals) =>
-    [val, ...vals].reduce((a, x) => (x.length > a.length ? x : a));
+  const longestItem = (...vals) => vals.reduce((a, x) => (x.length > a.length ? x : a));
   const lowercaseKeys = obj =>
     Object.keys(obj).reduce((acc, key) => {
       acc[key.toLowerCase()] = obj[key];
@@ -1210,6 +1209,11 @@
       .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
       .map(x => x.toLowerCase())
       .join('_');
+  const toTitleCase = 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(x => x.charAt(0).toUpperCase() + x.slice(1))
+      .join(' ');
   const toggleClass = (el, className) => el.classList.toggle(className);
   const tomorrow = (long = false) => {
     let t = new Date();
@@ -1327,6 +1331,6 @@
   };
 
 
-  module.exports = {CSVToArray,CSVToJSON,JSONToFile,JSONtoCSV,RGBToHex,URLJoin,UUIDGeneratorBrowser,UUIDGeneratorNode,all,allEqual,any,approximatelyEqual,arrayToCSV,arrayToHtmlList,ary,atob,attempt,average,averageBy,bifurcate,bifurcateBy,bind,bindAll,bindKey,binomialCoefficient,bottomVisible,btoa,byteSize,call,capitalize,capitalizeEveryWord,castArray,chainAsync,chunk,clampNumber,cloneRegExp,coalesce,coalesceFactory,collectInto,colorize,compact,compose,composeRight,converge,copyToClipboard,countBy,countOccurrences,counter,createElement,createEventHub,currentURL,curry,dayOfYear,debounce,decapitalize,deepClone,deepFlatten,deepFreeze,defaults,defer,degreesToRads,delay,detectDeviceType,difference,differenceBy,differenceWith,dig,digitize,distance,drop,dropRight,dropRightWhile,dropWhile,elementContains,elementIsVisibleInViewport,elo,equals,escapeHTML,escapeRegExp,everyNth,extendHex,factorial,fibonacci,filterNonUnique,filterNonUniqueBy,findKey,findLast,findLastIndex,findLastKey,flatten,flattenObject,flip,forEachRight,forOwn,forOwnRight,formatDuration,fromCamelCase,functionName,functions,gcd,geometricProgression,get,getColonTimeFromDate,getDaysDiffBetweenDates,getImages,getMeridiemSuffixOfInteger,getScrollPosition,getStyle,getType,getURLParameters,groupBy,hammingDistance,hasClass,hasFlags,hashBrowser,hashNode,head,hexToRGB,hide,httpGet,httpPost,httpsRedirect,hz,inRange,indentString,indexOfAll,initial,initialize2DArray,initializeArrayWithRange,initializeArrayWithRangeRight,initializeArrayWithValues,initializeNDArray,insertAfter,insertBefore,intersection,intersectionBy,intersectionWith,invertKeyValues,is,isAbsoluteURL,isAfterDate,isAnagram,isArrayLike,isBeforeDate,isBoolean,isBrowser,isBrowserTabFocused,isDivisible,isDuplexStream,isEmpty,isEven,isFunction,isLowerCase,isNil,isNull,isNumber,isObject,isObjectLike,isPlainObject,isPrime,isPrimitive,isPromiseLike,isReadableStream,isSameDate,isSorted,isStream,isString,isSymbol,isTravisCI,isUndefined,isUpperCase,isValidJSON,isWritableStream,join,last,lcm,longestItem,lowercaseKeys,luhnCheck,mapKeys,mapObject,mapString,mapValues,mask,matches,matchesWith,maxBy,maxDate,maxN,median,memoize,merge,minBy,minDate,minN,mostPerformant,negate,nest,nodeListToArray,none,nthArg,nthElement,objectFromPairs,objectToPairs,observeMutations,off,offset,omit,omitBy,on,onUserInputChange,once,orderBy,over,overArgs,pad,palindrome,parseCookie,partial,partialRight,partition,percentile,permutations,pick,pickBy,pipeAsyncFunctions,pipeFunctions,pluralize,powerset,prefix,prettyBytes,primes,promisify,pull,pullAtIndex,pullAtValue,pullBy,radsToDegrees,randomHexColorCode,randomIntArrayInRange,randomIntegerInRange,randomNumberInRange,readFileLines,rearg,recordAnimationFrames,redirect,reduceSuccessive,reduceWhich,reducedFilter,reject,remove,removeNonASCII,renameKeys,reverseString,round,runAsync,runPromisesInSeries,sample,sampleSize,scrollToTop,sdbm,serializeCookie,setStyle,shallowClone,shank,show,shuffle,similarity,size,sleep,smoothScroll,sortCharactersInString,sortedIndex,sortedIndexBy,sortedLastIndex,sortedLastIndexBy,splitLines,spreadOver,stableSort,standardDeviation,stringPermutations,stripHTMLTags,sum,sumBy,sumPower,symmetricDifference,symmetricDifferenceBy,symmetricDifferenceWith,tail,take,takeRight,takeRightWhile,takeWhile,throttle,timeTaken,times,toCamelCase,toCurrency,toDecimalMark,toHash,toKebabCase,toOrdinalSuffix,toSafeInteger,toSnakeCase,toggleClass,tomorrow,transform,triggerEvent,truncateString,truthCheckCollection,unary,uncurry,unescapeHTML,unflattenObject,unfold,union,unionBy,unionWith,uniqueElements,uniqueElementsBy,uniqueElementsByRight,uniqueSymmetricDifference,untildify,unzip,unzipWith,validateNumber,when,without,words,xProd,yesNo,zip,zipObject,zipWith};
+  module.exports = {CSVToArray,CSVToJSON,JSONToFile,JSONtoCSV,RGBToHex,URLJoin,UUIDGeneratorBrowser,UUIDGeneratorNode,all,allEqual,any,approximatelyEqual,arrayToCSV,arrayToHtmlList,ary,atob,attempt,average,averageBy,bifurcate,bifurcateBy,bind,bindAll,bindKey,binomialCoefficient,bottomVisible,btoa,byteSize,call,capitalize,capitalizeEveryWord,castArray,chainAsync,chunk,clampNumber,cloneRegExp,coalesce,coalesceFactory,collectInto,colorize,compact,compose,composeRight,converge,copyToClipboard,countBy,countOccurrences,counter,createElement,createEventHub,currentURL,curry,dayOfYear,debounce,decapitalize,deepClone,deepFlatten,deepFreeze,defaults,defer,degreesToRads,delay,detectDeviceType,difference,differenceBy,differenceWith,dig,digitize,distance,drop,dropRight,dropRightWhile,dropWhile,elementContains,elementIsVisibleInViewport,elo,equals,escapeHTML,escapeRegExp,everyNth,extendHex,factorial,fibonacci,filterNonUnique,filterNonUniqueBy,findKey,findLast,findLastIndex,findLastKey,flatten,flattenObject,flip,forEachRight,forOwn,forOwnRight,formatDuration,fromCamelCase,functionName,functions,gcd,geometricProgression,get,getColonTimeFromDate,getDaysDiffBetweenDates,getImages,getMeridiemSuffixOfInteger,getScrollPosition,getStyle,getType,getURLParameters,groupBy,hammingDistance,hasClass,hasFlags,hashBrowser,hashNode,head,hexToRGB,hide,httpGet,httpPost,httpsRedirect,hz,inRange,indentString,indexOfAll,initial,initialize2DArray,initializeArrayWithRange,initializeArrayWithRangeRight,initializeArrayWithValues,initializeNDArray,insertAfter,insertBefore,intersection,intersectionBy,intersectionWith,invertKeyValues,is,isAbsoluteURL,isAfterDate,isAnagram,isArrayLike,isBeforeDate,isBoolean,isBrowser,isBrowserTabFocused,isDivisible,isDuplexStream,isEmpty,isEven,isFunction,isLowerCase,isNil,isNull,isNumber,isObject,isObjectLike,isPlainObject,isPrime,isPrimitive,isPromiseLike,isReadableStream,isSameDate,isSorted,isStream,isString,isSymbol,isTravisCI,isUndefined,isUpperCase,isValidJSON,isWritableStream,join,last,lcm,longestItem,lowercaseKeys,luhnCheck,mapKeys,mapObject,mapString,mapValues,mask,matches,matchesWith,maxBy,maxDate,maxN,median,memoize,merge,minBy,minDate,minN,mostPerformant,negate,nest,nodeListToArray,none,nthArg,nthElement,objectFromPairs,objectToPairs,observeMutations,off,offset,omit,omitBy,on,onUserInputChange,once,orderBy,over,overArgs,pad,palindrome,parseCookie,partial,partialRight,partition,percentile,permutations,pick,pickBy,pipeAsyncFunctions,pipeFunctions,pluralize,powerset,prefix,prettyBytes,primes,promisify,pull,pullAtIndex,pullAtValue,pullBy,radsToDegrees,randomHexColorCode,randomIntArrayInRange,randomIntegerInRange,randomNumberInRange,readFileLines,rearg,recordAnimationFrames,redirect,reduceSuccessive,reduceWhich,reducedFilter,reject,remove,removeNonASCII,renameKeys,reverseString,round,runAsync,runPromisesInSeries,sample,sampleSize,scrollToTop,sdbm,serializeCookie,setStyle,shallowClone,shank,show,shuffle,similarity,size,sleep,smoothScroll,sortCharactersInString,sortedIndex,sortedIndexBy,sortedLastIndex,sortedLastIndexBy,splitLines,spreadOver,stableSort,standardDeviation,stringPermutations,stripHTMLTags,sum,sumBy,sumPower,symmetricDifference,symmetricDifferenceBy,symmetricDifferenceWith,tail,take,takeRight,takeRightWhile,takeWhile,throttle,timeTaken,times,toCamelCase,toCurrency,toDecimalMark,toHash,toKebabCase,toOrdinalSuffix,toSafeInteger,toSnakeCase,toTitleCase,toggleClass,tomorrow,transform,triggerEvent,truncateString,truthCheckCollection,unary,uncurry,unescapeHTML,unflattenObject,unfold,union,unionBy,unionWith,uniqueElements,uniqueElementsBy,uniqueElementsByRight,uniqueSymmetricDifference,untildify,unzip,unzipWith,validateNumber,when,without,words,xProd,yesNo,zip,zipObject,zipWith};
 
 })));
diff --git a/snippet_data/snippetList.json b/snippet_data/snippetList.json
index 1941e4704..3b3b38163 100644
--- a/snippet_data/snippetList.json
+++ b/snippet_data/snippetList.json
@@ -12,7 +12,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d9aec5efedaa39586f2b1210394b345cb1abbb9348fad952e785badbb2d598ac"
+        "hash": "2cf407f0e2df6eb320de1906d8cb4f1d252ac189af3a390dda264e8637a44e7e"
       }
     },
     {
@@ -27,7 +27,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "76704202f5987a78625746ef4f2ca5650a8d87b10252b06b60c5d39cd26a7335"
+        "hash": "690147b9d4d90d37d9f42ec6596decc3e99eb8104f51d27a392ee3b50041878e"
       }
     },
     {
@@ -42,7 +42,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b34cb378a31ae73335f941448fe873edf9c06e10d5a1e28895275a29dd471c39"
+        "hash": "b045bd03ea755493fcab7b7092b0fb01bf8ce24b56e5605ea2d0bb037b91f11e"
       }
     },
     {
@@ -56,7 +56,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2b68e79d3ebb806379c3b84ae70152e033297d6e4fd4bc779b10be81ca2fc0cf"
+        "hash": "4fa8b87ac30ec67afe40c80101a702986dd1e5cab3cd8b9653f1b7c8cbac7540"
       }
     },
     {
@@ -72,7 +72,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0ba7229cc896c4efeb982ea313166afa79aee16cbf337a643243a4f8c3a4bcd9"
+        "hash": "3508f9a15d8a0b0541d12373b8ea697773434fbfd946bb63fc4f0246e4f193ea"
       }
     },
     {
@@ -87,7 +87,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "027ae8128f3c52af07224b87baf362f0ad92e5a9847ebf426027ac3f06ab7deb"
+        "hash": "ca7374613a03d90327f8754747ec14e3234f5df975cb8744da6ead6d7d3d2a83"
       }
     },
     {
@@ -102,7 +102,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3822911df3a06d2a58df4f5f8733b72bb655a6b9c7c99a9ab85bf418abcf7de7"
+        "hash": "9c673d0dc5ea5d1b7c63506253c39e512127c377d349b2df1f847788e67bebf1"
       }
     },
     {
@@ -118,7 +118,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2b16386c3d31f0d68f1bd76034202f8927d0a126312cb20b310fc141c6e654f5"
+        "hash": "a1cdc6db4c91c17ea5f072fa38f40505a7500c1d142c33a9f7e8280fb9357fb5"
       }
     },
     {
@@ -132,7 +132,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "27131b8fc8afb7f3140b85981747c0dd6106b5a8bb54ccd43d542e4245f934de"
+        "hash": "ac8ac4dc2ac7d0e2de1cf9f6afff46350aa530a51275658e8b34072740d10b0f"
       }
     },
     {
@@ -147,7 +147,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5547ee57c7a19624435c01594130bfe6c1613b637fa0810aca6856e5bccda95a"
+        "hash": "1275c6ed1d6ac5e1218831c45cdff88de135f803f45cdbb68dbbad0fbb55e967"
       }
     },
     {
@@ -163,7 +163,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3896ad3ab0120ba12943877f33fdd1e48d7887f7c69bea7310517aac56020502"
+        "hash": "58c2e46ed0bf8dfb7c3d36c280dff4a64ff056fc1a01b0972db8c81733d8c5dc"
       }
     },
     {
@@ -177,7 +177,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b869b8c45f39e8f6cceb8478f2e4ae2248a46c6cc2c39d112868f8e235a6d936"
+        "hash": "5f32ce21c3b3ef31d3281c0700eaca0761742fda556be7002596020947fd37a5"
       }
     },
     {
@@ -192,7 +192,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b0a461c6da6f561d7a9fcb373adb622692480cc36650145d6d8f94e126f0f849"
+        "hash": "e09263bc0fa973e3e2435dfd61a764c0af080b73882f6c32b3534a5c4387fc43"
       }
     },
     {
@@ -207,7 +207,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d0bc023d8258b2cc336d66f27ec01986488ef2d8d2fd030491e47dae63900a6f"
+        "hash": "8ffda25a0268a6f772c6912d370248c9329561c1ce1ea941e0622136459f7ef5"
       }
     },
     {
@@ -222,7 +222,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1c10caabd13b779a41850342f76585848c645c36950d3f068f373a53f3ee1f6f"
+        "hash": "3a8deee8bdc80c3df541ee5a9c31591af4c451362c2d86344ae4c937a04b2d12"
       }
     },
     {
@@ -237,7 +237,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "12681c9545cf304d7b507938150f48a33d321e2b0338d965aadd3bf0165a5ae3"
+        "hash": "28b9b15af52a4abd2caaba94c5ceeea765ec89982122104cf5dc111c3f56383f"
       }
     },
     {
@@ -251,7 +251,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "66414040b3a4dfca8312e0c0d4b276ded342b18abd9a14a0a90cec2983bc0b7c"
+        "hash": "0fca1b134c1a13fef45cde62e8f04c70361b477be88222aa7d81ac5d153b3a13"
       }
     },
     {
@@ -265,7 +265,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d4e645f834e7eb763b85bc99289c983f9e1d4314257701c94cea84ac8806ca3d"
+        "hash": "a40dc0094d62d44e7d086513bca6afb74734dd1e5e56a0ce66e91517b459f50c"
       }
     },
     {
@@ -281,7 +281,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "24ca94284f2c3d83ed2ae5ea5c185b6dd84417ad7e0effb047c32847825d6550"
+        "hash": "021ec24497f79ba1e18b01f1fc5a7498d21adbb4f556ac026afa817f10d46ae9"
       }
     },
     {
@@ -295,7 +295,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8608c5658af598504bc2e20d329c674cd989540907598e372c75241179cff029"
+        "hash": "5a7936489c66b541e2e1caf4254540a75557e049d1a10c7da0b38bd3b247f00b"
       }
     },
     {
@@ -325,7 +325,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c1e2fa38cb32a0c6aeb5fdd61116095a2f131e0471d904cd0272892356a0b968"
+        "hash": "b9e5abf13f56d58cb8d7abe800d90956a6b4d1954ac81b08f671ce994319dff6"
       }
     },
     {
@@ -340,7 +340,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "060d09969ecbc08a609e546c9dd30c984d840f44fd55d2cc6d1d31263e4c8d56"
+        "hash": "4ebf63ac48859f5011de39740d2650f7929257c9d1d468d1789e45f6a33b577e"
       }
     },
     {
@@ -356,7 +356,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6fef4b839b04d3df22e1b9b34215f5d3a93edab0a7eb0b88dca291a427df04a0"
+        "hash": "a6add43aea896ec237dfada48cfe67edab4b111e290472da8ff2c0ece70f2320"
       }
     },
     {
@@ -370,7 +370,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8b6d33fba612cac3b4e97a42fc7bfaa5b52fc96a47d6e580528f6aeae789606d"
+        "hash": "8c245a7fc94edffaf5cae4c28f37ed2e989772a9663a5f5bce98147f708a712e"
       }
     },
     {
@@ -384,7 +384,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8bcbcf5500940d591c2d1497a04964ec04b35730833742353cfbd27a992fecd0"
+        "hash": "c9c64e0f8c0ec964e32434d873b28d0803a60737eceb19c67ab86edb3f352d48"
       }
     },
     {
@@ -398,7 +398,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a3eca18648e657fc0277f4b00d2a51cf7c4bf03eb695fc6ce9e4cad64e569490"
+        "hash": "8e63c143d08d73cae1038ca8c6622ddf728b661528b246b55d6eb3b1ae41fe76"
       }
     },
     {
@@ -413,7 +413,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ee8e6e19269907273e58f0820bdbfc57022b6673453283058aedbbfc76586658"
+        "hash": "57532d74214897181db46b09dc0be86d26e9877785ec85c3acd1113d5371fa95"
       }
     },
     {
@@ -427,7 +427,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "29199c10609ed7d5e3e5491d7d81622de9521c2b76d2d220141f3abb97d9ee07"
+        "hash": "3928d6f7c78cb72d1fe428be6bbdd5ee3ddcdb360b999d25048f84306e521918"
       }
     },
     {
@@ -441,7 +441,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "69da8c5511c6c85eec38605ad9560b021d6fc3794cb47ec963987b783f48ad2f"
+        "hash": "f6180d269df84f10e4642d5d52d442be990138b7114aef048f95eabd121c3738"
       }
     },
     {
@@ -473,7 +473,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4f42f00e7d675d21829a5fcd2ab2e3fa2058d1c1b1d6850ff28f2a424364593e"
+        "hash": "30fc60a8ab8c8005f7d31b82f4386ba17caa9fed690916581b2c18fa0a125215"
       }
     },
     {
@@ -487,7 +487,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8215bb36c367643c3e3f9db8af00d5d5067c95704f528864182a43d393faaef0"
+        "hash": "0f631b67b8460ed99917ff1468051e1e075ef02b280838ec14ad3fede2f48c7f"
       }
     },
     {
@@ -501,7 +501,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d7aa6d5f12cb3d1c2dce4b16f4f96196aa26706583c994282509703735a2ce64"
+        "hash": "6e9c4e34847a623fbf069fc1d64208178e9f992c7239bc80973512174a9242ff"
       }
     },
     {
@@ -515,7 +515,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "08e9a82139b17ce4fcbd5c55e38fcaec116c8f81fc321339c19e0d9946941a57"
+        "hash": "6e78bb3feef4d2fab6dbfced1c5f617869ea1c9f25b909d96dcfd7619df84aeb"
       }
     },
     {
@@ -529,7 +529,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "75104822649aeb0f500d7092e0a8c68d9eca2ce9f539888a98e3ac14b7d21f17"
+        "hash": "5f363fa3bb93198f77488fc587bf8a124a04116348a81585d4b4a45b9fcb9989"
       }
     },
     {
@@ -544,7 +544,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "161045368b3aa7f1e47b38df0e0d3703190480d974787880559ea99c272f8cdc"
+        "hash": "09ef1e582db77aa67e9f8741636876f27be2b39b67494bb46905181f570fa1aa"
       }
     },
     {
@@ -559,7 +559,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "189bcc5b973aac951739b98e717736a57f7f716ffacfa19dc27e46df7b8766db"
+        "hash": "cab7fc0cdd2b41758fb18e17986b0e3cc2b17a5ab79014530c9134a41ada9469"
       }
     },
     {
@@ -573,7 +573,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "654b93b073e0ea2d1688a50e45ace9c2566e596a6d17f3134461fcd30e6f7b5d"
+        "hash": "5bf0c865aba5b748d185b9415c3b66ed61c77a0c5c052d44cfb745661f9a5802"
       }
     },
     {
@@ -587,7 +587,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9a16e15ae31b0f92a48693d0cc2e805dae6df196d7b8157945b43474131979c3"
+        "hash": "f4471dcfb3a53fe8fd2f9e5566d5cf028aa69f4ddba69d6b5acd94c6e6aee133"
       }
     },
     {
@@ -602,7 +602,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c700b4d0695f1916842fa8b2b68e63a3735b9b87681e54addb23e92c6404a5f5"
+        "hash": "90ce0d4ef6e6fece19d008d21e0201864dafbe48a62dbc7226f31f4b9c834090"
       }
     },
     {
@@ -617,7 +617,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "367f1dfe6e5b3cdc1f65075caf615f8c60d720a1115badd5f6b1f05cec049af7"
+        "hash": "02438b83d413dbd5aede2eed7381f3038c4627135b63130ffdca48fdb6fbbc91"
       }
     },
     {
@@ -633,7 +633,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "adb3e42ef8c3a6ad09cd8255728e537d0ae643c59e285da001488695ab156649"
+        "hash": "c48af79621162e51752aaa5f4a672eda54d60de68cc8ba0b0f6df5cea73b1314"
       }
     },
     {
@@ -649,7 +649,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b381c586300a954da065c82a0985ce2bb60fed1aeeff4b17ba908e96e412801b"
+        "hash": "5559217e1be7deb18edbfac311d772041fa7db09e1087551dcdfa945ef855f6a"
       }
     },
     {
@@ -664,7 +664,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ff342b61fa948cb342e55016b4ec70069bef00a16adaf8744e00fbbd2568d3d7"
+        "hash": "965397215e067e73b7c7bbd8f376f5773c79bb82f370747603647b01dee09a28"
       }
     },
     {
@@ -679,7 +679,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "be5dd6c29e66bfdf52e21f5e4ec0bc2bf8e0ed4e7d797d3dbd03d283cfb99e8c"
+        "hash": "e3b0d5ff10d79034d6ccc448282097089b084ed71c608bc8f3468c0a8533ec14"
       }
     },
     {
@@ -693,7 +693,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4dcea3347738e917c8671bc34be4ef0094f8cc03a2992155a9abc511327def57"
+        "hash": "389ee2f96db160f9ab0ed4aa38c69a1eebf93d785c8baf82afe0ee84c611a57d"
       }
     },
     {
@@ -707,7 +707,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "21be6f73f47044757d9a18e0a7028f05849a638c49b7f622c089df2c94cd61ac"
+        "hash": "d7b9e0ff472527d78c9056a20a9cae4a9068874fb2ea10bbd6d3b6b66e13796d"
       }
     },
     {
@@ -722,7 +722,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "96a0f2ff883d467f0ac28bb599b1ff8632d09dc19a80d732dc0ac4ce338812d0"
+        "hash": "9a23c1de52d2ddc6a014f5ed46a904921bc361eff91f51cfd4883ada4c4125a8"
       }
     },
     {
@@ -737,7 +737,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "869333b93315ee8c3420df1a6c9b8f7ad21581500ceb269d3b4504ebb62eb39b"
+        "hash": "920453d0015cea2810cab4930a98143e76489460ef32d1478564c0db80a02f76"
       }
     },
     {
@@ -752,7 +752,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9bf5527a1fb3a8da9c06ec158986c3c6ceb311fecc2ff42938820536991b4a67"
+        "hash": "701a5d546676f215b52c3386cde017ee68496827808e55dbeda1434ec0a2f79e"
       }
     },
     {
@@ -767,7 +767,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8058bb919f4b1013bc71001df5309e448babab469cbc082480155546e2fc802b"
+        "hash": "9cf10fcda51ff8e1d130b0efa7971549a0d0bb4c24090c5766b82c12e9958604"
       }
     },
     {
@@ -781,7 +781,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5af57e0dc189d20c9433c4ebb9893d6e40f3c98676e5062c802f7b22549f673b"
+        "hash": "3d09493a2600221b39194711824b21c9c3f7f04225fe91c913bbd16ed28f56cd"
       }
     },
     {
@@ -795,7 +795,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1dc86e2aa970881077f10f5947fc9c6d935fc1a36618a05e6012014304f424ef"
+        "hash": "a1ccac5c1c24abe79c129563811b536eb2cd5c27a533bd93d967afa54dcad550"
       }
     },
     {
@@ -809,7 +809,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4ec588f479731db926b74e3939e070e93a363713ddd8122da45d36f7c3962f87"
+        "hash": "7f34bce958e51235318edc3a1fba0acf0fa110e533f3e92f87d27e74d7c1532b"
       }
     },
     {
@@ -823,7 +823,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "bcfc86542ccf08bcd721e099f4db41618737a3d619052045a2ec7556e62d1322"
+        "hash": "818427da43b193ebf9f10dccd7399c405c437cc5d0040add0df40fd25e940218"
       }
     },
     {
@@ -837,7 +837,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3a62b59d3b79180758a6d0e6838edd020476d5b68f74e8fa7b54bcc1670dbc19"
+        "hash": "2262275b7adcd7d9b2dd8f31da2a3a2dbcc663584928f46131a0d273b587403b"
       }
     },
     {
@@ -852,7 +852,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8f95f4680452feb2467760a15333f67622efd772bbfa629c4b449d2e7f531a96"
+        "hash": "db6d2c9f6c8a2b2e4b4030dd1092603d4201df29530105359949b18029963b30"
       }
     },
     {
@@ -867,7 +867,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "25806197fefa0dc577f87d8011bbe5839a8af6ab82e3da16136d5896f5c7abab"
+        "hash": "92abc752f5d3a659467e3dde7a3890000f4b72d1fdfd66086092494b688506ae"
       }
     },
     {
@@ -882,7 +882,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2df9a6f4e37f87aa387577de54db4b203025bc9329447065c9f7b0b792b1bc67"
+        "hash": "197971487205f39337e5fe2bbf01566944a0bfe06347b5bbc7f21e32a67d37c4"
       }
     },
     {
@@ -897,7 +897,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9bbacd07c7a1d66b521b98d192f21964ab2cc33a6a62e18314d9dae5ec51a270"
+        "hash": "828a6f2f3b94cc537ef0ee30c5ebda28fff688fea65030e47d5721831bdb48ce"
       }
     },
     {
@@ -912,7 +912,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "145863ea8feb1ab916e06291ed7b21a70e7cde22cf8d12fd10195648818c5f8d"
+        "hash": "306bfe9a8dc6fcedbf4dfa88b7bf2aac511556a1629ddb33f9e301c1e92b4321"
       }
     },
     {
@@ -926,7 +926,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e10120caae62c4170bd49229b5ad6c4300b15096dc2c239482ed5d8729e48c1b"
+        "hash": "7023fa4063eaa53d06b0efd531455be981b3a14e6e0443cb9a04a639653103cc"
       }
     },
     {
@@ -940,7 +940,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "114bde42125816cd1a457b4e4f1288b33d0fc1abaafa18c72f5ddc6b69020681"
+        "hash": "6ab35042dbb8b16be8ea108cf5029b34ac9fb166ca331ad2ed6a52188f5b0ba3"
       }
     },
     {
@@ -954,7 +954,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "140097c693edb184424813852a93653c78fcd7a1f3b5698902a32747d93e1d97"
+        "hash": "421ed9a64e720bd3ba5969e067f94a3d0c3f515b9e8af5ed420a9bbce48d75cb"
       }
     },
     {
@@ -969,7 +969,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "953b02c7436b6e08d29450e2115a8d64dcb91c2ccbde7c27ef6ee4c29a83bb93"
+        "hash": "2ae245946d7c0d704aa1bbadf43afad388c09ac5dba409439b8ea79c1d4ad944"
       }
     },
     {
@@ -984,7 +984,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3dae6b05d092ad5c51eff8070a8d5acd3005e5e42ec3b0e0a3943f8aefc7a073"
+        "hash": "17dd9d9ebf61759b170b90253df1d726e761adead262a1733a0192ba21cd15d1"
       }
     },
     {
@@ -998,7 +998,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3b9f6f8b8be5ddcd3a23143d9eb2a5df147c0d6945ee79ad8b79f84a1551bc36"
+        "hash": "2f2c68c3368f5658fd54cb70b6264dce87ee68b23e805a95c62d55eef1854958"
       }
     },
     {
@@ -1012,7 +1012,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5e3460fdb78dad66100007a6d9da872c1dfc10e60d0a422106c55db7d0f48786"
+        "hash": "d38bc0cd234c57cb95db1e60c47eb11a4d89775a4694acc520a8f113d03e3a39"
       }
     },
     {
@@ -1027,7 +1027,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1242d0263c8ed3f8722006358673fe594c21b258def4e20c148b400b8fc3e92a"
+        "hash": "905993ba8666f6b76fb806f959dad3f043e875686885fdbf2b6b0a0a080d675c"
       }
     },
     {
@@ -1043,7 +1043,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6dd8dccb7040e1a892f9616fe28133ea82967a83dba3aa20fdf4a2f9dd00e66c"
+        "hash": "7e9e7d7f802e363947ecaf97defebf01225c8a38d6ca8a4c6584e9837db6ec24"
       }
     },
     {
@@ -1059,7 +1059,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "931bf80a58491834a07b59e070e0dfa14db7faf4e7a22bb39a8df1d91878f1ba"
+        "hash": "677770bd04bba27f729ea484bfdeff66cc5f0aea6562eb6ec49feaf9339a677c"
       }
     },
     {
@@ -1074,7 +1074,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6212e5c102fb98831ae0e8f8ca55bf977ca05a56d557544006c6820949464cb8"
+        "hash": "824dc191c0c2cdc20738ba3b53ce77af5d25b3dc6662a78ff0d95609446a211e"
       }
     },
     {
@@ -1088,7 +1088,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f5b381d043f197842877fe5b5f646a58ebbfb52d9e4a74b580a912a7d89fa2a8"
+        "hash": "ed7fda7cda998a02fa4d69483826a834a795e3c5aaacabed229b76247dec6fbf"
       }
     },
     {
@@ -1103,7 +1103,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0d671b6661781dfdea58e916be21c17dd5212060744fefefa1684a663f323716"
+        "hash": "5eba7a884e9f26ee2bb9a51cda8e17777fc3957814a3071013f9d4f9958af102"
       }
     },
     {
@@ -1118,7 +1118,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "50b2980119026b898646420c2dc3cf2f394f5162f1a336cf64bc8d0244e54f26"
+        "hash": "383ed61e69b8f63ae42d0746a1995057f4f65b4af6ca7778d8f1771144802acd"
       }
     },
     {
@@ -1133,7 +1133,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "206443c4bd7ea01153efc17b3e7bbca1256b3ca43b8291f75c425207d0e96dbd"
+        "hash": "a6d182258648783ab09e72d4c40ac9de0dd3687a3b82c27715efab34d1836e1c"
       }
     },
     {
@@ -1147,7 +1147,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9e439e957249cf549d905b67b570d9ecbc040b4905b612b6bfc871956e894084"
+        "hash": "be45889694178d9cb40497b8b5e1815b836b6a069881cf83998abddc242234fc"
       }
     },
     {
@@ -1162,7 +1162,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "da240b0489cb7760840cc2f2e2b4d5d46dffc5a984b1822fe327b1d9df0806c7"
+        "hash": "06a87242bde67fb030fbebf69effe858a5d30e21ca803937a533ab352d8240fc"
       }
     },
     {
@@ -1177,7 +1177,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a4e2f98a1e3d3b1c4828350905359916e49fe85f1bdc4877358231c8d738af62"
+        "hash": "a6e1a401f74fecda3805e745a4032b6467d3c4f97d0c810b288b59f441db144d"
       }
     },
     {
@@ -1191,7 +1191,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f05345f5a94f2c3a81c0c522b3c8b3237e0af27fdd9c128fdbb1b8a48688afc4"
+        "hash": "d9b9b99af0ced3ae231521d4100dc5779436dbd624a2c3b9aa11a3ef9fb2edb6"
       }
     },
     {
@@ -1206,7 +1206,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8a610d6e82ab7c37817d43c2117ebad9b2206afde6899b7dc72f7ac14302f9fb"
+        "hash": "99268ad91de24fd7c06a35e0e401603da2087fe4b3ec349d6aebe0ae89a579a8"
       }
     },
     {
@@ -1221,7 +1221,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a5d563bc1ab4b93d549a7e1ff22af3098579f88bfea00bc7e31e7f634294f547"
+        "hash": "736507ed960071c1d5e228e2e2689f480e5dc4bb26c6822e5afac8df9b41e872"
       }
     },
     {
@@ -1235,7 +1235,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "422aa422a3cd6925918cb816765a8345a7b0b7a5f877d58e3ef59ec6f9b6e7e8"
+        "hash": "986e50245ceb51d4bb3baeae10d6e4d162df5c60811f690f4a5e6b4fd36bc2fa"
       }
     },
     {
@@ -1250,7 +1250,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c2cda36e7c2d595a1cd4ee324e58e02df5440e7dcf9bbf6cbe634f4be1cefc25"
+        "hash": "0283161af6234908ed0a3403a8e7fb2f33a576deb745f2902e622eb41584b33a"
       }
     },
     {
@@ -1280,7 +1280,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "efaa9eb73bc8c25ba94f45101e0b650a35d9ffd5b8fbeb220bf918da4c0590b4"
+        "hash": "878603be104f98fed0dca2d7c06ece8c4f6906a79ed0329e60bc9964c7b035ff"
       }
     },
     {
@@ -1297,7 +1297,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "68ab69ced2c344d8f029c9de961f1ca5bb6e04433ecc85b24ae567c25beb2ced"
+        "hash": "72c557bd9def493e3a138705f5cb66f993228bd7e51b11fa84f85841bc035524"
       }
     },
     {
@@ -1311,7 +1311,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b0d4959736817ca83264900b606e7ecca1e37b104765f6b71d4d289927e9178e"
+        "hash": "eaaf3b173bbc54d7e83464bc8c96bc9e48a21bcffe606b05134aec2cf0191995"
       }
     },
     {
@@ -1325,7 +1325,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "313498edf714166fe504bb214dcda25737ba53b1172fef939de4dcf3404fc257"
+        "hash": "ed80f090fa9c7f999c3a2a296ab6c5bc66d53de16af625ca49455ad00200312d"
       }
     },
     {
@@ -1339,7 +1339,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8de124b684994279d28abd5ac146ccaf7d71b6c0dd774fb8f5b071622177b366"
+        "hash": "2093c36c482cf2a34c6c3b095fc6c18dc22693138d66d7527a0fe570156106b8"
       }
     },
     {
@@ -1354,7 +1354,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f349bb299f8ed9c30fc4a0782f78488b08efd98d2d81dc93591e20c01c4eae5b"
+        "hash": "66e540b754a02d3deba942aa9854d1051ec54c81f22e0dea859c5d3305b89fec"
       }
     },
     {
@@ -1369,7 +1369,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "30fbe8a31c99617e3bcae84b190c669f4064fdbe2a314bdabaa7aeb22b677b7e"
+        "hash": "61abf38f71e57dad7cf5abef9d19950014819f3775371caab92f4433a07d07de"
       }
     },
     {
@@ -1384,7 +1384,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a089cfa14c8316d2604567eeabb660394eaa447b3b55f8877d2bffd0e74ba8e8"
+        "hash": "1e35c8e3f0346e387fd97c25ecd0560270860bae65cc4a2d333b949f8187fa92"
       }
     },
     {
@@ -1398,7 +1398,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1bc034bd0cfdadfaa7b8f17d28436fd735be7986d10d5e4d066c15cb2abfb350"
+        "hash": "6041519112ff2d31db7b7076bc472cdcdfac0f293f2616b1af53f02313e46938"
       }
     },
     {
@@ -1412,7 +1412,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6e341280f2a1e617184bc4cd201ea8a2e8e3f24610a9d51ccb956ed74da05365"
+        "hash": "db5e6f745e0157873ab4c0840da8675d3d20b8fe2ecbbb4e9f24744606b0dde9"
       }
     },
     {
@@ -1426,7 +1426,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a9be5e8fcca0abd22cac1e24ce7ede5798536a7fec685ba935ba4f6aeeec393f"
+        "hash": "4a8abb281739c1b068d979b8d49038ea063ece4aa570cc8444926ebd30306ff1"
       }
     },
     {
@@ -1440,7 +1440,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b236101b97d43f507c9d8e5bc549d3466ca6ab8dd77a0cdfe79ac54f3da8a501"
+        "hash": "baeec5f4220f1e457b11034e29d84277dbdc9fc5c9e69c1a225bb22f13b843ec"
       }
     },
     {
@@ -1454,7 +1454,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "30c22e10f8b425ca56ab6147ad6a6ca22493bd5dc74763b47d4537794e5faa8b"
+        "hash": "0f2ba02c6de1e9396abbef584139bea4dc379a6d465f4bebb151ad3b0f77ff6f"
       }
     },
     {
@@ -1468,7 +1468,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "bddc2aa28057295a443f3c712d0afe790967269ace01a593f8ebd3161959746a"
+        "hash": "561d55a2f839596b336a04badbd160a3b895e9ebb9c1d392998ecccdbe5fb98d"
       }
     },
     {
@@ -1482,7 +1482,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8317d2ba88c3313df22b4a3c7b8c584a9695a3e47929769498c998a191e33a65"
+        "hash": "4033549c80f649c2a9b9b50d1af42410811ff72914c5eb576445219bddfc792f"
       }
     },
     {
@@ -1497,7 +1497,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7ef8abe35c1f73ae254dc94809c02e5592c6cdae1d228bf5b0049024aded7ae8"
+        "hash": "b9668334e0fd077c4e43d616765e4343b3770a0a3bd6b846ecc743ca7d65a804"
       }
     },
     {
@@ -1511,7 +1511,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "70f912b7b6050a1e45db91e52108f955be199e67bc418e44350ca75dbc95fa2b"
+        "hash": "7fb09e3f807459959cae5fcb87ac323286e0a36ed4500b699c292c19b709af38"
       }
     },
     {
@@ -1528,7 +1528,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ad8f7359e02f2a451ace63878352b5277f4b465b81d42517d7a7da860fe06a0d"
+        "hash": "defd32f6b9e8d045213a7cbe4a68686ec229c472e46837afb6c7bd1b3df3ccae"
       }
     },
     {
@@ -1543,7 +1543,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6fa953c682555ba0ba21d95ea94200bcdbf0fd750e9166ba4e420f6743f6f962"
+        "hash": "3d356c5e5780be7b393fe37e2bee159be965aae0ebc4474979e28385ea8af18a"
       }
     },
     {
@@ -1557,7 +1557,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8b6b537dee230112369c56921909edfa7057563ff4b303126d39d20a0daf42ca"
+        "hash": "e75b1c53cb28dce1ac4f8e1d1289f96da22e2b24e6c3a28bd5fd5adc5f4ec5de"
       }
     },
     {
@@ -1572,7 +1572,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0154a5cfde5731e51d52d1247c2c1a099f6505b00bce807bded0b6d310007a27"
+        "hash": "edb16de35e0a033f7dece0ff7854b17cb6c5ed0ed68438556ee38b68b219e7fe"
       }
     },
     {
@@ -1586,7 +1586,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "42c520b4003b990fcb4874a5d74d3b8fc0560535b75eb536067ac13be2396fe6"
+        "hash": "f045367ac2eab790b4e7783704bdce034b8f750aac38a96b2a6bfac4badec938"
       }
     },
     {
@@ -1603,7 +1603,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5023bba7071042ed934cffc9c7c10879e1d83159d667d0f7cbd02a7b6563a59c"
+        "hash": "aa8ba51d9419e05e0d2962221c0a65311ad54b4b38f278a1d4ab546ca5b29bc9"
       }
     },
     {
@@ -1619,7 +1619,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e50f540cf0fa0cfab53b5fd6d6db5c75458c9c532635530adcfb6296929e5815"
+        "hash": "80adea6b33dacdfc5f2d25ce270472f232208fa688794b71ba042ea368e1ad63"
       }
     },
     {
@@ -1633,7 +1633,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e4007add6bbc4141026107f3aad18346a563997cb66533ca36cc18692c495e4b"
+        "hash": "cd65a1dea363ab1e3773705c33b30afd44fd1ab2ecb57f732c35fd4e737ada11"
       }
     },
     {
@@ -1649,7 +1649,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7d73c1510e8f03bcb0d19577515dc558cecdae697f9f67227dff9d8d94db2576"
+        "hash": "181b4df31bcbafebd7960725d19c945925a2dc5ee79ef30668d4becae0c82518"
       }
     },
     {
@@ -1664,7 +1664,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "078f1ffeaa850cbde3383fe6c799950f24c68d73f29e324559616b0ced212f2b"
+        "hash": "8b7b70809f93fd9392315a5c63aa4cbbf9b45eb1165a7d44db314186d407816b"
       }
     },
     {
@@ -1680,7 +1680,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "77e6b9f23db17fd9ca9ed468d852e3a57a860c2a4f17374d37d836347a47eba8"
+        "hash": "2ce890e49f107cfefbcd752721c447416c350e8e1fd3ee1befc3f154c5d5adc4"
       }
     },
     {
@@ -1696,7 +1696,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b2bee353fc87d478c7f2d25571af44cae021975b0b250a25a9bfbfa21fb09c2a"
+        "hash": "c243abb2f47bce90c1afdeaab78cacc1a5997e8124d8588f446c2e33ec5166f7"
       }
     },
     {
@@ -1711,7 +1711,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4c9bcb42d2e5062fa701676082215ecada42907647b458fb2728f162f50239b9"
+        "hash": "a233bf70be2dc7a0696d852561462c21f14974dbf43d888696fb8b7c36d0ca63"
       }
     },
     {
@@ -1725,7 +1725,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5ff39c77c58c0923fa62cc280d327b3da92452ac93d67addce6c4a755ac391fb"
+        "hash": "4c8c44d8677b7b591d36d043e3c1347b50ad21e2b24aa371ea50b515ee98254f"
       }
     },
     {
@@ -1740,7 +1740,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "12795f514a9a20c966b45c1e08b428a89decf02ab8ab25e95351c842e14af38d"
+        "hash": "2249bdeaa8327b70492049e43d049bd3a0c6b147cafb80504d59a9199f57d0d2"
       }
     },
     {
@@ -1754,7 +1754,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1d722ccb2ba2ba2343e7e5a4267267cb428c8023f3bc715efbd12a7b345dc6d8"
+        "hash": "c55f08e2dacfc794891f331a8ab6038a6600aa3a27d73b04d6d8e20142ee38e7"
       }
     },
     {
@@ -1768,7 +1768,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d1fbb8b0dbecd03f84283818ee89afea941aadb1825bdaf7310b1de6b73b7c3a"
+        "hash": "fbb48fd534c60e0b78ddc84eb7dcdc74e0cb8487545da6a49ca53149915af632"
       }
     },
     {
@@ -1782,7 +1782,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "821e5747c844336d0d5257bea695e4596be44f4dab46e3911c615c0f8fe300fa"
+        "hash": "9c91703349f7d2e9ae8806ca1374f893a06389e7caf6b6410cd4edcdc0cdc641"
       }
     },
     {
@@ -1797,7 +1797,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7cfa14e36abfba9adcf9a94db02dcd299e016e530ebe97688bf3fec21a0472db"
+        "hash": "f2cb7d6d0d34691affe17f7c06ee5c45944bd9515298560a18543f0798b4fe13"
       }
     },
     {
@@ -1812,7 +1812,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e0323c660334e54d299cf6309c6e9b9779c83a9f8a57276b6ebd7fdb82bd111f"
+        "hash": "d70f1e3ff938d3aa378038d316bb2d131da5fdd2ea62ef512de3336910e6f342"
       }
     },
     {
@@ -1827,7 +1827,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5310f9e3df5f17fdaa576d3d925ebff1156b07a13b247982523026717938c367"
+        "hash": "67fe7e3ed8f8866b3669541f28a13b5a2b0c3719edcff68a3284884f3f39dca8"
       }
     },
     {
@@ -1842,7 +1842,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e22aafd7601076113089156e8c5bef5b58a0b871c75a62fd7645557b1cb8b2bf"
+        "hash": "029121e79e5690c63a06bab363cd71f0c0b44fc5ac13d442b7e1103efe113cdd"
       }
     },
     {
@@ -1856,7 +1856,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c4fe47e6f86e2885cd13013fd76c9655de903a6d6381e0a0310259fe509c348f"
+        "hash": "cb00d1c23e02506fc968515ce8c18dcec8837d447cd47a99f73777574308fb49"
       }
     },
     {
@@ -1870,7 +1870,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "afae345b486b46947328d2b9861a1fc978d6f31e0f9ee239c147497fd0af2fbd"
+        "hash": "6fb50a82d884c18e13fce553a0027ab6816697d3be1dd4c5e22d0c8f833744bf"
       }
     },
     {
@@ -1884,7 +1884,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c84982df57741120f043b95900b6ced00df759ba32006dfe4ba6cbecd8951210"
+        "hash": "bd45d57d669eeecd55bb507ab12c09839dc35ee90f99bcc182dae0a41649a19d"
       }
     },
     {
@@ -1899,7 +1899,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6357fe80459843ea6063ea1d45708d2a830027ca15404f83f7207076453acff4"
+        "hash": "42ad71d6d0ee0fc1ab7b29ba38f2ecce382f811e44b7557e7cc53f49d61596a0"
       }
     },
     {
@@ -1914,7 +1914,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e1ad1e48023b486e60f19dbbe020cb1e801ff5ed4912afc9823b2bd63bf5871a"
+        "hash": "9b88b7b1786c6d7b7c2e1de6c89019feb07fea89f8a17f082c18357cac67abc9"
       }
     },
     {
@@ -1929,7 +1929,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3040d5fbc00eda16be6cef9a34bd14c32bca039a9361414975b704a778e7374f"
+        "hash": "43f99f032f4c3d1b685d3ca05b76e4c4857168cf7b94f93454421d328bf8aaa2"
       }
     },
     {
@@ -1944,7 +1944,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a964d973bc0b0a51e79d6cc8917c74662df6a7fe784b394847e1f73c7d0b49a7"
+        "hash": "ecbcab22d1ee4d676863be930fadc0396b8688def0a782e8fb3fec98aac436a4"
       }
     },
     {
@@ -1960,7 +1960,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1a8bf513deeb8d16670015c9c47066e542cfadcb49ee1f792b7222525349877a"
+        "hash": "06baccfa0f48458c6d2eb043960851545f3c358f50c4687c2d570676d73f42a9"
       }
     },
     {
@@ -1977,7 +1977,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a1c0b0ccf3608b21f23e16d72172d50d7b8eddd6575417553b24ad12fdce0984"
+        "hash": "74e18a4c018b09d172b04daec6aeab29297b83986bb846028fc20ab1300c84a5"
       }
     },
     {
@@ -1992,7 +1992,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3ab6b5f71b08d335b401edcfa5cd9a4a50375f7002c20c44e4aa1b092c9409ba"
+        "hash": "78974cc479b0d3a51b7795c5679cbab9601cdd90716a69947799ebe302a7d515"
       }
     },
     {
@@ -2007,7 +2007,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3d0d439e0439f0ee897643fd2d55103d13ceb6b29bbfbf25ef96fb5ec4aff175"
+        "hash": "9404ec22658a648e7b7bcf314b764e4be17e235b14ffdf03654325844fb51005"
       }
     },
     {
@@ -2022,7 +2022,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d94fb1197edca9a124d462a6ff350eac157a1cef4b074e6577300a98c22bd974"
+        "hash": "00b43a2b430d5d9205046ad6fbf7442f0d4507895c82545753253b5b5f97fa3a"
       }
     },
     {
@@ -2037,7 +2037,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2f685997689173e988f2a037920a51e87b8beb9968d7847c1138bb5443b8e39b"
+        "hash": "947340a879922379186ddecda22c625bc4db21948dc619e445abd95da21d0a1c"
       }
     },
     {
@@ -2051,7 +2051,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "84a180e77eb415f95590f098a79dfa3a4c0bb26f7ab61ddf50cee6199988b852"
+        "hash": "e1adac3af11702cb65c30ecaf573659d215b3e2c2b5825e9993d36d889c5fd52"
       }
     },
     {
@@ -2066,7 +2066,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a350af7cb869b0ad84481e0fb61ba40e4e0f15e713fe9aa8f134ca2a34aa8288"
+        "hash": "0f9f606715fd96c8dc80df73bf8f19ae808ae0318b6c332f09ccd01cfb37fef9"
       }
     },
     {
@@ -2080,7 +2080,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2e85f8e453867fa4fe115a815b7f8ae85450fcbcb265898ed3104fe128ad7917"
+        "hash": "af819966e11f4832bfc0129d1d0e148fa0157775d9a07d26f4c17f7096c6a176"
       }
     },
     {
@@ -2094,7 +2094,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a6da1a53283096a1ff6d58964c4cca939d2c52c69bd39a01b32fd82da474768c"
+        "hash": "660aff9a5f540384603a2ab18d24e933b37e71972bd6bbc708b7bfb77ac13a50"
       }
     },
     {
@@ -2109,7 +2109,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "51f4d59108d951823e041169354fb120e0e58f20aa2dce19b44957d349beb252"
+        "hash": "b774dbb0eb7647839be1b680627c1890fa4e1dee70b1a627fc6a1c9c0e9f3415"
       }
     },
     {
@@ -2126,7 +2126,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "243117a13cd98f68b115e68906166c518101a5a59eb18b39b677a355853c6c0e"
+        "hash": "55954fcfb879542225f7d1861ae7de6faac288e28ca857367b6a2eeba9a54786"
       }
     },
     {
@@ -2140,7 +2140,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "41fba276ec7dca06006425cc1b8905ad9f9b7918e04ccbd211bdfa1bc4645f62"
+        "hash": "1c88249edc75925e83e8a4abc28f300c27bf9be1440bcc30b1b798b7d7ea8596"
       }
     },
     {
@@ -2155,7 +2155,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "608f4b36d061a98a0f8203ba3cecb48f87ccc6f7720fd5449e34b576f98aaecf"
+        "hash": "22009c1df55cca53bc9b227d4f8f2e3d475abe5f5eecfbf9ab3cb30948c9d783"
       }
     },
     {
@@ -2170,7 +2170,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "db0ceaf0fe1e662750aabd1bd54032b17c471efc2511a120354cccc1f7d0808d"
+        "hash": "e23c295c6c1d85cbeae2cfad15be98d3d8093ba59266f14af7dc47d19a68f43b"
       }
     },
     {
@@ -2184,7 +2184,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6098b98799252bd8297351aaae52530f6d70454e9bc00491d47e401a28e92e11"
+        "hash": "8a0c679926f99b1f710ad093e3ca2ae845eea383740b4aa655e2e3beb99472ca"
       }
     },
     {
@@ -2198,7 +2198,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3286793e1526d264a82f61f3ea3ec24be21f735e6df3a4349a5d124de52f8096"
+        "hash": "e38f39701757feb6e2515736d446b2de580f19c77f9eaacb5d0d5b3e787209f8"
       }
     },
     {
@@ -2213,7 +2213,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2cab1f1a58e46b779843d02b11a4198c749071fc07d0a9487b99936a19bf17e4"
+        "hash": "446ed50e100f18a606c8443be196992b74b235ed98646632463fdc3d01f9eb04"
       }
     },
     {
@@ -2228,7 +2228,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6bbd64bdaada44df70084acbe3aebe1057ae3cb63d3c397272a88069c27023f6"
+        "hash": "64de55a580b3db52f79f2bc3168e312d4087891216853e51f8585e30c6eb3d3d"
       }
     },
     {
@@ -2243,7 +2243,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c54f1c3d860b85ead765941dc29927c814df798be381d4b7af15145aa5248866"
+        "hash": "5388bdd5320b8b68511c1a6b77683e8320177a9c6561e5e952a60193c1b73844"
       }
     },
     {
@@ -2258,7 +2258,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "145da6b8fa6d399c9d53c1a49627a9aa12588ba08f22e8c0237663cdd29a3540"
+        "hash": "f57c53ec6964e15510cd9bf9ad53429721c6a6547b59bd302ebcbc4cd19557ea"
       }
     },
     {
@@ -2273,7 +2273,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8f2dc25121cc870f19c7e4614d1e2bfb80f69abb9f940e34506dd282d8b8b64f"
+        "hash": "023b7e9fded22fad9cd776f01c60c8238236cb2921523d7d612034bb465cba7d"
       }
     },
     {
@@ -2290,7 +2290,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "567d6c3bb1c007c196d42d13e909499471f2da46f8d0ce88462d1a31d8157c26"
+        "hash": "c7d8ae1c152c6e7aa21c893d9bc3b581007004e88e4a77df0695a3b957c3d2a0"
       }
     },
     {
@@ -2306,7 +2306,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "42a7fea8a7f6348aad1a916f980af5c14d29da68748242340ff7298305117657"
+        "hash": "fa8bfc91bfa09eb76f7131c3cc7b890598f8a30ec9e9872f7ffd9c282d37ba72"
       }
     },
     {
@@ -2321,7 +2321,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8140e663feed7bf07d9f3167ded4948b6789aa8ee8e9ed3ceb35cb4f5a0a44b0"
+        "hash": "80e8196a7d4a8b335b30d050608b3d901178ba931ce1e51b7f44a9991a53b825"
       }
     },
     {
@@ -2336,7 +2336,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "42aa1e60ace8c5d452c7b6ed073e8ae58e7b5a78dabcdfa6f919b03ad54b4553"
+        "hash": "a57a8fe6a89b45bd11bcfeb71321839b5ae9c6a3789dfc6670be4a71d705f703"
       }
     },
     {
@@ -2350,7 +2350,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9c2a20c29c3b1b3052f45f2eefe83b51e01cbdf68c4929490f57e5227adab6ee"
+        "hash": "2dfe9101a9ab2945ffddb46ecbca0fdd5dea384683d310e8adb852ac9c51970f"
       }
     },
     {
@@ -2365,7 +2365,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b85cb6228c080ea8fd86de80811ab8b746896c8dcc62bdc38ab1728d8a7d6d41"
+        "hash": "926ac2fcee035747468a7dd0bbb57074b33242a2b65eff839b5b4ed47c6341e3"
       }
     },
     {
@@ -2380,7 +2380,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8ef7ed2456af6774730b68e254ad66625718f7a049d13541c7d60410ae610ab4"
+        "hash": "8cb7af2bd0a103563eee4e09266219630bf50c22048ad243d9456a24277ba615"
       }
     },
     {
@@ -2394,7 +2394,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5147f4f9545f644e366535c20eecbcc4a49e5e2606901df1d938b9f02fe56575"
+        "hash": "680fe44539f63a13c6586153e9ffdddd2a9a9b83c2736a69eaf5fe24080675e3"
       }
     },
     {
@@ -2408,7 +2408,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c9e8be3686e292a4db56f8f6068ed75705b3260373689a10b57401703581f5cf"
+        "hash": "1528bcadc4afcb7240a9f5d53b49243d512d8c98814b3fe841889d0772ad2030"
       }
     },
     {
@@ -2422,7 +2422,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2eeeb674c5f4947224fb065e5a1fa0b0adbbefd9b7fab99190cc9a4b65bab724"
+        "hash": "00eca9d29a66b8b8cee4b059a88bdae8f60cdc557cdff52817edd811cde5281b"
       }
     },
     {
@@ -2437,7 +2437,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3d4d902eafdad5694f899ef9f763f7a11a7d7ad179526a03b3cf5377692b5ec1"
+        "hash": "626f56d793d107522067c92edce730bca0d33fb5a8095ac9396b4eb374fddd29"
       }
     },
     {
@@ -2452,7 +2452,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a0ce043d4ed321c92f30bba8fd9e27270581e0bfae327e6efe3e637cc51700d5"
+        "hash": "b4417a972f391836241e88587797a8cd995f32ee71fbfcfe9e590c8fa8675558"
       }
     },
     {
@@ -2467,7 +2467,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a093149c0e471ec54ecd6fda4a44729011522875c57111144eb561319409f839"
+        "hash": "8334e570a144bb5cb8cf971d734b15c70b0912c32c3103ff05b0c1ee60e0c353"
       }
     },
     {
@@ -2481,7 +2481,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b9f4274b86fe464c48cd52578742e631cb00789bd9b3cb14dbaf7bf906238d38"
+        "hash": "84003bdeb9bfbac104ba97b07bebb29ed82a84a2e05e1931dc5f5d4c1d336be4"
       }
     },
     {
@@ -2497,7 +2497,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "61fddf2f1f1772e890978dfadecfd1f65f52556f1d0f4493c542274b5806ffae"
+        "hash": "8a9b52f4f29b9c52572e2577cffdf93d00278aa7eb661f8af62625c7652c663c"
       }
     },
     {
@@ -2512,7 +2512,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b35d2fdeb87912b6bbe3e6db3f5c91059c4b1d631e5e26c6c980b28001cc2b9f"
+        "hash": "1428086b630fa917dbb5a4ecd2854e9371b07244b3968bc3eb3184b4b589ea0c"
       }
     },
     {
@@ -2526,7 +2526,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "32027cb017b2f88a2454f66537f8e53f80129f1db56a4d264a8473320f4d4a77"
+        "hash": "49eb0b667109a372349e32fbcb809894ed62b5a1a3dab305876b810f8adfef29"
       }
     },
     {
@@ -2541,7 +2541,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "039b259f403f96a12db85dbc75c49947ed0cd4c9f271c1b2330b962e79c94eaa"
+        "hash": "ac4ec1ff763b005ddd65e6ed5bdb49b18a4ce53f8b7ccf79536fa49ebeb6efa8"
       }
     },
     {
@@ -2557,7 +2557,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "68d8649e37c7dc4582dd931e632cc53bc7c6fdd89b77ebe6e2ed87237e2c8f20"
+        "hash": "0d9421bc8c9374fdb7a62df1212bccf8c5bd1cb4a99cce1ddc87ba7391e66c18"
       }
     },
     {
@@ -2571,7 +2571,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b0f3076f0b76269e7968e123b12ecd0fcd5ecf9d53c354d263a8edcaef9295fa"
+        "hash": "a9ecbb1256234991b339b6701ca0d45eb02c4698f00f5b6855005751d7a30bd7"
       }
     },
     {
@@ -2586,7 +2586,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "dc47d703003778e02bcff6ba3679a18f496ef292c99150e9a1ef47ee7bcbbefb"
+        "hash": "37a866439f736e06c325cfdfb1ce614e8135fc724a7ab8c60174cf8cffe283cf"
       }
     },
     {
@@ -2601,7 +2601,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b16bf4999821f3e490db221683715bab83929fbb7dda3681107c9fd354f72410"
+        "hash": "215198b03c4b2e9c7961de606fa9df83fa5964f2210fcf17b4ea69ee15294bcb"
       }
     },
     {
@@ -2616,7 +2616,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8f1c1eb90b25ffc444c5304d0cb57b6c378aed95a92af14fac972a277c592fd8"
+        "hash": "c7f0f9b6b22590a17c41057c56ea5cf14e74dfbbd4fb7e4bc5c08db3760ef76d"
       }
     },
     {
@@ -2633,7 +2633,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e6fd375fff17a417326d159f49f99bc59defb7efbe3efb1d0154fcc915bf0b0f"
+        "hash": "7ea3b8a83b25f531ed389bfb8318ad70e65dbe2dc9f966a81924415c447a38df"
       }
     },
     {
@@ -2648,7 +2648,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "80d19ac6f58d14b862f9c876ec073b30df4320a2d6ddcdd65c7c2e340bd6a86c"
+        "hash": "10d552b21c7b8d85c9588a47bffc571ed837df53d24a47cb80e8016f49b04885"
       }
     },
     {
@@ -2664,7 +2664,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3da462a0771e4e021727ea956c720e384455d7bc22be7a41034ec164a0918c2c"
+        "hash": "23226393059fc47128562284e5982e5f9a4b365b8d0625f7e18cabde49f2e682"
       }
     },
     {
@@ -2679,7 +2679,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5e55988a85c6df1e7d207f856fed5360f4cb1f21cb25e0baa4da702c44562f43"
+        "hash": "b937a42861d79ec84dc8217b31c193351ec82f3220d5eccc8840d059673823ba"
       }
     },
     {
@@ -2695,7 +2695,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "36b4b1ff9e305cb6378ae7d6bebe6f2272bf3355719d455dab37322975598686"
+        "hash": "a6ce779c9f00b00d0035baeeb187ac97b6f96d748db6e4583f408173a2310dac"
       }
     },
     {
@@ -2711,7 +2711,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d491f95acc203a508ef388448e4ad3fb841a9a368d8c1a401a8b98e33e90d908"
+        "hash": "00851da4972ff91286aecc46f1070ce619d0d64287ac6a8c90b6f8f3c0da2abc"
       }
     },
     {
@@ -2726,7 +2726,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1b236c9ae2f4f640415e63c954b6902e7e6346b3b32c34be8d003e42a283b2f6"
+        "hash": "8d1b95da3bac65bf8a1801edfd1efce94ea17902669a7612c5a0138fad9d0b12"
       }
     },
     {
@@ -2741,7 +2741,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f22f57bbab2b420a0105e9a5492abdb3763970f27f6cc94e84658ad6dccabb84"
+        "hash": "71e58ca545b7dd0256d29b719b0c48c177968ef615a5ca1fc92377e6a4b089f7"
       }
     },
     {
@@ -2756,7 +2756,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c9812cc00b275ea43c2833cd3466997441348fba6baa13169b3733b04ec92c4a"
+        "hash": "448c71acf264e7e0752383faf025b6f118a02954cc651c1c5308e3894a83cc44"
       }
     },
     {
@@ -2770,7 +2770,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "90e3a88fc1d6657c0abad7ef8bf1d16d63ad79e0a3b3e3333b8d9113dd71b319"
+        "hash": "b0de7050159a7c0fab5a089e2118d3e20d48d96a4aae6a0ddb98f489882bb80f"
       }
     },
     {
@@ -2785,7 +2785,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "dee7c1bd5e81ac82ced21987d3d0236d5355b79f2fb9755062b77d5c7c13d990"
+        "hash": "13f1b8dca2fb1c6ebba61abb7e5784fc80288e59f4979e463c5f4b81497d76bd"
       }
     },
     {
@@ -2801,7 +2801,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d067d7b40685a5266757f37ade2f917149faac3eaa5faee2810fc4cef578e75a"
+        "hash": "58be8a0dc3e56ec09b0bb927c2c575c033c70ac3a8b612e993fdcbf6d5a99d51"
       }
     },
     {
@@ -2816,7 +2816,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2c1a723b2b59c4b20dd60eca4c8bc3fc90bab1351684205f5b9bf6ca95e279b9"
+        "hash": "436e070c2961cd8cbeffbc05fae7b3fa978eefe1e048de248bc17b86a2b06705"
       }
     },
     {
@@ -2831,7 +2831,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ec485952e6c1e67c11a8a8a92abede71530f5b26dafcd4a2523f85062c434126"
+        "hash": "325ab83a7c6da0d014c69236fc2134080bb8b2e6153608ba63c5924041db1c3a"
       }
     },
     {
@@ -2845,7 +2845,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "882a756a416c2458e19592002efd2fa77069a5707a369b6379690700a474840c"
+        "hash": "77b76c99d021860bb2c03c1b0b37f2eeddd9f9c9594aad735744fb1014e3e62a"
       }
     },
     {
@@ -2859,7 +2859,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8938f36bd51423282e19bf1d4547b8a8a1ebf1882abf7ec4e7ff371922e078e0"
+        "hash": "7cc8011d1cb158b7371144dff98b6243752e862d9dc3786caac77e50539060ed"
       }
     },
     {
@@ -2873,7 +2873,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c38b3afe1ae7f731a1066e48fe4fae6cf397ee5a052702736c2c4695a29db06e"
+        "hash": "ff06e5aeb0e1159f9193332187323f6a4f990eeddaa4fbc706c5a6025b53290e"
       }
     },
     {
@@ -2888,7 +2888,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9ff0d5e19de5bf65e96f4b206ac107c7df1ba17741ff0394748af64ec69e61e7"
+        "hash": "50e0b97be1cc2256f34991c379bae0bba8c99db160dcd5842112752074de92ec"
       }
     },
     {
@@ -2903,7 +2903,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d3656fbcb01673a6fc2eabf1724b5f6f3dce1dc00598a56a096bbd708276d6ec"
+        "hash": "efc733592e40a00d2d25b1b1fff5fe8064f9ecc8f67059279d70430c00a7a23c"
       }
     },
     {
@@ -2918,7 +2918,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "644bb127b78c7b61928b339be65c240412170fd7f83d48801284a6ba1dde61d0"
+        "hash": "0afafa961fb6ef8cef3a7d74fa55d16ccf5c1d94d790e1d1984242fd165770d7"
       }
     },
     {
@@ -2932,7 +2932,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e6150d0dcf1f124b718dd99d61e167abbdc861a2c67f1d4e681cd8ba13329361"
+        "hash": "20c4b668b37a52e61bbaa72b87a507cd4c7ca770d9e179d753258ccdead5ee6c"
       }
     },
     {
@@ -2947,7 +2947,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "238beb417839e2f97f5b5b7280d4aa379f2a4ca7a6c04439f056574ed01a48eb"
+        "hash": "2d12e5cb31a3f9dd51639897eaf42ca6844fd2d8a899f51523f8b5a10a8f2348"
       }
     },
     {
@@ -2962,7 +2962,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "530332df39ab0e9669de9fc039cfd90a36f984977d449a572da3b06092da7017"
+        "hash": "251db16d7571ac9e81cde0ca431de71ecb2b9817a07b5075834072dc10eb9989"
       }
     },
     {
@@ -2977,7 +2977,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b66745bdc310babb7f8b44d27dff3ffc14b665aa95f569fde6d2a05082808890"
+        "hash": "043ee85dc41a7310271c16b31c9a2b3e662b83c1108a04490c753f1dd0473929"
       }
     },
     {
@@ -2992,7 +2992,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "613baa2166459b02d033323f517bd6a646eab362ac6ecb74841757353ac41482"
+        "hash": "875854e1205203c8e8bff08adbf474ff88cbca4d33d49cb68417a72620096171"
       }
     },
     {
@@ -3006,7 +3006,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "459a1219cd120f25d786b945fa76b9875f22bb803cc2e1541e8bbfa596a0072c"
+        "hash": "f00343d616edbcad85ba18f1eb279f55bc663512ab725a6ea5ca0b94903164a8"
       }
     },
     {
@@ -3021,7 +3021,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9a569def20e0de06c19e532769db17a4475b4c431e426bd6923422f3e2b9fee9"
+        "hash": "0a91b2ae1b488c8a3ac1d732d48396ea0545314114d97ff559f6c6b275b8e2b1"
       }
     },
     {
@@ -3037,7 +3037,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f89538ff95a3fff3efdf13b0765dd03ccdeaa1fcc7242d61b5a0e73aca9fdc6e"
+        "hash": "359fd8eb0861de57213387e715687174cf671e22e9b66e358ac28364ad1b2be2"
       }
     },
     {
@@ -3052,7 +3052,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c5f26491c28670e971d9049b74ff79ed933a2d92ad29a117d324c131e8205be5"
+        "hash": "9baea961cebb81bcaec83515bc98ca1e77affc03b2550c88e5d559973025d3d7"
       }
     },
     {
@@ -3066,7 +3066,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "60c1b3e83e55b2cef66ffc26f92f419998b1aff51c6194a176c35c20384930cb"
+        "hash": "66051661cb13aa6295a539dda924cb6d55964fc0a438448414decaadbcc64637"
       }
     },
     {
@@ -3081,7 +3081,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "63a0e9adf1f1a85654347946c634d49a3b84bfa1a11cd609c00102ec523171d9"
+        "hash": "f42b7a49b6b92be7da1537a058588818c05d1110150fcad063c4325665a4d4e3"
       }
     },
     {
@@ -3096,7 +3096,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "64804da8497f144eb45aba279229225d446133c09e32592eae96789ca1f36cfb"
+        "hash": "1a1adbe92bb44aa61583613d8aebf70143f4ac9cd9aae2afa1d5ac88410958d7"
       }
     },
     {
@@ -3111,7 +3111,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "fb4809f344855c8a97ea2bad4f0aba5a8a55f7211739a70bb9a0700952cc822a"
+        "hash": "c888834c4829c50c67c9828127ff4b8b810d99925202dd2cc42110ad32010ea7"
       }
     },
     {
@@ -3126,7 +3126,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b6382880e8c13b2dcc19dbf8530b9f8aee18fd967494e68a1c0afb2a62952173"
+        "hash": "50d31769481bb1a8c09db3bcece1b3c8346fb83f9db32d5ae0c99f09e3b45eaf"
       }
     },
     {
@@ -3140,7 +3140,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "cd37c59287935e9cb0c9061c86f80b307252f6f64e47b5fbd6045970d492e59f"
+        "hash": "9a7c678e67831c68d0589a63a2928d4b68e4defa7a015d598dda253710401902"
       }
     },
     {
@@ -3154,7 +3154,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3d740895ae6737664c616285a734c79fa01896a1cc7dfdf434046bac3ce972c7"
+        "hash": "497b0275ae10369768d3c3c1db1b4de53ff82f64be838e5fd38ba469a88b4de9"
       }
     },
     {
@@ -3169,7 +3169,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "59cb5560cf5dd5696c1d8b664db8c12f9c9dbf43d5e5fdb4ec6be6cac4ee88dc"
+        "hash": "634d9c15c437db3db0789f91c3aff73e469714a1dbd28af731a52ae1d7fd6443"
       }
     },
     {
@@ -3183,7 +3183,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d3827db0162532e28149d341c08b1d2ae72f36b0b3b480407ef7dca211c9abb1"
+        "hash": "b57e228d9f4be72f0b54e613db0d03f8f580c79e48cd7ba43673eaac874fd057"
       }
     },
     {
@@ -3197,7 +3197,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d7e22ab0e1ce71ae47687441dd234141f2a2f70fab5f3a6b59d7015e924e517a"
+        "hash": "907872c83c8820b239838c65f4d5174783e372275e85fd96050d9218932325b4"
       }
     },
     {
@@ -3213,7 +3213,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f36dd78818c8651d6318a2bd6777dca10c7f8f3cbea010ac877c1e3ff0b2f89a"
+        "hash": "578eac814b69f7854e2febd57c64bf3323fe2e59beea24e5708fef5d64f7856c"
       }
     },
     {
@@ -3227,7 +3227,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d19b9746c57b6acf9596a3ea840b5e1b9a3e4bad9212a3b155a6b7f00df70662"
+        "hash": "8343f8ddd30fced511584cb972818cf5c0e6e8cf9a6ea74071d254c3b6808061"
       }
     },
     {
@@ -3242,7 +3242,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f19fae2a6a1340bfaeab71ce9e7bd6e4ac9eb691134ff31993631fb83043a548"
+        "hash": "ed705722088f82143e0af891539884b168f192f28e2c3926d2a15a26ae9ef539"
       }
     },
     {
@@ -3257,7 +3257,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "cd4dd587b174804aa64f07e96ba9ed1f7d39833014eb569c30f8689a61825a3d"
+        "hash": "31d70a01cc4a9045343efcd04f041bb6b4a9754dfa1665ed6aa546003803d6dd"
       }
     },
     {
@@ -3273,7 +3273,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "30b1d3168c53ea5658e2707cb03bef76c1864d5c0900d50ae8b9d25f0237bf1a"
+        "hash": "0842f93bde56f28c9663d341314b7e27b71a686784e7276b34909b0fa5551502"
       }
     },
     {
@@ -3289,7 +3289,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6a7d303a9761c57b32f977b8068de4fd9bd9ea72167df268220d13250d1483e5"
+        "hash": "4815876fd6dbb17ad34c0d8918e7a72d837104f9beee7dc51b0fa73057b9e83e"
       }
     },
     {
@@ -3304,7 +3304,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d9cd8f57c25f07245ee3e1dddd678e8cc1bde159ed0e1e39e4ab78d59100c2c3"
+        "hash": "3603cce07f53157cdf5d69e262bf0bd61c3103b5afd9e3d892cd4db39b037785"
       }
     },
     {
@@ -3318,7 +3318,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "68a521d9ba019afbdd726791f0a2aaab948ad142f3b64b657e5a88239f9e6cb8"
+        "hash": "9270afe4dfddee1974a2535ea2625e6130c41cbb890784ca837dd34df4efd030"
       }
     },
     {
@@ -3332,7 +3332,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "07e75d7e2e690176f49a9c730ba84a3715b1bd6af4a8b661818997efb13def35"
+        "hash": "21941200f0c5bfd1dedb00cd4a8dfd799062d7fe43cf8a82c0483e54b560ac0d"
       }
     },
     {
@@ -3347,7 +3347,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "020ca3b3b1c660acc9735d2b331008c2c2a3d8ba587fbfa3be932a3fce0e5dcc"
+        "hash": "e8875fbdf505642806ab6f98b68e4ebce935e87b78a639b74a3dce8eb6f6e9a5"
       }
     },
     {
@@ -3363,7 +3363,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "08cbd19f78bf3794926f6c3d138587567efcff45dd176d9d4f76466be174f99b"
+        "hash": "5f269ecc2da6d263be94fb94725167f0a2002e1eeb3fd2123ffc9403a2ef2933"
       }
     },
     {
@@ -3378,7 +3378,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "396e855d00edac72c4a96c10926f7c74888260527db1fe077f2621a2d7326c1b"
+        "hash": "6d0f66159240aa2ef6015747b2530d0a7191ec3810f3c502d9bd156012603d45"
       }
     },
     {
@@ -3394,7 +3394,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ff6279ccbfbe62a34cebe03db88ba4be61d227224a3f4c51775f8a480ef1dffb"
+        "hash": "d269b5a8124cd646189075c2679331bbadbb3cd535a1e3135d12f7de46836dda"
       }
     },
     {
@@ -3408,7 +3408,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0dc16efb9147bf354edfd96360c92fbc9dea6ac781cddda720e79a66bfce9d5b"
+        "hash": "eed98a26fc85c7684508f33ab909070e6205747990c5e4562f2d120728bd6a3c"
       }
     },
     {
@@ -3422,7 +3422,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "fa081f50a7b00bd86731269741dfef4dd2d9af97cbe1588dc3f3fe3f258c88a4"
+        "hash": "d034820c71f581ba5cdce7ab47e4fb0ff64baf554c1f19a0e45c5d0e71eeae4c"
       }
     },
     {
@@ -3436,7 +3436,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "672673d9b11ad533f4d70732d1ccb1cb3d4e4bf2884c64506e577f1765f0d265"
+        "hash": "e1e0ce4362866a007fe261a0b7995282b5e579397517a71202cd9bb89d021d48"
       }
     },
     {
@@ -3451,7 +3451,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "fa4acc5a88a324bc7fed7971a3cca499f936f0f6ceda490d11d19edeeee1a947"
+        "hash": "6e597c1a6a73606b584d7be8f1a4974cd312a2ec5c500078ce146609e6ecc537"
       }
     },
     {
@@ -3465,7 +3465,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4210a848f9b827e5305d7fbe20af9e4bb6b762235fda60c865e1d86d122995da"
+        "hash": "b749df623cb50779135ffb38d968cc58d9a8d5d1eadeacfa1d9eec43641c8e9e"
       }
     },
     {
@@ -3480,7 +3480,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6af176c0007886231038d513047c089a03200647c960ecb27b7b624e2629c913"
+        "hash": "038ef05a24294c7bb16d04d465628066418099465e99c020a21d073372ebe0cc"
       }
     },
     {
@@ -3496,7 +3496,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0e2974d577b4265fee1d9996d563571c50baed64300e7e26a58e5afe2460d606"
+        "hash": "f5c5c857e9d57ef7c22734163098e058d050ad0a9e3f28c57b307695ee982514"
       }
     },
     {
@@ -3512,7 +3512,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3671edd45cd63b16e866873a2b7537de33e1e0cbd2a7add3508e710866bcfec2"
+        "hash": "791ff20ffbb7736f586cafa1106f6e77e8e89d497bc8a479c0a0cd708fb907ce"
       }
     },
     {
@@ -3528,7 +3528,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "cd948adcd19d7fb08a7b2cc4a6fb05b6f4e778a2ffd67a7b6395020ee15c54ff"
+        "hash": "0ebc2c972fac7d4a8438188025158e0f75456b3787ecf2faae9d3db8d12ee677"
       }
     },
     {
@@ -3544,7 +3544,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a9b7afa2742b948b79cc30f06512c0b6db396f6e27c299c5280da4b5a423975b"
+        "hash": "8463ee2c8b3e9165b105ee90b59e143a4f1c8b60f8080770d94ec0bbcb455bb6"
       }
     },
     {
@@ -3559,7 +3559,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4cd92aefc779a6c7ef6bb2ff6676666e77ebe7f1b8ea9fbe5b37f42b158774f9"
+        "hash": "b0007cb91fbeab8d350028d5ae4448c366e79264de6c88e8fa15743158b1a927"
       }
     },
     {
@@ -3574,7 +3574,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c5a8561508b12f6698e8b9e3195ac8e1002ca429eb9679f3e752bec2114c1e72"
+        "hash": "461445d77d76f9f3bc05c2bc534cfb551689a99b1b73995ba7f4066a38c60fc7"
       }
     },
     {
@@ -3589,7 +3589,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "61bf6a1efcf5c0191d77af67f93e8e7abbe6963aba8e16058d2b5dfdc353dd40"
+        "hash": "dba349eee909dff1e13e6708ac067e1e7e776ff5862e79097aca630548846ed6"
       }
     },
     {
@@ -3603,7 +3603,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ec119d6e6b0af832bf8fa4983f08710becf372e2deb3c5f4d87f3327c25b48d4"
+        "hash": "90f20d7a605d4ec82be0bf5d4891d16d68639e9fbce578fe1c7e38c0d9027f03"
       }
     },
     {
@@ -3618,7 +3618,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f81e4a576e8f8db8a15a4f95162a840c38686b68dd9665567388d098950d6386"
+        "hash": "2eaf8ad72f65e8c4476c13e1c9b88967346df47c9cfddb6c9a7edcebcdb65304"
       }
     },
     {
@@ -3633,7 +3633,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "bb8227393be4c10ae717e4452b194258b7b49864925e40aa18c84d7be154d858"
+        "hash": "f0ac72c245cd8a375c6838281de679f0bfbe4326277ef64bf36589eede9d82fe"
       }
     },
     {
@@ -3647,7 +3647,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6009ce058c2a733ee2e0541f45a6bb96fad7bec1ff7d2cee9262bf1cd388b654"
+        "hash": "523ed896411e3460f65347a417d12e1ec2c62cc0d97ae474d69927d12c01b4c8"
       }
     },
     {
@@ -3661,7 +3661,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7a8643d6d71023c773ccb63efe25e4c9fe0bdd976a8a8f76f6f6a0abb928eaf1"
+        "hash": "ec9cb9384817f84cf0bacd62a23b69b2304fa2cf0352b16d3950b21d48c04f11"
       }
     },
     {
@@ -3676,7 +3676,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e16f5691d22aa4cd48e1b64f33ae50f973fffa168264c15c4602c595b9fdfec7"
+        "hash": "00483703389f0ba2b0ed4bdb8ef9f68e4de1a19b209655d85e4fcef0a16a660c"
       }
     },
     {
@@ -3690,7 +3690,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2b9a2f5456f0ed9bdd3726cf88a69775f2e3448d301fb77448015bee3f95bad4"
+        "hash": "bf42670ada90c9ea2a790523ce7ea1f140523f5d47b0f06808c32e4f174906d8"
       }
     },
     {
@@ -3705,7 +3705,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f570571660f62af4f962b7271d9f377d9c2bde92e2cca567ce5c357a5659afcf"
+        "hash": "32cbb7ef4ab365f228c244ad3ad8b87d88ef08426807031dbd87b709c76c61d4"
       }
     },
     {
@@ -3719,7 +3719,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "120d6ff54bbe75a7c58ad50a14f77a895a5369cb71157826642e8d5bd1434ad9"
+        "hash": "92e4282492b80dbbd7efa34ae308bcda2c8c6865615e64049bf34dd8eb3f4810"
       }
     },
     {
@@ -3733,7 +3733,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "19b33182a5dc111794b5d04b39cdbd6efc8a9140d8008e9563c99f4e3e5d4d42"
+        "hash": "6170ee4eec91a2bf73961a9cc15ce90c48fbf15caf11363c12b3d6478efa48ea"
       }
     },
     {
@@ -3750,7 +3750,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e3055f01701b8ac5da52f81cf8ba84e1866bee92ea70a3f34689a18cbeb2a581"
+        "hash": "39ed2d279733ad4061a381d85afccd111f56d15053132858991daf02e2c7fb36"
       }
     },
     {
@@ -3765,7 +3765,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "60866df7986ecdf0883b9dd4b3416f45a88da2e5baea6d785923c0092b9216e1"
+        "hash": "b47ebe31470158288d2f5c1ff80fd72b2b5779442ff1b2732217c09adb976447"
       }
     },
     {
@@ -3780,7 +3780,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3b37603f7ba773dd6b5c4c3884226631c56b9c801be822cb30c5a76eb85b0355"
+        "hash": "42ed9355cd80aaaa2370363e05913b04d89cb6daf46ac7459ea6a0f2bec2b93c"
       }
     },
     {
@@ -3795,7 +3795,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0cf699cb81f73bf1e7dcfa26066bead7f10a5245c2bbc3de5aefd119833745bd"
+        "hash": "dd7864be6b3d433e2a64999561cb152f012ccf2a611c5efa76e38cc2d72497e8"
       }
     },
     {
@@ -3809,7 +3809,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0059b3877b1e464316a970fa4b6c1f3e66c6d3d8eba0fd71ffc6da3765139574"
+        "hash": "9d097840156322f4316042fe727f6887b9cef948a92ffdbda4c92e0161f3389d"
       }
     },
     {
@@ -3824,7 +3824,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c3a8304fde85dde84a90efb998f0dd4444b7c04a6b4114386bacfa7b8b2de150"
+        "hash": "682cce8b08b295ff61885b2fdf8595c93eb0bc0c83cc6fbae5c6c20727a60eff"
       }
     },
     {
@@ -3839,7 +3839,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d00538ab5aba3ac223daa0e5301037622296acab3127eaca3066870570709f1a"
+        "hash": "a69e2913ccc5c7ca2100de571087a44c14b7ca475154740bace342852357b379"
       }
     },
     {
@@ -3853,7 +3853,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5e77fc312562bb285245db9ce463b2f60319c72f5f80f4b29911c7e088a320d8"
+        "hash": "12eb5e821413b38e0e5d19ed1c12b7dcdf47071d1e795e9e72ffb71e693e922b"
       }
     },
     {
@@ -3867,7 +3867,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7de60380be40a762fe0044242860c228a01a92a6ad1a71875967f7055db84b96"
+        "hash": "a5a49641c0de1a0a80f192c5be195c448ab0fe0856bba4e1f246fe70af7b5431"
       }
     },
     {
@@ -3881,7 +3881,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3228d4e5587f403b90361e8bc82b6c08fc5ff65bf21df4745a3e3f9adefc229b"
+        "hash": "956dedf2a511fc90c2d2acf5a8018838a7d2830b847761dafdbeb2f2df9779ed"
       }
     },
     {
@@ -3896,7 +3896,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1077fab3112f8fd532be9c54f28f3df6a0a82bc68b494e957bd97bd503f8cc78"
+        "hash": "9116653208cf97e75bc4918bd4e22e647c88d1ed8a8b8772cc4813a5ab2ff9ed"
       }
     },
     {
@@ -3911,7 +3911,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9e8a43e9082f882ff6f7a475686dfbf3fcb4ce8899029cceca3be1e1debcc68f"
+        "hash": "c9dda34ebe6e4f24ce3cc310bea23011208d050ae227000a347ac4e681b21171"
       }
     },
     {
@@ -3926,7 +3926,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2c6b1ffb9d8fe5252cf66adba920c81e0e7cb6949df0a9490f85fb202c015aef"
+        "hash": "d2f87b9fca9c7c5d90d95fb1e9865c7593a7dff9845296b690c7a7bf2a79d292"
       }
     },
     {
@@ -3942,7 +3942,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e4f6fa3b1f22174524005847896827239a9f4d48da77759e21085392bf19fa1b"
+        "hash": "ac93ebf2905bbaeec36266cb011753e11c3895f78771e332c6694e05c62a3535"
       }
     },
     {
@@ -3957,7 +3957,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2ade7a5abc3492e93d9375e2f1e4ebea2722a4070d3c0c0fef9737da4d3274fc"
+        "hash": "cf97f402b25ec7ffd2b670d4b541093b567334595439167c0c7a5534962ad2a1"
       }
     },
     {
@@ -3972,7 +3972,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0c981dba030ad350d16695c96ff9435b55d53ed96b025e80e297719be979a633"
+        "hash": "160e603850eac9489b210f1a3de5486944e23c0f799eb06936c6524af117fd06"
       }
     },
     {
@@ -3986,7 +3986,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "34db8148aab6bca2e91f1cb4546e0e54736a8183f9d7d51021d857ea9c6c8b56"
+        "hash": "5adc748425d58db5bc6b547a393d46b5f1b99c6ec4f6c7006ed5038d9abf09d6"
       }
     },
     {
@@ -4001,7 +4001,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "775b9b28ebb0a3f88abcb353bb3363f0b032ecf420661aa57c20e80b6b6f881c"
+        "hash": "1d748071f0dfc6d63b004336b2859d60d9084303257f34d7ac8e0b1ba17bb531"
       }
     },
     {
@@ -4017,7 +4017,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "117e9e577d11361253bc2d335f07bf6114e76b8a7a7d468c1ba40418c0089f83"
+        "hash": "158bb20051dc59ccd73a94ae416179c3499b70bc26003fb569f5b8d157266485"
       }
     },
     {
@@ -4032,7 +4032,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8c8b3cc4fef1fdfc6d4eaf3169d4372c668694f6e130547c276667506a1c369f"
+        "hash": "e8cca852ff9566bae5b21e6b0cc53294d0f2c7e563236d0f4a5ef0b47fe69f2b"
       }
     },
     {
@@ -4048,7 +4048,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f3aef4ca67a728875ef21fa009c5300d6d5e30779fd7ee91934701895b8274af"
+        "hash": "390f014b69fe582d2273b46cb769f22b73f1aec240cf0d38458680ca9cc892e4"
       }
     },
     {
@@ -4062,7 +4062,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "46d9f6904481a9e344befffc48159fc1205c1a1e558a03d8e4bb0073c73b83f7"
+        "hash": "b6f1f62e437bba475c89e0457c89e6bea4fb2521f421c27d4a11b9b55bf8a02d"
       }
     },
     {
@@ -4092,7 +4092,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "897ec7ae6a43dc99a72316d53116b6634b9841909550106e2341ee279e309f25"
+        "hash": "454a110a54555ac9abdd8e6512a04e15f707ac89f5bb08b9c4175f0dd777f486"
       }
     },
     {
@@ -4107,7 +4107,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3e34cb48380b9ec4aa52f1603892a8db1d760e3b8387d309f3627e7ad1731aa9"
+        "hash": "dd14903917fdf148409dd1ad440c2a1f098d3fe9a9d7742e72704d94e9d0f816"
       }
     },
     {
@@ -4122,7 +4122,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e23e28ef5264da4e5028b40bce557241cff8ded1e942dda0aef6e79d7577eade"
+        "hash": "aa461317f9e5e0fac8a60d7513ecaeb9706c15ac2c7ad3fe9be397b9328b1b7e"
       }
     },
     {
@@ -4138,7 +4138,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ee2f284cf513dc1d61b4d366698555c240131d5fe8fc17bd19a4cf055091ce58"
+        "hash": "a46d835b66eead91516d7c00db7e80bd396a7d410ee8dddb1a79a0aad8666036"
       }
     },
     {
@@ -4153,7 +4153,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "03a3fcdac74dd3311ed80241e6de8cb6f9ee1cac3add8c908b60e6bfd97c4ba9"
+        "hash": "c19982a92698e82e05f0f903aeac184191a6371efc35459475bbf2177e64c6e9"
       }
     },
     {
@@ -4169,7 +4169,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "74556a01701c709d8c9f8da03fd7fedfc9d5721c9f71e3093acff8bd30ce282f"
+        "hash": "59c447ac5984c9c7b632adc170e74168336faddbdea47df47e533d1d87a07cd5"
       }
     },
     {
@@ -4183,7 +4183,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b4dfe86ed9855ac7c917e34e1b39df5d43178af2c13881627d277efc9600b9a0"
+        "hash": "bc4cdf47b99e2ace6163d4fde6adea551f06362bae92cac8c7fda67712912391"
       }
     },
     {
@@ -4198,7 +4198,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7d60d7d8c42880de0a12a91df558cd04c2bc86e74631fd618b5f222323226527"
+        "hash": "520bb2600d7d31d2dee3aa377986e8cc5b368fc9bb257c73255c9a295804f6a6"
       }
     },
     {
@@ -4213,7 +4213,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "b8a1146c956e5ac9a8d3f3a347b946cfa066b2b656557ba9f0a35ac3ac13da57"
+        "hash": "8af295527bdf0a150d3e2f20eb7d07acca0d68a808f0bb622178576baa33128c"
       }
     },
     {
@@ -4228,7 +4228,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0d611c3d7fa609a620b79b66674e51211ed28d5e4ef602b7804cc04ca69bd6e7"
+        "hash": "338cc5e1c426261c149a8431ac04040389550f11cf5afa77ffae32ad13be9256"
       }
     },
     {
@@ -4242,7 +4242,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "af54ed912eebf9b9e09a7ada2dba2a495a99cfd7953b52f2dd14875dbc24eb42"
+        "hash": "df81add854aa09b654d62fa7eab314aa8d272da24ed59e876fa75a4477db8737"
       }
     },
     {
@@ -4256,7 +4256,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "297711965d0910a5d06ef3da57218325a5c73fd1f69aa68ca4692d96678c0520"
+        "hash": "8e1123ba492a1103e2ac793c7febb0851905301dd190c453a253e23b05a27a6c"
       }
     },
     {
@@ -4270,7 +4270,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "71eb17c86a261044dde77e2b6f56ac511042974672d61ecc90b52efaf7612754"
+        "hash": "30d3b8ac6dd36237d4b3221e3b9a8d6c1a097d2adefa52d694ee2d8733472159"
       }
     },
     {
@@ -4285,7 +4285,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c2abf1b7d9a9622ef6da9ce57d8e5dbdaa6bc02220c7e9cea8d1bf423d6b4acf"
+        "hash": "e229ed3f9dfffee8681ff978f7b1417b1a07b3820af0350f0c8b0332147a8525"
       }
     },
     {
@@ -4300,7 +4300,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c42316fd32bf6ade69e5af6fa674e17b85478af5bc43d88af8c1800a2710c508"
+        "hash": "ffaf357a96c9dca6e963ca5ec4c809b0012b92a551e0869f35c87fce5eabb95a"
       }
     },
     {
@@ -4314,7 +4314,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ecdc293930030c0da79e4cb0b21a9fc811219583ab36391428553fd25da0c822"
+        "hash": "8eece384966f81ded39d67601ec6d6e320e2ffb750cc5f026e4158c439bf2815"
       }
     },
     {
@@ -4328,7 +4328,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "81177986848b8ea067f9019c43923709a9798d1e599fb9ddbb6005096600db37"
+        "hash": "90ab922b56f62b3eafff4a31b2a1f1345d2126e712f02360cb8a6e8b31adee96"
       }
     },
     {
@@ -4342,7 +4342,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "10f04aac7ae6a3183c934a0d29dfce0896c43ef1808018f8dc1ccf8f72b03574"
+        "hash": "48d1e866b152eacd9fa16d8bf5c3136d01072522a58ad005a13d9b1792a3c37f"
       }
     },
     {
@@ -4357,7 +4357,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "16d119f2579322223f4643ae75df9c634046d58cc45a833e7037b0ec3e9d30a8"
+        "hash": "870a6ab0b2c7a69e26af06ce5f1cb2bd1706ae678139d2c2c3f59ce277c0cea3"
       }
     },
     {
@@ -4371,7 +4371,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f00f4a2229ed6b9f98356e6b0ea9e245f1d53bdbd616eb4c2babb87d7cf350b9"
+        "hash": "85a601168285577950b9fd0f28fa0d0283261dda12a2cb0e1a0e1cc78a6e81ae"
       }
     },
     {
@@ -4386,7 +4386,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "60a6869c136463b7cd17169c91a3df8baba1c4d5482918b6f93b7d898f1ed725"
+        "hash": "37225304d6109741f6ccb03fc845b2dbe84e0e2142861dfc73f5d3b5d770bde7"
       }
     },
     {
@@ -4400,7 +4400,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a7fe1eafbf16bb18ebc334acb4c3e865ac640b2da8c4c59084b92e47b1f2c31e"
+        "hash": "c1fec7508780ad0ceacbf58c049668201e9f88eee043234394e11666530cfb21"
       }
     },
     {
@@ -4414,7 +4414,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "1a0fe2710f33b65dd26898a49d82cfe32fbbe20fcc770793bd480492ce803161"
+        "hash": "c7a62b55b5a90661bf3f9c956f075906439a50151a3aee4023ad8fe878cae2e6"
       }
     },
     {
@@ -4429,7 +4429,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "a181eea015033d5741a3bd2f2d1375806f2d30b20f176de2e6a2c91ce52fdbe0"
+        "hash": "40bb52f6eb89e1b796af964316c93bee286e44952d8d2e410ac7f8124b6cd8ac"
       }
     },
     {
@@ -4443,7 +4443,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "bb0a10f680644b437d61c2c69ea3ddd9dacc87ba9036bd66dd81eb0fb98dd671"
+        "hash": "4794ae637e65b9c1ac43f6c964555a98cda83e1410684e11ed34753c81db35fb"
       }
     },
     {
@@ -4458,7 +4458,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "fc3f0e8b7f06d0114d589549e255298d40c7954386e74c74ab842d421f472f6e"
+        "hash": "9e162528df1b8dd803a71a770f3c5e1555ca5995005e26e416f5652024b3fd1e"
       }
     },
     {
@@ -4472,7 +4472,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "8416d92bd5d190468f9c9c73318228aa5898191983d1d941d6e43115d7ce63ba"
+        "hash": "9f1ec1d236c7cd6787078f8eb21ac9076a2049b9e63b99bb67017be40a0f833b"
       }
     },
     {
@@ -4487,7 +4487,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6e6eab17f7ffa0d8330c38e6f250d07c149d1c382c7e30c983b20c100867a091"
+        "hash": "07be50b2d41b64458085b8f48a361023061fff8cc6db5813ce56cb3e5d22ccfa"
       }
     },
     {
@@ -4502,7 +4502,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9c48e8bbe56982fa64b6272cbae696dc81c252a33291bac29661b9cc211e9843"
+        "hash": "e08f543efd322b776956ba59d67a62da19998e979e953f662059d57fb440c465"
       }
     },
     {
@@ -4517,7 +4517,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9915776188ba8fe2ba9bb6bc119f3ec2e15e39e9694a26691f874706e94d536f"
+        "hash": "57e917442bd3ef061d052ed219cfc4041abb5ab83c3caeda491c0fc7a9341fa0"
       }
     },
     {
@@ -4532,7 +4532,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "5a75139673bae9fb7b5fd89409c3ef0b5b248cb3560a311f92fc95c91f8e3e55"
+        "hash": "f7aec80ce75a7058fe94c36ea21c4db37aa46bcf114817b2d9dc4a71c16b62ba"
       }
     },
     {
@@ -4546,7 +4546,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "9c817dfd7257af2b39b9767f103d7ddc52fa9faeb58266809c4dad096f269f5f"
+        "hash": "656e754cd1a8ef1a738557d1453b8f6c65e5f0f67e829179c88f3d9b6d3c4ee7"
       }
     },
     {
@@ -4562,7 +4562,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f12f13e91351b4d6d38606d44c89bc3fe89c09d230ac44f2cc68f07e2199f35d"
+        "hash": "3b948351bdd9e2246bb545e3533e85337e9104854f34da559237b62e59084cca"
       }
     },
     {
@@ -4577,7 +4577,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "80672a8ef916cbfd3c144c24d9a2ba8f61aae96d83fb6c65b788598f39b61086"
+        "hash": "522df418a2b451115c7514afc7480a2f5a0f813dd320faf6e577c9eff71d379b"
       }
     },
     {
@@ -4591,7 +4591,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "40c66397d2aa4096b7cdfca13d83e87535ebd372f2124e28ed4e7574200a1fea"
+        "hash": "c2b5d3567834f4bc3149676e7130e93e8349a9a0c76078a0f31ab9de5cc739ca"
       }
     },
     {
@@ -4606,7 +4606,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "db2bce039d4c1c4b0f856856ab5dcc1f5bc0738e558f67e49bd4a0db222d5eb4"
+        "hash": "7caae7814b3cee1c6a312b563443a389bbc67843a78ca14221cdbeceffbdd4d2"
       }
     },
     {
@@ -4620,7 +4620,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "3637ef66fb8116bfa346100017cd05c145444ca59163feae74490ffcfa8bb95c"
+        "hash": "85dbe7ffa7a0dd1cc5e505ea54328de8f7a3c9809f3a051528bf4bc1cd87262d"
       }
     },
     {
@@ -4635,7 +4635,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c878474228bd386796ac702a400dba511230fe1b66f8fa78ca9fe62a2959a036"
+        "hash": "f21e8aa2e101edce3f1dc6510ece098a51cc63a3fed4c0343d065bc96abdf3c8"
       }
     },
     {
@@ -4650,7 +4650,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "6a38d221f7ffe44866abd3c70be9f98fb83a2ce7c68914dd68af475a4790d093"
+        "hash": "89bdbb02f2dd1c5bc9d1272ff3f2d5249af763115b596e9f8bc801d0f2256ac3"
       }
     },
     {
@@ -4665,7 +4665,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "90210f1e62a7f5bb991cb3b7603bc2ffef0e4aa02193fe2b12f6269e951bc473"
+        "hash": "6311c46f59dfe85022a091d395293fc8afe353b8f6c23bc0d535cf8c90d7df27"
       }
     },
     {
@@ -4680,7 +4680,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "96c49643e166f51a9ec78e0c75ce4bd2e799e8bc913794657fa718ad16723f22"
+        "hash": "c43cbb8a7a57f3873fde6b1c2ff16744c2332fcbb1e107ff581faadf9a742075"
       }
     },
     {
@@ -4694,7 +4694,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "cd300f39aa0ae59abeca10f9e0af65983a8c57c9884723792956647e341bf869"
+        "hash": "a58f3cb936234ebae488f907b8bf82f80a2966007cdff2972f658a969c250f46"
       }
     },
     {
@@ -4709,7 +4709,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "f19f8f2980c9430121f0ffc5e391d348d5715a3d3e8aca5c435bae418fec4f50"
+        "hash": "38bee97eef5e2918ce534d6f25ad2a8b40d4841c7a663d9a9a596dd4687ce5bc"
       }
     },
     {
@@ -4724,7 +4724,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "c5eb849038ee18cf97df69583d46e9c0fac073f62acaf155f2af2c48195082af"
+        "hash": "cec8e5f01c8d00c246a12fabb43713a60da510f50c3d548f703f664936373096"
       }
     },
     {
@@ -4739,7 +4739,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4c6f94f5a26fc102a09abba066329d25d63d90f3312b0233a49a99124681a2c2"
+        "hash": "732b6077bcba350f004edeac5667d0d6d8403b2798e0860e5cd3d5a0c4578339"
       }
     },
     {
@@ -4754,7 +4754,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e734ca2c62a5a59b69379b0b6ef38d916f9554c0c9dc4341ff64e34f66e8fa0c"
+        "hash": "16729b1197484dd3a2b1ea4c860f297f5318e1d34831f8cb4f548d1486f51aca"
       }
     },
     {
@@ -4768,7 +4768,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "ba5dee3a521239141017caa48cd332c905a674034b6b533c1c8d4e8dabaf1df2"
+        "hash": "dbd21f42d2200f504459f4ce7d1b39e31be3a30373b4ce4feec5afa2c85b7ef7"
       }
     },
     {
@@ -4783,7 +4783,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "2fc5ed2400dea5b93cdf9dd1972bf8b8d0231c9b1ae298ec03f745c6c566a691"
+        "hash": "fe3339dc49a247dabaa0ceca106f1393ea9731c05265f5cb45d5a3f0de09c7ae"
       }
     },
     {
@@ -4799,7 +4799,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "938156c9c01f7c8c74ad42b0ece2e6eb6410703087456bfe4ab2fe09aeb8d25d"
+        "hash": "cc0aa77cc2be8e663f52513e8dd2e5926a7d71dbda37967fdb50c223c3a0a5f9"
       }
     },
     {
@@ -4815,7 +4815,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "39fce8487764a7d52c559693609125008c36577db2fd99441935df862156b48a"
+        "hash": "f43ad3f7f82d15a02cacb2b93c6324c64b55de1c630398ae501ff9b65bd9cb35"
       }
     },
     {
@@ -4831,7 +4831,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d14ea2a4e10db39f93430d5bc17f4524898488c59fbcbfcecff57c46d36d277e"
+        "hash": "119c813d32e4aa4faed7a497cbf1806e98da0f7c9090656ae02297fe9224b6a1"
       }
     },
     {
@@ -4846,7 +4846,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7123c105b911ef6292d48bedbd0cd80d594df41ce745346c1c8dccdaac76c151"
+        "hash": "8fb993b0cf78fa83a170aca132bf5eb13430e2cef5ae06f85b9763f286bb792c"
       }
     },
     {
@@ -4860,7 +4860,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "d106e35355d7f98ecbaff8f935a9c7d27b31f5c9fa062ab62cdf3bed57bc2890"
+        "hash": "4c3fb917581972b732dbf8a998c377df247721790afa904956420d0e75b3b40a"
       }
     },
     {
@@ -4874,7 +4874,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e57dabd910cdfce6f948f00542a2f2a6a47c1a2c5ad6c8482b5c6945be31e293"
+        "hash": "3482e1802a239290ac1170fc1dcb57a2b1197877444c9cca8d6be60c96412e32"
       }
     },
     {
@@ -4889,7 +4889,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7d876a51aa2dea887594ad07ac87e68fad8db83cc7fe86aa5d7c553f494a9f65"
+        "hash": "3e68caecbfce1d15160a60993a3270793a1573bda3c71a82fc0086fe48b17a0a"
       }
     },
     {
@@ -4904,7 +4904,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "e6a53f3ba53df9e740fe88e0a9dc1b51160cebad901cca96babc601e6c19a320"
+        "hash": "e6d1da6add041592649c4c054de54a35516a8100d9bf8a4209ee0aa7e88f4550"
       }
     },
     {
@@ -4919,7 +4919,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "60e89489f96442e8b9094b70188f4cfbd37564efcee09ef9a82ecceacd2af815"
+        "hash": "86e7f2674d08de8520abe029aa6be760449367102a6578bb8efd9703508c63a2"
       }
     },
     {
@@ -4933,7 +4933,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "0d8644bb092295e54744ecf56cab6b7da495f03376c6339e47bfc3045befb681"
+        "hash": "66cedb84131bd3704fc8dc3f9a8692d7a08a990ae749ff8cff688ced18239126"
       }
     },
     {
@@ -4948,7 +4948,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "319b81dff475910008f9902ae8ffd64921a6b9fa13b84b03a42cfc6c45bb636d"
+        "hash": "75f51c079a3b129de5ff1ca656422126cae7e4ded12a74038a0453efa0bfab96"
       }
     },
     {
@@ -4963,7 +4963,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "7cb99869abe8e7ff857b7876fd00cb9ebad3d97b0262845365ed7f75350c10e7"
+        "hash": "c30a9938878dbc4f535c16d16c59e0a7c09643164332f7790345f95557b44303"
       }
     },
     {
@@ -4974,7 +4974,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "6d7326f2e5c78b2817a5bfe03d3e48af4426fdc4d04f7e3604368b84c854df51"
+        "hash": "1ec820569490b17af8315133226e1545efb1d842e4dada922c88126c342a2132"
       }
     },
     {
@@ -4985,7 +4985,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "b300cd6f0789d2a6e66d27acad45435287eff0baa645406b23397b434a730de7"
+        "hash": "8289007c7b10777d68d346e0ef02a58a44472cee41d5fb2f3bafaec4f1dd148b"
       }
     },
     {
@@ -4996,7 +4996,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "66cf60e71546519e93d751ce363a10f755997faa792394e84e9f60c56d843f24"
+        "hash": "ec33abb9423c49520400becb5183d87b37bbf6eb60012673c8df5a0a672a6af0"
       }
     },
     {
@@ -5007,7 +5007,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "df0a454dda6ddcb7eba46db54ed886f2f7bfbf71560aa401ea41249b64107a2a"
+        "hash": "650c91d557244ee0e3f64a00d457d63b47271aa0b963728bfc37dc5c3c88c67e"
       }
     },
     {
@@ -5018,7 +5018,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "18385086893ea0a1374288df5111493894047a9c72b12be4bba515da2b4e5dd0"
+        "hash": "333c7a72864d3249f1f409dee1f23214ec47701a54d561a69078e0092137fa4c"
       }
     },
     {
@@ -5029,7 +5029,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "fa177ca9bbfa710d76d72e60fa358a02ed5876e9f0996ef04947a3274a3b30bd"
+        "hash": "e0056bb031e8df0565daddb6200df1fa9675e2c538e71f354ceeeee164c2b8a9"
       }
     },
     {
@@ -5040,7 +5040,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "266ed1a67c5016ee80aa293181de33bda78aa4b07f80154408114032949d070c"
+        "hash": "89d58eda3d03f8fc8d2fe61fb36376f92a0443435552d063d4fbf5b623fc4314"
       }
     },
     {
@@ -5051,7 +5051,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "a905797a88f8f9a83aeee8150e13da9c0ea1d7ad80291a1e85d2dab7f374956b"
+        "hash": "d93d0af81aeca41981ed58548672652f9c5ca4b2a6bb887c2c7e0595112dd035"
       }
     },
     {
@@ -5062,7 +5062,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "6974e513b0ad03399cf580ba25dd83300a5a23ee8e33c77bbfb4b4144be405d3"
+        "hash": "9de50bed5b8c247176570f743c8154a5ec4093432f8a09ba91c423d78af47169"
       }
     },
     {
@@ -5073,7 +5073,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "e712f8b19919f33e188272490c2f57cc87453f6153c8e768cc2dc41c7f0422e8"
+        "hash": "594721a84a8fe31c32482e9f475f5126b7cf499462d9408b3cfaee2021a96a30"
       }
     },
     {
@@ -5084,7 +5084,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "91cc5a7f2f61b5f5245e385e4f18012a274ee79a955cc970d957be4e774ca9d4"
+        "hash": "41f76138f7e673020c6eecd592baea18016869d7d0161edd9d7669f3a991c398"
       }
     },
     {
@@ -5095,7 +5095,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "aee45d11de7013fa418f08a174b35d2b4004f022951b646b7b0fa9fffc14fbc4"
+        "hash": "0b543697856c3c91e3e0a58d3928d743dbe8a369e7263fbc9806aedf487ff723"
       }
     },
     {
@@ -5106,7 +5106,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "b6488d7a3d127ca002f24da8d45c2f5fe0e097f505aa4f77450e56062321af9e"
+        "hash": "59572ee267c7f0bc7c4e411ebde24834a2f5e8e928e2e50c16ac787034b1a53a"
       }
     },
     {
@@ -5117,7 +5117,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "58775e2141232e9e0fe9b57248561dc3171c89e027ad3bf423c90656aedb3f0b"
+        "hash": "28a3c44cfc4ec7d34e00b2866b67bff9b3fb100f6f72c767b893159b869fd8f4"
       }
     },
     {
@@ -5128,7 +5128,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "6c7ad3b71e49012e12d07a9183aeba6ee7c7b800ed7a20550777d90bb64b92f7"
+        "hash": "7a3643ea48d34cc34e33f256cb41ca6a8ad1b8a8830ba2ed3e2354aea3a7bb52"
       }
     },
     {
@@ -5139,7 +5139,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "a1b8e5a615907cb7603fb6079d31a4182d8dbfa2479a2b55f48669515442a1a9"
+        "hash": "eb80d886a67c11c9395bcb414beb1e684c875b1318025609b7e12c44a58d99e9"
       }
     },
     {
@@ -5150,7 +5150,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "5d1569be30b8c4008f3012f4eae220cc8bb81b0249bcf3ce4ce84f32d0327b9e"
+        "hash": "eb96ed6f8063723296da25db7282ad732b35c21cfef2bb1424068ff6a789311c"
       }
     },
     {
@@ -5161,7 +5161,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "3ed000d3ef2f14d922dcaa172363e6627d22b2fff480a93549b51089098486b4"
+        "hash": "3cc34a842404de0aea2752a6b1398b8a0825cb1a359ff36ab5275f7d15eff107"
       }
     },
     {
@@ -5172,7 +5172,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "14576a85e48e41a6ad28320b9b62cf828337b0eebfd8cd832e058f7571a4b191"
+        "hash": "174fc1687b3d809f2984e6e7e3e73af321c2bc0030ab1c05c1b1e2a817664e95"
       }
     },
     {
@@ -5183,7 +5183,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "90ec0e513ee0b3f81877b56fc0f0d2f4ecab60ab6145d5c43a8ef662ed095821"
+        "hash": "da9808c8ba24ab48b5407ccf48053281bf12627cbe6e24c1b820bfb1216384cb"
       }
     },
     {
@@ -5194,7 +5194,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "db13fb83fc0b26dd85af291e54659a2d3ceb0b3c2779f9563a75e12cbefabcb6"
+        "hash": "5495d306c24323a8b16d5706180208f3828b043eb07d19014774cfe7f8c5b00e"
       }
     },
     {
@@ -5205,7 +5205,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "43390a0c44f832218026a1a12537cb520ab76f7b045ef99bc74c7a4fb0e3f44c"
+        "hash": "cd05a83026c948903673c6d9482c7c1a1c4da1d53e875c60cae3719d7959f79e"
       }
     },
     {
@@ -5216,7 +5216,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "844c395b6b8d69963e1d181473e7a69bcc87f7c157f7dff402af9556c5f55abd"
+        "hash": "62de33e07d133fc89d71a5091f3f350c007fc60a681e1211ee192b2fb58a2b82"
       }
     },
     {
@@ -5227,7 +5227,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "264e780d7cd76874cc1913b545d01b6e22e98fcad78a5d82fe3c107c6310a5cd"
+        "hash": "89dc909e8dc0dfbfcafc60e99a3b895370fc20d1930b21717a8125db3777d6f1"
       }
     },
     {
@@ -5238,7 +5238,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "b556b1d2bb7b2dc2c42f8b7c4d63f9fb80a6685ca742029f26c1575fb8aa4649"
+        "hash": "21409f3b5ea7aaa9ad0041508b14c64dcaeff234121aca148e14fe26cf8b5f93"
       }
     },
     {
@@ -5249,7 +5249,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "ce4c4ecd3fe24d838fa5c7a3d5106c393275943c2af0de53252a2e205ada5cb2"
+        "hash": "5d7d8623e504377f07ac9827eaec17c309a37aefc2346f0dd0a889f4f716f499"
       }
     }
   ],
diff --git a/snippet_data/snippets.json b/snippet_data/snippets.json
index dd8fc2ab5..601004b47 100644
--- a/snippet_data/snippets.json
+++ b/snippet_data/snippets.json
@@ -5,11 +5,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "all.md",
-        "text": "Returns `true` if the provided predicate function returns `true` for all elements in a collection, `false` otherwise.\r\n\r\nUse `Array.prototype.every()` to test if all elements in the collection return `true` based on `fn`.\r\nOmit the second argument, `fn`, to use `Boolean` as a default.",
+        "text": "Returns `true` if the provided predicate function returns `true` for all elements in a collection, `false` otherwise.\n\nUse `Array.prototype.every()` to test if all elements in the collection return `true` based on `fn`.\nOmit the second argument, `fn`, to use `Boolean` as a default.",
         "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": {
         "archived": false,
-        "hash": "d9aec5efedaa39586f2b1210394b345cb1abbb9348fad952e785badbb2d598ac"
+        "hash": "2cf407f0e2df6eb320de1906d8cb4f1d252ac189af3a390dda264e8637a44e7e"
       }
     },
     {
@@ -27,11 +27,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "allEqual.md",
-        "text": "Check if all elements in an array are equal.\r\n\r\nUse `Array.prototype.every()` to check if all the elements of the array are the same as the first one.",
+        "text": "Check if all elements in an array are equal.\n\nUse `Array.prototype.every()` to check if all the elements of the array are the same as the first one.",
         "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": {
         "archived": false,
-        "hash": "76704202f5987a78625746ef4f2ca5650a8d87b10252b06b60c5d39cd26a7335"
+        "hash": "690147b9d4d90d37d9f42ec6596decc3e99eb8104f51d27a392ee3b50041878e"
       }
     },
     {
@@ -49,11 +49,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "any.md",
-        "text": "Returns `true` if the provided predicate function returns `true` for at least one element in a collection, `false` otherwise.\r\n\r\nUse `Array.prototype.some()` to test if any elements in the collection return `true` based on `fn`.\r\nOmit the second argument, `fn`, to use `Boolean` as a default.",
+        "text": "Returns `true` if the provided predicate function returns `true` for at least one element in a collection, `false` otherwise.\n\nUse `Array.prototype.some()` to test if any elements in the collection return `true` based on `fn`.\nOmit the second argument, `fn`, to use `Boolean` as a default.",
         "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": {
         "archived": false,
-        "hash": "b34cb378a31ae73335f941448fe873edf9c06e10d5a1e28895275a29dd471c39"
+        "hash": "b045bd03ea755493fcab7b7092b0fb01bf8ce24b56e5605ea2d0bb037b91f11e"
       }
     },
     {
@@ -71,7 +71,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "approximatelyEqual.md",
-        "text": "Checks if two numbers are approximately equal to each other.\r\n\r\nUse `Math.abs()` to compare the absolute difference of the two values to `epsilon`.\r\nOmit the third parameter, `epsilon`, to use a default value of `0.001`.",
+        "text": "Checks if two numbers are approximately equal to each other.\n\nUse `Math.abs()` to compare the absolute difference of the two values to `epsilon`.\nOmit the third parameter, `epsilon`, to use a default value of `0.001`.",
         "codeBlocks": {
           "es6": "const approximatelyEqual = (v1, v2, epsilon = 0.001) => Math.abs(v1 - v2) < epsilon;",
           "es5": "var approximatelyEqual = function approximatelyEqual(v1, v2) {\n  var epsilon = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0.001;\n  return Math.abs(v1 - v2) < epsilon;\n};",
@@ -84,7 +84,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2b68e79d3ebb806379c3b84ae70152e033297d6e4fd4bc779b10be81ca2fc0cf"
+        "hash": "4fa8b87ac30ec67afe40c80101a702986dd1e5cab3cd8b9653f1b7c8cbac7540"
       }
     },
     {
@@ -92,11 +92,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "arrayToCSV.md",
-        "text": "Converts a 2D array to a comma-separated values (CSV) string.\r\n\r\nUse `Array.prototype.map()` and `Array.prototype.join(delimiter)` to combine individual 1D arrays (rows) into strings.\r\nUse `Array.prototype.join('\\n')` to combine all rows into a CSV string, separating each row with a newline.\r\nOmit the second argument, `delimiter`, to use a default delimiter of `,`.",
+        "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 `,`.",
         "codeBlocks": {
-          "es6": "const arrayToCSV = (arr, delimiter = ',') =>\r\n  arr.map(v => v.map(x => `\"${x}\"`).join(delimiter)).join('\\n');",
+          "es6": "const arrayToCSV = (arr, delimiter = ',') =>\n  arr.map(v => v.map(x => `\"${x}\"`).join(delimiter)).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 \"\\\"\".concat(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\"'"
+          "example": "arrayToCSV([['a', 'b'], ['c', 'd']]); // '\"a\",\"b\"\\n\"c\",\"d\"'\narrayToCSV([['a', 'b'], ['c', 'd']], ';'); // '\"a\";\"b\"\\n\"c\";\"d\"'"
         },
         "tags": [
           "array",
@@ -107,7 +107,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0ba7229cc896c4efeb982ea313166afa79aee16cbf337a643243a4f8c3a4bcd9"
+        "hash": "3508f9a15d8a0b0541d12373b8ea697773434fbfd946bb63fc4f0246e4f193ea"
       }
     },
     {
@@ -115,9 +115,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "arrayToHtmlList.md",
-        "text": "Converts the given array elements into `<li>` tags and appends them to the list of the given id.\r\n\r\nUse `Array.prototype.map()`, `document.querySelector()`, and an anonymous inner closure to create a list of html tags.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "027ae8128f3c52af07224b87baf362f0ad92e5a9847ebf426027ac3f06ab7deb"
+        "hash": "ca7374613a03d90327f8754747ec14e3234f5df975cb8744da6ead6d7d3d2a83"
       }
     },
     {
@@ -137,11 +137,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "ary.md",
-        "text": "Creates a function that accepts up to `n` arguments, ignoring any additional arguments.\r\n\r\nCall the provided function, `fn`, with up to `n` arguments, using `Array.prototype.slice(0,n)` and the spread operator (`...`).",
+        "text": "Creates a function that accepts up to `n` arguments, ignoring any additional arguments.\n\nCall the provided function, `fn`, with up to `n` arguments, using `Array.prototype.slice(0,n)` and the spread operator (`...`).",
         "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": {
         "archived": false,
-        "hash": "3822911df3a06d2a58df4f5f8733b72bb655a6b9c7c99a9ab85bf418abcf7de7"
+        "hash": "9c673d0dc5ea5d1b7c63506253c39e512127c377d349b2df1f847788e67bebf1"
       }
     },
     {
@@ -159,7 +159,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "atob.md",
-        "text": "Decodes a string of data which has been encoded using base-64 encoding.\r\n\r\nCreate a `Buffer` for the given string with base-64 encoding and use `Buffer.toString('binary')` to return the decoded string.",
+        "text": "Decodes a string of data which has been encoded using base-64 encoding.\n\nCreate a `Buffer` for the given string with base-64 encoding and use `Buffer.toString('binary')` to return the decoded string.",
         "codeBlocks": {
           "es6": "const atob = str => Buffer.from(str, 'base64').toString('binary');",
           "es5": "var atob = function atob(str) {\n  return Buffer.from(str, 'base64').toString('binary');\n};",
@@ -174,7 +174,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2b16386c3d31f0d68f1bd76034202f8927d0a126312cb20b310fc141c6e654f5"
+        "hash": "a1cdc6db4c91c17ea5f072fa38f40505a7500c1d142c33a9f7e8280fb9357fb5"
       }
     },
     {
@@ -182,11 +182,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "attempt.md",
-        "text": "Attempts to invoke a function with the provided arguments, returning either the result or the caught error object.\r\n\r\nUse a `try... catch` block to return either the result of the function or an appropriate error.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "27131b8fc8afb7f3140b85981747c0dd6106b5a8bb54ccd43d542e4245f934de"
+        "hash": "ac8ac4dc2ac7d0e2de1cf9f6afff46350aa530a51275658e8b34072740d10b0f"
       }
     },
     {
@@ -203,11 +203,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "average.md",
-        "text": "Returns the average of two or more numbers.\r\n\r\nUse `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`, divide by the `length` of the array.",
+        "text": "Returns the average of two or more numbers.\n\nUse `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`, divide by the `length` of the array.",
         "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": {
         "archived": false,
-        "hash": "5547ee57c7a19624435c01594130bfe6c1613b637fa0810aca6856e5bccda95a"
+        "hash": "1275c6ed1d6ac5e1218831c45cdff88de135f803f45cdbb68dbbad0fbb55e967"
       }
     },
     {
@@ -225,11 +225,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "averageBy.md",
-        "text": "Returns the average of an array, after mapping each element to a value using the provided function.\r\n\r\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.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "3896ad3ab0120ba12943877f33fdd1e48d7887f7c69bea7310517aac56020502"
+        "hash": "58c2e46ed0bf8dfb7c3d36c280dff4a64ff056fc1a01b0972db8c81733d8c5dc"
       }
     },
     {
@@ -248,9 +248,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Array.prototype.reduce()` and `Array.prototype.push()` to add elements to groups, based on `filter`.",
+        "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`.",
         "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": {
         "archived": false,
-        "hash": "b869b8c45f39e8f6cceb8478f2e4ae2248a46c6cc2c39d112868f8e235a6d936"
+        "hash": "5f32ce21c3b3ef31d3281c0700eaca0761742fda556be7002596020947fd37a5"
       }
     },
     {
@@ -269,9 +269,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Array.prototype.reduce()` and `Array.prototype.push()` to add elements to groups, based on the value returned by `fn` for each element.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "b0a461c6da6f561d7a9fcb373adb622692480cc36650145d6d8f94e126f0f849"
+        "hash": "e09263bc0fa973e3e2435dfd61a764c0af080b73882f6c32b3534a5c4387fc43"
       }
     },
     {
@@ -291,11 +291,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "bind.md",
-        "text": "Creates a function that invokes `fn` with a given context, optionally adding any additional supplied parameters to the beginning of the arguments.\r\n\r\nReturn a `function` that uses `Function.prototype.apply()` to apply the given `context` to `fn`.\r\nUse `Array.prototype.concat()` to prepend any additional supplied parameters to the arguments.",
+        "text": "Creates a function that invokes `fn` with a given context, optionally adding any additional supplied parameters to the beginning of the arguments.\n\nReturn a `function` that uses `Function.prototype.apply()` to apply the given `context` to `fn`.\nUse `Array.prototype.concat()` to prepend any additional supplied parameters to the arguments.",
         "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, boundArgs.concat(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": {
         "archived": false,
-        "hash": "d0bc023d8258b2cc336d66f27ec01986488ef2d8d2fd030491e47dae63900a6f"
+        "hash": "8ffda25a0268a6f772c6912d370248c9329561c1ce1ea941e0622136459f7ef5"
       }
     },
     {
@@ -313,11 +313,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "bindAll.md",
-        "text": "Binds methods of an object to the object itself, overwriting the existing method.\r\n\r\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.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "1c10caabd13b779a41850342f76585848c645c36950d3f068f373a53f3ee1f6f"
+        "hash": "3a8deee8bdc80c3df541ee5a9c31591af4c451362c2d86344ae4c937a04b2d12"
       }
     },
     {
@@ -335,11 +335,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nReturn a `function` that uses `Function.prototype.apply()` to bind `context[fn]` to `context`.\r\nUse the spread operator (`...`) to prepend any additional supplied parameters to the arguments.",
+        "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.",
         "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, boundArgs.concat(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": {
         "archived": false,
-        "hash": "12681c9545cf304d7b507938150f48a33d321e2b0338d965aadd3bf0165a5ae3"
+        "hash": "28b9b15af52a4abd2caaba94c5ceeea765ec89982122104cf5dc111c3f56383f"
       }
     },
     {
@@ -357,9 +357,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "binomialCoefficient.md",
-        "text": "Evaluates the binomial coefficient of two integers `n` and `k`.\r\n\r\nUse `Number.isNaN()` to check if any of the two values is `NaN`.\r\nCheck if `k` is less than `0`, greater than or equal to `n`, equal to `1` or `n - 1` and return the appropriate result.\r\nCheck if `n - k` is less than `k` and switch their values accordingly.\r\nLoop from `2` through `k` and calculate the binomial coefficient.\r\nUse `Math.round()` to account for rounding errors in the calculation.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "66414040b3a4dfca8312e0c0d4b276ded342b18abd9a14a0a90cec2983bc0b7c"
+        "hash": "0fca1b134c1a13fef45cde62e8f04c70361b477be88222aa7d81ac5d153b3a13"
       }
     },
     {
@@ -378,9 +378,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "bottomVisible.md",
-        "text": "Returns `true` if the bottom of the page is visible, `false` otherwise.\r\n\r\nUse `scrollY`, `scrollHeight` and `clientHeight` to determine if the bottom of the page is visible.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "d4e645f834e7eb763b85bc99289c983f9e1d4314257701c94cea84ac8806ca3d"
+        "hash": "a40dc0094d62d44e7d086513bca6afb74734dd1e5e56a0ce66e91517b459f50c"
       }
     },
     {
@@ -399,7 +399,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "btoa.md",
-        "text": "Creates a base-64 encoded ASCII string from a String object in which each character in the string is treated as a byte of binary data.\r\n\r\nCreate a `Buffer` for the given string with binary encoding and use `Buffer.toString('base64')` to return the encoded string.",
+        "text": "Creates a base-64 encoded ASCII string from a String object in which each character in the string is treated as a byte of binary data.\n\nCreate a `Buffer` for the given string with binary encoding and use `Buffer.toString('base64')` to return the encoded string.",
         "codeBlocks": {
           "es6": "const btoa = str => Buffer.from(str, 'binary').toString('base64');",
           "es5": "var btoa = function btoa(str) {\n  return Buffer.from(str, 'binary').toString('base64');\n};",
@@ -414,7 +414,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "24ca94284f2c3d83ed2ae5ea5c185b6dd84417ad7e0effb047c32847825d6550"
+        "hash": "021ec24497f79ba1e18b01f1fc5a7498d21adbb4f556ac026afa817f10d46ae9"
       }
     },
     {
@@ -422,11 +422,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "byteSize.md",
-        "text": "Returns the length of a string in bytes.\r\n\r\nConvert a given string to a [`Blob` Object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) and find its `size`.",
+        "text": "Returns the length of a string in bytes.\n\nConvert a given string to a [`Blob` Object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) and find its `size`.",
         "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": {
         "archived": false,
-        "hash": "8608c5658af598504bc2e20d329c674cd989540907598e372c75241179cff029"
+        "hash": "5a7936489c66b541e2e1caf4254540a75557e049d1a10c7da0b38bd3b247f00b"
       }
     },
     {
@@ -465,11 +465,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "capitalize.md",
-        "text": "Capitalizes the first letter of a string.\r\n\r\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.\r\nOmit the `lowerRest` parameter to keep the rest of the string intact, or set it to `true` to convert to lowercase.",
+        "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.",
         "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": {
         "archived": false,
-        "hash": "c1e2fa38cb32a0c6aeb5fdd61116095a2f131e0471d904cd0272892356a0b968"
+        "hash": "b9e5abf13f56d58cb8d7abe800d90956a6b4d1954ac81b08f671ce994319dff6"
       }
     },
     {
@@ -487,7 +487,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "capitalizeEveryWord.md",
-        "text": "Capitalizes the first letter of every word in a string.\r\n\r\nUse `String.prototype.replace()` to match the first character of each word and `String.prototype.toUpperCase()` to capitalize it.",
+        "text": "Capitalizes the first letter of every word in a string.\n\nUse `String.prototype.replace()` to match the first character of each word and `String.prototype.toUpperCase()` to capitalize it.",
         "codeBlocks": {
           "es6": "const capitalizeEveryWord = str => str.replace(/\\b[a-z]/g, char => char.toUpperCase());",
           "es5": "var capitalizeEveryWord = function capitalizeEveryWord(str) {\n  return str.replace(/\\b[a-z]/g, function (char) {\n    return char.toUpperCase();\n  });\n};",
@@ -501,7 +501,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "060d09969ecbc08a609e546c9dd30c984d840f44fd55d2cc6d1d31263e4c8d56"
+        "hash": "4ebf63ac48859f5011de39740d2650f7929257c9d1d468d1789e45f6a33b577e"
       }
     },
     {
@@ -509,11 +509,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "castArray.md",
-        "text": "Casts the provided value as an array if it's not one.\r\n\r\nUse `Array.prototype.isArray()` to determine if `val` is an array and return it as-is or encapsulated in an array accordingly.",
+        "text": "Casts the provided value as an array if it's not one.\n\nUse `Array.prototype.isArray()` to determine if `val` is an array and return it as-is or encapsulated in an array accordingly.",
         "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": {
         "archived": false,
-        "hash": "6fef4b839b04d3df22e1b9b34215f5d3a93edab0a7eb0b88dca291a427df04a0"
+        "hash": "a6add43aea896ec237dfada48cfe67edab4b111e290472da8ff2c0ece70f2320"
       }
     },
     {
@@ -532,11 +532,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "chainAsync.md",
-        "text": "Chains asynchronous functions.\r\n\r\nLoop through an array of functions containing asynchronous events, calling `next` when each asynchronous event has completed.",
+        "text": "Chains asynchronous functions.\n\nLoop through an array of functions containing asynchronous events, calling `next` when each asynchronous event has completed.",
         "codeBlocks": {
-          "es6": "const chainAsync = fns => {\r\n  let curr = 0;\r\n  const next = () => fns[curr++](next);\r\n  next();\r\n};",
+          "es6": "const chainAsync = fns => {\n  let curr = 0;\n  const next = () => fns[curr++](next);\n  next();\n};",
           "es5": "var chainAsync = function chainAsync(fns) {\n  var curr = 0;\n\n  var next = function next() {\n    return fns[curr++](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  }\r\n]);"
+          "example": "chainAsync([\n  next => {\n    console.log('0 seconds');\n    setTimeout(next, 1000);\n  },\n  next => {\n    console.log('1 second');\n  }\n]);"
         },
         "tags": [
           "function",
@@ -545,7 +545,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8b6d33fba612cac3b4e97a42fc7bfaa5b52fc96a47d6e580528f6aeae789606d"
+        "hash": "8c245a7fc94edffaf5cae4c28f37ed2e989772a9663a5f5bce98147f708a712e"
       }
     },
     {
@@ -553,9 +553,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "chunk.md",
-        "text": "Chunks an array into smaller arrays of a specified size.\r\n\r\nUse `Array.from()` to create a new array, that fits the number of chunks that will be produced.\r\nUse `Array.prototype.slice()` to map each element of the new array to a chunk the length of `size`.\r\nIf the original array can't be split evenly, the final chunk will contain the remaining elements.",
+        "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.",
         "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]]"
         },
@@ -566,7 +566,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8bcbcf5500940d591c2d1497a04964ec04b35730833742353cfbd27a992fecd0"
+        "hash": "c9c64e0f8c0ec964e32434d873b28d0803a60737eceb19c67ab86edb3f352d48"
       }
     },
     {
@@ -574,11 +574,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "clampNumber.md",
-        "text": "Clamps `num` within the inclusive range specified by the boundary values `a` and `b`.\r\n\r\nIf `num` falls within the range, return `num`.\r\nOtherwise, return the nearest number in the range.",
+        "text": "Clamps `num` within the inclusive range specified by the boundary values `a` and `b`.\n\nIf `num` falls within the range, return `num`.\nOtherwise, return the nearest number in the range.",
         "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",
@@ -587,7 +587,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a3eca18648e657fc0277f4b00d2a51cf7c4bf03eb695fc6ce9e4cad64e569490"
+        "hash": "8e63c143d08d73cae1038ca8c6622ddf728b661528b246b55d6eb3b1ae41fe76"
       }
     },
     {
@@ -595,11 +595,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "cloneRegExp.md",
-        "text": "Clones a regular expression.\r\n\r\nUse `new RegExp()`, `RegExp.source` and `RegExp.flags` to clone the given regular expression.",
+        "text": "Clones a regular expression.\n\nUse `new RegExp()`, `RegExp.source` and `RegExp.flags` to clone the given regular expression.",
         "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",
@@ -609,7 +609,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ee8e6e19269907273e58f0820bdbfc57022b6673453283058aedbbfc76586658"
+        "hash": "57532d74214897181db46b09dc0be86d26e9877785ec85c3acd1113d5371fa95"
       }
     },
     {
@@ -617,7 +617,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "coalesce.md",
-        "text": "Returns the first non-null/undefined argument.\r\n\r\nUse `Array.prototype.find()` to return the first non `null`/`undefined` argument.",
+        "text": "Returns the first non-null/undefined argument.\n\nUse `Array.prototype.find()` to return the first non `null`/`undefined` argument.",
         "codeBlocks": {
           "es6": "const coalesce = (...args) => args.find(_ => ![undefined, null].includes(_));",
           "es5": "var coalesce = function coalesce() {\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(function (_) {\n    return ![undefined, null].includes(_);\n  });\n};",
@@ -630,7 +630,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "29199c10609ed7d5e3e5491d7d81622de9521c2b76d2d220141f3abb97d9ee07"
+        "hash": "3928d6f7c78cb72d1fe428be6bbdd5ee3ddcdb360b999d25048f84306e521918"
       }
     },
     {
@@ -638,11 +638,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "coalesceFactory.md",
-        "text": "Returns a customized coalesce function that returns the first argument that returns `true` from the provided argument validation function.\r\n\r\nUse `Array.prototype.find()` to return the first argument that returns `true` from the provided argument validation function.",
+        "text": "Returns a customized coalesce function that returns the first argument that returns `true` from the provided argument validation function.\n\nUse `Array.prototype.find()` to return the first argument that returns `true` from the provided argument validation function.",
         "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",
@@ -651,7 +651,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "69da8c5511c6c85eec38605ad9560b021d6fc3794cb47ec963987b783f48ad2f"
+        "hash": "f6180d269df84f10e4642d5d52d442be990138b7114aef048f95eabd121c3738"
       }
     },
     {
@@ -682,11 +682,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "colorize.md",
-        "text": "Add special characters to text to print in color in the console (combined with `console.log()`).\r\n\r\nUse template literals and special characters to add the appropriate color code to the string output.\r\nFor background colors, add a special character that resets the background color at the end of the string.",
+        "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.",
         "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",
@@ -697,7 +697,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4f42f00e7d675d21829a5fcd2ab2e3fa2058d1c1b1d6850ff28f2a424364593e"
+        "hash": "30fc60a8ab8c8005f7d31b82f4386ba17caa9fed690916581b2c18fa0a125215"
       }
     },
     {
@@ -705,7 +705,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "compact.md",
-        "text": "Removes falsey values from an array.\r\n\r\nUse `Array.prototype.filter()` to filter out falsey values (`false`, `null`, `0`, `\"\"`, `undefined`, and `NaN`).",
+        "text": "Removes falsey values from an array.\n\nUse `Array.prototype.filter()` to filter out falsey values (`false`, `null`, `0`, `\"\"`, `undefined`, and `NaN`).",
         "codeBlocks": {
           "es6": "const compact = arr => arr.filter(Boolean);",
           "es5": "var compact = function compact(arr) {\n  return arr.filter(Boolean);\n};",
@@ -718,7 +718,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8215bb36c367643c3e3f9db8af00d5d5067c95704f528864182a43d393faaef0"
+        "hash": "0f631b67b8460ed99917ff1468051e1e075ef02b280838ec14ad3fede2f48c7f"
       }
     },
     {
@@ -726,11 +726,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "compose.md",
-        "text": "Performs right-to-left function composition.\r\n\r\nUse `Array.prototype.reduce()` to perform right-to-left function composition.\r\nThe last (rightmost) function can accept one or more arguments; the remaining functions must be unary.",
+        "text": "Performs right-to-left function composition.\n\nUse `Array.prototype.reduce()` to perform right-to-left function composition.\nThe last (rightmost) function can accept one or more arguments; the remaining functions must be unary.",
         "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",
@@ -739,7 +739,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d7aa6d5f12cb3d1c2dce4b16f4f96196aa26706583c994282509703735a2ce64"
+        "hash": "6e9c4e34847a623fbf069fc1d64208178e9f992c7239bc80973512174a9242ff"
       }
     },
     {
@@ -747,11 +747,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "composeRight.md",
-        "text": "Performs left-to-right function composition.\r\n\r\nUse `Array.prototype.reduce()` to perform left-to-right function composition.\r\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary.",
+        "text": "Performs left-to-right function composition.\n\nUse `Array.prototype.reduce()` to perform left-to-right function composition.\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary.",
         "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",
@@ -760,7 +760,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "08e9a82139b17ce4fcbd5c55e38fcaec116c8f81fc321339c19e0d9946941a57"
+        "hash": "6e78bb3feef4d2fab6dbfced1c5f617869ea1c9f25b909d96dcfd7619df84aeb"
       }
     },
     {
@@ -768,11 +768,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "converge.md",
-        "text": "Accepts a converging function and a list of branching functions and returns a function that applies each branching function to the arguments and the results of the branching functions are passed as arguments to the converging function.\r\n\r\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments.\r\nUse the spread operator (`...`) to call `coverger` with the results of all other functions.",
+        "text": "Accepts a converging function and a list of branching functions and returns a function that applies each branching function to the arguments and the results of the branching functions are passed as arguments to the converging function.\n\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments.\nUse the spread operator (`...`) to call `coverger` with the results of all other functions.",
         "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",
@@ -781,7 +781,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "75104822649aeb0f500d7092e0a8c68d9eca2ce9f539888a98e3ac14b7d21f17"
+        "hash": "5f363fa3bb93198f77488fc587bf8a124a04116348a81585d4b4a45b9fcb9989"
       }
     },
     {
@@ -789,9 +789,9 @@
       "type": "snippet",
       "attributes": {
         "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).\r\n\r\nCopy a string to the clipboard. \r\nOnly works as a result of user action (i.e. inside a `click` event listener).\r\n\r\nCreate a new `<textarea>` element, fill it with the supplied data and add it to the HTML document.\r\nUse `Selection.getRangeAt()`to store the selected range (if any).\r\nUse `document.execCommand('copy')` to copy to the clipboard.\r\nRemove the `<textarea>` element from the HTML document.\r\nFinally, use `Selection().addRange()` to recover the original selected range (if any).",
+        "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).",
         "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."
         },
@@ -803,7 +803,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "161045368b3aa7f1e47b38df0e0d3703190480d974787880559ea99c272f8cdc"
+        "hash": "09ef1e582db77aa67e9f8741636876f27be2b39b67494bb46905181f570fa1aa"
       }
     },
     {
@@ -811,11 +811,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "countBy.md",
-        "text": "Groups the elements of an array based on the given function and returns the count of elements in each group.\r\n\r\nUse `Array.prototype.map()` to map the values of an array to a function or property name.\r\nUse `Array.prototype.reduce()` to create an object, where the keys are produced from the mapped results.",
+        "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.",
         "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",
@@ -825,7 +825,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "189bcc5b973aac951739b98e717736a57f7f716ffacfa19dc27e46df7b8766db"
+        "hash": "cab7fc0cdd2b41758fb18e17986b0e3cc2b17a5ab79014530c9134a41ada9469"
       }
     },
     {
@@ -833,9 +833,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "counter.md",
-        "text": "Creates a counter with the specified range, step and duration for the specified selector.\r\n\r\nCheck if `step` has the proper sign and change it accordingly.\r\nUse `setInterval()` in combination with `Math.abs()` and `Math.floor()` to calculate the time between each new text draw.\r\nUse `document.querySelector().innerHTML` to update the value of the selected element.\r\nOmit the fourth parameter, `step`, to use a default step of `1`.\r\nOmit the fifth parameter, `duration`, to use a default duration of `2000`ms.",
+        "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.",
         "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\""
         },
@@ -846,7 +846,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "654b93b073e0ea2d1688a50e45ace9c2566e596a6d17f3134461fcd30e6f7b5d"
+        "hash": "5bf0c865aba5b748d185b9415c3b66ed61c77a0c5c052d44cfb745661f9a5802"
       }
     },
     {
@@ -854,7 +854,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "countOccurrences.md",
-        "text": "Counts the occurrences of a value in an array.\r\n\r\nUse `Array.prototype.reduce()` to increment a counter each time you encounter the specific value inside the array.",
+        "text": "Counts the occurrences of a value in an array.\n\nUse `Array.prototype.reduce()` to increment a counter each time you encounter the specific value inside the array.",
         "codeBlocks": {
           "es6": "const countOccurrences = (arr, val) => arr.reduce((a, v) => (v === val ? a + 1 : a), 0);",
           "es5": "var countOccurrences = function countOccurrences(arr, val) {\n  return arr.reduce(function (a, v) {\n    return v === val ? a + 1 : a;\n  }, 0);\n};",
@@ -867,7 +867,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9a16e15ae31b0f92a48693d0cc2e805dae6df196d7b8157945b43474131979c3"
+        "hash": "f4471dcfb3a53fe8fd2f9e5566d5cf028aa69f4ddba69d6b5acd94c6e6aee133"
       }
     },
     {
@@ -875,11 +875,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "createElement.md",
-        "text": "Creates an element from a string (without appending it to the document). \r\nIf the given string contains multiple elements, only the first one will be returned.\r\n\r\nUse `document.createElement()` to create a new element.\r\nSet its `innerHTML` to the string supplied as the argument. \r\nUse `ParentNode.firstElementChild` to return the element version of the string.",
+        "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.",
         "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",
@@ -889,7 +889,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c700b4d0695f1916842fa8b2b68e63a3735b9b87681e54addb23e92c6404a5f5"
+        "hash": "90ce0d4ef6e6fece19d008d21e0201864dafbe48a62dbc7226f31f4b9c834090"
       }
     },
     {
@@ -897,11 +897,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Object.create(null)` to create an empty `hub` object that does not inherit properties from `Object.prototype`.\r\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.\r\nFor `on`, create an array for the event if it does not yet exist, then use `Array.prototype.push()` to add the handler\r\nto the array.\r\nFor `off`, use `Array.prototype.findIndex()` to find the index of the handler in the event array and remove it using `Array.prototype.splice()`.",
+        "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()`.",
         "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  }\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  }\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    }\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",
@@ -911,7 +911,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "367f1dfe6e5b3cdc1f65075caf615f8c60d720a1115badd5f6b1f05cec049af7"
+        "hash": "02438b83d413dbd5aede2eed7381f3038c4627135b63130ffdca48fdb6fbbc91"
       }
     },
     {
@@ -919,11 +919,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "CSVToArray.md",
-        "text": "Converts a comma-separated values (CSV) string to a 2D array.\r\n\r\nUse `Array.prototype.slice()` and `Array.prototype.indexOf('\\n')` to remove the first row (title row) if `omitFirstRow` is `true`.\r\nUse `String.prototype.split('\\n')` to create a string for each row, then `String.prototype.split(delimiter)` to separate the values in each row.\r\nOmit the second argument, `delimiter`, to use a default delimiter of `,`.\r\nOmit the third argument, `omitFirstRow`, to include the first row (title row) of the CSV string.",
+        "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.",
         "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",
@@ -934,7 +934,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "adb3e42ef8c3a6ad09cd8255728e537d0ae643c59e285da001488695ab156649"
+        "hash": "c48af79621162e51752aaa5f4a672eda54d60de68cc8ba0b0f6df5cea73b1314"
       }
     },
     {
@@ -942,11 +942,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "CSVToJSON.md",
-        "text": "Converts a comma-separated values (CSV) string to a 2D array of objects.\r\nThe first row of the string is used as the title row.\r\n\r\nUse `Array.prototype.slice()` and `Array.prototype.indexOf('\\n')` and `String.prototype.split(delimiter)` to separate the first row (title row) into values.\r\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.\r\nUse `Array.prototype.reduce()` to create an object for each row's values, with the keys parsed from the title row.\r\nOmit the second argument, `delimiter`, to use a default delimiter of `,`.",
+        "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 `,`.",
         "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",
@@ -957,7 +957,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b381c586300a954da065c82a0985ce2bb60fed1aeeff4b17ba908e96e412801b"
+        "hash": "5559217e1be7deb18edbfac311d772041fa7db09e1087551dcdfa945ef855f6a"
       }
     },
     {
@@ -965,7 +965,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "currentURL.md",
-        "text": "Returns the current URL.\r\n\r\nUse `window.location.href` to get current URL.",
+        "text": "Returns the current URL.\n\nUse `window.location.href` to get current URL.",
         "codeBlocks": {
           "es6": "const currentURL = () => window.location.href;",
           "es5": "var currentURL = function currentURL() {\n  return window.location.href;\n};",
@@ -979,7 +979,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ff342b61fa948cb342e55016b4ec70069bef00a16adaf8744e00fbbd2568d3d7"
+        "hash": "965397215e067e73b7c7bbd8f376f5773c79bb82f370747603647b01dee09a28"
       }
     },
     {
@@ -987,11 +987,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "curry.md",
-        "text": "Curries a function.\r\n\r\nUse recursion.\r\nIf the number of provided arguments (`args`) is sufficient, call the passed function `fn`.\r\nOtherwise, return a curried function `fn` that expects the rest of the arguments.\r\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`.",
+        "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`.",
         "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",
@@ -1001,7 +1001,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "be5dd6c29e66bfdf52e21f5e4ec0bc2bf8e0ed4e7d797d3dbd03d283cfb99e8c"
+        "hash": "e3b0d5ff10d79034d6ccc448282097089b084ed71c608bc8f3468c0a8533ec14"
       }
     },
     {
@@ -1009,9 +1009,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "dayOfYear.md",
-        "text": "Gets the day of the year from a `Date` object.\r\n\r\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.\r\nUse `Math.floor()` to appropriately round the resulting day count to an integer.",
+        "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.",
         "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"
         },
@@ -1022,7 +1022,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4dcea3347738e917c8671bc34be4ef0094f8cc03a2992155a9abc511327def57"
+        "hash": "389ee2f96db160f9ab0ed4aa38c69a1eebf93d785c8baf82afe0ee84c611a57d"
       }
     },
     {
@@ -1030,11 +1030,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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.\r\nOmit the second argument, `ms`, to set the timeout at a default of 0 ms.",
+        "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.",
         "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",
@@ -1043,7 +1043,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "21be6f73f47044757d9a18e0a7028f05849a638c49b7f622c089df2c94cd61ac"
+        "hash": "d7b9e0ff472527d78c9056a20a9cae4a9068874fb2ea10bbd6d3b6b66e13796d"
       }
     },
     {
@@ -1051,11 +1051,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "decapitalize.md",
-        "text": "Decapitalizes the first letter of a string.\r\n\r\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.\r\nOmit the `upperRest` parameter to keep the rest of the string intact, or set it to `true` to convert to uppercase.",
+        "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.",
         "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",
@@ -1065,7 +1065,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "96a0f2ff883d467f0ac28bb599b1ff8632d09dc19a80d732dc0ac4ce338812d0"
+        "hash": "9a23c1de52d2ddc6a014f5ed46a904921bc361eff91f51cfd4883ada4c4125a8"
       }
     },
     {
@@ -1073,11 +1073,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "deepClone.md",
-        "text": "Creates a deep clone of an object.\r\n\r\nUse recursion.\r\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\r\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.",
+        "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.",
         "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) ? (clone.length = obj.length) && Array.from(clone) : 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) ? (clone.length = obj.length) && Array.from(clone) : 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) ? (clone.length = obj.length) && Array.from(clone) : 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",
@@ -1087,7 +1087,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "869333b93315ee8c3420df1a6c9b8f7ad21581500ceb269d3b4504ebb62eb39b"
+        "hash": "920453d0015cea2810cab4930a98143e76489460ef32d1478564c0db80a02f76"
       }
     },
     {
@@ -1095,7 +1095,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "deepFlatten.md",
-        "text": "Deep flattens an array.\r\n\r\nUse recursion.\r\nUse `Array.prototype.concat()` with an empty array (`[]`) and the spread operator (`...`) to flatten an array.\r\nRecursively flatten each element that is an array.",
+        "text": "Deep flattens an array.\n\nUse recursion.\nUse `Array.prototype.concat()` with an empty array (`[]`) and the spread operator (`...`) to flatten an array.\nRecursively flatten each element that is an array.",
         "codeBlocks": {
           "es6": "const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));",
           "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 deepFlatten = function deepFlatten(arr) {\n  var _ref;\n\n  return (_ref = []).concat.apply(_ref, _toConsumableArray(arr.map(function (v) {\n    return Array.isArray(v) ? deepFlatten(v) : v;\n  })));\n};",
@@ -1109,7 +1109,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9bf5527a1fb3a8da9c06ec158986c3c6ceb311fecc2ff42938820536991b4a67"
+        "hash": "701a5d546676f215b52c3386cde017ee68496827808e55dbeda1434ec0a2f79e"
       }
     },
     {
@@ -1117,11 +1117,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "deepFreeze.md",
-        "text": "Deep freezes an object.\r\n\r\nCalls `Object.freeze(obj)` recursively on all unfrozen properties of passed object that are `instanceof` object.",
+        "text": "Deep freezes an object.\n\nCalls `Object.freeze(obj)` recursively on all unfrozen properties of passed object that are `instanceof` object.",
         "codeBlocks": {
-          "es6": "const deepFreeze = obj =>\r\n  Object.keys(obj).forEach(\r\n    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(\n    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",
@@ -1131,7 +1131,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8058bb919f4b1013bc71001df5309e448babab469cbc082480155546e2fc802b"
+        "hash": "9cf10fcda51ff8e1d130b0efa7971549a0d0bb4c24090c5766b82c12e9958604"
       }
     },
     {
@@ -1139,7 +1139,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "defaults.md",
-        "text": "Assigns default values for all properties in an object that are `undefined`.\r\n\r\nUse `Object.assign()` to create a new empty object and copy the original one to maintain key order, use `Array.prototype.reverse()` and the spread operator `...` to combine the default values from left to right, finally use `obj` again to overwrite properties that originally had a value.",
+        "text": "Assigns default values for all properties in an object that are `undefined`.\n\nUse `Object.assign()` to create a new empty object and copy the original one to maintain key order, use `Array.prototype.reverse()` and the spread operator `...` to combine the default values from left to right, finally use `obj` again to overwrite properties that originally had a value.",
         "codeBlocks": {
           "es6": "const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj);",
           "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 defaults = function defaults(obj) {\n  for (var _len = arguments.length, defs = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    defs[_key - 1] = arguments[_key];\n  }\n\n  return Object.assign.apply(Object, [{}, obj].concat(_toConsumableArray(defs.reverse()), [obj]));\n};",
@@ -1152,7 +1152,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5af57e0dc189d20c9433c4ebb9893d6e40f3c98676e5062c802f7b22549f673b"
+        "hash": "3d09493a2600221b39194711824b21c9c3f7f04225fe91c913bbd16ed28f56cd"
       }
     },
     {
@@ -1160,11 +1160,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "defer.md",
-        "text": "Defers invoking a function until the current call stack has cleared.\r\n\r\nUse `setTimeout()` with a timeout of 1ms to add a new event to the browser event queue and allow the rendering engine to complete its work. Use the spread (`...`) operator to supply the function with an arbitrary number of arguments.",
+        "text": "Defers invoking a function until the current call stack has cleared.\n\nUse `setTimeout()` with a timeout of 1ms to add a new event to the browser event queue and allow the rendering engine to complete its work. Use the spread (`...`) operator to supply the function with an arbitrary number of arguments.",
         "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",
@@ -1173,7 +1173,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1dc86e2aa970881077f10f5947fc9c6d935fc1a36618a05e6012014304f424ef"
+        "hash": "a1ccac5c1c24abe79c129563811b536eb2cd5c27a533bd93d967afa54dcad550"
       }
     },
     {
@@ -1181,7 +1181,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "degreesToRads.md",
-        "text": "Converts an angle from degrees to radians.\r\n\r\nUse `Math.PI` and the degree to radian formula to convert the angle from degrees to radians.",
+        "text": "Converts an angle from degrees to radians.\n\nUse `Math.PI` and the degree to radian formula to convert the angle from degrees to radians.",
         "codeBlocks": {
           "es6": "const degreesToRads = deg => (deg * Math.PI) / 180.0;",
           "es5": "var degreesToRads = function degreesToRads(deg) {\n  return deg * Math.PI / 180.0;\n};",
@@ -1194,7 +1194,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4ec588f479731db926b74e3939e070e93a363713ddd8122da45d36f7c3962f87"
+        "hash": "7f34bce958e51235318edc3a1fba0acf0fa110e533f3e92f87d27e74d7c1532b"
       }
     },
     {
@@ -1202,11 +1202,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "delay.md",
-        "text": "Invokes the provided function after `wait` milliseconds.\r\n\r\nUse `setTimeout()` to delay execution of `fn`.\r\nUse the spread (`...`) operator to supply the function with an arbitrary number of arguments.",
+        "text": "Invokes the provided function after `wait` milliseconds.\n\nUse `setTimeout()` to delay execution of `fn`.\nUse the spread (`...`) operator to supply the function with an arbitrary number of arguments.",
         "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",
@@ -1215,7 +1215,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "bcfc86542ccf08bcd721e099f4db41618737a3d619052045a2ec7556e62d1322"
+        "hash": "818427da43b193ebf9f10dccd7399c405c437cc5d0040add0df40fd25e940218"
       }
     },
     {
@@ -1223,9 +1223,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "detectDeviceType.md",
-        "text": "Detects wether the website is being opened in a mobile device or a desktop/laptop.\r\n\r\nUse a regular expression to test the `navigator.userAgent` property to figure out if the device is a mobile device or a desktop/laptop.",
+        "text": "Detects wether 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.",
         "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\""
         },
@@ -1236,7 +1236,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3a62b59d3b79180758a6d0e6838edd020476d5b68f74e8fa7b54bcc1670dbc19"
+        "hash": "2262275b7adcd7d9b2dd8f31da2a3a2dbcc663584928f46131a0d273b587403b"
       }
     },
     {
@@ -1244,9 +1244,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "difference.md",
-        "text": "Returns the difference between two arrays.\r\n\r\nCreate a `Set` from `b`, then use `Array.prototype.filter()` on `a` to only keep values not contained in `b`.",
+        "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`.",
         "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]"
         },
@@ -1258,7 +1258,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8f95f4680452feb2467760a15333f67622efd772bbfa629c4b449d2e7f531a96"
+        "hash": "db6d2c9f6c8a2b2e4b4030dd1092603d4201df29530105359949b18029963b30"
       }
     },
     {
@@ -1266,11 +1266,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "differenceBy.md",
-        "text": "Returns the difference between two arrays, after applying the provided function to each array element of both.\r\n\r\nCreate a `Set` by applying `fn` to each element in `b`, then use `Array.prototype.filter()` in combination with `fn` on `a` to only keep values not contained in the previously created set.",
+        "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.filter()` in combination with `fn` on `a` to only keep values not contained in the previously created set.",
         "codeBlocks": {
-          "es6": "const differenceBy = (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 differenceBy = (a, b, fn) => {\n  const s = new Set(b.map(fn));\n  return a.filter(x => !s.has(fn(x)));\n};",
           "es5": "var differenceBy = function differenceBy(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": "differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [1.2]\r\ndifferenceBy([{ x: 2 }, { x: 1 }], [{ x: 1 }], v => v.x); // [ { x: 2 } ]"
+          "example": "differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [1.2]\ndifferenceBy([{ x: 2 }, { x: 1 }], [{ x: 1 }], v => v.x); // [ { x: 2 } ]"
         },
         "tags": [
           "array",
@@ -1280,7 +1280,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "25806197fefa0dc577f87d8011bbe5839a8af6ab82e3da16136d5896f5c7abab"
+        "hash": "92abc752f5d3a659467e3dde7a3890000f4b72d1fdfd66086092494b688506ae"
       }
     },
     {
@@ -1288,7 +1288,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "differenceWith.md",
-        "text": "Filters out all values from an array for which the comparator function does not return `true`.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` to find the appropriate values.",
+        "text": "Filters out all values from an array for which the comparator function does not return `true`.\n\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` to find the appropriate values.",
         "codeBlocks": {
           "es6": "const differenceWith = (arr, val, comp) => arr.filter(a => val.findIndex(b => comp(a, b)) === -1);",
           "es5": "var differenceWith = function differenceWith(arr, val, comp) {\n  return arr.filter(function (a) {\n    return val.findIndex(function (b) {\n      return comp(a, b);\n    }) === -1;\n  });\n};",
@@ -1302,7 +1302,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2df9a6f4e37f87aa387577de54db4b203025bc9329447065c9f7b0b792b1bc67"
+        "hash": "197971487205f39337e5fe2bbf01566944a0bfe06347b5bbc7f21e32a67d37c4"
       }
     },
     {
@@ -1310,11 +1310,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "dig.md",
-        "text": "Returns the target value in a nested JSON object, based on the given key.\r\n\r\nUse the `in` operator to check if `target` exists in `obj`.\r\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.",
+        "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.",
         "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",
@@ -1324,7 +1324,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9bbacd07c7a1d66b521b98d192f21964ab2cc33a6a62e18314d9dae5ec51a270"
+        "hash": "828a6f2f3b94cc537ef0ee30c5ebda28fff688fea65030e47d5721831bdb48ce"
       }
     },
     {
@@ -1332,7 +1332,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "digitize.md",
-        "text": "Converts a number to an array of digits.\r\n\r\nConvert the number to a string, using the spread operator (`...`) to build an array.\r\nUse `Array.prototype.map()` and `parseInt()` to transform each value to an integer.",
+        "text": "Converts a number to an array of digits.\n\nConvert the number to a string, using the spread operator (`...`) to build an array.\nUse `Array.prototype.map()` and `parseInt()` to transform each value to an integer.",
         "codeBlocks": {
           "es6": "const digitize = n => [...`${n}`].map(i => parseInt(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 digitize = function digitize(n) {\n  return _toConsumableArray(\"\".concat(n)).map(function (i) {\n    return parseInt(i);\n  });\n};",
@@ -1346,7 +1346,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "145863ea8feb1ab916e06291ed7b21a70e7cde22cf8d12fd10195648818c5f8d"
+        "hash": "306bfe9a8dc6fcedbf4dfa88b7bf2aac511556a1629ddb33f9e301c1e92b4321"
       }
     },
     {
@@ -1354,7 +1354,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "distance.md",
-        "text": "Returns the distance between two points.\r\n\r\nUse `Math.hypot()` to calculate the Euclidean distance between two points.",
+        "text": "Returns the distance between two points.\n\nUse `Math.hypot()` to calculate the Euclidean distance between two points.",
         "codeBlocks": {
           "es6": "const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0);",
           "es5": "var distance = function distance(x0, y0, x1, y1) {\n  return Math.hypot(x1 - x0, y1 - y0);\n};",
@@ -1367,7 +1367,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e10120caae62c4170bd49229b5ad6c4300b15096dc2c239482ed5d8729e48c1b"
+        "hash": "7023fa4063eaa53d06b0efd531455be981b3a14e6e0443cb9a04a639653103cc"
       }
     },
     {
@@ -1375,11 +1375,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "drop.md",
-        "text": "Returns a new array with `n` elements removed from the left.\r\n\r\nUse `Array.prototype.slice()` to slice the remove the specified number of elements from the left.",
+        "text": "Returns a new array with `n` elements removed from the left.\n\nUse `Array.prototype.slice()` to slice the remove the specified number of elements from the left.",
         "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",
@@ -1388,7 +1388,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "114bde42125816cd1a457b4e4f1288b33d0fc1abaafa18c72f5ddc6b69020681"
+        "hash": "6ab35042dbb8b16be8ea108cf5029b34ac9fb166ca331ad2ed6a52188f5b0ba3"
       }
     },
     {
@@ -1396,11 +1396,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "dropRight.md",
-        "text": "Returns a new array with `n` elements removed from the right.\r\n\r\nUse `Array.prototype.slice()` to slice the remove the specified number of elements from the right.",
+        "text": "Returns a new array with `n` elements removed from the right.\n\nUse `Array.prototype.slice()` to slice the remove the specified number of elements from the right.",
         "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",
@@ -1409,7 +1409,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "140097c693edb184424813852a93653c78fcd7a1f3b5698902a32747d93e1d97"
+        "hash": "421ed9a64e720bd3ba5969e067f94a3d0c3f515b9e8af5ed420a9bbce48d75cb"
       }
     },
     {
@@ -1417,9 +1417,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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`.\r\nReturns the remaining elements.",
+        "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.",
         "codeBlocks": {
-          "es6": "const dropRightWhile = (arr, func) => {\r\n  while (arr.length > 0 && !func(arr[arr.length - 1])) arr = arr.slice(0, -1);\r\n  return arr;\r\n};",
+          "es6": "const dropRightWhile = (arr, func) => {\n  while (arr.length > 0 && !func(arr[arr.length - 1])) arr = arr.slice(0, -1);\n  return arr;\n};",
           "es5": "var dropRightWhile = function dropRightWhile(arr, func) {\n  while (arr.length > 0 && !func(arr[arr.length - 1])) {\n    arr = arr.slice(0, -1);\n  }\n\n  return arr;\n};",
           "example": "dropRightWhile([1, 2, 3, 4], n => n < 3); // [1, 2]"
         },
@@ -1431,7 +1431,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "953b02c7436b6e08d29450e2115a8d64dcb91c2ccbde7c27ef6ee4c29a83bb93"
+        "hash": "2ae245946d7c0d704aa1bbadf43afad388c09ac5dba409439b8ea79c1d4ad944"
       }
     },
     {
@@ -1439,9 +1439,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "dropWhile.md",
-        "text": "Removes elements in an array until the passed function returns `true`. Returns the remaining elements in the array.\r\n\r\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`.\r\nReturns the remaining elements.",
+        "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.",
         "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]"
         },
@@ -1453,7 +1453,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3dae6b05d092ad5c51eff8070a8d5acd3005e5e42ec3b0e0a3943f8aefc7a073"
+        "hash": "17dd9d9ebf61759b170b90253df1d726e761adead262a1733a0192ba21cd15d1"
       }
     },
     {
@@ -1461,11 +1461,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "elementContains.md",
-        "text": "Returns `true` if the `parent` element contains the `child` element, `false` otherwise.\r\n\r\nCheck that `parent` is not the same element as `child`, use `parent.contains(child)` to check if the `parent` element contains the `child` element.",
+        "text": "Returns `true` if the `parent` element contains the `child` element, `false` otherwise.\n\nCheck that `parent` is not the same element as `child`, use `parent.contains(child)` to check if the `parent` element contains the `child` element.",
         "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",
@@ -1474,7 +1474,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3b9f6f8b8be5ddcd3a23143d9eb2a5df147c0d6945ee79ad8b79f84a1551bc36"
+        "hash": "2f2c68c3368f5658fd54cb70b6264dce87ee68b23e805a95c62d55eef1854958"
       }
     },
     {
@@ -1482,11 +1482,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "elementIsVisibleInViewport.md",
-        "text": "Returns `true` if the element specified is visible in the viewport, `false` otherwise.\r\n\r\nUse `Element.getBoundingClientRect()` and the `window.inner(Width|Height)` values\r\nto determine if a given element is visible in the viewport.\r\nOmit the second argument to determine if the element is entirely visible, or specify `true` to determine if\r\nit is partially visible.",
+        "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.",
         "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",
@@ -1495,7 +1495,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5e3460fdb78dad66100007a6d9da872c1dfc10e60d0a422106c55db7d0f48786"
+        "hash": "d38bc0cd234c57cb95db1e60c47eb11a4d89775a4694acc520a8f113d03e3a39"
       }
     },
     {
@@ -1503,11 +1503,11 @@
       "type": "snippet",
       "attributes": {
         "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\r\nof pre-ratings and returns an array containing post-ratings.\r\nThe array should be ordered from best performer to worst performer (winner -> loser).\r\n\r\nUse the exponent `**` operator and math operators to compute the expected score (chance of winning).\r\nof each opponent and compute the new rating for each.\r\nLoop through the ratings, using each permutation to compute the post-Elo rating for each player in a pairwise fashion. \r\nOmit the second argument to use the default `kFactor` of 32.",
+        "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.",
         "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",
@@ -1517,7 +1517,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1242d0263c8ed3f8722006358673fe594c21b258def4e20c148b400b8fc3e92a"
+        "hash": "905993ba8666f6b76fb806f959dad3f043e875686885fdbf2b6b0a0a080d675c"
       }
     },
     {
@@ -1525,9 +1525,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "equals.md",
-        "text": "Performs a deep comparison between two values to determine if they are equivalent.\r\n\r\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).\r\nCheck if only one value is `null` or `undefined` or if their prototypes differ.\r\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.",
+        "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.",
         "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"
         },
@@ -1540,7 +1540,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6dd8dccb7040e1a892f9616fe28133ea82967a83dba3aa20fdf4a2f9dd00e66c"
+        "hash": "7e9e7d7f802e363947ecaf97defebf01225c8a38d6ca8a4c6584e9837db6ec24"
       }
     },
     {
@@ -1548,9 +1548,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "escapeHTML.md",
-        "text": "Escapes a string for use in HTML.\r\n\r\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).",
+        "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).",
         "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;'"
         },
@@ -1563,7 +1563,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "931bf80a58491834a07b59e070e0dfa14db7faf4e7a22bb39a8df1d91878f1ba"
+        "hash": "677770bd04bba27f729ea484bfdeff66cc5f0aea6562eb6ec49feaf9339a677c"
       }
     },
     {
@@ -1571,7 +1571,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "escapeRegExp.md",
-        "text": "Escapes a string to use in a regular expression.\r\n\r\nUse `String.prototype.replace()` to escape special characters.",
+        "text": "Escapes a string to use in a regular expression.\n\nUse `String.prototype.replace()` to escape special characters.",
         "codeBlocks": {
           "es6": "const escapeRegExp = str => str.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');",
           "es5": "var escapeRegExp = function escapeRegExp(str) {\n  return str.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n};",
@@ -1585,7 +1585,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6212e5c102fb98831ae0e8f8ca55bf977ca05a56d557544006c6820949464cb8"
+        "hash": "824dc191c0c2cdc20738ba3b53ce77af5d25b3dc6662a78ff0d95609446a211e"
       }
     },
     {
@@ -1593,7 +1593,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "everyNth.md",
-        "text": "Returns every nth element in an array.\r\n\r\nUse `Array.prototype.filter()` to create a new array that contains every nth element of a given array.",
+        "text": "Returns every nth element in an array.\n\nUse `Array.prototype.filter()` to create a new array that contains every nth element of a given array.",
         "codeBlocks": {
           "es6": "const everyNth = (arr, nth) => arr.filter((e, i) => i % nth === nth - 1);",
           "es5": "var everyNth = function everyNth(arr, nth) {\n  return arr.filter(function (e, i) {\n    return i % nth === nth - 1;\n  });\n};",
@@ -1606,7 +1606,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f5b381d043f197842877fe5b5f646a58ebbfb52d9e4a74b580a912a7d89fa2a8"
+        "hash": "ed7fda7cda998a02fa4d69483826a834a795e3c5aaacabed229b76247dec6fbf"
       }
     },
     {
@@ -1614,11 +1614,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "extendHex.md",
-        "text": "Extends a 3-digit color code to a 6-digit color code.\r\n\r\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.\r\n`Array.prototype.slice()` is used to remove `#` from string start since it's added once.",
+        "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.",
         "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",
@@ -1628,7 +1628,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0d671b6661781dfdea58e916be21c17dd5212060744fefefa1684a663f323716"
+        "hash": "5eba7a884e9f26ee2bb9a51cda8e17777fc3957814a3071013f9d4f9958af102"
       }
     },
     {
@@ -1636,9 +1636,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "factorial.md",
-        "text": "Calculates the factorial of a number.\r\n\r\nUse recursion.\r\nIf `n` is less than or equal to `1`, return `1`.\r\nOtherwise, return the product of `n` and the factorial of `n - 1`.\r\nThrows an exception if `n` is a negative number.",
+        "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.",
         "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"
         },
@@ -1650,7 +1650,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "50b2980119026b898646420c2dc3cf2f394f5162f1a336cf64bc8d0244e54f26"
+        "hash": "383ed61e69b8f63ae42d0746a1995057f4f65b4af6ca7778d8f1771144802acd"
       }
     },
     {
@@ -1658,9 +1658,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "fibonacci.md",
-        "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\r\n\r\nCreate an empty array of the specific length, initializing the first two values (`0` and `1`).\r\nUse `Array.prototype.reduce()` to add values into the array, using the sum of the last two values, except for the first two.",
+        "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.",
         "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]"
         },
@@ -1672,7 +1672,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "206443c4bd7ea01153efc17b3e7bbca1256b3ca43b8291f75c425207d0e96dbd"
+        "hash": "a6d182258648783ab09e72d4c40ac9de0dd3687a3b82c27715efab34d1836e1c"
       }
     },
     {
@@ -1680,7 +1680,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "filterNonUnique.md",
-        "text": "Filters out the non-unique values in an array.\r\n\r\nUse `Array.prototype.filter()` for an array containing only the unique values.",
+        "text": "Filters out the non-unique values in an array.\n\nUse `Array.prototype.filter()` for an array containing only the unique values.",
         "codeBlocks": {
           "es6": "const filterNonUnique = arr => arr.filter(i => arr.indexOf(i) === arr.lastIndexOf(i));",
           "es5": "var filterNonUnique = function filterNonUnique(arr) {\n  return arr.filter(function (i) {\n    return arr.indexOf(i) === arr.lastIndexOf(i);\n  });\n};",
@@ -1693,7 +1693,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9e439e957249cf549d905b67b570d9ecbc040b4905b612b6bfc871956e894084"
+        "hash": "be45889694178d9cb40497b8b5e1815b836b6a069881cf83998abddc242234fc"
       }
     },
     {
@@ -1701,11 +1701,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "filterNonUniqueBy.md",
-        "text": "Filters out the non-unique values in an array, based on a provided comparator function.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.every()` for an array containing only the unique values, based on the comparator function, `fn`.\r\nThe comparator function takes four arguments: the values of the two elements being compared and their indexes.",
+        "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.",
         "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",
@@ -1715,7 +1715,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "da240b0489cb7760840cc2f2e2b4d5d46dffc5a984b1822fe327b1d9df0806c7"
+        "hash": "06a87242bde67fb030fbebf69effe858a5d30e21ca803937a533ab352d8240fc"
       }
     },
     {
@@ -1723,11 +1723,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "findKey.md",
-        "text": "Returns the first key that satisfies the provided testing function. Otherwise `undefined` is returned.\r\n\r\nUse `Object.keys(obj)` to get all the properties of the object, `Array.prototype.find()` to test the provided function for each key-value pair. The callback receives three arguments - the value, the key and the object.",
+        "text": "Returns the first key that satisfies the provided testing function. Otherwise `undefined` is returned.\n\nUse `Object.keys(obj)` to get all the properties of the object, `Array.prototype.find()` to test the provided function for each key-value pair. The callback receives three arguments - the value, the key and the object.",
         "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",
@@ -1737,7 +1737,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a4e2f98a1e3d3b1c4828350905359916e49fe85f1bdc4877358231c8d738af62"
+        "hash": "a6e1a401f74fecda3805e745a4032b6467d3c4f97d0c810b288b59f441db144d"
       }
     },
     {
@@ -1745,7 +1745,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "findLast.md",
-        "text": "Returns the last element for which the provided function returns a truthy value.\r\n\r\nUse `Array.prototype.filter()` to remove elements for which `fn` returns falsey values, `Array.prototype.pop()` to get the last one.",
+        "text": "Returns the last element for which the provided function returns a truthy value.\n\nUse `Array.prototype.filter()` to remove elements for which `fn` returns falsey values, `Array.prototype.pop()` to get the last one.",
         "codeBlocks": {
           "es6": "const findLast = (arr, fn) => arr.filter(fn).pop();",
           "es5": "var findLast = function findLast(arr, fn) {\n  return arr.filter(fn).pop();\n};",
@@ -1758,7 +1758,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f05345f5a94f2c3a81c0c522b3c8b3237e0af27fdd9c128fdbb1b8a48688afc4"
+        "hash": "d9b9b99af0ced3ae231521d4100dc5779436dbd624a2c3b9aa11a3ef9fb2edb6"
       }
     },
     {
@@ -1766,9 +1766,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "findLastIndex.md",
-        "text": "Returns the index of the last element for which the provided function returns a truthy value.\r\n\r\nUse `Array.prototype.map()` to map each element to an array with its index and value.\r\nUse `Array.prototype.filter()` to remove elements for which `fn` returns falsey values, `Array.prototype.pop()` to get the last one.",
+        "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 falsey values, `Array.prototype.pop()` to get the last one.",
         "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()[0];",
+          "es6": "const findLastIndex = (arr, fn) =>\n  arr\n    .map((val, i) => [i, val])\n    .filter(([i, val]) => fn(val, i, arr))\n    .pop()[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()[0];\n};",
           "example": "findLastIndex([1, 2, 3, 4], n => n % 2 === 1); // 2 (index of the value 3)"
         },
@@ -1780,7 +1780,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8a610d6e82ab7c37817d43c2117ebad9b2206afde6899b7dc72f7ac14302f9fb"
+        "hash": "99268ad91de24fd7c06a35e0e401603da2087fe4b3ec349d6aebe0ae89a579a8"
       }
     },
     {
@@ -1788,11 +1788,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "findLastKey.md",
-        "text": "Returns the last key that satisfies the provided testing function.\r\nOtherwise `undefined` is returned.\r\n\r\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.\r\nThe callback receives three arguments - the value, the key and the object.",
+        "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.",
         "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",
@@ -1802,7 +1802,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a5d563bc1ab4b93d549a7e1ff22af3098579f88bfea00bc7e31e7f634294f547"
+        "hash": "736507ed960071c1d5e228e2e2689f480e5dc4bb26c6822e5afac8df9b41e872"
       }
     },
     {
@@ -1810,11 +1810,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "flatten.md",
-        "text": "Flattens an array up to the specified depth.\r\n\r\nUse recursion, decrementing `depth` by 1 for each level of depth.\r\nUse `Array.prototype.reduce()` and `Array.prototype.concat()` to merge elements or arrays.\r\nBase case, for `depth` equal to `1` stops recursion.\r\nOmit the second argument, `depth` to flatten only to a depth of `1` (single flatten).",
+        "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).",
         "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",
@@ -1823,7 +1823,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "422aa422a3cd6925918cb816765a8345a7b0b7a5f877d58e3ef59ec6f9b6e7e8"
+        "hash": "986e50245ceb51d4bb3baeae10d6e4d162df5c60811f690f4a5e6b4fd36bc2fa"
       }
     },
     {
@@ -1831,9 +1831,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "flattenObject.md",
-        "text": "Flatten an object with the paths for keys.\r\n\r\nUse recursion.\r\nUse `Object.keys(obj)` combined with `Array.prototype.reduce()` to convert every leaf node to a flattened path node.\r\nIf the value of a key is an object, the function calls itself with the appropriate `prefix` to create the path using `Object.assign()`.\r\nOtherwise, it adds the appropriate prefixed key-value pair to the accumulator object.\r\nYou should always omit the second argument, `prefix`, unless you want every key to have a prefix.",
+        "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.",
         "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 }"
         },
@@ -1845,7 +1845,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c2cda36e7c2d595a1cd4ee324e58e02df5440e7dcf9bbf6cbe634f4be1cefc25"
+        "hash": "0283161af6234908ed0a3403a8e7fb2f33a576deb745f2902e622eb41584b33a"
       }
     },
     {
@@ -1875,9 +1875,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "forEachRight.md",
-        "text": "Executes a provided function once for each array element, starting from the array's last element.\r\n\r\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.",
+        "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.",
         "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'"
         },
@@ -1889,7 +1889,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "efaa9eb73bc8c25ba94f45101e0b650a35d9ffd5b8fbeb220bf918da4c0590b4"
+        "hash": "878603be104f98fed0dca2d7c06ece8c4f6906a79ed0329e60bc9964c7b035ff"
       }
     },
     {
@@ -1897,11 +1897,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "formatDuration.md",
-        "text": "Returns the human readable format of the given number of milliseconds.\r\n\r\nDivide `ms` with the appropriate values to obtain the appropriate values for `day`, `hour`, `minute`, `second` and `millisecond`.\r\nUse `Object.entries()` with `Array.prototype.filter()` to keep only non-zero values.\r\nUse `Array.prototype.map()` to create the string for each value, pluralizing appropriately.\r\nUse `String.prototype.join(', ')` to combine the values into a string.",
+        "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.",
         "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",
@@ -1913,7 +1913,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "68ab69ced2c344d8f029c9de961f1ca5bb6e04433ecc85b24ae567c25beb2ced"
+        "hash": "72c557bd9def493e3a138705f5cb66f993228bd7e51b11fa84f85841bc035524"
       }
     },
     {
@@ -1921,7 +1921,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "forOwn.md",
-        "text": "Iterates over all own properties of an object, running a callback for each one.\r\n\r\nUse `Object.keys(obj)` to get all the properties of the object, `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.",
+        "text": "Iterates over all own properties of an object, running a callback for each one.\n\nUse `Object.keys(obj)` to get all the properties of the object, `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.",
         "codeBlocks": {
           "es6": "const forOwn = (obj, fn) => Object.keys(obj).forEach(key => fn(obj[key], key, obj));",
           "es5": "var forOwn = function forOwn(obj, fn) {\n  return Object.keys(obj).forEach(function (key) {\n    return fn(obj[key], key, obj);\n  });\n};",
@@ -1934,7 +1934,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b0d4959736817ca83264900b606e7ecca1e37b104765f6b71d4d289927e9178e"
+        "hash": "eaaf3b173bbc54d7e83464bc8c96bc9e48a21bcffe606b05134aec2cf0191995"
       }
     },
     {
@@ -1942,9 +1942,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "forOwnRight.md",
-        "text": "Iterates over all own properties of an object in reverse, running a callback for each one.\r\n\r\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.",
+        "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.",
         "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'"
         },
@@ -1955,7 +1955,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "313498edf714166fe504bb214dcda25737ba53b1172fef939de4dcf3404fc257"
+        "hash": "ed80f090fa9c7f999c3a2a296ab6c5bc66d53de16af625ca49455ad00200312d"
       }
     },
     {
@@ -1963,11 +1963,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "fromCamelCase.md",
-        "text": "Converts a string from camelcase.\r\n\r\nUse `String.prototype.replace()` to remove underscores, hyphens, and spaces and convert words to camelcase.\r\nOmit the second argument to use a default `separator` of `_`.",
+        "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 `_`.",
         "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",
@@ -1976,7 +1976,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8de124b684994279d28abd5ac146ccaf7d71b6c0dd774fb8f5b071622177b366"
+        "hash": "2093c36c482cf2a34c6c3b095fc6c18dc22693138d66d7527a0fe570156106b8"
       }
     },
     {
@@ -1984,7 +1984,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "functionName.md",
-        "text": "Logs the name of a function.\r\n\r\nUse `console.debug()` and the `name` property of the passed method to log the method's name to the `debug` channel of the console.",
+        "text": "Logs the name of a function.\n\nUse `console.debug()` and the `name` property of the passed method to log the method's name to the `debug` channel of the console.",
         "codeBlocks": {
           "es6": "const functionName = fn => (console.debug(fn.name), fn);",
           "es5": "var functionName = function functionName(fn) {\n  return console.debug(fn.name), fn;\n};",
@@ -1998,7 +1998,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f349bb299f8ed9c30fc4a0782f78488b08efd98d2d81dc93591e20c01c4eae5b"
+        "hash": "66e540b754a02d3deba942aa9854d1051ec54c81f22e0dea859c5d3305b89fec"
       }
     },
     {
@@ -2006,11 +2006,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "functions.md",
-        "text": "Returns an array of function property names from own (and optionally inherited) enumerable properties of an object.\r\n\r\nUse `Object.keys(obj)` to iterate over the object's own properties.\r\nIf `inherited` is `true`, use `Object.get.PrototypeOf(obj)` to also get the object's inherited properties.\r\nUse `Array.prototype.filter()` to keep only those properties that are functions.\r\nOmit the second argument, `inherited`, to not include inherited properties by default.",
+        "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.",
         "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 ? _toConsumableArray(Object.keys(obj)).concat(_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",
@@ -2020,7 +2020,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "30fbe8a31c99617e3bcae84b190c669f4064fdbe2a314bdabaa7aeb22b677b7e"
+        "hash": "61abf38f71e57dad7cf5abef9d19950014819f3775371caab92f4433a07d07de"
       }
     },
     {
@@ -2028,11 +2028,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "gcd.md",
-        "text": "Calculates the greatest common divisor between two or more numbers/arrays.\r\n\r\nThe inner `_gcd` function uses recursion.\r\nBase case is when `y` equals `0`. In this case, return `x`.\r\nOtherwise, return the GCD of `y` and the remainder of the division `x/y`.",
+        "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`.",
         "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 arr.concat().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",
@@ -2042,7 +2042,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a089cfa14c8316d2604567eeabb660394eaa447b3b55f8877d2bffd0e74ba8e8"
+        "hash": "1e35c8e3f0346e387fd97c25ecd0560270860bae65cc4a2d333b949f8187fa92"
       }
     },
     {
@@ -2050,11 +2050,11 @@
       "type": "snippet",
       "attributes": {
         "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`.\r\nReturns an error if `step` equals `1`.\r\n\r\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.\r\nOmit the second argument, `start`, to use a default value of `1`.\r\nOmit the third argument, `step`, to use a default value of `2`.",
+        "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`.",
         "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",
@@ -2063,7 +2063,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1bc034bd0cfdadfaa7b8f17d28436fd735be7986d10d5e4d066c15cb2abfb350"
+        "hash": "6041519112ff2d31db7b7076bc472cdcdfac0f293f2616b1af53f02313e46938"
       }
     },
     {
@@ -2071,11 +2071,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "get.md",
-        "text": "Retrieve a set of properties indicated by the given selectors from an object.\r\n\r\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.",
+        "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.",
         "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 selectors.concat().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",
@@ -2084,7 +2084,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6e341280f2a1e617184bc4cd201ea8a2e8e3f24610a9d51ccb956ed74da05365"
+        "hash": "db5e6f745e0157873ab4c0840da8675d3d20b8fe2ecbbb4e9f24744606b0dde9"
       }
     },
     {
@@ -2092,7 +2092,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getColonTimeFromDate.md",
-        "text": "Returns a string of the form `HH:MM:SS` from a `Date` object.\r\n\r\nUse `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.",
+        "text": "Returns a string of the form `HH:MM:SS` from a `Date` object.\n\nUse `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.",
         "codeBlocks": {
           "es6": "const getColonTimeFromDate = date => date.toTimeString().slice(0, 8);",
           "es5": "var getColonTimeFromDate = function getColonTimeFromDate(date) {\n  return date.toTimeString().slice(0, 8);\n};",
@@ -2105,7 +2105,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a9be5e8fcca0abd22cac1e24ce7ede5798536a7fec685ba935ba4f6aeeec393f"
+        "hash": "4a8abb281739c1b068d979b8d49038ea063ece4aa570cc8444926ebd30306ff1"
       }
     },
     {
@@ -2113,9 +2113,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getDaysDiffBetweenDates.md",
-        "text": "Returns the difference (in days) between two dates.\r\n\r\nCalculate the difference (in days) between two `Date` objects.",
+        "text": "Returns the difference (in days) between two dates.\n\nCalculate the difference (in days) between two `Date` objects.",
         "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"
         },
@@ -2126,7 +2126,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b236101b97d43f507c9d8e5bc549d3466ca6ab8dd77a0cdfe79ac54f3da8a501"
+        "hash": "baeec5f4220f1e457b11034e29d84277dbdc9fc5c9e69c1a225bb22f13b843ec"
       }
     },
     {
@@ -2134,11 +2134,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getImages.md",
-        "text": "Fetches all images from within an element and puts them into an array\r\n\r\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.",
+        "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.",
         "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",
@@ -2147,7 +2147,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "30c22e10f8b425ca56ab6147ad6a6ca22493bd5dc74763b47d4537794e5faa8b"
+        "hash": "0f2ba02c6de1e9396abbef584139bea4dc379a6d465f4bebb151ad3b0f77ff6f"
       }
     },
     {
@@ -2155,11 +2155,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getMeridiemSuffixOfInteger.md",
-        "text": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\r\n\r\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.",
+        "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.",
         "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",
@@ -2168,7 +2168,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "bddc2aa28057295a443f3c712d0afe790967269ace01a593f8ebd3161959746a"
+        "hash": "561d55a2f839596b336a04badbd160a3b895e9ebb9c1d392998ecccdbe5fb98d"
       }
     },
     {
@@ -2176,9 +2176,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getScrollPosition.md",
-        "text": "Returns the scroll position of the current page.\r\n\r\nUse `pageXOffset` and `pageYOffset` if they are defined, otherwise `scrollLeft` and `scrollTop`.\r\nYou can omit `el` to use a default value of `window`.",
+        "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`.",
         "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}"
         },
@@ -2189,7 +2189,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8317d2ba88c3313df22b4a3c7b8c584a9695a3e47929769498c998a191e33a65"
+        "hash": "4033549c80f649c2a9b9b50d1af42410811ff72914c5eb576445219bddfc792f"
       }
     },
     {
@@ -2197,7 +2197,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getStyle.md",
-        "text": "Returns the value of a CSS rule for the specified element.\r\n\r\nUse `Window.getComputedStyle()` to get the value of the CSS rule for the specified element.",
+        "text": "Returns the value of a CSS rule for the specified element.\n\nUse `Window.getComputedStyle()` to get the value of the CSS rule for the specified element.",
         "codeBlocks": {
           "es6": "const getStyle = (el, ruleName) => getComputedStyle(el)[ruleName];",
           "es5": "var getStyle = function getStyle(el, ruleName) {\n  return getComputedStyle(el)[ruleName];\n};",
@@ -2211,7 +2211,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7ef8abe35c1f73ae254dc94809c02e5592c6cdae1d228bf5b0049024aded7ae8"
+        "hash": "b9668334e0fd077c4e43d616765e4343b3770a0a3bd6b846ecc743ca7d65a804"
       }
     },
     {
@@ -2219,9 +2219,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getType.md",
-        "text": "Returns the native type of a value.\r\n\r\nReturns lowercased constructor name of value, `\"undefined\"` or `\"null\"` if value is `undefined` or `null`.",
+        "text": "Returns the native type of a value.\n\nReturns lowercased constructor name of value, `\"undefined\"` or `\"null\"` if value is `undefined` or `null`.",
         "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'"
         },
@@ -2232,7 +2232,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "70f912b7b6050a1e45db91e52108f955be199e67bc418e44350ca75dbc95fa2b"
+        "hash": "7fb09e3f807459959cae5fcb87ac323286e0a36ed4500b699c292c19b709af38"
       }
     },
     {
@@ -2240,11 +2240,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getURLParameters.md",
-        "text": "Returns an object containing the parameters of the current URL.\r\n\r\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.\r\nPass `location.search` as the argument to apply to the current `url`.",
+        "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`.",
         "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",
@@ -2256,7 +2256,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ad8f7359e02f2a451ace63878352b5277f4b465b81d42517d7a7da860fe06a0d"
+        "hash": "defd32f6b9e8d045213a7cbe4a68686ec229c472e46837afb6c7bd1b3df3ccae"
       }
     },
     {
@@ -2264,11 +2264,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "groupBy.md",
-        "text": "Groups the elements of an array based on the given function.\r\n\r\nUse `Array.prototype.map()` to map the values of an array to a function or property name.\r\nUse `Array.prototype.reduce()` to create an object, where the keys are produced from the mapped results.",
+        "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.",
         "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",
@@ -2278,7 +2278,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6fa953c682555ba0ba21d95ea94200bcdbf0fd750e9166ba4e420f6743f6f962"
+        "hash": "3d356c5e5780be7b393fe37e2bee159be965aae0ebc4474979e28385ea8af18a"
       }
     },
     {
@@ -2286,7 +2286,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "hammingDistance.md",
-        "text": "Calculates the Hamming distance between two values.\r\n\r\nUse XOR operator (`^`) to find the bit difference between the two numbers, convert to a binary string using `toString(2)`.\r\nCount and return the number of `1`s in the string, using `match(/1/g)`.",
+        "text": "Calculates the Hamming distance between two values.\n\nUse XOR operator (`^`) to find the bit difference between the two numbers, convert to a binary string using `toString(2)`.\nCount and return the number of `1`s in the string, using `match(/1/g)`.",
         "codeBlocks": {
           "es6": "const hammingDistance = (num1, num2) => ((num1 ^ num2).toString(2).match(/1/g) || '').length;",
           "es5": "var hammingDistance = function hammingDistance(num1, num2) {\n  return ((num1 ^ num2).toString(2).match(/1/g) || '').length;\n};",
@@ -2299,7 +2299,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8b6b537dee230112369c56921909edfa7057563ff4b303126d39d20a0daf42ca"
+        "hash": "e75b1c53cb28dce1ac4f8e1d1289f96da22e2b24e6c3a28bd5fd5adc5f4ec5de"
       }
     },
     {
@@ -2307,7 +2307,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "hasClass.md",
-        "text": "Returns `true` if the element has the specified class, `false` otherwise.\r\n\r\nUse `element.classList.contains()` to check if the element has the specified class.",
+        "text": "Returns `true` if the element has the specified class, `false` otherwise.\n\nUse `element.classList.contains()` to check if the element has the specified class.",
         "codeBlocks": {
           "es6": "const hasClass = (el, className) => el.classList.contains(className);",
           "es5": "var hasClass = function hasClass(el, className) {\n  return el.classList.contains(className);\n};",
@@ -2321,7 +2321,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0154a5cfde5731e51d52d1247c2c1a099f6505b00bce807bded0b6d310007a27"
+        "hash": "edb16de35e0a033f7dece0ff7854b17cb6c5ed0ed68438556ee38b68b219e7fe"
       }
     },
     {
@@ -2329,11 +2329,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "hasFlags.md",
-        "text": "Check if the current process's arguments contain the specified flags.\r\n\r\nUse `Array.prototype.every()` and `Array.prototype.includes()` to check if `process.argv` contains all the specified flags.\r\nUse a regular expression to test if the specified flags are prefixed with `-` or `--` and prefix them accordingly.",
+        "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.",
         "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",
@@ -2342,7 +2342,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "42c520b4003b990fcb4874a5d74d3b8fc0560535b75eb536067ac13be2396fe6"
+        "hash": "f045367ac2eab790b4e7783704bdce034b8f750aac38a96b2a6bfac4badec938"
       }
     },
     {
@@ -2350,9 +2350,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse the [SubtleCrypto](https://developer.mozilla.org/en-US/docs/Web/API/SubtleCrypto) API to create a hash for the given value.",
+        "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.",
         "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'"
         },
@@ -2366,7 +2366,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5023bba7071042ed934cffc9c7c10879e1d83159d667d0f7cbd02a7b6563a59c"
+        "hash": "aa8ba51d9419e05e0d2962221c0a65311ad54b4b38f278a1d4ab546ca5b29bc9"
       }
     },
     {
@@ -2374,9 +2374,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `crypto` API to create a hash for the given value.",
+        "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.",
         "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'"
         },
@@ -2389,7 +2389,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e50f540cf0fa0cfab53b5fd6d6db5c75458c9c532635530adcfb6296929e5815"
+        "hash": "80adea6b33dacdfc5f2d25ce270472f232208fa688794b71ba042ea368e1ad63"
       }
     },
     {
@@ -2397,7 +2397,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "head.md",
-        "text": "Returns the head of a list.\r\n\r\nUse `arr[0]` to return the first element of the passed array.",
+        "text": "Returns the head of a list.\n\nUse `arr[0]` to return the first element of the passed array.",
         "codeBlocks": {
           "es6": "const head = arr => arr[0];",
           "es5": "var head = function head(arr) {\n  return arr[0];\n};",
@@ -2410,7 +2410,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e4007add6bbc4141026107f3aad18346a563997cb66533ca36cc18692c495e4b"
+        "hash": "cd65a1dea363ab1e3773705c33b30afd44fd1ab2ecb57f732c35fd4e737ada11"
       }
     },
     {
@@ -2418,11 +2418,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "hexToRGB.md",
-        "text": "Converts a color code to a `rgb()` or `rgba()` string if alpha value is provided.\r\n\r\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.",
+        "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.",
         "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",
@@ -2433,7 +2433,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7d73c1510e8f03bcb0d19577515dc558cecdae697f9f67227dff9d8d94db2576"
+        "hash": "181b4df31bcbafebd7960725d19c945925a2dc5ee79ef30668d4becae0c82518"
       }
     },
     {
@@ -2441,7 +2441,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "hide.md",
-        "text": "Hides all the elements specified.\r\n\r\nUse `NodeList.prototype.forEach()` to apply `display: none` to each element specified.",
+        "text": "Hides all the elements specified.\n\nUse `NodeList.prototype.forEach()` to apply `display: none` to each element specified.",
         "codeBlocks": {
           "es6": "const hide = els => els.forEach(e => (e.style.display = 'none'));",
           "es5": "var hide = function hide(els) {\n  return els.forEach(function (e) {\n    return e.style.display = 'none';\n  });\n};",
@@ -2455,7 +2455,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "078f1ffeaa850cbde3383fe6c799950f24c68d73f29e324559616b0ced212f2b"
+        "hash": "8b7b70809f93fd9392315a5c63aa4cbbf9b45eb1165a7d44db314186d407816b"
       }
     },
     {
@@ -2463,11 +2463,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "httpGet.md",
-        "text": "Makes a `GET` request to the passed URL.\r\n\r\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`.\r\nHandle the `onload` event, by calling the given `callback` the `responseText`.\r\nHandle the `onerror` event, by running the provided `err` function.\r\nOmit the third argument, `err`, to log errors to the console's `error` stream by default.",
+        "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.",
         "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",
@@ -2478,7 +2478,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "77e6b9f23db17fd9ca9ed468d852e3a57a860c2a4f17374d37d836347a47eba8"
+        "hash": "2ce890e49f107cfefbcd752721c447416c350e8e1fd3ee1befc3f154c5d5adc4"
       }
     },
     {
@@ -2486,11 +2486,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "httpPost.md",
-        "text": "Makes a `POST` request to the passed URL.\r\n\r\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`.\r\nSet the value of an `HTTP` request header with `setRequestHeader` method.\r\nHandle the `onload` event, by calling the given `callback` the `responseText`.\r\nHandle the `onerror` event, by running the provided `err` function.\r\nOmit the third argument, `data`, to send no data to the provided `url`.\r\nOmit the fourth argument, `err`, to log errors to the console's `error` stream by default.",
+        "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.",
         "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",
@@ -2501,7 +2501,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b2bee353fc87d478c7f2d25571af44cae021975b0b250a25a9bfbfa21fb09c2a"
+        "hash": "c243abb2f47bce90c1afdeaab78cacc1a5997e8124d8588f446c2e33ec5166f7"
       }
     },
     {
@@ -2509,9 +2509,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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.",
+        "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.",
         "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"
         },
@@ -2523,7 +2523,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4c9bcb42d2e5062fa701676082215ecada42907647b458fb2728f162f50239b9"
+        "hash": "a233bf70be2dc7a0696d852561462c21f14974dbf43d888696fb8b7c36d0ca63"
       }
     },
     {
@@ -2531,11 +2531,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "hz.md",
-        "text": "Returns the number of times a function executed per second. \r\n`hz` is the unit for `hertz`, the unit of frequency defined as one cycle per second.\r\n\r\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. \r\nReturn the number of cycles per second by converting milliseconds to seconds and dividing it by the time elapsed. \r\nOmit the second argument, `iterations`, to use the default of 100 iterations.",
+        "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.",
         "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",
@@ -2544,7 +2544,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5ff39c77c58c0923fa62cc280d327b3da92452ac93d67addce6c4a755ac391fb"
+        "hash": "4c8c44d8677b7b591d36d043e3c1347b50ad21e2b24aa371ea50b515ee98254f"
       }
     },
     {
@@ -2552,11 +2552,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "indentString.md",
-        "text": "Indents each line in the provided string.\r\n\r\nUse `String.replace` and a regular expression to add the character specified by `indent` `count` times at the start of each line.\r\nOmit the third parameter, `indent`, to use a default indentation character of `' '`.",
+        "text": "Indents each line in the provided string.\n\nUse `String.replace` and a regular expression to add the character specified by `indent` `count` times at the start of each line.\nOmit the third parameter, `indent`, to use a default indentation character of `' '`.",
         "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",
@@ -2566,7 +2566,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "12795f514a9a20c966b45c1e08b428a89decf02ab8ab25e95351c842e14af38d"
+        "hash": "2249bdeaa8327b70492049e43d049bd3a0c6b147cafb80504d59a9199f57d0d2"
       }
     },
     {
@@ -2574,11 +2574,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "indexOfAll.md",
-        "text": "Returns all indices of `val` in an array.\r\nIf `val` never occurs, returns `[]`.\r\n\r\nUse `Array.prototype.reduce()` to loop over elements and store indices for matching elements.\r\nReturn the array of indices.",
+        "text": "Returns all indices of `val` in an array.\nIf `val` never occurs, returns `[]`.\n\nUse `Array.prototype.reduce()` to loop over elements and store indices for matching elements.\nReturn the array of indices.",
         "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 ? _toConsumableArray(acc).concat([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",
@@ -2587,7 +2587,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1d722ccb2ba2ba2343e7e5a4267267cb428c8023f3bc715efbd12a7b345dc6d8"
+        "hash": "c55f08e2dacfc794891f331a8ab6038a6600aa3a27d73b04d6d8e20142ee38e7"
       }
     },
     {
@@ -2595,7 +2595,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "initial.md",
-        "text": "Returns all the elements of an array except the last one.\r\n\r\nUse `arr.slice(0,-1)` to return all but the last element of the array.",
+        "text": "Returns all the elements of an array except the last one.\n\nUse `arr.slice(0,-1)` to return all but the last element of the array.",
         "codeBlocks": {
           "es6": "const initial = arr => arr.slice(0, -1);",
           "es5": "var initial = function initial(arr) {\n  return arr.slice(0, -1);\n};",
@@ -2608,7 +2608,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d1fbb8b0dbecd03f84283818ee89afea941aadb1825bdaf7310b1de6b73b7c3a"
+        "hash": "fbb48fd534c60e0b78ddc84eb7dcdc74e0cb8487545da6a49ca53149915af632"
       }
     },
     {
@@ -2616,9 +2616,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "initialize2DArray.md",
-        "text": "Initializes a 2D array of given width and height and value.\r\n\r\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`.",
+        "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`.",
         "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]]"
         },
@@ -2629,7 +2629,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "821e5747c844336d0d5257bea695e4596be44f4dab46e3911c615c0f8fe300fa"
+        "hash": "9c91703349f7d2e9ae8806ca1374f893a06389e7caf6b6410cd4edcdc0cdc641"
       }
     },
     {
@@ -2637,11 +2637,11 @@
       "type": "snippet",
       "attributes": {
         "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`.\r\n\r\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.\r\nYou can omit `start` to use a default value of `0`.\r\nYou can omit `step` to use a default value of `1`.",
+        "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`.",
         "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",
@@ -2651,7 +2651,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7cfa14e36abfba9adcf9a94db02dcd299e016e530ebe97688bf3fec21a0472db"
+        "hash": "f2cb7d6d0d34691affe17f7c06ee5c45944bd9515298560a18543f0798b4fe13"
       }
     },
     {
@@ -2659,11 +2659,11 @@
       "type": "snippet",
       "attributes": {
         "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`.\r\n\r\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.\r\nYou can omit `start` to use a default value of `0`.\r\nYou can omit `step` to use a default value of `1`.",
+        "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`.",
         "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",
@@ -2673,7 +2673,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e0323c660334e54d299cf6309c6e9b9779c83a9f8a57276b6ebd7fdb82bd111f"
+        "hash": "d70f1e3ff938d3aa378038d316bb2d131da5fdd2ea62ef512de3336910e6f342"
       }
     },
     {
@@ -2681,7 +2681,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "initializeArrayWithValues.md",
-        "text": "Initializes and fills an array with the specified values.\r\n\r\nUse `Array(n)` to create an array of the desired length, `fill(v)` to fill it with the desired values.\r\nYou can omit `val` to use a default value of `0`.",
+        "text": "Initializes and fills an array with the specified values.\n\nUse `Array(n)` to create an array of the desired length, `fill(v)` to fill it with the desired values.\nYou can omit `val` to use a default value of `0`.",
         "codeBlocks": {
           "es6": "const initializeArrayWithValues = (n, val = 0) => Array(n).fill(val);",
           "es5": "var initializeArrayWithValues = function initializeArrayWithValues(n) {\n  var val = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  return Array(n).fill(val);\n};",
@@ -2695,7 +2695,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5310f9e3df5f17fdaa576d3d925ebff1156b07a13b247982523026717938c367"
+        "hash": "67fe7e3ed8f8866b3669541f28a13b5a2b0c3719edcff68a3284884f3f39dca8"
       }
     },
     {
@@ -2703,11 +2703,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "initializeNDArray.md",
-        "text": "Create a n-dimensional array with given value.\r\n\r\nUse recursion.\r\nUse `Array.prototype.map()` to generate rows where each is a new array initialized using `initializeNDArray`.",
+        "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`.",
         "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",
@@ -2717,7 +2717,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e22aafd7601076113089156e8c5bef5b58a0b871c75a62fd7645557b1cb8b2bf"
+        "hash": "029121e79e5690c63a06bab363cd71f0c0b44fc5ac13d442b7e1103efe113cdd"
       }
     },
     {
@@ -2725,11 +2725,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "inRange.md",
-        "text": "Checks if the given number falls within the given range.\r\n\r\nUse arithmetic comparison to check if the given number is in the specified range.\r\nIf the second parameter, `end`, is not specified, the range is considered to be from `0` to `start`.",
+        "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`.",
         "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",
@@ -2738,7 +2738,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c4fe47e6f86e2885cd13013fd76c9655de903a6d6381e0a0310259fe509c348f"
+        "hash": "cb00d1c23e02506fc968515ce8c18dcec8837d447cd47a99f73777574308fb49"
       }
     },
     {
@@ -2746,7 +2746,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "insertAfter.md",
-        "text": "Inserts an HTML string after the end of the specified element.\r\n\r\nUse `el.insertAdjacentHTML()` with a position of `'afterend'` to parse `htmlString` and insert it after the end of `el`.",
+        "text": "Inserts an HTML string after the end of the specified element.\n\nUse `el.insertAdjacentHTML()` with a position of `'afterend'` to parse `htmlString` and insert it after the end of `el`.",
         "codeBlocks": {
           "es6": "const insertAfter = (el, htmlString) => el.insertAdjacentHTML('afterend', htmlString);",
           "es5": "var insertAfter = function insertAfter(el, htmlString) {\n  return el.insertAdjacentHTML('afterend', htmlString);\n};",
@@ -2759,7 +2759,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "afae345b486b46947328d2b9861a1fc978d6f31e0f9ee239c147497fd0af2fbd"
+        "hash": "6fb50a82d884c18e13fce553a0027ab6816697d3be1dd4c5e22d0c8f833744bf"
       }
     },
     {
@@ -2767,7 +2767,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "insertBefore.md",
-        "text": "Inserts an HTML string before the start of the specified element.\r\n\r\nUse `el.insertAdjacentHTML()` with a position of `'beforebegin'` to parse `htmlString` and insert it before the start of `el`.",
+        "text": "Inserts an HTML string before the start of the specified element.\n\nUse `el.insertAdjacentHTML()` with a position of `'beforebegin'` to parse `htmlString` and insert it before the start of `el`.",
         "codeBlocks": {
           "es6": "const insertBefore = (el, htmlString) => el.insertAdjacentHTML('beforebegin', htmlString);",
           "es5": "var insertBefore = function insertBefore(el, htmlString) {\n  return el.insertAdjacentHTML('beforebegin', htmlString);\n};",
@@ -2780,7 +2780,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c84982df57741120f043b95900b6ced00df759ba32006dfe4ba6cbecd8951210"
+        "hash": "bd45d57d669eeecd55bb507ab12c09839dc35ee90f99bcc182dae0a41649a19d"
       }
     },
     {
@@ -2788,9 +2788,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "intersection.md",
-        "text": "Returns a list of elements that exist in both arrays.\r\n\r\nCreate a `Set` from `b`, then use `Array.prototype.filter()` on `a` to only keep values contained in `b`.",
+        "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`.",
         "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]"
         },
@@ -2802,7 +2802,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6357fe80459843ea6063ea1d45708d2a830027ca15404f83f7207076453acff4"
+        "hash": "42ad71d6d0ee0fc1ab7b29ba38f2ecce382f811e44b7557e7cc53f49d61596a0"
       }
     },
     {
@@ -2810,9 +2810,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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.",
+        "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.",
         "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]"
         },
@@ -2824,7 +2824,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e1ad1e48023b486e60f19dbbe020cb1e801ff5ed4912afc9823b2bd63bf5871a"
+        "hash": "9b88b7b1786c6d7b7c2e1de6c89019feb07fea89f8a17f082c18357cac67abc9"
       }
     },
     {
@@ -2832,7 +2832,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "intersectionWith.md",
-        "text": "Returns a list of elements that exist in both arrays, using a provided comparator function.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` in combination with the provided comparator to determine intersecting values.",
+        "text": "Returns a list of elements that exist in both arrays, using a provided comparator function.\n\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` in combination with the provided comparator to determine intersecting values.",
         "codeBlocks": {
           "es6": "const intersectionWith = (a, b, comp) => a.filter(x => b.findIndex(y => comp(x, y)) !== -1);",
           "es5": "var intersectionWith = function intersectionWith(a, b, comp) {\n  return a.filter(function (x) {\n    return b.findIndex(function (y) {\n      return comp(x, y);\n    }) !== -1;\n  });\n};",
@@ -2846,7 +2846,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3040d5fbc00eda16be6cef9a34bd14c32bca039a9361414975b704a778e7374f"
+        "hash": "43f99f032f4c3d1b685d3ca05b76e4c4857168cf7b94f93454421d328bf8aaa2"
       }
     },
     {
@@ -2854,11 +2854,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Object.keys()` and `Array.prototype.reduce()` to invert the key-value pairs of an object and apply the function provided (if any).\r\nOmit the second argument, `fn`, to get the inverted keys without applying a function to them.",
+        "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.",
         "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",
@@ -2868,7 +2868,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a964d973bc0b0a51e79d6cc8917c74662df6a7fe784b394847e1f73c7d0b49a7"
+        "hash": "ecbcab22d1ee4d676863be930fadc0396b8688def0a782e8fb3fec98aac436a4"
       }
     },
     {
@@ -2876,11 +2876,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "is.md",
-        "text": "Checks if the provided value is of the specified type.\r\n\r\nEnsure the value is not `undefined` or `null` using `Array.prototype.includes()`, and compare the `constructor` property on the value with `type` to check if the provided value is of the specified `type`.",
+        "text": "Checks if the provided value is of the specified type.\n\nEnsure the value is not `undefined` or `null` using `Array.prototype.includes()`, and compare the `constructor` property on the value with `type` to check if the provided value is of the specified `type`.",
         "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",
@@ -2891,7 +2891,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1a8bf513deeb8d16670015c9c47066e542cfadcb49ee1f792b7222525349877a"
+        "hash": "06baccfa0f48458c6d2eb043960851545f3c358f50c4687c2d570676d73f42a9"
       }
     },
     {
@@ -2899,11 +2899,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isAbsoluteURL.md",
-        "text": "Returns `true` if the given string is an absolute URL, `false` otherwise.\r\n\r\nUse a regular expression to test if the string is an absolute URL.",
+        "text": "Returns `true` if the given string is an absolute URL, `false` otherwise.\n\nUse a regular expression to test if the string is an absolute URL.",
         "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",
@@ -2915,7 +2915,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a1c0b0ccf3608b21f23e16d72172d50d7b8eddd6575417553b24ad12fdce0984"
+        "hash": "74e18a4c018b09d172b04daec6aeab29297b83986bb846028fc20ab1300c84a5"
       }
     },
     {
@@ -2923,7 +2923,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isAfterDate.md",
-        "text": "Check if a date is after another date.\r\n\r\nUse the greater than operator (`>`) to check if the first date comes after the second one.",
+        "text": "Check if a date is after another date.\n\nUse the greater than operator (`>`) to check if the first date comes after the second one.",
         "codeBlocks": {
           "es6": "const isAfterDate = (dateA, dateB) => dateA > dateB;",
           "es5": "var isAfterDate = function isAfterDate(dateA, dateB) {\n  return dateA > dateB;\n};",
@@ -2937,7 +2937,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3ab6b5f71b08d335b401edcfa5cd9a4a50375f7002c20c44e4aa1b092c9409ba"
+        "hash": "78974cc479b0d3a51b7795c5679cbab9601cdd90716a69947799ebe302a7d515"
       }
     },
     {
@@ -2945,9 +2945,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isAnagram.md",
-        "text": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\r\n\r\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.",
+        "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.",
         "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"
         },
@@ -2959,7 +2959,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3d0d439e0439f0ee897643fd2d55103d13ceb6b29bbfbf25ef96fb5ec4aff175"
+        "hash": "9404ec22658a648e7b7bcf314b764e4be17e235b14ffdf03654325844fb51005"
       }
     },
     {
@@ -2967,11 +2967,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isArrayLike.md",
-        "text": "Checks if the provided argument is array-like (i.e. is iterable).\r\n\r\nCheck if the provided argument is not `null` and that its `Symbol.iterator` property is a function.",
+        "text": "Checks if the provided argument is array-like (i.e. is iterable).\n\nCheck if the provided argument is not `null` and that its `Symbol.iterator` property is a function.",
         "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",
@@ -2981,7 +2981,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d94fb1197edca9a124d462a6ff350eac157a1cef4b074e6577300a98c22bd974"
+        "hash": "00b43a2b430d5d9205046ad6fbf7442f0d4507895c82545753253b5b5f97fa3a"
       }
     },
     {
@@ -2989,7 +2989,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isBeforeDate.md",
-        "text": "Check if a date is before another date.\r\n\r\nUse the less than operator (`<`) to check if the first date comes before the second one.",
+        "text": "Check if a date is before another date.\n\nUse the less than operator (`<`) to check if the first date comes before the second one.",
         "codeBlocks": {
           "es6": "const isBeforeDate = (dateA, dateB) => dateA < dateB;",
           "es5": "var isBeforeDate = function isBeforeDate(dateA, dateB) {\n  return dateA < dateB;\n};",
@@ -3003,7 +3003,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2f685997689173e988f2a037920a51e87b8beb9968d7847c1138bb5443b8e39b"
+        "hash": "947340a879922379186ddecda22c625bc4db21948dc619e445abd95da21d0a1c"
       }
     },
     {
@@ -3011,11 +3011,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isBoolean.md",
-        "text": "Checks if the given argument is a native boolean element.\r\n\r\nUse `typeof` to check if a value is classified as a boolean primitive.",
+        "text": "Checks if the given argument is a native boolean element.\n\nUse `typeof` to check if a value is classified as a boolean primitive.",
         "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",
@@ -3024,7 +3024,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "84a180e77eb415f95590f098a79dfa3a4c0bb26f7ab61ddf50cee6199988b852"
+        "hash": "e1adac3af11702cb65c30ecaf573659d215b3e2c2b5825e9993d36d889c5fd52"
       }
     },
     {
@@ -3032,11 +3032,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isBrowser.md",
-        "text": "Determines if the current runtime environment is a browser so that front-end modules can run on the server (Node) without throwing errors.\r\n\r\nUse `Array.prototype.includes()` on the `typeof` values of both `window` and `document` (globals usually only available in a browser environment unless they were explicitly defined), which will return `true` if one of them is `undefined`.\r\n`typeof` allows globals to be checked for existence without throwing a `ReferenceError`.\r\nIf both of them are not `undefined`, then the current environment is assumed to be a browser.",
+        "text": "Determines if the current runtime environment is a browser so that front-end modules can run on the server (Node) without throwing errors.\n\nUse `Array.prototype.includes()` on the `typeof` values of both `window` and `document` (globals usually only available in a browser environment unless they were explicitly defined), which will return `true` if one of them is `undefined`.\n`typeof` allows globals to be checked for existence without throwing a `ReferenceError`.\nIf both of them are not `undefined`, then the current environment is assumed to be a browser.",
         "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",
@@ -3046,7 +3046,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a350af7cb869b0ad84481e0fb61ba40e4e0f15e713fe9aa8f134ca2a34aa8288"
+        "hash": "0f9f606715fd96c8dc80df73bf8f19ae808ae0318b6c332f09ccd01cfb37fef9"
       }
     },
     {
@@ -3054,7 +3054,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isBrowserTabFocused.md",
-        "text": "Returns `true` if the browser tab of the page is focused, `false` otherwise.\r\n\r\nUse the `Document.hidden` property, introduced by the Page Visibility API to check if the browser tab of the page is visible or hidden.",
+        "text": "Returns `true` if the browser tab of the page is focused, `false` otherwise.\n\nUse the `Document.hidden` property, introduced by the Page Visibility API to check if the browser tab of the page is visible or hidden.",
         "codeBlocks": {
           "es6": "const isBrowserTabFocused = () => !document.hidden;",
           "es5": "var isBrowserTabFocused = function isBrowserTabFocused() {\n  return !document.hidden;\n};",
@@ -3067,7 +3067,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2e85f8e453867fa4fe115a815b7f8ae85450fcbcb265898ed3104fe128ad7917"
+        "hash": "af819966e11f4832bfc0129d1d0e148fa0157775d9a07d26f4c17f7096c6a176"
       }
     },
     {
@@ -3075,7 +3075,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isDivisible.md",
-        "text": "Checks if the first numeric argument is divisible by the second one.\r\n\r\nUse the modulo operator (`%`) to check if the remainder is equal to `0`.",
+        "text": "Checks if the first numeric argument is divisible by the second one.\n\nUse the modulo operator (`%`) to check if the remainder is equal to `0`.",
         "codeBlocks": {
           "es6": "const isDivisible = (dividend, divisor) => dividend % divisor === 0;",
           "es5": "var isDivisible = function isDivisible(dividend, divisor) {\n  return dividend % divisor === 0;\n};",
@@ -3088,7 +3088,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a6da1a53283096a1ff6d58964c4cca939d2c52c69bd39a01b32fd82da474768c"
+        "hash": "660aff9a5f540384603a2ab18d24e933b37e71972bd6bbc708b7bfb77ac13a50"
       }
     },
     {
@@ -3096,11 +3096,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isDuplexStream.md",
-        "text": "Checks if the given argument is a duplex (readable and writable) stream.\r\n\r\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`.\r\nAdditionally check if the `typeof` the `_read`, `_write` and `_readableState`, `_writableState` properties are `function` and `object` respectively.",
+        "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.",
         "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",
@@ -3110,7 +3110,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "51f4d59108d951823e041169354fb120e0e58f20aa2dce19b44957d349beb252"
+        "hash": "b774dbb0eb7647839be1b680627c1890fa4e1dee70b1a627fc6a1c9c0e9f3415"
       }
     },
     {
@@ -3118,11 +3118,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isEmpty.md",
-        "text": "Returns true if the a value is an empty object, collection, map or set, has no enumerable properties or is any type that is not considered a collection.\r\n\r\nCheck if the provided value is `null` or if its `length` is equal to `0`.",
+        "text": "Returns true if the a value is an empty object, collection, map or set, has no enumerable properties or is any type that is not considered a collection.\n\nCheck if the provided value is `null` or if its `length` is equal to `0`.",
         "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(new Map()); // true\r\nisEmpty(new Set()); // true\r\nisEmpty([]); // 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(new Map()); // true\nisEmpty(new Set()); // true\nisEmpty([]); // 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",
@@ -3134,7 +3134,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "243117a13cd98f68b115e68906166c518101a5a59eb18b39b677a355853c6c0e"
+        "hash": "55954fcfb879542225f7d1861ae7de6faac288e28ca857367b6a2eeba9a54786"
       }
     },
     {
@@ -3142,7 +3142,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isEven.md",
-        "text": "Returns `true` if the given number is even, `false` otherwise.\r\n\r\nChecks whether a number is odd or even using the modulo (`%`) operator.\r\nReturns `true` if the number is even, `false` if the number is odd.",
+        "text": "Returns `true` if the given number is even, `false` otherwise.\n\nChecks whether a number is odd or even using the modulo (`%`) operator.\nReturns `true` if the number is even, `false` if the number is odd.",
         "codeBlocks": {
           "es6": "const isEven = num => num % 2 === 0;",
           "es5": "var isEven = function isEven(num) {\n  return num % 2 === 0;\n};",
@@ -3155,7 +3155,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "41fba276ec7dca06006425cc1b8905ad9f9b7918e04ccbd211bdfa1bc4645f62"
+        "hash": "1c88249edc75925e83e8a4abc28f300c27bf9be1440bcc30b1b798b7d7ea8596"
       }
     },
     {
@@ -3163,11 +3163,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isFunction.md",
-        "text": "Checks if the given argument is a function.\r\n\r\nUse `typeof` to check if a value is classified as a function primitive.",
+        "text": "Checks if the given argument is a function.\n\nUse `typeof` to check if a value is classified as a function primitive.",
         "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",
@@ -3177,7 +3177,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "608f4b36d061a98a0f8203ba3cecb48f87ccc6f7720fd5449e34b576f98aaecf"
+        "hash": "22009c1df55cca53bc9b227d4f8f2e3d475abe5f5eecfbf9ab3cb30948c9d783"
       }
     },
     {
@@ -3185,11 +3185,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isLowerCase.md",
-        "text": "Checks if a string is lower case.\r\n\r\nConvert the given string to lower case, using `String.toLowerCase()` and compare it to the original.",
+        "text": "Checks if a string is lower case.\n\nConvert the given string to lower case, using `String.toLowerCase()` and compare it to the original.",
         "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",
@@ -3199,7 +3199,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "db0ceaf0fe1e662750aabd1bd54032b17c471efc2511a120354cccc1f7d0808d"
+        "hash": "e23c295c6c1d85cbeae2cfad15be98d3d8093ba59266f14af7dc47d19a68f43b"
       }
     },
     {
@@ -3207,11 +3207,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isNil.md",
-        "text": "Returns `true` if the specified value is `null` or `undefined`, `false` otherwise.\r\n\r\nUse the strict equality operator to check if the value and of `val` are equal to `null` or `undefined`.",
+        "text": "Returns `true` if the specified value is `null` or `undefined`, `false` otherwise.\n\nUse the strict equality operator to check if the value and of `val` are equal to `null` or `undefined`.",
         "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",
@@ -3220,7 +3220,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6098b98799252bd8297351aaae52530f6d70454e9bc00491d47e401a28e92e11"
+        "hash": "8a0c679926f99b1f710ad093e3ca2ae845eea383740b4aa655e2e3beb99472ca"
       }
     },
     {
@@ -3228,7 +3228,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isNull.md",
-        "text": "Returns `true` if the specified value is `null`, `false` otherwise.\r\n\r\nUse the strict equality operator to check if the value and of `val` are equal to `null`.",
+        "text": "Returns `true` if the specified value is `null`, `false` otherwise.\n\nUse the strict equality operator to check if the value and of `val` are equal to `null`.",
         "codeBlocks": {
           "es6": "const isNull = val => val === null;",
           "es5": "var isNull = function isNull(val) {\n  return val === null;\n};",
@@ -3241,7 +3241,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3286793e1526d264a82f61f3ea3ec24be21f735e6df3a4349a5d124de52f8096"
+        "hash": "e38f39701757feb6e2515736d446b2de580f19c77f9eaacb5d0d5b3e787209f8"
       }
     },
     {
@@ -3249,11 +3249,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isNumber.md",
-        "text": "Checks if the given argument is a number.\r\n\r\nUse `typeof` to check if a value is classified as a number primitive.",
+        "text": "Checks if the given argument is a number.\n\nUse `typeof` to check if a value is classified as a number primitive.",
         "codeBlocks": {
           "es6": "const isNumber = val => typeof val === 'number';",
           "es5": "var isNumber = function isNumber(val) {\n  return typeof val === 'number';\n};",
-          "example": "isNumber('1'); // false\r\nisNumber(1); // true"
+          "example": "isNumber('1'); // false\nisNumber(1); // true"
         },
         "tags": [
           "type",
@@ -3263,7 +3263,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2cab1f1a58e46b779843d02b11a4198c749071fc07d0a9487b99936a19bf17e4"
+        "hash": "446ed50e100f18a606c8443be196992b74b235ed98646632463fdc3d01f9eb04"
       }
     },
     {
@@ -3271,11 +3271,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isObject.md",
-        "text": "Returns a boolean determining if the passed value is an object or not.\r\n\r\nUses the  `Object` constructor to create an object wrapper for the given value. \r\nIf the value is `null` or `undefined`, create and return an empty object. Οtherwise, return an object of a type that corresponds to the given value.",
+        "text": "Returns a boolean determining if the passed value is an object or not.\n\nUses the  `Object` constructor to create an object wrapper for the given value. \nIf the value is `null` or `undefined`, create and return an empty object. Οtherwise, return an object of a type that corresponds to the given value.",
         "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",
@@ -3285,7 +3285,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6bbd64bdaada44df70084acbe3aebe1057ae3cb63d3c397272a88069c27023f6"
+        "hash": "64de55a580b3db52f79f2bc3168e312d4087891216853e51f8585e30c6eb3d3d"
       }
     },
     {
@@ -3293,11 +3293,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isObjectLike.md",
-        "text": "Checks if a value is object-like.\r\n\r\nCheck if the provided value is not `null` and its `typeof` is equal to `'object'`.",
+        "text": "Checks if a value is object-like.\n\nCheck if the provided value is not `null` and its `typeof` is equal to `'object'`.",
         "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",
@@ -3307,7 +3307,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c54f1c3d860b85ead765941dc29927c814df798be381d4b7af15145aa5248866"
+        "hash": "5388bdd5320b8b68511c1a6b77683e8320177a9c6561e5e952a60193c1b73844"
       }
     },
     {
@@ -3315,11 +3315,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isPlainObject.md",
-        "text": "Checks if the provided value is an object created by the Object constructor.\r\n\r\nCheck if the provided value is truthy, use `typeof` to check if it is an object and `Object.constructor` to make sure the constructor is equal to `Object`.",
+        "text": "Checks if the provided value is an object created by the Object constructor.\n\nCheck if the provided value is truthy, use `typeof` to check if it is an object and `Object.constructor` to make sure the constructor is equal to `Object`.",
         "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",
@@ -3329,7 +3329,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "145da6b8fa6d399c9d53c1a49627a9aa12588ba08f22e8c0237663cdd29a3540"
+        "hash": "f57c53ec6964e15510cd9bf9ad53429721c6a6547b59bd302ebcbc4cd19557ea"
       }
     },
     {
@@ -3337,9 +3337,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isPrime.md",
-        "text": "Checks if the provided integer is a prime number.\r\n\r\nCheck numbers from `2` to the square root of the given number.\r\nReturn `false` if any of them divides the given number, else return `true`, unless the number is less than `2`.",
+        "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`.",
         "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"
         },
@@ -3351,7 +3351,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8f2dc25121cc870f19c7e4614d1e2bfb80f69abb9f940e34506dd282d8b8b64f"
+        "hash": "023b7e9fded22fad9cd776f01c60c8238236cb2921523d7d612034bb465cba7d"
       }
     },
     {
@@ -3359,11 +3359,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isPrimitive.md",
-        "text": "Returns a boolean determining if the passed value is primitive or not.\r\n\r\nCreate an object from `val` and compare it with `val` to determine if the passed value is primitive (i.e. not equal to the created object).",
+        "text": "Returns a boolean determining if the passed value is primitive or not.\n\nCreate an object from `val` and compare it with `val` to determine if the passed value is primitive (i.e. not equal to the created object).",
         "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",
@@ -3375,7 +3375,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "567d6c3bb1c007c196d42d13e909499471f2da46f8d0ce88462d1a31d8157c26"
+        "hash": "c7d8ae1c152c6e7aa21c893d9bc3b581007004e88e4a77df0695a3b957c3d2a0"
       }
     },
     {
@@ -3383,11 +3383,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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`.",
+        "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`.",
         "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",
@@ -3398,7 +3398,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "42a7fea8a7f6348aad1a916f980af5c14d29da68748242340ff7298305117657"
+        "hash": "fa8bfc91bfa09eb76f7131c3cc7b890598f8a30ec9e9872f7ffd9c282d37ba72"
       }
     },
     {
@@ -3406,11 +3406,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isReadableStream.md",
-        "text": "Checks if the given argument is a readable stream.\r\n\r\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`.\r\nAdditionally check if the `typeof` the `_read` and `_readableState` properties are `function` and `object` respectively.",
+        "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.",
         "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",
@@ -3420,7 +3420,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8140e663feed7bf07d9f3167ded4948b6789aa8ee8e9ed3ceb35cb4f5a0a44b0"
+        "hash": "80e8196a7d4a8b335b30d050608b3d901178ba931ce1e51b7f44a9991a53b825"
       }
     },
     {
@@ -3428,7 +3428,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isSameDate.md",
-        "text": "Check if a date is the same as another date.\r\n\r\nUse `Date.prototype.toISOString()` and strict equality checking (`===`) to check if the first date is the same as the second one.",
+        "text": "Check if a date is the same as another date.\n\nUse `Date.prototype.toISOString()` and strict equality checking (`===`) to check if the first date is the same as the second one.",
         "codeBlocks": {
           "es6": "const isSameDate = (dateA, dateB) => dateA.toISOString() === dateB.toISOString();",
           "es5": "var isSameDate = function isSameDate(dateA, dateB) {\n  return dateA.toISOString() === dateB.toISOString();\n};",
@@ -3442,7 +3442,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "42aa1e60ace8c5d452c7b6ed073e8ae58e7b5a78dabcdfa6f919b03ad54b4553"
+        "hash": "a57a8fe6a89b45bd11bcfeb71321839b5ae9c6a3789dfc6670be4a71d705f703"
       }
     },
     {
@@ -3450,11 +3450,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nCalculate the ordering `direction` for the first two elements.\r\nUse `Object.entries()` to loop over array objects and compare them in pairs.\r\nReturn `0` if the `direction` changes or the `direction` if the last element is reached.",
+        "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.",
         "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",
@@ -3463,7 +3463,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9c2a20c29c3b1b3052f45f2eefe83b51e01cbdf68c4929490f57e5227adab6ee"
+        "hash": "2dfe9101a9ab2945ffddb46ecbca0fdd5dea384683d310e8adb852ac9c51970f"
       }
     },
     {
@@ -3471,11 +3471,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isStream.md",
-        "text": "Checks if the given argument is a stream.\r\n\r\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`.",
+        "text": "Checks if the given argument is a 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`.",
         "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",
@@ -3485,7 +3485,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b85cb6228c080ea8fd86de80811ab8b746896c8dcc62bdc38ab1728d8a7d6d41"
+        "hash": "926ac2fcee035747468a7dd0bbb57074b33242a2b65eff839b5b4ed47c6341e3"
       }
     },
     {
@@ -3493,7 +3493,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isString.md",
-        "text": "Checks if the given argument is a string. Only works for string primitives.\r\n\r\nUse `typeof` to check if a value is classified as a string primitive.",
+        "text": "Checks if the given argument is a string. Only works for string primitives.\n\nUse `typeof` to check if a value is classified as a string primitive.",
         "codeBlocks": {
           "es6": "const isString = val => typeof val === 'string';",
           "es5": "var isString = function isString(val) {\n  return typeof val === 'string';\n};",
@@ -3507,7 +3507,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8ef7ed2456af6774730b68e254ad66625718f7a049d13541c7d60410ae610ab4"
+        "hash": "8cb7af2bd0a103563eee4e09266219630bf50c22048ad243d9456a24277ba615"
       }
     },
     {
@@ -3515,7 +3515,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isSymbol.md",
-        "text": "Checks if the given argument is a symbol.\r\n\r\nUse `typeof` to check if a value is classified as a symbol primitive.",
+        "text": "Checks if the given argument is a symbol.\n\nUse `typeof` to check if a value is classified as a symbol primitive.",
         "codeBlocks": {
           "es6": "const isSymbol = val => typeof val === 'symbol';",
           "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 isSymbol = function isSymbol(val) {\n  return _typeof(val) === 'symbol';\n};",
@@ -3528,7 +3528,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5147f4f9545f644e366535c20eecbcc4a49e5e2606901df1d938b9f02fe56575"
+        "hash": "680fe44539f63a13c6586153e9ffdddd2a9a9b83c2736a69eaf5fe24080675e3"
       }
     },
     {
@@ -3536,7 +3536,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isTravisCI.md",
-        "text": "Checks if the current environment is [Travis CI](https://travis-ci.org/).\r\n\r\nChecks if the current environment has the `TRAVIS` and `CI` environment variables ([reference](https://docs.travis-ci.com/user/environment-variables/#Default-Environment-Variables)).",
+        "text": "Checks if the current environment is [Travis CI](https://travis-ci.org/).\n\nChecks if the current environment has the `TRAVIS` and `CI` environment variables ([reference](https://docs.travis-ci.com/user/environment-variables/#Default-Environment-Variables)).",
         "codeBlocks": {
           "es6": "const isTravisCI = () => 'TRAVIS' in process.env && 'CI' in process.env;",
           "es5": "var isTravisCI = function isTravisCI() {\n  return 'TRAVIS' in process.env && 'CI' in process.env;\n};",
@@ -3549,7 +3549,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c9e8be3686e292a4db56f8f6068ed75705b3260373689a10b57401703581f5cf"
+        "hash": "1528bcadc4afcb7240a9f5d53b49243d512d8c98814b3fe841889d0772ad2030"
       }
     },
     {
@@ -3557,7 +3557,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isUndefined.md",
-        "text": "Returns `true` if the specified value is `undefined`, `false` otherwise.\r\n\r\nUse the strict equality operator to check if the value and of `val` are equal to `undefined`.",
+        "text": "Returns `true` if the specified value is `undefined`, `false` otherwise.\n\nUse the strict equality operator to check if the value and of `val` are equal to `undefined`.",
         "codeBlocks": {
           "es6": "const isUndefined = val => val === undefined;",
           "es5": "var isUndefined = function isUndefined(val) {\n  return val === undefined;\n};",
@@ -3570,7 +3570,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2eeeb674c5f4947224fb065e5a1fa0b0adbbefd9b7fab99190cc9a4b65bab724"
+        "hash": "00eca9d29a66b8b8cee4b059a88bdae8f60cdc557cdff52817edd811cde5281b"
       }
     },
     {
@@ -3578,11 +3578,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isUpperCase.md",
-        "text": "Checks if a string is upper case.\r\n\r\nConvert the given string to upper case, using `String.prototype.toUpperCase()` and compare it to the original.",
+        "text": "Checks if a string is upper case.\n\nConvert the given string to upper case, using `String.prototype.toUpperCase()` and compare it to the original.",
         "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",
@@ -3592,7 +3592,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3d4d902eafdad5694f899ef9f763f7a11a7d7ad179526a03b3cf5377692b5ec1"
+        "hash": "626f56d793d107522067c92edce730bca0d33fb5a8095ac9396b4eb374fddd29"
       }
     },
     {
@@ -3600,11 +3600,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isValidJSON.md",
-        "text": "Checks if the provided argument is a valid JSON.\r\n\r\nUse `JSON.parse()` and a `try... catch` block to check if the provided argument is a valid JSON.",
+        "text": "Checks if the provided argument is a valid JSON.\n\nUse `JSON.parse()` and a `try... catch` block to check if the provided argument is a valid JSON.",
         "codeBlocks": {
-          "es6": "const isValidJSON = obj => {\r\n  try {\r\n    JSON.parse(obj);\r\n    return true;\r\n  } catch (e) {\r\n    return false;\r\n  }\r\n};",
+          "es6": "const isValidJSON = obj => {\n  try {\n    JSON.parse(obj);\n    return true;\n  } catch (e) {\n    return false;\n  }\n};",
           "es5": "var isValidJSON = function isValidJSON(obj) {\n  try {\n    JSON.parse(obj);\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",
@@ -3614,7 +3614,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a0ce043d4ed321c92f30bba8fd9e27270581e0bfae327e6efe3e637cc51700d5"
+        "hash": "b4417a972f391836241e88587797a8cd995f32ee71fbfcfe9e590c8fa8675558"
       }
     },
     {
@@ -3622,11 +3622,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isWritableStream.md",
-        "text": "Checks if the given argument is a writable stream.\r\n\r\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`.\r\nAdditionally check if the `typeof` the `_write` and `_writableState` properties are `function` and `object` respectively.",
+        "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.",
         "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",
@@ -3636,7 +3636,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a093149c0e471ec54ecd6fda4a44729011522875c57111144eb561319409f839"
+        "hash": "8334e570a144bb5cb8cf971d734b15c70b0912c32c3103ff05b0c1ee60e0c353"
       }
     },
     {
@@ -3644,11 +3644,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "join.md",
-        "text": "Joins all elements of an array into a string and returns this string.\r\nUses a separator and an end separator.\r\n\r\nUse `Array.prototype.reduce()` to combine elements into a string.\r\nOmit the second argument, `separator`, to use a default separator of `','`.\r\nOmit the third argument, `end`, to use the same value as `separator` by default.",
+        "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.",
         "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",
@@ -3657,7 +3657,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b9f4274b86fe464c48cd52578742e631cb00789bd9b3cb14dbaf7bf906238d38"
+        "hash": "84003bdeb9bfbac104ba97b07bebb29ed82a84a2e05e1931dc5f5d4c1d336be4"
       }
     },
     {
@@ -3665,11 +3665,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "JSONtoCSV.md",
-        "text": "Converts an array of objects to a comma-separated values (CSV) string that contains only the `columns` specified.\r\n\r\nUse `Array.prototype.join(delimiter)` to combine all the names in `columns` to create the first row.\r\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`.\r\nUse `Array.prototype.join('\\n')` to combine all rows into a string.\r\nOmit the third argument, `delimiter`, to use a default delimiter of `,`.",
+        "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 `,`.",
         "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",
@@ -3680,7 +3680,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "61fddf2f1f1772e890978dfadecfd1f65f52556f1d0f4493c542274b5806ffae"
+        "hash": "8a9b52f4f29b9c52572e2577cffdf93d00278aa7eb661f8af62625c7652c663c"
       }
     },
     {
@@ -3688,9 +3688,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "JSONToFile.md",
-        "text": "Writes a JSON object to a file.\r\n\r\nUse `fs.writeFile()`, template literals and `JSON.stringify()` to write a `json` object to a `.json` file.",
+        "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.",
         "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'"
         },
@@ -3702,7 +3702,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b35d2fdeb87912b6bbe3e6db3f5c91059c4b1d631e5e26c6c980b28001cc2b9f"
+        "hash": "1428086b630fa917dbb5a4ecd2854e9371b07244b3968bc3eb3184b4b589ea0c"
       }
     },
     {
@@ -3710,7 +3710,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "last.md",
-        "text": "Returns the last element in an array.\r\n\r\nUse `arr.length - 1` to compute the index of the last element of the given array and returning it.",
+        "text": "Returns the last element in an array.\n\nUse `arr.length - 1` to compute the index of the last element of the given array and returning it.",
         "codeBlocks": {
           "es6": "const last = arr => arr[arr.length - 1];",
           "es5": "var last = function last(arr) {\n  return arr[arr.length - 1];\n};",
@@ -3723,7 +3723,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "32027cb017b2f88a2454f66537f8e53f80129f1db56a4d264a8473320f4d4a77"
+        "hash": "49eb0b667109a372349e32fbcb809894ed62b5a1a3dab305876b810f8adfef29"
       }
     },
     {
@@ -3731,11 +3731,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "lcm.md",
-        "text": "Returns the least common multiple of two or more numbers.\r\n\r\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.\r\nThe GCD formula uses recursion.",
+        "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.",
         "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 arr.concat().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",
@@ -3745,7 +3745,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "039b259f403f96a12db85dbc75c49947ed0cd4c9f271c1b2330b962e79c94eaa"
+        "hash": "ac4ec1ff763b005ddd65e6ed5bdb49b18a4ce53f8b7ccf79536fa49ebeb6efa8"
       }
     },
     {
@@ -3753,11 +3753,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "longestItem.md",
-        "text": "Takes any number of iterable objects or objects with a `length` property and returns the longest one.\r\nIf multiple objects have the same length, the first one will be returned.\r\nReturns `undefined` if no arguments are provided.\r\n\r\nUse `Array.prototype.reduce()`, comparing the `length` of objects to find the longest one.",
+        "text": "Takes any number of iterable objects or objects with a `length` property and returns the longest one.\nIf multiple objects have the same length, the first one will be returned.\nReturns `undefined` if no arguments are provided.\n\nUse `Array.prototype.reduce()`, comparing the `length` of objects to find the longest one.",
         "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",
@@ -3768,7 +3768,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "68d8649e37c7dc4582dd931e632cc53bc7c6fdd89b77ebe6e2ed87237e2c8f20"
+        "hash": "0d9421bc8c9374fdb7a62df1212bccf8c5bd1cb4a99cce1ddc87ba7391e66c18"
       }
     },
     {
@@ -3776,11 +3776,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "lowercaseKeys.md",
-        "text": "Creates a new object from the specified object, where all the keys are in lowercase.\r\n\r\nUse `Object.keys()` and `Array.prototype.reduce()` to create a new object from the specified object.\r\nConvert each key in the original object to lowercase, using `String.toLowerCase()`.",
+        "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()`.",
         "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",
@@ -3789,7 +3789,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b0f3076f0b76269e7968e123b12ecd0fcd5ecf9d53c354d263a8edcaef9295fa"
+        "hash": "a9ecbb1256234991b339b6701ca0d45eb02c4698f00f5b6855005751d7a30bd7"
       }
     },
     {
@@ -3797,11 +3797,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `String.prototype.split('')`, `Array.prototype.reverse()` and `Array.prototype.map()` in combination with `parseInt()` to obtain an array of digits.\r\nUse `Array.prototype.splice(0,1)` to obtain the last digit.\r\nUse `Array.prototype.reduce()` to implement the Luhn Algorithm.\r\nReturn `true` if `sum` is divisible by `10`, `false` otherwise.",
+        "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.",
         "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",
@@ -3811,7 +3811,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "dc47d703003778e02bcff6ba3679a18f496ef292c99150e9a1ef47ee7bcbbefb"
+        "hash": "37a866439f736e06c325cfdfb1ce614e8135fc724a7ab8c60174cf8cffe283cf"
       }
     },
     {
@@ -3819,9 +3819,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Object.keys(obj)` to iterate over the object's keys.\r\nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.",
+        "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`.",
         "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 }"
         },
@@ -3833,7 +3833,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b16bf4999821f3e490db221683715bab83929fbb7dda3681107c9fd354f72410"
+        "hash": "215198b03c4b2e9c7961de606fa9df83fa5964f2210fcf17b4ea69ee15294bcb"
       }
     },
     {
@@ -3841,11 +3841,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "mapObject.md",
-        "text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the original value as the key and the mapped value.\r\n\r\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).",
+        "text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the original 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).",
         "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",
@@ -3855,7 +3855,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8f1c1eb90b25ffc444c5304d0cb57b6c378aed95a92af14fac972a277c592fd8"
+        "hash": "c7f0f9b6b22590a17c41057c56ea5cf14e74dfbbd4fb7e4bc5c08db3760ef76d"
       }
     },
     {
@@ -3863,9 +3863,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "mapString.md",
-        "text": "Creates a new string with the results of calling a provided function on every character in the calling string.\r\n\r\nUse `String.prototype.split('')` and `Array.prototype.map()` to call the provided function, `fn`, for each character in `str`.\r\nUse `Array.prototype.join('')` to recombine the array of characters into a string.\r\nThe callback function, `fn`, takes three arguments (the current character, the index of the current character and the string `mapString` was called upon).",
+        "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).",
         "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'"
         },
@@ -3879,7 +3879,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e6fd375fff17a417326d159f49f99bc59defb7efbe3efb1d0154fcc915bf0b0f"
+        "hash": "7ea3b8a83b25f531ed389bfb8318ad70e65dbe2dc9f966a81924415c447a38df"
       }
     },
     {
@@ -3887,11 +3887,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Object.keys(obj)` to iterate over the object's keys.\r\nUse `Array.prototype.reduce()` to create a new object with the same keys and mapped values using `fn`.",
+        "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`.",
         "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",
@@ -3901,7 +3901,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "80d19ac6f58d14b862f9c876ec073b30df4320a2d6ddcdd65c7c2e340bd6a86c"
+        "hash": "10d552b21c7b8d85c9588a47bffc571ed837df53d24a47cb80e8016f49b04885"
       }
     },
     {
@@ -3909,11 +3909,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "mask.md",
-        "text": "Replaces all but the last `num` of characters with the specified mask character.\r\n\r\nUse `String.prototype.slice()` to grab the portion of the characters that will remain unmasked and use `String.padStart()` to fill the beginning of the string with the mask character up to the original length.\r\nOmit the second argument, `num`, to keep a default of `4` characters unmasked. If `num` is negative, the unmasked characters will be at the start of the string.\r\nOmit the third argument, `mask`, to use a default character of `'*'` for the mask.",
+        "text": "Replaces all but the last `num` of characters with the specified mask character.\n\nUse `String.prototype.slice()` to grab the portion of the characters that will remain unmasked and use `String.padStart()` to fill the beginning of the string with the mask character up to the original length.\nOmit the second argument, `num`, to keep a default of `4` characters unmasked. If `num` is negative, the unmasked characters will be at the start of the string.\nOmit the third argument, `mask`, to use a default character of `'*'` for the mask.",
         "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",
@@ -3924,7 +3924,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3da462a0771e4e021727ea956c720e384455d7bc22be7a41034ec164a0918c2c"
+        "hash": "23226393059fc47128562284e5982e5f9a4b365b8d0625f7e18cabde49f2e682"
       }
     },
     {
@@ -3932,11 +3932,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "matches.md",
-        "text": "Compares two objects to determine if the first one contains equivalent property values to the second one.\r\n\r\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.",
+        "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.",
         "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",
@@ -3946,7 +3946,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5e55988a85c6df1e7d207f856fed5360f4cb1f21cb25e0baa4da702c44562f43"
+        "hash": "b937a42861d79ec84dc8217b31c193351ec82f3220d5eccc8840d059673823ba"
       }
     },
     {
@@ -3954,11 +3954,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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.\r\nIf no function is provided, the values will be compared using the equality operator.",
+        "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.",
         "codeBlocks": {
-          "es6": "const matchesWith = (obj, source, fn) =>\r\n  Object.keys(source).every(\r\n    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(\n    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",
@@ -3969,7 +3969,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "36b4b1ff9e305cb6378ae7d6bebe6f2272bf3355719d455dab37322975598686"
+        "hash": "a6ce779c9f00b00d0035baeeb187ac97b6f96d748db6e4583f408173a2310dac"
       }
     },
     {
@@ -3977,11 +3977,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "maxBy.md",
-        "text": "Returns the maximum value of an array, after mapping each element to a value using the provided function.\r\n\r\nUse `Array.prototype.map()` to map each element to the value returned by `fn`, `Math.max()` to get the maximum value.",
+        "text": "Returns the maximum value 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`, `Math.max()` to get the maximum value.",
         "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",
@@ -3992,7 +3992,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d491f95acc203a508ef388448e4ad3fb841a9a368d8c1a401a8b98e33e90d908"
+        "hash": "00851da4972ff91286aecc46f1070ce619d0d64287ac6a8c90b6f8f3c0da2abc"
       }
     },
     {
@@ -4000,11 +4000,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "maxDate.md",
-        "text": "Returns the maximum of the given dates.\r\n\r\nUse `Math.max.apply()` to find the maximum date value, `new Date()` to convert it to a `Date` object.",
+        "text": "Returns the maximum of the given dates.\n\nUse `Math.max.apply()` to find the maximum date value, `new Date()` to convert it to a `Date` object.",
         "codeBlocks": {
           "es6": "const maxDate = (...dates) => new Date(Math.max.apply(null, ...dates));",
           "es5": "var maxDate = function maxDate() {\n  var _Math$max;\n\n  for (var _len = arguments.length, dates = new Array(_len), _key = 0; _key < _len; _key++) {\n    dates[_key] = arguments[_key];\n  }\n\n  return new Date((_Math$max = Math.max).apply.apply(_Math$max, [null].concat(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",
@@ -4014,7 +4014,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1b236c9ae2f4f640415e63c954b6902e7e6346b3b32c34be8d003e42a283b2f6"
+        "hash": "8d1b95da3bac65bf8a1801edfd1efce94ea17902669a7612c5a0138fad9d0b12"
       }
     },
     {
@@ -4022,11 +4022,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "maxN.md",
-        "text": "Returns the `n` maximum elements from the provided array.\r\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in descending order).\r\n\r\nUse `Array.prototype.sort()` combined with the spread operator (`...`) to create a shallow clone of the array and sort it in descending order.\r\nUse `Array.prototype.slice()` to get the specified number of elements.\r\nOmit the second argument, `n`, to get a one-element array.",
+        "text": "Returns the `n` maximum elements from the provided array.\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in descending order).\n\nUse `Array.prototype.sort()` combined with the spread operator (`...`) to create a shallow clone of the array and sort it in descending order.\nUse `Array.prototype.slice()` to get the specified number of elements.\nOmit the second argument, `n`, to get a one-element array.",
         "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",
@@ -4036,7 +4036,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f22f57bbab2b420a0105e9a5492abdb3763970f27f6cc94e84658ad6dccabb84"
+        "hash": "71e58ca545b7dd0256d29b719b0c48c177968ef615a5ca1fc92377e6a4b089f7"
       }
     },
     {
@@ -4044,9 +4044,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "median.md",
-        "text": "Returns the median of an array of numbers.\r\n\r\nFind the middle of the array, use `Array.prototype.sort()` to sort the values.\r\nReturn the number at the midpoint if `length` is odd, otherwise the average of the two middle numbers.",
+        "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.",
         "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"
         },
@@ -4058,7 +4058,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c9812cc00b275ea43c2833cd3466997441348fba6baa13169b3733b04ec92c4a"
+        "hash": "448c71acf264e7e0752383faf025b6f118a02954cc651c1c5308e3894a83cc44"
       }
     },
     {
@@ -4066,11 +4066,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "memoize.md",
-        "text": "Returns the memoized (cached) function.\r\n\r\nCreate an empty cache by instantiating a new `Map` object.\r\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.\r\nAllow access to the `cache` by setting it as a property on the returned function.",
+        "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.",
         "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",
@@ -4079,7 +4079,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "90e3a88fc1d6657c0abad7ef8bf1d16d63ad79e0a3b3e3333b8d9113dd71b319"
+        "hash": "b0de7050159a7c0fab5a089e2118d3e20d48d96a4aae6a0ddb98f489882bb80f"
       }
     },
     {
@@ -4087,11 +4087,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "merge.md",
-        "text": "Creates a new object from the combination of two or more objects.\r\n\r\nUse `Array.prototype.reduce()` combined with `Object.keys(obj)` to iterate over all objects and keys.\r\nUse `hasOwnProperty()` and `Array.prototype.concat()` to append values for keys existing in multiple objects.",
+        "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.",
         "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 objs.concat().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",
@@ -4101,7 +4101,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "dee7c1bd5e81ac82ced21987d3d0236d5355b79f2fb9755062b77d5c7c13d990"
+        "hash": "13f1b8dca2fb1c6ebba61abb7e5784fc80288e59f4979e463c5f4b81497d76bd"
       }
     },
     {
@@ -4109,11 +4109,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "minBy.md",
-        "text": "Returns the minimum value of an array, after mapping each element to a value using the provided function.\r\n\r\nUse `Array.prototype.map()` to map each element to the value returned by `fn`, `Math.min()` to get the maximum value.",
+        "text": "Returns the minimum value 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`, `Math.min()` to get the maximum value.",
         "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",
@@ -4124,7 +4124,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d067d7b40685a5266757f37ade2f917149faac3eaa5faee2810fc4cef578e75a"
+        "hash": "58be8a0dc3e56ec09b0bb927c2c575c033c70ac3a8b612e993fdcbf6d5a99d51"
       }
     },
     {
@@ -4132,11 +4132,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "minDate.md",
-        "text": "Returns the minimum of the given dates.\r\n\r\nUse `Math.min.apply()` to find the minimum date value, `new Date()` to convert it to a `Date` object.",
+        "text": "Returns the minimum of the given dates.\n\nUse `Math.min.apply()` to find the minimum date value, `new Date()` to convert it to a `Date` object.",
         "codeBlocks": {
           "es6": "const minDate = (...dates) => new Date(Math.min.apply(null, ...dates));",
           "es5": "var minDate = function minDate() {\n  var _Math$min;\n\n  for (var _len = arguments.length, dates = new Array(_len), _key = 0; _key < _len; _key++) {\n    dates[_key] = arguments[_key];\n  }\n\n  return new Date((_Math$min = Math.min).apply.apply(_Math$min, [null].concat(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",
@@ -4146,7 +4146,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2c1a723b2b59c4b20dd60eca4c8bc3fc90bab1351684205f5b9bf6ca95e279b9"
+        "hash": "436e070c2961cd8cbeffbc05fae7b3fa978eefe1e048de248bc17b86a2b06705"
       }
     },
     {
@@ -4154,11 +4154,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "minN.md",
-        "text": "Returns the `n` minimum elements from the provided array.\r\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in ascending order).\r\n\r\nUse `Array.prototype.sort()` combined with the spread operator (`...`) to create a shallow clone of the array and sort it in ascending order.\r\nUse `Array.prototype.slice()` to get the specified number of elements.\r\nOmit the second argument, `n`, to get a one-element array.",
+        "text": "Returns the `n` minimum elements from the provided array.\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in ascending order).\n\nUse `Array.prototype.sort()` combined with the spread operator (`...`) to create a shallow clone of the array and sort it in ascending order.\nUse `Array.prototype.slice()` to get the specified number of elements.\nOmit the second argument, `n`, to get a one-element array.",
         "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",
@@ -4168,7 +4168,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ec485952e6c1e67c11a8a8a92abede71530f5b26dafcd4a2523f85062c434126"
+        "hash": "325ab83a7c6da0d014c69236fc2134080bb8b2e6153608ba63c5924041db1c3a"
       }
     },
     {
@@ -4176,11 +4176,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "mostPerformant.md",
-        "text": "Returns the index of the function in an array of functions which executed the fastest.\r\n\r\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.\r\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.\r\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.",
+        "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.",
         "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",
@@ -4189,7 +4189,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "882a756a416c2458e19592002efd2fa77069a5707a369b6379690700a474840c"
+        "hash": "77b76c99d021860bb2c03c1b0b37f2eeddd9f9c9594aad735744fb1014e3e62a"
       }
     },
     {
@@ -4197,7 +4197,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "negate.md",
-        "text": "Negates a predicate function.\r\n\r\nTake a predicate function and apply the not operator (`!`) to it with its arguments.",
+        "text": "Negates a predicate function.\n\nTake a predicate function and apply the not operator (`!`) to it with its arguments.",
         "codeBlocks": {
           "es6": "const negate = func => (...args) => !func(...args);",
           "es5": "var negate = function negate(func) {\n  return function () {\n    return !func.apply(void 0, arguments);\n  };\n};",
@@ -4210,7 +4210,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8938f36bd51423282e19bf1d4547b8a8a1ebf1882abf7ec4e7ff371922e078e0"
+        "hash": "7cc8011d1cb158b7371144dff98b6243752e862d9dc3786caac77e50539060ed"
       }
     },
     {
@@ -4218,11 +4218,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "nest.md",
-        "text": "Given a flat array of objects linked to one another, it will nest them recursively.\r\nUseful for nesting comments, such as the ones on reddit.com.\r\n\r\nUse recursion.\r\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.\r\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).\r\nOmit the third argument, `link`, to use `'parent_id'` as the default property which links the object to another one by its `id`.",
+        "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`.",
         "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 _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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",
@@ -4231,7 +4231,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c38b3afe1ae7f731a1066e48fe4fae6cf397ee5a052702736c2c4695a29db06e"
+        "hash": "ff06e5aeb0e1159f9193332187323f6a4f990eeddaa4fbc706c5a6025b53290e"
       }
     },
     {
@@ -4239,7 +4239,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "nodeListToArray.md",
-        "text": "Converts a `NodeList` to an array.\r\n\r\nUse spread operator inside new array to convert a `NodeList` to an array.",
+        "text": "Converts a `NodeList` to an array.\n\nUse spread operator inside new array to convert a `NodeList` to an array.",
         "codeBlocks": {
           "es6": "const nodeListToArray = nodeList => [...nodeList];",
           "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 nodeListToArray = function nodeListToArray(nodeList) {\n  return _toConsumableArray(nodeList);\n};",
@@ -4253,7 +4253,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9ff0d5e19de5bf65e96f4b206ac107c7df1ba17741ff0394748af64ec69e61e7"
+        "hash": "50e0b97be1cc2256f34991c379bae0bba8c99db160dcd5842112752074de92ec"
       }
     },
     {
@@ -4261,11 +4261,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "none.md",
-        "text": "Returns `true` if the provided predicate function returns `false` for all elements in a collection, `false` otherwise.\r\n\r\nUse `Array.prototype.some()` to test if any elements in the collection return `true` based on `fn`.\r\nOmit the second argument, `fn`, to use `Boolean` as a default.",
+        "text": "Returns `true` if the provided predicate function returns `false` for all elements in a collection, `false` otherwise.\n\nUse `Array.prototype.some()` to test if any elements in the collection return `true` based on `fn`.\nOmit the second argument, `fn`, to use `Boolean` as a default.",
         "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",
@@ -4275,7 +4275,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d3656fbcb01673a6fc2eabf1724b5f6f3dce1dc00598a56a096bbd708276d6ec"
+        "hash": "efc733592e40a00d2d25b1b1fff5fe8064f9ecc8f67059279d70430c00a7a23c"
       }
     },
     {
@@ -4283,11 +4283,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "nthArg.md",
-        "text": "Creates a function that gets the argument at index `n`. If `n` is negative, the nth argument from the end is returned.\r\n\r\nUse `Array.prototype.slice()` to get the desired argument at index `n`.",
+        "text": "Creates a function that gets the argument at index `n`. If `n` is negative, the nth argument from the end is returned.\n\nUse `Array.prototype.slice()` to get the desired argument at index `n`.",
         "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",
@@ -4297,7 +4297,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "644bb127b78c7b61928b339be65c240412170fd7f83d48801284a6ba1dde61d0"
+        "hash": "0afafa961fb6ef8cef3a7d74fa55d16ccf5c1d94d790e1d1984242fd165770d7"
       }
     },
     {
@@ -4305,11 +4305,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "nthElement.md",
-        "text": "Returns the nth element of an array.\r\n\r\nUse `Array.prototype.slice()` to get an array containing the nth element at the first place.\r\nIf the index is out of bounds, return `undefined`.\r\nOmit the second argument, `n`, to get the first element of the array.",
+        "text": "Returns the nth element of an array.\n\nUse `Array.prototype.slice()` to get an array containing the nth element at the first place.\nIf the index is out of bounds, return `undefined`.\nOmit the second argument, `n`, to get the first element of the array.",
         "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",
@@ -4318,7 +4318,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e6150d0dcf1f124b718dd99d61e167abbdc861a2c67f1d4e681cd8ba13329361"
+        "hash": "20c4b668b37a52e61bbaa72b87a507cd4c7ca770d9e179d753258ccdead5ee6c"
       }
     },
     {
@@ -4326,7 +4326,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "objectFromPairs.md",
-        "text": "Creates an object from the given key-value pairs.\r\n\r\nUse `Array.prototype.reduce()` to create and combine key-value pairs.",
+        "text": "Creates an object from the given key-value pairs.\n\nUse `Array.prototype.reduce()` to create and combine key-value pairs.",
         "codeBlocks": {
           "es6": "const objectFromPairs = arr => arr.reduce((a, [key, val]) => ((a[key] = val), a), {});",
           "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 objectFromPairs = function objectFromPairs(arr) {\n  return arr.reduce(function (a, _ref) {\n    var _ref2 = _slicedToArray(_ref, 2),\n        key = _ref2[0],\n        val = _ref2[1];\n\n    return a[key] = val, a;\n  }, {});\n};",
@@ -4340,7 +4340,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "238beb417839e2f97f5b5b7280d4aa379f2a4ca7a6c04439f056574ed01a48eb"
+        "hash": "2d12e5cb31a3f9dd51639897eaf42ca6844fd2d8a899f51523f8b5a10a8f2348"
       }
     },
     {
@@ -4348,7 +4348,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "objectToPairs.md",
-        "text": "Creates an array of key-value pair arrays from an object.\r\n\r\nUse `Object.keys()` and `Array.prototype.map()` to iterate over the object's keys and produce an array with key-value pairs.",
+        "text": "Creates an array of key-value pair arrays from an object.\n\nUse `Object.keys()` and `Array.prototype.map()` to iterate over the object's keys and produce an array with key-value pairs.",
         "codeBlocks": {
           "es6": "const objectToPairs = obj => Object.keys(obj).map(k => [k, obj[k]]);",
           "es5": "var objectToPairs = function objectToPairs(obj) {\n  return Object.keys(obj).map(function (k) {\n    return [k, obj[k]];\n  });\n};",
@@ -4362,7 +4362,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "530332df39ab0e9669de9fc039cfd90a36f984977d449a572da3b06092da7017"
+        "hash": "251db16d7571ac9e81cde0ca431de71ecb2b9817a07b5075834072dc10eb9989"
       }
     },
     {
@@ -4370,11 +4370,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "observeMutations.md",
-        "text": "Returns a new MutationObserver and runs the provided callback for each mutation on the specified element.\r\n\r\nUse a [`MutationObserver`](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver) to observe mutations on the given element.\r\nUse `Array.prototype.forEach()` to run the callback for each mutation that is observed.\r\nOmit the third argument, `options`, to use the default [options](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver#MutationObserverInit) (all `true`).",
+        "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`).",
         "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",
@@ -4384,7 +4384,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b66745bdc310babb7f8b44d27dff3ffc14b665aa95f569fde6d2a05082808890"
+        "hash": "043ee85dc41a7310271c16b31c9a2b3e662b83c1108a04490c753f1dd0473929"
       }
     },
     {
@@ -4392,11 +4392,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "off.md",
-        "text": "Removes an event listener from an element.\r\n\r\nUse `EventTarget.removeEventListener()` to remove an event listener from an element. \r\nOmit the fourth argument `opts` to use `false` or specify it based on the options used when the event listener was added.",
+        "text": "Removes an event listener from an element.\n\nUse `EventTarget.removeEventListener()` to remove an event listener from an element. \nOmit the fourth argument `opts` to use `false` or specify it based on the options used when the event listener was added.",
         "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",
@@ -4406,7 +4406,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "613baa2166459b02d033323f517bd6a646eab362ac6ecb74841757353ac41482"
+        "hash": "875854e1205203c8e8bff08adbf474ff88cbca4d33d49cb68417a72620096171"
       }
     },
     {
@@ -4414,11 +4414,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "offset.md",
-        "text": "Moves the specified amount of elements to the end of the array.\r\n\r\nUse `Array.prototype.slice()` twice to get the elements after the specified index and the elements before that.\r\nUse the spread operator(`...`) to combine the two into one array.\r\nIf `offset` is negative, the elements will be moved from end to start.",
+        "text": "Moves the specified amount of elements to the end of the array.\n\nUse `Array.prototype.slice()` twice to get the elements after the specified index and the elements before that.\nUse the spread operator(`...`) to combine the two into one array.\nIf `offset` is negative, the elements will be moved from end to start.",
         "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 _toConsumableArray(arr.slice(_offset)).concat(_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",
@@ -4427,7 +4427,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "459a1219cd120f25d786b945fa76b9875f22bb803cc2e1541e8bbfa596a0072c"
+        "hash": "f00343d616edbcad85ba18f1eb279f55bc663512ab725a6ea5ca0b94903164a8"
       }
     },
     {
@@ -4435,9 +4435,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "omit.md",
-        "text": "Omits the key-value pairs corresponding to the given keys from an object.\r\n\r\nUse `Object.keys(obj)`, `Array.prototype.filter()` and `Array.prototype.includes()` to remove the provided keys.\r\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.",
+        "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.",
         "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 }"
         },
@@ -4449,7 +4449,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9a569def20e0de06c19e532769db17a4475b4c431e426bd6923422f3e2b9fee9"
+        "hash": "0a91b2ae1b488c8a3ac1d732d48396ea0545314114d97ff559f6c6b275b8e2b1"
       }
     },
     {
@@ -4457,9 +4457,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "omitBy.md",
-        "text": "Creates an object composed of the properties the given function returns falsey for. The function is invoked with two arguments: (value, key).\r\n\r\nUse `Object.keys(obj)` and `Array.prototype.filter()`to remove the keys for which `fn` returns a truthy value.\r\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.",
+        "text": "Creates an object composed of the properties the given function returns falsey 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.",
         "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' }"
         },
@@ -4472,7 +4472,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f89538ff95a3fff3efdf13b0765dd03ccdeaa1fcc7242d61b5a0e73aca9fdc6e"
+        "hash": "359fd8eb0861de57213387e715687174cf671e22e9b66e358ac28364ad1b2be2"
       }
     },
     {
@@ -4480,11 +4480,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "on.md",
-        "text": "Adds an event listener to an element with the ability to use event delegation.\r\n\r\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.\r\nReturns a reference to the custom delegator function, in order to be possible to use with [`off`](#off).\r\nOmit `opts` to default to non-delegation behavior and event bubbling.",
+        "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.",
         "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",
@@ -4494,7 +4494,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c5f26491c28670e971d9049b74ff79ed933a2d92ad29a117d324c131e8205be5"
+        "hash": "9baea961cebb81bcaec83515bc98ca1e77affc03b2550c88e5d559973025d3d7"
       }
     },
     {
@@ -4502,11 +4502,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "once.md",
-        "text": "Ensures a function is called only once.\r\n\r\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.\r\nAllow the function to be supplied with an arbitrary number of arguments using the rest/spread (`...`) operator.",
+        "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.",
         "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",
@@ -4515,7 +4515,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "60c1b3e83e55b2cef66ffc26f92f419998b1aff51c6194a176c35c20384930cb"
+        "hash": "66051661cb13aa6295a539dda924cb6d55964fc0a438448414decaadbcc64637"
       }
     },
     {
@@ -4523,11 +4523,11 @@
       "type": "snippet",
       "attributes": {
         "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).\r\n\r\nUse two event listeners. Assume `mouse` input initially and bind a `touchstart` event listener to the document. \r\nOn `touchstart`, add a `mousemove` event listener to listen for two consecutive `mousemove` events firing within 20ms, using `performance.now()`.\r\nRun the callback with the input type as an argument in either of these situations.",
+        "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.",
         "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",
@@ -4537,7 +4537,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "63a0e9adf1f1a85654347946c634d49a3b84bfa1a11cd609c00102ec523171d9"
+        "hash": "f42b7a49b6b92be7da1537a058588818c05d1110150fcad063c4325665a4d4e3"
       }
     },
     {
@@ -4545,11 +4545,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "orderBy.md",
-        "text": "Returns a sorted array of objects ordered by properties and orders.\r\n\r\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.\r\nIf no `orders` array is passed it sort by `'asc'` by default.",
+        "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.",
         "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",
@@ -4559,7 +4559,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "64804da8497f144eb45aba279229225d446133c09e32592eae96789ca1f36cfb"
+        "hash": "1a1adbe92bb44aa61583613d8aebf70143f4ac9cd9aae2afa1d5ac88410958d7"
       }
     },
     {
@@ -4567,11 +4567,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "over.md",
-        "text": "Creates a function that invokes each provided function with the arguments it receives and returns the results.\r\n\r\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments.",
+        "text": "Creates a function that invokes each provided function with the arguments it receives and returns the results.\n\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments.",
         "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",
@@ -4581,7 +4581,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "fb4809f344855c8a97ea2bad4f0aba5a8a55f7211739a70bb9a0700952cc822a"
+        "hash": "c888834c4829c50c67c9828127ff4b8b810d99925202dd2cc42110ad32010ea7"
       }
     },
     {
@@ -4589,11 +4589,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "overArgs.md",
-        "text": "Creates a function that invokes the provided function with its arguments transformed.\r\n\r\nUse `Array.prototype.map()` to apply `transforms` to `args` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`.",
+        "text": "Creates a function that invokes the provided function with its arguments transformed.\n\nUse `Array.prototype.map()` to apply `transforms` to `args` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`.",
         "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",
@@ -4603,7 +4603,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b6382880e8c13b2dcc19dbf8530b9f8aee18fd967494e68a1c0afb2a62952173"
+        "hash": "50d31769481bb1a8c09db3bcece1b3c8346fb83f9db32d5ae0c99f09e3b45eaf"
       }
     },
     {
@@ -4611,11 +4611,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pad.md",
-        "text": "Pads a string on both sides with the specified character, if it's shorter than the specified length.\r\n\r\nUse `String.padStart()` and `String.padEnd()` to pad both sides of the given string.\r\nOmit the third argument, `char`, to use the whitespace character as the default padding character.",
+        "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.",
         "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  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",
@@ -4624,7 +4624,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "cd37c59287935e9cb0c9061c86f80b307252f6f64e47b5fbd6045970d492e59f"
+        "hash": "9a7c678e67831c68d0589a63a2928d4b68e4defa7a015d598dda253710401902"
       }
     },
     {
@@ -4632,9 +4632,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "palindrome.md",
-        "text": "Returns `true` if the given string is a palindrome, `false` otherwise.\r\n\r\nConvert the string to `String.prototype.toLowerCase()` and use `String.prototype.replace()` to remove non-alphanumeric characters from it.\r\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()`.",
+        "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()`.",
         "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"
         },
@@ -4645,7 +4645,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3d740895ae6737664c616285a734c79fa01896a1cc7dfdf434046bac3ce972c7"
+        "hash": "497b0275ae10369768d3c3c1db1b4de53ff82f64be838e5fd38ba469a88b4de9"
       }
     },
     {
@@ -4653,9 +4653,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "parseCookie.md",
-        "text": "Parse an HTTP Cookie header string and return an object of all cookie name-value pairs.\r\n\r\nUse `String.prototype.split(';')` to separate key-value pairs from each other.\r\nUse `Array.prototype.map()` and `String.prototype.split('=')` to separate keys from values in each pair.\r\nUse `Array.prototype.reduce()` and `decodeURIComponent()` to create an object with all key-value pairs.",
+        "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.",
         "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' }"
         },
@@ -4667,7 +4667,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "59cb5560cf5dd5696c1d8b664db8c12f9c9dbf43d5e5fdb4ec6be6cac4ee88dc"
+        "hash": "634d9c15c437db3db0789f91c3aff73e469714a1dbd28af731a52ae1d7fd6443"
       }
     },
     {
@@ -4675,11 +4675,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "partial.md",
-        "text": "Creates a function that invokes `fn` with `partials` prepended to the arguments it receives.\r\n\r\nUse the spread operator (`...`) to prepend `partials` to the list of arguments of `fn`.",
+        "text": "Creates a function that invokes `fn` with `partials` prepended to the arguments it receives.\n\nUse the spread operator (`...`) to prepend `partials` to the list of arguments of `fn`.",
         "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",
@@ -4688,7 +4688,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d3827db0162532e28149d341c08b1d2ae72f36b0b3b480407ef7dca211c9abb1"
+        "hash": "b57e228d9f4be72f0b54e613db0d03f8f580c79e48cd7ba43673eaac874fd057"
       }
     },
     {
@@ -4696,11 +4696,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "partialRight.md",
-        "text": "Creates a function that invokes `fn` with `partials` appended to the arguments it receives.\r\n\r\nUse the spread operator (`...`) to append `partials` to the list of arguments of `fn`.",
+        "text": "Creates a function that invokes `fn` with `partials` appended to the arguments it receives.\n\nUse the spread operator (`...`) to append `partials` to the list of arguments of `fn`.",
         "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",
@@ -4709,7 +4709,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d7e22ab0e1ce71ae47687441dd234141f2a2f70fab5f3a6b59d7015e924e517a"
+        "hash": "907872c83c8820b239838c65f4d5174783e372275e85fd96050d9218932325b4"
       }
     },
     {
@@ -4717,11 +4717,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "partition.md",
-        "text": "Groups the elements into two arrays, depending on the provided function's truthiness for each element.\r\n\r\nUse `Array.prototype.reduce()` to create an array of two arrays.\r\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.",
+        "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.",
         "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",
@@ -4732,7 +4732,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f36dd78818c8651d6318a2bd6777dca10c7f8f3cbea010ac877c1e3ff0b2f89a"
+        "hash": "578eac814b69f7854e2febd57c64bf3323fe2e59beea24e5708fef5d64f7856c"
       }
     },
     {
@@ -4740,9 +4740,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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.",
+        "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.",
         "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"
         },
@@ -4753,7 +4753,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d19b9746c57b6acf9596a3ea840b5e1b9a3e4bad9212a3b155a6b7f00df70662"
+        "hash": "8343f8ddd30fced511584cb972818cf5c0e6e8cf9a6ea74071d254c3b6808061"
       }
     },
     {
@@ -4761,9 +4761,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nGenerates all permutations of an array's elements (contains duplicates).\r\n\r\nUse recursion.\r\nFor each element in the given array, create all the partial permutations for the rest of its elements.\r\nUse `Array.prototype.map()` to combine the element with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\r\nBase cases are for array `length` equal to `2` or `1`.",
+        "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`.",
         "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(_toConsumableArray(arr.slice(0, i)).concat(_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 ] ]"
         },
@@ -4775,7 +4775,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f19fae2a6a1340bfaeab71ce9e7bd6e4ac9eb691134ff31993631fb83043a548"
+        "hash": "ed705722088f82143e0af891539884b168f192f28e2c3926d2a15a26ae9ef539"
       }
     },
     {
@@ -4783,9 +4783,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pick.md",
-        "text": "Picks the key-value pairs corresponding to the given keys from an object.\r\n\r\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.",
+        "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.",
         "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 }"
         },
@@ -4797,7 +4797,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "cd4dd587b174804aa64f07e96ba9ed1f7d39833014eb569c30f8689a61825a3d"
+        "hash": "31d70a01cc4a9045343efcd04f041bb6b4a9754dfa1665ed6aa546003803d6dd"
       }
     },
     {
@@ -4805,9 +4805,9 @@
       "type": "snippet",
       "attributes": {
         "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).\r\n\r\nUse `Object.keys(obj)` and `Array.prototype.filter()`to remove the keys for which `fn` returns a falsey value.\r\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.",
+        "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 falsey value.\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs.",
         "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 }"
         },
@@ -4820,7 +4820,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "30b1d3168c53ea5658e2707cb03bef76c1864d5c0900d50ae8b9d25f0237bf1a"
+        "hash": "0842f93bde56f28c9663d341314b7e27b71a686784e7276b34909b0fa5551502"
       }
     },
     {
@@ -4828,11 +4828,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pipeAsyncFunctions.md",
-        "text": "Performs left-to-right function composition for asynchronous functions.\r\n\r\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition using `Promise.then()`.\r\nThe functions can return a combination of: simple values, `Promise`'s, or they can be defined as `async` ones returning through `await`.\r\nAll functions must be unary.",
+        "text": "Performs left-to-right function composition for asynchronous functions.\n\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition using `Promise.then()`.\nThe functions can return a combination of: simple values, `Promise`'s, or they can be defined as `async` ones returning through `await`.\nAll functions must be unary.",
         "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",
@@ -4843,7 +4843,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6a7d303a9761c57b32f977b8068de4fd9bd9ea72167df268220d13250d1483e5"
+        "hash": "4815876fd6dbb17ad34c0d8918e7a72d837104f9beee7dc51b0fa73057b9e83e"
       }
     },
     {
@@ -4851,11 +4851,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pipeFunctions.md",
-        "text": "Performs left-to-right function composition.\r\n\r\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition.\r\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary.",
+        "text": "Performs left-to-right function composition.\n\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition.\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary.",
         "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",
@@ -4865,7 +4865,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d9cd8f57c25f07245ee3e1dddd678e8cc1bde159ed0e1e39e4ab78d59100c2c3"
+        "hash": "3603cce07f53157cdf5d69e262bf0bd61c3103b5afd9e3d892cd4db39b037785"
       }
     },
     {
@@ -4873,11 +4873,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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.",
+        "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.",
         "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",
@@ -4886,7 +4886,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "68a521d9ba019afbdd726791f0a2aaab948ad142f3b64b657e5a88239f9e6cb8"
+        "hash": "9270afe4dfddee1974a2535ea2625e6130c41cbb890784ca837dd34df4efd030"
       }
     },
     {
@@ -4894,7 +4894,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "powerset.md",
-        "text": "Returns the powerset of a given array of numbers.\r\n\r\nUse `Array.prototype.reduce()` combined with `Array.prototype.map()` to iterate over elements and combine into an array containing all combinations.",
+        "text": "Returns the powerset of a given array of numbers.\n\nUse `Array.prototype.reduce()` combined with `Array.prototype.map()` to iterate over elements and combine into an array containing all combinations.",
         "codeBlocks": {
           "es6": "const powerset = arr => arr.reduce((a, v) => a.concat(a.map(r => [v].concat(r))), [[]]);",
           "es5": "var powerset = function powerset(arr) {\n  return arr.reduce(function (a, v) {\n    return a.concat(a.map(function (r) {\n      return [v].concat(r);\n    }));\n  }, [[]]);\n};",
@@ -4907,7 +4907,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "07e75d7e2e690176f49a9c730ba84a3715b1bd6af4a8b661818997efb13def35"
+        "hash": "21941200f0c5bfd1dedb00cd4a8dfd799062d7fe43cf8a82c0483e54b560ac0d"
       }
     },
     {
@@ -4915,9 +4915,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "prefix.md",
-        "text": "Returns the prefixed version (if necessary) of a CSS property that the browser supports.\r\n\r\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`.\r\nUse `String.prototype.charAt()` and `String.prototype.toUpperCase()` to capitalize the property, which will be appended to the vendor prefix string.",
+        "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.",
         "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'"
         },
@@ -4929,7 +4929,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "020ca3b3b1c660acc9735d2b331008c2c2a3d8ba587fbfa3be932a3fce0e5dcc"
+        "hash": "e8875fbdf505642806ab6f98b68e4ebce935e87b78a639b74a3dce8eb6f6e9a5"
       }
     },
     {
@@ -4937,11 +4937,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "prettyBytes.md",
-        "text": "Converts a number in bytes to a human-readable string.\r\n\r\nUse an array dictionary of units to be accessed based on the exponent.\r\nUse `Number.toPrecision()` to truncate the number to a certain number of digits.\r\nReturn the prettified string by building it up, taking into account the supplied options and whether it is negative or not.\r\nOmit the second argument, `precision`, to use a default precision of `3` digits.\r\nOmit the third argument, `addSpace`, to add space between the number and unit by default.",
+        "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.",
         "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",
@@ -4952,7 +4952,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "08cbd19f78bf3794926f6c3d138587567efcff45dd176d9d4f76466be174f99b"
+        "hash": "5f269ecc2da6d263be94fb94725167f0a2002e1eeb3fd2123ffc9403a2ef2933"
       }
     },
     {
@@ -4960,9 +4960,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "primes.md",
-        "text": "Generates primes up to a given number, using the Sieve of Eratosthenes.\r\n\r\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.",
+        "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.",
         "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]"
         },
@@ -4974,7 +4974,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "396e855d00edac72c4a96c10926f7c74888260527db1fe077f2621a2d7326c1b"
+        "hash": "6d0f66159240aa2ef6015747b2530d0a7191ec3810f3c502d9bd156012603d45"
       }
     },
     {
@@ -4982,11 +4982,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "promisify.md",
-        "text": "Converts an asynchronous function to return a promise.\r\n\r\nUse currying to return a function returning a `Promise` that calls the original function.\r\nUse the `...rest` operator to pass in all the parameters.\r\n\r\n*In Node 8+, you can use [`util.promisify`](https://nodejs.org/api/util.html#util_util_promisify_original)*",
+        "text": "Converts an asynchronous function to return a promise.\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*In Node 8+, you can use [`util.promisify`](https://nodejs.org/api/util.html#util_util_promisify_original)*",
         "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",
@@ -4997,7 +4997,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ff6279ccbfbe62a34cebe03db88ba4be61d227224a3f4c51775f8a480ef1dffb"
+        "hash": "d269b5a8124cd646189075c2679331bbadbb3cd535a1e3135d12f7de46836dda"
       }
     },
     {
@@ -5005,11 +5005,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pull.md",
-        "text": "Mutates the original array to filter out the values specified.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\r\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.\r\n\r\n_(For a snippet that does not mutate the original array see [`without`](#without))_",
+        "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_(For a snippet that does not mutate the original array see [`without`](#without))_",
         "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",
@@ -5018,7 +5018,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0dc16efb9147bf354edfd96360c92fbc9dea6ac781cddda720e79a66bfce9d5b"
+        "hash": "eed98a26fc85c7684508f33ab909070e6205747990c5e4562f2d120728bd6a3c"
       }
     },
     {
@@ -5026,11 +5026,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pullAtIndex.md",
-        "text": "Mutates the original array to filter out the values at the specified indexes.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\r\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.\r\nUse `Array.prototype.push()` to keep track of pulled values",
+        "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",
         "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",
@@ -5039,7 +5039,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "fa081f50a7b00bd86731269741dfef4dd2d9af97cbe1588dc3f3fe3f258c88a4"
+        "hash": "d034820c71f581ba5cdce7ab47e4fb0ff64baf554c1f19a0e45c5d0e71eeae4c"
       }
     },
     {
@@ -5047,11 +5047,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pullAtValue.md",
-        "text": "Mutates the original array to filter out the values specified. Returns the removed elements.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\r\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.\r\nUse `Array.prototype.push()` to keep track of pulled values",
+        "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",
         "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",
@@ -5060,7 +5060,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "672673d9b11ad533f4d70732d1ccb1cb3d4e4bf2884c64506e577f1765f0d265"
+        "hash": "e1e0ce4362866a007fe261a0b7995282b5e579397517a71202cd9bb89d021d48"
       }
     },
     {
@@ -5068,11 +5068,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pullBy.md",
-        "text": "Mutates the original array to filter out the values specified, based on a given iterator function.\r\n\r\nCheck if the last argument provided in a function.\r\nUse `Array.prototype.map()` to apply the iterator function `fn` to all array elements.\r\nUse `Array.prototype.filter()` and `Array.prototype.includes()` to pull out the values that are not needed.\r\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.",
+        "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.",
         "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",
@@ -5082,7 +5082,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "fa4acc5a88a324bc7fed7971a3cca499f936f0f6ceda490d11d19edeeee1a947"
+        "hash": "6e597c1a6a73606b584d7be8f1a4974cd312a2ec5c500078ce146609e6ecc537"
       }
     },
     {
@@ -5090,7 +5090,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "radsToDegrees.md",
-        "text": "Converts an angle from radians to degrees.\r\n\r\nUse `Math.PI` and the radian to degree formula to convert the angle from radians to degrees.",
+        "text": "Converts an angle from radians to degrees.\n\nUse `Math.PI` and the radian to degree formula to convert the angle from radians to degrees.",
         "codeBlocks": {
           "es6": "const radsToDegrees = rad => (rad * 180.0) / Math.PI;",
           "es5": "var radsToDegrees = function radsToDegrees(rad) {\n  return rad * 180.0 / Math.PI;\n};",
@@ -5103,7 +5103,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4210a848f9b827e5305d7fbe20af9e4bb6b762235fda60c865e1d86d122995da"
+        "hash": "b749df623cb50779135ffb38d968cc58d9a8d5d1eadeacfa1d9eec43641c8e9e"
       }
     },
     {
@@ -5111,9 +5111,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "randomHexColorCode.md",
-        "text": "Generates a random hexadecimal color code.\r\n\r\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)`.",
+        "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)`.",
         "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\""
         },
@@ -5125,7 +5125,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6af176c0007886231038d513047c089a03200647c960ecb27b7b624e2629c913"
+        "hash": "038ef05a24294c7bb16d04d465628066418099465e99c020a21d073372ebe0cc"
       }
     },
     {
@@ -5133,9 +5133,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "randomIntArrayInRange.md",
-        "text": "Returns an array of n random integers in the specified range.\r\n\r\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.",
+        "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.",
         "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 ]"
         },
@@ -5148,7 +5148,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0e2974d577b4265fee1d9996d563571c50baed64300e7e26a58e5afe2460d606"
+        "hash": "f5c5c857e9d57ef7c22734163098e058d050ad0a9e3f28c57b307695ee982514"
       }
     },
     {
@@ -5156,7 +5156,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "randomIntegerInRange.md",
-        "text": "Returns a random integer in the specified range.\r\n\r\nUse `Math.random()` to generate a random number and map it to the desired range, using `Math.floor()` to make it an integer.",
+        "text": "Returns a random integer in the specified range.\n\nUse `Math.random()` to generate a random number and map it to the desired range, using `Math.floor()` to make it an integer.",
         "codeBlocks": {
           "es6": "const randomIntegerInRange = (min, max) => Math.floor(Math.random() * (max - min + 1)) + min;",
           "es5": "var randomIntegerInRange = function randomIntegerInRange(min, max) {\n  return Math.floor(Math.random() * (max - min + 1)) + min;\n};",
@@ -5171,7 +5171,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3671edd45cd63b16e866873a2b7537de33e1e0cbd2a7add3508e710866bcfec2"
+        "hash": "791ff20ffbb7736f586cafa1106f6e77e8e89d497bc8a479c0a0cd708fb907ce"
       }
     },
     {
@@ -5179,7 +5179,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "randomNumberInRange.md",
-        "text": "Returns a random number in the specified range.\r\n\r\nUse `Math.random()` to generate a random value, map it to the desired range using multiplication.",
+        "text": "Returns a random number in the specified range.\n\nUse `Math.random()` to generate a random value, map it to the desired range using multiplication.",
         "codeBlocks": {
           "es6": "const randomNumberInRange = (min, max) => Math.random() * (max - min) + min;",
           "es5": "var randomNumberInRange = function randomNumberInRange(min, max) {\n  return Math.random() * (max - min) + min;\n};",
@@ -5194,7 +5194,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "cd948adcd19d7fb08a7b2cc4a6fb05b6f4e778a2ffd67a7b6395020ee15c54ff"
+        "hash": "0ebc2c972fac7d4a8438188025158e0f75456b3787ecf2faae9d3db8d12ee677"
       }
     },
     {
@@ -5202,11 +5202,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "readFileLines.md",
-        "text": "Returns an array of lines from the specified file.\r\n\r\nUse `readFileSync` function in `fs` node package to create a `Buffer` from a file.\r\nconvert buffer to string using `toString(encoding)` function.\r\ncreating an array from contents of file by `split`ing file content line by line (each `\\n`).",
+        "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`).",
         "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",
@@ -5217,7 +5217,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a9b7afa2742b948b79cc30f06512c0b6db396f6e27c299c5280da4b5a423975b"
+        "hash": "8463ee2c8b3e9165b105ee90b59e143a4f1c8b60f8080770d94ec0bbcb455bb6"
       }
     },
     {
@@ -5225,11 +5225,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "rearg.md",
-        "text": "Creates a function that invokes the provided function with its arguments arranged according to the specified indexes.\r\n\r\nUse `Array.prototype.map()` to reorder arguments based on `indexes` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`.",
+        "text": "Creates a function that invokes the provided function with its arguments arranged according to the specified indexes.\n\nUse `Array.prototype.map()` to reorder arguments based on `indexes` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`.",
         "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",
@@ -5239,7 +5239,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4cd92aefc779a6c7ef6bb2ff6676666e77ebe7f1b8ea9fbe5b37f42b158774f9"
+        "hash": "b0007cb91fbeab8d350028d5ae4448c366e79264de6c88e8fa15743158b1a927"
       }
     },
     {
@@ -5247,11 +5247,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "recordAnimationFrames.md",
-        "text": "Invokes the provided callback on each animation frame.\r\n\r\nUse recursion. \r\nProvided that `running` is `true`, continue invoking `window.requestAnimationFrame()` which invokes the provided callback. \r\nReturn an object with two methods `start` and `stop` to allow manual control of the recording. \r\nOmit the second argument, `autoStart`, to implicitly call `start` when the function is invoked.",
+        "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.",
         "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",
@@ -5261,7 +5261,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c5a8561508b12f6698e8b9e3195ac8e1002ca429eb9679f3e752bec2114c1e72"
+        "hash": "461445d77d76f9f3bc05c2bc534cfb551689a99b1b73995ba7f4066a38c60fc7"
       }
     },
     {
@@ -5269,9 +5269,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "redirect.md",
-        "text": "Redirects to a specified URL.\r\n\r\nUse `window.location.href` or `window.location.replace()` to redirect to `url`.\r\nPass a second argument to simulate a link click (`true` - default) or an HTTP redirect (`false`).",
+        "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`).",
         "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');"
         },
@@ -5283,7 +5283,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "61bf6a1efcf5c0191d77af67f93e8e7abbe6963aba8e16058d2b5dfdc353dd40"
+        "hash": "dba349eee909dff1e13e6708ac067e1e7e776ff5862e79097aca630548846ed6"
       }
     },
     {
@@ -5291,11 +5291,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "reducedFilter.md",
-        "text": "Filter an array of objects based on a condition while also filtering out unspecified keys.\r\n\r\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.\r\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.",
+        "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.",
         "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",
@@ -5304,7 +5304,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ec119d6e6b0af832bf8fa4983f08710becf372e2deb3c5f4d87f3327c25b48d4"
+        "hash": "90f20d7a605d4ec82be0bf5d4891d16d68639e9fbce578fe1c7e38c0d9027f03"
       }
     },
     {
@@ -5312,9 +5312,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nUse `Array.prototype.reduce()` to apply the given function to the given array, storing each new result.",
+        "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.",
         "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]"
         },
@@ -5326,7 +5326,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f81e4a576e8f8db8a15a4f95162a840c38686b68dd9665567388d098950d6386"
+        "hash": "2eaf8ad72f65e8c4476c13e1c9b88967346df47c9cfddb6c9a7edcebcdb65304"
       }
     },
     {
@@ -5334,11 +5334,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "reduceWhich.md",
-        "text": "Returns the minimum/maximum value of an array, after applying the provided function to set comparing rule.\r\n\r\nUse `Array.prototype.reduce()` in combination with the `comparator` function to get the appropriate element in the array.\r\nYou can omit the second parameter, `comparator`, to use the default one that returns the minimum element in the array.",
+        "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.",
         "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",
@@ -5348,7 +5348,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "bb8227393be4c10ae717e4452b194258b7b49864925e40aa18c84d7be154d858"
+        "hash": "f0ac72c245cd8a375c6838281de679f0bfbe4326277ef64bf36589eede9d82fe"
       }
     },
     {
@@ -5360,7 +5360,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",
@@ -5369,7 +5369,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6009ce058c2a733ee2e0541f45a6bb96fad7bec1ff7d2cee9262bf1cd388b654"
+        "hash": "523ed896411e3460f65347a417d12e1ec2c62cc0d97ae474d69927d12c01b4c8"
       }
     },
     {
@@ -5377,9 +5377,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "remove.md",
-        "text": "Removes elements from an array for which the given function returns `false`.\r\n\r\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\r\nThe `func` is invoked with three arguments (`value, index, array`).",
+        "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`).",
         "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]"
         },
@@ -5390,7 +5390,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7a8643d6d71023c773ccb63efe25e4c9fe0bdd976a8a8f76f6f6a0abb928eaf1"
+        "hash": "ec9cb9384817f84cf0bacd62a23b69b2304fa2cf0352b16d3950b21d48c04f11"
       }
     },
     {
@@ -5398,7 +5398,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "removeNonASCII.md",
-        "text": "Removes non-printable ASCII characters.\r\n\r\nUse a regular expression to remove non-printable ASCII characters.",
+        "text": "Removes non-printable ASCII characters.\n\nUse a regular expression to remove non-printable ASCII characters.",
         "codeBlocks": {
           "es6": "const removeNonASCII = str => str.replace(/[^\\x20-\\x7E]/g, '');",
           "es5": "var removeNonASCII = function removeNonASCII(str) {\n  return str.replace(/[^\\x20-\\x7E]/g, '');\n};",
@@ -5412,7 +5412,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e16f5691d22aa4cd48e1b64f33ae50f973fffa168264c15c4602c595b9fdfec7"
+        "hash": "00483703389f0ba2b0ed4bdb8ef9f68e4de1a19b209655d85e4fcef0a16a660c"
       }
     },
     {
@@ -5420,11 +5420,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "renameKeys.md",
-        "text": "Replaces the names of multiple object keys with the values provided.\r\n\r\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`.",
+        "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`.",
         "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 _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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",
@@ -5433,7 +5433,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2b9a2f5456f0ed9bdd3726cf88a69775f2e3448d301fb77448015bee3f95bad4"
+        "hash": "bf42670ada90c9ea2a790523ce7ea1f140523f5d47b0f06808c32e4f174906d8"
       }
     },
     {
@@ -5441,7 +5441,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "reverseString.md",
-        "text": "Reverses a string.\r\n\r\nUse the spread operator (`...`) and `Array.prototype.reverse()` to reverse the order of the characters in the string.\r\nCombine characters to get a string using `String.prototype.join('')`.",
+        "text": "Reverses a string.\n\nUse the spread operator (`...`) and `Array.prototype.reverse()` to reverse the order of the characters in the string.\nCombine characters to get a string using `String.prototype.join('')`.",
         "codeBlocks": {
           "es6": "const reverseString = str => [...str].reverse().join('');",
           "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 reverseString = function reverseString(str) {\n  return _toConsumableArray(str).reverse().join('');\n};",
@@ -5455,7 +5455,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f570571660f62af4f962b7271d9f377d9c2bde92e2cca567ce5c357a5659afcf"
+        "hash": "32cbb7ef4ab365f228c244ad3ad8b87d88ef08426807031dbd87b709c76c61d4"
       }
     },
     {
@@ -5463,7 +5463,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "RGBToHex.md",
-        "text": "Converts the values of RGB components to a color code.\r\n\r\nConvert given RGB parameters to hexadecimal string using bitwise left-shift operator (`<<`) and `toString(16)`, then `String.padStart(6,'0')` to get a 6-digit hexadecimal value.",
+        "text": "Converts the values of RGB components to a color code.\n\nConvert given RGB parameters to hexadecimal string using bitwise left-shift operator (`<<`) and `toString(16)`, then `String.padStart(6,'0')` to get a 6-digit hexadecimal value.",
         "codeBlocks": {
           "es6": "const RGBToHex = (r, g, b) => ((r << 16) + (g << 8) + b).toString(16).padStart(6, '0');",
           "es5": "var RGBToHex = function RGBToHex(r, g, b) {\n  return ((r << 16) + (g << 8) + b).toString(16).padStart(6, '0');\n};",
@@ -5476,7 +5476,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "120d6ff54bbe75a7c58ad50a14f77a895a5369cb71157826642e8d5bd1434ad9"
+        "hash": "92e4282492b80dbbd7efa34ae308bcda2c8c6865615e64049bf34dd8eb3f4810"
       }
     },
     {
@@ -5484,7 +5484,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "round.md",
-        "text": "Rounds a number to a specified amount of digits.\r\n\r\nUse `Math.round()` and template literals to round the number to the specified number of digits.\r\nOmit the second argument, `decimals` to round to an integer.",
+        "text": "Rounds a number to a specified amount of digits.\n\nUse `Math.round()` and template literals to round the number to the specified number of digits.\nOmit the second argument, `decimals` to round to an integer.",
         "codeBlocks": {
           "es6": "const round = (n, decimals = 0) => Number(`${Math.round(`${n}e${decimals}`)}e-${decimals}`);",
           "es5": "var round = function round(n) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  return Number(\"\".concat(Math.round(\"\".concat(n, \"e\").concat(decimals)), \"e-\").concat(decimals));\n};",
@@ -5497,7 +5497,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "19b33182a5dc111794b5d04b39cdbd6efc8a9140d8008e9563c99f4e3e5d4d42"
+        "hash": "6170ee4eec91a2bf73961a9cc15ce90c48fbf15caf11363c12b3d6478efa48ea"
       }
     },
     {
@@ -5505,11 +5505,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nCreate a new `Worker` using a `Blob` object URL, the contents of which should be the stringified version of the supplied function.\r\nImmediately post the return value of calling the function back.\r\nReturn a promise, listening for `onmessage` and `onerror` events and resolving the data posted back from the worker, or throwing an error.",
+        "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.",
         "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",
@@ -5521,7 +5521,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e3055f01701b8ac5da52f81cf8ba84e1866bee92ea70a3f34689a18cbeb2a581"
+        "hash": "39ed2d279733ad4061a381d85afccd111f56d15053132858991daf02e2c7fb36"
       }
     },
     {
@@ -5529,11 +5529,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "runPromisesInSeries.md",
-        "text": "Runs an array of promises in series.\r\n\r\nUse `Array.prototype.reduce()` to create a promise chain, where each promise returns the next promise when resolved.",
+        "text": "Runs an array of promises in series.\n\nUse `Array.prototype.reduce()` to create a promise chain, where each promise returns the next promise when resolved.",
         "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",
@@ -5543,7 +5543,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "60866df7986ecdf0883b9dd4b3416f45a88da2e5baea6d785923c0092b9216e1"
+        "hash": "b47ebe31470158288d2f5c1ff80fd72b2b5779442ff1b2732217c09adb976447"
       }
     },
     {
@@ -5551,7 +5551,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sample.md",
-        "text": "Returns a random element from an array.\r\n\r\nUse `Math.random()` to generate a random number, multiply it by `length` and round it off to the nearest whole number using `Math.floor()`.\r\nThis method also works with strings.",
+        "text": "Returns a random element from an array.\n\nUse `Math.random()` to generate a random number, multiply it by `length` and round it off to the nearest whole number using `Math.floor()`.\nThis method also works with strings.",
         "codeBlocks": {
           "es6": "const sample = arr => arr[Math.floor(Math.random() * arr.length)];",
           "es5": "var sample = function sample(arr) {\n  return arr[Math.floor(Math.random() * arr.length)];\n};",
@@ -5565,7 +5565,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3b37603f7ba773dd6b5c4c3884226631c56b9c801be822cb30c5a76eb85b0355"
+        "hash": "42ed9355cd80aaaa2370363e05913b04d89cb6daf46ac7459ea6a0f2bec2b93c"
       }
     },
     {
@@ -5573,11 +5573,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sampleSize.md",
-        "text": "Gets `n` random elements at unique keys from `array` up to the size of `array`.\r\n\r\nShuffle the array using the [Fisher-Yates algorithm](https://github.com/30-seconds/30-seconds-of-code#shuffle).\r\nUse `Array.prototype.slice()` to get the first `n` elements.\r\nOmit the second argument, `n` to get only one element at random from the array.",
+        "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.",
         "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",
@@ -5587,7 +5587,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0cf699cb81f73bf1e7dcfa26066bead7f10a5245c2bbc3de5aefd119833745bd"
+        "hash": "dd7864be6b3d433e2a64999561cb152f012ccf2a611c5efa76e38cc2d72497e8"
       }
     },
     {
@@ -5595,9 +5595,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "scrollToTop.md",
-        "text": "Smooth-scrolls to the top of the page.\r\n\r\nGet distance from top using `document.documentElement.scrollTop` or `document.body.scrollTop`.\r\nScroll by a fraction of the distance from the top. Use `window.requestAnimationFrame()` to animate the scrolling.",
+        "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.",
         "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();"
         },
@@ -5608,7 +5608,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0059b3877b1e464316a970fa4b6c1f3e66c6d3d8eba0fd71ffc6da3765139574"
+        "hash": "9d097840156322f4316042fe727f6887b9cef948a92ffdbda4c92e0161f3389d"
       }
     },
     {
@@ -5616,9 +5616,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sdbm.md",
-        "text": "Hashes the input string into a whole number.\r\n\r\nUse `String.prototype.split('')` and `Array.prototype.reduce()` to create a hash of the input string, utilizing bit shifting.",
+        "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.",
         "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"
         },
@@ -5630,7 +5630,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c3a8304fde85dde84a90efb998f0dd4444b7c04a6b4114386bacfa7b8b2de150"
+        "hash": "682cce8b08b295ff61885b2fdf8595c93eb0bc0c83cc6fbae5c6c20727a60eff"
       }
     },
     {
@@ -5638,7 +5638,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "serializeCookie.md",
-        "text": "Serialize a cookie name-value pair into a Set-Cookie header string.\r\n\r\nUse template literals and `encodeURIComponent()` to create the appropriate string.",
+        "text": "Serialize a cookie name-value pair into a Set-Cookie header string.\n\nUse template literals and `encodeURIComponent()` to create the appropriate string.",
         "codeBlocks": {
           "es6": "const serializeCookie = (name, val) => `${encodeURIComponent(name)}=${encodeURIComponent(val)}`;",
           "es5": "var serializeCookie = function serializeCookie(name, val) {\n  return \"\".concat(encodeURIComponent(name), \"=\").concat(encodeURIComponent(val));\n};",
@@ -5652,7 +5652,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d00538ab5aba3ac223daa0e5301037622296acab3127eaca3066870570709f1a"
+        "hash": "a69e2913ccc5c7ca2100de571087a44c14b7ca475154740bace342852357b379"
       }
     },
     {
@@ -5660,7 +5660,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "setStyle.md",
-        "text": "Sets the value of a CSS rule for the specified element.\r\n\r\nUse `element.style` to set the value of the CSS rule for the specified element to `val`.",
+        "text": "Sets the value of a CSS rule for the specified element.\n\nUse `element.style` to set the value of the CSS rule for the specified element to `val`.",
         "codeBlocks": {
           "es6": "const setStyle = (el, ruleName, val) => (el.style[ruleName] = val);",
           "es5": "var setStyle = function setStyle(el, ruleName, val) {\n  return el.style[ruleName] = val;\n};",
@@ -5673,7 +5673,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5e77fc312562bb285245db9ce463b2f60319c72f5f80f4b29911c7e088a320d8"
+        "hash": "12eb5e821413b38e0e5d19ed1c12b7dcdf47071d1e795e9e72ffb71e693e922b"
       }
     },
     {
@@ -5681,11 +5681,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "shallowClone.md",
-        "text": "Creates a shallow clone of an object.\r\n\r\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.",
+        "text": "Creates a shallow clone of an object.\n\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.",
         "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",
@@ -5694,7 +5694,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7de60380be40a762fe0044242860c228a01a92a6ad1a71875967f7055db84b96"
+        "hash": "a5a49641c0de1a0a80f192c5be195c448ab0fe0856bba4e1f246fe70af7b5431"
       }
     },
     {
@@ -5702,11 +5702,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "shank.md",
-        "text": "Has the same functionality as [`Array.prototype.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.\r\n\r\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.\r\nOmit the second argument, `index`, to start at `0`.\r\nOmit the third argument, `delCount`, to remove `0` elements.\r\nOmit the fourth argument, `elements`, in order to not add any new elements.",
+        "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.",
         "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",
@@ -5715,7 +5715,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3228d4e5587f403b90361e8bc82b6c08fc5ff65bf21df4745a3e3f9adefc229b"
+        "hash": "956dedf2a511fc90c2d2acf5a8018838a7d2830b847761dafdbeb2f2df9779ed"
       }
     },
     {
@@ -5723,7 +5723,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "show.md",
-        "text": "Shows all the elements specified.\r\n\r\nUse the spread operator (`...`) and `Array.prototype.forEach()` to clear the `display` property for each element specified.",
+        "text": "Shows all the elements specified.\n\nUse the spread operator (`...`) and `Array.prototype.forEach()` to clear the `display` property for each element specified.",
         "codeBlocks": {
           "es6": "const show = (...el) => [...el].forEach(e => (e.style.display = ''));",
           "es5": "var show = function show() {\n  for (var _len = arguments.length, el = new Array(_len), _key = 0; _key < _len; _key++) {\n    el[_key] = arguments[_key];\n  }\n\n  return el.concat().forEach(function (e) {\n    return e.style.display = '';\n  });\n};",
@@ -5737,7 +5737,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1077fab3112f8fd532be9c54f28f3df6a0a82bc68b494e957bd97bd503f8cc78"
+        "hash": "9116653208cf97e75bc4918bd4e22e647c88d1ed8a8b8772cc4813a5ab2ff9ed"
       }
     },
     {
@@ -5745,11 +5745,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "shuffle.md",
-        "text": "Randomizes the order of the values of an array, returning a new array.\r\n\r\nUses the [Fisher-Yates algorithm](https://github.com/30-seconds/30-seconds-of-code#shuffle) to reorder the elements of the array.",
+        "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.",
         "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",
@@ -5759,7 +5759,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9e8a43e9082f882ff6f7a475686dfbf3fcb4ce8899029cceca3be1e1debcc68f"
+        "hash": "c9dda34ebe6e4f24ce3cc310bea23011208d050ae227000a347ac4e681b21171"
       }
     },
     {
@@ -5767,7 +5767,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "similarity.md",
-        "text": "Returns an array of elements that appear in both arrays.\r\n\r\nUse `Array.prototype.filter()` to remove values that are not part of `values`, determined using `Array.prototype.includes()`.",
+        "text": "Returns an array of elements that appear in both arrays.\n\nUse `Array.prototype.filter()` to remove values that are not part of `values`, determined using `Array.prototype.includes()`.",
         "codeBlocks": {
           "es6": "const similarity = (arr, values) => arr.filter(v => values.includes(v));",
           "es5": "var similarity = function similarity(arr, values) {\n  return arr.filter(function (v) {\n    return values.includes(v);\n  });\n};",
@@ -5781,7 +5781,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2c6b1ffb9d8fe5252cf66adba920c81e0e7cb6949df0a9490f85fb202c015aef"
+        "hash": "d2f87b9fca9c7c5d90d95fb1e9865c7593a7dff9845296b690c7a7bf2a79d292"
       }
     },
     {
@@ -5789,11 +5789,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "size.md",
-        "text": "Get size of arrays, objects or strings.\r\n\r\nGet type of `val` (`array`, `object` or `string`). \r\nUse `length` property for arrays.\r\nUse `length` or `size` value if available or number of keys for objects.\r\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\r\n\r\nSplit strings into array of characters with `split('')` and return its length.",
+        "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.\n\nSplit strings into array of characters with `split('')` and return its length.",
         "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",
@@ -5804,7 +5804,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e4f6fa3b1f22174524005847896827239a9f4d48da77759e21085392bf19fa1b"
+        "hash": "ac93ebf2905bbaeec36266cb011753e11c3895f78771e332c6694e05c62a3535"
       }
     },
     {
@@ -5812,11 +5812,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sleep.md",
-        "text": "Delays the execution of an asynchronous function.\r\n\r\nDelay executing part of an `async` function, by putting it to sleep, returning a `Promise`.",
+        "text": "Delays the execution of an asynchronous function.\n\nDelay executing part of an `async` function, by putting it to sleep, returning a `Promise`.",
         "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",
@@ -5826,7 +5826,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2ade7a5abc3492e93d9375e2f1e4ebea2722a4070d3c0c0fef9737da4d3274fc"
+        "hash": "cf97f402b25ec7ffd2b670d4b541093b567334595439167c0c7a5534962ad2a1"
       }
     },
     {
@@ -5834,11 +5834,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "smoothScroll.md",
-        "text": "Smoothly scrolls the element on which it's called into the visible area of the browser window.\r\n\r\nUse `.scrollIntoView` method to scroll the element. \r\nPass `{ behavior: 'smooth' }` to `.scrollIntoView` so it scrolls smoothly.",
+        "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.",
         "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",
@@ -5848,7 +5848,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0c981dba030ad350d16695c96ff9435b55d53ed96b025e80e297719be979a633"
+        "hash": "160e603850eac9489b210f1a3de5486944e23c0f799eb06936c6524af117fd06"
       }
     },
     {
@@ -5856,7 +5856,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sortCharactersInString.md",
-        "text": "Alphabetically sorts the characters in a string.\r\n\r\nUse the spread operator (`...`), `Array.prototype.sort()` and  `String.localeCompare()` to sort the characters in `str`, recombine using `String.prototype.join('')`.",
+        "text": "Alphabetically sorts the characters in a string.\n\nUse the spread operator (`...`), `Array.prototype.sort()` and  `String.localeCompare()` to sort the characters in `str`, recombine using `String.prototype.join('')`.",
         "codeBlocks": {
           "es6": "const sortCharactersInString = str => [...str].sort((a, b) => a.localeCompare(b)).join('');",
           "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 sortCharactersInString = function sortCharactersInString(str) {\n  return _toConsumableArray(str).sort(function (a, b) {\n    return a.localeCompare(b);\n  }).join('');\n};",
@@ -5869,7 +5869,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "34db8148aab6bca2e91f1cb4546e0e54736a8183f9d7d51021d857ea9c6c8b56"
+        "hash": "5adc748425d58db5bc6b547a393d46b5f1b99c6ec4f6c7006ed5038d9abf09d6"
       }
     },
     {
@@ -5877,11 +5877,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sortedIndex.md",
-        "text": "Returns the lowest index at which value should be inserted into array in order to maintain its sort order.\r\n\r\nCheck if the array is sorted in descending order (loosely).\r\nUse `Array.prototype.findIndex()` to find the appropriate index where the element should be inserted.",
+        "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.",
         "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",
@@ -5891,7 +5891,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "775b9b28ebb0a3f88abcb353bb3363f0b032ecf420661aa57c20e80b6b6f881c"
+        "hash": "1d748071f0dfc6d63b004336b2859d60d9084303257f34d7ac8e0b1ba17bb531"
       }
     },
     {
@@ -5899,9 +5899,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nCheck if the array is sorted in descending order (loosely).\r\nUse `Array.prototype.findIndex()` to find the appropriate index where the element should be inserted, based on the iterator function `fn`.",
+        "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`.",
         "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"
         },
@@ -5914,7 +5914,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "117e9e577d11361253bc2d335f07bf6114e76b8a7a7d468c1ba40418c0089f83"
+        "hash": "158bb20051dc59ccd73a94ae416179c3499b70bc26003fb569f5b8d157266485"
       }
     },
     {
@@ -5922,9 +5922,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sortedLastIndex.md",
-        "text": "Returns the highest index at which value should be inserted into array in order to maintain its sort order.\r\n\r\nCheck if the array is sorted in descending order (loosely).\r\nUse `Array.prototype.reverse()` and `Array.prototype.findIndex()` to find the appropriate last index where the element should be inserted.",
+        "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.",
         "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"
         },
@@ -5936,7 +5936,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8c8b3cc4fef1fdfc6d4eaf3169d4372c668694f6e130547c276667506a1c369f"
+        "hash": "e8cca852ff9566bae5b21e6b0cc53294d0f2c7e563236d0f4a5ef0b47fe69f2b"
       }
     },
     {
@@ -5944,9 +5944,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nCheck if the array is sorted in descending order (loosely).\r\nUse `Array.prototype.map()` to apply the iterator function to all elements of the array.\r\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.",
+        "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.",
         "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"
         },
@@ -5959,7 +5959,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f3aef4ca67a728875ef21fa009c5300d6d5e30779fd7ee91934701895b8274af"
+        "hash": "390f014b69fe582d2273b46cb769f22b73f1aec240cf0d38458680ca9cc892e4"
       }
     },
     {
@@ -5967,7 +5967,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "splitLines.md",
-        "text": "Splits a multiline string into an array of lines.\r\n\r\nUse `String.prototype.split()` and a regular expression to match line breaks and create an array.",
+        "text": "Splits a multiline string into an array of lines.\n\nUse `String.prototype.split()` and a regular expression to match line breaks and create an array.",
         "codeBlocks": {
           "es6": "const splitLines = str => str.split(/\\r?\\n/);",
           "es5": "var splitLines = function splitLines(str) {\n  return str.split(/\\r?\\n/);\n};",
@@ -5980,7 +5980,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "46d9f6904481a9e344befffc48159fc1205c1a1e558a03d8e4bb0073c73b83f7"
+        "hash": "b6f1f62e437bba475c89e0457c89e6bea4fb2521f421c27d4a11b9b55bf8a02d"
       }
     },
     {
@@ -6009,11 +6009,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "stableSort.md",
-        "text": "Performs stable sorting of an array, preserving the initial indexes of items when their values are the same.\r\nDoes not mutate the original array, but returns a new array instead.\r\n\r\nUse `Array.prototype.map()` to pair each element of the input array with its corresponding index.\r\nUse `Array.prototype.sort()` and a `compare` function to sort the list, preserving their initial order if the items compared are equal.\r\nUse `Array.prototype.map()` to convert back to the initial array items.",
+        "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.",
         "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",
@@ -6024,7 +6024,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "897ec7ae6a43dc99a72316d53116b6634b9841909550106e2341ee279e309f25"
+        "hash": "454a110a54555ac9abdd8e6512a04e15f707ac89f5bb08b9c4175f0dd777f486"
       }
     },
     {
@@ -6032,11 +6032,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "standardDeviation.md",
-        "text": "Returns the standard deviation of an array of numbers.\r\n\r\nUse `Array.prototype.reduce()` to calculate the mean, variance and the sum of the variance of the values, the variance of the values, then\r\ndetermine the standard deviation.\r\nYou can omit the second argument to get the sample standard deviation or set it to `true` to get the population standard deviation.",
+        "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.",
         "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",
@@ -6046,7 +6046,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3e34cb48380b9ec4aa52f1603892a8db1d760e3b8387d309f3627e7ad1731aa9"
+        "hash": "dd14903917fdf148409dd1ad440c2a1f098d3fe9a9d7742e72704d94e9d0f816"
       }
     },
     {
@@ -6054,9 +6054,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nGenerates all permutations of a string (contains duplicates).\r\n\r\nUse recursion.\r\nFor each letter in the given string, create all the partial permutations for the rest of its letters.\r\nUse `Array.prototype.map()` to combine the letter with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\r\nBase cases are for string `length` equal to `2` or `1`.",
+        "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`.",
         "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']"
         },
@@ -6068,7 +6068,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e23e28ef5264da4e5028b40bce557241cff8ded1e942dda0aef6e79d7577eade"
+        "hash": "aa461317f9e5e0fac8a60d7513ecaeb9706c15ac2c7ad3fe9be397b9328b1b7e"
       }
     },
     {
@@ -6076,7 +6076,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "stripHTMLTags.md",
-        "text": "Removes HTML/XML tags from string.\r\n\r\nUse a regular expression to remove HTML/XML tags from a string.",
+        "text": "Removes HTML/XML tags from string.\n\nUse a regular expression to remove HTML/XML tags from a string.",
         "codeBlocks": {
           "es6": "const stripHTMLTags = str => str.replace(/<[^>]*>/g, '');",
           "es5": "var stripHTMLTags = function stripHTMLTags(str) {\n  return str.replace(/<[^>]*>/g, '');\n};",
@@ -6091,7 +6091,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ee2f284cf513dc1d61b4d366698555c240131d5fe8fc17bd19a4cf055091ce58"
+        "hash": "a46d835b66eead91516d7c00db7e80bd396a7d410ee8dddb1a79a0aad8666036"
       }
     },
     {
@@ -6099,7 +6099,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sum.md",
-        "text": "Returns the sum of two or more numbers/arrays.\r\n\r\nUse `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`.",
+        "text": "Returns the sum of two or more numbers/arrays.\n\nUse `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`.",
         "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 arr.concat().reduce(function (acc, val) {\n    return acc + val;\n  }, 0);\n};",
@@ -6113,7 +6113,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "03a3fcdac74dd3311ed80241e6de8cb6f9ee1cac3add8c908b60e6bfd97c4ba9"
+        "hash": "c19982a92698e82e05f0f903aeac184191a6371efc35459475bbf2177e64c6e9"
       }
     },
     {
@@ -6121,11 +6121,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sumBy.md",
-        "text": "Returns the sum of an array, after mapping each element to a value using the provided function.\r\n\r\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`.",
+        "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`.",
         "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",
@@ -6136,7 +6136,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "74556a01701c709d8c9f8da03fd7fedfc9d5721c9f71e3093acff8bd30ce282f"
+        "hash": "59c447ac5984c9c7b632adc170e74168336faddbdea47df47e533d1d87a07cd5"
       }
     },
     {
@@ -6144,11 +6144,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "sumPower.md",
-        "text": "Returns the sum of the powers of all the numbers from `start` to `end` (both inclusive).\r\n\r\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.\r\nOmit the second argument, `power`, to use a default power of `2`.\r\nOmit the third argument, `start`, to use a default starting value of `1`.",
+        "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`.",
         "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",
@@ -6157,7 +6157,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b4dfe86ed9855ac7c917e34e1b39df5d43178af2c13881627d277efc9600b9a0"
+        "hash": "bc4cdf47b99e2ace6163d4fde6adea551f06362bae92cac8c7fda67712912391"
       }
     },
     {
@@ -6165,11 +6165,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "symmetricDifference.md",
-        "text": "Returns the symmetric difference between two arrays, without filtering out duplicate values.\r\n\r\nCreate a `Set` from each array, then use `Array.prototype.filter()` on each of them to only keep values not contained in the other.",
+        "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.",
         "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 _toConsumableArray(a.filter(function (x) {\n    return !sB.has(x);\n  })).concat(_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",
@@ -6179,7 +6179,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7d60d7d8c42880de0a12a91df558cd04c2bc86e74631fd618b5f222323226527"
+        "hash": "520bb2600d7d31d2dee3aa377986e8cc5b368fc9bb257c73255c9a295804f6a6"
       }
     },
     {
@@ -6187,9 +6187,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "symmetricDifferenceBy.md",
-        "text": "Returns the symmetric difference between two arrays, after applying the provided function to each array element of both.\r\n\r\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.",
+        "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.",
         "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 _toConsumableArray(a.filter(function (x) {\n    return !sB.has(fn(x));\n  })).concat(_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 ]"
         },
@@ -6201,7 +6201,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "b8a1146c956e5ac9a8d3f3a347b946cfa066b2b656557ba9f0a35ac3ac13da57"
+        "hash": "8af295527bdf0a150d3e2f20eb7d07acca0d68a808f0bb622178576baa33128c"
       }
     },
     {
@@ -6209,11 +6209,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "symmetricDifferenceWith.md",
-        "text": "Returns the symmetric difference between two arrays, using a provided function as a comparator.\r\n\r\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` to find the appropriate values.",
+        "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.",
         "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 _toConsumableArray(arr.filter(function (a) {\n    return val.findIndex(function (b) {\n      return comp(a, b);\n    }) === -1;\n  })).concat(_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",
@@ -6223,7 +6223,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0d611c3d7fa609a620b79b66674e51211ed28d5e4ef602b7804cc04ca69bd6e7"
+        "hash": "338cc5e1c426261c149a8431ac04040389550f11cf5afa77ffae32ad13be9256"
       }
     },
     {
@@ -6231,11 +6231,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "tail.md",
-        "text": "Returns all elements in an array except for the first one.\r\n\r\nReturn `Array.prototype.slice(1)` if the array's `length` is more than `1`, otherwise, return the whole array.",
+        "text": "Returns all elements in an array except for the first one.\n\nReturn `Array.prototype.slice(1)` if the array's `length` is more than `1`, otherwise, return the whole array.",
         "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",
@@ -6244,7 +6244,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "af54ed912eebf9b9e09a7ada2dba2a495a99cfd7953b52f2dd14875dbc24eb42"
+        "hash": "df81add854aa09b654d62fa7eab314aa8d272da24ed59e876fa75a4477db8737"
       }
     },
     {
@@ -6252,11 +6252,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "take.md",
-        "text": "Returns an array with n elements removed from the beginning.\r\n\r\nUse `Array.prototype.slice()` to create a slice of the array with `n` elements taken from the beginning.",
+        "text": "Returns an array with n elements removed from the beginning.\n\nUse `Array.prototype.slice()` to create a slice of the array with `n` elements taken from the beginning.",
         "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",
@@ -6265,7 +6265,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "297711965d0910a5d06ef3da57218325a5c73fd1f69aa68ca4692d96678c0520"
+        "hash": "8e1123ba492a1103e2ac793c7febb0851905301dd190c453a253e23b05a27a6c"
       }
     },
     {
@@ -6273,11 +6273,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "takeRight.md",
-        "text": "Returns an array with n elements removed from the end.\r\n\r\nUse `Array.prototype.slice()` to create a slice of the array with `n` elements taken from the end.",
+        "text": "Returns an array with n elements removed from the end.\n\nUse `Array.prototype.slice()` to create a slice of the array with `n` elements taken from the end.",
         "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",
@@ -6286,7 +6286,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "71eb17c86a261044dde77e2b6f56ac511042974672d61ecc90b52efaf7612754"
+        "hash": "30d3b8ac6dd36237d4b3221e3b9a8d6c1a097d2adefa52d694ee2d8733472159"
       }
     },
     {
@@ -6294,9 +6294,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "takeRightWhile.md",
-        "text": "Removes elements from the end of an array until the passed function returns `true`. Returns the removed elements.\r\n\r\nLoop through the array, using a `Array.prototype.reduceRight()` and accumulating elements while the function returns falsy value.",
+        "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.",
         "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]"
         },
@@ -6308,7 +6308,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c2abf1b7d9a9622ef6da9ce57d8e5dbdaa6bc02220c7e9cea8d1bf423d6b4acf"
+        "hash": "e229ed3f9dfffee8681ff978f7b1417b1a07b3820af0350f0c8b0332147a8525"
       }
     },
     {
@@ -6316,9 +6316,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "takeWhile.md",
-        "text": "Removes elements in an array until the passed function returns `true`. Returns the removed elements.\r\n\r\nLoop through the array, using a `for...of` loop over `Array.prototype.entries()` until the returned value from the function is `true`.\r\nReturn the removed elements, using `Array.prototype.slice()`.",
+        "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()`.",
         "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]"
         },
@@ -6330,7 +6330,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c42316fd32bf6ade69e5af6fa674e17b85478af5bc43d88af8c1800a2710c508"
+        "hash": "ffaf357a96c9dca6e963ca5ec4c809b0012b92a551e0869f35c87fce5eabb95a"
       }
     },
     {
@@ -6338,11 +6338,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "throttle.md",
-        "text": "Creates a throttled function that only invokes the provided function at most once per every `wait` milliseconds\r\n\r\nUse `setTimeout()` and `clearTimeout()` to throttle the given method, `fn`.\r\nUse `Function.prototype.apply()` to apply the `this` context to the function and provide the necessary `arguments`.\r\nUse `Date.now()` to keep track of the last time the throttled function was invoked.\r\nOmit the second argument, `wait`, to set the timeout at a default of 0 ms.",
+        "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.",
         "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",
@@ -6351,7 +6351,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ecdc293930030c0da79e4cb0b21a9fc811219583ab36391428553fd25da0c822"
+        "hash": "8eece384966f81ded39d67601ec6d6e320e2ffb750cc5f026e4158c439bf2815"
       }
     },
     {
@@ -6359,11 +6359,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "times.md",
-        "text": "Iterates over a callback `n` times\r\n\r\nUse `Function.call()` to call `fn` `n` times or until it returns `false`.\r\nOmit the last argument, `context`, to use an `undefined` object (or the global object in non-strict mode).",
+        "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).",
         "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",
@@ -6372,7 +6372,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "81177986848b8ea067f9019c43923709a9798d1e599fb9ddbb6005096600db37"
+        "hash": "90ab922b56f62b3eafff4a31b2a1f1345d2126e712f02360cb8a6e8b31adee96"
       }
     },
     {
@@ -6380,9 +6380,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "timeTaken.md",
-        "text": "Measures the time taken by a function to execute.\r\n\r\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.",
+        "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.",
         "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"
         },
@@ -6393,7 +6393,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "10f04aac7ae6a3183c934a0d29dfce0896c43ef1808018f8dc1ccf8f72b03574"
+        "hash": "48d1e866b152eacd9fa16d8bf5c3136d01072522a58ad005a13d9b1792a3c37f"
       }
     },
     {
@@ -6401,11 +6401,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toCamelCase.md",
-        "text": "Converts a string to camelcase.\r\n\r\nBreak the string into words and combine them capitalizing the first letter of each word, using a regexp.",
+        "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.",
         "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",
@@ -6415,7 +6415,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "16d119f2579322223f4643ae75df9c634046d58cc45a833e7037b0ec3e9d30a8"
+        "hash": "870a6ab0b2c7a69e26af06ce5f1cb2bd1706ae678139d2c2c3f59ce277c0cea3"
       }
     },
     {
@@ -6423,11 +6423,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toCurrency.md",
-        "text": "Take a number and return specified currency formatting.\r\n\r\nUse `Intl.NumberFormat` to enable country / currency sensitive formatting.",
+        "text": "Take a number and return specified currency formatting.\n\nUse `Intl.NumberFormat` to enable country / currency sensitive formatting.",
         "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",
@@ -6436,7 +6436,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f00f4a2229ed6b9f98356e6b0ea9e245f1d53bdbd616eb4c2babb87d7cf350b9"
+        "hash": "85a601168285577950b9fd0f28fa0d0283261dda12a2cb0e1a0e1cc78a6e81ae"
       }
     },
     {
@@ -6458,7 +6458,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "60a6869c136463b7cd17169c91a3df8baba1c4d5482918b6f93b7d898f1ed725"
+        "hash": "37225304d6109741f6ccb03fc845b2dbe84e0e2142861dfc73f5d3b5d770bde7"
       }
     },
     {
@@ -6466,7 +6466,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toggleClass.md",
-        "text": "Toggle a class for an element.\r\n\r\nUse `element.classList.toggle()` to toggle the specified class for the element.",
+        "text": "Toggle a class for an element.\n\nUse `element.classList.toggle()` to toggle the specified class for the element.",
         "codeBlocks": {
           "es6": "const toggleClass = (el, className) => el.classList.toggle(className);",
           "es5": "var toggleClass = function toggleClass(el, className) {\n  return el.classList.toggle(className);\n};",
@@ -6479,7 +6479,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a7fe1eafbf16bb18ebc334acb4c3e865ac640b2da8c4c59084b92e47b1f2c31e"
+        "hash": "c1fec7508780ad0ceacbf58c049668201e9f88eee043234394e11666530cfb21"
       }
     },
     {
@@ -6487,11 +6487,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toHash.md",
-        "text": "Reduces a given Array-like into a value hash (keyed data store).\r\n\r\nGiven an Iterable or Array-like structure, call `Array.prototype.prototype.reduce.call()` on the provided object to step over it and return an Object, keyed by the reference value.",
+        "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.",
         "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, 1: 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, 1: 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",
@@ -6500,7 +6500,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "1a0fe2710f33b65dd26898a49d82cfe32fbbe20fcc770793bd480492ce803161"
+        "hash": "c7a62b55b5a90661bf3f9c956f075906439a50151a3aee4023ad8fe878cae2e6"
       }
     },
     {
@@ -6508,11 +6508,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toKebabCase.md",
-        "text": "Converts a string to kebab case.\r\n\r\nBreak the string into words and combine them adding `-` as a separator, using a regexp.",
+        "text": "Converts a string to kebab case.\n\nBreak the string into words and combine them adding `-` as a separator, using a regexp.",
         "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",
@@ -6522,7 +6522,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "a181eea015033d5741a3bd2f2d1375806f2d30b20f176de2e6a2c91ce52fdbe0"
+        "hash": "40bb52f6eb89e1b796af964316c93bee286e44952d8d2e410ac7f8124b6cd8ac"
       }
     },
     {
@@ -6530,11 +6530,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "tomorrow.md",
-        "text": "Results in a string representation of tomorrow's date.\r\n\r\nUse `new Date()` to get today's date, adding one day using `Date.getDate()` and `Date.setDate()`, and converting the Date object to a string.",
+        "text": "Results in a string representation of tomorrow's date.\n\nUse `new Date()` to get today's date, adding one day using `Date.getDate()` and `Date.setDate()`, and converting the Date object to a string.",
         "codeBlocks": {
-          "es6": "const tomorrow = (long = false) => {\r\n  let t = new Date();\r\n  t.setDate(t.getDate() + 1);\r\n  const ret = `${t.getFullYear()}-${String(t.getMonth() + 1).padStart(2, '0')}-${String(\r\n    t.getDate()\r\n  ).padStart(2, '0')}`;\r\n  return !long ? ret : `${ret}T00:00:00`;\r\n};",
+          "es6": "const tomorrow = (long = false) => {\n  let t = new Date();\n  t.setDate(t.getDate() + 1);\n  const ret = `${t.getFullYear()}-${String(t.getMonth() + 1).padStart(2, '0')}-${String(\n    t.getDate()\n  ).padStart(2, '0')}`;\n  return !long ? ret : `${ret}T00:00:00`;\n};",
           "es5": "var tomorrow = function tomorrow() {\n  var long = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;\n  var t = new Date();\n  t.setDate(t.getDate() + 1);\n  var ret = \"\".concat(t.getFullYear(), \"-\").concat(String(t.getMonth() + 1).padStart(2, '0'), \"-\").concat(String(t.getDate()).padStart(2, '0'));\n  return !long ? ret : \"\".concat(ret, \"T00:00:00\");\n};",
-          "example": "tomorrow(); // 2017-12-27 (if current date is 2017-12-26)\r\ntomorrow(true); // 2017-12-27T00:00:00 (if current date is 2017-12-26)"
+          "example": "tomorrow(); // 2017-12-27 (if current date is 2017-12-26)\ntomorrow(true); // 2017-12-27T00:00:00 (if current date is 2017-12-26)"
         },
         "tags": [
           "date",
@@ -6543,7 +6543,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "bb0a10f680644b437d61c2c69ea3ddd9dacc87ba9036bd66dd81eb0fb98dd671"
+        "hash": "4794ae637e65b9c1ac43f6c964555a98cda83e1410684e11ed34753c81db35fb"
       }
     },
     {
@@ -6551,9 +6551,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toOrdinalSuffix.md",
-        "text": "Adds an ordinal suffix to a number.\r\n\r\nUse the modulo operator (`%`) to find values of single and tens digits.\r\nFind which ordinal pattern digits match.\r\nIf digit is found in teens pattern, use teens ordinal.",
+        "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.",
         "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  return oPattern.includes(digits[0]) && !tPattern.includes(digits[1]) ? int + ordinals[digits[0] - 1] : int + ordinals[3];\n};",
           "example": "toOrdinalSuffix('123'); // \"123rd\""
         },
@@ -6565,7 +6565,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "fc3f0e8b7f06d0114d589549e255298d40c7954386e74c74ab842d421f472f6e"
+        "hash": "9e162528df1b8dd803a71a770f3c5e1555ca5995005e26e416f5652024b3fd1e"
       }
     },
     {
@@ -6573,11 +6573,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toSafeInteger.md",
-        "text": "Converts a value to a safe integer.\r\n\r\nUse `Math.max()` and `Math.min()` to find the closest safe value.\r\nUse `Math.round()` to convert to an integer.",
+        "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.",
         "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",
@@ -6586,7 +6586,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "8416d92bd5d190468f9c9c73318228aa5898191983d1d941d6e43115d7ce63ba"
+        "hash": "9f1ec1d236c7cd6787078f8eb21ac9076a2049b9e63b99bb67017be40a0f833b"
       }
     },
     {
@@ -6594,11 +6594,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toSnakeCase.md",
-        "text": "Converts a string to snake case.\r\n\r\nBreak the string into words and combine them adding `_` as a separator, using a regexp.",
+        "text": "Converts a string to snake case.\n\nBreak the string into words and combine them adding `_` as a separator, using a regexp.",
         "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",
@@ -6608,7 +6608,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6e6eab17f7ffa0d8330c38e6f250d07c149d1c382c7e30c983b20c100867a091"
+        "hash": "07be50b2d41b64458085b8f48a361023061fff8cc6db5813ce56cb3e5d22ccfa"
       }
     },
     {
@@ -6616,11 +6616,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "toTitleCase.md",
-        "text": "Converts a string to title case.\r\n\r\nBreak the string into words, using a regexp, and combine them capitalizing the first letter of each word and adding a whitespace between them.",
+        "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.",
         "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",
@@ -6630,7 +6630,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9c48e8bbe56982fa64b6272cbae696dc81c252a33291bac29661b9cc211e9843"
+        "hash": "e08f543efd322b776956ba59d67a62da19998e979e953f662059d57fb440c465"
       }
     },
     {
@@ -6638,11 +6638,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "transform.md",
-        "text": "Applies a function against an accumulator and each key in the object (from left to right).\r\n\r\nUse `Object.keys(obj)` to iterate over each key in the object, `Array.prototype.reduce()` to call the apply the specified function against the given accumulator.",
+        "text": "Applies a function against an accumulator and each key in the object (from left to right).\n\nUse `Object.keys(obj)` to iterate over each key in the object, `Array.prototype.reduce()` to call the apply the specified function against the given accumulator.",
         "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",
@@ -6652,7 +6652,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9915776188ba8fe2ba9bb6bc119f3ec2e15e39e9694a26691f874706e94d536f"
+        "hash": "57e917442bd3ef061d052ed219cfc4041abb5ab83c3caeda491c0fc7a9341fa0"
       }
     },
     {
@@ -6660,11 +6660,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "triggerEvent.md",
-        "text": "Triggers a specific event on a given element, optionally passing custom data.\r\n\r\nUse `new CustomEvent()` to create an event from the specified `eventType` and details.\r\nUse `el.dispatchEvent()` to trigger the newly created event on the given element.\r\nOmit the third argument, `detail`, if you do not want to pass custom data to the triggered event.",
+        "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.",
         "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",
@@ -6674,7 +6674,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "5a75139673bae9fb7b5fd89409c3ef0b5b248cb3560a311f92fc95c91f8e3e55"
+        "hash": "f7aec80ce75a7058fe94c36ea21c4db37aa46bcf114817b2d9dc4a71c16b62ba"
       }
     },
     {
@@ -6682,9 +6682,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "truncateString.md",
-        "text": "Truncates a string up to a specified length.\r\n\r\nDetermine if the string's `length` is greater than `num`.\r\nReturn the string truncated to the desired length, with `'...'` appended to the end or the original string.",
+        "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.",
         "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...'"
         },
@@ -6695,7 +6695,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "9c817dfd7257af2b39b9767f103d7ddc52fa9faeb58266809c4dad096f269f5f"
+        "hash": "656e754cd1a8ef1a738557d1453b8f6c65e5f0f67e829179c88f3d9b6d3c4ee7"
       }
     },
     {
@@ -6703,7 +6703,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "truthCheckCollection.md",
-        "text": "Checks if the predicate (second argument) is truthy on all elements of a collection (first argument).\r\n\r\nUse `Array.prototype.every()` to check if each passed object has the specified property and if it returns a truthy value.",
+        "text": "Checks if the predicate (second argument) is truthy on all elements of a collection (first argument).\n\nUse `Array.prototype.every()` to check if each passed object has the specified property and if it returns a truthy value.",
         "codeBlocks": {
           "es6": "const truthCheckCollection = (collection, pre) => collection.every(obj => obj[pre]);",
           "es5": "var truthCheckCollection = function truthCheckCollection(collection, pre) {\n  return collection.every(function (obj) {\n    return obj[pre];\n  });\n};",
@@ -6718,7 +6718,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f12f13e91351b4d6d38606d44c89bc3fe89c09d230ac44f2cc68f07e2199f35d"
+        "hash": "3b948351bdd9e2246bb545e3533e85337e9104854f34da559237b62e59084cca"
       }
     },
     {
@@ -6726,7 +6726,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unary.md",
-        "text": "Creates a function that accepts up to one argument, ignoring any additional arguments.\r\n\r\nCall the provided function, `fn`, with just the first argument given.",
+        "text": "Creates a function that accepts up to one argument, ignoring any additional arguments.\n\nCall the provided function, `fn`, with just the first argument given.",
         "codeBlocks": {
           "es6": "const unary = fn => val => fn(val);",
           "es5": "var unary = function unary(fn) {\n  return function (val) {\n    return fn(val);\n  };\n};",
@@ -6740,7 +6740,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "80672a8ef916cbfd3c144c24d9a2ba8f61aae96d83fb6c65b788598f39b61086"
+        "hash": "522df418a2b451115c7514afc7480a2f5a0f813dd320faf6e577c9eff71d379b"
       }
     },
     {
@@ -6748,11 +6748,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "uncurry.md",
-        "text": "Uncurries a function up to depth `n`.\r\n\r\nReturn a variadic function.\r\nUse `Array.prototype.reduce()` on the provided arguments to call each subsequent curry level of the function.\r\nIf the `length` of the provided arguments is less than `n` throw an error.\r\nOtherwise, call `fn` with the proper amount of arguments, using `Array.prototype.slice(0, n)`.\r\nOmit the second argument, `n`, to uncurry up to depth `1`.",
+        "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`.",
         "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",
@@ -6761,7 +6761,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "40c66397d2aa4096b7cdfca13d83e87535ebd372f2124e28ed4e7574200a1fea"
+        "hash": "c2b5d3567834f4bc3149676e7130e93e8349a9a0c76078a0f31ab9de5cc739ca"
       }
     },
     {
@@ -6769,9 +6769,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unescapeHTML.md",
-        "text": "Unescapes escaped HTML characters.\r\n\r\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).",
+        "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).",
         "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>'"
         },
@@ -6783,7 +6783,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "db2bce039d4c1c4b0f856856ab5dcc1f5bc0738e558f67e49bd4a0db222d5eb4"
+        "hash": "7caae7814b3cee1c6a312b563443a389bbc67843a78ca14221cdbeceffbdd4d2"
       }
     },
     {
@@ -6791,9 +6791,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unflattenObject.md",
-        "text": "Unflatten an object with the paths for keys.\r\n\r\nUse `Object.keys(obj)` combined with `Array.prototype.reduce()` to convert flattened path node to a leaf node.\r\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.\r\nOtherwise, add the appropriate key-value pair to the accumulator object.",
+        "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.",
         "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 }"
         },
@@ -6804,7 +6804,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "3637ef66fb8116bfa346100017cd05c145444ca59163feae74490ffcfa8bb95c"
+        "hash": "85dbe7ffa7a0dd1cc5e505ea54328de8f7a3c9809f3a051528bf4bc1cd87262d"
       }
     },
     {
@@ -6812,11 +6812,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unfold.md",
-        "text": "Builds an array, using an iterator function and an initial seed value.\r\n\r\nUse a `while` loop and `Array.prototype.push()` to call the function repeatedly until it returns `false`.\r\nThe iterator function accepts one argument (`seed`) and must always return an array with two elements ([`value`, `nextSeed`]) or `false` to terminate.",
+        "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.",
         "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",
@@ -6826,7 +6826,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c878474228bd386796ac702a400dba511230fe1b66f8fa78ca9fe62a2959a036"
+        "hash": "f21e8aa2e101edce3f1dc6510ece098a51cc63a3fed4c0343d065bc96abdf3c8"
       }
     },
     {
@@ -6834,7 +6834,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "union.md",
-        "text": "Returns every element that exists in any of the two arrays once.\r\n\r\nCreate a `Set` with all values of `a` and `b` and convert to an array.",
+        "text": "Returns every element that exists in any of the two arrays once.\n\nCreate a `Set` with all values of `a` and `b` and convert to an array.",
         "codeBlocks": {
           "es6": "const union = (a, b) => Array.from(new Set([...a, ...b]));",
           "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 union = function union(a, b) {\n  return Array.from(new Set(_toConsumableArray(a).concat(_toConsumableArray(b))));\n};",
@@ -6848,7 +6848,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "6a38d221f7ffe44866abd3c70be9f98fb83a2ce7c68914dd68af475a4790d093"
+        "hash": "89bdbb02f2dd1c5bc9d1272ff3f2d5249af763115b596e9f8bc801d0f2256ac3"
       }
     },
     {
@@ -6856,9 +6856,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nCreate a `Set` by applying all `fn` to all values of `a`.\r\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.\r\nReturn the last set converted to an array.",
+        "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.",
         "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(_toConsumableArray(a).concat(_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]"
         },
@@ -6870,7 +6870,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "90210f1e62a7f5bb991cb3b7603bc2ffef0e4aa02193fe2b12f6269e951bc473"
+        "hash": "6311c46f59dfe85022a091d395293fc8afe353b8f6c23bc0d535cf8c90d7df27"
       }
     },
     {
@@ -6878,9 +6878,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unionWith.md",
-        "text": "Returns every element that exists in any of the two arrays once, using a provided comparator function.\r\n\r\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()`.",
+        "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()`.",
         "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(_toConsumableArray(a).concat(_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]"
         },
@@ -6892,7 +6892,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "96c49643e166f51a9ec78e0c75ce4bd2e799e8bc913794657fa718ad16723f22"
+        "hash": "c43cbb8a7a57f3873fde6b1c2ff16744c2332fcbb1e107ff581faadf9a742075"
       }
     },
     {
@@ -6900,7 +6900,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "uniqueElements.md",
-        "text": "Returns all unique values of an array.\r\n\r\nUse ES6 `Set` and the `...rest` operator to discard all duplicated values.",
+        "text": "Returns all unique values of an array.\n\nUse ES6 `Set` and the `...rest` operator to discard all duplicated values.",
         "codeBlocks": {
           "es6": "const uniqueElements = arr => [...new Set(arr)];",
           "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 uniqueElements = function uniqueElements(arr) {\n  return _toConsumableArray(new Set(arr));\n};",
@@ -6913,7 +6913,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "cd300f39aa0ae59abeca10f9e0af65983a8c57c9884723792956647e341bf869"
+        "hash": "a58f3cb936234ebae488f907b8bf82f80a2966007cdff2972f658a969c250f46"
       }
     },
     {
@@ -6921,11 +6921,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "uniqueElementsBy.md",
-        "text": "Returns all unique values of an array, based on a provided comparator function.\r\n\r\nUse `Array.prototype.reduce()` and `Array.prototype.some()` for an array containing only the first unique occurence of each value, based on the comparator function, `fn`.\r\nThe comparator function takes two arguments: the values of the two elements being compared.",
+        "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 occurence of each value, based on the comparator function, `fn`.\nThe comparator function takes two arguments: the values of the two elements being compared.",
         "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",
@@ -6935,7 +6935,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "f19f8f2980c9430121f0ffc5e391d348d5715a3d3e8aca5c435bae418fec4f50"
+        "hash": "38bee97eef5e2918ce534d6f25ad2a8b40d4841c7a663d9a9a596dd4687ce5bc"
       }
     },
     {
@@ -6943,11 +6943,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "uniqueElementsByRight.md",
-        "text": "Returns all unique values of an array, based on a provided comparator function.\r\n\r\nUse `Array.prototype.reduce()` and `Array.prototype.some()` for an array containing only the last unique occurence of each value, based on the comparator function, `fn`.\r\nThe comparator function takes two arguments: the values of the two elements being compared.",
+        "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 last unique occurence of each value, based on the comparator function, `fn`.\nThe comparator function takes two arguments: the values of the two elements being compared.",
         "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",
@@ -6957,7 +6957,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "c5eb849038ee18cf97df69583d46e9c0fac073f62acaf155f2af2c48195082af"
+        "hash": "cec8e5f01c8d00c246a12fabb43713a60da510f50c3d548f703f664936373096"
       }
     },
     {
@@ -6965,11 +6965,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "uniqueSymmetricDifference.md",
-        "text": "Returns the unique symmetric difference between two arrays, not containing duplicate values from either array.\r\n\r\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.",
+        "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.",
         "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(_toConsumableArray(a.filter(function (v) {\n    return !b.includes(v);\n  })).concat(_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",
@@ -6979,7 +6979,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4c6f94f5a26fc102a09abba066329d25d63d90f3312b0233a49a99124681a2c2"
+        "hash": "732b6077bcba350f004edeac5667d0d6d8403b2798e0860e5cd3d5a0c4578339"
       }
     },
     {
@@ -6987,7 +6987,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "untildify.md",
-        "text": "Converts a tilde path to an absolute path.\r\n\r\nUse `String.prototype.replace()` with a regular expression and `OS.homedir()` to replace the `~` in the start of the path with the home directory.",
+        "text": "Converts a tilde path to an absolute path.\n\nUse `String.prototype.replace()` with a regular expression and `OS.homedir()` to replace the `~` in the start of the path with the home directory.",
         "codeBlocks": {
           "es6": "const untildify = str => str.replace(/^~($|\\/|\\\\)/, `${require('os').homedir()}$1`);",
           "es5": "var untildify = function untildify(str) {\n  return str.replace(/^~($|\\/|\\\\)/, \"\".concat(require('os').homedir(), \"$1\"));\n};",
@@ -7001,7 +7001,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e734ca2c62a5a59b69379b0b6ef38d916f9554c0c9dc4341ff64e34f66e8fa0c"
+        "hash": "16729b1197484dd3a2b1ea4c860f297f5318e1d34831f8cb4f548d1486f51aca"
       }
     },
     {
@@ -7009,11 +7009,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unzip.md",
-        "text": "Creates an array of arrays, ungrouping the elements in an array produced by [zip](#zip).\r\n\r\nUse `Math.max.apply()` to get the longest subarray in the array, `Array.prototype.map()` to make each element an array.\r\nUse `Array.prototype.reduce()` and `Array.prototype.forEach()` to map grouped values to individual arrays.",
+        "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.",
         "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",
@@ -7022,7 +7022,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "ba5dee3a521239141017caa48cd332c905a674034b6b533c1c8d4e8dabaf1df2"
+        "hash": "dbd21f42d2200f504459f4ce7d1b39e31be3a30373b4ce4feec5afa2c85b7ef7"
       }
     },
     {
@@ -7030,9 +7030,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "unzipWith.md",
-        "text": "Creates an array of elements, ungrouping the elements in an array produced by [zip](#zip) and applying the provided function.\r\n\r\nUse `Math.max.apply()` to get the longest subarray in the array, `Array.prototype.map()` to make each element an array.\r\nUse `Array.prototype.reduce()` and `Array.prototype.forEach()` to map grouped values to individual arrays.\r\nUse `Array.prototype.map()` and the spread operator (`...`) to apply `fn` to each individual group of elements.",
+        "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.",
         "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]"
         },
@@ -7044,7 +7044,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "2fc5ed2400dea5b93cdf9dd1972bf8b8d0231c9b1ae298ec03f745c6c566a691"
+        "hash": "fe3339dc49a247dabaa0ceca106f1393ea9731c05265f5cb45d5a3f0de09c7ae"
       }
     },
     {
@@ -7052,9 +7052,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "URLJoin.md",
-        "text": "Joins all given URL segments together, then normalizes the resulting URL.\r\n\r\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).",
+        "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).",
         "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'"
         },
@@ -7067,7 +7067,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "938156c9c01f7c8c74ad42b0ece2e6eb6410703087456bfe4ab2fe09aeb8d25d"
+        "hash": "cc0aa77cc2be8e663f52513e8dd2e5926a7d71dbda37967fdb50c223c3a0a5f9"
       }
     },
     {
@@ -7075,9 +7075,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "UUIDGeneratorBrowser.md",
-        "text": "Generates a UUID in a browser.\r\n\r\nUse `crypto` API to generate a UUID, compliant with [RFC4122](https://www.ietf.org/rfc/rfc4122.txt) version 4.",
+        "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.",
         "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'"
         },
@@ -7090,7 +7090,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "39fce8487764a7d52c559693609125008c36577db2fd99441935df862156b48a"
+        "hash": "f43ad3f7f82d15a02cacb2b93c6324c64b55de1c630398ae501ff9b65bd9cb35"
       }
     },
     {
@@ -7098,9 +7098,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "UUIDGeneratorNode.md",
-        "text": "Generates a UUID in Node.JS.\r\n\r\nUse `crypto` API to generate a UUID, compliant with [RFC4122](https://www.ietf.org/rfc/rfc4122.txt) version 4.",
+        "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.",
         "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'"
         },
@@ -7113,7 +7113,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d14ea2a4e10db39f93430d5bc17f4524898488c59fbcbfcecff57c46d36d277e"
+        "hash": "119c813d32e4aa4faed7a497cbf1806e98da0f7c9090656ae02297fe9224b6a1"
       }
     },
     {
@@ -7121,7 +7121,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "validateNumber.md",
-        "text": "Returns `true` if the given value is a number, `false` otherwise.\r\n\r\nUse `!isNaN()` in combination with `parseFloat()` to check if the argument is a number.\r\nUse `isFinite()` to check if the number is finite.\r\nUse `Number()` to check if the coercion holds.",
+        "text": "Returns `true` if the given value is a number, `false` otherwise.\n\nUse `!isNaN()` in combination with `parseFloat()` to check if the argument is a number.\nUse `isFinite()` to check if the number is finite.\nUse `Number()` to check if the coercion holds.",
         "codeBlocks": {
           "es6": "const validateNumber = n => !isNaN(parseFloat(n)) && isFinite(n) && Number(n) == n;",
           "es5": "var validateNumber = function validateNumber(n) {\n  return !isNaN(parseFloat(n)) && isFinite(n) && Number(n) == n;\n};",
@@ -7135,7 +7135,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7123c105b911ef6292d48bedbd0cd80d594df41ce745346c1c8dccdaac76c151"
+        "hash": "8fb993b0cf78fa83a170aca132bf5eb13430e2cef5ae06f85b9763f286bb792c"
       }
     },
     {
@@ -7143,11 +7143,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "when.md",
-        "text": "Tests a value, `x`, against a predicate function. If `true`, return `fn(x)`. Else, return `x`. \r\n\r\nReturn a function expecting a single value, `x`, that returns the appropriate value based on `pred`.",
+        "text": "Tests a value, `x`, against a predicate function. If `true`, return `fn(x)`. Else, return `x`. \n\nReturn a function expecting a single value, `x`, that returns the appropriate value based on `pred`.",
         "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",
@@ -7156,7 +7156,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "d106e35355d7f98ecbaff8f935a9c7d27b31f5c9fa062ab62cdf3bed57bc2890"
+        "hash": "4c3fb917581972b732dbf8a998c377df247721790afa904956420d0e75b3b40a"
       }
     },
     {
@@ -7164,7 +7164,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "without.md",
-        "text": "Filters out the elements of an array, that have one of the specified values.\r\n\r\nUse `Array.prototype.filter()` to create an array excluding(using `!Array.includes()`) all given values.\r\n\r\n_(For a snippet that mutates the original array see [`pull`](#pull))_",
+        "text": "Filters out the elements of an array, that have one of the specified values.\n\nUse `Array.prototype.filter()` to create an array excluding(using `!Array.includes()`) all given values.\n\n_(For a snippet that mutates the original array see [`pull`](#pull))_",
         "codeBlocks": {
           "es6": "const without = (arr, ...args) => arr.filter(v => !args.includes(v));",
           "es5": "var without = function without(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  return arr.filter(function (v) {\n    return !args.includes(v);\n  });\n};",
@@ -7177,7 +7177,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e57dabd910cdfce6f948f00542a2f2a6a47c1a2c5ad6c8482b5c6945be31e293"
+        "hash": "3482e1802a239290ac1170fc1dcb57a2b1197877444c9cca8d6be60c96412e32"
       }
     },
     {
@@ -7185,11 +7185,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "words.md",
-        "text": "Converts a given string into an array of words.\r\n\r\nUse `String.prototype.split()` with a supplied pattern (defaults to non-alpha as a regexp) to convert to an array of strings. Use `Array.prototype.filter()` to remove any empty strings.\r\nOmit the second argument to use the default regexp.",
+        "text": "Converts a given string into an array of words.\n\nUse `String.prototype.split()` with a supplied pattern (defaults to non-alpha as a regexp) to convert to an array of strings. Use `Array.prototype.filter()` to remove any empty strings.\nOmit the second argument to use the default regexp.",
         "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",
@@ -7199,7 +7199,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7d876a51aa2dea887594ad07ac87e68fad8db83cc7fe86aa5d7c553f494a9f65"
+        "hash": "3e68caecbfce1d15160a60993a3270793a1573bda3c71a82fc0086fe48b17a0a"
       }
     },
     {
@@ -7207,7 +7207,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "xProd.md",
-        "text": "Creates a new array out of the two supplied by creating each possible pair from the arrays.\r\n\r\nUse `Array.prototype.reduce()`, `Array.prototype.map()` and `Array.prototype.concat()` to produce every possible pair from the elements of the two arrays and save them in an array.",
+        "text": "Creates a new array out of the two supplied by creating each possible pair from the arrays.\n\nUse `Array.prototype.reduce()`, `Array.prototype.map()` and `Array.prototype.concat()` to produce every possible pair from the elements of the two arrays and save them in an array.",
         "codeBlocks": {
           "es6": "const xProd = (a, b) => a.reduce((acc, x) => acc.concat(b.map(y => [x, y])), []);",
           "es5": "var xProd = function xProd(a, b) {\n  return a.reduce(function (acc, x) {\n    return acc.concat(b.map(function (y) {\n      return [x, y];\n    }));\n  }, []);\n};",
@@ -7221,7 +7221,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "e6a53f3ba53df9e740fe88e0a9dc1b51160cebad901cca96babc601e6c19a320"
+        "hash": "e6d1da6add041592649c4c054de54a35516a8100d9bf8a4209ee0aa7e88f4550"
       }
     },
     {
@@ -7229,11 +7229,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "yesNo.md",
-        "text": "Returns `true` if the string is `y`/`yes` or `false` if the string is `n`/`no`.\r\n\r\nUse `RegExp.test()` to check if the string evaluates to `y/yes` or `n/no`.\r\nOmit the second argument, `def` to set the default answer as `no`.",
+        "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`.",
         "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",
@@ -7243,7 +7243,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "60e89489f96442e8b9094b70188f4cfbd37564efcee09ef9a82ecceacd2af815"
+        "hash": "86e7f2674d08de8520abe029aa6be760449367102a6578bb8efd9703508c63a2"
       }
     },
     {
@@ -7251,11 +7251,11 @@
       "type": "snippet",
       "attributes": {
         "fileName": "zip.md",
-        "text": "Creates an array of elements, grouped based on the position in the original arrays.\r\n\r\nUse `Math.max.apply()` to get the longest array in the arguments.\r\nCreates an array with that length as return value and use `Array.from()` with a map-function to create an array of grouped elements.\r\nIf lengths of the argument-arrays vary, `undefined` is used where no value could be found.",
+        "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.",
         "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",
@@ -7264,7 +7264,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "0d8644bb092295e54744ecf56cab6b7da495f03376c6339e47bfc3045befb681"
+        "hash": "66cedb84131bd3704fc8dc3f9a8692d7a08a990ae749ff8cff688ced18239126"
       }
     },
     {
@@ -7272,11 +7272,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\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()`.",
+        "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()`.",
         "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",
@@ -7286,7 +7286,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "319b81dff475910008f9902ae8ffd64921a6b9fa13b84b03a42cfc6c45bb636d"
+        "hash": "75f51c079a3b129de5ff1ca656422126cae7e4ded12a74038a0453efa0bfab96"
       }
     },
     {
@@ -7294,11 +7294,11 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nCheck if the last argument provided is a function.\r\nUse `Math.max()` to get the longest array in the arguments.\r\nCreates an array with that length as return value and use `Array.from()` with a map-function to create an array of grouped elements.\r\nIf lengths of the argument-arrays vary, `undefined` is used where no value could be found.\r\nThe function is invoked with the elements of each group `(...group)`.",
+        "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)`.",
         "codeBlocks": {
-          "es6": "const zipWith = (...array) => {\r\n  const fn = typeof array[array.length - 1] === 'function' ? array.pop() : undefined;\r\n  return Array.from(\r\n    { length: Math.max(...array.map(a => a.length)) },\r\n    (_, i) => (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(\n    { length: Math.max(...array.map(a => a.length)) },\n    (_, i) => (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",
@@ -7308,7 +7308,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "7cb99869abe8e7ff857b7876fd00cb9ebad3d97b0262845365ed7f75350c10e7"
+        "hash": "c30a9938878dbc4f535c16d16c59e0a7c09643164332f7790345f95557b44303"
       }
     },
     {
@@ -7316,17 +7316,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "binarySearch.md",
-        "text": "Use recursion. Similar to `Array.prototype.indexOf()` that finds the index of a value within an array.\r\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()`.\r\n\r\nSearch a sorted array by repeatedly dividing the search interval in half.\r\nBegin with an interval covering the whole array.\r\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.\r\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`.",
+        "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`.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "6d7326f2e5c78b2817a5bfe03d3e48af4426fdc4d04f7e3604368b84c854df51"
+        "hash": "1ec820569490b17af8315133226e1545efb1d842e4dada922c88126c342a2132"
       }
     },
     {
@@ -7334,7 +7334,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "celsiusToFahrenheit.md",
-        "text": "Celsius to Fahrenheit temperature conversion.\r\n\r\nFollows the conversion formula `F =  1.8C + 32`.",
+        "text": "Celsius to Fahrenheit temperature conversion.\n\nFollows the conversion formula `F =  1.8C + 32`.",
         "codeBlocks": {
           "es6": "const celsiusToFahrenheit = degrees => 1.8 * degrees + 32;",
           "es5": "var celsiusToFahrenheit = function celsiusToFahrenheit(degrees) {\n  return 1.8 * degrees + 32;\n};",
@@ -7344,7 +7344,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "b300cd6f0789d2a6e66d27acad45435287eff0baa645406b23397b434a730de7"
+        "hash": "8289007c7b10777d68d346e0ef02a58a44472cee41d5fb2f3bafaec4f1dd148b"
       }
     },
     {
@@ -7352,17 +7352,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "cleanObj.md",
-        "text": "Removes any properties except the ones specified from a JSON object.\r\n\r\nUse `Object.keys()` method to loop over given JSON object and deleting keys that are not included in given array.\r\nIf you pass a special key,`childIndicator`, it will search deeply apply the function to inner objects, too.",
+        "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.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "66cf60e71546519e93d751ce363a10f755997faa792394e84e9f60c56d843f24"
+        "hash": "ec33abb9423c49520400becb5183d87b37bbf6eb60012673c8df5a0a672a6af0"
       }
     },
     {
@@ -7370,7 +7370,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "collatz.md",
-        "text": "Applies the Collatz algorithm.\r\n\r\nIf `n` is even, return `n/2`. Otherwise, return `3n+1`.",
+        "text": "Applies the Collatz algorithm.\n\nIf `n` is even, return `n/2`. Otherwise, return `3n+1`.",
         "codeBlocks": {
           "es6": "const collatz = n => (n % 2 === 0 ? n / 2 : 3 * n + 1);",
           "es5": "var collatz = function collatz(n) {\n  return n % 2 === 0 ? n / 2 : 3 * n + 1;\n};",
@@ -7380,7 +7380,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "df0a454dda6ddcb7eba46db54ed886f2f7bfbf71560aa401ea41249b64107a2a"
+        "hash": "650c91d557244ee0e3f64a00d457d63b47271aa0b963728bfc37dc5c3c88c67e"
       }
     },
     {
@@ -7388,17 +7388,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "countVowels.md",
-        "text": "Retuns `number` of vowels in provided string.\r\n\r\nUse a regular expression to count the number of vowels `(A, E, I, O, U)` in a `string`.",
+        "text": "Retuns `number` of vowels in provided string.\n\nUse a regular expression to count the number of vowels `(A, E, I, O, U)` in a `string`.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "18385086893ea0a1374288df5111493894047a9c72b12be4bba515da2b4e5dd0"
+        "hash": "333c7a72864d3249f1f409dee1f23214ec47701a54d561a69078e0092137fa4c"
       }
     },
     {
@@ -7406,17 +7406,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "factors.md",
-        "text": "Returns the array of factors of the given `num`.\r\nIf the second argument is set to `true` returns only the prime factors of `num`.\r\nIf `num` is `1` or `0` returns an empty array.\r\nIf `num` is less than `0` returns all the factors of `-int` together with their additive inverses.\r\n\r\nUse `Array.from()`, `Array.prototype.map()` and `Array.prototype.filter()` to find all the factors of `num`.\r\nIf given `num` is negative, use `Array.prototype.reduce()` to add the additive inverses to the array.\r\nReturn all results if `primes` is `false`, else determine and return only the prime factors using `isPrime` and `Array.prototype.filter()`.\r\nOmit the second argument, `primes`, to return prime and non-prime factors by default.\r\n\r\n**Note**:- _Negative numbers are not considered prime._",
+        "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._",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "fa177ca9bbfa710d76d72e60fa358a02ed5876e9f0996ef04947a3274a3b30bd"
+        "hash": "e0056bb031e8df0565daddb6200df1fa9675e2c538e71f354ceeeee164c2b8a9"
       }
     },
     {
@@ -7424,7 +7424,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "fahrenheitToCelsius.md",
-        "text": "Fahrenheit to Celsius temperature conversion.\r\n\r\nFollows the conversion formula `C = (F - 32) * 5/9`.",
+        "text": "Fahrenheit to Celsius temperature conversion.\n\nFollows the conversion formula `C = (F - 32) * 5/9`.",
         "codeBlocks": {
           "es6": "const fahrenheitToCelsius = degrees => (degrees - 32) * 5/9;",
           "es5": "var fahrenheitToCelsius = function fahrenheitToCelsius(degrees) {\n  return (degrees - 32) * 5 / 9;\n};",
@@ -7434,7 +7434,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "266ed1a67c5016ee80aa293181de33bda78aa4b07f80154408114032949d070c"
+        "hash": "89d58eda3d03f8fc8d2fe61fb36376f92a0443435552d063d4fbf5b623fc4314"
       }
     },
     {
@@ -7442,9 +7442,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "fibonacciCountUntilNum.md",
-        "text": "Returns the number of fibonnacci numbers up to `num`(`0` and `num` inclusive).\r\n\r\nUse a mathematical formula to calculate the number of fibonacci numbers until `num`.",
+        "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`.",
         "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"
         },
@@ -7452,7 +7452,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "a905797a88f8f9a83aeee8150e13da9c0ea1d7ad80291a1e85d2dab7f374956b"
+        "hash": "d93d0af81aeca41981ed58548672652f9c5ca4b2a6bb887c2c7e0595112dd035"
       }
     },
     {
@@ -7460,9 +7460,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "fibonacciUntilNum.md",
-        "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\r\n\r\nCreate an empty array of the specific length, initializing the first two values (`0` and `1`).\r\nUse `Array.prototype.reduce()` to add values into the array, using the sum of the last two values, except for the first two.\r\nUses a mathematical formula to calculate the length of the array required.",
+        "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.",
         "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 ]"
         },
@@ -7470,7 +7470,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "6974e513b0ad03399cf580ba25dd83300a5a23ee8e33c77bbfb4b4144be405d3"
+        "hash": "9de50bed5b8c247176570f743c8154a5ec4093432f8a09ba91c423d78af47169"
       }
     },
     {
@@ -7478,9 +7478,9 @@
       "type": "snippet",
       "attributes": {
         "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.\r\n\r\nMore information on what Heron's formula is and why it works available here: https://en.wikipedia.org/wiki/Heron%27s_formula.\r\n\r\nUses `Math.sqrt()` to find the square root of a value.",
+        "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.",
         "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"
         },
@@ -7488,7 +7488,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "e712f8b19919f33e188272490c2f57cc87453f6153c8e768cc2dc41c7f0422e8"
+        "hash": "594721a84a8fe31c32482e9f475f5126b7cf499462d9408b3cfaee2021a96a30"
       }
     },
     {
@@ -7496,17 +7496,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "howManyTimes.md",
-        "text": "Returns the number of times `num` can be divided by `divisor` (integer or fractional) without getting a fractional answer.\r\nWorks for both negative and positive integers.\r\n\r\nIf `divisor` is `-1` or `1` return `Infinity`.\r\nIf `divisor` is `-0` or `0` return `0`.\r\nOtherwise, keep dividing `num` with `divisor` and incrementing `i`, while the result is an integer.\r\nReturn the number of times the loop was executed, `i`.",
+        "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`.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "91cc5a7f2f61b5f5245e385e4f18012a274ee79a955cc970d957be4e774ca9d4"
+        "hash": "41f76138f7e673020c6eecd592baea18016869d7d0161edd9d7669f3a991c398"
       }
     },
     {
@@ -7514,17 +7514,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "httpDelete.md",
-        "text": "Makes a `DELETE` request to the passed URL.\r\n\r\nUse `XMLHttpRequest` web api to make a `delete` request to the given `url`.\r\nHandle the `onload` event, by running the provided `callback` function.\r\nHandle the `onerror` event, by running the provided `err` function.\r\nOmit the third argument, `err` to log the request to the console's error stream by default.",
+        "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.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "aee45d11de7013fa418f08a174b35d2b4004f022951b646b7b0fa9fffc14fbc4"
+        "hash": "0b543697856c3c91e3e0a58d3928d743dbe8a369e7263fbc9806aedf487ff723"
       }
     },
     {
@@ -7532,17 +7532,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "httpPut.md",
-        "text": "Makes a `PUT` request to the passed URL.\r\n\r\nUse `XMLHttpRequest` web api to make a `put` request to the given `url`.\r\nSet the value of an `HTTP` request header with `setRequestHeader` method.\r\nHandle the `onload` event, by running the provided `callback` function.\r\nHandle the `onerror` event, by running the provided `err` function.\r\nOmit the last argument, `err` to log the request to the console's error stream by default.",
+        "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.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "b6488d7a3d127ca002f24da8d45c2f5fe0e097f505aa4f77450e56062321af9e"
+        "hash": "59572ee267c7f0bc7c4e411ebde24834a2f5e8e928e2e50c16ac787034b1a53a"
       }
     },
     {
@@ -7550,17 +7550,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isArmstrongNumber.md",
-        "text": "Checks if the given number is an Armstrong number or not.\r\n\r\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`.",
+        "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`.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "58775e2141232e9e0fe9b57248561dc3171c89e027ad3bf423c90656aedb3f0b"
+        "hash": "28a3c44cfc4ec7d34e00b2866b67bff9b3fb100f6f72c767b893159b869fd8f4"
       }
     },
     {
@@ -7568,17 +7568,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "isSimilar.md",
-        "text": "Determines if the `pattern` matches with `str`.\r\n\r\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.\r\nAdapted from [here](https://github.com/forrestthewoods/lib_fts/blob/80f3f8c52db53428247e741b9efe2cde9667050c/code/fts_fuzzy_match.js#L18).",
+        "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).",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "6c7ad3b71e49012e12d07a9183aeba6ee7c7b800ed7a20550777d90bb64b92f7"
+        "hash": "7a3643ea48d34cc34e33f256cb41ca6a8ad1b8a8830ba2ed3e2354aea3a7bb52"
       }
     },
     {
@@ -7586,9 +7586,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "JSONToDate.md",
-        "text": "Converts a JSON object to a date.\r\n\r\nUse `Date()`, to convert dates in JSON format to readable format (`dd/mm/yyyy`).",
+        "text": "Converts a JSON object to a date.\n\nUse `Date()`, to convert dates in JSON format to readable format (`dd/mm/yyyy`).",
         "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\""
         },
@@ -7596,7 +7596,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "a1b8e5a615907cb7603fb6079d31a4182d8dbfa2479a2b55f48669515442a1a9"
+        "hash": "eb80d886a67c11c9395bcb414beb1e684c875b1318025609b7e12c44a58d99e9"
       }
     },
     {
@@ -7604,17 +7604,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "kmphToMph.md",
-        "text": "Convert kilometers/hour to miles/hour.\r\n\r\nMultiply the constant of proportionality with the argument.",
+        "text": "Convert kilometers/hour to miles/hour.\n\nMultiply the constant of proportionality with the argument.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "5d1569be30b8c4008f3012f4eae220cc8bb81b0249bcf3ce4ce84f32d0327b9e"
+        "hash": "eb96ed6f8063723296da25db7282ad732b35c21cfef2bb1424068ff6a789311c"
       }
     },
     {
@@ -7622,17 +7622,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "levenshteinDistance.md",
-        "text": "Calculates the [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) between two strings.\r\n\r\nCalculates the number of changes (substitutions, deletions or additions) required to convert `string1` to `string2`. \r\nCan also be used to compare two strings as shown in the second example.",
+        "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.",
         "codeBlocks": {
-          "es6": "``` js\r\nconst 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};\r\n```",
+          "es6": "``` js\nconst 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};\n```",
           "es5": "function _templateObject2() {\n  var data = _taggedTemplateLiteral([\" js\\nconst 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};\\n\"]);\n\n  _templateObject2 = function _templateObject2() {\n    return data;\n  };\n\n  return data;\n}\n\nfunction _templateObject() {\n  var data = _taggedTemplateLiteral([\"\"]);\n\n  _templateObject = function _templateObject() {\n    return data;\n  };\n\n  return data;\n}\n\nfunction _taggedTemplateLiteral(strings, raw) { if (!raw) { raw = strings.slice(0); } return Object.freeze(Object.defineProperties(strings, { raw: { value: Object.freeze(raw) } })); }\n\n\"\"(_templateObject2())(_templateObject());",
-          "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "3ed000d3ef2f14d922dcaa172363e6627d22b2fff480a93549b51089098486b4"
+        "hash": "3cc34a842404de0aea2752a6b1398b8a0825cb1a359ff36ab5275f7d15eff107"
       }
     },
     {
@@ -7640,17 +7640,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "mphToKmph.md",
-        "text": "Convert miles/hour to kilometers/hour.\r\n\r\nMultiply the constant of proportionality with the argument.",
+        "text": "Convert miles/hour to kilometers/hour.\n\nMultiply the constant of proportionality with the argument.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "14576a85e48e41a6ad28320b9b62cf828337b0eebfd8cd832e058f7571a4b191"
+        "hash": "174fc1687b3d809f2984e6e7e3e73af321c2bc0030ab1c05c1b1e2a817664e95"
       }
     },
     {
@@ -7658,7 +7658,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "pipeLog.md",
-        "text": "Logs a value and returns it.\r\n\r\nUse `console.log` to log the supplied value, combined with the `||` operator to return it.",
+        "text": "Logs a value and returns it.\n\nUse `console.log` to log the supplied value, combined with the `||` operator to return it.",
         "codeBlocks": {
           "es6": "const pipeLog = data => console.log(data) || data;",
           "es5": "var pipeLog = function pipeLog(data) {\n  return console.log(data) || data;\n};",
@@ -7668,7 +7668,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "90ec0e513ee0b3f81877b56fc0f0d2f4ecab60ab6145d5c43a8ef662ed095821"
+        "hash": "da9808c8ba24ab48b5407ccf48053281bf12627cbe6e24c1b820bfb1216384cb"
       }
     },
     {
@@ -7676,17 +7676,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "quickSort.md",
-        "text": "QuickSort an Array (ascending sort by default).\r\n\r\nUse recursion.\r\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.\r\nIf the parameter `desc` is truthy, return array sorts in descending order.",
+        "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.",
         "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) ? [] : _toConsumableArray(quickSort(nums.filter(function (v) {\n    return desc ? v > n : v <= n;\n  }), desc)).concat([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": []
       },
       "meta": {
         "archived": true,
-        "hash": "db13fb83fc0b26dd85af291e54659a2d3ceb0b3c2779f9563a75e12cbefabcb6"
+        "hash": "5495d306c24323a8b16d5706180208f3828b043eb07d19014774cfe7f8c5b00e"
       }
     },
     {
@@ -7694,9 +7694,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "README.md",
-        "text": "Converts a JSON object to a date.\r\n\r\nUse `Date()`, to convert dates in JSON format to readable format (`dd/mm/yyyy`).",
+        "text": "Converts a JSON object to a date.\n\nUse `Date()`, to convert dates in JSON format to readable format (`dd/mm/yyyy`).",
         "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\""
         },
@@ -7704,7 +7704,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "43390a0c44f832218026a1a12537cb520ab76f7b045ef99bc74c7a4fb0e3f44c"
+        "hash": "cd05a83026c948903673c6d9482c7c1a1c4da1d53e875c60cae3719d7959f79e"
       }
     },
     {
@@ -7712,17 +7712,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "removeVowels.md",
-        "text": "Returns all the vowels in a `str` replaced by `repl`.\r\n\r\nUse `String.prototype.replace()` with a regexp to replace all vowels in `str`.\r\nOmot `repl` to use a default value of `''`.",
+        "text": "Returns all the vowels in a `str` replaced by `repl`.\n\nUse `String.prototype.replace()` with a regexp to replace all vowels in `str`.\nOmot `repl` to use a default value of `''`.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "844c395b6b8d69963e1d181473e7a69bcc87f7c157f7dff402af9556c5f55abd"
+        "hash": "62de33e07d133fc89d71a5091f3f350c007fc60a681e1211ee192b2fb58a2b82"
       }
     },
     {
@@ -7730,17 +7730,17 @@
       "type": "snippet",
       "attributes": {
         "fileName": "solveRPN.md",
-        "text": "Solves the given mathematical expression in [reverse polish notation](https://en.wikipedia.org/wiki/Reverse_Polish_notation).\r\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.\r\n\r\nUse a dictionary, `OPERATORS` to specify each operator's matching mathematical operation.\r\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.\r\nUse `Array.prototype.forEach()` to parse each `symbol`, evaluate it as a numeric value or operator and solve the mathematical expression.\r\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.",
+        "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.",
         "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": []
       },
       "meta": {
         "archived": true,
-        "hash": "264e780d7cd76874cc1913b545d01b6e22e98fcad78a5d82fe3c107c6310a5cd"
+        "hash": "89dc909e8dc0dfbfcafc60e99a3b895370fc20d1930b21717a8125db3777d6f1"
       }
     },
     {
@@ -7748,9 +7748,9 @@
       "type": "snippet",
       "attributes": {
         "fileName": "speechSynthesis.md",
-        "text": "Performs speech synthesis (experimental).\r\n\r\nUse `SpeechSynthesisUtterance.voice` and `window.speechSynthesis.getVoices()` to convert a message to speech.\r\nUse `window.speechSynthesis.speak()` to play the message.\r\n\r\nLearn more about the [SpeechSynthesisUtterance interface of the Web Speech API](https://developer.mozilla.org/en-US/docs/Web/API/SpeechSynthesisUtterance).",
+        "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).",
         "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"
         },
@@ -7758,7 +7758,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "b556b1d2bb7b2dc2c42f8b7c4d63f9fb80a6685ca742029f26c1575fb8aa4649"
+        "hash": "21409f3b5ea7aaa9ad0041508b14c64dcaeff234121aca148e14fe26cf8b5f93"
       }
     },
     {
@@ -7766,7 +7766,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "squareSum.md",
-        "text": "Squares each number in an array and then sums the results together.\r\n\r\nUse `Array.prototype.reduce()` in combination with `Math.pow()` to iterate over numbers and sum their squares into an accumulator.",
+        "text": "Squares each number in an array and then sums the results together.\n\nUse `Array.prototype.reduce()` in combination with `Math.pow()` to iterate over numbers and sum their squares into an accumulator.",
         "codeBlocks": {
           "es6": "const squareSum = (...args) => args.reduce((squareSum, number) => squareSum + Math.pow(number, 2), 0);",
           "es5": "var squareSum = function squareSum() {\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.reduce(function (squareSum, number) {\n    return squareSum + Math.pow(number, 2);\n  }, 0);\n};",
@@ -7776,7 +7776,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "ce4c4ecd3fe24d838fa5c7a3d5106c393275943c2af0de53252a2e205ada5cb2"
+        "hash": "5d7d8623e504377f07ac9827eaec17c309a37aefc2346f0dd0a889f4f716f499"
       }
     }
   ],
diff --git a/snippets_archive/README.md b/snippets_archive/README.md
index 8eb3a1478..0b741c092 100644
--- a/snippets_archive/README.md
+++ b/snippets_archive/README.md
@@ -3,7 +3,6 @@
 These snippets, while useful and interesting, didn't quite make it into the repository due to either having very specific use-cases or being outdated. However we felt like they might still be useful to some readers, so here they are.
 ## Table of Contents
 * [`JSONToDate`](#jsontodate)
-* [`squareSum`](#squaresum)
 * [`binarySearch`](#binarysearch)
 * [`celsiusToFahrenheit`](#celsiustofahrenheit)
 * [`cleanObj`](#cleanobj)
@@ -15,6 +14,7 @@ These snippets, while useful and interesting, didn't quite make it into the repo
 * [`fibonacciUntilNum`](#fibonacciuntilnum)
 * [`heronArea`](#heronarea)
 * [`howManyTimes`](#howmanytimes)
+* [`httpDelete`](#httpdelete)
 * [`httpPut`](#httpput)
 * [`isArmstrongNumber`](#isarmstrongnumber)
 * [`isSimilar`](#issimilar)
@@ -26,7 +26,7 @@ These snippets, while useful and interesting, didn't quite make it into the repo
 * [`removeVowels`](#removevowels)
 * [`solveRPN`](#solverpn)
 * [`speechSynthesis`](#speechsynthesis)
-* [`httpDelete`](#httpdelete)
+* [`squareSum`](#squaresum)
 
 ---
 ### JSONToDate
@@ -53,27 +53,6 @@ JSONToDate(/Date(1489525200000)/); // "14/3/2017"
 
 <br>[⬆ Back to top](#table-of-contents)
 
-### squareSum
-
-Squares each number in an array and then sums the results together.
-
-Use `Array.prototype.reduce()` in combination with `Math.pow()` to iterate over numbers and sum their squares into an accumulator.
-
-```js
-const squareSum = (...args) => args.reduce((squareSum, number) => squareSum + Math.pow(number, 2), 0);
-```
-
-<details>
-<summary>Examples</summary>
-
-```js
-squareSum(1, 2, 2); // 9
-```
-
-</details>
-
-<br>[⬆ Back to top](#table-of-contents)
-
 ### binarySearch
 
 Use recursion. Similar to `Array.prototype.indexOf()` that finds the index of a value within an array.
@@ -388,6 +367,38 @@ howManyTimes(100, -1); // Infinity
 
 <br>[⬆ Back to top](#table-of-contents)
 
+### httpDelete
+
+Makes a `DELETE` request to the passed URL.
+
+Use `XMLHttpRequest` web api to make a `delete` request to the given `url`.
+Handle the `onload` event, by running the provided `callback` function.
+Handle the `onerror` event, by running the provided `err` function.
+Omit the third argument, `err` to log the request to the console's error stream by default.
+
+```js
+const httpDelete = (url, callback, err = console.error) => {
+  const request = new XMLHttpRequest();
+  request.open('DELETE', url, true);
+  request.onload = () => callback(request);
+  request.onerror = () => err(request);
+  request.send();
+};
+```
+
+<details>
+<summary>Examples</summary>
+
+```js
+httpDelete('https://website.com/users/123', request => {
+  console.log(request.responseText);
+}); // 'Deletes a user from the database'
+```
+
+</details>
+
+<br>[⬆ Back to top](#table-of-contents)
+
 ### httpPut
 
 Makes a `PUT` request to the passed URL.
@@ -728,32 +739,21 @@ speechSynthesis('Hello, World'); // // plays the message
 
 <br>[⬆ Back to top](#table-of-contents)
 
-### httpDelete
+### squareSum
 
-Makes a `DELETE` request to the passed URL.
+Squares each number in an array and then sums the results together.
 
-Use `XMLHttpRequest` web api to make a `delete` request to the given `url`.
-Handle the `onload` event, by running the provided `callback` function.
-Handle the `onerror` event, by running the provided `err` function.
-Omit the third argument, `err` to log the request to the console's error stream by default.
+Use `Array.prototype.reduce()` in combination with `Math.pow()` to iterate over numbers and sum their squares into an accumulator.
 
 ```js
-const httpDelete = (url, callback, err = console.error) => {
-  const request = new XMLHttpRequest();
-  request.open('DELETE', url, true);
-  request.onload = () => callback(request);
-  request.onerror = () => err(request);
-  request.send();
-};
+const squareSum = (...args) => args.reduce((squareSum, number) => squareSum + Math.pow(number, 2), 0);
 ```
 
 <details>
 <summary>Examples</summary>
 
 ```js
-httpDelete('https://website.com/users/123', request => {
-  console.log(request.responseText);
-}); // 'Deletes a user from the database'
+squareSum(1, 2, 2); // 9
 ```
 
 </details>
diff --git a/test/testlog b/test/testlog
index 205f261eb..f8ea0ba87 100644
--- a/test/testlog
+++ b/test/testlog
@@ -1,7 +1,7 @@
 
 
 # Starting...
-# 359 test suites found.
+# 360 test suites found.
 
 #  PASS  test/uniqueElements.test.js
 
@@ -45,2150 +45,2229 @@ ok 31 — toKebabCase({}) throws an erro
 ok 32 — toKebabCase(123) throws an erro
 ok 33 — toKebabCase(IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML) takes less than 2s to run
 
+#  PASS  test/toTitleCase.test.js
+
+ok 34 — toTitleCase is a Function
+ok 35 — toTitleCase('some_database_field_name') returns Some Database Field Name
+ok 36 — toTitleCase('Some label that needs to be titled') returns Some Label That Needs To Be Titled
+ok 37 — toTitleCase('some-javaScript-property') return Some Java Script Property
+ok 38 — toTitleCase('some-mixed_string with spaces_underscores-and-hyphens') returns Some Mixed String With Spaces Underscores And Hyphens
+ok 39 — toTitleCase() throws a error
+ok 40 — toTitleCase([]) throws a error
+ok 41 — toCamelCase({}) throws a error
+ok 42 — toTitleCase(123) throws a error
+ok 43 — toTitleCase(some-mixed_string with spaces_underscores-and-hyphens) takes less than 2s to run
+
 #  PASS  test/toCamelCase.test.js
 
-ok 34 — toCamelCase is a Function
-ok 35 — toCamelCase('some_database_field_name') returns someDatabaseFieldName
-ok 36 — toCamelCase('Some label that needs to be camelized') returns someLabelThatNeedsToBeCamelized
-ok 37 — toCamelCase('some-javascript-property') return someJavascriptProperty
-ok 38 — toCamelCase('some-mixed_string with spaces_underscores-and-hyphens') returns someMixedStringWithSpacesUnderscoresAndHyphens
-ok 39 — toCamelCase() throws a error
-ok 40 — toCamelCase([]) throws a error
-ok 41 — toCamelCase({}) throws a error
-ok 42 — toCamelCase(123) throws a error
-ok 43 — toCamelCase(some-mixed_string with spaces_underscores-and-hyphens) takes less than 2s to run
+ok 44 — toCamelCase is a Function
+ok 45 — toCamelCase('some_database_field_name') returns someDatabaseFieldName
+ok 46 — toCamelCase('Some label that needs to be camelized') returns someLabelThatNeedsToBeCamelized
+ok 47 — toCamelCase('some-javascript-property') return someJavascriptProperty
+ok 48 — toCamelCase('some-mixed_string with spaces_underscores-and-hyphens') returns someMixedStringWithSpacesUnderscoresAndHyphens
+ok 49 — toCamelCase() throws a error
+ok 50 — toCamelCase([]) throws a error
+ok 51 — toCamelCase({}) throws a error
+ok 52 — toCamelCase(123) throws a error
+ok 53 — toCamelCase(some-mixed_string with spaces_underscores-and-hyphens) takes less than 2s to run
 
 #  PASS  test/is.test.js
 
-ok 44 — is is a Function
-ok 45 — Works for arrays with data
-ok 46 — Works for empty arrays
-ok 47 — Works for arrays, not objects
-ok 48 — Works for objects
-ok 49 — Works for maps
-ok 50 — Works for regular expressions
-ok 51 — Works for sets
-ok 52 — Works for weak maps
-ok 53 — Works for weak sets
-ok 54 — Works for strings - returns true for primitive
-ok 55 — Works for strings - returns true when using constructor
-ok 56 — Works for numbers - returns true for primitive
-ok 57 — Works for numbers - returns true when using constructor
-ok 58 — Works for booleans - returns true for primitive
-ok 59 — Works for booleans - returns true when using constructor
-ok 60 — Works for functions
+ok 54 — is is a Function
+ok 55 — Works for arrays with data
+ok 56 — Works for empty arrays
+ok 57 — Works for arrays, not objects
+ok 58 — Works for objects
+ok 59 — Works for maps
+ok 60 — Works for regular expressions
+ok 61 — Works for sets
+ok 62 — Works for weak maps
+ok 63 — Works for weak sets
+ok 64 — Works for strings - returns true for primitive
+ok 65 — Works for strings - returns true when using constructor
+ok 66 — Works for numbers - returns true for primitive
+ok 67 — Works for numbers - returns true when using constructor
+ok 68 — Works for booleans - returns true for primitive
+ok 69 — Works for booleans - returns true when using constructor
+ok 70 — Works for functions
 
 #  PASS  test/average.test.js
 
-ok 61 — average is a Function
-ok 62 — average(true) returns 0
-ok 63 — average(false) returns 1
-ok 64 — average(9, 1) returns 5
-ok 65 — average(153, 44, 55, 64, 71, 1122, 322774, 2232, 23423, 234, 3631) returns 32163.909090909092 
-ok 66 — average(1, 2, 3) returns 2
-ok 67 — average(null) returns 0
-ok 68 — average(1, 2, 3) returns NaN
-ok 69 — average(String) returns NaN
-ok 70 — average({ a: 123}) returns NaN
-ok 71 — average([undefined, 0, string]) returns NaN
-ok 72 — average([1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1122, 32124, 23232]) takes less than 2s to run
+ok 71 — average is a Function
+ok 72 — average(true) returns 0
+ok 73 — average(false) returns 1
+ok 74 — average(9, 1) returns 5
+ok 75 — average(153, 44, 55, 64, 71, 1122, 322774, 2232, 23423, 234, 3631) returns 32163.909090909092 
+ok 76 — average(1, 2, 3) returns 2
+ok 77 — average(null) returns 0
+ok 78 — average(1, 2, 3) returns NaN
+ok 79 — average(String) returns NaN
+ok 80 — average({ a: 123}) returns NaN
+ok 81 — average([undefined, 0, string]) returns NaN
+ok 82 — average([1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1122, 32124, 23232]) takes less than 2s to run
 
 #  PASS  test/union.test.js
 
-ok 73 — union is a Function
-ok 74 — union([1, 2, 3], [4, 3, 2]) returns [1, 2, 3, 4]
-ok 75 — union('str', 'asd') returns [ 's', 't', 'r', 'a', 'd' ]
-ok 76 — union([[], {}], [1, 2, 3]) returns [[], {}, 1, 2, 3]
-ok 77 — union([], []) returns []
-ok 78 — union() throws an error
-ok 79 — union(true, 'str') throws an error
-ok 80 — union('false', true) throws an error
-ok 81 — union((123, {}) throws an error
-ok 82 — union([], {}) throws an error
-ok 83 — union(undefined, null) throws an error
-ok 84 — union([1, 2, 3], [4, 3, 2]) takes less than 2s to run
+ok 83 — union is a Function
+ok 84 — union([1, 2, 3], [4, 3, 2]) returns [1, 2, 3, 4]
+ok 85 — union('str', 'asd') returns [ 's', 't', 'r', 'a', 'd' ]
+ok 86 — union([[], {}], [1, 2, 3]) returns [[], {}, 1, 2, 3]
+ok 87 — union([], []) returns []
+ok 88 — union() throws an error
+ok 89 — union(true, 'str') throws an error
+ok 90 — union('false', true) throws an error
+ok 91 — union((123, {}) throws an error
+ok 92 — union([], {}) throws an error
+ok 93 — union(undefined, null) throws an error
+ok 94 — union([1, 2, 3], [4, 3, 2]) takes less than 2s to run
 
 #  PASS  test/validateNumber.test.js
 
-ok 85 — validateNumber is a Function
-ok 86 — validateNumber(9) returns true
-ok 87 — validateNumber(234asd.slice(0, 2)) returns true
-ok 88 — validateNumber(1232) returns true
-ok 89 — validateNumber(1232 + 13423) returns true
-ok 90 — validateNumber(1232 * 2342 * 123) returns true
-ok 91 — validateNumber(1232.23423536) returns true
-ok 92 — validateNumber(234asd) returns false
-ok 93 — validateNumber(e234d) returns false
-ok 94 — validateNumber(false) returns false
-ok 95 — validateNumber(true) returns false
-ok 96 — validateNumber(null) returns false
-ok 97 — validateNumber(123 * asd) returns false
-
-#  PASS  test/toSafeInteger.test.js
-
-ok 98 — toSafeInteger is a Function
-ok 99 — Number(toSafeInteger(3.2)) is a number
-ok 100 — Converts a value to a safe integer
-ok 101 — toSafeInteger('4.2') returns 4
-ok 102 — toSafeInteger(4.6) returns 5
-ok 103 — toSafeInteger([]) returns 0
-ok 104 — isNaN(toSafeInteger([1.5, 3124])) is true
-ok 105 — isNaN(toSafeInteger('string')) is true
-ok 106 — isNaN(toSafeInteger({})) is true
-ok 107 — isNaN(toSafeInteger()) is true
-ok 108 — toSafeInteger(Infinity) returns 9007199254740991
-ok 109 — toSafeInteger(3.2) takes less than 2s to run
-
-#  PASS  test/isPrimitive.test.js
-
-ok 110 — isPrimitive is a Function
-ok 111 — isPrimitive(null) is primitive
-ok 112 — isPrimitive(undefined) is primitive
-ok 113 — isPrimitive(string) is primitive
-ok 114 — isPrimitive(true) is primitive
-ok 115 — isPrimitive(50) is primitive
-ok 116 — isPrimitive('Hello') is primitive
-ok 117 — isPrimitive(false) is primitive
-ok 118 — isPrimitive(Symbol()) is primitive
-ok 119 — isPrimitive([1, 2, 3]) is not primitive
-ok 120 — isPrimitive({ a: 123 }) is not primitive
-ok 121 — isPrimitive({ a: 123 }) takes less than 2s to run
-
-#  PASS  test/zipObject.test.js
-
-ok 122 — zipObject is a Function
-ok 123 — zipObject([a, b, c], [1, 2]) returns {a: 1, b: 2, c: undefined}
-ok 124 — zipObject([a, b], [1, 2, 3]) returns {a: 1, b: 2}
-ok 125 — zipObject([a, b, c], string) returns { a: s, b: t, c: r }
-ok 126 — zipObject([a], string) returns { a: s }
-ok 127 — zipObject() throws an error
-ok 128 — zipObject((['string'], null) throws an error
-ok 129 — zipObject(null, [1]) throws an error
-ok 130 — zipObject('string') throws an error
-ok 131 — zipObject('test', 'string') throws an error
-
-#  PASS  test/quickSort.test.js
-
-ok 132 — quickSort is a Function
-ok 133 — quickSort([5, 6, 4, 3, 1, 2]) returns [1, 2, 3, 4, 5, 6]
-ok 134 — quickSort([-1, 0, -2]) returns [-2, -1, 0]
-ok 135 — quickSort() throws an error
-ok 136 — quickSort(123) throws an error
-ok 137 — quickSort({ 234: string}) throws an error
-ok 138 — quickSort(null) throws an error
-ok 139 — quickSort(undefined) throws an error
-ok 140 — quickSort([11, 1, 324, 23232, -1, 53, 2, 524, 32, 13, 156, 133, 62, 12, 4]) takes less than 2s to run
-
-#  PASS  test/round.test.js
-
-ok 141 — round is a Function
-ok 142 — round(1.005, 2) returns 1.01
-ok 143 — round(123.3423345345345345344, 11) returns 123.34233453453
-ok 144 — round(3.342, 11) returns 3.342
-ok 145 — round(1.005) returns 1
-ok 146 — round([1.005, 2]) returns NaN
-ok 147 — round(string) returns NaN
-ok 148 — round() returns NaN
-ok 149 — round(132, 413, 4134) returns NaN
-ok 150 — round({a: 132}, 413) returns NaN
-ok 151 — round(123.3423345345345345344, 11) takes less than 2s to run
-
-#  PASS  test/yesNo.test.js
-
-ok 152 — yesNo is a Function
-ok 153 — yesNo(Y) returns true
-ok 154 — yesNo(yes) returns true
-ok 155 — yesNo(foo, true) returns true
-ok 156 — yesNo(No) returns false
-ok 157 — yesNo() returns false
-ok 158 — yesNo(null) returns false
-ok 159 — yesNo(undefined) returns false
-ok 160 — yesNo([123, null]) returns false
-ok 161 — yesNo([Yes, No]) returns false
-ok 162 — yesNo({ 2: Yes }) returns false
-ok 163 — yesNo([Yes, No], true) returns true
-ok 164 — yesNo({ 2: Yes }, true) returns true
-
-#  PASS  test/isSorted.test.js
-
-ok 165 — isSorted is a Function
-ok 166 — Array is sorted in ascending order
-ok 167 — Array is sorted in ascending order
-ok 168 — Array is sorted in ascending order
-ok 169 — Array is sorted in ascending order
-ok 170 — Array is sorted in descending order
-ok 171 — Array is sorted in descending order
-ok 172 — Array is sorted in descending order
-ok 173 — Array is sorted in descending order
-ok 174 — Array is empty
-ok 175 — Array is not sorted, direction changed in array
-ok 176 — Array is not sorted, direction changed in array
-
-#  PASS  test/words.test.js
-
-ok 177 — words is a Function
-ok 178 — words('I love javaScript!!') returns [I, love, javaScript]
-ok 179 — words('python, javaScript & coffee') returns [python, javaScript, coffee]
-ok 180 — words(I love javaScript!!) returns an array
-ok 181 — words() throws an error
-ok 182 — words(null) throws an error
-ok 183 — words(undefined) throws an error
-ok 184 — words({}) throws an error
-ok 185 — words([]) throws an error
-ok 186 — words(1234) throws an error
-
-#  PASS  test/longestItem.test.js
-
-ok 187 — longestItem is a Function
-ok 188 — Returns the longest object from plain values
-ok 189 — Returns the longest object from a spread array
-ok 190 — Returns the longest object from mixed input
-ok 191 — Returns the longest array
-ok 192 — Returns the longest object when comparing arrays and strings
-ok 193 — Returns undefined without any input
-ok 194 — Returns first found of all similar
-ok 195 — Throws TypeError if all inputs are undefined
-
-#  PASS  test/without.test.js
-
-ok 196 — without is a Function
-ok 197 — without([2, 1, 2, 3], 1, 2) returns [3]
-ok 198 — without([]) returns []
-ok 199 — without([3, 1, true, '3', true], '3', true) returns [3, 1]
-ok 200 — without('string'.split(''), 's', 't', 'g') returns ['r', 'i', 'n']
-ok 201 — without() throws an error
-ok 202 — without(null) throws an error
-ok 203 — without(undefined) throws an error
-ok 204 — without(123) throws an error
-ok 205 — without({}) throws an error
-
-#  PASS  test/chunk.test.js
-
-ok 206 — chunk is a Function
-ok 207 — chunk([1, 2, 3, 4, 5], 2) returns [[1,2],[3,4],[5]] 
-ok 208 — chunk([]) returns []
-ok 209 — chunk(123) returns []
-ok 210 — chunk({ a: 123}) returns []
-ok 211 — chunk(string, 2) returns [ st, ri, ng ]
-ok 212 — chunk() throws an error
-ok 213 — chunk(undefined) throws an error
-ok 214 — chunk(null) throws an error
-ok 215 — chunk(This is a string, 2) takes less than 2s to run
-
-#  PASS  test/zip.test.js
-
-ok 216 — zip is a Function
-ok 217 — zip([a, b], [1, 2], [true, false]) returns [[a, 1, true], [b, 2, false]]
-ok 218 — zip([a], [1, 2], [true, false]) returns [[a, 1, true], [undefined, 2, false]]
-ok 219 — zip([]) returns []
-ok 220 — zip(123) returns []
-ok 221 — zip([a, b], [1, 2], [true, false]) returns an Array
-ok 222 — zip([a], [1, 2], [true, false]) returns an Array
-ok 223 — zip(null) throws an error
-ok 224 — zip(undefined) throws an error
-
-#  PASS  test/uniqueElementsByRight.test.js
-
-ok 225 — uniqueElementsByRight is a Function
-ok 226 — uniqueElementsByRight works for properties
-ok 227 — uniqueElementsByRight works for nested properties
-
-#  PASS  test/isEmpty.test.js
-
-ok 228 — isEmpty is a Function
-ok 229 — Returns true for empty Map
-ok 230 — Returns true for empty Set
-ok 231 — Returns true for empty array
-ok 232 — Returns true for empty object
-ok 233 — Returns true for empty string
-ok 234 — Returns false for non-empty array
-ok 235 — Returns false for non-empty object
-ok 236 — Returns false for non-empty string
-ok 237 — Returns true - type is not considered a collection
-ok 238 — Returns true - type is not considered a collection
-
-#  PASS  test/last.test.js
-
-ok 239 — last is a Function
-ok 240 — last({ a: 1234}) returns undefined
-ok 241 — last([1, 2, 3]) returns 3
-ok 242 — last({ 0: false}) returns undefined
-ok 243 — last(String) returns g
-ok 244 — last(null) throws an Error
-ok 245 — last(undefined) throws an Error
-ok 246 — last() throws an Error
-ok 247 — last([1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1122, 32124, 23232]) takes less than 2s to run
-
-#  PASS  test/head.test.js
-
-ok 248 — head is a Function
-ok 249 — head({ a: 1234}) returns undefined
-ok 250 — head([1, 2, 3]) returns 1
-ok 251 — head({ 0: false}) returns false
-ok 252 — head(String) returns S
-ok 253 — head(null) throws an Error
-ok 254 — head(undefined) throws an Error
-ok 255 — head() throws an Error
-ok 256 — head([1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1122, 32124, 23232]) takes less than 2s to run
-
-#  PASS  test/uniqueElementsBy.test.js
-
-ok 257 — uniqueElementsBy is a Function
-ok 258 — uniqueElementsBy works for properties
-ok 259 — uniqueElementsBy works for nested properties
-
-#  PASS  test/allEqual.test.js
-
-ok 260 — allEqual is a Function
-ok 261 — Truthy numbers
-ok 262 — Falsy numbers
-ok 263 — Truthy strings
-ok 264 — Falsy numbers
-ok 265 — Truthy trues
-ok 266 — Truthy falses
-ok 267 — Falsy trues
-ok 268 — Falsy falses
-ok 269 — False when there are different types
-
-#  PASS  test/filterNonUniqueBy.test.js
-
-ok 270 — filterNonUniqueBy is a Function
-ok 271 — filterNonUniqueBy works for properties
-ok 272 — filterNonUniqueBy works for nested properties
-
-#  PASS  test/all.test.js
-
-ok 273 — all is a Function
-ok 274 — Returns true for arrays with no falsey values
-ok 275 — Returns false for arrays with 0
-ok 276 — Returns false for arrays with NaN
-ok 277 — Returns false for arrays with undefined
-ok 278 — Returns false for arrays with null
-ok 279 — Returns false for arrays with empty strings
-ok 280 — Returns true with predicate function
-ok 281 — Returns false with a predicate function
-
-#  PASS  test/offset.test.js
-
-ok 282 — offset is a Function
-ok 283 — Offset of 0 returns the same array.
-ok 284 — Offset > 0 returns the offsetted array.
-ok 285 — Offset < 0 returns the reverse offsetted array.
-ok 286 — Offset greater than the length of the array returns the same array.
-ok 287 — Offset less than the negative length of the array returns the same array.
-ok 288 — Offsetting empty array returns an empty array.
+ok 95 — validateNumber is a Function
+ok 96 — validateNumber(9) returns true
+ok 97 — validateNumber(234asd.slice(0, 2)) returns true
+ok 98 — validateNumber(1232) returns true
+ok 99 — validateNumber(1232 + 13423) returns true
+ok 100 — validateNumber(1232 * 2342 * 123) returns true
+ok 101 — validateNumber(1232.23423536) returns true
+ok 102 — validateNumber(234asd) returns false
+ok 103 — validateNumber(e234d) returns false
+ok 104 — validateNumber(false) returns false
+ok 105 — validateNumber(true) returns false
+ok 106 — validateNumber(null) returns false
+ok 107 — validateNumber(123 * asd) returns false
 
 #  PASS  test/equals.test.js
 
-ok 289 — equals is a Function
-ok 290 — { a: [2, {e: 3}], b: [4], c: 'foo' } is equal to { a: [2, {e: 3}], b: [4], c: 'foo' }
-ok 291 — [1,2,3] is equal to [1,2,3]
-ok 292 — { a: [2, 3], b: [4] } is not equal to { a: [2, 3], b: [6] }
-ok 293 — [1,2,3] is not equal to [1,2,4]
-ok 294 — [1, 2, 3] should be equal to { 0: 1, 1: 2, 2: 3 }) - type is different, but their enumerable properties match.
+ok 108 — equals is a Function
+ok 109 — { a: [2, {e: 3}], b: [4], c: 'foo' } is equal to { a: [2, {e: 3}], b: [4], c: 'foo' }
+ok 110 — [1,2,3] is equal to [1,2,3]
+ok 111 — { a: [2, 3], b: [4] } is not equal to { a: [2, 3], b: [6] }
+ok 112 — [1,2,3] is not equal to [1,2,4]
+ok 113 — [1, 2, 3] should be equal to { 0: 1, 1: 2, 2: 3 }) - type is different, but their enumerable properties match.
+ok 114 — Two of the same date are equal
+ok 115 — null should not be equal to anything
+ok 116 — undefined should not be equal to anything
+ok 117 — {a: ""} should not be equal to {a: "", b: ""}
 
-#  PASS  test/pluralize.test.js
+#  PASS  test/toSafeInteger.test.js
 
-ok 295 — pluralize is a Function
-ok 296 — Produces the plural of the word
-ok 297 — Produces the singular of the word
-ok 298 — Produces the plural of the word
-ok 299 — Prodices the defined plural of the word
-ok 300 — Works with a dictionary
+ok 118 — toSafeInteger is a Function
+ok 119 — Number(toSafeInteger(3.2)) is a number
+ok 120 — Converts a value to a safe integer
+ok 121 — toSafeInteger('4.2') returns 4
+ok 122 — toSafeInteger(4.6) returns 5
+ok 123 — toSafeInteger([]) returns 0
+ok 124 — isNaN(toSafeInteger([1.5, 3124])) is true
+ok 125 — isNaN(toSafeInteger('string')) is true
+ok 126 — isNaN(toSafeInteger({})) is true
+ok 127 — isNaN(toSafeInteger()) is true
+ok 128 — toSafeInteger(Infinity) returns 9007199254740991
+ok 129 — toSafeInteger(3.2) takes less than 2s to run
 
-#  PASS  test/randomIntArrayInRange.test.js
+#  PASS  test/isPrimitive.test.js
 
-ok 301 — randomIntArrayInRange is a Function
-ok 302 — The returned array contains only integers
-ok 303 — The returned array has the proper length
-ok 304 — The returned array's values lie between provided lowerLimit and upperLimit (both inclusive).
+ok 130 — isPrimitive is a Function
+ok 131 — isPrimitive(null) is primitive
+ok 132 — isPrimitive(undefined) is primitive
+ok 133 — isPrimitive(string) is primitive
+ok 134 — isPrimitive(true) is primitive
+ok 135 — isPrimitive(50) is primitive
+ok 136 — isPrimitive('Hello') is primitive
+ok 137 — isPrimitive(false) is primitive
+ok 138 — isPrimitive(Symbol()) is primitive
+ok 139 — isPrimitive([1, 2, 3]) is not primitive
+ok 140 — isPrimitive({ a: 123 }) is not primitive
+ok 141 — isPrimitive({ a: 123 }) takes less than 2s to run
 
-#  PASS  test/getImages.test.js
+#  PASS  test/zipObject.test.js
 
-ok 305 — getImages is a Function
-ok 306 — getImages returns an Array
-ok 307 — getImages removes duplicates from images Array
+ok 142 — zipObject is a Function
+ok 143 — zipObject([a, b, c], [1, 2]) returns {a: 1, b: 2, c: undefined}
+ok 144 — zipObject([a, b], [1, 2, 3]) returns {a: 1, b: 2}
+ok 145 — zipObject([a, b, c], string) returns { a: s, b: t, c: r }
+ok 146 — zipObject([a], string) returns { a: s }
+ok 147 — zipObject() throws an error
+ok 148 — zipObject((['string'], null) throws an error
+ok 149 — zipObject(null, [1]) throws an error
+ok 150 — zipObject('string') throws an error
+ok 151 — zipObject('test', 'string') throws an error
 
-#  PASS  test/sampleSize.test.js
+#  PASS  test/quickSort.test.js
 
-ok 308 — sampleSize is a Function
-ok 309 — Returns a single element without n specified
-ok 310 — Returns a random sample of specified size from an array
-ok 311 — Returns all elements in an array if n >= length
-ok 312 — Returns an empty array if original array is empty
-ok 313 — Returns an empty array if n = 0
+ok 152 — quickSort is a Function
+ok 153 — quickSort([5, 6, 4, 3, 1, 2]) returns [1, 2, 3, 4, 5, 6]
+ok 154 — quickSort([-1, 0, -2]) returns [-2, -1, 0]
+ok 155 — quickSort() throws an error
+ok 156 — quickSort(123) throws an error
+ok 157 — quickSort({ 234: string}) throws an error
+ok 158 — quickSort(null) throws an error
+ok 159 — quickSort(undefined) throws an error
+ok 160 — quickSort([11, 1, 324, 23232, -1, 53, 2, 524, 32, 13, 156, 133, 62, 12, 4]) takes less than 2s to run
 
-#  PASS  test/orderBy.test.js
+#  PASS  test/round.test.js
 
-ok 314 — orderBy is a Function
-ok 315 — Returns a sorted array of objects ordered by properties and orders.
-ok 316 — Returns a sorted array of objects ordered by properties and orders.
+ok 161 — round is a Function
+ok 162 — round(1.005, 2) returns 1.01
+ok 163 — round(123.3423345345345345344, 11) returns 123.34233453453
+ok 164 — round(3.342, 11) returns 3.342
+ok 165 — round(1.005) returns 1
+ok 166 — round([1.005, 2]) returns NaN
+ok 167 — round(string) returns NaN
+ok 168 — round() returns NaN
+ok 169 — round(132, 413, 4134) returns NaN
+ok 170 — round({a: 132}, 413) returns NaN
+ok 171 — round(123.3423345345345345344, 11) takes less than 2s to run
 
-#  PASS  test/deepFreeze.test.js
+#  PASS  test/yesNo.test.js
 
-ok 317 — deepFreeze is a Function
-ok 318 — modifying deeply freezed object prop throws an error in strict mode
-ok 319 — should not modify deeply freezed object inside another object
-ok 320 — should not add prop to deeply freezed empty object
+ok 172 — yesNo is a Function
+ok 173 — yesNo(Y) returns true
+ok 174 — yesNo(yes) returns true
+ok 175 — yesNo(foo, true) returns true
+ok 176 — yesNo(No) returns false
+ok 177 — yesNo() returns false
+ok 178 — yesNo(null) returns false
+ok 179 — yesNo(undefined) returns false
+ok 180 — yesNo([123, null]) returns false
+ok 181 — yesNo([Yes, No]) returns false
+ok 182 — yesNo({ 2: Yes }) returns false
+ok 183 — yesNo([Yes, No], true) returns true
+ok 184 — yesNo({ 2: Yes }, true) returns true
 
-#  PASS  test/CSVToArray.test.js
+#  PASS  test/isSorted.test.js
 
-ok 321 — CSVToArray is a Function
-ok 322 — CSVToArray works with default delimiter
-ok 323 — CSVToArray works with custom delimiter
-ok 324 — CSVToArray omits the first row
-ok 325 — CSVToArray omits the first row and works with a custom delimiter
+ok 185 — isSorted is a Function
+ok 186 — Array is sorted in ascending order
+ok 187 — Array is sorted in ascending order
+ok 188 — Array is sorted in ascending order
+ok 189 — Array is sorted in ascending order
+ok 190 — Array is sorted in descending order
+ok 191 — Array is sorted in descending order
+ok 192 — Array is sorted in descending order
+ok 193 — Array is sorted in descending order
+ok 194 — Array is empty
+ok 195 — Array is not sorted, direction changed in array
+ok 196 — Array is not sorted, direction changed in array
 
-#  PASS  test/isWritableStream.test.js
+#  PASS  test/longestItem.test.js
 
-ok 326 — isWritableStream is a Function
-ok 327 — isWritableStream returns false for read streams
-ok 328 — isWritableStream returns true for write streams
-ok 329 — isWritableStream returns true for duplex streams
-ok 330 — isWritableStream returns false for non-streams
+ok 197 — longestItem is a Function
+ok 198 — Returns the longest object from plain values
+ok 199 — Returns the longest object from a spread array
+ok 200 — Returns the longest object from mixed input
+ok 201 — Returns the longest array
+ok 202 — Returns the longest object when comparing arrays and strings
+ok 203 — Returns TypeError without any input
+ok 204 — Returns first found of all similar
+ok 205 — Throws TypeError if all inputs are undefined
 
-#  PASS  test/isReadableStream.test.js
+#  PASS  test/words.test.js
 
-ok 331 — isReadableStream is a Function
-ok 332 — isReadableStream returns true for read streams
-ok 333 — isReadableStream returns false for write streams
-ok 334 — isReadableStream returns true for duplex streams
-ok 335 — isReadableStream returns false for non-streams
+ok 206 — words is a Function
+ok 207 — words('I love javaScript!!') returns [I, love, javaScript]
+ok 208 — words('python, javaScript & coffee') returns [python, javaScript, coffee]
+ok 209 — words(I love javaScript!!) returns an array
+ok 210 — words() throws an error
+ok 211 — words(null) throws an error
+ok 212 — words(undefined) throws an error
+ok 213 — words({}) throws an error
+ok 214 — words([]) throws an error
+ok 215 — words(1234) throws an error
 
-#  PASS  test/any.test.js
+#  PASS  test/without.test.js
 
-ok 336 — any is a Function
-ok 337 — Returns true for arrays with at least one truthy value
-ok 338 — Returns false for arrays with no truthy values
-ok 339 — Returns false for arrays with no truthy values
-ok 340 — Returns true with predicate function
-ok 341 — Returns false with a predicate function
+ok 216 — without is a Function
+ok 217 — without([2, 1, 2, 3], 1, 2) returns [3]
+ok 218 — without([]) returns []
+ok 219 — without([3, 1, true, '3', true], '3', true) returns [3, 1]
+ok 220 — without('string'.split(''), 's', 't', 'g') returns ['r', 'i', 'n']
+ok 221 — without() throws an error
+ok 222 — without(null) throws an error
+ok 223 — without(undefined) throws an error
+ok 224 — without(123) throws an error
+ok 225 — without({}) throws an error
 
-#  PASS  test/randomIntegerInRange.test.js
+#  PASS  test/chunk.test.js
 
-ok 342 — randomIntegerInRange is a Function
-ok 343 — The returned value is an integer
-ok 344 — The returned value lies between provided lowerLimit and upperLimit (both inclusive).
+ok 226 — chunk is a Function
+ok 227 — chunk([1, 2, 3, 4, 5], 2) returns [[1,2],[3,4],[5]] 
+ok 228 — chunk([]) returns []
+ok 229 — chunk(123) returns []
+ok 230 — chunk({ a: 123}) returns []
+ok 231 — chunk(string, 2) returns [ st, ri, ng ]
+ok 232 — chunk() throws an error
+ok 233 — chunk(undefined) throws an error
+ok 234 — chunk(null) throws an error
+ok 235 — chunk(This is a string, 2) takes less than 2s to run
 
-#  PASS  test/initializeArrayWithRange.test.js
+#  PASS  test/zip.test.js
 
-ok 345 — initializeArrayWithRange is a Function
-ok 346 — Initializes an array containing the numbers in the specified range (witout start value)
-ok 347 — Initializes an array containing the numbers in the specified range
-ok 348 — Initializes an array containing the numbers in the specified range (with step)
+ok 236 — zip is a Function
+ok 237 — zip([a, b], [1, 2], [true, false]) returns [[a, 1, true], [b, 2, false]]
+ok 238 — zip([a], [1, 2], [true, false]) returns [[a, 1, true], [undefined, 2, false]]
+ok 239 — zip([]) returns []
+ok 240 — zip(123) returns []
+ok 241 — zip([a, b], [1, 2], [true, false]) returns an Array
+ok 242 — zip([a], [1, 2], [true, false]) returns an Array
+ok 243 — zip(null) throws an error
+ok 244 — zip(undefined) throws an error
 
-#  PASS  test/fahrenheitToCelsius.test.js
+#  PASS  test/uniqueElementsByRight.test.js
 
-ok 349 — fahrenheitToCelsius is a Function
-ok 350 — 32 Fahrenheit is 0 Celsius
-ok 351 — 212 Fahrenheit is 100 Celsius
-ok 352 — 150 Fahrenheit is 65.55555555555556 Celsius
-ok 353 — 1000 Fahrenheit is 537.7777777777778
-ok 354 — Not a number value is NaN
+ok 245 — uniqueElementsByRight is a Function
+ok 246 — uniqueElementsByRight works for properties
+ok 247 — uniqueElementsByRight works for nested properties
 
-#  PASS  test/randomNumberInRange.test.js
+#  PASS  test/isEmpty.test.js
 
-ok 355 — randomNumberInRange is a Function
-ok 356 — The returned value is a number
-ok 357 — The returned value lies between provided lowerLimit and upperLimit (both inclusive).
+ok 248 — isEmpty is a Function
+ok 249 — Returns true for empty Map
+ok 250 — Returns true for empty Set
+ok 251 — Returns true for empty array
+ok 252 — Returns true for empty object
+ok 253 — Returns true for empty string
+ok 254 — Returns false for non-empty array
+ok 255 — Returns false for non-empty object
+ok 256 — Returns false for non-empty string
+ok 257 — Returns true - type is not considered a collection
+ok 258 — Returns true - type is not considered a collection
 
-#  PASS  test/isDuplexStream.test.js
+#  PASS  test/last.test.js
 
-ok 358 — isDuplexStream is a Function
-ok 359 — isDuplexStream returns false for read streams
-ok 360 — isDuplexStream returns false for write streams
-ok 361 — isDuplexStream returns true for duplex streams
-ok 362 — isDuplexStream returns false for non-streams
+ok 259 — last is a Function
+ok 260 — last({ a: 1234}) returns undefined
+ok 261 — last([1, 2, 3]) returns 3
+ok 262 — last({ 0: false}) returns undefined
+ok 263 — last(String) returns g
+ok 264 — last(null) throws an Error
+ok 265 — last(undefined) throws an Error
+ok 266 — last() throws an Error
+ok 267 — last([1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1122, 32124, 23232]) takes less than 2s to run
 
-#  PASS  test/join.test.js
+#  PASS  test/head.test.js
 
-ok 363 — join is a Function
-ok 364 — Joins all elements of an array into a string and returns this string
-ok 365 — Joins all elements of an array into a string and returns this string
-ok 366 — Joins all elements of an array into a string and returns this string
+ok 268 — head is a Function
+ok 269 — head({ a: 1234}) returns undefined
+ok 270 — head([1, 2, 3]) returns 1
+ok 271 — head({ 0: false}) returns false
+ok 272 — head(String) returns S
+ok 273 — head(null) throws an Error
+ok 274 — head(undefined) throws an Error
+ok 275 — head() throws an Error
+ok 276 — head([1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1122, 32124, 23232]) takes less than 2s to run
 
-#  PASS  test/toCurrency.test.js
+#  PASS  test/uniqueElementsBy.test.js
 
-ok 367 — toCurrency is a Function
-ok 368 — currency: Euro | currencyLangFormat: Local
-ok 369 —  currency: US Dollar | currencyLangFormat: English (United States)
-ok 370 — currency: Japanese Yen | currencyLangFormat: Local
+ok 277 — uniqueElementsBy is a Function
+ok 278 — uniqueElementsBy works for properties
+ok 279 — uniqueElementsBy works for nested properties
 
-#  PASS  test/mapObject.test.js
+#  PASS  test/allEqual.test.js
 
-ok 371 — mapObject is a Function
-ok 372 — mapObject([1, 2, 3], a => a * a) returns { 1: 1, 2: 4, 3: 9 }
-ok 373 — mapObject([1, 2, 3, 4], (a, b) => b - a) returns { 1: -1, 2: -1, 3: -1, 4: -1 }
-ok 374 — mapObject([1, 2, 3, 4], (a, b) => a - b) returns { 1: 1, 2: 1, 3: 1, 4: 1 }
+ok 280 — allEqual is a Function
+ok 281 — Truthy numbers
+ok 282 — Falsy numbers
+ok 283 — Truthy strings
+ok 284 — Falsy numbers
+ok 285 — Truthy trues
+ok 286 — Truthy falses
+ok 287 — Falsy trues
+ok 288 — Falsy falses
+ok 289 — False when there are different types
 
-#  PASS  test/geometricProgression.test.js
+#  PASS  test/filterNonUniqueBy.test.js
 
-ok 375 — geometricProgression is a Function
-ok 376 — Initializes an array containing the numbers in the specified range
-ok 377 — Initializes an array containing the numbers in the specified range
-ok 378 — Initializes an array containing the numbers in the specified range
+ok 290 — filterNonUniqueBy is a Function
+ok 291 — filterNonUniqueBy works for properties
+ok 292 — filterNonUniqueBy works for nested properties
+
+#  PASS  test/all.test.js
+
+ok 293 — all is a Function
+ok 294 — Returns true for arrays with no falsey values
+ok 295 — Returns false for arrays with 0
+ok 296 — Returns false for arrays with NaN
+ok 297 — Returns false for arrays with undefined
+ok 298 — Returns false for arrays with null
+ok 299 — Returns false for arrays with empty strings
+ok 300 — Returns true with predicate function
+ok 301 — Returns false with a predicate function
+
+#  PASS  test/offset.test.js
+
+ok 302 — offset is a Function
+ok 303 — Offset of 0 returns the same array.
+ok 304 — Offset > 0 returns the offsetted array.
+ok 305 — Offset < 0 returns the reverse offsetted array.
+ok 306 — Offset greater than the length of the array returns the same array.
+ok 307 — Offset less than the negative length of the array returns the same array.
+ok 308 — Offsetting empty array returns an empty array.
 
 #  PASS  test/binomialCoefficient.test.js
 
-ok 379 — binomialCoefficient is a Function
-ok 380 — Returns the appropriate value
-ok 381 — Returns the appropriate value
-ok 382 — Returns the appropriate value
-ok 383 — Returns NaN
-ok 384 — Returns NaN
-
-#  PASS  test/mapString.test.js
-
-ok 385 — mapString is a Function
-ok 386 — mapString returns a capitalized string
-ok 387 — mapString can deal with indexes
-ok 388 — mapString can deal with the full string
-
-#  PASS  test/dig.test.js
-
-ok 389 — dig is a Function
-ok 390 — Dig target success
-ok 391 — Dig target with falsey value
-ok 392 — Dig target with array
-ok 393 — Unknown target return undefined
-
-#  PASS  test/celsiusToFahrenheit.test.js
-
-ok 394 — celsiusToFahrenheit is a Function
-ok 395 — 0 Celsius is 32 Fahrenheit
-ok 396 — 100 Celsius is 212 Fahrenheit
-ok 397 — -50 Celsius is -58 Fahrenheit
-ok 398 — 1000 Celsius is 1832 Fahrenheit
-ok 399 — Not a number value is NaN
-
-#  PASS  test/reduceWhich.test.js
-
-ok 400 — reduceWhich is a Function
-ok 401 — Returns the minimum of an array
-ok 402 — Returns the maximum of an array
-ok 403 — Returns the object with the minimum specified value in an array
-
-#  PASS  test/isStream.test.js
-
-ok 404 — isStream is a Function
-ok 405 — isStream returns true for read streams
-ok 406 — isStream returns true for write streams
-ok 407 — isStream returns true for duplex streams
-ok 408 — isStream returns false for non-streams
-
-#  PASS  test/invertKeyValues.test.js
-
-ok 409 — invertKeyValues is a Function
-ok 410 — invertKeyValues({ a: 1, b: 2, c: 1 }) returns { 1: [ 'a', 'c' ], 2: [ 'b' ] }
-ok 411 — invertKeyValues({ a: 1, b: 2, c: 1 }, value => 'group' + value) returns { group1: [ 'a', 'c' ], group2: [ 'b' ] }
-
-#  PASS  test/fromCamelCase.test.js
-
-ok 412 — fromCamelCase is a Function
-ok 413 — Converts a string from camelcase
-ok 414 — Converts a string from camelcase
-ok 415 — Converts a string from camelcase
-
-#  PASS  test/shank.test.js
-
-ok 416 — shank is a Function
-ok 417 — Returns an array with the added elements.
-ok 418 — Returns an array with the removed elements.
-ok 419 — Does not mutate the original array
-
-#  PASS  test/approximatelyEqual.test.js
-
-ok 420 — approximatelyEqual is a Function
-ok 421 — Works for PI / 2
-ok 422 — Works for 0.1 + 0.2 === 0.3
-ok 423 — Works for exactly equal values
-ok 424 — Works for a custom epsilon
-
-#  PASS  test/none.test.js
-
-ok 425 — none is a Function
-ok 426 — Returns true for arrays with no truthy values
-ok 427 — Returns false for arrays with at least one truthy value
-ok 428 — Returns true with a predicate function
-ok 429 — Returns false with predicate function
-
-#  PASS  test/castArray.test.js
-
-ok 430 — castArray is a Function
-ok 431 — Works for single values
-ok 432 — Works for arrays with one value
-ok 433 — Works for arrays with multiple value
-ok 434 — Works for strings
-ok 435 — Works for objects
-
-#  PASS  test/binarySearch.test.js
-
-ok 436 — binarySearch is a Function
-ok 437 — Finds item in array
-ok 438 — Returns -1 when not found
-ok 439 — Works with empty arrays
-ok 440 — Works for one element arrays
-
-#  PASS  test/inRange.test.js
-
-ok 441 — inRange is a Function
-ok 442 — The given number falls within the given range
-ok 443 — The given number falls within the given range
-ok 444 — The given number does not falls within the given range
-ok 445 — The given number does not falls within the given range
-
-#  PASS  test/mask.test.js
-
-ok 446 — mask is a Function
-ok 447 — Replaces all but the last num of characters with the specified mask character
-ok 448 — Replaces all but the last num of characters with the specified mask character
-ok 449 — Replaces all but the last num of characters with the specified mask character
-
-#  PASS  test/randomHexColorCode.test.js
-
-ok 450 — randomHexColorCode is a Function
-ok 451 — randomHexColorCode has to proper length
-ok 452 — The color code starts with "#"
-ok 453 — The color code contains only valid hex-digits
-
-#  PASS  test/factorial.test.js
-
-ok 454 — factorial is a Function
-ok 455 — Calculates the factorial of 720
-ok 456 — Calculates the factorial of 0
-ok 457 — Calculates the factorial of 1
-ok 458 — Calculates the factorial of 4
-ok 459 — Calculates the factorial of 10
-
-#  PASS  test/JSONtoCSV.test.js
-
-ok 460 — JSONtoCSV is a Function
-ok 461 — JSONtoCSV works with default delimiter
-ok 462 — JSONtoCSV works with custom delimiter
-
-#  PASS  test/converge.test.js
-
-ok 463 — converge is a Function
-ok 464 — Produces the average of the array
-ok 465 — Produces the strange concatenation
-
-#  PASS  test/capitalize.test.js
-
-ok 466 — capitalize is a Function
-ok 467 — Capitalizes the first letter of a string
-ok 468 — Capitalizes the first letter of a string
-ok 469 — Works with characters
-ok 470 — "Works with single character words
-
-#  PASS  test/toOrdinalSuffix.test.js
-
-ok 471 — toOrdinalSuffix is a Function
-ok 472 — Adds an ordinal suffix to a number
-ok 473 — Adds an ordinal suffix to a number
-ok 474 — Adds an ordinal suffix to a number
-ok 475 — Adds an ordinal suffix to a number
-
-#  PASS  test/deepClone.test.js
-
-ok 476 — deepClone is a Function
-ok 477 — Shallow cloning works
-ok 478 — Deep cloning works
-ok 479 — Array shallow cloning works
-ok 480 — Array deep cloning works
-
-#  PASS  test/isAnagram.test.js
-
-ok 481 — isAnagram is a Function
-ok 482 — Checks valid anagram
-ok 483 — Works with spaces
-ok 484 — Ignores case
-ok 485 — Ignores special characters
-
-#  PASS  test/tomorrow.test.js
-
-ok 486 — tomorrow is a Function
-ok 487 — Returns the correct year
-ok 488 — Returns the correct month
-ok 489 — Returns the correct date
-
-#  PASS  test/shuffle.test.js
-
-ok 490 — shuffle is a Function
-ok 491 — Shuffles the array
-ok 492 — New array contains all original elements
-ok 493 — Works for empty arrays
-ok 494 — Works for single-element arrays
-
-#  PASS  test/prettyBytes.test.js
-
-ok 495 — prettyBytes is a Function
-ok 496 — Converts a number in bytes to a human-readable string.
-ok 497 — Converts a number in bytes to a human-readable string.
-ok 498 — Converts a number in bytes to a human-readable string.
-
-#  PASS  test/isString.test.js
-
-ok 499 — isString is a Function
-ok 500 — foo is a string
-ok 501 — "10" is a string
-ok 502 — Empty string is a string
-ok 503 — 10 is not a string
-ok 504 — true is not string
-
-#  PASS  test/dropRight.test.js
-
-ok 505 — dropRight is a Function
-ok 506 — Returns a new array with n elements removed from the right
-ok 507 — Returns a new array with n elements removed from the right
-ok 508 — Returns a new array with n elements removed from the right
-
-#  PASS  test/hexToRGB.test.js
-
-ok 509 — hexToRGB is a Function
-ok 510 — Converts a color code to a rgb() or rgba() string
-ok 511 — Converts a color code to a rgb() or rgba() string
-ok 512 — Converts a color code to a rgb() or rgba() string
-
-#  PASS  test/partition.test.js
-
-ok 513 — partition is a Function
-ok 514 — Groups the elements into two arrays, depending on the provided function's truthiness for each element.
-
-#  PASS  test/stringPermutations.test.js
-
-ok 515 — stringPermutations is a Function
-ok 516 — Generates all stringPermutations of a string
-ok 517 — Works for single-letter strings
-ok 518 — Works for empty strings
-
-#  PASS  test/formatDuration.test.js
-
-ok 519 — formatDuration is a Function
-ok 520 — Returns the human readable format of the given number of milliseconds
-ok 521 — Returns the human readable format of the given number of milliseconds
-
-#  PASS  test/sumPower.test.js
-
-ok 522 — sumPower is a Function
-ok 523 — Returns the sum of the powers of all the numbers from start to end
-ok 524 — Returns the sum of the powers of all the numbers from start to end
-ok 525 — Returns the sum of the powers of all the numbers from start to end
-
-#  PASS  test/isObjectLike.test.js
-
-ok 526 — isObjectLike is a Function
-ok 527 — Returns true for an object
-ok 528 — Returns true for an array
-ok 529 — Returns false for a function
-ok 530 — Returns false for null
-
-#  PASS  test/untildify.test.js
-
-ok 531 — untildify is a Function
-ok 532 — Contains no tildes
-ok 533 — Does not alter the rest of the path
-ok 534 — Does not alter paths without tildes
-
-#  PASS  test/isObject.test.js
-
-ok 535 — isObject is a Function
-ok 536 — isObject([1, 2, 3, 4]) is a object
-ok 537 — isObject([]) is a object
-ok 538 — isObject({ a:1 }) is a object
-ok 539 — isObject(true) is not a object
-
-#  PASS  test/standardDeviation.test.js
-
-ok 540 — standardDeviation is a Function
-ok 541 — Returns the standard deviation of an array of numbers
-ok 542 — Returns the standard deviation of an array of numbers
-
-#  PASS  test/capitalizeEveryWord.test.js
-
-ok 543 — capitalizeEveryWord is a Function
-ok 544 — Capitalizes the first letter of every word in a string
-ok 545 — Works with characters
-ok 546 — Works with one word string
-
-#  PASS  test/unzip.test.js
-
-ok 547 — unzip is a Function
-ok 548 — unzip([['a', 1, true], ['b', 2, false]]) equals [['a','b'], [1, 2], [true, false]]
-ok 549 — unzip([['a', 1, true], ['b', 2]]) equals [['a','b'], [1, 2], [true]]
-
-#  PASS  test/URLJoin.test.js
-
-ok 550 — URLJoin is a Function
-ok 551 — Returns proper URL
-ok 552 — Returns proper URL
-
-#  PASS  test/CSVToJSON.test.js
-
-ok 553 — CSVToJSON is a Function
-ok 554 — CSVToJSON works with default delimiter
-ok 555 — CSVToJSON works with custom delimiter
-
-#  PASS  test/byteSize.test.js
-
-ok 556 — byteSize is a Function
-ok 557 — Works for a single letter
-ok 558 — Works for a common string
-ok 559 — Works for emoji
-
-#  PASS  test/sortedIndex.test.js
-
-ok 560 — sortedIndex is a Function
-ok 561 — Returns the lowest index at which value should be inserted into array in order to maintain its sort order.
-ok 562 — Returns the lowest index at which value should be inserted into array in order to maintain its sort order.
-
-#  PASS  test/reducedFilter.test.js
-
-ok 563 — reducedFilter is a Function
-ok 564 — Filter an array of objects based on a condition while also filtering out unspecified keys.
-
-#  PASS  test/matches.test.js
-
-ok 565 — matches is a Function
-ok 566 — Matches returns true for two similar objects
-ok 567 — Matches returns false for two non-similar objects
-
-#  PASS  test/uncurry.test.js
-
-ok 568 — uncurry is a Function
-ok 569 — Works without a provided value for n
-ok 570 — Works with n = 2
-ok 571 — Works with n = 3
-
-#  PASS  test/pad.test.js
-
-ok 572 — pad is a Function
-ok 573 — cat is padded on both sides
-ok 574 — length of string is 8
-ok 575 — pads 42 with "0"
-ok 576 — does not truncates if string exceeds length
-
-#  PASS  test/isAbsoluteURL.test.js
-
-ok 577 — isAbsoluteURL is a Function
-ok 578 — Given string is an absolute URL
-ok 579 — Given string is an absolute URL
-ok 580 — Given string is not an absolute URL
-
-#  PASS  test/collectInto.test.js
-
-ok 581 — collectInto is a Function
-ok 582 — Works with multiple promises
-
-#  PASS  test/isValidJSON.test.js
-
-ok 583 — isValidJSON is a Function
-ok 584 — {"name":"Adam","age":20} is a valid JSON
-ok 585 — {"name":"Adam",age:"20"} is not a valid JSON
-ok 586 — null is a valid JSON
-
-#  PASS  test/groupBy.test.js
-
-ok 587 — groupBy is a Function
-ok 588 — Groups the elements of an array based on the given function
-ok 589 — Groups the elements of an array based on the given function
-
-#  PASS  test/uniqueSymmetricDifference.test.js
-
-ok 590 — uniqueSymmetricDifference is a Function
-ok 591 — Returns the symmetric difference between two arrays.
-ok 592 — Does not return duplicates from one array
-
-#  PASS  test/symmetricDifferenceWith.test.js
-
-ok 593 — symmetricDifferenceWith is a Function
-ok 594 — Returns the symmetric difference between two arrays, using a provided function as a comparator
-
-#  PASS  test/functionName.test.js
-
-ok 595 — functionName is a Function
-ok 596 — Works for native functions
-ok 597 — Works for functions
-ok 598 — Works for arrow functions
-
-#  PASS  test/lowercaseKeys.test.js
-
-ok 599 — lowercaseKeys is a Function
-ok 600 — Lowercases object keys
-ok 601 — Does not mutate original object
-
-#  PASS  test/collatz.test.js
-
-ok 602 — collatz is a Function
-ok 603 — When n is even, divide by 2
-ok 604 — When n is odd, times by 3 and add 1
-ok 605 — Eventually reaches 1
-
-#  PASS  test/reject.test.js
-
-ok 606 — reject is a Function
-ok 607 — Works with numbers
-ok 608 — Works with strings
-
-#  PASS  test/matchesWith.test.js
-
-ok 609 — matchesWith is a Function
-ok 610 — Returns true for two objects with similar values, based on the provided function
-
-#  PASS  test/luhnCheck.test.js
-
-ok 611 — luhnCheck is a Function
-ok 612 — validates identification number
-ok 613 — validates identification number
-ok 614 — validates identification number
-
-#  PASS  test/nthArg.test.js
-
-ok 615 — nthArg is a Function
-ok 616 — Returns the nth argument
-ok 617 — Returns undefined if arguments too few
-ok 618 — Works for negative values
-
-#  PASS  test/sample.test.js
-
-ok 619 — sample is a Function
-ok 620 — Returns a random element from the array
-ok 621 — Works for single-element arrays
-ok 622 — Returns undefined for empty array
-
-#  PASS  test/UUIDGeneratorNode.test.js
-
-ok 623 — UUIDGeneratorNode is a Function
-ok 624 — Contains dashes in the proper places
-ok 625 — Only contains hexadecimal digits
-
-#  PASS  test/drop.test.js
-
-ok 626 — drop is a Function
-ok 627 — Works without the last argument
-ok 628 — Removes appropriate element count as specified
-ok 629 — Empties array given a count greater than length
-
-#  PASS  test/isBeforeDate.test.js
-
-ok 630 — isBeforeDate is a Function
-ok 631 — isBeforeDate produces the correct result
-ok 632 — isBeforeDate produces the correct result
-
-#  PASS  test/symmetricDifference.test.js
-
-ok 633 — symmetricDifference is a Function
-ok 634 — Returns the symmetric difference between two arrays.
-ok 635 — Returns duplicates from one array
-
-#  PASS  test/flattenObject.test.js
-
-ok 636 — flattenObject is a Function
-ok 637 — Flattens an object with the paths for keys
-ok 638 — Works with arrays
-
-#  PASS  test/intersectionWith.test.js
-
-ok 639 — intersectionWith is a Function
-ok 640 — Returns a list of elements that exist in both arrays, using a provided comparator function
-
-#  PASS  test/elo.test.js
-
-ok 641 — elo is a Function
-ok 642 — Standard 1v1s
-ok 643 — Standard 1v1s
-ok 644 — 4 player FFA, all same rank
-
-#  PASS  test/functions.test.js
-
-ok 645 — functions is a Function
-ok 646 — Returns own methods
-ok 647 — Returns own and inherited methods
-
-#  PASS  test/isAfterDate.test.js
-
-ok 648 — isAfterDate is a Function
-ok 649 — isAfterDate produces the correct result
-ok 650 — isBeforeDate produces the correct result
-
-#  PASS  test/differenceBy.test.js
-
-ok 651 — differenceBy is a Function
-ok 652 — Works using a native function and numbers
-ok 653 — Works with arrow function and objects
-
-#  PASS  test/pipeAsyncFunctions.test.js
-
-ok 654 — pipeAsyncFunctions is a Function
-ok 655 — pipeAsyncFunctions result should be 15
-
-#  PASS  test/memoize.test.js
-
-ok 656 — memoize is a Function
-ok 657 — Function works properly
-ok 658 — Function works properly
-ok 659 — Cache stores values
-
-#  PASS  test/renameKeys.test.js
-
-ok 660 — renameKeys is a Function
-ok 661 — renameKeys is a Function
-
-#  PASS  test/isSameDate.test.js
-
-ok 662 — isSameDate is a Function
-ok 663 — isSameDate produces the correct result
-ok 664 — isSameDate produces the correct result
-
-#  PASS  test/averageBy.test.js
-
-ok 665 — averageBy is a Function
-ok 666 — Produces the right result with a function
-ok 667 — Produces the right result with a property name
-
-#  PASS  test/isLowerCase.test.js
-
-ok 668 — isLowerCase is a Function
-ok 669 — passed string is a lowercase
-ok 670 — passed string is a lowercase
-ok 671 — passed value is not a lowercase
-
-#  PASS  test/bindKey.test.js
-
-ok 672 — bindKey is a Function
-ok 673 — Binds function to an object context
-
-#  PASS  test/findLastKey.test.js
-
-ok 674 — findLastKey is a Function
-ok 675 — eturns the appropriate key
-
-#  PASS  test/arrayToCSV.test.js
-
-ok 676 — arrayToCSV is a Function
-ok 677 — arrayToCSV works with default delimiter
-ok 678 — arrayToCSV works with custom delimiter
-
-#  PASS  test/isPromiseLike.test.js
-
-ok 679 — isPromiseLike is a Function
-ok 680 — Returns true for a promise-like object
-ok 681 — Returns false for an empty object
-
-#  PASS  test/promisify.test.js
-
-ok 682 — promisify is a Function
-ok 683 — Returns a promise
-ok 684 — Runs the function provided
-
-#  PASS  test/isArrayLike.test.js
-
-ok 685 — isArrayLike is a Function
-ok 686 — Returns true for a string
-ok 687 — Returns true for an array
-ok 688 — Returns false for null
-
-#  PASS  test/maxBy.test.js
-
-ok 689 — maxBy is a Function
-ok 690 — Produces the right result with a function
-ok 691 — Produces the right result with a property name
-
-#  PASS  test/minBy.test.js
-
-ok 692 — minBy is a Function
-ok 693 — Produces the right result with a function
-ok 694 — Produces the right result with a property name
-
-#  PASS  test/symmetricDifferenceBy.test.js
-
-ok 695 — symmetricDifferenceBy is a Function
-ok 696 — Returns the symmetric difference between two arrays, after applying the provided function to each array element of both
-
-#  PASS  test/isUpperCase.test.js
-
-ok 697 — isUpperCase is a Function
-ok 698 — ABC is all upper case
-ok 699 — abc is not all upper case
-ok 700 — A3@$ is all uppercase
-
-#  PASS  test/unzipWith.test.js
-
-ok 701 — unzipWith is a Function
-ok 702 — unzipWith([[1, 10, 100], [2, 20, 200]], (...args) => args.reduce((acc, v) => acc + v, 0)) equals [3, 30, 300]
-
-#  PASS  test/truthCheckCollection.test.js
-
-ok 703 — truthCheckCollection is a Function
-ok 704 — second argument is truthy on all elements of a collection
-
-#  PASS  test/pullAtValue.test.js
-
-ok 705 — pullAtValue is a Function
-ok 706 — Pulls the specified values
-ok 707 — Pulls the specified values
-
-#  PASS  test/findKey.test.js
-
-ok 708 — findKey is a Function
-ok 709 — Returns the appropriate key
-
-#  PASS  test/merge.test.js
-
-ok 710 — merge is a Function
-ok 711 — Merges two objects
-
-#  PASS  test/bind.test.js
-
-ok 712 — bind is a Function
-ok 713 — Binds to an object context
-
-#  PASS  test/pullAtIndex.test.js
-
-ok 714 — pullAtIndex is a Function
-ok 715 — Pulls the given values
-ok 716 — Pulls the given values
-
-#  PASS  test/indentString.test.js
-
-ok 717 — indentString is a Function
-ok 718 — indentString is a Function
-ok 719 — indentString is a Function
-
-#  PASS  test/takeRight.test.js
-
-ok 720 — takeRight is a Function
-ok 721 — Returns an array with n elements removed from the end
-ok 722 — Returns an array with n elements removed from the end
-
-#  PASS  test/transform.test.js
-
-ok 723 — transform is a Function
-ok 724 — Transforms an object
-
-#  PASS  test/gcd.test.js
-
-ok 725 — gcd is a Function
-ok 726 — Calculates the greatest common divisor between two or more numbers/arrays
-ok 727 — Calculates the greatest common divisor between two or more numbers/arrays
-
-#  PASS  test/isNil.test.js
-
-ok 728 — isNil is a Function
-ok 729 — Returns true for null
-ok 730 — Returns true for undefined
-ok 731 — Returns false for an empty string
-
-#  PASS  test/coalesceFactory.test.js
-
-ok 732 — coalesceFactory is a Function
-ok 733 — Returns a customized coalesce function
-
-#  PASS  test/take.test.js
-
-ok 734 — take is a Function
-ok 735 — Returns an array with n elements removed from the beginning.
-ok 736 — Returns an array with n elements removed from the beginning.
-
-#  PASS  test/indexOfAll.test.js
-
-ok 737 — indexOfAll is a Function
-ok 738 — Returns all indices of val in an array
-ok 739 — When val is not found, return an empty array
-
-#  PASS  test/extendHex.test.js
-
-ok 740 — extendHex is a Function
-ok 741 — Extends a 3-digit color code to a 6-digit color code
-ok 742 — Extends a 3-digit color code to a 6-digit color code
-
-#  PASS  test/isPlainObject.test.js
-
-ok 743 — isPlainObject is a Function
-ok 744 — Returns true for a plain object
-ok 745 — Returns false for a Map (example of non-plain object)
-
-#  PASS  test/maxDate.test.js
-
-ok 746 — maxDate is a Function
-ok 747 — maxDate produces the maximum date
-
-#  PASS  test/isTravisCI.test.js
-
-ok 748 — isTravisCI is a Function
-ok 749 — Running on Travis, correctly evaluates
-
-#  PASS  test/intersectionBy.test.js
-
-ok 750 — intersectionBy is a Function
-ok 751 — Returns a list of elements that exist in both arrays, after applying the provided function to each array element of both
-
-#  PASS  test/minDate.test.js
-
-ok 752 — minDate is a Function
-ok 753 — minDate produces the maximum date
-
-#  PASS  test/getURLParameters.test.js
-
-ok 754 — getURLParameters is a Function
-ok 755 — Returns an object containing the parameters of the current URL
-
-#  PASS  test/pipeFunctions.test.js
-
-ok 756 — pipeFunctions is a Function
-ok 757 — Performs left-to-right function composition
-
-#  PASS  test/reduceSuccessive.test.js
-
-ok 758 — reduceSuccessive is a Function
-ok 759 — Returns the array of successively reduced values
-
-#  PASS  test/chainAsync.test.js
-
-ok 760 — chainAsync is a Function
-ok 761 — Calls all functions in an array
-
-#  PASS  test/countBy.test.js
-
-ok 762 — countBy is a Function
-ok 763 — Works for functions
-ok 764 — Works for property names
-
-#  PASS  test/cleanObj.test.js
-
-ok 765 — cleanObj is a Function
-ok 766 — Removes any properties except the ones specified from a JSON object
-
-#  PASS  test/runPromisesInSeries.test.js
-
-ok 767 — runPromisesInSeries is a Function
-ok 768 — Runs promises in series
-
-#  PASS  test/overArgs.test.js
-
-ok 769 — overArgs is a Function
-ok 770 — Invokes the provided function with its arguments transformed
-
-#  PASS  test/hashNode.test.js
-
-ok 771 — hashNode is a Function
-ok 772 — Produces the appropriate hash
-
-#  PASS  test/nthElement.test.js
-
-ok 773 — nthElement is a Function
-ok 774 — Returns the nth element of an array.
-ok 775 — Returns the nth element of an array.
-
-#  PASS  test/spreadOver.test.js
-
-ok 776 — spreadOver is a Function
-ok 777 — Takes a variadic function and returns a closure that accepts an array of arguments to map to the inputs of the function.
-
-#  PASS  test/decapitalize.test.js
-
-ok 778 — decapitalize is a Function
-ok 779 — Works with default parameter
-ok 780 — Works with second parameter set to true
-
-#  PASS  test/minN.test.js
-
-ok 781 — minN is a Function
-ok 782 — Returns the n minimum elements from the provided array
-ok 783 — Returns the n minimum elements from the provided array
-
-#  PASS  test/maxN.test.js
-
-ok 784 — maxN is a Function
-ok 785 — Returns the n maximum elements from the provided array
-ok 786 — Returns the n maximum elements from the provided array
-
-#  PASS  test/shallowClone.test.js
-
-ok 787 — shallowClone is a Function
-ok 788 — Shallow cloning works
-ok 789 — Does not clone deeply
-
-#  PASS  test/when.test.js
-
-ok 790 — when is a Function
-ok 791 — Returns the proper result
-ok 792 — Returns the proper result
-
-#  PASS  test/flatten.test.js
-
-ok 793 — flatten is a Function
-ok 794 — Flattens an array
-ok 795 — Flattens an array
-
-#  PASS  test/partialRight.test.js
-
-ok 796 — partialRight is a Function
-ok 797 — Appends arguments
-
-#  PASS  test/composeRight.test.js
-
-ok 798 — composeRight is a Function
-ok 799 — Performs left-to-right function composition
-
-#  PASS  test/permutations.test.js
-
-ok 800 — permutations is a Function
-ok 801 — Generates all permutations of an array
-
-#  PASS  test/compose.test.js
-
-ok 802 — compose is a Function
-ok 803 — Performs right-to-left function composition
-
-#  PASS  test/lcm.test.js
-
-ok 804 — lcm is a Function
-ok 805 — Returns the least common multiple of two or more numbers.
-ok 806 — Returns the least common multiple of two or more numbers.
-
-#  PASS  test/splitLines.test.js
-
-ok 807 — splitLines is a Function
-ok 808 — Splits a multiline string into an array of lines.
-
-#  PASS  test/bindAll.test.js
-
-ok 809 — bindAll is a Function
-ok 810 — Binds to an object context
-
-#  PASS  test/sortedLastIndexBy.test.js
-
-ok 811 — sortedLastIndexBy is a Function
-ok 812 — Returns the highest index to insert the element without messing up the list order
-
-#  PASS  test/percentile.test.js
-
-ok 813 — percentile is a Function
-ok 814 — Uses the percentile formula to calculate how many numbers in the given array are less or equal to the given value.
-
-#  PASS  test/getDaysDiffBetweenDates.test.js
-
-ok 815 — getDaysDiffBetweenDates is a Function
-ok 816 — Returns the difference in days between two dates
-
-#  PASS  test/differenceWith.test.js
-
-ok 817 — differenceWith is a Function
-ok 818 — Filters out all values from an array
-
-#  PASS  test/partial.test.js
-
-ok 819 — partial is a Function
-ok 820 — Prepends arguments
-
-#  PASS  test/size.test.js
-
-ok 821 — size is a Function
-ok 822 — Get size of arrays, objects or strings.
-ok 823 — Get size of arrays, objects or strings.
-
-#  PASS  test/mapValues.test.js
-
-ok 824 — mapValues is a Function
-ok 825 — Maps values
-
-#  PASS  test/unionWith.test.js
-
-ok 826 — unionWith is a Function
-ok 827 — Produces the appropriate results
-
-#  PASS  test/median.test.js
-
-ok 828 — median is a Function
-ok 829 — Returns the median of an array of numbers
-ok 830 — Returns the median of an array of numbers
-
-#  PASS  test/palindrome.test.js
-
-ok 831 — palindrome is a Function
-ok 832 — Given string is a palindrome
-ok 833 — Given string is not a palindrome
-
-#  PASS  test/bifurcate.test.js
-
-ok 834 — bifurcate is a Function
-ok 835 — Splits the collection into two groups
-
-#  PASS  test/bifurcateBy.test.js
-
-ok 836 — bifurcateBy is a Function
-ok 837 — Splits the collection into two groups
-
-#  PASS  test/initializeArrayWithValues.test.js
-
-ok 838 — initializeArrayWithValues is a Function
-ok 839 — Initializes and fills an array with the specified values
-
-#  PASS  test/attempt.test.js
-
-ok 840 — attempt is a Function
-ok 841 — Returns a value
-ok 842 — Returns an error
-
-#  PASS  test/degreesToRads.test.js
-
-ok 843 — degreesToRads is a Function
-ok 844 — Returns the appropriate value
-
-#  PASS  test/rearg.test.js
-
-ok 845 — rearg is a Function
-ok 846 — Reorders arguments in invoked function
-
-#  PASS  test/forOwnRight.test.js
-
-ok 847 — forOwnRight is a Function
-ok 848 — Iterates over an element's key-value pairs in reverse
-
-#  PASS  test/pickBy.test.js
-
-ok 849 — pickBy is a Function
-ok 850 — Creates an object composed of the properties the given function returns truthy for.
-
-#  PASS  test/flip.test.js
-
-ok 851 — flip is a Function
-ok 852 — Flips argument order
-
-#  PASS  test/sortedIndexBy.test.js
-
-ok 853 — sortedIndexBy is a Function
-ok 854 — Returns the lowest index to insert the element without messing up the list order
-
-#  PASS  test/dropRightWhile.test.js
-
-ok 855 — dropRightWhile is a Function
-ok 856 — Removes elements from the end of an array until the passed function returns true.
-
-#  PASS  test/get.test.js
-
-ok 857 — get is a Function
-ok 858 — Retrieve a property indicated by the selector from an object.
-
-#  PASS  test/omitBy.test.js
-
-ok 859 — omitBy is a Function
-ok 860 — Creates an object composed of the properties the given function returns falsey for
-
-#  PASS  test/compact.test.js
-
-ok 861 — compact is a Function
-ok 862 — Removes falsey values from an array
-
-#  PASS  test/unescapeHTML.test.js
-
-ok 863 — unescapeHTML is a Function
-ok 864 — Unescapes escaped HTML characters.
-
-#  PASS  test/isFunction.test.js
-
-ok 865 — isFunction is a Function
-ok 866 — passed value is a function
-ok 867 — passed value is not a function
-
-#  PASS  test/pullBy.test.js
-
-ok 868 — pullBy is a Function
-ok 869 — Pulls the specified values
-
-#  PASS  test/sortedLastIndex.test.js
-
-ok 870 — sortedLastIndex is a Function
-ok 871 — Returns the highest index to insert the element without messing up the list order
-
-#  PASS  test/isBoolean.test.js
-
-ok 872 — isBoolean is a Function
-ok 873 — passed value is not a boolean
-ok 874 — passed value is not a boolean
-
-#  PASS  test/escapeHTML.test.js
-
-ok 875 — escapeHTML is a Function
-ok 876 — Escapes a string for use in HTML
-
-#  PASS  test/xProd.test.js
-
-ok 877 — xProd is a Function
-ok 878 — xProd([1, 2], ['a', 'b']) returns [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]
-
-#  PASS  test/unflattenObject.test.js
-
-ok 879 — unflattenObject is a Function
-ok 880 — Unflattens an object with the paths for keys
-
-#  PASS  test/isNumber.test.js
-
-ok 881 — isNumber is a Function
-ok 882 — passed argument is a number
-ok 883 — passed argument is not a number
-
-#  PASS  test/stableSort.test.js
-
-ok 884 — stableSort is a Function
-ok 885 — Array is properly sorted
-
-#  PASS  test/sortCharactersInString.test.js
-
-ok 886 — sortCharactersInString is a Function
-ok 887 — Alphabetically sorts the characters in a string.
-
-#  PASS  test/initialize2DArray.test.js
-
-ok 888 — initialize2DArray is a Function
-ok 889 — Initializes a 2D array of given width and height and value
-
-#  PASS  test/unfold.test.js
-
-ok 890 — unfold is a Function
-ok 891 — Works with a given function, producing an array
-
-#  PASS  test/forEachRight.test.js
-
-ok 892 — forEachRight is a Function
-ok 893 — Iterates over the array in reverse
-
-#  PASS  test/ary.test.js
-
-ok 894 — ary is a Function
-ok 895 — Discards arguments with index >=n
-
-#  PASS  test/stripHTMLTags.test.js
-
-ok 896 — stripHTMLTags is a Function
-ok 897 — Removes HTML tags
-
-#  PASS  test/objectToPairs.test.js
-
-ok 898 — objectToPairs is a Function
-ok 899 — Creates an array of key-value pair arrays from an object.
-
-#  PASS  test/objectFromPairs.test.js
-
-ok 900 — objectFromPairs is a Function
-ok 901 — Creates an object from the given key-value pairs.
-
-#  PASS  test/curry.test.js
-
-ok 902 — curry is a Function
-ok 903 — curries a Math.pow
-ok 904 — curries a Math.min
-
-#  PASS  test/toDecimalMark.test.js
-
-ok 905 — toDecimalMark is a Function
-ok 906 — convert a float-point arithmetic to the Decimal mark form
-
-#  PASS  test/forOwn.test.js
-
-ok 907 — forOwn is a Function
-ok 908 — Iterates over an element's key-value pairs
-
-#  PASS  test/findLastIndex.test.js
-
-ok 909 — findLastIndex is a Function
-ok 910 — Finds last index for which the given function returns true
-
-#  PASS  test/pick.test.js
-
-ok 911 — pick is a Function
-ok 912 — Picks the key-value pairs corresponding to the given keys from an object.
-
-#  PASS  test/isNull.test.js
-
-ok 913 — isNull is a Function
-ok 914 — passed argument is a null
-ok 915 — passed argument is a null
-
-#  PASS  test/filterNonUnique.test.js
-
-ok 916 — filterNonUnique is a Function
-ok 917 — Filters out the non-unique values in an array
-
-#  PASS  test/dropWhile.test.js
-
-ok 918 — dropWhile is a Function
-ok 919 — Removes elements in an array until the passed function returns true.
-
-#  PASS  test/takeRightWhile.test.js
-
-ok 920 — takeRightWhile is a Function
-ok 921 — Removes elements until the function returns true
-
-#  PASS  test/atob.test.js
-
-ok 922 — atob is a Function
-ok 923 — atob("Zm9vYmFy") equals "foobar"
-ok 924 — atob("Z") returns ""
-
-#  PASS  test/removeNonASCII.test.js
-
-ok 925 — removeNonASCII is a Function
-ok 926 — Removes non-ASCII characters
-
-#  PASS  test/delay.test.js
-
-ok 927 — delay is a Function
-ok 928 — Works as expecting, passing arguments properly
-
-#  PASS  test/remove.test.js
-
-ok 929 — remove is a Function
-ok 930 — Removes elements from an array for which the given function returns false
-
-#  PASS  test/defaults.test.js
-
-ok 931 — defaults is a Function
-ok 932 — Assigns default values for undefined properties
-
-#  PASS  test/countOccurrences.test.js
-
-ok 933 — countOccurrences is a Function
-ok 934 — Counts the occurrences of a value in an array
-
-#  PASS  test/omit.test.js
-
-ok 935 — omit is a Function
-ok 936 — Omits the key-value pairs corresponding to the given keys from an object
-
-#  PASS  test/clampNumber.test.js
-
-ok 937 — clampNumber is a Function
-ok 938 — Clamps num within the inclusive range specified by the boundary values a and b
-
-#  PASS  test/intersection.test.js
-
-ok 939 — intersection is a Function
-ok 940 — Returns a list of elements that exist in both arrays
-
-#  PASS  test/over.test.js
-
-ok 941 — over is a Function
-ok 942 — Applies given functions over multiple arguments
-
-#  PASS  test/truncateString.test.js
-
-ok 943 — truncateString is a Function
-ok 944 — Truncates a "boomerang" up to a specified length.
-
-#  PASS  test/parseCookie.test.js
-
-ok 945 — parseCookie is a Function
-ok 946 — Parses the cookie
-
-#  PASS  test/pull.test.js
-
-ok 947 — pull is a Function
-ok 948 — Pulls the specified values
-
-#  PASS  test/similarity.test.js
-
-ok 949 — similarity is a Function
-ok 950 — Returns an array of elements that appear in both arrays.
-
-#  PASS  test/isEven.test.js
-
-ok 951 — isEven is a Function
-ok 952 — 4 is even number
-ok 953 — 5 is not an even number
-
-#  PASS  test/findLast.test.js
-
-ok 954 — findLast is a Function
-ok 955 — Finds last element for which the given function returns true
-
-#  PASS  test/times.test.js
-
-ok 956 — times is a Function
-ok 957 — Runs a function the specified amount of times
-
-#  PASS  test/takeWhile.test.js
-
-ok 958 — takeWhile is a Function
-ok 959 — Removes elements until the function returns true
-
-#  PASS  test/cloneRegExp.test.js
-
-ok 960 — cloneRegExp is a Function
-ok 961 — Clones regular expressions properly
-
-#  PASS  test/coalesce.test.js
-
-ok 962 — coalesce is a Function
-ok 963 — Returns the first non-null/undefined argument
-
-#  PASS  test/escapeRegExp.test.js
-
-ok 964 — escapeRegExp is a Function
-ok 965 — Escapes a string to use in a regular expression
-
-#  PASS  test/tail.test.js
-
-ok 966 — tail is a Function
-ok 967 — Returns tail
-ok 968 — Returns tail
-
-#  PASS  test/primes.test.js
-
-ok 969 — primes is a Function
-ok 970 — Generates primes up to a given number, using the Sieve of Eratosthenes.
-
-#  PASS  test/powerset.test.js
-
-ok 971 — powerset is a Function
-ok 972 — Returns the powerset of a given array of numbers.
-
-#  PASS  test/fibonacci.test.js
-
-ok 973 — fibonacci is a Function
-ok 974 — Generates an array, containing the Fibonacci sequence
-
-#  PASS  test/distance.test.js
-
-ok 975 — distance is a Function
-ok 976 — Calculates the distance between two points
-
-#  PASS  test/difference.test.js
-
-ok 977 — difference is a Function
-ok 978 — Returns the difference between two arrays
-
-#  PASS  test/negate.test.js
-
-ok 979 — negate is a Function
-ok 980 — Negates a predicate function
-
-#  PASS  test/deepFlatten.test.js
-
-ok 981 — deepFlatten is a Function
-ok 982 — Deep flattens an array
-
-#  PASS  test/RGBToHex.test.js
-
-ok 983 — RGBToHex is a Function
-ok 984 — Converts the values of RGB components to a color code.
-
-#  PASS  test/hammingDistance.test.js
-
-ok 985 — hammingDistance is a Function
-ok 986 — retuns hamming disance between 2 values
-
-#  PASS  test/everyNth.test.js
-
-ok 987 — everyNth is a Function
-ok 988 — Returns every nth element in an array
-
-#  PASS  test/initial.test.js
-
-ok 989 — initial is a Function
-ok 990 — Returns all the elements of an array except the last one
-
-#  PASS  test/unionBy.test.js
-
-ok 991 — unionBy is a Function
-ok 992 — Produces the appropriate results
-
-#  PASS  test/serializeCookie.test.js
-
-ok 993 — serializeCookie is a Function
-ok 994 — Serializes the cookie
-
-#  PASS  test/sleep.test.js
-
-ok 995 — sleep is a Function
-ok 996 — Works as expected
-
-#  PASS  test/unary.test.js
-
-ok 997 — unary is a Function
-ok 998 — Discards arguments after the first one
-
-#  PASS  test/mapKeys.test.js
-
-ok 999 — mapKeys is a Function
-ok 1000 — Maps keys
-
-#  PASS  test/radsToDegrees.test.js
-
-ok 1001 — radsToDegrees is a Function
-ok 1002 — Returns the appropriate value
-
-#  PASS  test/isSymbol.test.js
-
-ok 1003 — isSymbol is a Function
-ok 1004 — Checks if the given argument is a symbol
-
-#  PASS  test/digitize.test.js
-
-ok 1005 — digitize is a Function
-ok 1006 — Converts a number to an array of digits
-
-#  PASS  test/call.test.js
-
-ok 1007 — call is a Function
-ok 1008 — Calls function on given object
-
-#  PASS  test/reverseString.test.js
-
-ok 1009 — reverseString is a Function
-ok 1010 — Reverses a string.
-
-#  PASS  test/getType.test.js
-
-ok 1011 — getType is a Function
-ok 1012 — Returns the native type of a value
-
-#  PASS  test/isUndefined.test.js
-
-ok 1013 — isUndefined is a Function
-ok 1014 — Returns true for undefined
-
-#  PASS  test/isDivisible.test.js
-
-ok 1015 — isDivisible is a Function
-ok 1016 — The number 6 is divisible by 3
-
-#  PASS  test/sdbm.test.js
-
-ok 1017 — sdbm is a Function
-ok 1018 — Hashes the input string into a whole number.
-
-#  PASS  test/mphToKmph.test.js
-
-ok 1019 — mphToKmph is a Function
-ok 1020 — Returns kph from mph.
-
-#  PASS  test/debounce.test.js
-
-ok 1021 — debounce is a Function
-ok 1022 — Works as expected
-
-#  PASS  test/sum.test.js
-
-ok 1023 — sum is a Function
-ok 1024 — Returns the sum of two or more numbers/arrays.
-
-#  PASS  test/kmphToMph.test.js
-
-ok 1025 — kmphToMph is a Function
-ok 1026 — Returns mph from kph.
-
-#  PASS  test/btoa.test.js
-
-ok 1027 — btoa is a Function
-ok 1028 — btoa("foobar") equals "Zm9vYmFy"
-
-#  PASS  test/isPrime.test.js
-
-ok 1029 — isPrime is a Function
-ok 1030 — passed number is a prime
-
-#  PASS  test/initializeArrayWithRangeRight.test.js
-
-ok 1031 — initializeArrayWithRangeRight is a Function
-
-#  PASS  test/elementIsVisibleInViewport.test.js
-
-ok 1032 — elementIsVisibleInViewport is a Function
+ok 309 — binomialCoefficient is a Function
+ok 310 — Returns the appropriate value
+ok 311 — Returns the appropriate value
+ok 312 — Returns the appropriate value
+ok 313 — Returns the appropriate value
+ok 314 — Returns the appropriate value
+ok 315 — Returns NaN
+ok 316 — Returns NaN
+
+#  PASS  test/pluralize.test.js
+
+ok 317 — pluralize is a Function
+ok 318 — Produces the plural of the word
+ok 319 — Produces the singular of the word
+ok 320 — Produces the plural of the word
+ok 321 — Prodices the defined plural of the word
+ok 322 — Works with a dictionary
+
+#  PASS  test/randomIntArrayInRange.test.js
+
+ok 323 — randomIntArrayInRange is a Function
+ok 324 — The returned array contains only integers
+ok 325 — The returned array has the proper length
+ok 326 — The returned array's values lie between provided lowerLimit and upperLimit (both inclusive).
 
 #  PASS  test/getMeridiemSuffixOfInteger.test.js
 
-ok 1033 — getMeridiemSuffixOfInteger is a Function
+ok 327 — getMeridiemSuffixOfInteger is a Function
+ok 328 — Gets the correct meridiem suffix.
+ok 329 — Gets the correct meridiem suffix.
+ok 330 — Gets the correct meridiem suffix.
+ok 331 — Gets the correct meridiem suffix.
+ok 332 — Gets the correct meridiem suffix.
 
-#  PASS  test/fibonacciCountUntilNum.test.js
+#  PASS  test/getImages.test.js
 
-ok 1034 — fibonacciCountUntilNum is a Function
+ok 333 — getImages is a Function
+ok 334 — getImages returns an Array
+ok 335 — getImages removes duplicates from images Array
 
-#  PASS  test/recordAnimationFrames.test.js
+#  PASS  test/sampleSize.test.js
 
-ok 1035 — recordAnimationFrames is a Function
+ok 336 — sampleSize is a Function
+ok 337 — Returns a single element without n specified
+ok 338 — Returns a random sample of specified size from an array
+ok 339 — Returns all elements in an array if n >= length
+ok 340 — Returns an empty array if original array is empty
+ok 341 — Returns an empty array if n = 0
 
-#  PASS  test/getColonTimeFromDate.test.js
+#  PASS  test/orderBy.test.js
 
-ok 1036 — getColonTimeFromDate is a Function
+ok 342 — orderBy is a Function
+ok 343 — Returns a sorted array of objects ordered by properties and orders.
+ok 344 — Returns a sorted array of objects ordered by properties and orders.
 
-#  PASS  test/UUIDGeneratorBrowser.test.js
+#  PASS  test/deepFreeze.test.js
 
-ok 1037 — UUIDGeneratorBrowser is a Function
+ok 345 — deepFreeze is a Function
+ok 346 — modifying deeply freezed object prop throws an error in strict mode
+ok 347 — should not modify deeply freezed object inside another object
+ok 348 — should not add prop to deeply freezed empty object
 
-#  PASS  test/isBrowserTabFocused.test.js
+#  PASS  test/CSVToArray.test.js
 
-ok 1038 — isBrowserTabFocused is a Function
+ok 349 — CSVToArray is a Function
+ok 350 — CSVToArray works with default delimiter
+ok 351 — CSVToArray works with custom delimiter
+ok 352 — CSVToArray omits the first row
+ok 353 — CSVToArray omits the first row and works with a custom delimiter
+
+#  PASS  test/initializeArrayWithRangeRight.test.js
+
+ok 354 — initializeArrayWithRangeRight is a Function
+ok 355 — Initializes an array containing the numbers in the specified range (witout start value)
+ok 356 — Initializes an array containing the numbers in the specified range
+ok 357 — Initializes an array containing the numbers in the specified range (with step)
+
+#  PASS  test/isWritableStream.test.js
+
+ok 358 — isWritableStream is a Function
+ok 359 — isWritableStream returns false for read streams
+ok 360 — isWritableStream returns true for write streams
+ok 361 — isWritableStream returns true for duplex streams
+ok 362 — isWritableStream returns false for non-streams
+
+#  PASS  test/isReadableStream.test.js
+
+ok 363 — isReadableStream is a Function
+ok 364 — isReadableStream returns true for read streams
+ok 365 — isReadableStream returns false for write streams
+ok 366 — isReadableStream returns true for duplex streams
+ok 367 — isReadableStream returns false for non-streams
+
+#  PASS  test/inRange.test.js
+
+ok 368 — inRange is a Function
+ok 369 — The given number falls within the given range
+ok 370 — The given number falls within the given range (reverse)
+ok 371 — The given number falls within the given range
+ok 372 — The given number does not falls within the given range
+ok 373 — The given number does not falls within the given range
+
+#  PASS  test/any.test.js
+
+ok 374 — any is a Function
+ok 375 — Returns true for arrays with at least one truthy value
+ok 376 — Returns false for arrays with no truthy values
+ok 377 — Returns false for arrays with no truthy values
+ok 378 — Returns true with predicate function
+ok 379 — Returns false with a predicate function
+
+#  PASS  test/randomIntegerInRange.test.js
+
+ok 380 — randomIntegerInRange is a Function
+ok 381 — The returned value is an integer
+ok 382 — The returned value lies between provided lowerLimit and upperLimit (both inclusive).
+
+#  PASS  test/initializeArrayWithRange.test.js
+
+ok 383 — initializeArrayWithRange is a Function
+ok 384 — Initializes an array containing the numbers in the specified range (witout start value)
+ok 385 — Initializes an array containing the numbers in the specified range
+ok 386 — Initializes an array containing the numbers in the specified range (with step)
+
+#  PASS  test/fahrenheitToCelsius.test.js
+
+ok 387 — fahrenheitToCelsius is a Function
+ok 388 — 32 Fahrenheit is 0 Celsius
+ok 389 — 212 Fahrenheit is 100 Celsius
+ok 390 — 150 Fahrenheit is 65.55555555555556 Celsius
+ok 391 — 1000 Fahrenheit is 537.7777777777778
+ok 392 — Not a number value is NaN
+
+#  PASS  test/formatDuration.test.js
+
+ok 393 — formatDuration is a Function
+ok 394 — Returns the human readable format of the given number of milliseconds
+ok 395 — Returns the human readable format of the given number of milliseconds (negative)
+ok 396 — Returns the human readable format of the given number of milliseconds
+
+#  PASS  test/randomNumberInRange.test.js
+
+ok 397 — randomNumberInRange is a Function
+ok 398 — The returned value is a number
+ok 399 — The returned value lies between provided lowerLimit and upperLimit (both inclusive).
+
+#  PASS  test/isDuplexStream.test.js
+
+ok 400 — isDuplexStream is a Function
+ok 401 — isDuplexStream returns false for read streams
+ok 402 — isDuplexStream returns false for write streams
+ok 403 — isDuplexStream returns true for duplex streams
+ok 404 — isDuplexStream returns false for non-streams
+
+#  PASS  test/join.test.js
+
+ok 405 — join is a Function
+ok 406 — Joins all elements of an array into a string and returns this string
+ok 407 — Joins all elements of an array into a string and returns this string
+ok 408 — Joins all elements of an array into a string and returns this string
+
+#  PASS  test/toCurrency.test.js
+
+ok 409 — toCurrency is a Function
+ok 410 — currency: Euro | currencyLangFormat: Local
+ok 411 —  currency: US Dollar | currencyLangFormat: English (United States)
+ok 412 — currency: Japanese Yen | currencyLangFormat: Local
+
+#  PASS  test/mapObject.test.js
+
+ok 413 — mapObject is a Function
+ok 414 — mapObject([1, 2, 3], a => a * a) returns { 1: 1, 2: 4, 3: 9 }
+ok 415 — mapObject([1, 2, 3, 4], (a, b) => b - a) returns { 1: -1, 2: -1, 3: -1, 4: -1 }
+ok 416 — mapObject([1, 2, 3, 4], (a, b) => a - b) returns { 1: 1, 2: 1, 3: 1, 4: 1 }
+
+#  PASS  test/factorial.test.js
+
+ok 417 — factorial is a Function
+ok 418 — Calculates the factorial of 720
+ok 419 — Calculates the factorial of 0
+ok 420 — Calculates the factorial of 1
+ok 421 — Calculates the factorial of 4
+ok 422 — Calculates the factorial of 10
+ok 423 — Throws TypeError if n < 0
+
+#  PASS  test/geometricProgression.test.js
+
+ok 424 — geometricProgression is a Function
+ok 425 — Initializes an array containing the numbers in the specified range
+ok 426 — Initializes an array containing the numbers in the specified range
+ok 427 — Initializes an array containing the numbers in the specified range
+
+#  PASS  test/mapString.test.js
+
+ok 428 — mapString is a Function
+ok 429 — mapString returns a capitalized string
+ok 430 — mapString can deal with indexes
+ok 431 — mapString can deal with the full string
+
+#  PASS  test/dig.test.js
+
+ok 432 — dig is a Function
+ok 433 — Dig target success
+ok 434 — Dig target with falsey value
+ok 435 — Dig target with array
+ok 436 — Unknown target return undefined
 
 #  PASS  test/levenshteinDistance.test.js
 
-ok 1039 — levenshteinDistance is a Function
-
-#  PASS  test/fibonacciUntilNum.test.js
-
-ok 1040 — fibonacciUntilNum is a Function
-
-#  PASS  test/isArmstrongNumber.test.js
-
-ok 1041 — isArmstrongNumber is a Function
-
-#  PASS  test/getScrollPosition.test.js
-
-ok 1042 — getScrollPosition is a Function
-
-#  PASS  test/onUserInputChange.test.js
-
-ok 1043 — onUserInputChange is a Function
-
-#  PASS  test/initializeNDArray.test.js
-
-ok 1044 — initializeNDArray is a Function
-
-#  PASS  test/detectDeviceType.test.js
-
-ok 1045 — detectDeviceType is a Function
-
-#  PASS  test/observeMutations.test.js
-
-ok 1046 — observeMutations is a Function
-
-#  PASS  test/nodeListToArray.test.js
-
-ok 1047 — nodeListToArray is a Function
-
-#  PASS  test/speechSynthesis.test.js
-
-ok 1048 — speechSynthesis is a Function
-
-#  PASS  test/copyToClipboard.test.js
-
-ok 1049 — copyToClipboard is a Function
-
-#  PASS  test/arrayToHtmlList.test.js
-
-ok 1050 — arrayToHtmlList is a Function
-
-#  PASS  test/elementContains.test.js
-
-ok 1051 — elementContains is a Function
-
-#  PASS  test/createEventHub.test.js
-
-ok 1052 — createEventHub is a Function
-
-#  PASS  test/mostPerformant.test.js
-
-ok 1053 — mostPerformant is a Function
-
-#  PASS  test/readFileLines.test.js
-
-ok 1054 — readFileLines is a Function
-
-#  PASS  test/createElement.test.js
-
-ok 1055 — createElement is a Function
-
-#  PASS  test/httpsRedirect.test.js
-
-ok 1056 — httpsRedirect is a Function
-
-#  PASS  test/bottomVisible.test.js
-
-ok 1057 — bottomVisible is a Function
-
-#  PASS  test/smoothScroll.test.js
-
-ok 1058 — smoothScroll is a Function
-
-#  PASS  test/triggerEvent.test.js
-
-ok 1059 — triggerEvent is a Function
-
-#  PASS  test/insertBefore.test.js
-
-ok 1060 — insertBefore is a Function
-
-#  PASS  test/removeVowels.test.js
-
-ok 1061 — removeVowels is a Function
-
-#  PASS  test/howManyTimes.test.js
-
-ok 1062 — howManyTimes is a Function
-
-#  PASS  test/hashBrowser.test.js
-
-ok 1063 — hashBrowser is a Function
-
-#  PASS  test/insertAfter.test.js
-
-ok 1064 — insertAfter is a Function
-
-#  PASS  test/countVowels.test.js
-
-ok 1065 — countVowels is a Function
-
-#  PASS  test/toggleClass.test.js
-
-ok 1066 — toggleClass is a Function
-
-#  PASS  test/scrollToTop.test.js
-
-ok 1067 — scrollToTop is a Function
-
-#  PASS  test/httpDelete.test.js
-
-ok 1068 — httpDelete is a Function
-
-#  PASS  test/JSONToDate.test.js
-
-ok 1069 — JSONToDate is a Function
-
-#  PASS  test/JSONToFile.test.js
-
-ok 1070 — JSONToFile is a Function
-
-#  PASS  test/currentURL.test.js
-
-ok 1071 — currentURL is a Function
-
-#  PASS  test/heronArea.test.js
-
-ok 1072 — heronArea is a Function
-
-#  PASS  test/dayOfYear.test.js
-
-ok 1073 — dayOfYear is a Function
-
-#  PASS  test/timeTaken.test.js
-
-ok 1074 — timeTaken is a Function
-
-#  PASS  test/squareSum.test.js
-
-ok 1075 — squareSum is a Function
-
-#  PASS  test/isSimilar.test.js
-
-ok 1076 — isSimilar is a Function
-
-#  PASS  test/isBrowser.test.js
-
-ok 1077 — isBrowser is a Function
-
-#  PASS  test/hasFlags.test.js
-
-ok 1078 — hasFlags is a Function
-
-#  PASS  test/setStyle.test.js
-
-ok 1079 — setStyle is a Function
-
-#  PASS  test/solveRPN.test.js
-
-ok 1080 — solveRPN is a Function
-
-#  PASS  test/getStyle.test.js
-
-ok 1081 — getStyle is a Function
-
-#  PASS  test/redirect.test.js
-
-ok 1082 — redirect is a Function
-
-#  PASS  test/colorize.test.js
-
-ok 1083 — colorize is a Function
-
-#  PASS  test/httpPost.test.js
-
-ok 1084 — httpPost is a Function
-
-#  PASS  test/runAsync.test.js
-
-ok 1085 — runAsync is a Function
-
-#  PASS  test/hasClass.test.js
-
-ok 1086 — hasClass is a Function
-
-#  PASS  test/throttle.test.js
-
-ok 1087 — throttle is a Function
-
-#  PASS  test/zipWith.test.js
-
-ok 1088 — zipWith is a Function
-
-#  PASS  test/httpPut.test.js
-
-ok 1089 — httpPut is a Function
-
-#  PASS  test/pipeLog.test.js
-
-ok 1090 — pipeLog is a Function
+ok 437 — levenshteinDistance is a Function
+ok 438 — levenshteinDistance returns the correct results
+ok 439 — levenshteinDistance returns the correct result for 0-length string as first argument
+ok 440 — levenshteinDistance returns the correct result for 0-length string as second argument
+
+#  PASS  test/celsiusToFahrenheit.test.js
+
+ok 441 — celsiusToFahrenheit is a Function
+ok 442 — 0 Celsius is 32 Fahrenheit
+ok 443 — 100 Celsius is 212 Fahrenheit
+ok 444 — -50 Celsius is -58 Fahrenheit
+ok 445 — 1000 Celsius is 1832 Fahrenheit
+ok 446 — Not a number value is NaN
+
+#  PASS  test/reduceWhich.test.js
+
+ok 447 — reduceWhich is a Function
+ok 448 — Returns the minimum of an array
+ok 449 — Returns the maximum of an array
+ok 450 — Returns the object with the minimum specified value in an array
+
+#  PASS  test/isStream.test.js
+
+ok 451 — isStream is a Function
+ok 452 — isStream returns true for read streams
+ok 453 — isStream returns true for write streams
+ok 454 — isStream returns true for duplex streams
+ok 455 — isStream returns false for non-streams
 
 #  PASS  test/factors.test.js
 
-ok 1091 — factors is a Function
+ok 456 — factors is a Function
+ok 457 — factors returns the correct array
+ok 458 — factors returns the correct array of primes
+ok 459 — factors returns the correct array for negatives
+ok 460 — factors returns the correct array of primes for negatives
 
-#  PASS  test/httpGet.test.js
+#  PASS  test/invertKeyValues.test.js
 
-ok 1092 — httpGet is a Function
+ok 461 — invertKeyValues is a Function
+ok 462 — invertKeyValues({ a: 1, b: 2, c: 1 }) returns { 1: [ 'a', 'c' ], 2: [ 'b' ] }
+ok 463 — invertKeyValues({ a: 1, b: 2, c: 1 }, value => 'group' + value) returns { group1: [ 'a', 'c' ], group2: [ 'b' ] }
 
-#  PASS  test/counter.test.js
+#  PASS  test/fromCamelCase.test.js
 
-ok 1093 — counter is a Function
+ok 464 — fromCamelCase is a Function
+ok 465 — Converts a string from camelcase
+ok 466 — Converts a string from camelcase
+ok 467 — Converts a string from camelcase
 
-#  PASS  test/toHash.test.js
+#  PASS  test/shank.test.js
 
-ok 1094 — toHash is a Function
+ok 468 — shank is a Function
+ok 469 — Returns an array with the added elements.
+ok 470 — Returns an array with the removed elements.
+ok 471 — Does not mutate the original array
 
-#  PASS  test/prefix.test.js
+#  PASS  test/approximatelyEqual.test.js
 
-ok 1095 — prefix is a Function
+ok 472 — approximatelyEqual is a Function
+ok 473 — Works for PI / 2
+ok 474 — Works for 0.1 + 0.2 === 0.3
+ok 475 — Works for exactly equal values
+ok 476 — Works for a custom epsilon
 
-#  PASS  test/defer.test.js
+#  PASS  test/none.test.js
 
-ok 1096 — defer is a Function
-
-#  PASS  test/sumBy.test.js
-
-ok 1097 — sumBy is a Function
-
-#  PASS  test/once.test.js
-
-ok 1098 — once is a Function
-
-#  PASS  test/show.test.js
-
-ok 1099 — show is a Function
-
-#  PASS  test/hide.test.js
-
-ok 1100 — hide is a Function
+ok 477 — none is a Function
+ok 478 — Returns true for arrays with no truthy values
+ok 479 — Returns false for arrays with at least one truthy value
+ok 480 — Returns true with a predicate function
+ok 481 — Returns false with predicate function
 
 #  PASS  test/nest.test.js
 
-ok 1101 — nest is a Function
+ok 482 — nest is a Function
+ok 483 — Nests items
+
+#  PASS  test/castArray.test.js
+
+ok 484 — castArray is a Function
+ok 485 — Works for single values
+ok 486 — Works for arrays with one value
+ok 487 — Works for arrays with multiple value
+ok 488 — Works for strings
+ok 489 — Works for objects
+
+#  PASS  test/nthElement.test.js
+
+ok 490 — nthElement is a Function
+ok 491 — Returns the nth element of an array.
+ok 492 — Returns the nth element of an array.
+ok 493 — Returns the nth element of an array.
+ok 494 — Returns the nth element of an array.
+
+#  PASS  test/binarySearch.test.js
+
+ok 495 — binarySearch is a Function
+ok 496 — Finds item in array
+ok 497 — Returns -1 when not found
+ok 498 — Works with empty arrays
+ok 499 — Works for one element arrays
+
+#  PASS  test/mask.test.js
+
+ok 500 — mask is a Function
+ok 501 — Replaces all but the last num of characters with the specified mask character
+ok 502 — Replaces all but the last num of characters with the specified mask character
+ok 503 — Replaces all but the last num of characters with the specified mask character
+
+#  PASS  test/randomHexColorCode.test.js
+
+ok 504 — randomHexColorCode is a Function
+ok 505 — randomHexColorCode has to proper length
+ok 506 — The color code starts with "#"
+ok 507 — The color code contains only valid hex-digits
+
+#  PASS  test/howManyTimes.test.js
+
+ok 508 — howManyTimes is a Function
+ok 509 — howManyTimes returns the correct result
+ok 510 — howManyTimes returns the correct result
+ok 511 — howManyTimes returns the correct result
+ok 512 — howManyTimes returns the correct result
+
+#  PASS  test/JSONtoCSV.test.js
+
+ok 513 — JSONtoCSV is a Function
+ok 514 — JSONtoCSV works with default delimiter
+ok 515 — JSONtoCSV works with custom delimiter
+
+#  PASS  test/converge.test.js
+
+ok 516 — converge is a Function
+ok 517 — Produces the average of the array
+ok 518 — Produces the strange concatenation
+
+#  PASS  test/capitalize.test.js
+
+ok 519 — capitalize is a Function
+ok 520 — Capitalizes the first letter of a string
+ok 521 — Capitalizes the first letter of a string
+ok 522 — Works with characters
+ok 523 — "Works with single character words
+
+#  PASS  test/toOrdinalSuffix.test.js
+
+ok 524 — toOrdinalSuffix is a Function
+ok 525 — Adds an ordinal suffix to a number
+ok 526 — Adds an ordinal suffix to a number
+ok 527 — Adds an ordinal suffix to a number
+ok 528 — Adds an ordinal suffix to a number
+
+#  PASS  test/deepClone.test.js
+
+ok 529 — deepClone is a Function
+ok 530 — Shallow cloning works
+ok 531 — Deep cloning works
+ok 532 — Array shallow cloning works
+ok 533 — Array deep cloning works
+
+#  PASS  test/isAnagram.test.js
+
+ok 534 — isAnagram is a Function
+ok 535 — Checks valid anagram
+ok 536 — Works with spaces
+ok 537 — Ignores case
+ok 538 — Ignores special characters
+
+#  PASS  test/tomorrow.test.js
+
+ok 539 — tomorrow is a Function
+ok 540 — Returns the correct year
+ok 541 — Returns the correct month
+ok 542 — Returns the correct date
+
+#  PASS  test/shuffle.test.js
+
+ok 543 — shuffle is a Function
+ok 544 — Shuffles the array
+ok 545 — New array contains all original elements
+ok 546 — Works for empty arrays
+ok 547 — Works for single-element arrays
+
+#  PASS  test/prettyBytes.test.js
+
+ok 548 — prettyBytes is a Function
+ok 549 — Converts a number in bytes to a human-readable string.
+ok 550 — Converts a number in bytes to a human-readable string.
+ok 551 — Converts a number in bytes to a human-readable string.
+
+#  PASS  test/isString.test.js
+
+ok 552 — isString is a Function
+ok 553 — foo is a string
+ok 554 — "10" is a string
+ok 555 — Empty string is a string
+ok 556 — 10 is not a string
+ok 557 — true is not string
+
+#  PASS  test/dropRight.test.js
+
+ok 558 — dropRight is a Function
+ok 559 — Returns a new array with n elements removed from the right
+ok 560 — Returns a new array with n elements removed from the right
+ok 561 — Returns a new array with n elements removed from the right
+
+#  PASS  test/hexToRGB.test.js
+
+ok 562 — hexToRGB is a Function
+ok 563 — Converts a color code to a rgb() or rgba() string
+ok 564 — Converts a color code to a rgb() or rgba() string
+ok 565 — Converts a color code to a rgb() or rgba() string
+
+#  PASS  test/partition.test.js
+
+ok 566 — partition is a Function
+ok 567 — Groups the elements into two arrays, depending on the provided function's truthiness for each element.
+
+#  PASS  test/stringPermutations.test.js
+
+ok 568 — stringPermutations is a Function
+ok 569 — Generates all stringPermutations of a string
+ok 570 — Works for single-letter strings
+ok 571 — Works for empty strings
+
+#  PASS  test/sumPower.test.js
+
+ok 572 — sumPower is a Function
+ok 573 — Returns the sum of the powers of all the numbers from start to end
+ok 574 — Returns the sum of the powers of all the numbers from start to end
+ok 575 — Returns the sum of the powers of all the numbers from start to end
+
+#  PASS  test/isObjectLike.test.js
+
+ok 576 — isObjectLike is a Function
+ok 577 — Returns true for an object
+ok 578 — Returns true for an array
+ok 579 — Returns false for a function
+ok 580 — Returns false for null
+
+#  PASS  test/untildify.test.js
+
+ok 581 — untildify is a Function
+ok 582 — Contains no tildes
+ok 583 — Does not alter the rest of the path
+ok 584 — Does not alter paths without tildes
+
+#  PASS  test/isObject.test.js
+
+ok 585 — isObject is a Function
+ok 586 — isObject([1, 2, 3, 4]) is a object
+ok 587 — isObject([]) is a object
+ok 588 — isObject({ a:1 }) is a object
+ok 589 — isObject(true) is not a object
+
+#  PASS  test/standardDeviation.test.js
+
+ok 590 — standardDeviation is a Function
+ok 591 — Returns the standard deviation of an array of numbers
+ok 592 — Returns the standard deviation of an array of numbers
+
+#  PASS  test/capitalizeEveryWord.test.js
+
+ok 593 — capitalizeEveryWord is a Function
+ok 594 — Capitalizes the first letter of every word in a string
+ok 595 — Works with characters
+ok 596 — Works with one word string
+
+#  PASS  test/unzip.test.js
+
+ok 597 — unzip is a Function
+ok 598 — unzip([['a', 1, true], ['b', 2, false]]) equals [['a','b'], [1, 2], [true, false]]
+ok 599 — unzip([['a', 1, true], ['b', 2]]) equals [['a','b'], [1, 2], [true]]
+
+#  PASS  test/take.test.js
+
+ok 600 — take is a Function
+ok 601 — Returns an array with n elements removed from the beginning.
+ok 602 — Returns an array with n elements removed from the beginning.
+ok 603 — Returns an array with n elements removed from the beginning.
+
+#  PASS  test/URLJoin.test.js
+
+ok 604 — URLJoin is a Function
+ok 605 — Returns proper URL
+ok 606 — Returns proper URL
+
+#  PASS  test/CSVToJSON.test.js
+
+ok 607 — CSVToJSON is a Function
+ok 608 — CSVToJSON works with default delimiter
+ok 609 — CSVToJSON works with custom delimiter
+
+#  PASS  test/byteSize.test.js
+
+ok 610 — byteSize is a Function
+ok 611 — Works for a single letter
+ok 612 — Works for a common string
+ok 613 — Works for emoji
+
+#  PASS  test/sortedIndex.test.js
+
+ok 614 — sortedIndex is a Function
+ok 615 — Returns the lowest index at which value should be inserted into array in order to maintain its sort order.
+ok 616 — Returns the lowest index at which value should be inserted into array in order to maintain its sort order.
+
+#  PASS  test/reducedFilter.test.js
+
+ok 617 — reducedFilter is a Function
+ok 618 — Filter an array of objects based on a condition while also filtering out unspecified keys.
+
+#  PASS  test/matches.test.js
+
+ok 619 — matches is a Function
+ok 620 — Matches returns true for two similar objects
+ok 621 — Matches returns false for two non-similar objects
+
+#  PASS  test/uncurry.test.js
+
+ok 622 — uncurry is a Function
+ok 623 — Works without a provided value for n
+ok 624 — Works with n = 2
+ok 625 — Works with n = 3
+
+#  PASS  test/pad.test.js
+
+ok 626 — pad is a Function
+ok 627 — cat is padded on both sides
+ok 628 — length of string is 8
+ok 629 — pads 42 with "0"
+ok 630 — does not truncates if string exceeds length
+
+#  PASS  test/initializeArrayWithValues.test.js
+
+ok 631 — initializeArrayWithValues is a Function
+ok 632 — Initializes and fills an array with the specified values
+ok 633 — Initializes and fills an array with the specified values (no fill)
+
+#  PASS  test/isAbsoluteURL.test.js
+
+ok 634 — isAbsoluteURL is a Function
+ok 635 — Given string is an absolute URL
+ok 636 — Given string is an absolute URL
+ok 637 — Given string is not an absolute URL
+
+#  PASS  test/collectInto.test.js
+
+ok 638 — collectInto is a Function
+ok 639 — Works with multiple promises
+
+#  PASS  test/isValidJSON.test.js
+
+ok 640 — isValidJSON is a Function
+ok 641 — {"name":"Adam","age":20} is a valid JSON
+ok 642 — {"name":"Adam",age:"20"} is not a valid JSON
+ok 643 — null is a valid JSON
+
+#  PASS  test/groupBy.test.js
+
+ok 644 — groupBy is a Function
+ok 645 — Groups the elements of an array based on the given function
+ok 646 — Groups the elements of an array based on the given function
+
+#  PASS  test/uniqueSymmetricDifference.test.js
+
+ok 647 — uniqueSymmetricDifference is a Function
+ok 648 — Returns the symmetric difference between two arrays.
+ok 649 — Does not return duplicates from one array
+
+#  PASS  test/symmetricDifferenceWith.test.js
+
+ok 650 — symmetricDifferenceWith is a Function
+ok 651 — Returns the symmetric difference between two arrays, using a provided function as a comparator
+
+#  PASS  test/initialize2DArray.test.js
+
+ok 652 — initialize2DArray is a Function
+ok 653 — Initializes a 2D array of given width and height and value
+ok 654 — Initializes a 2D array of given width and height and value (no fill)
+
+#  PASS  test/functionName.test.js
+
+ok 655 — functionName is a Function
+ok 656 — Works for native functions
+ok 657 — Works for functions
+ok 658 — Works for arrow functions
+
+#  PASS  test/lowercaseKeys.test.js
+
+ok 659 — lowercaseKeys is a Function
+ok 660 — Lowercases object keys
+ok 661 — Does not mutate original object
+
+#  PASS  test/collatz.test.js
+
+ok 662 — collatz is a Function
+ok 663 — When n is even, divide by 2
+ok 664 — When n is odd, times by 3 and add 1
+ok 665 — Eventually reaches 1
+
+#  PASS  test/reject.test.js
+
+ok 666 — reject is a Function
+ok 667 — Works with numbers
+ok 668 — Works with strings
+
+#  PASS  test/matchesWith.test.js
+
+ok 669 — matchesWith is a Function
+ok 670 — Returns true for two objects with similar values, based on the provided function
+
+#  PASS  test/zipWith.test.js
+
+ok 671 — zipWith is a Function
+ok 672 — zipWith returns the correct results
+ok 673 — zipWith returns the correct results if no function is passed
+
+#  PASS  test/luhnCheck.test.js
+
+ok 674 — luhnCheck is a Function
+ok 675 — validates identification number
+ok 676 — validates identification number
+ok 677 — validates identification number
+
+#  PASS  test/nthArg.test.js
+
+ok 678 — nthArg is a Function
+ok 679 — Returns the nth argument
+ok 680 — Returns undefined if arguments too few
+ok 681 — Works for negative values
+
+#  PASS  test/sample.test.js
+
+ok 682 — sample is a Function
+ok 683 — Returns a random element from the array
+ok 684 — Works for single-element arrays
+ok 685 — Returns undefined for empty array
+
+#  PASS  test/UUIDGeneratorNode.test.js
+
+ok 686 — UUIDGeneratorNode is a Function
+ok 687 — Contains dashes in the proper places
+ok 688 — Only contains hexadecimal digits
+
+#  PASS  test/drop.test.js
+
+ok 689 — drop is a Function
+ok 690 — Works without the last argument
+ok 691 — Removes appropriate element count as specified
+ok 692 — Empties array given a count greater than length
+
+#  PASS  test/isBeforeDate.test.js
+
+ok 693 — isBeforeDate is a Function
+ok 694 — isBeforeDate produces the correct result
+ok 695 — isBeforeDate produces the correct result
+
+#  PASS  test/median.test.js
+
+ok 696 — median is a Function
+ok 697 — Returns the median of an array of numbers
+ok 698 — Returns the median of an array of numbers
+ok 699 — Returns the median of an array of numbers
+
+#  PASS  test/symmetricDifference.test.js
+
+ok 700 — symmetricDifference is a Function
+ok 701 — Returns the symmetric difference between two arrays.
+ok 702 — Returns duplicates from one array
+
+#  PASS  test/flattenObject.test.js
+
+ok 703 — flattenObject is a Function
+ok 704 — Flattens an object with the paths for keys
+ok 705 — Works with arrays
+
+#  PASS  test/intersectionWith.test.js
+
+ok 706 — intersectionWith is a Function
+ok 707 — Returns a list of elements that exist in both arrays, using a provided comparator function
+
+#  PASS  test/elo.test.js
+
+ok 708 — elo is a Function
+ok 709 — Standard 1v1s
+ok 710 — Standard 1v1s
+ok 711 — 4 player FFA, all same rank
+
+#  PASS  test/functions.test.js
+
+ok 712 — functions is a Function
+ok 713 — Returns own methods
+ok 714 — Returns own and inherited methods
+
+#  PASS  test/isAfterDate.test.js
+
+ok 715 — isAfterDate is a Function
+ok 716 — isAfterDate produces the correct result
+ok 717 — isBeforeDate produces the correct result
+
+#  PASS  test/differenceBy.test.js
+
+ok 718 — differenceBy is a Function
+ok 719 — Works using a native function and numbers
+ok 720 — Works with arrow function and objects
+
+#  PASS  test/pipeAsyncFunctions.test.js
+
+ok 721 — pipeAsyncFunctions is a Function
+ok 722 — pipeAsyncFunctions result should be 15
+
+#  PASS  test/memoize.test.js
+
+ok 723 — memoize is a Function
+ok 724 — Function works properly
+ok 725 — Function works properly
+ok 726 — Cache stores values
+
+#  PASS  test/renameKeys.test.js
+
+ok 727 — renameKeys is a Function
+ok 728 — renameKeys is a Function
+
+#  PASS  test/isSameDate.test.js
+
+ok 729 — isSameDate is a Function
+ok 730 — isSameDate produces the correct result
+ok 731 — isSameDate produces the correct result
+
+#  PASS  test/averageBy.test.js
+
+ok 732 — averageBy is a Function
+ok 733 — Produces the right result with a function
+ok 734 — Produces the right result with a property name
+
+#  PASS  test/isLowerCase.test.js
+
+ok 735 — isLowerCase is a Function
+ok 736 — passed string is a lowercase
+ok 737 — passed string is a lowercase
+ok 738 — passed value is not a lowercase
+
+#  PASS  test/initializeNDArray.test.js
+
+ok 739 — initializeNDArray is a Function
+ok 740 — Initializes a n-D array with given data
+ok 741 — Initializes a n-D array with given data
+
+#  PASS  test/bindKey.test.js
+
+ok 742 — bindKey is a Function
+ok 743 — Binds function to an object context
+
+#  PASS  test/getType.test.js
+
+ok 744 — getType is a Function
+ok 745 — Returns the native type of a value
+ok 746 — Returns null for null
+ok 747 — Returns undefined for undefined
+
+#  PASS  test/findLastKey.test.js
+
+ok 748 — findLastKey is a Function
+ok 749 — eturns the appropriate key
+
+#  PASS  test/arrayToCSV.test.js
+
+ok 750 — arrayToCSV is a Function
+ok 751 — arrayToCSV works with default delimiter
+ok 752 — arrayToCSV works with custom delimiter
+
+#  PASS  test/isPromiseLike.test.js
+
+ok 753 — isPromiseLike is a Function
+ok 754 — Returns true for a promise-like object
+ok 755 — Returns false for an empty object
+
+#  PASS  test/promisify.test.js
+
+ok 756 — promisify is a Function
+ok 757 — Returns a promise
+ok 758 — Runs the function provided
+
+#  PASS  test/isArrayLike.test.js
+
+ok 759 — isArrayLike is a Function
+ok 760 — Returns true for a string
+ok 761 — Returns true for an array
+ok 762 — Returns false for null
+
+#  PASS  test/takeWhile.test.js
+
+ok 763 — takeWhile is a Function
+ok 764 — Removes elements until the function returns true
+ok 765 — Removes elements until the function returns true
+
+#  PASS  test/maxBy.test.js
+
+ok 766 — maxBy is a Function
+ok 767 — Produces the right result with a function
+ok 768 — Produces the right result with a property name
+
+#  PASS  test/minBy.test.js
+
+ok 769 — minBy is a Function
+ok 770 — Produces the right result with a function
+ok 771 — Produces the right result with a property name
+
+#  PASS  test/symmetricDifferenceBy.test.js
+
+ok 772 — symmetricDifferenceBy is a Function
+ok 773 — Returns the symmetric difference between two arrays, after applying the provided function to each array element of both
+
+#  PASS  test/isUpperCase.test.js
+
+ok 774 — isUpperCase is a Function
+ok 775 — ABC is all upper case
+ok 776 — abc is not all upper case
+ok 777 — A3@$ is all uppercase
+
+#  PASS  test/unzipWith.test.js
+
+ok 778 — unzipWith is a Function
+ok 779 — unzipWith([[1, 10, 100], [2, 20, 200]], (...args) => args.reduce((acc, v) => acc + v, 0)) equals [3, 30, 300]
+
+#  PASS  test/truthCheckCollection.test.js
+
+ok 780 — truthCheckCollection is a Function
+ok 781 — second argument is truthy on all elements of a collection
+
+#  PASS  test/pullAtValue.test.js
+
+ok 782 — pullAtValue is a Function
+ok 783 — Pulls the specified values
+ok 784 — Pulls the specified values
+
+#  PASS  test/findKey.test.js
+
+ok 785 — findKey is a Function
+ok 786 — Returns the appropriate key
+
+#  PASS  test/merge.test.js
+
+ok 787 — merge is a Function
+ok 788 — Merges two objects
+
+#  PASS  test/bind.test.js
+
+ok 789 — bind is a Function
+ok 790 — Binds to an object context
+
+#  PASS  test/pullAtIndex.test.js
+
+ok 791 — pullAtIndex is a Function
+ok 792 — Pulls the given values
+ok 793 — Pulls the given values
+
+#  PASS  test/indentString.test.js
+
+ok 794 — indentString is a Function
+ok 795 — indentString is a Function
+ok 796 — indentString is a Function
+
+#  PASS  test/takeRight.test.js
+
+ok 797 — takeRight is a Function
+ok 798 — Returns an array with n elements removed from the end
+ok 799 — Returns an array with n elements removed from the end
+
+#  PASS  test/transform.test.js
+
+ok 800 — transform is a Function
+ok 801 — Transforms an object
+
+#  PASS  test/gcd.test.js
+
+ok 802 — gcd is a Function
+ok 803 — Calculates the greatest common divisor between two or more numbers/arrays
+ok 804 — Calculates the greatest common divisor between two or more numbers/arrays
+
+#  PASS  test/isNil.test.js
+
+ok 805 — isNil is a Function
+ok 806 — Returns true for null
+ok 807 — Returns true for undefined
+ok 808 — Returns false for an empty string
+
+#  PASS  test/coalesceFactory.test.js
+
+ok 809 — coalesceFactory is a Function
+ok 810 — Returns a customized coalesce function
+
+#  PASS  test/indexOfAll.test.js
+
+ok 811 — indexOfAll is a Function
+ok 812 — Returns all indices of val in an array
+ok 813 — When val is not found, return an empty array
+
+#  PASS  test/extendHex.test.js
+
+ok 814 — extendHex is a Function
+ok 815 — Extends a 3-digit color code to a 6-digit color code
+ok 816 — Extends a 3-digit color code to a 6-digit color code
+
+#  PASS  test/isPlainObject.test.js
+
+ok 817 — isPlainObject is a Function
+ok 818 — Returns true for a plain object
+ok 819 — Returns false for a Map (example of non-plain object)
+
+#  PASS  test/maxDate.test.js
+
+ok 820 — maxDate is a Function
+ok 821 — maxDate produces the maximum date
+
+#  PASS  test/isTravisCI.test.js
+
+ok 822 — isTravisCI is a Function
+ok 823 — Running on Travis, correctly evaluates
+
+#  PASS  test/intersectionBy.test.js
+
+ok 824 — intersectionBy is a Function
+ok 825 — Returns a list of elements that exist in both arrays, after applying the provided function to each array element of both
+
+#  PASS  test/minDate.test.js
+
+ok 826 — minDate is a Function
+ok 827 — minDate produces the maximum date
+
+#  PASS  test/getURLParameters.test.js
+
+ok 828 — getURLParameters is a Function
+ok 829 — Returns an object containing the parameters of the current URL
+
+#  PASS  test/pipeFunctions.test.js
+
+ok 830 — pipeFunctions is a Function
+ok 831 — Performs left-to-right function composition
+
+#  PASS  test/reduceSuccessive.test.js
+
+ok 832 — reduceSuccessive is a Function
+ok 833 — Returns the array of successively reduced values
+
+#  PASS  test/chainAsync.test.js
+
+ok 834 — chainAsync is a Function
+ok 835 — Calls all functions in an array
+
+#  PASS  test/sumBy.test.js
+
+ok 836 — sumBy is a Function
+ok 837 — Works with a callback.
+ok 838 — Works with a property name.
+
+#  PASS  test/countBy.test.js
+
+ok 839 — countBy is a Function
+ok 840 — Works for functions
+ok 841 — Works for property names
+
+#  PASS  test/cleanObj.test.js
+
+ok 842 — cleanObj is a Function
+ok 843 — Removes any properties except the ones specified from a JSON object
+
+#  PASS  test/runPromisesInSeries.test.js
+
+ok 844 — runPromisesInSeries is a Function
+ok 845 — Runs promises in series
+
+#  PASS  test/overArgs.test.js
+
+ok 846 — overArgs is a Function
+ok 847 — Invokes the provided function with its arguments transformed
+
+#  PASS  test/hashNode.test.js
+
+ok 848 — hashNode is a Function
+ok 849 — Produces the appropriate hash
+
+#  PASS  test/spreadOver.test.js
+
+ok 850 — spreadOver is a Function
+ok 851 — Takes a variadic function and returns a closure that accepts an array of arguments to map to the inputs of the function.
+
+#  PASS  test/decapitalize.test.js
+
+ok 852 — decapitalize is a Function
+ok 853 — Works with default parameter
+ok 854 — Works with second parameter set to true
+
+#  PASS  test/minN.test.js
+
+ok 855 — minN is a Function
+ok 856 — Returns the n minimum elements from the provided array
+ok 857 — Returns the n minimum elements from the provided array
+
+#  PASS  test/maxN.test.js
+
+ok 858 — maxN is a Function
+ok 859 — Returns the n maximum elements from the provided array
+ok 860 — Returns the n maximum elements from the provided array
+
+#  PASS  test/shallowClone.test.js
+
+ok 861 — shallowClone is a Function
+ok 862 — Shallow cloning works
+ok 863 — Does not clone deeply
+
+#  PASS  test/isArmstrongNumber.test.js
+
+ok 864 — isArmstrongNumber is a Function
+ok 865 — isArmstrongNumber returns true
+ok 866 — isArmstrongNumber returns false
+
+#  PASS  test/when.test.js
+
+ok 867 — when is a Function
+ok 868 — Returns the proper result
+ok 869 — Returns the proper result
+
+#  PASS  test/flatten.test.js
+
+ok 870 — flatten is a Function
+ok 871 — Flattens an array
+ok 872 — Flattens an array
+
+#  PASS  test/partialRight.test.js
+
+ok 873 — partialRight is a Function
+ok 874 — Appends arguments
+
+#  PASS  test/composeRight.test.js
+
+ok 875 — composeRight is a Function
+ok 876 — Performs left-to-right function composition
+
+#  PASS  test/permutations.test.js
+
+ok 877 — permutations is a Function
+ok 878 — Generates all permutations of an array
+
+#  PASS  test/compose.test.js
+
+ok 879 — compose is a Function
+ok 880 — Performs right-to-left function composition
+
+#  PASS  test/lcm.test.js
+
+ok 881 — lcm is a Function
+ok 882 — Returns the least common multiple of two or more numbers.
+ok 883 — Returns the least common multiple of two or more numbers.
+
+#  PASS  test/splitLines.test.js
+
+ok 884 — splitLines is a Function
+ok 885 — Splits a multiline string into an array of lines.
+
+#  PASS  test/solveRPN.test.js
+
+ok 886 — solveRPN is a Function
+ok 887 — solveRPN returns the correct result
+ok 888 — solveRPN returns the correct result
+
+#  PASS  test/bindAll.test.js
+
+ok 889 — bindAll is a Function
+ok 890 — Binds to an object context
+
+#  PASS  test/sortedLastIndexBy.test.js
+
+ok 891 — sortedLastIndexBy is a Function
+ok 892 — Returns the highest index to insert the element without messing up the list order
+
+#  PASS  test/percentile.test.js
+
+ok 893 — percentile is a Function
+ok 894 — Uses the percentile formula to calculate how many numbers in the given array are less or equal to the given value.
+
+#  PASS  test/getDaysDiffBetweenDates.test.js
+
+ok 895 — getDaysDiffBetweenDates is a Function
+ok 896 — Returns the difference in days between two dates
+
+#  PASS  test/differenceWith.test.js
+
+ok 897 — differenceWith is a Function
+ok 898 — Filters out all values from an array
+
+#  PASS  test/countVowels.test.js
+
+ok 899 — countVowels is a Function
+ok 900 — countVowels returns the correct count
+ok 901 — countVowels returns the correct count
+
+#  PASS  test/partial.test.js
+
+ok 902 — partial is a Function
+ok 903 — Prepends arguments
+
+#  PASS  test/size.test.js
+
+ok 904 — size is a Function
+ok 905 — Get size of arrays, objects or strings.
+ok 906 — Get size of arrays, objects or strings.
+
+#  PASS  test/mapValues.test.js
+
+ok 907 — mapValues is a Function
+ok 908 — Maps values
+
+#  PASS  test/unionWith.test.js
+
+ok 909 — unionWith is a Function
+ok 910 — Produces the appropriate results
+
+#  PASS  test/palindrome.test.js
+
+ok 911 — palindrome is a Function
+ok 912 — Given string is a palindrome
+ok 913 — Given string is not a palindrome
+
+#  PASS  test/bifurcate.test.js
+
+ok 914 — bifurcate is a Function
+ok 915 — Splits the collection into two groups
+
+#  PASS  test/bifurcateBy.test.js
+
+ok 916 — bifurcateBy is a Function
+ok 917 — Splits the collection into two groups
+
+#  PASS  test/attempt.test.js
+
+ok 918 — attempt is a Function
+ok 919 — Returns a value
+ok 920 — Returns an error
+
+#  PASS  test/getColonTimeFromDate.test.js
+
+ok 921 — getColonTimeFromDate is a Function
+ok 922 — Gets the time in the proper format.
+
+#  PASS  test/degreesToRads.test.js
+
+ok 923 — degreesToRads is a Function
+ok 924 — Returns the appropriate value
+
+#  PASS  test/rearg.test.js
+
+ok 925 — rearg is a Function
+ok 926 — Reorders arguments in invoked function
+
+#  PASS  test/forOwnRight.test.js
+
+ok 927 — forOwnRight is a Function
+ok 928 — Iterates over an element's key-value pairs in reverse
+
+#  PASS  test/pickBy.test.js
+
+ok 929 — pickBy is a Function
+ok 930 — Creates an object composed of the properties the given function returns truthy for.
+
+#  PASS  test/flip.test.js
+
+ok 931 — flip is a Function
+ok 932 — Flips argument order
+
+#  PASS  test/sortedIndexBy.test.js
+
+ok 933 — sortedIndexBy is a Function
+ok 934 — Returns the lowest index to insert the element without messing up the list order
+
+#  PASS  test/dropRightWhile.test.js
+
+ok 935 — dropRightWhile is a Function
+ok 936 — Removes elements from the end of an array until the passed function returns true.
+
+#  PASS  test/isSimilar.test.js
+
+ok 937 — isSimilar is a Function
+ok 938 — isSimilar returns true
+ok 939 — isSimilar returns false
+
+#  PASS  test/get.test.js
+
+ok 940 — get is a Function
+ok 941 — Retrieve a property indicated by the selector from an object.
+
+#  PASS  test/omitBy.test.js
+
+ok 942 — omitBy is a Function
+ok 943 — Creates an object composed of the properties the given function returns falsey for
+
+#  PASS  test/compact.test.js
+
+ok 944 — compact is a Function
+ok 945 — Removes falsey values from an array
+
+#  PASS  test/unescapeHTML.test.js
+
+ok 946 — unescapeHTML is a Function
+ok 947 — Unescapes escaped HTML characters.
+
+#  PASS  test/createElement.test.js
+
+ok 948 — createElement is a Function
+ok 949 — createElement creates an element
+
+#  PASS  test/isFunction.test.js
+
+ok 950 — isFunction is a Function
+ok 951 — passed value is a function
+ok 952 — passed value is not a function
+
+#  PASS  test/pullBy.test.js
+
+ok 953 — pullBy is a Function
+ok 954 — Pulls the specified values
+
+#  PASS  test/removeVowels.test.js
+
+ok 955 — removeVowels is a Function
+ok 956 — Removes vowels.
+ok 957 — Replaces vowels.
+
+#  PASS  test/sortedLastIndex.test.js
+
+ok 958 — sortedLastIndex is a Function
+ok 959 — Returns the highest index to insert the element without messing up the list order
+
+#  PASS  test/isBoolean.test.js
+
+ok 960 — isBoolean is a Function
+ok 961 — passed value is not a boolean
+ok 962 — passed value is not a boolean
+
+#  PASS  test/escapeHTML.test.js
+
+ok 963 — escapeHTML is a Function
+ok 964 — Escapes a string for use in HTML
+
+#  PASS  test/xProd.test.js
+
+ok 965 — xProd is a Function
+ok 966 — xProd([1, 2], ['a', 'b']) returns [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]
+
+#  PASS  test/unflattenObject.test.js
+
+ok 967 — unflattenObject is a Function
+ok 968 — Unflattens an object with the paths for keys
+
+#  PASS  test/isNumber.test.js
+
+ok 969 — isNumber is a Function
+ok 970 — passed argument is a number
+ok 971 — passed argument is not a number
+
+#  PASS  test/stableSort.test.js
+
+ok 972 — stableSort is a Function
+ok 973 — Array is properly sorted
+
+#  PASS  test/sortCharactersInString.test.js
+
+ok 974 — sortCharactersInString is a Function
+ok 975 — Alphabetically sorts the characters in a string.
+
+#  PASS  test/unfold.test.js
+
+ok 976 — unfold is a Function
+ok 977 — Works with a given function, producing an array
+
+#  PASS  test/forEachRight.test.js
+
+ok 978 — forEachRight is a Function
+ok 979 — Iterates over the array in reverse
+
+#  PASS  test/ary.test.js
+
+ok 980 — ary is a Function
+ok 981 — Discards arguments with index >=n
+
+#  PASS  test/stripHTMLTags.test.js
+
+ok 982 — stripHTMLTags is a Function
+ok 983 — Removes HTML tags
+
+#  PASS  test/objectToPairs.test.js
+
+ok 984 — objectToPairs is a Function
+ok 985 — Creates an array of key-value pair arrays from an object.
+
+#  PASS  test/objectFromPairs.test.js
+
+ok 986 — objectFromPairs is a Function
+ok 987 — Creates an object from the given key-value pairs.
+
+#  PASS  test/curry.test.js
+
+ok 988 — curry is a Function
+ok 989 — curries a Math.pow
+ok 990 — curries a Math.min
+
+#  PASS  test/toDecimalMark.test.js
+
+ok 991 — toDecimalMark is a Function
+ok 992 — convert a float-point arithmetic to the Decimal mark form
+
+#  PASS  test/forOwn.test.js
+
+ok 993 — forOwn is a Function
+ok 994 — Iterates over an element's key-value pairs
+
+#  PASS  test/findLastIndex.test.js
+
+ok 995 — findLastIndex is a Function
+ok 996 — Finds last index for which the given function returns true
+
+#  PASS  test/pick.test.js
+
+ok 997 — pick is a Function
+ok 998 — Picks the key-value pairs corresponding to the given keys from an object.
+
+#  PASS  test/isNull.test.js
+
+ok 999 — isNull is a Function
+ok 1000 — passed argument is a null
+ok 1001 — passed argument is a null
+
+#  PASS  test/filterNonUnique.test.js
+
+ok 1002 — filterNonUnique is a Function
+ok 1003 — Filters out the non-unique values in an array
+
+#  PASS  test/dropWhile.test.js
+
+ok 1004 — dropWhile is a Function
+ok 1005 — Removes elements in an array until the passed function returns true.
+
+#  PASS  test/takeRightWhile.test.js
+
+ok 1006 — takeRightWhile is a Function
+ok 1007 — Removes elements until the function returns true
+
+#  PASS  test/atob.test.js
+
+ok 1008 — atob is a Function
+ok 1009 — atob("Zm9vYmFy") equals "foobar"
+ok 1010 — atob("Z") returns ""
+
+#  PASS  test/removeNonASCII.test.js
+
+ok 1011 — removeNonASCII is a Function
+ok 1012 — Removes non-ASCII characters
+
+#  PASS  test/delay.test.js
+
+ok 1013 — delay is a Function
+ok 1014 — Works as expecting, passing arguments properly
+
+#  PASS  test/remove.test.js
+
+ok 1015 — remove is a Function
+ok 1016 — Removes elements from an array for which the given function returns false
+
+#  PASS  test/defaults.test.js
+
+ok 1017 — defaults is a Function
+ok 1018 — Assigns default values for undefined properties
+
+#  PASS  test/countOccurrences.test.js
+
+ok 1019 — countOccurrences is a Function
+ok 1020 — Counts the occurrences of a value in an array
+
+#  PASS  test/omit.test.js
+
+ok 1021 — omit is a Function
+ok 1022 — Omits the key-value pairs corresponding to the given keys from an object
+
+#  PASS  test/clampNumber.test.js
+
+ok 1023 — clampNumber is a Function
+ok 1024 — Clamps num within the inclusive range specified by the boundary values a and b
+
+#  PASS  test/intersection.test.js
+
+ok 1025 — intersection is a Function
+ok 1026 — Returns a list of elements that exist in both arrays
+
+#  PASS  test/over.test.js
+
+ok 1027 — over is a Function
+ok 1028 — Applies given functions over multiple arguments
+
+#  PASS  test/truncateString.test.js
+
+ok 1029 — truncateString is a Function
+ok 1030 — Truncates a "boomerang" up to a specified length.
+
+#  PASS  test/parseCookie.test.js
+
+ok 1031 — parseCookie is a Function
+ok 1032 — Parses the cookie
+
+#  PASS  test/pull.test.js
+
+ok 1033 — pull is a Function
+ok 1034 — Pulls the specified values
+
+#  PASS  test/similarity.test.js
+
+ok 1035 — similarity is a Function
+ok 1036 — Returns an array of elements that appear in both arrays.
+
+#  PASS  test/isEven.test.js
+
+ok 1037 — isEven is a Function
+ok 1038 — 4 is even number
+ok 1039 — 5 is not an even number
+
+#  PASS  test/findLast.test.js
+
+ok 1040 — findLast is a Function
+ok 1041 — Finds last element for which the given function returns true
+
+#  PASS  test/fibonacciUntilNum.test.js
+
+ok 1042 — fibonacciUntilNum is a Function
+ok 1043 — Returns the correct sequence
+
+#  PASS  test/times.test.js
+
+ok 1044 — times is a Function
+ok 1045 — Runs a function the specified amount of times
+
+#  PASS  test/fibonacciCountUntilNum.test.js
+
+ok 1046 — fibonacciCountUntilNum is a Function
+ok 1047 — Returns the correct number
+
+#  PASS  test/cloneRegExp.test.js
+
+ok 1048 — cloneRegExp is a Function
+ok 1049 — Clones regular expressions properly
+
+#  PASS  test/coalesce.test.js
+
+ok 1050 — coalesce is a Function
+ok 1051 — Returns the first non-null/undefined argument
+
+#  PASS  test/escapeRegExp.test.js
+
+ok 1052 — escapeRegExp is a Function
+ok 1053 — Escapes a string to use in a regular expression
+
+#  PASS  test/JSONToDate.test.js
+
+ok 1054 — JSONToDate is a Function
+ok 1055 — JSONToDate returns the correct date string
+
+#  PASS  test/tail.test.js
+
+ok 1056 — tail is a Function
+ok 1057 — Returns tail
+ok 1058 — Returns tail
+
+#  PASS  test/primes.test.js
+
+ok 1059 — primes is a Function
+ok 1060 — Generates primes up to a given number, using the Sieve of Eratosthenes.
+
+#  PASS  test/powerset.test.js
+
+ok 1061 — powerset is a Function
+ok 1062 — Returns the powerset of a given array of numbers.
+
+#  PASS  test/fibonacci.test.js
+
+ok 1063 — fibonacci is a Function
+ok 1064 — Generates an array, containing the Fibonacci sequence
+
+#  PASS  test/distance.test.js
+
+ok 1065 — distance is a Function
+ok 1066 — Calculates the distance between two points
+
+#  PASS  test/difference.test.js
+
+ok 1067 — difference is a Function
+ok 1068 — Returns the difference between two arrays
+
+#  PASS  test/negate.test.js
+
+ok 1069 — negate is a Function
+ok 1070 — Negates a predicate function
+
+#  PASS  test/deepFlatten.test.js
+
+ok 1071 — deepFlatten is a Function
+ok 1072 — Deep flattens an array
+
+#  PASS  test/RGBToHex.test.js
+
+ok 1073 — RGBToHex is a Function
+ok 1074 — Converts the values of RGB components to a color code.
+
+#  PASS  test/hammingDistance.test.js
+
+ok 1075 — hammingDistance is a Function
+ok 1076 — retuns hamming disance between 2 values
+
+#  PASS  test/currentURL.test.js
+
+ok 1077 — currentURL is a Function
+ok 1078 — currentURL returns the appropriate value
+
+#  PASS  test/everyNth.test.js
+
+ok 1079 — everyNth is a Function
+ok 1080 — Returns every nth element in an array
+
+#  PASS  test/initial.test.js
+
+ok 1081 — initial is a Function
+ok 1082 — Returns all the elements of an array except the last one
+
+#  PASS  test/unionBy.test.js
+
+ok 1083 — unionBy is a Function
+ok 1084 — Produces the appropriate results
+
+#  PASS  test/serializeCookie.test.js
+
+ok 1085 — serializeCookie is a Function
+ok 1086 — Serializes the cookie
+
+#  PASS  test/sleep.test.js
+
+ok 1087 — sleep is a Function
+ok 1088 — Works as expected
+
+#  PASS  test/unary.test.js
+
+ok 1089 — unary is a Function
+ok 1090 — Discards arguments after the first one
+
+#  PASS  test/mapKeys.test.js
+
+ok 1091 — mapKeys is a Function
+ok 1092 — Maps keys
+
+#  PASS  test/radsToDegrees.test.js
+
+ok 1093 — radsToDegrees is a Function
+ok 1094 — Returns the appropriate value
+
+#  PASS  test/isSymbol.test.js
+
+ok 1095 — isSymbol is a Function
+ok 1096 — Checks if the given argument is a symbol
+
+#  PASS  test/digitize.test.js
+
+ok 1097 — digitize is a Function
+ok 1098 — Converts a number to an array of digits
+
+#  PASS  test/call.test.js
+
+ok 1099 — call is a Function
+ok 1100 — Calls function on given object
+
+#  PASS  test/reverseString.test.js
+
+ok 1101 — reverseString is a Function
+ok 1102 — Reverses a string.
+
+#  PASS  test/isUndefined.test.js
+
+ok 1103 — isUndefined is a Function
+ok 1104 — Returns true for undefined
+
+#  PASS  test/isDivisible.test.js
+
+ok 1105 — isDivisible is a Function
+ok 1106 — The number 6 is divisible by 3
+
+#  PASS  test/heronArea.test.js
+
+ok 1107 — heronArea is a Function
+ok 1108 — howManyTimes returns the correct result
+
+#  PASS  test/colorize.test.js
+
+ok 1109 — colorize is a Function
+ok 1110 — Returns the appropriate value
+
+#  PASS  test/sdbm.test.js
+
+ok 1111 — sdbm is a Function
+ok 1112 — Hashes the input string into a whole number.
+
+#  PASS  test/mphToKmph.test.js
+
+ok 1113 — mphToKmph is a Function
+ok 1114 — Returns kph from mph.
+
+#  PASS  test/debounce.test.js
+
+ok 1115 — debounce is a Function
+ok 1116 — Works as expected
+
+#  PASS  test/sum.test.js
+
+ok 1117 — sum is a Function
+ok 1118 — Returns the sum of two or more numbers/arrays.
+
+#  PASS  test/isBrowser.test.js
+
+ok 1119 — isBrowser is a Function
+ok 1120 — isBrowser is a Function
+
+#  PASS  test/timeTaken.test.js
+
+ok 1121 — timeTaken is a Function
+ok 1122 — timeTaken is a Function
+
+#  PASS  test/kmphToMph.test.js
+
+ok 1123 — kmphToMph is a Function
+ok 1124 — Returns mph from kph.
+
+#  PASS  test/pipeLog.test.js
+
+ok 1125 — pipeLog is a Function
+ok 1126 — pipeLog returns the given value
+
+#  PASS  test/btoa.test.js
+
+ok 1127 — btoa is a Function
+ok 1128 — btoa("foobar") equals "Zm9vYmFy"
+
+#  PASS  test/isPrime.test.js
+
+ok 1129 — isPrime is a Function
+ok 1130 — passed number is a prime
+
+#  PASS  test/once.test.js
+
+ok 1131 — once is a Function
+ok 1132 — once is a Function
+
+#  PASS  test/elementIsVisibleInViewport.test.js
+
+ok 1133 — elementIsVisibleInViewport is a Function
+
+#  PASS  test/recordAnimationFrames.test.js
+
+ok 1134 — recordAnimationFrames is a Function
+
+#  PASS  test/UUIDGeneratorBrowser.test.js
+
+ok 1135 — UUIDGeneratorBrowser is a Function
+
+#  PASS  test/isBrowserTabFocused.test.js
+
+ok 1136 — isBrowserTabFocused is a Function
+
+#  PASS  test/getScrollPosition.test.js
+
+ok 1137 — getScrollPosition is a Function
+
+#  PASS  test/onUserInputChange.test.js
+
+ok 1138 — onUserInputChange is a Function
+
+#  PASS  test/detectDeviceType.test.js
+
+ok 1139 — detectDeviceType is a Function
+
+#  PASS  test/observeMutations.test.js
+
+ok 1140 — observeMutations is a Function
+
+#  PASS  test/nodeListToArray.test.js
+
+ok 1141 — nodeListToArray is a Function
+
+#  PASS  test/speechSynthesis.test.js
+
+ok 1142 — speechSynthesis is a Function
+
+#  PASS  test/copyToClipboard.test.js
+
+ok 1143 — copyToClipboard is a Function
+
+#  PASS  test/arrayToHtmlList.test.js
+
+ok 1144 — arrayToHtmlList is a Function
+
+#  PASS  test/elementContains.test.js
+
+ok 1145 — elementContains is a Function
+
+#  PASS  test/createEventHub.test.js
+
+ok 1146 — createEventHub is a Function
+
+#  PASS  test/mostPerformant.test.js
+
+ok 1147 — mostPerformant is a Function
+
+#  PASS  test/readFileLines.test.js
+
+ok 1148 — readFileLines is a Function
+
+#  PASS  test/httpsRedirect.test.js
+
+ok 1149 — httpsRedirect is a Function
+
+#  PASS  test/bottomVisible.test.js
+
+ok 1150 — bottomVisible is a Function
+
+#  PASS  test/smoothScroll.test.js
+
+ok 1151 — smoothScroll is a Function
+
+#  PASS  test/triggerEvent.test.js
+
+ok 1152 — triggerEvent is a Function
+
+#  PASS  test/insertBefore.test.js
+
+ok 1153 — insertBefore is a Function
+
+#  PASS  test/hashBrowser.test.js
+
+ok 1154 — hashBrowser is a Function
+
+#  PASS  test/insertAfter.test.js
+
+ok 1155 — insertAfter is a Function
+
+#  PASS  test/toggleClass.test.js
+
+ok 1156 — toggleClass is a Function
+
+#  PASS  test/scrollToTop.test.js
+
+ok 1157 — scrollToTop is a Function
+
+#  PASS  test/httpDelete.test.js
+
+ok 1158 — httpDelete is a Function
+
+#  PASS  test/JSONToFile.test.js
+
+ok 1159 — JSONToFile is a Function
+
+#  PASS  test/dayOfYear.test.js
+
+ok 1160 — dayOfYear is a Function
+
+#  PASS  test/squareSum.test.js
+
+ok 1161 — squareSum is a Function
+
+#  PASS  test/hasFlags.test.js
+
+ok 1162 — hasFlags is a Function
+
+#  PASS  test/setStyle.test.js
+
+ok 1163 — setStyle is a Function
+
+#  PASS  test/getStyle.test.js
+
+ok 1164 — getStyle is a Function
+
+#  PASS  test/redirect.test.js
+
+ok 1165 — redirect is a Function
+
+#  PASS  test/httpPost.test.js
+
+ok 1166 — httpPost is a Function
+
+#  PASS  test/runAsync.test.js
+
+ok 1167 — runAsync is a Function
+
+#  PASS  test/hasClass.test.js
+
+ok 1168 — hasClass is a Function
+
+#  PASS  test/throttle.test.js
+
+ok 1169 — throttle is a Function
+
+#  PASS  test/httpPut.test.js
+
+ok 1170 — httpPut is a Function
+
+#  PASS  test/httpGet.test.js
+
+ok 1171 — httpGet is a Function
+
+#  PASS  test/counter.test.js
+
+ok 1172 — counter is a Function
+
+#  PASS  test/toHash.test.js
+
+ok 1173 — toHash is a Function
+
+#  PASS  test/prefix.test.js
+
+ok 1174 — prefix is a Function
+
+#  PASS  test/defer.test.js
+
+ok 1175 — defer is a Function
+
+#  PASS  test/show.test.js
+
+ok 1176 — show is a Function
+
+#  PASS  test/hide.test.js
+
+ok 1177 — hide is a Function
 
 #  PASS  test/off.test.js
 
-ok 1102 — off is a Function
+ok 1178 — off is a Function
 
 #  PASS  test/on.test.js
 
-ok 1103 — on is a Function
+ok 1179 — on is a Function
 
 #  PASS  test/hz.test.js
 
-ok 1104 — hz is a Function
+ok 1180 — hz is a Function
 
-1..1104
+1..1180
 
-# Test Suites: 100% ██████████, 359 passed, 359 total
-# Tests:       100% ██████████, 1104 passed, 1104 total
-# Time:        24.734s
+# Test Suites: 100% ██████████, 360 passed, 360 total
+# Tests:       100% ██████████, 1180 passed, 1180 total
+# Time:        26.152s
 
 # Ran all test suites.
 
diff --git a/vscode_snippets/snippets.json b/vscode_snippets/snippets.json
index c03844454..c4dae15c5 100644
--- a/vscode_snippets/snippets.json
+++ b/vscode_snippets/snippets.json
@@ -4,28 +4,28 @@
     "body": [
       "const all = (arr, fn = Boolean) => arr.every(fn);"
     ],
-    "description": "Returns `true` if the provided predicate function returns `true` for all elements in a collection, `false` otherwise."
+    "description": "Returns `true` if the provided predicate function returns `true` for all elements in a collection, `false` otherwise.\n\nUse `Array.prototype.every()` to test if all elements in the collection return `true` based on `fn`.\nOmit the second argument, `fn`, to use `Boolean` as a default"
   },
   "allEqual": {
     "prefix": "30s_allEqual",
     "body": [
       "const allEqual = arr => arr.every(val => val === arr[0]);"
     ],
-    "description": "Check if all elements in an array are equal."
+    "description": "Check if all elements in an array are equal.\n\nUse `Array.prototype.every()` to check if all the elements of the array are the same as the first one"
   },
   "any": {
     "prefix": "30s_any",
     "body": [
       "const any = (arr, fn = Boolean) => arr.some(fn);"
     ],
-    "description": "Returns `true` if the provided predicate function returns `true` for at least one element in a collection, `false` otherwise."
+    "description": "Returns `true` if the provided predicate function returns `true` for at least one element in a collection, `false` otherwise.\n\nUse `Array.prototype.some()` to test if any elements in the collection return `true` based on `fn`.\nOmit the second argument, `fn`, to use `Boolean` as a default"
   },
   "approximatelyEqual": {
     "prefix": "30s_approximatelyEqual",
     "body": [
       "const approximatelyEqual = (v1, v2, epsilon = 0.001) => Math.abs(v1 - v2) < epsilon;"
     ],
-    "description": "Checks if two numbers are approximately equal to each other."
+    "description": "Checks if two numbers are approximately equal to each other.\n\nUse `Math.abs()` to compare the absolute difference of the two values to `epsilon`.\nOmit the third parameter, `epsilon`, to use a default value of `0.001`"
   },
   "arrayToCSV": {
     "prefix": "30s_arrayToCSV",
@@ -33,7 +33,7 @@
       "const arrayToCSV = (arr, delimiter = ',') =>",
       "  arr.map(v => v.map(x => `\"${x}\"`).join(delimiter)).join('\\n');"
     ],
-    "description": "Converts a 2D array to a comma-separated values (CSV) string."
+    "description": "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 `,`"
   },
   "arrayToHtmlList": {
     "prefix": "30s_arrayToHtmlList",
@@ -44,21 +44,21 @@
       "    (el.innerHTML += arr.map(item => `<li>${item}</li>`).join(''))",
       "  ))();"
     ],
-    "description": "Converts the given array elements into `<li>` tags and appends them to the list of the given id."
+    "description": "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"
   },
   "ary": {
     "prefix": "30s_ary",
     "body": [
       "const ary = (fn, n) => (...args) => fn(...args.slice(0, n));"
     ],
-    "description": "Creates a function that accepts up to `n` arguments, ignoring any additional arguments."
+    "description": "Creates a function that accepts up to `n` arguments, ignoring any additional arguments.\n\nCall the provided function, `fn`, with up to `n` arguments, using `Array.prototype.slice(0,n)` and the spread operator (`...`)"
   },
   "atob": {
     "prefix": "30s_atob",
     "body": [
       "const atob = str => Buffer.from(str, 'base64').toString('binary');"
     ],
-    "description": "Decodes a string of data which has been encoded using base-64 encoding."
+    "description": "Decodes a string of data which has been encoded using base-64 encoding.\n\nCreate a `Buffer` for the given string with base-64 encoding and use `Buffer.toString('binary')` to return the decoded string"
   },
   "attempt": {
     "prefix": "30s_attempt",
@@ -71,14 +71,14 @@
       "  }",
       "};"
     ],
-    "description": "Attempts to invoke a function with the provided arguments, returning either the result or the caught error object."
+    "description": "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"
   },
   "average": {
     "prefix": "30s_average",
     "body": [
       "const average = (...nums) => nums.reduce((acc, val) => acc + val, 0) / nums.length;"
     ],
-    "description": "Returns the average of two or more numbers."
+    "description": "Returns the average of two or more numbers.\n\nUse `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`, divide by the `length` of the array"
   },
   "averageBy": {
     "prefix": "30s_averageBy",
@@ -87,7 +87,7 @@
       "  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => acc + val, 0) /",
       "  arr.length;"
     ],
-    "description": "Returns the average of an array, after mapping each element to a value using the provided function."
+    "description": "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"
   },
   "bifurcate": {
     "prefix": "30s_bifurcate",
@@ -95,7 +95,7 @@
       "const bifurcate = (arr, filter) =>",
       "  arr.reduce((acc, val, i) => (acc[filter[i] ? 0 : 1].push(val), acc), [[], []]);"
     ],
-    "description": "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."
+    "description": "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`"
   },
   "bifurcateBy": {
     "prefix": "30s_bifurcateBy",
@@ -103,14 +103,14 @@
       "const bifurcateBy = (arr, fn) =>",
       "  arr.reduce((acc, val, i) => (acc[fn(val, i) ? 0 : 1].push(val), acc), [[], []]);"
     ],
-    "description": "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."
+    "description": "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"
   },
   "bind": {
     "prefix": "30s_bind",
     "body": [
       "const bind = (fn, context, ...boundArgs) => (...args) => fn.apply(context, [...boundArgs, ...args]);"
     ],
-    "description": "Creates a function that invokes `fn` with a given context, optionally adding any additional supplied parameters to the beginning of the arguments."
+    "description": "Creates a function that invokes `fn` with a given context, optionally adding any additional supplied parameters to the beginning of the arguments.\n\nReturn a `function` that uses `Function.prototype.apply()` to apply the given `context` to `fn`.\nUse `Array.prototype.concat()` to prepend any additional supplied parameters to the arguments"
   },
   "bindAll": {
     "prefix": "30s_bindAll",
@@ -125,7 +125,7 @@
       "    )",
       "  );"
     ],
-    "description": "Binds methods of an object to the object itself, overwriting the existing method."
+    "description": "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"
   },
   "bindKey": {
     "prefix": "30s_bindKey",
@@ -133,7 +133,7 @@
       "const bindKey = (context, fn, ...boundArgs) => (...args) =>",
       "  context[fn].apply(context, [...boundArgs, ...args]);"
     ],
-    "description": "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."
+    "description": "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"
   },
   "binomialCoefficient": {
     "prefix": "30s_binomialCoefficient",
@@ -149,7 +149,7 @@
       "  return Math.round(res);",
       "};"
     ],
-    "description": "Evaluates the binomial coefficient of two integers `n` and `k`."
+    "description": "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"
   },
   "bottomVisible": {
     "prefix": "30s_bottomVisible",
@@ -158,21 +158,21 @@
       "  document.documentElement.clientHeight + window.scrollY >=",
       "  (document.documentElement.scrollHeight || document.documentElement.clientHeight);"
     ],
-    "description": "Returns `true` if the bottom of the page is visible, `false` otherwise."
+    "description": "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"
   },
   "btoa": {
     "prefix": "30s_btoa",
     "body": [
       "const btoa = str => Buffer.from(str, 'binary').toString('base64');"
     ],
-    "description": "Creates a base-64 encoded ASCII string from a String object in which each character in the string is treated as a byte of binary data."
+    "description": "Creates a base-64 encoded ASCII string from a String object in which each character in the string is treated as a byte of binary data.\n\nCreate a `Buffer` for the given string with binary encoding and use `Buffer.toString('base64')` to return the encoded string"
   },
   "byteSize": {
     "prefix": "30s_byteSize",
     "body": [
       "const byteSize = str => new Blob([str]).size;"
     ],
-    "description": "Returns the length of a string in bytes."
+    "description": "Returns the length of a string in bytes.\n\nConvert a given string to a [`Blob` Object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) and find its `size`"
   },
   "call": {
     "prefix": "30s_call",
@@ -187,21 +187,21 @@
       "const capitalize = ([first, ...rest], lowerRest = false) =>",
       "  first.toUpperCase() + (lowerRest ? rest.join('').toLowerCase() : rest.join(''));"
     ],
-    "description": "Capitalizes the first letter of a string."
+    "description": "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"
   },
   "capitalizeEveryWord": {
     "prefix": "30s_capitalizeEveryWord",
     "body": [
       "const capitalizeEveryWord = str => str.replace(/\\b[a-z]/g, char => char.toUpperCase());"
     ],
-    "description": "Capitalizes the first letter of every word in a string."
+    "description": "Capitalizes the first letter of every word in a string.\n\nUse `String.prototype.replace()` to match the first character of each word and `String.prototype.toUpperCase()` to capitalize it"
   },
   "castArray": {
     "prefix": "30s_castArray",
     "body": [
       "const castArray = val => (Array.isArray(val) ? val : [val]);"
     ],
-    "description": "Casts the provided value as an array if it's not one."
+    "description": "Casts the provided value as an array if it's not one.\n\nUse `Array.prototype.isArray()` to determine if `val` is an array and return it as-is or encapsulated in an array accordingly"
   },
   "chainAsync": {
     "prefix": "30s_chainAsync",
@@ -212,7 +212,7 @@
       "  next();",
       "};"
     ],
-    "description": "Chains asynchronous functions."
+    "description": "Chains asynchronous functions.\n\nLoop through an array of functions containing asynchronous events, calling `next` when each asynchronous event has completed"
   },
   "chunk": {
     "prefix": "30s_chunk",
@@ -222,35 +222,35 @@
       "    arr.slice(i * size, i * size + size)",
       "  );"
     ],
-    "description": "Chunks an array into smaller arrays of a specified size."
+    "description": "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"
   },
   "clampNumber": {
     "prefix": "30s_clampNumber",
     "body": [
       "const clampNumber = (num, a, b) => Math.max(Math.min(num, Math.max(a, b)), Math.min(a, b));"
     ],
-    "description": "Clamps `num` within the inclusive range specified by the boundary values `a` and `b`."
+    "description": "Clamps `num` within the inclusive range specified by the boundary values `a` and `b`.\n\nIf `num` falls within the range, return `num`.\nOtherwise, return the nearest number in the range"
   },
   "cloneRegExp": {
     "prefix": "30s_cloneRegExp",
     "body": [
       "const cloneRegExp = regExp => new RegExp(regExp.source, regExp.flags);"
     ],
-    "description": "Clones a regular expression."
+    "description": "Clones a regular expression.\n\nUse `new RegExp()`, `RegExp.source` and `RegExp.flags` to clone the given regular expression"
   },
   "coalesce": {
     "prefix": "30s_coalesce",
     "body": [
       "const coalesce = (...args) => args.find(_ => ![undefined, null].includes(_));"
     ],
-    "description": "Returns the first non-null/undefined argument."
+    "description": "Returns the first non-null/undefined argument.\n\nUse `Array.prototype.find()` to return the first non `null`/`undefined` argument"
   },
   "coalesceFactory": {
     "prefix": "30s_coalesceFactory",
     "body": [
       "const coalesceFactory = valid => (...args) => args.find(valid);"
     ],
-    "description": "Returns a customized coalesce function that returns the first argument that returns `true` from the provided argument validation function."
+    "description": "Returns a customized coalesce function that returns the first argument that returns `true` from the provided argument validation function.\n\nUse `Array.prototype.find()` to return the first argument that returns `true` from the provided argument validation function"
   },
   "collectInto": {
     "prefix": "30s_collectInto",
@@ -281,35 +281,35 @@
       "  bgWhite: `\\x1b[47m${args.join(' ')}\\x1b[0m`",
       "});"
     ],
-    "description": "Add special characters to text to print in color in the console (combined with `console.log()`)."
+    "description": "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"
   },
   "compact": {
     "prefix": "30s_compact",
     "body": [
       "const compact = arr => arr.filter(Boolean);"
     ],
-    "description": "Removes falsey values from an array."
+    "description": "Removes falsey values from an array.\n\nUse `Array.prototype.filter()` to filter out falsey values (`false`, `null`, `0`, `\"\"`, `undefined`, and `NaN`)"
   },
   "compose": {
     "prefix": "30s_compose",
     "body": [
       "const compose = (...fns) => fns.reduce((f, g) => (...args) => f(g(...args)));"
     ],
-    "description": "Performs right-to-left function composition."
+    "description": "Performs right-to-left function composition.\n\nUse `Array.prototype.reduce()` to perform right-to-left function composition.\nThe last (rightmost) function can accept one or more arguments; the remaining functions must be unary"
   },
   "composeRight": {
     "prefix": "30s_composeRight",
     "body": [
       "const composeRight = (...fns) => fns.reduce((f, g) => (...args) => g(f(...args)));"
     ],
-    "description": "Performs left-to-right function composition."
+    "description": "Performs left-to-right function composition.\n\nUse `Array.prototype.reduce()` to perform left-to-right function composition.\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary"
   },
   "converge": {
     "prefix": "30s_converge",
     "body": [
       "const converge = (converger, fns) => (...args) => converger(...fns.map(fn => fn.apply(null, args)));"
     ],
-    "description": "Accepts a converging function and a list of branching functions and returns a function that applies each branching function to the arguments and the results of the branching functions are passed as arguments to the converging function."
+    "description": "Accepts a converging function and a list of branching functions and returns a function that applies each branching function to the arguments and the results of the branching functions are passed as arguments to the converging function.\n\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments.\nUse the spread operator (`...`) to call `coverger` with the results of all other functions"
   },
   "copyToClipboard": {
     "prefix": "30s_copyToClipboard",
@@ -332,7 +332,7 @@
       "  }",
       "};"
     ],
-    "description": "⚠️ **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)."
+    "description": "⚠️ **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)"
   },
   "countBy": {
     "prefix": "30s_countBy",
@@ -343,7 +343,7 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Groups the elements of an array based on the given function and returns the count of elements in each group."
+    "description": "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"
   },
   "counter": {
     "prefix": "30s_counter",
@@ -360,14 +360,14 @@
       "  return timer;",
       "};"
     ],
-    "description": "Creates a counter with the specified range, step and duration for the specified selector."
+    "description": "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"
   },
   "countOccurrences": {
     "prefix": "30s_countOccurrences",
     "body": [
       "const countOccurrences = (arr, val) => arr.reduce((a, v) => (v === val ? a + 1 : a), 0);"
     ],
-    "description": "Counts the occurrences of a value in an array."
+    "description": "Counts the occurrences of a value in an array.\n\nUse `Array.prototype.reduce()` to increment a counter each time you encounter the specific value inside the array"
   },
   "createElement": {
     "prefix": "30s_createElement",
@@ -378,7 +378,7 @@
       "  return el.firstElementChild;",
       "};"
     ],
-    "description": "Creates an element from a string (without appending it to the document). \r\nIf the given string contains multiple elements, only the first one will be returned."
+    "description": "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"
   },
   "createEventHub": {
     "prefix": "30s_createEventHub",
@@ -398,7 +398,7 @@
       "  }",
       "});"
     ],
-    "description": "Creates a pub/sub ([publish–subscribe](https://en.wikipedia.org/wiki/Publish%E2%80%93subscribe_pattern)) event hub with `emit`, `on`, and `off` methods."
+    "description": "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()`"
   },
   "CSVToArray": {
     "prefix": "30s_CSVToArray",
@@ -409,7 +409,7 @@
       "    .split('\\n')",
       "    .map(v => v.split(delimiter));"
     ],
-    "description": "Converts a comma-separated values (CSV) string to a 2D array."
+    "description": "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"
   },
   "CSVToJSON": {
     "prefix": "30s_CSVToJSON",
@@ -425,14 +425,14 @@
       "    });",
       "};"
     ],
-    "description": "Converts a comma-separated values (CSV) string to a 2D array of objects.\r\nThe first row of the string is used as the title row."
+    "description": "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 `,`"
   },
   "currentURL": {
     "prefix": "30s_currentURL",
     "body": [
       "const currentURL = () => window.location.href;"
     ],
-    "description": "Returns the current URL."
+    "description": "Returns the current URL.\n\nUse `window.location.href` to get current URL"
   },
   "curry": {
     "prefix": "30s_curry",
@@ -440,7 +440,7 @@
       "const curry = (fn, arity = fn.length, ...args) =>",
       "  arity <= args.length ? fn(...args) : curry.bind(null, fn, arity, ...args);"
     ],
-    "description": "Curries a function."
+    "description": "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`"
   },
   "dayOfYear": {
     "prefix": "30s_dayOfYear",
@@ -448,7 +448,7 @@
       "const dayOfYear = date =>",
       "  Math.floor((date - new Date(date.getFullYear(), 0, 0)) / 1000 / 60 / 60 / 24);"
     ],
-    "description": "Gets the day of the year from a `Date` object."
+    "description": "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"
   },
   "debounce": {
     "prefix": "30s_debounce",
@@ -461,7 +461,7 @@
       "  };",
       "};"
     ],
-    "description": "Creates a debounced function that delays invoking the provided function until at least `ms` milliseconds have elapsed since the last time it was invoked."
+    "description": "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"
   },
   "decapitalize": {
     "prefix": "30s_decapitalize",
@@ -469,7 +469,7 @@
       "const decapitalize = ([first, ...rest], upperRest = false) =>",
       "  first.toLowerCase() + (upperRest ? rest.join('').toUpperCase() : rest.join(''));"
     ],
-    "description": "Decapitalizes the first letter of a string."
+    "description": "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"
   },
   "deepClone": {
     "prefix": "30s_deepClone",
@@ -482,14 +482,14 @@
       "  return Array.isArray(obj) ? (clone.length = obj.length) && Array.from(clone) : clone;",
       "};"
     ],
-    "description": "Creates a deep clone of an object."
+    "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"
   },
   "deepFlatten": {
     "prefix": "30s_deepFlatten",
     "body": [
       "const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));"
     ],
-    "description": "Deep flattens an array."
+    "description": "Deep flattens an array.\n\nUse recursion.\nUse `Array.prototype.concat()` with an empty array (`[]`) and the spread operator (`...`) to flatten an array.\nRecursively flatten each element that is an array"
   },
   "deepFreeze": {
     "prefix": "30s_deepFreeze",
@@ -500,35 +500,35 @@
       "      !(obj[prop] instanceof Object) || Object.isFrozen(obj[prop]) ? null : deepFreeze(obj[prop])",
       "  ) || Object.freeze(obj);"
     ],
-    "description": "Deep freezes an object."
+    "description": "Deep freezes an object.\n\nCalls `Object.freeze(obj)` recursively on all unfrozen properties of passed object that are `instanceof` object"
   },
   "defaults": {
     "prefix": "30s_defaults",
     "body": [
       "const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj);"
     ],
-    "description": "Assigns default values for all properties in an object that are `undefined`."
+    "description": "Assigns default values for all properties in an object that are `undefined`.\n\nUse `Object.assign()` to create a new empty object and copy the original one to maintain key order, use `Array.prototype.reverse()` and the spread operator `...` to combine the default values from left to right, finally use `obj` again to overwrite properties that originally had a value"
   },
   "defer": {
     "prefix": "30s_defer",
     "body": [
       "const defer = (fn, ...args) => setTimeout(fn, 1, ...args);"
     ],
-    "description": "Defers invoking a function until the current call stack has cleared."
+    "description": "Defers invoking a function until the current call stack has cleared.\n\nUse `setTimeout()` with a timeout of 1ms to add a new event to the browser event queue and allow the rendering engine to complete its work. Use the spread (`...`) operator to supply the function with an arbitrary number of arguments"
   },
   "degreesToRads": {
     "prefix": "30s_degreesToRads",
     "body": [
       "const degreesToRads = deg => (deg * Math.PI) / 180.0;"
     ],
-    "description": "Converts an angle from degrees to radians."
+    "description": "Converts an angle from degrees to radians.\n\nUse `Math.PI` and the degree to radian formula to convert the angle from degrees to radians"
   },
   "delay": {
     "prefix": "30s_delay",
     "body": [
       "const delay = (fn, wait, ...args) => setTimeout(fn, wait, ...args);"
     ],
-    "description": "Invokes the provided function after `wait` milliseconds."
+    "description": "Invokes the provided function after `wait` milliseconds.\n\nUse `setTimeout()` to delay execution of `fn`.\nUse the spread (`...`) operator to supply the function with an arbitrary number of arguments"
   },
   "detectDeviceType": {
     "prefix": "30s_detectDeviceType",
@@ -538,7 +538,7 @@
       "    ? 'Mobile'",
       "    : 'Desktop';"
     ],
-    "description": "Detects wether the website is being opened in a mobile device or a desktop/laptop."
+    "description": "Detects wether 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"
   },
   "difference": {
     "prefix": "30s_difference",
@@ -548,7 +548,7 @@
       "  return a.filter(x => !s.has(x));",
       "};"
     ],
-    "description": "Returns the difference between two arrays."
+    "description": "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`"
   },
   "differenceBy": {
     "prefix": "30s_differenceBy",
@@ -558,14 +558,14 @@
       "  return a.filter(x => !s.has(fn(x)));",
       "};"
     ],
-    "description": "Returns the difference between two arrays, after applying the provided function to each array element of both."
+    "description": "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.filter()` in combination with `fn` on `a` to only keep values not contained in the previously created set"
   },
   "differenceWith": {
     "prefix": "30s_differenceWith",
     "body": [
       "const differenceWith = (arr, val, comp) => arr.filter(a => val.findIndex(b => comp(a, b)) === -1);"
     ],
-    "description": "Filters out all values from an array for which the comparator function does not return `true`."
+    "description": "Filters out all values from an array for which the comparator function does not return `true`.\n\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` to find the appropriate values"
   },
   "dig": {
     "prefix": "30s_dig",
@@ -578,35 +578,35 @@
       "      if (typeof val === 'object') return dig(val, target);",
       "    }, undefined);"
     ],
-    "description": "Returns the target value in a nested JSON object, based on the given key."
+    "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"
   },
   "digitize": {
     "prefix": "30s_digitize",
     "body": [
       "const digitize = n => [...`${n}`].map(i => parseInt(i));"
     ],
-    "description": "Converts a number to an array of digits."
+    "description": "Converts a number to an array of digits.\n\nConvert the number to a string, using the spread operator (`...`) to build an array.\nUse `Array.prototype.map()` and `parseInt()` to transform each value to an integer"
   },
   "distance": {
     "prefix": "30s_distance",
     "body": [
       "const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0);"
     ],
-    "description": "Returns the distance between two points."
+    "description": "Returns the distance between two points.\n\nUse `Math.hypot()` to calculate the Euclidean distance between two points"
   },
   "drop": {
     "prefix": "30s_drop",
     "body": [
       "const drop = (arr, n = 1) => arr.slice(n);"
     ],
-    "description": "Returns a new array with `n` elements removed from the left."
+    "description": "Returns a new array with `n` elements removed from the left.\n\nUse `Array.prototype.slice()` to slice the remove the specified number of elements from the left"
   },
   "dropRight": {
     "prefix": "30s_dropRight",
     "body": [
       "const dropRight = (arr, n = 1) => arr.slice(0, -n);"
     ],
-    "description": "Returns a new array with `n` elements removed from the right."
+    "description": "Returns a new array with `n` elements removed from the right.\n\nUse `Array.prototype.slice()` to slice the remove the specified number of elements from the right"
   },
   "dropRightWhile": {
     "prefix": "30s_dropRightWhile",
@@ -616,7 +616,7 @@
       "  return arr;",
       "};"
     ],
-    "description": "Removes elements from the end of an array until the passed function returns `true`. Returns the remaining elements in the array."
+    "description": "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"
   },
   "dropWhile": {
     "prefix": "30s_dropWhile",
@@ -626,14 +626,14 @@
       "  return arr;",
       "};"
     ],
-    "description": "Removes elements in an array until the passed function returns `true`. Returns the remaining elements in the array."
+    "description": "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"
   },
   "elementContains": {
     "prefix": "30s_elementContains",
     "body": [
       "const elementContains = (parent, child) => parent !== child && parent.contains(child);"
     ],
-    "description": "Returns `true` if the `parent` element contains the `child` element, `false` otherwise."
+    "description": "Returns `true` if the `parent` element contains the `child` element, `false` otherwise.\n\nCheck that `parent` is not the same element as `child`, use `parent.contains(child)` to check if the `parent` element contains the `child` element"
   },
   "elementIsVisibleInViewport": {
     "prefix": "30s_elementIsVisibleInViewport",
@@ -647,7 +647,7 @@
       "    : top >= 0 && left >= 0 && bottom <= innerHeight && right <= innerWidth;",
       "};"
     ],
-    "description": "Returns `true` if the element specified is visible in the viewport, `false` otherwise."
+    "description": "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"
   },
   "elo": {
     "prefix": "30s_elo",
@@ -669,7 +669,7 @@
       "  return ratings;",
       "};"
     ],
-    "description": "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\r\nof pre-ratings and returns an array containing post-ratings.\r\nThe array should be ordered from best performer to worst performer (winner -> loser)."
+    "description": "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"
   },
   "equals": {
     "prefix": "30s_equals",
@@ -685,7 +685,7 @@
       "  return keys.every(k => equals(a[k], b[k]));",
       "};"
     ],
-    "description": "Performs a deep comparison between two values to determine if they are equivalent."
+    "description": "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"
   },
   "escapeHTML": {
     "prefix": "30s_escapeHTML",
@@ -703,21 +703,21 @@
       "      }[tag] || tag)",
       "  );"
     ],
-    "description": "Escapes a string for use in HTML."
+    "description": "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)"
   },
   "escapeRegExp": {
     "prefix": "30s_escapeRegExp",
     "body": [
       "const escapeRegExp = str => str.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');"
     ],
-    "description": "Escapes a string to use in a regular expression."
+    "description": "Escapes a string to use in a regular expression.\n\nUse `String.prototype.replace()` to escape special characters"
   },
   "everyNth": {
     "prefix": "30s_everyNth",
     "body": [
       "const everyNth = (arr, nth) => arr.filter((e, i) => i % nth === nth - 1);"
     ],
-    "description": "Returns every nth element in an array."
+    "description": "Returns every nth element in an array.\n\nUse `Array.prototype.filter()` to create a new array that contains every nth element of a given array"
   },
   "extendHex": {
     "prefix": "30s_extendHex",
@@ -730,7 +730,7 @@
       "    .map(x => x + x)",
       "    .join('');"
     ],
-    "description": "Extends a 3-digit color code to a 6-digit color code."
+    "description": "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"
   },
   "factorial": {
     "prefix": "30s_factorial",
@@ -744,7 +744,7 @@
       "      ? 1",
       "      : n * factorial(n - 1);"
     ],
-    "description": "Calculates the factorial of a number."
+    "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"
   },
   "fibonacci": {
     "prefix": "30s_fibonacci",
@@ -755,14 +755,14 @@
       "    []",
       "  );"
     ],
-    "description": "Generates an array, containing the Fibonacci sequence, up until the nth term."
+    "description": "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"
   },
   "filterNonUnique": {
     "prefix": "30s_filterNonUnique",
     "body": [
       "const filterNonUnique = arr => arr.filter(i => arr.indexOf(i) === arr.lastIndexOf(i));"
     ],
-    "description": "Filters out the non-unique values in an array."
+    "description": "Filters out the non-unique values in an array.\n\nUse `Array.prototype.filter()` for an array containing only the unique values"
   },
   "filterNonUniqueBy": {
     "prefix": "30s_filterNonUniqueBy",
@@ -770,21 +770,21 @@
       "const filterNonUniqueBy = (arr, fn) =>",
       "  arr.filter((v, i) => arr.every((x, j) => (i === j) === fn(v, x, i, j)));"
     ],
-    "description": "Filters out the non-unique values in an array, based on a provided comparator function."
+    "description": "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"
   },
   "findKey": {
     "prefix": "30s_findKey",
     "body": [
       "const findKey = (obj, fn) => Object.keys(obj).find(key => fn(obj[key], key, obj));"
     ],
-    "description": "Returns the first key that satisfies the provided testing function. Otherwise `undefined` is returned."
+    "description": "Returns the first key that satisfies the provided testing function. Otherwise `undefined` is returned.\n\nUse `Object.keys(obj)` to get all the properties of the object, `Array.prototype.find()` to test the provided function for each key-value pair. The callback receives three arguments - the value, the key and the object"
   },
   "findLast": {
     "prefix": "30s_findLast",
     "body": [
       "const findLast = (arr, fn) => arr.filter(fn).pop();"
     ],
-    "description": "Returns the last element for which the provided function returns a truthy value."
+    "description": "Returns the last element for which the provided function returns a truthy value.\n\nUse `Array.prototype.filter()` to remove elements for which `fn` returns falsey values, `Array.prototype.pop()` to get the last one"
   },
   "findLastIndex": {
     "prefix": "30s_findLastIndex",
@@ -795,7 +795,7 @@
       "    .filter(([i, val]) => fn(val, i, arr))",
       "    .pop()[0];"
     ],
-    "description": "Returns the index of the last element for which the provided function returns a truthy value."
+    "description": "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 falsey values, `Array.prototype.pop()` to get the last one"
   },
   "findLastKey": {
     "prefix": "30s_findLastKey",
@@ -805,7 +805,7 @@
       "    .reverse()",
       "    .find(key => fn(obj[key], key, obj));"
     ],
-    "description": "Returns the last key that satisfies the provided testing function.\r\nOtherwise `undefined` is returned."
+    "description": "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"
   },
   "flatten": {
     "prefix": "30s_flatten",
@@ -813,7 +813,7 @@
       "const flatten = (arr, depth = 1) =>",
       "  arr.reduce((a, v) => a.concat(depth > 1 && Array.isArray(v) ? flatten(v, depth - 1) : v), []);"
     ],
-    "description": "Flattens an array up to the specified depth."
+    "description": "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)"
   },
   "flattenObject": {
     "prefix": "30s_flattenObject",
@@ -826,7 +826,7 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Flatten an object with the paths for keys."
+    "description": "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"
   },
   "flip": {
     "prefix": "30s_flip",
@@ -844,7 +844,7 @@
       "    .reverse()",
       "    .forEach(callback);"
     ],
-    "description": "Executes a provided function once for each array element, starting from the array's last element."
+    "description": "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"
   },
   "formatDuration": {
     "prefix": "30s_formatDuration",
@@ -864,14 +864,14 @@
       "    .join(', ');",
       "};"
     ],
-    "description": "Returns the human readable format of the given number of milliseconds."
+    "description": "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"
   },
   "forOwn": {
     "prefix": "30s_forOwn",
     "body": [
       "const forOwn = (obj, fn) => Object.keys(obj).forEach(key => fn(obj[key], key, obj));"
     ],
-    "description": "Iterates over all own properties of an object, running a callback for each one."
+    "description": "Iterates over all own properties of an object, running a callback for each one.\n\nUse `Object.keys(obj)` to get all the properties of the object, `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"
   },
   "forOwnRight": {
     "prefix": "30s_forOwnRight",
@@ -881,7 +881,7 @@
       "    .reverse()",
       "    .forEach(key => fn(obj[key], key, obj));"
     ],
-    "description": "Iterates over all own properties of an object in reverse, running a callback for each one."
+    "description": "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"
   },
   "fromCamelCase": {
     "prefix": "30s_fromCamelCase",
@@ -892,14 +892,14 @@
       "    .replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + separator + '$2')",
       "    .toLowerCase();"
     ],
-    "description": "Converts a string from camelcase."
+    "description": "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 `_`"
   },
   "functionName": {
     "prefix": "30s_functionName",
     "body": [
       "const functionName = fn => (console.debug(fn.name), fn);"
     ],
-    "description": "Logs the name of a function."
+    "description": "Logs the name of a function.\n\nUse `console.debug()` and the `name` property of the passed method to log the method's name to the `debug` channel of the console"
   },
   "functions": {
     "prefix": "30s_functions",
@@ -910,7 +910,7 @@
       "    : Object.keys(obj)",
       "  ).filter(key => typeof obj[key] === 'function');"
     ],
-    "description": "Returns an array of function property names from own (and optionally inherited) enumerable properties of an object."
+    "description": "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"
   },
   "gcd": {
     "prefix": "30s_gcd",
@@ -920,7 +920,7 @@
       "  return [...arr].reduce((a, b) => _gcd(a, b));",
       "};"
     ],
-    "description": "Calculates the greatest common divisor between two or more numbers/arrays."
+    "description": "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`"
   },
   "geometricProgression": {
     "prefix": "30s_geometricProgression",
@@ -930,7 +930,7 @@
       "    (v, i) => start * step ** i",
       "  );"
     ],
-    "description": "Initializes an array containing the numbers in the specified range where `start` and `end` are inclusive and the ratio between two terms is `step`.\r\nReturns an error if `step` equals `1`."
+    "description": "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`"
   },
   "get": {
     "prefix": "30s_get",
@@ -944,14 +944,14 @@
       "      .reduce((prev, cur) => prev && prev[cur], from)",
       "  );"
     ],
-    "description": "Retrieve a set of properties indicated by the given selectors from an object."
+    "description": "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"
   },
   "getColonTimeFromDate": {
     "prefix": "30s_getColonTimeFromDate",
     "body": [
       "const getColonTimeFromDate = date => date.toTimeString().slice(0, 8);"
     ],
-    "description": "Returns a string of the form `HH:MM:SS` from a `Date` object."
+    "description": "Returns a string of the form `HH:MM:SS` from a `Date` object.\n\nUse `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object"
   },
   "getDaysDiffBetweenDates": {
     "prefix": "30s_getDaysDiffBetweenDates",
@@ -959,7 +959,7 @@
       "const getDaysDiffBetweenDates = (dateInitial, dateFinal) =>",
       "  (dateFinal - dateInitial) / (1000 * 3600 * 24);"
     ],
-    "description": "Returns the difference (in days) between two dates."
+    "description": "Returns the difference (in days) between two dates.\n\nCalculate the difference (in days) between two `Date` objects"
   },
   "getImages": {
     "prefix": "30s_getImages",
@@ -969,7 +969,7 @@
       "  return includeDuplicates ? images : [...new Set(images)];",
       "};"
     ],
-    "description": "Fetches all images from within an element and puts them into an array"
+    "description": "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"
   },
   "getMeridiemSuffixOfInteger": {
     "prefix": "30s_getMeridiemSuffixOfInteger",
@@ -983,7 +983,7 @@
       "        ? (num % 12) + 'am'",
       "        : (num % 12) + 'pm';"
     ],
-    "description": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value."
+    "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"
   },
   "getScrollPosition": {
     "prefix": "30s_getScrollPosition",
@@ -993,14 +993,14 @@
       "  y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop",
       "});"
     ],
-    "description": "Returns the scroll position of the current page."
+    "description": "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`"
   },
   "getStyle": {
     "prefix": "30s_getStyle",
     "body": [
       "const getStyle = (el, ruleName) => getComputedStyle(el)[ruleName];"
     ],
-    "description": "Returns the value of a CSS rule for the specified element."
+    "description": "Returns the value of a CSS rule for the specified element.\n\nUse `Window.getComputedStyle()` to get the value of the CSS rule for the specified element"
   },
   "getType": {
     "prefix": "30s_getType",
@@ -1008,7 +1008,7 @@
       "const getType = v =>",
       "  v === undefined ? 'undefined' : v === null ? 'null' : v.constructor.name.toLowerCase();"
     ],
-    "description": "Returns the native type of a value."
+    "description": "Returns the native type of a value.\n\nReturns lowercased constructor name of value, `\"undefined\"` or `\"null\"` if value is `undefined` or `null`"
   },
   "getURLParameters": {
     "prefix": "30s_getURLParameters",
@@ -1019,7 +1019,7 @@
       "    {}",
       "  );"
     ],
-    "description": "Returns an object containing the parameters of the current URL."
+    "description": "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`"
   },
   "groupBy": {
     "prefix": "30s_groupBy",
@@ -1030,21 +1030,21 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Groups the elements of an array based on the given function."
+    "description": "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"
   },
   "hammingDistance": {
     "prefix": "30s_hammingDistance",
     "body": [
       "const hammingDistance = (num1, num2) => ((num1 ^ num2).toString(2).match(/1/g) || '').length;"
     ],
-    "description": "Calculates the Hamming distance between two values."
+    "description": "Calculates the Hamming distance between two values.\n\nUse XOR operator (`^`) to find the bit difference between the two numbers, convert to a binary string using `toString(2)`.\nCount and return the number of `1`s in the string, using `match(/1/g)`"
   },
   "hasClass": {
     "prefix": "30s_hasClass",
     "body": [
       "const hasClass = (el, className) => el.classList.contains(className);"
     ],
-    "description": "Returns `true` if the element has the specified class, `false` otherwise."
+    "description": "Returns `true` if the element has the specified class, `false` otherwise.\n\nUse `element.classList.contains()` to check if the element has the specified class"
   },
   "hasFlags": {
     "prefix": "30s_hasFlags",
@@ -1052,7 +1052,7 @@
       "const hasFlags = (...flags) =>",
       "  flags.every(flag => process.argv.includes(/^-{1,2}/.test(flag) ? flag : '--' + flag));"
     ],
-    "description": "Check if the current process's arguments contain the specified flags."
+    "description": "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"
   },
   "hashBrowser": {
     "prefix": "30s_hashBrowser",
@@ -1066,7 +1066,7 @@
       "    return hexes.join('');",
       "  });"
     ],
-    "description": "Creates a hash for a value using the [SHA-256](https://en.wikipedia.org/wiki/SHA-2) algorithm. Returns a promise."
+    "description": "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"
   },
   "hashNode": {
     "prefix": "30s_hashNode",
@@ -1086,14 +1086,14 @@
       "    )",
       "  );"
     ],
-    "description": "Creates a hash for a value using the [SHA-256](https://en.wikipedia.org/wiki/SHA-2) algorithm. Returns a promise."
+    "description": "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"
   },
   "head": {
     "prefix": "30s_head",
     "body": [
       "const head = arr => arr[0];"
     ],
-    "description": "Returns the head of a list."
+    "description": "Returns the head of a list.\n\nUse `arr[0]` to return the first element of the passed array"
   },
   "hexToRGB": {
     "prefix": "30s_hexToRGB",
@@ -1118,14 +1118,14 @@
       "  );",
       "};"
     ],
-    "description": "Converts a color code to a `rgb()` or `rgba()` string if alpha value is provided."
+    "description": "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"
   },
   "hide": {
     "prefix": "30s_hide",
     "body": [
       "const hide = els => els.forEach(e => (e.style.display = 'none'));"
     ],
-    "description": "Hides all the elements specified."
+    "description": "Hides all the elements specified.\n\nUse `NodeList.prototype.forEach()` to apply `display: none` to each element specified"
   },
   "httpGet": {
     "prefix": "30s_httpGet",
@@ -1138,7 +1138,7 @@
       "  request.send();",
       "};"
     ],
-    "description": "Makes a `GET` request to the passed URL."
+    "description": "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"
   },
   "httpPost": {
     "prefix": "30s_httpPost",
@@ -1152,7 +1152,7 @@
       "  request.send(data);",
       "};"
     ],
-    "description": "Makes a `POST` request to the passed URL."
+    "description": "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"
   },
   "httpsRedirect": {
     "prefix": "30s_httpsRedirect",
@@ -1161,7 +1161,7 @@
       "  if (location.protocol !== 'https:') location.replace('https://' + location.href.split('//')[1]);",
       "};"
     ],
-    "description": "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."
+    "description": "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"
   },
   "hz": {
     "prefix": "30s_hz",
@@ -1172,28 +1172,28 @@
       "  return (1000 * iterations) / (performance.now() - before);",
       "};"
     ],
-    "description": "Returns the number of times a function executed per second. \r\n`hz` is the unit for `hertz`, the unit of frequency defined as one cycle per second."
+    "description": "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"
   },
   "indentString": {
     "prefix": "30s_indentString",
     "body": [
       "const indentString = (str, count, indent = ' ') => str.replace(/^/gm, indent.repeat(count));"
     ],
-    "description": "Indents each line in the provided string."
+    "description": "Indents each line in the provided string.\n\nUse `String.replace` and a regular expression to add the character specified by `indent` `count` times at the start of each line.\nOmit the third parameter, `indent`, to use a default indentation character of `' '`"
   },
   "indexOfAll": {
     "prefix": "30s_indexOfAll",
     "body": [
       "const indexOfAll = (arr, val) => arr.reduce((acc, el, i) => (el === val ? [...acc, i] : acc), []);"
     ],
-    "description": "Returns all indices of `val` in an array.\r\nIf `val` never occurs, returns `[]`."
+    "description": "Returns all indices of `val` in an array.\nIf `val` never occurs, returns `[]`.\n\nUse `Array.prototype.reduce()` to loop over elements and store indices for matching elements.\nReturn the array of indices"
   },
   "initial": {
     "prefix": "30s_initial",
     "body": [
       "const initial = arr => arr.slice(0, -1);"
     ],
-    "description": "Returns all the elements of an array except the last one."
+    "description": "Returns all the elements of an array except the last one.\n\nUse `arr.slice(0,-1)` to return all but the last element of the array"
   },
   "initialize2DArray": {
     "prefix": "30s_initialize2DArray",
@@ -1201,7 +1201,7 @@
       "const initialize2DArray = (w, h, val = null) =>",
       "  Array.from({ length: h }).map(() => Array.from({ length: w }).fill(val));"
     ],
-    "description": "Initializes a 2D array of given width and height and value."
+    "description": "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`"
   },
   "initializeArrayWithRange": {
     "prefix": "30s_initializeArrayWithRange",
@@ -1209,7 +1209,7 @@
       "const initializeArrayWithRange = (end, start = 0, step = 1) =>",
       "  Array.from({ length: Math.ceil((end - start + 1) / step) }, (v, i) => i * step + start);"
     ],
-    "description": "Initializes an array containing the numbers in the specified range where `start` and `end` are inclusive with their common difference `step`."
+    "description": "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`"
   },
   "initializeArrayWithRangeRight": {
     "prefix": "30s_initializeArrayWithRangeRight",
@@ -1219,14 +1219,14 @@
       "    (v, i, arr) => (arr.length - i - 1) * step + start",
       "  );"
     ],
-    "description": "Initializes an array containing the numbers in the specified range (in reverse) where `start` and `end` are inclusive with their common difference `step`."
+    "description": "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`"
   },
   "initializeArrayWithValues": {
     "prefix": "30s_initializeArrayWithValues",
     "body": [
       "const initializeArrayWithValues = (n, val = 0) => Array(n).fill(val);"
     ],
-    "description": "Initializes and fills an array with the specified values."
+    "description": "Initializes and fills an array with the specified values.\n\nUse `Array(n)` to create an array of the desired length, `fill(v)` to fill it with the desired values.\nYou can omit `val` to use a default value of `0`"
   },
   "initializeNDArray": {
     "prefix": "30s_initializeNDArray",
@@ -1236,7 +1236,7 @@
       "    ? val",
       "    : Array.from({ length: args[0] }).map(() => initializeNDArray(val, ...args.slice(1)));"
     ],
-    "description": "Create a n-dimensional array with given value."
+    "description": "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`"
   },
   "inRange": {
     "prefix": "30s_inRange",
@@ -1246,21 +1246,21 @@
       "  return end == null ? n >= 0 && n < start : n >= start && n < end;",
       "};"
     ],
-    "description": "Checks if the given number falls within the given range."
+    "description": "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`"
   },
   "insertAfter": {
     "prefix": "30s_insertAfter",
     "body": [
       "const insertAfter = (el, htmlString) => el.insertAdjacentHTML('afterend', htmlString);"
     ],
-    "description": "Inserts an HTML string after the end of the specified element."
+    "description": "Inserts an HTML string after the end of the specified element.\n\nUse `el.insertAdjacentHTML()` with a position of `'afterend'` to parse `htmlString` and insert it after the end of `el`"
   },
   "insertBefore": {
     "prefix": "30s_insertBefore",
     "body": [
       "const insertBefore = (el, htmlString) => el.insertAdjacentHTML('beforebegin', htmlString);"
     ],
-    "description": "Inserts an HTML string before the start of the specified element."
+    "description": "Inserts an HTML string before the start of the specified element.\n\nUse `el.insertAdjacentHTML()` with a position of `'beforebegin'` to parse `htmlString` and insert it before the start of `el`"
   },
   "intersection": {
     "prefix": "30s_intersection",
@@ -1270,7 +1270,7 @@
       "  return a.filter(x => s.has(x));",
       "};"
     ],
-    "description": "Returns a list of elements that exist in both arrays."
+    "description": "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`"
   },
   "intersectionBy": {
     "prefix": "30s_intersectionBy",
@@ -1280,14 +1280,14 @@
       "  return a.filter(x => s.has(fn(x)));",
       "};"
     ],
-    "description": "Returns a list of elements that exist in both arrays, after applying the provided function to each array element of both."
+    "description": "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"
   },
   "intersectionWith": {
     "prefix": "30s_intersectionWith",
     "body": [
       "const intersectionWith = (a, b, comp) => a.filter(x => b.findIndex(y => comp(x, y)) !== -1);"
     ],
-    "description": "Returns a list of elements that exist in both arrays, using a provided comparator function."
+    "description": "Returns a list of elements that exist in both arrays, using a provided comparator function.\n\nUse `Array.prototype.filter()` and `Array.prototype.findIndex()` in combination with the provided comparator to determine intersecting values"
   },
   "invertKeyValues": {
     "prefix": "30s_invertKeyValues",
@@ -1300,28 +1300,28 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "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."
+    "description": "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"
   },
   "is": {
     "prefix": "30s_is",
     "body": [
       "const is = (type, val) => ![, null].includes(val) && val.constructor === type;"
     ],
-    "description": "Checks if the provided value is of the specified type."
+    "description": "Checks if the provided value is of the specified type.\n\nEnsure the value is not `undefined` or `null` using `Array.prototype.includes()`, and compare the `constructor` property on the value with `type` to check if the provided value is of the specified `type`"
   },
   "isAbsoluteURL": {
     "prefix": "30s_isAbsoluteURL",
     "body": [
       "const isAbsoluteURL = str => /^[a-z][a-z0-9+.-]*:/.test(str);"
     ],
-    "description": "Returns `true` if the given string is an absolute URL, `false` otherwise."
+    "description": "Returns `true` if the given string is an absolute URL, `false` otherwise.\n\nUse a regular expression to test if the string is an absolute URL"
   },
   "isAfterDate": {
     "prefix": "30s_isAfterDate",
     "body": [
       "const isAfterDate = (dateA, dateB) => dateA > dateB;"
     ],
-    "description": "Check if a date is after another date."
+    "description": "Check if a date is after another date.\n\nUse the greater than operator (`>`) to check if the first date comes after the second one"
   },
   "isAnagram": {
     "prefix": "30s_isAnagram",
@@ -1337,49 +1337,49 @@
       "  return normalize(str1) === normalize(str2);",
       "};"
     ],
-    "description": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters)."
+    "description": "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"
   },
   "isArrayLike": {
     "prefix": "30s_isArrayLike",
     "body": [
       "const isArrayLike = obj => obj != null && typeof obj[Symbol.iterator] === 'function';"
     ],
-    "description": "Checks if the provided argument is array-like (i.e. is iterable)."
+    "description": "Checks if the provided argument is array-like (i.e. is iterable).\n\nCheck if the provided argument is not `null` and that its `Symbol.iterator` property is a function"
   },
   "isBeforeDate": {
     "prefix": "30s_isBeforeDate",
     "body": [
       "const isBeforeDate = (dateA, dateB) => dateA < dateB;"
     ],
-    "description": "Check if a date is before another date."
+    "description": "Check if a date is before another date.\n\nUse the less than operator (`<`) to check if the first date comes before the second one"
   },
   "isBoolean": {
     "prefix": "30s_isBoolean",
     "body": [
       "const isBoolean = val => typeof val === 'boolean';"
     ],
-    "description": "Checks if the given argument is a native boolean element."
+    "description": "Checks if the given argument is a native boolean element.\n\nUse `typeof` to check if a value is classified as a boolean primitive"
   },
   "isBrowser": {
     "prefix": "30s_isBrowser",
     "body": [
       "const isBrowser = () => ![typeof window, typeof document].includes('undefined');"
     ],
-    "description": "Determines if the current runtime environment is a browser so that front-end modules can run on the server (Node) without throwing errors."
+    "description": "Determines if the current runtime environment is a browser so that front-end modules can run on the server (Node) without throwing errors.\n\nUse `Array.prototype.includes()` on the `typeof` values of both `window` and `document` (globals usually only available in a browser environment unless they were explicitly defined), which will return `true` if one of them is `undefined`.\n`typeof` allows globals to be checked for existence without throwing a `ReferenceError`.\nIf both of them are not `undefined`, then the current environment is assumed to be a browser"
   },
   "isBrowserTabFocused": {
     "prefix": "30s_isBrowserTabFocused",
     "body": [
       "const isBrowserTabFocused = () => !document.hidden;"
     ],
-    "description": "Returns `true` if the browser tab of the page is focused, `false` otherwise."
+    "description": "Returns `true` if the browser tab of the page is focused, `false` otherwise.\n\nUse the `Document.hidden` property, introduced by the Page Visibility API to check if the browser tab of the page is visible or hidden"
   },
   "isDivisible": {
     "prefix": "30s_isDivisible",
     "body": [
       "const isDivisible = (dividend, divisor) => dividend % divisor === 0;"
     ],
-    "description": "Checks if the first numeric argument is divisible by the second one."
+    "description": "Checks if the first numeric argument is divisible by the second one.\n\nUse the modulo operator (`%`) to check if the remainder is equal to `0`"
   },
   "isDuplexStream": {
     "prefix": "30s_isDuplexStream",
@@ -1393,77 +1393,77 @@
       "  typeof val._write === 'function' &&",
       "  typeof val._writableState === 'object';"
     ],
-    "description": "Checks if the given argument is a duplex (readable and writable) stream."
+    "description": "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"
   },
   "isEmpty": {
     "prefix": "30s_isEmpty",
     "body": [
       "const isEmpty = val => val == null || !(Object.keys(val) || val).length;"
     ],
-    "description": "Returns true if the a value is an empty object, collection, map or set, has no enumerable properties or is any type that is not considered a collection."
+    "description": "Returns true if the a value is an empty object, collection, map or set, has no enumerable properties or is any type that is not considered a collection.\n\nCheck if the provided value is `null` or if its `length` is equal to `0`"
   },
   "isEven": {
     "prefix": "30s_isEven",
     "body": [
       "const isEven = num => num % 2 === 0;"
     ],
-    "description": "Returns `true` if the given number is even, `false` otherwise."
+    "description": "Returns `true` if the given number is even, `false` otherwise.\n\nChecks whether a number is odd or even using the modulo (`%`) operator.\nReturns `true` if the number is even, `false` if the number is odd"
   },
   "isFunction": {
     "prefix": "30s_isFunction",
     "body": [
       "const isFunction = val => typeof val === 'function';"
     ],
-    "description": "Checks if the given argument is a function."
+    "description": "Checks if the given argument is a function.\n\nUse `typeof` to check if a value is classified as a function primitive"
   },
   "isLowerCase": {
     "prefix": "30s_isLowerCase",
     "body": [
       "const isLowerCase = str => str === str.toLowerCase();"
     ],
-    "description": "Checks if a string is lower case."
+    "description": "Checks if a string is lower case.\n\nConvert the given string to lower case, using `String.toLowerCase()` and compare it to the original"
   },
   "isNil": {
     "prefix": "30s_isNil",
     "body": [
       "const isNil = val => val === undefined || val === null;"
     ],
-    "description": "Returns `true` if the specified value is `null` or `undefined`, `false` otherwise."
+    "description": "Returns `true` if the specified value is `null` or `undefined`, `false` otherwise.\n\nUse the strict equality operator to check if the value and of `val` are equal to `null` or `undefined`"
   },
   "isNull": {
     "prefix": "30s_isNull",
     "body": [
       "const isNull = val => val === null;"
     ],
-    "description": "Returns `true` if the specified value is `null`, `false` otherwise."
+    "description": "Returns `true` if the specified value is `null`, `false` otherwise.\n\nUse the strict equality operator to check if the value and of `val` are equal to `null`"
   },
   "isNumber": {
     "prefix": "30s_isNumber",
     "body": [
       "const isNumber = val => typeof val === 'number';"
     ],
-    "description": "Checks if the given argument is a number."
+    "description": "Checks if the given argument is a number.\n\nUse `typeof` to check if a value is classified as a number primitive"
   },
   "isObject": {
     "prefix": "30s_isObject",
     "body": [
       "const isObject = obj => obj === Object(obj);"
     ],
-    "description": "Returns a boolean determining if the passed value is an object or not."
+    "description": "Returns a boolean determining if the passed value is an object or not.\n\nUses the  `Object` constructor to create an object wrapper for the given value. \nIf the value is `null` or `undefined`, create and return an empty object. Οtherwise, return an object of a type that corresponds to the given value"
   },
   "isObjectLike": {
     "prefix": "30s_isObjectLike",
     "body": [
       "const isObjectLike = val => val !== null && typeof val === 'object';"
     ],
-    "description": "Checks if a value is object-like."
+    "description": "Checks if a value is object-like.\n\nCheck if the provided value is not `null` and its `typeof` is equal to `'object'`"
   },
   "isPlainObject": {
     "prefix": "30s_isPlainObject",
     "body": [
       "const isPlainObject = val => !!val && typeof val === 'object' && val.constructor === Object;"
     ],
-    "description": "Checks if the provided value is an object created by the Object constructor."
+    "description": "Checks if the provided value is an object created by the Object constructor.\n\nCheck if the provided value is truthy, use `typeof` to check if it is an object and `Object.constructor` to make sure the constructor is equal to `Object`"
   },
   "isPrime": {
     "prefix": "30s_isPrime",
@@ -1474,14 +1474,14 @@
       "  return num >= 2;",
       "};"
     ],
-    "description": "Checks if the provided integer is a prime number."
+    "description": "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`"
   },
   "isPrimitive": {
     "prefix": "30s_isPrimitive",
     "body": [
       "const isPrimitive = val => Object(val) !== val;"
     ],
-    "description": "Returns a boolean determining if the passed value is primitive or not."
+    "description": "Returns a boolean determining if the passed value is primitive or not.\n\nCreate an object from `val` and compare it with `val` to determine if the passed value is primitive (i.e. not equal to the created object)"
   },
   "isPromiseLike": {
     "prefix": "30s_isPromiseLike",
@@ -1491,7 +1491,7 @@
       "  (typeof obj === 'object' || typeof obj === 'function') &&",
       "  typeof obj.then === 'function';"
     ],
-    "description": "Returns `true` if an object looks like a [`Promise`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise), `false` otherwise."
+    "description": "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`"
   },
   "isReadableStream": {
     "prefix": "30s_isReadableStream",
@@ -1503,14 +1503,14 @@
       "  typeof val._read === 'function' &&",
       "  typeof val._readableState === 'object';"
     ],
-    "description": "Checks if the given argument is a readable stream."
+    "description": "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"
   },
   "isSameDate": {
     "prefix": "30s_isSameDate",
     "body": [
       "const isSameDate = (dateA, dateB) => dateA.toISOString() === dateB.toISOString();"
     ],
-    "description": "Check if a date is the same as another date."
+    "description": "Check if a date is the same as another date.\n\nUse `Date.prototype.toISOString()` and strict equality checking (`===`) to check if the first date is the same as the second one"
   },
   "isSorted": {
     "prefix": "30s_isSorted",
@@ -1524,49 +1524,49 @@
       "  }",
       "};"
     ],
-    "description": "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."
+    "description": "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"
   },
   "isStream": {
     "prefix": "30s_isStream",
     "body": [
       "const isStream = val => val !== null && typeof val === 'object' && typeof val.pipe === 'function';"
     ],
-    "description": "Checks if the given argument is a stream."
+    "description": "Checks if the given argument is a 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`"
   },
   "isString": {
     "prefix": "30s_isString",
     "body": [
       "const isString = val => typeof val === 'string';"
     ],
-    "description": "Checks if the given argument is a string. Only works for string primitives."
+    "description": "Checks if the given argument is a string. Only works for string primitives.\n\nUse `typeof` to check if a value is classified as a string primitive"
   },
   "isSymbol": {
     "prefix": "30s_isSymbol",
     "body": [
       "const isSymbol = val => typeof val === 'symbol';"
     ],
-    "description": "Checks if the given argument is a symbol."
+    "description": "Checks if the given argument is a symbol.\n\nUse `typeof` to check if a value is classified as a symbol primitive"
   },
   "isTravisCI": {
     "prefix": "30s_isTravisCI",
     "body": [
       "const isTravisCI = () => 'TRAVIS' in process.env && 'CI' in process.env;"
     ],
-    "description": "Checks if the current environment is [Travis CI](https://travis-ci.org/)."
+    "description": "Checks if the current environment is [Travis CI](https://travis-ci.org/).\n\nChecks if the current environment has the `TRAVIS` and `CI` environment variables ([reference](https://docs.travis-ci.com/user/environment-variables/#Default-Environment-Variables))"
   },
   "isUndefined": {
     "prefix": "30s_isUndefined",
     "body": [
       "const isUndefined = val => val === undefined;"
     ],
-    "description": "Returns `true` if the specified value is `undefined`, `false` otherwise."
+    "description": "Returns `true` if the specified value is `undefined`, `false` otherwise.\n\nUse the strict equality operator to check if the value and of `val` are equal to `undefined`"
   },
   "isUpperCase": {
     "prefix": "30s_isUpperCase",
     "body": [
       "const isUpperCase = str => str === str.toUpperCase();"
     ],
-    "description": "Checks if a string is upper case."
+    "description": "Checks if a string is upper case.\n\nConvert the given string to upper case, using `String.prototype.toUpperCase()` and compare it to the original"
   },
   "isValidJSON": {
     "prefix": "30s_isValidJSON",
@@ -1580,7 +1580,7 @@
       "  }",
       "};"
     ],
-    "description": "Checks if the provided argument is a valid JSON."
+    "description": "Checks if the provided argument is a valid JSON.\n\nUse `JSON.parse()` and a `try... catch` block to check if the provided argument is a valid JSON"
   },
   "isWritableStream": {
     "prefix": "30s_isWritableStream",
@@ -1592,7 +1592,7 @@
       "  typeof val._write === 'function' &&",
       "  typeof val._writableState === 'object';"
     ],
-    "description": "Checks if the given argument is a writable stream."
+    "description": "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"
   },
   "join": {
     "prefix": "30s_join",
@@ -1608,7 +1608,7 @@
       "    ''",
       "  );"
     ],
-    "description": "Joins all elements of an array into a string and returns this string.\r\nUses a separator and an end separator."
+    "description": "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"
   },
   "JSONtoCSV": {
     "prefix": "30s_JSONtoCSV",
@@ -1624,7 +1624,7 @@
       "    )",
       "  ].join('\\n');"
     ],
-    "description": "Converts an array of objects to a comma-separated values (CSV) string that contains only the `columns` specified."
+    "description": "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 `,`"
   },
   "JSONToFile": {
     "prefix": "30s_JSONToFile",
@@ -1633,14 +1633,14 @@
       "const JSONToFile = (obj, filename) =>",
       "  fs.writeFile(`${filename}.json`, JSON.stringify(obj, null, 2));"
     ],
-    "description": "Writes a JSON object to a file."
+    "description": "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"
   },
   "last": {
     "prefix": "30s_last",
     "body": [
       "const last = arr => arr[arr.length - 1];"
     ],
-    "description": "Returns the last element in an array."
+    "description": "Returns the last element in an array.\n\nUse `arr.length - 1` to compute the index of the last element of the given array and returning it"
   },
   "lcm": {
     "prefix": "30s_lcm",
@@ -1651,14 +1651,14 @@
       "  return [...arr].reduce((a, b) => _lcm(a, b));",
       "};"
     ],
-    "description": "Returns the least common multiple of two or more numbers."
+    "description": "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"
   },
   "longestItem": {
     "prefix": "30s_longestItem",
     "body": [
       "const longestItem = (...vals) => vals.reduce((a, x) => (x.length > a.length ? x : a));"
     ],
-    "description": "Takes any number of iterable objects or objects with a `length` property and returns the longest one.\r\nIf multiple objects have the same length, the first one will be returned.\r\nReturns `undefined` if no arguments are provided."
+    "description": "Takes any number of iterable objects or objects with a `length` property and returns the longest one.\nIf multiple objects have the same length, the first one will be returned.\nReturns `undefined` if no arguments are provided.\n\nUse `Array.prototype.reduce()`, comparing the `length` of objects to find the longest one"
   },
   "lowercaseKeys": {
     "prefix": "30s_lowercaseKeys",
@@ -1669,7 +1669,7 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Creates a new object from the specified object, where all the keys are in lowercase."
+    "description": "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()`"
   },
   "luhnCheck": {
     "prefix": "30s_luhnCheck",
@@ -1685,7 +1685,7 @@
       "  return sum % 10 === 0;",
       "};"
     ],
-    "description": "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."
+    "description": "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"
   },
   "mapKeys": {
     "prefix": "30s_mapKeys",
@@ -1696,7 +1696,7 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Creates an object with keys generated by running the provided function for each key and the same values as the provided object."
+    "description": "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`"
   },
   "mapObject": {
     "prefix": "30s_mapObject",
@@ -1706,7 +1706,7 @@
       "    (a = [arr, arr.map(fn)]), a[0].reduce((acc, val, ind) => ((acc[val] = a[1][ind]), acc), {})",
       "  ))();"
     ],
-    "description": "Maps the values of an array to an object using a function, where the key-value pairs consist of the original value as the key and the mapped value."
+    "description": "Maps the values of an array to an object using a function, where the key-value pairs consist of the original 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)"
   },
   "mapString": {
     "prefix": "30s_mapString",
@@ -1717,7 +1717,7 @@
       "    .map((c, i) => fn(c, i, str))",
       "    .join('');"
     ],
-    "description": "Creates a new string with the results of calling a provided function on every character in the calling string."
+    "description": "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)"
   },
   "mapValues": {
     "prefix": "30s_mapValues",
@@ -1728,14 +1728,14 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Creates an object with the same keys as the provided object and values generated by running the provided function for each value."
+    "description": "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`"
   },
   "mask": {
     "prefix": "30s_mask",
     "body": [
       "const mask = (cc, num = 4, mask = '*') => `${cc}`.slice(-num).padStart(`${cc}`.length, mask);"
     ],
-    "description": "Replaces all but the last `num` of characters with the specified mask character."
+    "description": "Replaces all but the last `num` of characters with the specified mask character.\n\nUse `String.prototype.slice()` to grab the portion of the characters that will remain unmasked and use `String.padStart()` to fill the beginning of the string with the mask character up to the original length.\nOmit the second argument, `num`, to keep a default of `4` characters unmasked. If `num` is negative, the unmasked characters will be at the start of the string.\nOmit the third argument, `mask`, to use a default character of `'*'` for the mask"
   },
   "matches": {
     "prefix": "30s_matches",
@@ -1743,7 +1743,7 @@
       "const matches = (obj, source) =>",
       "  Object.keys(source).every(key => obj.hasOwnProperty(key) && obj[key] === source[key]);"
     ],
-    "description": "Compares two objects to determine if the first one contains equivalent property values to the second one."
+    "description": "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"
   },
   "matchesWith": {
     "prefix": "30s_matchesWith",
@@ -1756,28 +1756,28 @@
       "        : obj[key] == source[key]",
       "  );"
     ],
-    "description": "Compares two objects to determine if the first one contains equivalent property values to the second one, based on a provided function."
+    "description": "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"
   },
   "maxBy": {
     "prefix": "30s_maxBy",
     "body": [
       "const maxBy = (arr, fn) => Math.max(...arr.map(typeof fn === 'function' ? fn : val => val[fn]));"
     ],
-    "description": "Returns the maximum value of an array, after mapping each element to a value using the provided function."
+    "description": "Returns the maximum value 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`, `Math.max()` to get the maximum value"
   },
   "maxDate": {
     "prefix": "30s_maxDate",
     "body": [
       "const maxDate = (...dates) => new Date(Math.max.apply(null, ...dates));"
     ],
-    "description": "Returns the maximum of the given dates."
+    "description": "Returns the maximum of the given dates.\n\nUse `Math.max.apply()` to find the maximum date value, `new Date()` to convert it to a `Date` object"
   },
   "maxN": {
     "prefix": "30s_maxN",
     "body": [
       "const maxN = (arr, n = 1) => [...arr].sort((a, b) => b - a).slice(0, n);"
     ],
-    "description": "Returns the `n` maximum elements from the provided array.\r\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in descending order)."
+    "description": "Returns the `n` maximum elements from the provided array.\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in descending order).\n\nUse `Array.prototype.sort()` combined with the spread operator (`...`) to create a shallow clone of the array and sort it in descending order.\nUse `Array.prototype.slice()` to get the specified number of elements.\nOmit the second argument, `n`, to get a one-element array"
   },
   "median": {
     "prefix": "30s_median",
@@ -1788,7 +1788,7 @@
       "  return arr.length % 2 !== 0 ? nums[mid] : (nums[mid - 1] + nums[mid]) / 2;",
       "};"
     ],
-    "description": "Returns the median of an array of numbers."
+    "description": "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"
   },
   "memoize": {
     "prefix": "30s_memoize",
@@ -1802,7 +1802,7 @@
       "  return cached;",
       "};"
     ],
-    "description": "Returns the memoized (cached) function."
+    "description": "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"
   },
   "merge": {
     "prefix": "30s_merge",
@@ -1817,28 +1817,28 @@
       "    {}",
       "  );"
     ],
-    "description": "Creates a new object from the combination of two or more objects."
+    "description": "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"
   },
   "minBy": {
     "prefix": "30s_minBy",
     "body": [
       "const minBy = (arr, fn) => Math.min(...arr.map(typeof fn === 'function' ? fn : val => val[fn]));"
     ],
-    "description": "Returns the minimum value of an array, after mapping each element to a value using the provided function."
+    "description": "Returns the minimum value 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`, `Math.min()` to get the maximum value"
   },
   "minDate": {
     "prefix": "30s_minDate",
     "body": [
       "const minDate = (...dates) => new Date(Math.min.apply(null, ...dates));"
     ],
-    "description": "Returns the minimum of the given dates."
+    "description": "Returns the minimum of the given dates.\n\nUse `Math.min.apply()` to find the minimum date value, `new Date()` to convert it to a `Date` object"
   },
   "minN": {
     "prefix": "30s_minN",
     "body": [
       "const minN = (arr, n = 1) => [...arr].sort((a, b) => a - b).slice(0, n);"
     ],
-    "description": "Returns the `n` minimum elements from the provided array.\r\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in ascending order)."
+    "description": "Returns the `n` minimum elements from the provided array.\nIf `n` is greater than or equal to the provided array's length, then return the original array (sorted in ascending order).\n\nUse `Array.prototype.sort()` combined with the spread operator (`...`) to create a shallow clone of the array and sort it in ascending order.\nUse `Array.prototype.slice()` to get the specified number of elements.\nOmit the second argument, `n`, to get a one-element array"
   },
   "mostPerformant": {
     "prefix": "30s_mostPerformant",
@@ -1852,14 +1852,14 @@
       "  return times.indexOf(Math.min(...times));",
       "};"
     ],
-    "description": "Returns the index of the function in an array of functions which executed the fastest."
+    "description": "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"
   },
   "negate": {
     "prefix": "30s_negate",
     "body": [
       "const negate = func => (...args) => !func(...args);"
     ],
-    "description": "Negates a predicate function."
+    "description": "Negates a predicate function.\n\nTake a predicate function and apply the not operator (`!`) to it with its arguments"
   },
   "nest": {
     "prefix": "30s_nest",
@@ -1869,49 +1869,49 @@
       "    .filter(item => item[link] === id)",
       "    .map(item => ({ ...item, children: nest(items, item.id) }));"
     ],
-    "description": "Given a flat array of objects linked to one another, it will nest them recursively.\r\nUseful for nesting comments, such as the ones on reddit.com."
+    "description": "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`"
   },
   "nodeListToArray": {
     "prefix": "30s_nodeListToArray",
     "body": [
       "const nodeListToArray = nodeList => [...nodeList];"
     ],
-    "description": "Converts a `NodeList` to an array."
+    "description": "Converts a `NodeList` to an array.\n\nUse spread operator inside new array to convert a `NodeList` to an array"
   },
   "none": {
     "prefix": "30s_none",
     "body": [
       "const none = (arr, fn = Boolean) => !arr.some(fn);"
     ],
-    "description": "Returns `true` if the provided predicate function returns `false` for all elements in a collection, `false` otherwise."
+    "description": "Returns `true` if the provided predicate function returns `false` for all elements in a collection, `false` otherwise.\n\nUse `Array.prototype.some()` to test if any elements in the collection return `true` based on `fn`.\nOmit the second argument, `fn`, to use `Boolean` as a default"
   },
   "nthArg": {
     "prefix": "30s_nthArg",
     "body": [
       "const nthArg = n => (...args) => args.slice(n)[0];"
     ],
-    "description": "Creates a function that gets the argument at index `n`. If `n` is negative, the nth argument from the end is returned."
+    "description": "Creates a function that gets the argument at index `n`. If `n` is negative, the nth argument from the end is returned.\n\nUse `Array.prototype.slice()` to get the desired argument at index `n`"
   },
   "nthElement": {
     "prefix": "30s_nthElement",
     "body": [
       "const nthElement = (arr, n = 0) => (n === -1 ? arr.slice(n) : arr.slice(n, n + 1))[0];"
     ],
-    "description": "Returns the nth element of an array."
+    "description": "Returns the nth element of an array.\n\nUse `Array.prototype.slice()` to get an array containing the nth element at the first place.\nIf the index is out of bounds, return `undefined`.\nOmit the second argument, `n`, to get the first element of the array"
   },
   "objectFromPairs": {
     "prefix": "30s_objectFromPairs",
     "body": [
       "const objectFromPairs = arr => arr.reduce((a, [key, val]) => ((a[key] = val), a), {});"
     ],
-    "description": "Creates an object from the given key-value pairs."
+    "description": "Creates an object from the given key-value pairs.\n\nUse `Array.prototype.reduce()` to create and combine key-value pairs"
   },
   "objectToPairs": {
     "prefix": "30s_objectToPairs",
     "body": [
       "const objectToPairs = obj => Object.keys(obj).map(k => [k, obj[k]]);"
     ],
-    "description": "Creates an array of key-value pair arrays from an object."
+    "description": "Creates an array of key-value pair arrays from an object.\n\nUse `Object.keys()` and `Array.prototype.map()` to iterate over the object's keys and produce an array with key-value pairs"
   },
   "observeMutations": {
     "prefix": "30s_observeMutations",
@@ -1935,21 +1935,21 @@
       "  return observer;",
       "};"
     ],
-    "description": "Returns a new MutationObserver and runs the provided callback for each mutation on the specified element."
+    "description": "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`)"
   },
   "off": {
     "prefix": "30s_off",
     "body": [
       "const off = (el, evt, fn, opts = false) => el.removeEventListener(evt, fn, opts);"
     ],
-    "description": "Removes an event listener from an element."
+    "description": "Removes an event listener from an element.\n\nUse `EventTarget.removeEventListener()` to remove an event listener from an element. \nOmit the fourth argument `opts` to use `false` or specify it based on the options used when the event listener was added"
   },
   "offset": {
     "prefix": "30s_offset",
     "body": [
       "const offset = (arr, offset) => [...arr.slice(offset), ...arr.slice(0, offset)];"
     ],
-    "description": "Moves the specified amount of elements to the end of the array."
+    "description": "Moves the specified amount of elements to the end of the array.\n\nUse `Array.prototype.slice()` twice to get the elements after the specified index and the elements before that.\nUse the spread operator(`...`) to combine the two into one array.\nIf `offset` is negative, the elements will be moved from end to start"
   },
   "omit": {
     "prefix": "30s_omit",
@@ -1959,7 +1959,7 @@
       "    .filter(k => !arr.includes(k))",
       "    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});"
     ],
-    "description": "Omits the key-value pairs corresponding to the given keys from an object."
+    "description": "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"
   },
   "omitBy": {
     "prefix": "30s_omitBy",
@@ -1969,7 +1969,7 @@
       "    .filter(k => !fn(obj[k], k))",
       "    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});"
     ],
-    "description": "Creates an object composed of the properties the given function returns falsey for. The function is invoked with two arguments: (value, key)."
+    "description": "Creates an object composed of the properties the given function returns falsey 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"
   },
   "on": {
     "prefix": "30s_on",
@@ -1980,7 +1980,7 @@
       "  if (opts.target) return delegatorFn;",
       "};"
     ],
-    "description": "Adds an event listener to an element with the ability to use event delegation."
+    "description": "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"
   },
   "once": {
     "prefix": "30s_once",
@@ -1994,7 +1994,7 @@
       "  };",
       "};"
     ],
-    "description": "Ensures a function is called only once."
+    "description": "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"
   },
   "onUserInputChange": {
     "prefix": "30s_onUserInputChange",
@@ -2014,7 +2014,7 @@
       "  });",
       "};"
     ],
-    "description": "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)."
+    "description": "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"
   },
   "orderBy": {
     "prefix": "30s_orderBy",
@@ -2030,21 +2030,21 @@
       "    }, 0)",
       "  );"
     ],
-    "description": "Returns a sorted array of objects ordered by properties and orders."
+    "description": "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"
   },
   "over": {
     "prefix": "30s_over",
     "body": [
       "const over = (...fns) => (...args) => fns.map(fn => fn.apply(null, args));"
     ],
-    "description": "Creates a function that invokes each provided function with the arguments it receives and returns the results."
+    "description": "Creates a function that invokes each provided function with the arguments it receives and returns the results.\n\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments"
   },
   "overArgs": {
     "prefix": "30s_overArgs",
     "body": [
       "const overArgs = (fn, transforms) => (...args) => fn(...args.map((val, i) => transforms[i](val)));"
     ],
-    "description": "Creates a function that invokes the provided function with its arguments transformed."
+    "description": "Creates a function that invokes the provided function with its arguments transformed.\n\nUse `Array.prototype.map()` to apply `transforms` to `args` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`"
   },
   "pad": {
     "prefix": "30s_pad",
@@ -2052,7 +2052,7 @@
       "const pad = (str, length, char = ' ') =>",
       "  str.padStart((str.length + length) / 2, char).padEnd(length, char);"
     ],
-    "description": "Pads a string on both sides with the specified character, if it's shorter than the specified length."
+    "description": "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"
   },
   "palindrome": {
     "prefix": "30s_palindrome",
@@ -2062,7 +2062,7 @@
       "  return s === [...s].reverse().join('');",
       "};"
     ],
-    "description": "Returns `true` if the given string is a palindrome, `false` otherwise."
+    "description": "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()`"
   },
   "parseCookie": {
     "prefix": "30s_parseCookie",
@@ -2076,21 +2076,21 @@
       "      return acc;",
       "    }, {});"
     ],
-    "description": "Parse an HTTP Cookie header string and return an object of all cookie name-value pairs."
+    "description": "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"
   },
   "partial": {
     "prefix": "30s_partial",
     "body": [
       "const partial = (fn, ...partials) => (...args) => fn(...partials, ...args);"
     ],
-    "description": "Creates a function that invokes `fn` with `partials` prepended to the arguments it receives."
+    "description": "Creates a function that invokes `fn` with `partials` prepended to the arguments it receives.\n\nUse the spread operator (`...`) to prepend `partials` to the list of arguments of `fn`"
   },
   "partialRight": {
     "prefix": "30s_partialRight",
     "body": [
       "const partialRight = (fn, ...partials) => (...args) => fn(...args, ...partials);"
     ],
-    "description": "Creates a function that invokes `fn` with `partials` appended to the arguments it receives."
+    "description": "Creates a function that invokes `fn` with `partials` appended to the arguments it receives.\n\nUse the spread operator (`...`) to append `partials` to the list of arguments of `fn`"
   },
   "partition": {
     "prefix": "30s_partition",
@@ -2104,7 +2104,7 @@
       "    [[], []]",
       "  );"
     ],
-    "description": "Groups the elements into two arrays, depending on the provided function's truthiness for each element."
+    "description": "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"
   },
   "percentile": {
     "prefix": "30s_percentile",
@@ -2112,7 +2112,7 @@
       "const percentile = (arr, val) =>",
       "  (100 * arr.reduce((acc, v) => acc + (v < val ? 1 : 0) + (v === val ? 0.5 : 0), 0)) / arr.length;"
     ],
-    "description": "Uses the percentile formula to calculate how many numbers in the given array are less or equal to the given value."
+    "description": "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"
   },
   "permutations": {
     "prefix": "30s_permutations",
@@ -2128,7 +2128,7 @@
       "  );",
       "};"
     ],
-    "description": "⚠️ **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."
+    "description": "⚠️ **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`"
   },
   "pick": {
     "prefix": "30s_pick",
@@ -2136,7 +2136,7 @@
       "const pick = (obj, arr) =>",
       "  arr.reduce((acc, curr) => (curr in obj && (acc[curr] = obj[curr]), acc), {});"
     ],
-    "description": "Picks the key-value pairs corresponding to the given keys from an object."
+    "description": "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"
   },
   "pickBy": {
     "prefix": "30s_pickBy",
@@ -2146,21 +2146,21 @@
       "    .filter(k => fn(obj[k], k))",
       "    .reduce((acc, key) => ((acc[key] = obj[key]), acc), {});"
     ],
-    "description": "Creates an object composed of the properties the given function returns truthy for. The function is invoked with two arguments: (value, key)."
+    "description": "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 falsey value.\nUse `Array.prototype.reduce()` to convert the filtered keys back to an object with the corresponding key-value pairs"
   },
   "pipeAsyncFunctions": {
     "prefix": "30s_pipeAsyncFunctions",
     "body": [
       "const pipeAsyncFunctions = (...fns) => arg => fns.reduce((p, f) => p.then(f), Promise.resolve(arg));"
     ],
-    "description": "Performs left-to-right function composition for asynchronous functions."
+    "description": "Performs left-to-right function composition for asynchronous functions.\n\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition using `Promise.then()`.\nThe functions can return a combination of: simple values, `Promise`'s, or they can be defined as `async` ones returning through `await`.\nAll functions must be unary"
   },
   "pipeFunctions": {
     "prefix": "30s_pipeFunctions",
     "body": [
       "const pipeFunctions = (...fns) => fns.reduce((f, g) => (...args) => g(f(...args)));"
     ],
-    "description": "Performs left-to-right function composition."
+    "description": "Performs left-to-right function composition.\n\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition.\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary"
   },
   "pluralize": {
     "prefix": "30s_pluralize",
@@ -2172,14 +2172,14 @@
       "  return _pluralize(val, word, plural);",
       "};"
     ],
-    "description": "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."
+    "description": "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"
   },
   "powerset": {
     "prefix": "30s_powerset",
     "body": [
       "const powerset = arr => arr.reduce((a, v) => a.concat(a.map(r => [v].concat(r))), [[]]);"
     ],
-    "description": "Returns the powerset of a given array of numbers."
+    "description": "Returns the powerset of a given array of numbers.\n\nUse `Array.prototype.reduce()` combined with `Array.prototype.map()` to iterate over elements and combine into an array containing all combinations"
   },
   "prefix": {
     "prefix": "30s_prefix",
@@ -2193,7 +2193,7 @@
       "  return i !== -1 ? (i === 0 ? prop : prefixes[i] + capitalizedProp) : null;",
       "};"
     ],
-    "description": "Returns the prefixed version (if necessary) of a CSS property that the browser supports."
+    "description": "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"
   },
   "prettyBytes": {
     "prefix": "30s_prettyBytes",
@@ -2206,7 +2206,7 @@
       "  return (num < 0 ? '-' : '') + n + (addSpace ? ' ' : '') + UNITS[exponent];",
       "};"
     ],
-    "description": "Converts a number in bytes to a human-readable string."
+    "description": "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"
   },
   "primes": {
     "prefix": "30s_primes",
@@ -2219,7 +2219,7 @@
       "  return arr;",
       "};"
     ],
-    "description": "Generates primes up to a given number, using the Sieve of Eratosthenes."
+    "description": "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"
   },
   "promisify": {
     "prefix": "30s_promisify",
@@ -2229,7 +2229,7 @@
       "    func(...args, (err, result) => (err ? reject(err) : resolve(result)))",
       "  );"
     ],
-    "description": "Converts an asynchronous function to return a promise."
+    "description": "Converts an asynchronous function to return a promise.\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*In Node 8+, you can use [`util.promisify`](https://nodejs.org/api/util.html#util_util_promisify_original)"
   },
   "pull": {
     "prefix": "30s_pull",
@@ -2241,7 +2241,7 @@
       "  pulled.forEach(v => arr.push(v));",
       "};"
     ],
-    "description": "Mutates the original array to filter out the values specified."
+    "description": "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_(For a snippet that does not mutate the original array see [`without`](#without))"
   },
   "pullAtIndex": {
     "prefix": "30s_pullAtIndex",
@@ -2256,7 +2256,7 @@
       "  return removed;",
       "};"
     ],
-    "description": "Mutates the original array to filter out the values at the specified indexes."
+    "description": "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 value"
   },
   "pullAtValue": {
     "prefix": "30s_pullAtValue",
@@ -2270,7 +2270,7 @@
       "  return removed;",
       "};"
     ],
-    "description": "Mutates the original array to filter out the values specified. Returns the removed elements."
+    "description": "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 value"
   },
   "pullBy": {
     "prefix": "30s_pullBy",
@@ -2285,14 +2285,14 @@
       "  pulled.forEach(v => arr.push(v));",
       "};"
     ],
-    "description": "Mutates the original array to filter out the values specified, based on a given iterator function."
+    "description": "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"
   },
   "radsToDegrees": {
     "prefix": "30s_radsToDegrees",
     "body": [
       "const radsToDegrees = rad => (rad * 180.0) / Math.PI;"
     ],
-    "description": "Converts an angle from radians to degrees."
+    "description": "Converts an angle from radians to degrees.\n\nUse `Math.PI` and the radian to degree formula to convert the angle from radians to degrees"
   },
   "randomHexColorCode": {
     "prefix": "30s_randomHexColorCode",
@@ -2302,7 +2302,7 @@
       "  return '#' + n.slice(0, 6);",
       "};"
     ],
-    "description": "Generates a random hexadecimal color code."
+    "description": "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)`"
   },
   "randomIntArrayInRange": {
     "prefix": "30s_randomIntArrayInRange",
@@ -2310,21 +2310,21 @@
       "const randomIntArrayInRange = (min, max, n = 1) =>",
       "  Array.from({ length: n }, () => Math.floor(Math.random() * (max - min + 1)) + min);"
     ],
-    "description": "Returns an array of n random integers in the specified range."
+    "description": "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"
   },
   "randomIntegerInRange": {
     "prefix": "30s_randomIntegerInRange",
     "body": [
       "const randomIntegerInRange = (min, max) => Math.floor(Math.random() * (max - min + 1)) + min;"
     ],
-    "description": "Returns a random integer in the specified range."
+    "description": "Returns a random integer in the specified range.\n\nUse `Math.random()` to generate a random number and map it to the desired range, using `Math.floor()` to make it an integer"
   },
   "randomNumberInRange": {
     "prefix": "30s_randomNumberInRange",
     "body": [
       "const randomNumberInRange = (min, max) => Math.random() * (max - min) + min;"
     ],
-    "description": "Returns a random number in the specified range."
+    "description": "Returns a random number in the specified range.\n\nUse `Math.random()` to generate a random value, map it to the desired range using multiplication"
   },
   "readFileLines": {
     "prefix": "30s_readFileLines",
@@ -2336,14 +2336,14 @@
       "    .toString('UTF8')",
       "    .split('\\n');"
     ],
-    "description": "Returns an array of lines from the specified file."
+    "description": "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`)"
   },
   "rearg": {
     "prefix": "30s_rearg",
     "body": [
       "const rearg = (fn, indexes) => (...args) => fn(...indexes.map(i => args[i]));"
     ],
-    "description": "Creates a function that invokes the provided function with its arguments arranged according to the specified indexes."
+    "description": "Creates a function that invokes the provided function with its arguments arranged according to the specified indexes.\n\nUse `Array.prototype.map()` to reorder arguments based on `indexes` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`"
   },
   "recordAnimationFrames": {
     "prefix": "30s_recordAnimationFrames",
@@ -2369,7 +2369,7 @@
       "  return { start, stop };",
       "};"
     ],
-    "description": "Invokes the provided callback on each animation frame."
+    "description": "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"
   },
   "redirect": {
     "prefix": "30s_redirect",
@@ -2377,7 +2377,7 @@
       "const redirect = (url, asLink = true) =>",
       "  asLink ? (window.location.href = url) : window.location.replace(url);"
     ],
-    "description": "Redirects to a specified URL."
+    "description": "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`)"
   },
   "reducedFilter": {
     "prefix": "30s_reducedFilter",
@@ -2390,7 +2390,7 @@
       "    }, {})",
       "  );"
     ],
-    "description": "Filter an array of objects based on a condition while also filtering out unspecified keys."
+    "description": "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"
   },
   "reduceSuccessive": {
     "prefix": "30s_reduceSuccessive",
@@ -2398,7 +2398,7 @@
       "const reduceSuccessive = (arr, fn, acc) =>",
       "  arr.reduce((res, val, i, arr) => (res.push(fn(res.slice(-1)[0], val, i, arr)), res), [acc]);"
     ],
-    "description": "Applies a function against an accumulator and each element in the array (from left to right), returning an array of successively reduced values."
+    "description": "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"
   },
   "reduceWhich": {
     "prefix": "30s_reduceWhich",
@@ -2406,7 +2406,7 @@
       "const reduceWhich = (arr, comparator = (a, b) => a - b) =>",
       "  arr.reduce((a, b) => (comparator(a, b) >= 0 ? b : a));"
     ],
-    "description": "Returns the minimum/maximum value of an array, after applying the provided function to set comparing rule."
+    "description": "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"
   },
   "reject": {
     "prefix": "30s_reject",
@@ -2426,14 +2426,14 @@
       "    }, [])",
       "    : [];"
     ],
-    "description": "Removes elements from an array for which the given function returns `false`."
+    "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`)"
   },
   "removeNonASCII": {
     "prefix": "30s_removeNonASCII",
     "body": [
       "const removeNonASCII = str => str.replace(/[^\\x20-\\x7E]/g, '');"
     ],
-    "description": "Removes non-printable ASCII characters."
+    "description": "Removes non-printable ASCII characters.\n\nUse a regular expression to remove non-printable ASCII characters"
   },
   "renameKeys": {
     "prefix": "30s_renameKeys",
@@ -2447,28 +2447,28 @@
       "    {}",
       "  );"
     ],
-    "description": "Replaces the names of multiple object keys with the values provided."
+    "description": "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`"
   },
   "reverseString": {
     "prefix": "30s_reverseString",
     "body": [
       "const reverseString = str => [...str].reverse().join('');"
     ],
-    "description": "Reverses a string."
+    "description": "Reverses a string.\n\nUse the spread operator (`...`) and `Array.prototype.reverse()` to reverse the order of the characters in the string.\nCombine characters to get a string using `String.prototype.join('')`"
   },
   "RGBToHex": {
     "prefix": "30s_RGBToHex",
     "body": [
       "const RGBToHex = (r, g, b) => ((r << 16) + (g << 8) + b).toString(16).padStart(6, '0');"
     ],
-    "description": "Converts the values of RGB components to a color code."
+    "description": "Converts the values of RGB components to a color code.\n\nConvert given RGB parameters to hexadecimal string using bitwise left-shift operator (`<<`) and `toString(16)`, then `String.padStart(6,'0')` to get a 6-digit hexadecimal value"
   },
   "round": {
     "prefix": "30s_round",
     "body": [
       "const round = (n, decimals = 0) => Number(`${Math.round(`${n}e${decimals}`)}e-${decimals}`);"
     ],
-    "description": "Rounds a number to a specified amount of digits."
+    "description": "Rounds a number to a specified amount of digits.\n\nUse `Math.round()` and template literals to round the number to the specified number of digits.\nOmit the second argument, `decimals` to round to an integer"
   },
   "runAsync": {
     "prefix": "30s_runAsync",
@@ -2489,21 +2489,21 @@
       "  });",
       "};"
     ],
-    "description": "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."
+    "description": "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"
   },
   "runPromisesInSeries": {
     "prefix": "30s_runPromisesInSeries",
     "body": [
       "const runPromisesInSeries = ps => ps.reduce((p, next) => p.then(next), Promise.resolve());"
     ],
-    "description": "Runs an array of promises in series."
+    "description": "Runs an array of promises in series.\n\nUse `Array.prototype.reduce()` to create a promise chain, where each promise returns the next promise when resolved"
   },
   "sample": {
     "prefix": "30s_sample",
     "body": [
       "const sample = arr => arr[Math.floor(Math.random() * arr.length)];"
     ],
-    "description": "Returns a random element from an array."
+    "description": "Returns a random element from an array.\n\nUse `Math.random()` to generate a random number, multiply it by `length` and round it off to the nearest whole number using `Math.floor()`.\nThis method also works with strings"
   },
   "sampleSize": {
     "prefix": "30s_sampleSize",
@@ -2517,7 +2517,7 @@
       "  return arr.slice(0, n);",
       "};"
     ],
-    "description": "Gets `n` random elements at unique keys from `array` up to the size of `array`."
+    "description": "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"
   },
   "scrollToTop": {
     "prefix": "30s_scrollToTop",
@@ -2530,7 +2530,7 @@
       "  }",
       "};"
     ],
-    "description": "Smooth-scrolls to the top of the page."
+    "description": "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"
   },
   "sdbm": {
     "prefix": "30s_sdbm",
@@ -2544,28 +2544,28 @@
       "  );",
       "};"
     ],
-    "description": "Hashes the input string into a whole number."
+    "description": "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"
   },
   "serializeCookie": {
     "prefix": "30s_serializeCookie",
     "body": [
       "const serializeCookie = (name, val) => `${encodeURIComponent(name)}=${encodeURIComponent(val)}`;"
     ],
-    "description": "Serialize a cookie name-value pair into a Set-Cookie header string."
+    "description": "Serialize a cookie name-value pair into a Set-Cookie header string.\n\nUse template literals and `encodeURIComponent()` to create the appropriate string"
   },
   "setStyle": {
     "prefix": "30s_setStyle",
     "body": [
       "const setStyle = (el, ruleName, val) => (el.style[ruleName] = val);"
     ],
-    "description": "Sets the value of a CSS rule for the specified element."
+    "description": "Sets the value of a CSS rule for the specified element.\n\nUse `element.style` to set the value of the CSS rule for the specified element to `val`"
   },
   "shallowClone": {
     "prefix": "30s_shallowClone",
     "body": [
       "const shallowClone = obj => Object.assign({}, obj);"
     ],
-    "description": "Creates a shallow clone of an object."
+    "description": "Creates a shallow clone of an object.\n\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original"
   },
   "shank": {
     "prefix": "30s_shank",
@@ -2576,14 +2576,14 @@
       "    .concat(elements)",
       "    .concat(arr.slice(index + delCount));"
     ],
-    "description": "Has the same functionality as [`Array.prototype.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."
+    "description": "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"
   },
   "show": {
     "prefix": "30s_show",
     "body": [
       "const show = (...el) => [...el].forEach(e => (e.style.display = ''));"
     ],
-    "description": "Shows all the elements specified."
+    "description": "Shows all the elements specified.\n\nUse the spread operator (`...`) and `Array.prototype.forEach()` to clear the `display` property for each element specified"
   },
   "shuffle": {
     "prefix": "30s_shuffle",
@@ -2597,14 +2597,14 @@
       "  return arr;",
       "};"
     ],
-    "description": "Randomizes the order of the values of an array, returning a new array."
+    "description": "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"
   },
   "similarity": {
     "prefix": "30s_similarity",
     "body": [
       "const similarity = (arr, values) => arr.filter(v => values.includes(v));"
     ],
-    "description": "Returns an array of elements that appear in both arrays."
+    "description": "Returns an array of elements that appear in both arrays.\n\nUse `Array.prototype.filter()` to remove values that are not part of `values`, determined using `Array.prototype.includes()`"
   },
   "size": {
     "prefix": "30s_size",
@@ -2618,14 +2618,14 @@
       "        ? new Blob([val]).size",
       "        : 0;"
     ],
-    "description": "Get size of arrays, objects or strings."
+    "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.\n\nSplit strings into array of characters with `split('')` and return its length"
   },
   "sleep": {
     "prefix": "30s_sleep",
     "body": [
       "const sleep = ms => new Promise(resolve => setTimeout(resolve, ms));"
     ],
-    "description": "Delays the execution of an asynchronous function."
+    "description": "Delays the execution of an asynchronous function.\n\nDelay executing part of an `async` function, by putting it to sleep, returning a `Promise`"
   },
   "smoothScroll": {
     "prefix": "30s_smoothScroll",
@@ -2635,14 +2635,14 @@
       "    behavior: 'smooth'",
       "  });"
     ],
-    "description": "Smoothly scrolls the element on which it's called into the visible area of the browser window."
+    "description": "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"
   },
   "sortCharactersInString": {
     "prefix": "30s_sortCharactersInString",
     "body": [
       "const sortCharactersInString = str => [...str].sort((a, b) => a.localeCompare(b)).join('');"
     ],
-    "description": "Alphabetically sorts the characters in a string."
+    "description": "Alphabetically sorts the characters in a string.\n\nUse the spread operator (`...`), `Array.prototype.sort()` and  `String.localeCompare()` to sort the characters in `str`, recombine using `String.prototype.join('')`"
   },
   "sortedIndex": {
     "prefix": "30s_sortedIndex",
@@ -2653,7 +2653,7 @@
       "  return index === -1 ? arr.length : index;",
       "};"
     ],
-    "description": "Returns the lowest index at which value should be inserted into array in order to maintain its sort order."
+    "description": "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"
   },
   "sortedIndexBy": {
     "prefix": "30s_sortedIndexBy",
@@ -2665,7 +2665,7 @@
       "  return index === -1 ? arr.length : index;",
       "};"
     ],
-    "description": "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."
+    "description": "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`"
   },
   "sortedLastIndex": {
     "prefix": "30s_sortedLastIndex",
@@ -2676,7 +2676,7 @@
       "  return index === -1 ? 0 : arr.length - index;",
       "};"
     ],
-    "description": "Returns the highest index at which value should be inserted into array in order to maintain its sort order."
+    "description": "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"
   },
   "sortedLastIndexBy": {
     "prefix": "30s_sortedLastIndexBy",
@@ -2691,14 +2691,14 @@
       "  return index === -1 ? 0 : arr.length - index;",
       "};"
     ],
-    "description": "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."
+    "description": "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"
   },
   "splitLines": {
     "prefix": "30s_splitLines",
     "body": [
       "const splitLines = str => str.split(/\\r?\\n/);"
     ],
-    "description": "Splits a multiline string into an array of lines."
+    "description": "Splits a multiline string into an array of lines.\n\nUse `String.prototype.split()` and a regular expression to match line breaks and create an array"
   },
   "spreadOver": {
     "prefix": "30s_spreadOver",
@@ -2716,7 +2716,7 @@
       "    .sort((a, b) => compare(a.item, b.item) || a.index - b.index)",
       "    .map(({ item }) => item);"
     ],
-    "description": "Performs stable sorting of an array, preserving the initial indexes of items when their values are the same.\r\nDoes not mutate the original array, but returns a new array instead."
+    "description": "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"
   },
   "standardDeviation": {
     "prefix": "30s_standardDeviation",
@@ -2729,7 +2729,7 @@
       "  );",
       "};"
     ],
-    "description": "Returns the standard deviation of an array of numbers."
+    "description": "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"
   },
   "stringPermutations": {
     "prefix": "30s_stringPermutations",
@@ -2745,21 +2745,21 @@
       "    );",
       "};"
     ],
-    "description": "⚠️ **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."
+    "description": "⚠️ **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`"
   },
   "stripHTMLTags": {
     "prefix": "30s_stripHTMLTags",
     "body": [
       "const stripHTMLTags = str => str.replace(/<[^>]*>/g, '');"
     ],
-    "description": "Removes HTML/XML tags from string."
+    "description": "Removes HTML/XML tags from string.\n\nUse a regular expression to remove HTML/XML tags from a string"
   },
   "sum": {
     "prefix": "30s_sum",
     "body": [
       "const sum = (...arr) => [...arr].reduce((acc, val) => acc + val, 0);"
     ],
-    "description": "Returns the sum of two or more numbers/arrays."
+    "description": "Returns the sum of two or more numbers/arrays.\n\nUse `Array.prototype.reduce()` to add each value to an accumulator, initialized with a value of `0`"
   },
   "sumBy": {
     "prefix": "30s_sumBy",
@@ -2767,7 +2767,7 @@
       "const sumBy = (arr, fn) =>",
       "  arr.map(typeof fn === 'function' ? fn : val => val[fn]).reduce((acc, val) => acc + val, 0);"
     ],
-    "description": "Returns the sum of an array, after mapping each element to a value using the provided function."
+    "description": "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`"
   },
   "sumPower": {
     "prefix": "30s_sumPower",
@@ -2778,7 +2778,7 @@
       "    .map((x, i) => (i + start) ** power)",
       "    .reduce((a, b) => a + b, 0);"
     ],
-    "description": "Returns the sum of the powers of all the numbers from `start` to `end` (both inclusive)."
+    "description": "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`"
   },
   "symmetricDifference": {
     "prefix": "30s_symmetricDifference",
@@ -2789,7 +2789,7 @@
       "  return [...a.filter(x => !sB.has(x)), ...b.filter(x => !sA.has(x))];",
       "};"
     ],
-    "description": "Returns the symmetric difference between two arrays, without filtering out duplicate values."
+    "description": "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"
   },
   "symmetricDifferenceBy": {
     "prefix": "30s_symmetricDifferenceBy",
@@ -2800,7 +2800,7 @@
       "  return [...a.filter(x => !sB.has(fn(x))), ...b.filter(x => !sA.has(fn(x)))];",
       "};"
     ],
-    "description": "Returns the symmetric difference between two arrays, after applying the provided function to each array element of both."
+    "description": "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"
   },
   "symmetricDifferenceWith": {
     "prefix": "30s_symmetricDifferenceWith",
@@ -2810,28 +2810,28 @@
       "  ...val.filter(a => arr.findIndex(b => comp(a, b)) === -1)",
       "];"
     ],
-    "description": "Returns the symmetric difference between two arrays, using a provided function as a comparator."
+    "description": "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"
   },
   "tail": {
     "prefix": "30s_tail",
     "body": [
       "const tail = arr => (arr.length > 1 ? arr.slice(1) : arr);"
     ],
-    "description": "Returns all elements in an array except for the first one."
+    "description": "Returns all elements in an array except for the first one.\n\nReturn `Array.prototype.slice(1)` if the array's `length` is more than `1`, otherwise, return the whole array"
   },
   "take": {
     "prefix": "30s_take",
     "body": [
       "const take = (arr, n = 1) => arr.slice(0, n);"
     ],
-    "description": "Returns an array with n elements removed from the beginning."
+    "description": "Returns an array with n elements removed from the beginning.\n\nUse `Array.prototype.slice()` to create a slice of the array with `n` elements taken from the beginning"
   },
   "takeRight": {
     "prefix": "30s_takeRight",
     "body": [
       "const takeRight = (arr, n = 1) => arr.slice(arr.length - n, arr.length);"
     ],
-    "description": "Returns an array with n elements removed from the end."
+    "description": "Returns an array with n elements removed from the end.\n\nUse `Array.prototype.slice()` to create a slice of the array with `n` elements taken from the end"
   },
   "takeRightWhile": {
     "prefix": "30s_takeRightWhile",
@@ -2839,7 +2839,7 @@
       "const takeRightWhile = (arr, func) =>",
       "  arr.reduceRight((acc, el) => (func(el) ? acc : [el, ...acc]), []);"
     ],
-    "description": "Removes elements from the end of an array until the passed function returns `true`. Returns the removed elements."
+    "description": "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"
   },
   "takeWhile": {
     "prefix": "30s_takeWhile",
@@ -2849,7 +2849,7 @@
       "  return arr;",
       "};"
     ],
-    "description": "Removes elements in an array until the passed function returns `true`. Returns the removed elements."
+    "description": "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()`"
   },
   "throttle": {
     "prefix": "30s_throttle",
@@ -2875,7 +2875,7 @@
       "  };",
       "};"
     ],
-    "description": "Creates a throttled function that only invokes the provided function at most once per every `wait` milliseconds"
+    "description": "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"
   },
   "times": {
     "prefix": "30s_times",
@@ -2885,7 +2885,7 @@
       "  while (fn.call(context, i) !== false && ++i < n) {}",
       "};"
     ],
-    "description": "Iterates over a callback `n` times"
+    "description": "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)"
   },
   "timeTaken": {
     "prefix": "30s_timeTaken",
@@ -2897,7 +2897,7 @@
       "  return r;",
       "};"
     ],
-    "description": "Measures the time taken by a function to execute."
+    "description": "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"
   },
   "toCamelCase": {
     "prefix": "30s_toCamelCase",
@@ -2912,7 +2912,7 @@
       "  return s.slice(0, 1).toLowerCase() + s.slice(1);",
       "};"
     ],
-    "description": "Converts a string to camelcase."
+    "description": "Converts a string to camelcase.\n\nBreak the string into words and combine them capitalizing the first letter of each word, using a regexp"
   },
   "toCurrency": {
     "prefix": "30s_toCurrency",
@@ -2920,7 +2920,7 @@
       "const toCurrency = (n, curr, LanguageFormat = undefined) =>",
       "  Intl.NumberFormat(LanguageFormat, { style: 'currency', currency: curr }).format(n);"
     ],
-    "description": "Take a number and return specified currency formatting."
+    "description": "Take a number and return specified currency formatting.\n\nUse `Intl.NumberFormat` to enable country / currency sensitive formatting"
   },
   "toDecimalMark": {
     "prefix": "30s_toDecimalMark",
@@ -2934,7 +2934,7 @@
     "body": [
       "const toggleClass = (el, className) => el.classList.toggle(className);"
     ],
-    "description": "Toggle a class for an element."
+    "description": "Toggle a class for an element.\n\nUse `element.classList.toggle()` to toggle the specified class for the element"
   },
   "toHash": {
     "prefix": "30s_toHash",
@@ -2946,7 +2946,7 @@
       "    {}",
       "  );"
     ],
-    "description": "Reduces a given Array-like into a value hash (keyed data store)."
+    "description": "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"
   },
   "toKebabCase": {
     "prefix": "30s_toKebabCase",
@@ -2958,7 +2958,7 @@
       "    .map(x => x.toLowerCase())",
       "    .join('-');"
     ],
-    "description": "Converts a string to kebab case."
+    "description": "Converts a string to kebab case.\n\nBreak the string into words and combine them adding `-` as a separator, using a regexp"
   },
   "tomorrow": {
     "prefix": "30s_tomorrow",
@@ -2972,7 +2972,7 @@
       "  return !long ? ret : `${ret}T00:00:00`;",
       "};"
     ],
-    "description": "Results in a string representation of tomorrow's date."
+    "description": "Results in a string representation of tomorrow's date.\n\nUse `new Date()` to get today's date, adding one day using `Date.getDate()` and `Date.setDate()`, and converting the Date object to a string"
   },
   "toOrdinalSuffix": {
     "prefix": "30s_toOrdinalSuffix",
@@ -2988,7 +2988,7 @@
       "    : int + ordinals[3];",
       "};"
     ],
-    "description": "Adds an ordinal suffix to a number."
+    "description": "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"
   },
   "toSafeInteger": {
     "prefix": "30s_toSafeInteger",
@@ -2996,7 +2996,7 @@
       "const toSafeInteger = num =>",
       "  Math.round(Math.max(Math.min(num, Number.MAX_SAFE_INTEGER), Number.MIN_SAFE_INTEGER));"
     ],
-    "description": "Converts a value to a safe integer."
+    "description": "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"
   },
   "toSnakeCase": {
     "prefix": "30s_toSnakeCase",
@@ -3008,7 +3008,7 @@
       "    .map(x => x.toLowerCase())",
       "    .join('_');"
     ],
-    "description": "Converts a string to snake case."
+    "description": "Converts a string to snake case.\n\nBreak the string into words and combine them adding `_` as a separator, using a regexp"
   },
   "toTitleCase": {
     "prefix": "30s_toTitleCase",
@@ -3019,14 +3019,14 @@
       "    .map(x => x.charAt(0).toUpperCase() + x.slice(1))",
       "    .join(' ');"
     ],
-    "description": "Converts a string to title case."
+    "description": "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"
   },
   "transform": {
     "prefix": "30s_transform",
     "body": [
       "const transform = (obj, fn, acc) => Object.keys(obj).reduce((a, k) => fn(a, obj[k], k, obj), acc);"
     ],
-    "description": "Applies a function against an accumulator and each key in the object (from left to right)."
+    "description": "Applies a function against an accumulator and each key in the object (from left to right).\n\nUse `Object.keys(obj)` to iterate over each key in the object, `Array.prototype.reduce()` to call the apply the specified function against the given accumulator"
   },
   "triggerEvent": {
     "prefix": "30s_triggerEvent",
@@ -3034,7 +3034,7 @@
       "const triggerEvent = (el, eventType, detail) =>",
       "  el.dispatchEvent(new CustomEvent(eventType, { detail }));"
     ],
-    "description": "Triggers a specific event on a given element, optionally passing custom data."
+    "description": "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"
   },
   "truncateString": {
     "prefix": "30s_truncateString",
@@ -3042,21 +3042,21 @@
       "const truncateString = (str, num) =>",
       "  str.length > num ? str.slice(0, num > 3 ? num - 3 : num) + '...' : str;"
     ],
-    "description": "Truncates a string up to a specified length."
+    "description": "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"
   },
   "truthCheckCollection": {
     "prefix": "30s_truthCheckCollection",
     "body": [
       "const truthCheckCollection = (collection, pre) => collection.every(obj => obj[pre]);"
     ],
-    "description": "Checks if the predicate (second argument) is truthy on all elements of a collection (first argument)."
+    "description": "Checks if the predicate (second argument) is truthy on all elements of a collection (first argument).\n\nUse `Array.prototype.every()` to check if each passed object has the specified property and if it returns a truthy value"
   },
   "unary": {
     "prefix": "30s_unary",
     "body": [
       "const unary = fn => val => fn(val);"
     ],
-    "description": "Creates a function that accepts up to one argument, ignoring any additional arguments."
+    "description": "Creates a function that accepts up to one argument, ignoring any additional arguments.\n\nCall the provided function, `fn`, with just the first argument given"
   },
   "uncurry": {
     "prefix": "30s_uncurry",
@@ -3067,7 +3067,7 @@
       "  return next(fn)(args.slice(0, n));",
       "};"
     ],
-    "description": "Uncurries a function up to depth `n`."
+    "description": "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`"
   },
   "unescapeHTML": {
     "prefix": "30s_unescapeHTML",
@@ -3085,7 +3085,7 @@
       "      }[tag] || tag)",
       "  );"
     ],
-    "description": "Unescapes escaped HTML characters."
+    "description": "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)"
   },
   "unflattenObject": {
     "prefix": "30s_unflattenObject",
@@ -3107,7 +3107,7 @@
       "    return acc;",
       "  }, {});"
     ],
-    "description": "Unflatten an object with the paths for keys."
+    "description": "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"
   },
   "unfold": {
     "prefix": "30s_unfold",
@@ -3119,14 +3119,14 @@
       "  return result;",
       "};"
     ],
-    "description": "Builds an array, using an iterator function and an initial seed value."
+    "description": "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"
   },
   "union": {
     "prefix": "30s_union",
     "body": [
       "const union = (a, b) => Array.from(new Set([...a, ...b]));"
     ],
-    "description": "Returns every element that exists in any of the two arrays once."
+    "description": "Returns every element that exists in any of the two arrays once.\n\nCreate a `Set` with all values of `a` and `b` and convert to an array"
   },
   "unionBy": {
     "prefix": "30s_unionBy",
@@ -3136,7 +3136,7 @@
       "  return Array.from(new Set([...a, ...b.filter(x => !s.has(fn(x)))]));",
       "};"
     ],
-    "description": "Returns every element that exists in any of the two arrays once, after applying the provided function to each array element of both."
+    "description": "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"
   },
   "unionWith": {
     "prefix": "30s_unionWith",
@@ -3144,14 +3144,14 @@
       "const unionWith = (a, b, comp) =>",
       "  Array.from(new Set([...a, ...b.filter(x => a.findIndex(y => comp(x, y)) === -1)]));"
     ],
-    "description": "Returns every element that exists in any of the two arrays once, using a provided comparator function."
+    "description": "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()`"
   },
   "uniqueElements": {
     "prefix": "30s_uniqueElements",
     "body": [
       "const uniqueElements = arr => [...new Set(arr)];"
     ],
-    "description": "Returns all unique values of an array."
+    "description": "Returns all unique values of an array.\n\nUse ES6 `Set` and the `...rest` operator to discard all duplicated values"
   },
   "uniqueElementsBy": {
     "prefix": "30s_uniqueElementsBy",
@@ -3162,7 +3162,7 @@
       "    return acc;",
       "  }, []);"
     ],
-    "description": "Returns all unique values of an array, based on a provided comparator function."
+    "description": "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 occurence of each value, based on the comparator function, `fn`.\nThe comparator function takes two arguments: the values of the two elements being compared"
   },
   "uniqueElementsByRight": {
     "prefix": "30s_uniqueElementsByRight",
@@ -3173,7 +3173,7 @@
       "    return acc;",
       "  }, []);"
     ],
-    "description": "Returns all unique values of an array, based on a provided comparator function."
+    "description": "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 last unique occurence of each value, based on the comparator function, `fn`.\nThe comparator function takes two arguments: the values of the two elements being compared"
   },
   "uniqueSymmetricDifference": {
     "prefix": "30s_uniqueSymmetricDifference",
@@ -3182,14 +3182,14 @@
       "  ...new Set([...a.filter(v => !b.includes(v)), ...b.filter(v => !a.includes(v))])",
       "];"
     ],
-    "description": "Returns the unique symmetric difference between two arrays, not containing duplicate values from either array."
+    "description": "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"
   },
   "untildify": {
     "prefix": "30s_untildify",
     "body": [
       "const untildify = str => str.replace(/^~($|\\/|\\\\)/, `${require('os').homedir()}$1`);"
     ],
-    "description": "Converts a tilde path to an absolute path."
+    "description": "Converts a tilde path to an absolute path.\n\nUse `String.prototype.replace()` with a regular expression and `OS.homedir()` to replace the `~` in the start of the path with the home directory"
   },
   "unzip": {
     "prefix": "30s_unzip",
@@ -3202,7 +3202,7 @@
       "    }).map(x => [])",
       "  );"
     ],
-    "description": "Creates an array of arrays, ungrouping the elements in an array produced by [zip](#zip)."
+    "description": "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"
   },
   "unzipWith": {
     "prefix": "30s_unzipWith",
@@ -3217,7 +3217,7 @@
       "    )",
       "    .map(val => fn(...val));"
     ],
-    "description": "Creates an array of elements, ungrouping the elements in an array produced by [zip](#zip) and applying the provided function."
+    "description": "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"
   },
   "URLJoin": {
     "prefix": "30s_URLJoin",
@@ -3232,7 +3232,7 @@
       "    .replace(/\\?/g, '&')",
       "    .replace('&', '?');"
     ],
-    "description": "Joins all given URL segments together, then normalizes the resulting URL."
+    "description": "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)"
   },
   "UUIDGeneratorBrowser": {
     "prefix": "30s_UUIDGeneratorBrowser",
@@ -3242,7 +3242,7 @@
       "    (c ^ (crypto.getRandomValues(new Uint8Array(1))[0] & (15 >> (c / 4)))).toString(16)",
       "  );"
     ],
-    "description": "Generates a UUID in a browser."
+    "description": "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"
   },
   "UUIDGeneratorNode": {
     "prefix": "30s_UUIDGeneratorNode",
@@ -3253,42 +3253,42 @@
       "    (c ^ (crypto.randomBytes(1)[0] & (15 >> (c / 4)))).toString(16)",
       "  );"
     ],
-    "description": "Generates a UUID in Node.JS."
+    "description": "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"
   },
   "validateNumber": {
     "prefix": "30s_validateNumber",
     "body": [
       "const validateNumber = n => !isNaN(parseFloat(n)) && isFinite(n) && Number(n) == n;"
     ],
-    "description": "Returns `true` if the given value is a number, `false` otherwise."
+    "description": "Returns `true` if the given value is a number, `false` otherwise.\n\nUse `!isNaN()` in combination with `parseFloat()` to check if the argument is a number.\nUse `isFinite()` to check if the number is finite.\nUse `Number()` to check if the coercion holds"
   },
   "when": {
     "prefix": "30s_when",
     "body": [
       "const when = (pred, whenTrue) => x => (pred(x) ? whenTrue(x) : x);"
     ],
-    "description": "Tests a value, `x`, against a predicate function. If `true`, return `fn(x)`. Else, return `x`. "
+    "description": "Tests a value, `x`, against a predicate function. If `true`, return `fn(x)`. Else, return `x`. \n\nReturn a function expecting a single value, `x`, that returns the appropriate value based on `pred`"
   },
   "without": {
     "prefix": "30s_without",
     "body": [
       "const without = (arr, ...args) => arr.filter(v => !args.includes(v));"
     ],
-    "description": "Filters out the elements of an array, that have one of the specified values."
+    "description": "Filters out the elements of an array, that have one of the specified values.\n\nUse `Array.prototype.filter()` to create an array excluding(using `!Array.includes()`) all given values.\n\n_(For a snippet that mutates the original array see [`pull`](#pull))"
   },
   "words": {
     "prefix": "30s_words",
     "body": [
       "const words = (str, pattern = /[^a-zA-Z-]+/) => str.split(pattern).filter(Boolean);"
     ],
-    "description": "Converts a given string into an array of words."
+    "description": "Converts a given string into an array of words.\n\nUse `String.prototype.split()` with a supplied pattern (defaults to non-alpha as a regexp) to convert to an array of strings. Use `Array.prototype.filter()` to remove any empty strings.\nOmit the second argument to use the default regexp"
   },
   "xProd": {
     "prefix": "30s_xProd",
     "body": [
       "const xProd = (a, b) => a.reduce((acc, x) => acc.concat(b.map(y => [x, y])), []);"
     ],
-    "description": "Creates a new array out of the two supplied by creating each possible pair from the arrays."
+    "description": "Creates a new array out of the two supplied by creating each possible pair from the arrays.\n\nUse `Array.prototype.reduce()`, `Array.prototype.map()` and `Array.prototype.concat()` to produce every possible pair from the elements of the two arrays and save them in an array"
   },
   "yesNo": {
     "prefix": "30s_yesNo",
@@ -3296,7 +3296,7 @@
       "const yesNo = (val, def = false) =>",
       "  /^(y|yes)$/i.test(val) ? true : /^(n|no)$/i.test(val) ? false : def;"
     ],
-    "description": "Returns `true` if the string is `y`/`yes` or `false` if the string is `n`/`no`."
+    "description": "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`"
   },
   "zip": {
     "prefix": "30s_zip",
@@ -3308,7 +3308,7 @@
       "  });",
       "};"
     ],
-    "description": "Creates an array of elements, grouped based on the position in the original arrays."
+    "description": "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"
   },
   "zipObject": {
     "prefix": "30s_zipObject",
@@ -3316,7 +3316,7 @@
       "const zipObject = (props, values) =>",
       "  props.reduce((obj, prop, index) => ((obj[prop] = values[index]), obj), {});"
     ],
-    "description": "Given an array of valid property identifiers and an array of values, return an object associating the properties to the values."
+    "description": "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()`"
   },
   "zipWith": {
     "prefix": "30s_zipWith",
@@ -3329,6 +3329,6 @@
       "  );",
       "};"
     ],
-    "description": "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."
+    "description": "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)`"
   }
 }
\ No newline at end of file

From 42ebea3ed9652776b18927601341bad1a34dee35 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Fri, 2 Nov 2018 14:13:48 +0000
Subject: [PATCH 02/16] Travis build: 727 [cron]

---
 snippet_data/snippetList.json | 2 +-
 snippet_data/snippets.json    | 2 +-
 test/testlog                  | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/snippet_data/snippetList.json b/snippet_data/snippetList.json
index 3b3b38163..a0ad11b3a 100644
--- a/snippet_data/snippetList.json
+++ b/snippet_data/snippetList.json
@@ -5205,7 +5205,7 @@
         "archived": true
       },
       "meta": {
-        "hash": "cd05a83026c948903673c6d9482c7c1a1c4da1d53e875c60cae3719d7959f79e"
+        "hash": "f5cb5c0acd7e7bca28ac3a7e2c0292db8f72b2e0598dd0b84270d3eb1cc72c8b"
       }
     },
     {
diff --git a/snippet_data/snippets.json b/snippet_data/snippets.json
index 601004b47..3432256b5 100644
--- a/snippet_data/snippets.json
+++ b/snippet_data/snippets.json
@@ -7704,7 +7704,7 @@
       },
       "meta": {
         "archived": true,
-        "hash": "cd05a83026c948903673c6d9482c7c1a1c4da1d53e875c60cae3719d7959f79e"
+        "hash": "f5cb5c0acd7e7bca28ac3a7e2c0292db8f72b2e0598dd0b84270d3eb1cc72c8b"
       }
     },
     {
diff --git a/test/testlog b/test/testlog
index f8ea0ba87..20481ab77 100644
--- a/test/testlog
+++ b/test/testlog
@@ -2267,7 +2267,7 @@ ok 1180 — hz is a Function
 
 # Test Suites: 100% ██████████, 360 passed, 360 total
 # Tests:       100% ██████████, 1180 passed, 1180 total
-# Time:        26.152s
+# Time:        26.496s
 
 # Ran all test suites.
 

From 477257e280d69fb3162ce6842cff705a137e9041 Mon Sep 17 00:00:00 2001
From: Hardik500 <hardikkhandelwal500@gmail.com>
Date: Sat, 3 Nov 2018 16:58:20 +0530
Subject: [PATCH 03/16] [FIX] wrong comment with getColonTimeFromDate #869

---
 snippets/getColonTimeFromDate.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/snippets/getColonTimeFromDate.md b/snippets/getColonTimeFromDate.md
index 87e4d3eef..06ce92ea6 100644
--- a/snippets/getColonTimeFromDate.md
+++ b/snippets/getColonTimeFromDate.md
@@ -2,7 +2,7 @@
 
 Returns a string of the form `HH:MM:SS` from a `Date` object.
 
-Use `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.
+Use `Date.prototype.toTimeString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.
 
 ```js
 const getColonTimeFromDate = date => date.toTimeString().slice(0, 8);

From 339fbd7c64afdaec66ec31807b24c5f11e539784 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Sat, 3 Nov 2018 14:14:42 +0000
Subject: [PATCH 04/16] Travis build: 729 [cron]

---
 test/testlog | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/testlog b/test/testlog
index 20481ab77..fc8967278 100644
--- a/test/testlog
+++ b/test/testlog
@@ -2267,7 +2267,7 @@ ok 1180 — hz is a Function
 
 # Test Suites: 100% ██████████, 360 passed, 360 total
 # Tests:       100% ██████████, 1180 passed, 1180 total
-# Time:        26.496s
+# Time:        29.388s
 
 # Ran all test suites.
 

From 42d05174806d5097500231f31d734a4f6e9a1be7 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Sat, 3 Nov 2018 14:16:34 +0000
Subject: [PATCH 05/16] Travis build: 731

---
 README.md      | 2 +-
 docs/date.html | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index a55ecdd87..d274b39b6 100644
--- a/README.md
+++ b/README.md
@@ -4286,7 +4286,7 @@ formatDuration(34325055574); // '397 days, 6 hours, 44 minutes, 15 seconds, 574
 
 Returns a string of the form `HH:MM:SS` from a `Date` object.
 
-Use `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.
+Use `Date.prototype.toTimeString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.
 
 ```js
 const getColonTimeFromDate = date => date.toTimeString().slice(0, 8);
diff --git a/docs/date.html b/docs/date.html
index 419f74d0d..05057e39e 100644
--- a/docs/date.html
+++ b/docs/date.html
@@ -110,7 +110,7 @@
 };</span>
 </pre><label class="collapse">examples</label><pre class="section card-examples language-js"><span class="token function">formatDuration</span><span class="token punctuation">(</span><span class="token number">1001</span><span class="token punctuation">);</span> <span class="token comment">// '1 second, 1 millisecond'</span>
 <span class="token function">formatDuration</span><span class="token punctuation">(</span><span class="token number">34325055574</span><span class="token punctuation">);</span> <span class="token comment">// '397 days, 6 hours, 44 minutes, 15 seconds, 574 milliseconds'</span>
-</pre></div><div class="card code-card"><div class="corner intermediate"></div><div class="section card-content"><h4 id="getcolontimefromdate">getColonTimeFromDate</h4><p>Returns a string of the form <code>HH:MM:SS</code> from a <code>Date</code> object.</p><p>Use <code>Date.prototype.toString()</code> and <code>String.prototype.slice()</code> to get the <code>HH:MM:SS</code> part of a given <code>Date</code> object.</p></div><div class="copy-button-container"><button class="copy-button" aria-label="Copy to clipboard"></button></div><pre class="section card-code language-js"><span class="token keyword">const</span> <span class="token function-variable function">getColonTimeFromDate</span> <span class="token operator">=</span> date <span class="token operator">=></span> date<span class="token punctuation">.</span><span class="token function">toTimeString</span><span class="token punctuation">().</span><span class="token function">slice</span><span class="token punctuation">(</span><span class="token number">0</span><span class="token punctuation">,</span> <span class="token number">8</span><span class="token punctuation">);</span>
+</pre></div><div class="card code-card"><div class="corner intermediate"></div><div class="section card-content"><h4 id="getcolontimefromdate">getColonTimeFromDate</h4><p>Returns a string of the form <code>HH:MM:SS</code> from a <code>Date</code> object.</p><p>Use <code>Date.prototype.toTimeString()</code> and <code>String.prototype.slice()</code> to get the <code>HH:MM:SS</code> part of a given <code>Date</code> object.</p></div><div class="copy-button-container"><button class="copy-button" aria-label="Copy to clipboard"></button></div><pre class="section card-code language-js"><span class="token keyword">const</span> <span class="token function-variable function">getColonTimeFromDate</span> <span class="token operator">=</span> date <span class="token operator">=></span> date<span class="token punctuation">.</span><span class="token function">toTimeString</span><span class="token punctuation">().</span><span class="token function">slice</span><span class="token punctuation">(</span><span class="token number">0</span><span class="token punctuation">,</span> <span class="token number">8</span><span class="token punctuation">);</span>
 </pre><label class="collapse">examples</label><pre class="section card-examples language-js"><span class="token function">getColonTimeFromDate</span><span class="token punctuation">(</span><span class="token keyword">new</span> <span class="token class-name">Date</span><span class="token punctuation">());</span> <span class="token comment">// "08:38:00"</span>
 </pre></div><div class="card code-card"><div class="corner intermediate"></div><div class="section card-content"><h4 id="getdaysdiffbetweendates">getDaysDiffBetweenDates</h4><p>Returns the difference (in days) between two dates.</p><p>Calculate the difference (in days) between two <code>Date</code> objects.</p></div><div class="copy-button-container"><button class="copy-button" aria-label="Copy to clipboard"></button></div><pre class="section card-code language-js"><span class="token keyword">const</span> <span class="token function-variable function">getDaysDiffBetweenDates</span> <span class="token operator">=</span> <span class="token punctuation">(</span>dateInitial<span class="token punctuation">,</span> dateFinal<span class="token punctuation">)</span> <span class="token operator">=></span>
   <span class="token punctuation">(</span>dateFinal <span class="token operator">-</span> dateInitial<span class="token punctuation">)</span> <span class="token operator">/</span> <span class="token punctuation">(</span><span class="token number">1000</span> <span class="token operator">*</span> <span class="token number">3600</span> <span class="token operator">*</span> <span class="token number">24</span><span class="token punctuation">);</span>

From 9df088908296852122c184a9fb646799b0cc7ca1 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Sun, 4 Nov 2018 14:15:20 +0000
Subject: [PATCH 06/16] Travis build: 733 [cron]

---
 snippet_data/snippetList.json | 2 +-
 snippet_data/snippets.json    | 4 ++--
 test/testlog                  | 2 +-
 vscode_snippets/snippets.json | 2 +-
 4 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/snippet_data/snippetList.json b/snippet_data/snippetList.json
index a0ad11b3a..a4a4124cf 100644
--- a/snippet_data/snippetList.json
+++ b/snippet_data/snippetList.json
@@ -1426,7 +1426,7 @@
         "archived": false
       },
       "meta": {
-        "hash": "4a8abb281739c1b068d979b8d49038ea063ece4aa570cc8444926ebd30306ff1"
+        "hash": "047d7aa6776b48b392054fc0addcffa4485904f6281f277426911f3ef475b079"
       }
     },
     {
diff --git a/snippet_data/snippets.json b/snippet_data/snippets.json
index 3432256b5..7b6bc4bdc 100644
--- a/snippet_data/snippets.json
+++ b/snippet_data/snippets.json
@@ -2092,7 +2092,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "getColonTimeFromDate.md",
-        "text": "Returns a string of the form `HH:MM:SS` from a `Date` object.\n\nUse `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.",
+        "text": "Returns a string of the form `HH:MM:SS` from a `Date` object.\n\nUse `Date.prototype.toTimeString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object.",
         "codeBlocks": {
           "es6": "const getColonTimeFromDate = date => date.toTimeString().slice(0, 8);",
           "es5": "var getColonTimeFromDate = function getColonTimeFromDate(date) {\n  return date.toTimeString().slice(0, 8);\n};",
@@ -2105,7 +2105,7 @@
       },
       "meta": {
         "archived": false,
-        "hash": "4a8abb281739c1b068d979b8d49038ea063ece4aa570cc8444926ebd30306ff1"
+        "hash": "047d7aa6776b48b392054fc0addcffa4485904f6281f277426911f3ef475b079"
       }
     },
     {
diff --git a/test/testlog b/test/testlog
index fc8967278..18dc342f3 100644
--- a/test/testlog
+++ b/test/testlog
@@ -2267,7 +2267,7 @@ ok 1180 — hz is a Function
 
 # Test Suites: 100% ██████████, 360 passed, 360 total
 # Tests:       100% ██████████, 1180 passed, 1180 total
-# Time:        29.388s
+# Time:        30.314s
 
 # Ran all test suites.
 
diff --git a/vscode_snippets/snippets.json b/vscode_snippets/snippets.json
index c4dae15c5..b2eee7bfa 100644
--- a/vscode_snippets/snippets.json
+++ b/vscode_snippets/snippets.json
@@ -951,7 +951,7 @@
     "body": [
       "const getColonTimeFromDate = date => date.toTimeString().slice(0, 8);"
     ],
-    "description": "Returns a string of the form `HH:MM:SS` from a `Date` object.\n\nUse `Date.prototype.toString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object"
+    "description": "Returns a string of the form `HH:MM:SS` from a `Date` object.\n\nUse `Date.prototype.toTimeString()` and `String.prototype.slice()` to get the `HH:MM:SS` part of a given `Date` object"
   },
   "getDaysDiffBetweenDates": {
     "prefix": "30s_getDaysDiffBetweenDates",

From edfe7cb8766f2785f54babac3a06e178b9360938 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Mon, 5 Nov 2018 14:15:24 +0000
Subject: [PATCH 07/16] Travis build: 735 [cron]

---
 test/testlog | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/testlog b/test/testlog
index 18dc342f3..d231b8ac5 100644
--- a/test/testlog
+++ b/test/testlog
@@ -2267,7 +2267,7 @@ ok 1180 — hz is a Function
 
 # Test Suites: 100% ██████████, 360 passed, 360 total
 # Tests:       100% ██████████, 1180 passed, 1180 total
-# Time:        30.314s
+# Time:        27.200s
 
 # Ran all test suites.
 

From bbdcadf63a00ba87fb3cd04614b3fb4436207b81 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Tue, 6 Nov 2018 14:15:53 +0000
Subject: [PATCH 08/16] Travis build: 737 [cron]

---
 test/testlog | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/testlog b/test/testlog
index d231b8ac5..9186a1e57 100644
--- a/test/testlog
+++ b/test/testlog
@@ -2267,7 +2267,7 @@ ok 1180 — hz is a Function
 
 # Test Suites: 100% ██████████, 360 passed, 360 total
 # Tests:       100% ██████████, 1180 passed, 1180 total
-# Time:        27.200s
+# Time:        26.695s
 
 # Ran all test suites.
 

From c49f7a30cd604f5d9cbd1322a574f73f3e911e96 Mon Sep 17 00:00:00 2001
From: Angelos Chalaris <chalarangelo@gmail.com>
Date: Wed, 7 Nov 2018 09:56:59 +0200
Subject: [PATCH 09/16] Update README-start.md

---
 static-parts/README-start.md | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/static-parts/README-start.md b/static-parts/README-start.md
index 1433c7e11..ed4b442cd 100644
--- a/static-parts/README-start.md
+++ b/static-parts/README-start.md
@@ -1,8 +1,10 @@
-![Logo](/logo.png)
+[![Logo](/logo.png)](https://30secondsofcode.org/)
 
 # 30 seconds of code
 
-[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com) [![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code)
+[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code)  <br/> 
+[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
+[![Awesome](https://awesome.re/badge.svg)](https://awesome.re) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com)
 
 > Curated collection of useful JavaScript snippets that you can understand in 30 seconds or less.
 
@@ -79,4 +81,4 @@ average(1, 2, 3);
 
 </details>
 
-## Table of Contents
+## Contents

From ba58c7f2a04539f376e9beb8f25604f7fb9fc6ae Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Wed, 7 Nov 2018 07:59:42 +0000
Subject: [PATCH 10/16] Travis build: 739

---
 README.md | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index d274b39b6..db822344f 100644
--- a/README.md
+++ b/README.md
@@ -1,8 +1,10 @@
-![Logo](/logo.png)
+[![Logo](/logo.png)](https://30secondsofcode.org/)
 
 # 30 seconds of code
 
-[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com) [![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code)
+[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code)  <br/> 
+[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
+[![Awesome](https://awesome.re/badge.svg)](https://awesome.re) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com)
 
 > Curated collection of useful JavaScript snippets that you can understand in 30 seconds or less.
 
@@ -79,7 +81,7 @@ average(1, 2, 3);
 
 </details>
 
-## Table of Contents
+## Contents
 
 ### 🔌 Adapter
 

From 67dd122cd30bc818ffaebd8f3d5ab9cf8e2857c0 Mon Sep 17 00:00:00 2001
From: Angelos Chalaris <chalarangelo@gmail.com>
Date: Wed, 7 Nov 2018 10:05:53 +0200
Subject: [PATCH 11/16] Update build.js

---
 scripts/build.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/scripts/build.js b/scripts/build.js
index 6679bbb44..369336507 100644
--- a/scripts/build.js
+++ b/scripts/build.js
@@ -23,7 +23,7 @@ const makeExamples = data => {
       data.slice(data.lastIndexOf('```js'), data.lastIndexOf('```')) +
         data.slice(data.lastIndexOf('```'))
     );
-  return `${data}\n<br>${misc.link('⬆ Back to top', misc.anchor('Table of Contents'))}\n\n`;
+  return `${data}\n<br>${misc.link('⬆ Back to top', misc.anchor('Contents'))}\n\n`;
 };
 
 if (util.isTravisCI() && /^Travis build: \d+/g.test(process.env['TRAVIS_COMMIT_MESSAGE'])) {

From 6cfd865d282940558cfbb013a900cac3ed4379ed Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Wed, 7 Nov 2018 08:07:42 +0000
Subject: [PATCH 12/16] Travis build: 742

---
 README.md | 670 +++++++++++++++++++++++++++---------------------------
 1 file changed, 335 insertions(+), 335 deletions(-)

diff --git a/README.md b/README.md
index db822344f..8378df587 100644
--- a/README.md
+++ b/README.md
@@ -531,7 +531,7 @@ const firstTwoMax = ary(Math.max, 2);
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### call
 
@@ -558,7 +558,7 @@ Promise.resolve([1, 2, 3])
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### collectInto
 
@@ -583,7 +583,7 @@ Pall(p1, p2, p3).then(console.log); // [1, 2, 3] (after about 2 seconds)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### flip
 
@@ -610,7 +610,7 @@ Object.assign(b, a); // == b
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### over
 
@@ -632,7 +632,7 @@ minMax(1, 2, 3, 4, 5); // [1,5]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### overArgs
 
@@ -656,7 +656,7 @@ fn(9, 3); // [81, 6]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pipeAsyncFunctions
 
@@ -687,7 +687,7 @@ const sum = pipeAsyncFunctions(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pipeFunctions
 
@@ -712,7 +712,7 @@ multiplyAndAdd5(5, 2); // 15
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### promisify
 
@@ -740,7 +740,7 @@ delay(2000).then(() => console.log('Hi!')); // // Promise resolves after 2s
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### rearg
 
@@ -767,7 +767,7 @@ rearged('b', 'c', 'a'); // ['a', 'b', 'c']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### spreadOver
 
@@ -789,7 +789,7 @@ arrayMax([1, 2, 3]); // 3
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unary
 
@@ -810,7 +810,7 @@ const unary = fn => val => fn(val);
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -838,7 +838,7 @@ all([1, 2, 3]); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### allEqual
 
@@ -860,7 +860,7 @@ allEqual([1, 1, 1, 1]); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### any
 
@@ -883,7 +883,7 @@ any([0, 0, 1, 0]); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### arrayToCSV
 
@@ -908,7 +908,7 @@ arrayToCSV([['a', 'b'], ['c', 'd']], ';'); // '"a";"b"\n"c";"d"'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### bifurcate
 
@@ -930,7 +930,7 @@ bifurcate(['beep', 'boop', 'foo', 'bar'], [true, true, false, true]); // [ ['bee
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### bifurcateBy
 
@@ -952,7 +952,7 @@ bifurcateBy(['beep', 'boop', 'foo', 'bar'], x => x[0] === 'b'); // [ ['beep', 'b
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### chunk
 
@@ -978,7 +978,7 @@ chunk([1, 2, 3, 4, 5], 2); // [[1,2],[3,4],[5]]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### compact
 
@@ -999,7 +999,7 @@ compact([0, 1, false, 2, '', 3, 'a', 'e' * 23, NaN, 's', 34]); // [ 1, 2, 3, 'a'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### countBy
 
@@ -1026,7 +1026,7 @@ countBy(['one', 'two', 'three'], 'length'); // {3: 2, 5: 1}
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### countOccurrences
 
@@ -1047,7 +1047,7 @@ countOccurrences([1, 1, 2, 1, 2, 3], 1); // 3
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### deepFlatten
 
@@ -1070,7 +1070,7 @@ deepFlatten([1, [2], [[3], 4], 5]); // [1,2,3,4,5]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### difference
 
@@ -1094,7 +1094,7 @@ difference([1, 2, 3], [1, 2, 4]); // [3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### differenceBy
 
@@ -1119,7 +1119,7 @@ differenceBy([{ x: 2 }, { x: 1 }], [{ x: 1 }], v => v.x); // [ { x: 2 } ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### differenceWith
 
@@ -1140,7 +1140,7 @@ differenceWith([1, 1.2, 1.5, 3, 0], [1.9, 3, 0], (a, b) => Math.round(a) === Mat
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### drop
 
@@ -1163,7 +1163,7 @@ drop([1, 2, 3], 42); // []
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### dropRight
 
@@ -1186,7 +1186,7 @@ dropRight([1, 2, 3], 42); // []
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### dropRightWhile
 
@@ -1211,7 +1211,7 @@ dropRightWhile([1, 2, 3, 4], n => n < 3); // [1, 2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### dropWhile
 
@@ -1236,7 +1236,7 @@ dropWhile([1, 2, 3, 4], n => n >= 3); // [3,4]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### everyNth
 
@@ -1257,7 +1257,7 @@ everyNth([1, 2, 3, 4, 5, 6], 2); // [ 2, 4, 6 ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### filterNonUnique
 
@@ -1278,7 +1278,7 @@ filterNonUnique([1, 2, 2, 3, 4, 4, 5]); // [1, 3, 5]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### filterNonUniqueBy
 
@@ -1310,7 +1310,7 @@ filterNonUniqueBy(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### findLast
 
@@ -1331,7 +1331,7 @@ findLast([1, 2, 3, 4], n => n % 2 === 1); // 3
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### findLastIndex
 
@@ -1357,7 +1357,7 @@ findLastIndex([1, 2, 3, 4], n => n % 2 === 1); // 2 (index of the value 3)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### flatten
 
@@ -1383,7 +1383,7 @@ flatten([1, [2, [3, [4, 5], 6], 7], 8], 2); // [1, 2, 3, [4, 5], 6, 7, 8]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### forEachRight
 
@@ -1408,7 +1408,7 @@ forEachRight([1, 2, 3, 4], val => console.log(val)); // '4', '3', '2', '1'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### groupBy
 
@@ -1435,7 +1435,7 @@ groupBy(['one', 'two', 'three'], 'length'); // {3: ['one', 'two'], 5: ['three']}
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### head
 
@@ -1456,7 +1456,7 @@ head([1, 2, 3]); // 1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### indexOfAll
 
@@ -1480,7 +1480,7 @@ indexOfAll([1, 2, 3], 4); // []
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### initial
 
@@ -1501,7 +1501,7 @@ initial([1, 2, 3]); // [1,2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### initialize2DArray
 
@@ -1523,7 +1523,7 @@ initialize2DArray(2, 2, 0); // [[0,0], [0,0]]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### initializeArrayWithRange
 
@@ -1549,7 +1549,7 @@ initializeArrayWithRange(9, 0, 2); // [0,2,4,6,8]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### initializeArrayWithRangeRight
 
@@ -1577,7 +1577,7 @@ initializeArrayWithRangeRight(9, 0, 2); // [8,6,4,2,0]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### initializeArrayWithValues
 
@@ -1599,7 +1599,7 @@ initializeArrayWithValues(5, 2); // [2, 2, 2, 2, 2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### initializeNDArray
 
@@ -1625,7 +1625,7 @@ initializeNDArray(5, 2, 2, 2); // [[[5,5],[5,5]],[[5,5],[5,5]]]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### intersection
 
@@ -1649,7 +1649,7 @@ intersection([1, 2, 3], [4, 3, 2]); // [2, 3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### intersectionBy
 
@@ -1673,7 +1673,7 @@ intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [2.1]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### intersectionWith
 
@@ -1694,7 +1694,7 @@ intersectionWith([1, 1.2, 1.5, 3, 0], [1.9, 3, 0, 3.9], (a, b) => Math.round(a)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isSorted
 
@@ -1726,7 +1726,7 @@ isSorted([4, 3, 5]); // 0
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### join
 
@@ -1761,7 +1761,7 @@ join(['pen', 'pineapple', 'apple', 'pen']); // "pen,pineapple,apple,pen"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### JSONtoCSV ![advanced](/advanced.svg)
 
@@ -1795,7 +1795,7 @@ JSONtoCSV([{ a: 1, b: 2 }, { a: 3, b: 4, c: 5 }, { a: 6 }, { b: 7 }], ['a', 'b']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### last
 
@@ -1816,7 +1816,7 @@ last([1, 2, 3]); // 3
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### longestItem
 
@@ -1843,7 +1843,7 @@ longestItem([1, 2, 3], 'foobar'); // 'foobar'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### mapObject ![advanced](/advanced.svg)
 
@@ -1868,7 +1868,7 @@ squareIt([1, 2, 3]); // { 1: 1, 2: 4, 3: 9 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### maxN
 
@@ -1893,7 +1893,7 @@ maxN([1, 2, 3], 2); // [3,2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### minN
 
@@ -1918,7 +1918,7 @@ minN([1, 2, 3], 2); // [1,2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### none
 
@@ -1941,7 +1941,7 @@ none([0, 0, 0]); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### nthElement
 
@@ -1965,7 +1965,7 @@ nthElement(['a', 'b', 'b'], -3); // 'a'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### offset
 
@@ -1989,7 +1989,7 @@ offset([1, 2, 3, 4, 5], -2); // [4, 5, 1, 2, 3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### partition
 
@@ -2019,7 +2019,7 @@ partition(users, o => o.active); // [[{ 'user': 'fred',    'age': 40, 'active':
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### permutations ![advanced](/advanced.svg)
 
@@ -2054,7 +2054,7 @@ permutations([1, 33, 5]); // [ [ 1, 33, 5 ], [ 1, 5, 33 ], [ 33, 1, 5 ], [ 33, 5
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pull
 
@@ -2084,7 +2084,7 @@ pull(myArray, 'a', 'c'); // myArray = [ 'b', 'b' ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pullAtIndex ![advanced](/advanced.svg)
 
@@ -2116,7 +2116,7 @@ let pulled = pullAtIndex(myArray, [1, 3]); // myArray = [ 'a', 'c' ] , pulled =
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pullAtValue ![advanced](/advanced.svg)
 
@@ -2147,7 +2147,7 @@ let pulled = pullAtValue(myArray, ['b', 'd']); // myArray = [ 'a', 'c' ] , pulle
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pullBy ![advanced](/advanced.svg)
 
@@ -2180,7 +2180,7 @@ pullBy(myArray, [{ x: 1 }, { x: 3 }], o => o.x); // myArray = [{ x: 2 }]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### reducedFilter
 
@@ -2221,7 +2221,7 @@ reducedFilter(data, ['id', 'name'], item => item.age > 24); // [{ id: 2, name: '
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### reduceSuccessive
 
@@ -2243,7 +2243,7 @@ reduceSuccessive([1, 2, 3, 4, 5, 6], (acc, val) => acc + val, 0); // [0, 1, 3, 6
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### reduceWhich
 
@@ -2271,7 +2271,7 @@ reduceWhich(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### reject
 
@@ -2291,7 +2291,7 @@ reject(word => word.length > 4, ['Apple', 'Pear', 'Kiwi', 'Banana']); // ['Pear'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### remove
 
@@ -2319,7 +2319,7 @@ remove([1, 2, 3, 4], n => n % 2 === 0); // [2, 4]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sample
 
@@ -2341,7 +2341,7 @@ sample([3, 7, 9, 11]); // 9
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sampleSize
 
@@ -2372,7 +2372,7 @@ sampleSize([1, 2, 3], 4); // [2,3,1]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### shank
 
@@ -2403,7 +2403,7 @@ console.log(names); // ['alpha', 'bravo', 'charlie']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### shuffle
 
@@ -2432,7 +2432,7 @@ shuffle(foo); // [2, 3, 1], foo = [1, 2, 3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### similarity
 
@@ -2453,7 +2453,7 @@ similarity([1, 2, 3], [1, 2, 4]); // [1, 2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sortedIndex
 
@@ -2480,7 +2480,7 @@ sortedIndex([30, 50], 40); // 1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sortedIndexBy
 
@@ -2507,7 +2507,7 @@ sortedIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 0
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sortedLastIndex
 
@@ -2533,7 +2533,7 @@ sortedLastIndex([10, 20, 30, 30, 40], 30); // 4
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sortedLastIndexBy
 
@@ -2564,7 +2564,7 @@ sortedLastIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### stableSort ![advanced](/advanced.svg)
 
@@ -2593,7 +2593,7 @@ const stable = stableSort(arr, () => 0); // [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### symmetricDifference
 
@@ -2619,7 +2619,7 @@ symmetricDifference([1, 2, 2], [1, 3, 1]); // [2, 2, 3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### symmetricDifferenceBy
 
@@ -2644,7 +2644,7 @@ symmetricDifferenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [ 1.2, 3.4 ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### symmetricDifferenceWith
 
@@ -2672,7 +2672,7 @@ symmetricDifferenceWith(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### tail
 
@@ -2694,7 +2694,7 @@ tail([1]); // [1]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### take
 
@@ -2716,7 +2716,7 @@ take([1, 2, 3], 0); // []
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### takeRight
 
@@ -2738,7 +2738,7 @@ takeRight([1, 2, 3]); // [3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### takeRightWhile
 
@@ -2760,7 +2760,7 @@ takeRightWhile([1, 2, 3, 4], n => n < 3); // [3, 4]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### takeWhile
 
@@ -2785,7 +2785,7 @@ takeWhile([1, 2, 3, 4], n => n >= 3); // [1, 2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toHash
 
@@ -2823,7 +2823,7 @@ managers; // [ { manager:1, employees: [ { id: 2, first: "Joe" }, { id: 3, first
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### union
 
@@ -2844,7 +2844,7 @@ union([1, 2, 3], [4, 3, 2]); // [1,2,3,4]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unionBy
 
@@ -2870,7 +2870,7 @@ unionBy([2.1], [1.2, 2.3], Math.floor); // [2.1, 1.2]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unionWith
 
@@ -2892,7 +2892,7 @@ unionWith([1, 1.2, 1.5, 3, 0], [1.9, 3, 0, 3.9], (a, b) => Math.round(a) === Mat
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### uniqueElements
 
@@ -2913,7 +2913,7 @@ uniqueElements([1, 2, 2, 3, 4, 4, 5]); // [1, 2, 3, 4, 5]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### uniqueElementsBy
 
@@ -2948,7 +2948,7 @@ uniqueElementsBy(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### uniqueElementsByRight
 
@@ -2983,7 +2983,7 @@ uniqueElementsByRight(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### uniqueSymmetricDifference
 
@@ -3007,7 +3007,7 @@ uniqueSymmetricDifference([1, 2, 2], [1, 3, 1]); // [2, 3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unzip
 
@@ -3036,7 +3036,7 @@ unzip([['a', 1, true], ['b', 2]]); // [['a', 'b'], [1, 2], [true]]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unzipWith ![advanced](/advanced.svg)
 
@@ -3067,7 +3067,7 @@ unzipWith([[1, 10, 100], [2, 20, 200]], (...args) => args.reduce((acc, v) => acc
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### without
 
@@ -3090,7 +3090,7 @@ without([2, 1, 2, 3], 1, 2); // [3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### xProd
 
@@ -3111,7 +3111,7 @@ xProd([1, 2], ['a', 'b']); // [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### zip
 
@@ -3140,7 +3140,7 @@ zip(['a'], [1, 2], [true, false]); // [['a', 1, true], [undefined, 2, false]]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### zipObject
 
@@ -3163,7 +3163,7 @@ zipObject(['a', 'b'], [1, 2, 3]); // {a: 1, b: 2}
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### zipWith ![advanced](/advanced.svg)
 
@@ -3200,7 +3200,7 @@ zipWith(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -3230,7 +3230,7 @@ arrayToHtmlList(['item 1', 'item 2'], 'myListID');
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### bottomVisible
 
@@ -3253,7 +3253,7 @@ bottomVisible(); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### copyToClipboard ![advanced](/advanced.svg)
 
@@ -3297,7 +3297,7 @@ copyToClipboard('Lorem ipsum'); // 'Lorem ipsum' copied to clipboard.
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### counter ![advanced](/advanced.svg)
 
@@ -3332,7 +3332,7 @@ counter('#my-id', 1, 1000, 5, 2000); // Creates a 2-second timer for the element
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### createElement
 
@@ -3365,7 +3365,7 @@ console.log(el.className); // 'container'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### createEventHub ![advanced](/advanced.svg)
 
@@ -3418,7 +3418,7 @@ hub.off('message', handler);
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### currentURL
 
@@ -3439,7 +3439,7 @@ currentURL(); // 'https://google.com'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### detectDeviceType
 
@@ -3463,7 +3463,7 @@ detectDeviceType(); // "Mobile" or "Desktop"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### elementContains
 
@@ -3485,7 +3485,7 @@ elementContains(document.querySelector('body'), document.querySelector('body'));
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### elementIsVisibleInViewport ![advanced](/advanced.svg)
 
@@ -3518,7 +3518,7 @@ elementIsVisibleInViewport(el, true); // true - (partially visible)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getImages
 
@@ -3543,7 +3543,7 @@ getImages(document, false); // ['image1.jpg', 'image2.png', '...']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getScrollPosition
 
@@ -3568,7 +3568,7 @@ getScrollPosition(); // {x: 0, y: 200}
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getStyle
 
@@ -3589,7 +3589,7 @@ getStyle(document.querySelector('p'), 'font-size'); // '16px'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hasClass
 
@@ -3610,7 +3610,7 @@ hasClass(document.querySelector('p.special'), 'special'); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hashBrowser ![advanced](/advanced.svg)
 
@@ -3638,7 +3638,7 @@ hashBrowser(JSON.stringify({ a: 'a', b: [1, 2, 3, 4], foo: { c: 'bar' } })).then
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hide
 
@@ -3659,7 +3659,7 @@ hide(document.querySelectorAll('img')); // Hides all <img> elements on the page
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### httpsRedirect
 
@@ -3682,7 +3682,7 @@ httpsRedirect(); // If you are on http://mydomain.com, you are redirected to htt
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### insertAfter
 
@@ -3703,7 +3703,7 @@ insertAfter(document.getElementById('myId'), '<p>after</p>'); // <div id="myId">
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### insertBefore
 
@@ -3724,7 +3724,7 @@ insertBefore(document.getElementById('myId'), '<p>before</p>'); // <p>before</p>
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isBrowserTabFocused
 
@@ -3745,7 +3745,7 @@ isBrowserTabFocused(); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### nodeListToArray
 
@@ -3766,7 +3766,7 @@ nodeListToArray(document.childNodes); // [ <!DOCTYPE html>, html ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### observeMutations ![advanced](/advanced.svg)
 
@@ -3807,7 +3807,7 @@ obs.disconnect(); // Disconnects the observer and stops logging mutations on the
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### off
 
@@ -3831,7 +3831,7 @@ off(document.body, 'click', fn); // no longer logs '!' upon clicking on the page
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### on
 
@@ -3861,7 +3861,7 @@ on(document.body, 'click', fn, { options: true }); // use capturing instead of b
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### onUserInputChange ![advanced](/advanced.svg)
 
@@ -3899,7 +3899,7 @@ onUserInputChange(type => {
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### prefix
 
@@ -3928,7 +3928,7 @@ prefix('appearance'); // 'appearance' on a supported browser, otherwise 'webkitA
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### recordAnimationFrames
 
@@ -3975,7 +3975,7 @@ const recorder2 = recordAnimationFrames(cb, false); // `start` needs to be expli
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### redirect
 
@@ -3998,7 +3998,7 @@ redirect('https://google.com');
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### runAsync ![advanced](/advanced.svg)
 
@@ -4050,7 +4050,7 @@ runAsync(() => typeof outsideVariable).then(console.log); // 'undefined'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### scrollToTop
 
@@ -4078,7 +4078,7 @@ scrollToTop();
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### setStyle
 
@@ -4099,7 +4099,7 @@ setStyle(document.querySelector('p'), 'font-size', '20px'); // The first <p> ele
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### show
 
@@ -4120,7 +4120,7 @@ show(...document.querySelectorAll('img')); // Shows all <img> elements on the pa
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### smoothScroll
 
@@ -4146,7 +4146,7 @@ smoothScroll('.fooBar'); // scrolls smoothly to the first element with a class o
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toggleClass
 
@@ -4167,7 +4167,7 @@ toggleClass(document.querySelector('p.special'), 'special'); // The paragraph wi
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### triggerEvent
 
@@ -4192,7 +4192,7 @@ triggerEvent(document.getElementById('myId'), 'click', { username: 'bob' });
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### UUIDGeneratorBrowser
 
@@ -4216,7 +4216,7 @@ UUIDGeneratorBrowser(); // '7982fcfe-5721-4632-bede-6000885be57d'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -4244,7 +4244,7 @@ dayOfYear(new Date()); // 272
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### formatDuration
 
@@ -4282,7 +4282,7 @@ formatDuration(34325055574); // '397 days, 6 hours, 44 minutes, 15 seconds, 574
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getColonTimeFromDate
 
@@ -4303,7 +4303,7 @@ getColonTimeFromDate(new Date()); // "08:38:00"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getDaysDiffBetweenDates
 
@@ -4325,7 +4325,7 @@ getDaysDiffBetweenDates(new Date('2017-12-13'), new Date('2017-12-22')); // 9
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getMeridiemSuffixOfInteger
 
@@ -4356,7 +4356,7 @@ getMeridiemSuffixOfInteger(25); // "1pm"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isAfterDate
 
@@ -4377,7 +4377,7 @@ isAfterDate(new Date(2010, 10, 21), new Date(2010, 10, 20)); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isBeforeDate
 
@@ -4398,7 +4398,7 @@ isBeforeDate(new Date(2010, 10, 20), new Date(2010, 10, 21)); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isSameDate
 
@@ -4419,7 +4419,7 @@ isSameDate(new Date(2010, 10, 20), new Date(2010, 10, 20)); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### maxDate
 
@@ -4446,7 +4446,7 @@ maxDate(array); // 2018-03-11T22:00:00.000Z
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### minDate
 
@@ -4473,7 +4473,7 @@ minDate(array); // 2016-01-08T22:00:00.000Z
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### tomorrow
 
@@ -4502,7 +4502,7 @@ tomorrow(true); // 2017-12-27T00:00:00 (if current date is 2017-12-26)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -4537,7 +4537,7 @@ if (elements instanceof Error) elements = []; // elements = []
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### bind
 
@@ -4564,7 +4564,7 @@ console.log(freddyBound('hi', '!')); // 'hi fred!'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### bindKey
 
@@ -4594,7 +4594,7 @@ console.log(freddyBound('hi', '!')); // 'hi fred!'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### chainAsync
 
@@ -4627,7 +4627,7 @@ chainAsync([
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### compose
 
@@ -4655,7 +4655,7 @@ multiplyAndAdd5(5, 2); // 15
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### composeRight
 
@@ -4680,7 +4680,7 @@ addAndSquare(1, 2); // 9
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### converge
 
@@ -4706,7 +4706,7 @@ average([1, 2, 3, 4, 5, 6, 7]); // 4
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### curry
 
@@ -4732,7 +4732,7 @@ curry(Math.min, 3)(10)(50)(2); // 2
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### debounce
 
@@ -4766,7 +4766,7 @@ window.addEventListener(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### defer
 
@@ -4793,7 +4793,7 @@ defer(longRunningFunction); // Browser will update the HTML then run the functio
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### delay
 
@@ -4821,7 +4821,7 @@ delay(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### functionName
 
@@ -4842,7 +4842,7 @@ functionName(Math.max); // max (logged in debug channel of console)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hz
 
@@ -4885,7 +4885,7 @@ Math.round(hz(sumForLoop)); // 4784
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### memoize ![advanced](/advanced.svg)
 
@@ -4919,7 +4919,7 @@ console.log(anagramsCached.cache); // The cached anagrams map
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### negate
 
@@ -4940,7 +4940,7 @@ const negate = func => (...args) => !func(...args);
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### once
 
@@ -4972,7 +4972,7 @@ document.body.addEventListener('click', once(startApp)); // only runs `startApp`
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### partial
 
@@ -4995,7 +4995,7 @@ greetHello('John'); // 'Hello John!'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### partialRight
 
@@ -5018,7 +5018,7 @@ greetJohn('Hello'); // 'Hello John!'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### runPromisesInSeries
 
@@ -5040,7 +5040,7 @@ runPromisesInSeries([() => delay(1000), () => delay(2000)]); // Executes each pr
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sleep
 
@@ -5065,7 +5065,7 @@ async function sleepyWork() {
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### throttle ![advanced](/advanced.svg)
 
@@ -5114,7 +5114,7 @@ window.addEventListener(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### times
 
@@ -5141,7 +5141,7 @@ console.log(output); // 01234
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### uncurry
 
@@ -5172,7 +5172,7 @@ uncurriedAdd(1, 2, 3); // 6
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unfold
 
@@ -5200,7 +5200,7 @@ unfold(f, 10); // [-10, -20, -30, -40, -50]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### when
 
@@ -5223,7 +5223,7 @@ doubleEvenNumbers(1); // 1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -5250,7 +5250,7 @@ approximatelyEqual(Math.PI / 2.0, 1.5708); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### average
 
@@ -5272,7 +5272,7 @@ average(1, 2, 3); // 2
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### averageBy
 
@@ -5296,7 +5296,7 @@ averageBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 5
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### binomialCoefficient
 
@@ -5330,7 +5330,7 @@ binomialCoefficient(8, 2); // 28
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### clampNumber
 
@@ -5353,7 +5353,7 @@ clampNumber(1, -1, -5); // -1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### degreesToRads
 
@@ -5374,7 +5374,7 @@ degreesToRads(90.0); // ~1.5708
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### digitize
 
@@ -5396,7 +5396,7 @@ digitize(123); // [1, 2, 3]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### distance
 
@@ -5417,7 +5417,7 @@ distance(1, 1, 2, 3); // 2.23606797749979
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### elo ![advanced](/advanced.svg)
 
@@ -5467,7 +5467,7 @@ own individual rating by supplying it as the third argument.
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### factorial
 
@@ -5498,7 +5498,7 @@ factorial(6); // 720
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### fibonacci
 
@@ -5524,7 +5524,7 @@ fibonacci(6); // [0, 1, 1, 2, 3, 5]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### gcd
 
@@ -5551,7 +5551,7 @@ gcd(...[12, 8, 32]); // 4
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### geometricProgression
 
@@ -5580,7 +5580,7 @@ geometricProgression(256, 1, 4); // [1, 4, 16, 64, 256]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hammingDistance
 
@@ -5602,7 +5602,7 @@ hammingDistance(2, 3); // 1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### inRange
 
@@ -5630,7 +5630,7 @@ inRange(3, 2); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isDivisible
 
@@ -5651,7 +5651,7 @@ isDivisible(6, 3); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isEven
 
@@ -5673,7 +5673,7 @@ isEven(3); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isPrime
 
@@ -5699,7 +5699,7 @@ isPrime(11); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### lcm
 
@@ -5726,7 +5726,7 @@ lcm(...[1, 3, 4, 5]); // 60
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### luhnCheck ![advanced](/advanced.svg)
 
@@ -5762,7 +5762,7 @@ luhnCheck(123456789); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### maxBy
 
@@ -5784,7 +5784,7 @@ maxBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 8
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### median
 
@@ -5810,7 +5810,7 @@ median([5, 6, 50, 1, -5]); // 5
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### minBy
 
@@ -5832,7 +5832,7 @@ minBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 2
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### percentile
 
@@ -5854,7 +5854,7 @@ percentile([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 6); // 55
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### powerset
 
@@ -5875,7 +5875,7 @@ powerset([1, 2]); // [[], [1], [2], [2, 1]]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### primes
 
@@ -5902,7 +5902,7 @@ primes(10); // [2,3,5,7]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### radsToDegrees
 
@@ -5923,7 +5923,7 @@ radsToDegrees(Math.PI / 2); // 90
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### randomIntArrayInRange
 
@@ -5945,7 +5945,7 @@ randomIntArrayInRange(12, 35, 10); // [ 34, 14, 27, 17, 30, 27, 20, 26, 21, 14 ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### randomIntegerInRange
 
@@ -5966,7 +5966,7 @@ randomIntegerInRange(0, 5); // 2
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### randomNumberInRange
 
@@ -5987,7 +5987,7 @@ randomNumberInRange(2, 10); // 6.0211363285087005
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### round
 
@@ -6009,7 +6009,7 @@ round(1.005, 2); // 1.01
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sdbm
 
@@ -6037,7 +6037,7 @@ sdbm('name'); // -3521204949
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### standardDeviation
 
@@ -6067,7 +6067,7 @@ standardDeviation([10, 2, 38, 23, 38, 23, 21], true); // 12.29899614287479 (popu
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sum
 
@@ -6088,7 +6088,7 @@ sum(...[1, 2, 3, 4]); // 10
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sumBy
 
@@ -6111,7 +6111,7 @@ sumBy([{ n: 4 }, { n: 2 }, { n: 8 }, { n: 6 }], 'n'); // 20
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sumPower
 
@@ -6140,7 +6140,7 @@ sumPower(10, 3, 5); // 2925
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toSafeInteger
 
@@ -6164,7 +6164,7 @@ toSafeInteger(Infinity); // 9007199254740991
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -6190,7 +6190,7 @@ atob('Zm9vYmFy'); // 'foobar'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### btoa
 
@@ -6211,7 +6211,7 @@ btoa('foobar'); // 'Zm9vYmFy'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### colorize
 
@@ -6252,7 +6252,7 @@ console.log(colorize(colorize('foo').yellow, colorize('foo').green).bgWhite); //
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hasFlags
 
@@ -6278,7 +6278,7 @@ hasFlags('special'); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hashNode
 
@@ -6312,7 +6312,7 @@ hashNode(JSON.stringify({ a: 'a', b: [1, 2, 3, 4], foo: { c: 'bar' } })).then(co
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isDuplexStream
 
@@ -6342,7 +6342,7 @@ isDuplexStream(new Stream.Duplex()); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isReadableStream
 
@@ -6370,7 +6370,7 @@ isReadableStream(fs.createReadStream('test.txt')); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isStream
 
@@ -6392,7 +6392,7 @@ isStream(fs.createReadStream('test.txt')); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isTravisCI
 
@@ -6413,7 +6413,7 @@ isTravisCI(); // true (if code is running on Travis CI)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isWritableStream
 
@@ -6441,7 +6441,7 @@ isWritableStream(fs.createWriteStream('test.txt')); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### JSONToFile
 
@@ -6464,7 +6464,7 @@ JSONToFile({ test: 'is passed' }, 'testJsonFile'); // writes the object to 'test
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### readFileLines
 
@@ -6501,7 +6501,7 @@ console.log(arr); // ['line1', 'line2', 'line3']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### untildify
 
@@ -6522,7 +6522,7 @@ untildify('~/node'); // '/Users/aUser/node'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### UUIDGeneratorNode
 
@@ -6547,7 +6547,7 @@ UUIDGeneratorNode(); // '79c7c136-60ee-40a2-beb2-856f1feabefc'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -6588,7 +6588,7 @@ jQuery(element).on('click', view.click); // Logs 'clicked docs' when clicked.
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### deepClone
 
@@ -6618,7 +6618,7 @@ const b = deepClone(a); // a !== b, a.obj !== b.obj
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### deepFreeze
 
@@ -6648,7 +6648,7 @@ o[1][0] = 4; // not allowed as well
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### defaults
 
@@ -6669,7 +6669,7 @@ defaults({ a: 1 }, { b: 2 }, { b: 6 }, { a: 3 }); // { a: 1, b: 2 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### dig
 
@@ -6705,7 +6705,7 @@ dig(data, 'level4'); // undefined
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### equals ![advanced](/advanced.svg)
 
@@ -6737,7 +6737,7 @@ equals({ a: [2, { e: 3 }], b: [4], c: 'foo' }, { a: [2, { e: 3 }], b: [4], c: 'f
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### findKey
 
@@ -6765,7 +6765,7 @@ findKey(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### findLastKey
 
@@ -6798,7 +6798,7 @@ findLastKey(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### flattenObject
 
@@ -6829,7 +6829,7 @@ flattenObject({ a: { b: { c: 1 } }, d: 1 }); // { 'a.b.c': 1, d: 1 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### forOwn
 
@@ -6850,7 +6850,7 @@ forOwn({ foo: 'bar', a: 1 }, v => console.log(v)); // 'bar', 1
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### forOwnRight
 
@@ -6874,7 +6874,7 @@ forOwnRight({ foo: 'bar', a: 1 }, v => console.log(v)); // 1, 'bar'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### functions
 
@@ -6908,7 +6908,7 @@ functions(new Foo(), true); // ['a', 'b', 'c']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### get
 
@@ -6937,7 +6937,7 @@ get(obj, 'selector.to.val', 'target[0]', 'target[2].a'); // ['val to select', 1,
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### invertKeyValues
 
@@ -6966,7 +6966,7 @@ invertKeyValues({ a: 1, b: 2, c: 1 }, value => 'group' + value); // { group1: [
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### lowercaseKeys
 
@@ -6993,7 +6993,7 @@ const myObjLower = lowercaseKeys(myObj); // {name: 'Adam', surname: 'Smith'};
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### mapKeys
 
@@ -7019,7 +7019,7 @@ mapKeys({ a: 1, b: 2 }, (val, key) => key + val); // { a1: 1, b2: 2 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### mapValues
 
@@ -7049,7 +7049,7 @@ mapValues(users, u => u.age); // { fred: 40, pebbles: 1 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### matches
 
@@ -7072,7 +7072,7 @@ matches({ hair: 'long', beard: true }, { age: 25, hair: 'long', beard: true });
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### matchesWith
 
@@ -7105,7 +7105,7 @@ matchesWith(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### merge
 
@@ -7144,7 +7144,7 @@ merge(object, other); // { a: [ { x: 2 }, { y: 4 }, { z: 3 } ], b: [ 1, 2, 3 ],
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### nest
 
@@ -7181,7 +7181,7 @@ const nestedComments = nest(comments); // [{ id: 1, parent_id: null, children: [
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### objectFromPairs
 
@@ -7202,7 +7202,7 @@ objectFromPairs([['a', 1], ['b', 2]]); // {a: 1, b: 2}
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### objectToPairs
 
@@ -7223,7 +7223,7 @@ objectToPairs({ a: 1, b: 2 }); // [ ['a', 1], ['b', 2] ]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### omit
 
@@ -7248,7 +7248,7 @@ omit({ a: 1, b: '2', c: 3 }, ['b']); // { 'a': 1, 'c': 3 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### omitBy
 
@@ -7273,7 +7273,7 @@ omitBy({ a: 1, b: '2', c: 3 }, x => typeof x === 'number'); // { b: '2' }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### orderBy
 
@@ -7306,7 +7306,7 @@ orderBy(users, ['name', 'age']); // [{name: 'barney', age: 36}, {name: 'fred', a
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pick
 
@@ -7328,7 +7328,7 @@ pick({ a: 1, b: '2', c: 3 }, ['a', 'c']); // { 'a': 1, 'c': 3 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pickBy
 
@@ -7353,7 +7353,7 @@ pickBy({ a: 1, b: '2', c: 3 }, x => typeof x === 'number'); // { 'a': 1, 'c': 3
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### renameKeys
 
@@ -7382,7 +7382,7 @@ renameKeys({ name: 'firstName', job: 'passion' }, obj); // { firstName: 'Bobo',
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### shallowClone
 
@@ -7404,7 +7404,7 @@ const b = shallowClone(a); // a !== b
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### size
 
@@ -7439,7 +7439,7 @@ size({ one: 1, two: 2, three: 3 }); // 3
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### transform
 
@@ -7467,7 +7467,7 @@ transform(
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### truthCheckCollection
 
@@ -7488,7 +7488,7 @@ truthCheckCollection([{ user: 'Tinky-Winky', sex: 'male' }, { user: 'Dipsy', sex
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unflattenObject ![advanced](/advanced.svg)
 
@@ -7526,7 +7526,7 @@ unflattenObject({ 'a.b.c': 1, d: 1 }); // { a: { b: { c: 1 } }, d: 1 }
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -7553,7 +7553,7 @@ byteSize('Hello World'); // 11
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### capitalize
 
@@ -7577,7 +7577,7 @@ capitalize('fooBar', true); // 'Foobar'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### capitalizeEveryWord
 
@@ -7598,7 +7598,7 @@ capitalizeEveryWord('hello world!'); // 'Hello World!'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### CSVToArray
 
@@ -7628,7 +7628,7 @@ CSVToArray('col1,col2\na,b\nc,d', ',', true); // [['a','b'],['c','d']];
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### CSVToJSON ![advanced](/advanced.svg)
 
@@ -7663,7 +7663,7 @@ CSVToJSON('col1;col2\na;b\nc;d', ';'); // [{'col1': 'a', 'col2': 'b'}, {'col1':
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### decapitalize
 
@@ -7687,7 +7687,7 @@ decapitalize('FooBar', true); // 'fOOBAR'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### escapeHTML
 
@@ -7719,7 +7719,7 @@ escapeHTML('<a href="#">Me & you</a>'); // '&lt;a href=&quot;#&quot;&gt;Me &amp;
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### escapeRegExp
 
@@ -7740,7 +7740,7 @@ escapeRegExp('(test)'); // \\(test\\)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### fromCamelCase
 
@@ -7768,7 +7768,7 @@ fromCamelCase('someJavascriptProperty', '_'); // 'some_javascript_property'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### indentString
 
@@ -7791,7 +7791,7 @@ indentString('Lorem\nIpsum', 2, '_'); // '__Lorem\n__Ipsum'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isAbsoluteURL
 
@@ -7814,7 +7814,7 @@ isAbsoluteURL('/foo/bar'); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isAnagram
 
@@ -7844,7 +7844,7 @@ isAnagram('iceman', 'cinema'); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isLowerCase
 
@@ -7867,7 +7867,7 @@ isLowerCase('Ab4'); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isUpperCase
 
@@ -7891,7 +7891,7 @@ isLowerCase('aB4'); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### mapString
 
@@ -7918,7 +7918,7 @@ mapString('lorem ipsum', c => c.toUpperCase()); // 'LOREM IPSUM'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### mask
 
@@ -7943,7 +7943,7 @@ mask(1234567890, -4, '$'); // '$$$$567890'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pad
 
@@ -7968,7 +7968,7 @@ pad('foobar', 3); // 'foobar'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### palindrome
 
@@ -7993,7 +7993,7 @@ palindrome('taco cat'); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### pluralize
 
@@ -8029,7 +8029,7 @@ autoPluralize(2, 'person'); // 'people'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### removeNonASCII
 
@@ -8050,7 +8050,7 @@ removeNonASCII('äÄçÇéÉêlorem-ipsumöÖÐþúÚ'); // 'lorem-ipsum'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### reverseString
 
@@ -8072,7 +8072,7 @@ reverseString('foobar'); // 'raboof'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### sortCharactersInString
 
@@ -8093,7 +8093,7 @@ sortCharactersInString('cabbage'); // 'aabbceg'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### splitLines
 
@@ -8114,7 +8114,7 @@ splitLines('This\nis a\nmultiline\nstring.\n'); // ['This', 'is a', 'multiline',
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### stringPermutations ![advanced](/advanced.svg)
 
@@ -8149,7 +8149,7 @@ stringPermutations('abc'); // ['abc','acb','bac','bca','cab','cba']
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### stripHTMLTags
 
@@ -8170,7 +8170,7 @@ stripHTMLTags('<p><em>lorem</em> <strong>ipsum</strong></p>'); // 'lorem ipsum'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toCamelCase
 
@@ -8202,7 +8202,7 @@ toCamelCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'someMi
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toKebabCase
 
@@ -8232,7 +8232,7 @@ toKebabCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSo
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toSnakeCase
 
@@ -8262,7 +8262,7 @@ toSnakeCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSo
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toTitleCase
 
@@ -8290,7 +8290,7 @@ toTitleCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'Some M
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### truncateString
 
@@ -8313,7 +8313,7 @@ truncateString('boomerang', 7); // 'boom...'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### unescapeHTML
 
@@ -8345,7 +8345,7 @@ unescapeHTML('&lt;a href=&quot;#&quot;&gt;Me &amp; you&lt;/a&gt;'); // '<a href=
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### URLJoin ![advanced](/advanced.svg)
 
@@ -8374,7 +8374,7 @@ URLJoin('http://www.google.com', 'a', '/b/cd', '?foo=123', '?bar=foo'); // 'http
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### words
 
@@ -8397,7 +8397,7 @@ words('python, javaScript & coffee'); // ["python", "javaScript", "coffee"]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -8424,7 +8424,7 @@ getType(new Set([1, 2, 3])); // 'set'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### is
 
@@ -8457,7 +8457,7 @@ is(Boolean, new Boolean(true)); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isArrayLike
 
@@ -8480,7 +8480,7 @@ isArrayLike(null); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isBoolean
 
@@ -8502,7 +8502,7 @@ isBoolean(false); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isEmpty
 
@@ -8532,7 +8532,7 @@ isEmpty(true); // true - type is not considered a collection
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isFunction
 
@@ -8554,7 +8554,7 @@ isFunction(x => x); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isNil
 
@@ -8576,7 +8576,7 @@ isNil(undefined); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isNull
 
@@ -8597,7 +8597,7 @@ isNull(null); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isNumber
 
@@ -8619,7 +8619,7 @@ isNumber(1); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isObject
 
@@ -8646,7 +8646,7 @@ isObject(true); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isObjectLike
 
@@ -8670,7 +8670,7 @@ isObjectLike(null); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isPlainObject
 
@@ -8692,7 +8692,7 @@ isPlainObject(new Map()); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isPrimitive
 
@@ -8718,7 +8718,7 @@ isPrimitive([]); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isPromiseLike
 
@@ -8748,7 +8748,7 @@ isPromiseLike({}); // false
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isString
 
@@ -8769,7 +8769,7 @@ isString('10'); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isSymbol
 
@@ -8790,7 +8790,7 @@ isSymbol(Symbol('x')); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isUndefined
 
@@ -8811,7 +8811,7 @@ isUndefined(undefined); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isValidJSON
 
@@ -8841,7 +8841,7 @@ isValidJSON(null); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ---
@@ -8868,7 +8868,7 @@ castArray([1]); // [1]
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### cloneRegExp
 
@@ -8890,7 +8890,7 @@ const regExp2 = cloneRegExp(regExp); // /lorem ipsum/gi
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### coalesce
 
@@ -8911,7 +8911,7 @@ coalesce(null, undefined, '', NaN, 'Waldo'); // ""
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### coalesceFactory
 
@@ -8933,7 +8933,7 @@ customCoalesce(undefined, null, NaN, '', 'Waldo'); // "Waldo"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### extendHex
 
@@ -8962,7 +8962,7 @@ extendHex('05a'); // '#0055aa'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### getURLParameters
 
@@ -8989,7 +8989,7 @@ getURLParameters('google.com'); // {}
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### hexToRGB ![advanced](/advanced.svg)
 
@@ -9030,7 +9030,7 @@ hexToRGB('#fff'); // 'rgb(255, 255, 255)'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### httpGet
 
@@ -9070,7 +9070,7 @@ Logs: {
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### httpPost
 
@@ -9130,7 +9130,7 @@ Logs: {
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### isBrowser
 
@@ -9154,7 +9154,7 @@ isBrowser(); // false (Node)
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### mostPerformant
 
@@ -9193,7 +9193,7 @@ mostPerformant([
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### nthArg
 
@@ -9218,7 +9218,7 @@ last(1, 2, 3, 4, 5); // 5
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### parseCookie
 
@@ -9248,7 +9248,7 @@ parseCookie('foo=bar; equation=E%3Dmc%5E2'); // { foo: 'bar', equation: 'E=mc^2'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### prettyBytes ![advanced](/advanced.svg)
 
@@ -9281,7 +9281,7 @@ prettyBytes(123456789, 3, false); // "123MB"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### randomHexColorCode
 
@@ -9305,7 +9305,7 @@ randomHexColorCode(); // "#e34155"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### RGBToHex
 
@@ -9326,7 +9326,7 @@ RGBToHex(255, 165, 1); // 'ffa501'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### serializeCookie
 
@@ -9347,7 +9347,7 @@ serializeCookie('foo', 'bar'); // 'foo=bar'
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### timeTaken
 
@@ -9373,7 +9373,7 @@ timeTaken(() => Math.pow(2, 10)); // 1024, (logged): timeTaken: 0.02099609375ms
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toCurrency
 
@@ -9399,7 +9399,7 @@ toCurrency(322342436423.2435, 'JPY', 'fi'); // 322 342 436 423 ¥ | currency: Ja
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toDecimalMark
 
@@ -9418,7 +9418,7 @@ toDecimalMark(12305030388.9087); // "12,305,030,388.909"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### toOrdinalSuffix
 
@@ -9450,7 +9450,7 @@ toOrdinalSuffix('123'); // "123rd"
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### validateNumber
 
@@ -9473,7 +9473,7 @@ validateNumber('10'); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 ### yesNo
 
@@ -9499,7 +9499,7 @@ yesNo('Foo', true); // true
 
 </details>
 
-<br>[⬆ Back to top](#table-of-contents)
+<br>[⬆ Back to top](#contents)
 
 
 ## Collaborators

From 0f258be02a1eeb8fc2b406be3363e4dc0f0341c4 Mon Sep 17 00:00:00 2001
From: Angelos Chalaris <chalarangelo@gmail.com>
Date: Wed, 7 Nov 2018 10:10:21 +0200
Subject: [PATCH 13/16] Update README-start.md

---
 static-parts/README-start.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/static-parts/README-start.md b/static-parts/README-start.md
index ed4b442cd..07b7ffc0e 100644
--- a/static-parts/README-start.md
+++ b/static-parts/README-start.md
@@ -2,8 +2,8 @@
 
 # 30 seconds of code
 
-[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code)  <br/> 
-[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
+[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)] <br/> 
+[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard)(https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
 [![Awesome](https://awesome.re/badge.svg)](https://awesome.re) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com)
 
 > Curated collection of useful JavaScript snippets that you can understand in 30 seconds or less.

From 733b921b4f33ac26e237d087a6910e024cddc4f6 Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Wed, 7 Nov 2018 08:12:07 +0000
Subject: [PATCH 14/16] Travis build: 744

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 8378df587..ac6dd1784 100644
--- a/README.md
+++ b/README.md
@@ -2,8 +2,8 @@
 
 # 30 seconds of code
 
-[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code)  <br/> 
-[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
+[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)] <br/> 
+[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard)(https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
 [![Awesome](https://awesome.re/badge.svg)](https://awesome.re) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com)
 
 > Curated collection of useful JavaScript snippets that you can understand in 30 seconds or less.

From c3108882b638d9742e2d94f09eb488b73714bc41 Mon Sep 17 00:00:00 2001
From: Angelos Chalaris <chalarangelo@gmail.com>
Date: Wed, 7 Nov 2018 11:36:35 +0200
Subject: [PATCH 15/16] Update README-start.md

---
 static-parts/README-start.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/static-parts/README-start.md b/static-parts/README-start.md
index 07b7ffc0e..305b2d4f3 100644
--- a/static-parts/README-start.md
+++ b/static-parts/README-start.md
@@ -2,8 +2,8 @@
 
 # 30 seconds of code
 
-[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)] <br/> 
-[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard)(https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
+[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/> 
+[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) <br/>
 [![Awesome](https://awesome.re/badge.svg)](https://awesome.re) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com)
 
 > Curated collection of useful JavaScript snippets that you can understand in 30 seconds or less.

From 419c7c63c0661d4cc99f7a407280433e49e245ab Mon Sep 17 00:00:00 2001
From: 30secondsofcode <30secondsofcode@gmail.com>
Date: Wed, 7 Nov 2018 09:38:26 +0000
Subject: [PATCH 16/16] Travis build: 746

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index ac6dd1784..91af8d09e 100644
--- a/README.md
+++ b/README.md
@@ -2,8 +2,8 @@
 
 # 30 seconds of code
 
-[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)] <br/> 
-[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard)(https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/>
+[![License](https://img.shields.io/badge/license-CC0--1.0-blue.svg)](https://github.com/30-seconds/30-seconds-of-code/blob/master/LICENSE) [![npm Downloads](https://img.shields.io/npm/dt/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![npm Version](https://img.shields.io/npm/v/30-seconds-of-code.svg)](https://www.npmjs.com/package/30-seconds-of-code) [![Known Vulnerabilities](https://snyk.io/test/github/30-seconds/30-seconds-of-code/badge.svg?targetFile=package.json)](https://snyk.io/test/github/30-seconds/30-seconds-of-code?targetFile=package.json) <br/> 
+[![Travis Build](https://travis-ci.com/30-seconds/30-seconds-of-code.svg?branch=master)](https://travis-ci.com/30-seconds/30-seconds-of-code) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/6ab7791fb1ea40b4a576d658fb96807f)](https://www.codacy.com/app/Chalarangelo/30-seconds-of-code?utm_source=github.com&utm_medium=referral&utm_content=30-seconds/30-seconds-of-code&utm_campaign=Badge_Grade) [![Maintainability](https://api.codeclimate.com/v1/badges/4b8c1e099135f2d53413/maintainability)](https://codeclimate.com/github/30-seconds/30-seconds-of-code/maintainability) [![js-semistandard-style](https://img.shields.io/badge/code%20style-semistandard-brightgreen.svg)](https://github.com/Flet/semistandard) <br/>
 [![Awesome](https://awesome.re/badge.svg)](https://awesome.re) [![ProductHunt](https://img.shields.io/badge/producthunt-vote-orange.svg)](https://www.producthunt.com/posts/30-seconds-of-code) [![Gitter chat](https://img.shields.io/badge/chat-on%20gitter-4FB999.svg)](https://gitter.im/30-seconds-of-code/Lobby) [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](http://makeapullrequest.com)
 
 > Curated collection of useful JavaScript snippets that you can understand in 30 seconds or less.