andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Travis build: 1676

Browse Source
This commit is contained in:
30secondsofcode
2020-01-03 13:37:17 +00:00
parent 27ecf5fd86
commit a88380728b
11 changed files with 202 additions and 86 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
snippet_data/snippetList.json
View File

@ -1528,6 +1528,21 @@
"hash": "8810b76dac2c4294a0a029e697441ad73aa87f98a7b1698a61f31c62d5981ec8" "hash": "8810b76dac2c4294a0a029e697441ad73aa87f98a7b1698a61f31c62d5981ec8"
} }
}, },
{
"id": "frequencies",
"type": "snippetListing",
"title": "frequencies",
"attributes": {
"text": "Returns an object with the unique values of an array as keys and their frequencies as the values.\n\nUse `Array.prototype.reduce()` to map unique values to an object's keys, adding to existing keys every time the same value is encountered.\n\n",
"tags": [
"array",
"intermediate"
]
},
"meta": {
"hash": "227fc1043f5a7850c32f4ecce686a97de0b8badf4d487462a1c25e8312465124"
}
},
{ {
"id": "fromCamelCase", "id": "fromCamelCase",
"type": "snippetListing", "type": "snippetListing",
@ -2879,7 +2894,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a" "hash": "682a6b7cfeb58efe9ed7b6daf467c45397df0acecfc21cab59e5ffedd03503ba"
} }
}, },
{ {
@ -3286,6 +3301,21 @@
"hash": "65bcfbbf3937f35f591285306ec3bfbee46a1738a6a8f097c99bf07150aec198" "hash": "65bcfbbf3937f35f591285306ec3bfbee46a1738a6a8f097c99bf07150aec198"
} }
}, },
{
"id": "mostFrequent",
"type": "snippetListing",
"title": "mostFrequent",
"attributes": {
"text": "Returns the most frequent element in an array.\n\nUse `Array.prototype.reduce()` to map unique values to an object's keys, adding to existing keys every time the same value is encountered.\nUse `Object.entries()` on the result in combination with `Array.prototype.reduce()` to get the most frequent value in the array.\n\n",
"tags": [
"array",
"intermediate"
]
},
"meta": {
"hash": "0c04c74cdbb51195f740a163776cb5c4e21a57a59099a1740211cf0764c6c9cc"
}
},
{ {
"id": "mostPerformant", "id": "mostPerformant",
"type": "snippetListing", "type": "snippetListing",
@ -3440,7 +3470,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52" "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
} }
}, },
{ {
@ -3789,7 +3819,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff" "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
} }
}, },
{ {
@ -4186,7 +4216,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc" "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
} }
}, },
{ {
@ -4502,7 +4532,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2" "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
} }
}, },
{ {

100
snippet_data/snippets.json
View File

@ -1695,8 +1695,8 @@
"meta": { "meta": {
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d", "hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d",
"firstSeen": "1531080384", "firstSeen": "1531080384",
"lastUpdated": "1577785478", "lastUpdated": "1577791301",
"updateCount": 90, "updateCount": 91,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -2081,8 +2081,8 @@
"meta": { "meta": {
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2", "hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2",
"firstSeen": "1512650493", "firstSeen": "1512650493",
"lastUpdated": "1577785478", "lastUpdated": "1577791301",
"updateCount": 95, "updateCount": 96,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -2498,6 +2498,31 @@
"authorCount": 4 "authorCount": 4
} }
}, },
{
"id": "frequencies",
"title": "frequencies",
"type": "snippet",
"attributes": {
"fileName": "frequencies.md",
"text": "Returns an object with the unique values of an array as keys and their frequencies as the values.\n\nUse `Array.prototype.reduce()` to map unique values to an object's keys, adding to existing keys every time the same value is encountered.\n\n",
"codeBlocks": {
"es6": "const frequencies = arr =>\n arr.reduce((a, v) => {\n a[v] = a[v] ? a[v] + 1 : 1;\n return a;\n }, {});",
"es5": "var frequencies = function frequencies(arr) {\n return arr.reduce(function (a, v) {\n a[v] = a[v] ? a[v] + 1 : 1;\n return a;\n }, {});\n};",
"example": "frequencies(['a', 'b', 'a', 'c', 'a', 'a', 'b']); // { a: 4, b: 2, c: 1 }"
},
"tags": [
"array",
"intermediate"
]
},
"meta": {
"hash": "227fc1043f5a7850c32f4ecce686a97de0b8badf4d487462a1c25e8312465124",
"firstSeen": "1578058355",
"lastUpdated": "1578058355",
"updateCount": 2,
"authorCount": 2
}
},
{ {
"id": "fromCamelCase", "id": "fromCamelCase",
"title": "fromCamelCase", "title": "fromCamelCase",
@ -2746,8 +2771,8 @@
"meta": { "meta": {
"hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54", "hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54",
"firstSeen": "1515856488", "firstSeen": "1515856488",
"lastUpdated": "1577785478", "lastUpdated": "1577791301",
"updateCount": 52, "updateCount": 53,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -4269,9 +4294,9 @@
"meta": { "meta": {
"hash": "93dcd24b208880ba16d9aa32e59e718187cb4178cadb5876a4bc7c588ddcdebd", "hash": "93dcd24b208880ba16d9aa32e59e718187cb4178cadb5876a4bc7c588ddcdebd",
"firstSeen": "1577791032", "firstSeen": "1577791032",
"lastUpdated": "1577791032", "lastUpdated": "1577791301",
"updateCount": 2, "updateCount": 3,
"authorCount": 2 "authorCount": 3
} }
}, },
{ {
@ -4705,10 +4730,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a", "hash": "682a6b7cfeb58efe9ed7b6daf467c45397df0acecfc21cab59e5ffedd03503ba",
"firstSeen": "1514801920", "firstSeen": "1514801920",
"lastUpdated": "1577431401", "lastUpdated": "1577791301",
"updateCount": 56, "updateCount": 57,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -5366,6 +5391,31 @@
"authorCount": 5 "authorCount": 5
} }
}, },
{
"id": "mostFrequent",
"title": "mostFrequent",
"type": "snippet",
"attributes": {
"fileName": "mostFrequent.md",
"text": "Returns the most frequent element in an array.\n\nUse `Array.prototype.reduce()` to map unique values to an object's keys, adding to existing keys every time the same value is encountered.\nUse `Object.entries()` on the result in combination with `Array.prototype.reduce()` to get the most frequent value in the array.\n\n",
"codeBlocks": {
"es6": "const mostFrequent = arr =>\n Object.entries(\n arr.reduce((a, v) => {\n a[v] = a[v] ? a[v] + 1 : 1;\n return a;\n }, {})\n ).reduce((a, v) => (v[1] >= a[1] ? v : a), [null, 0])[0];",
"es5": "var mostFrequent = function mostFrequent(arr) {\n return Object.entries(arr.reduce(function (a, v) {\n a[v] = a[v] ? a[v] + 1 : 1;\n return a;\n }, {})).reduce(function (a, v) {\n return v[1] >= a[1] ? v : a;\n }, [null, 0])[0];\n};",
"example": "mostFrequent(['a', 'b', 'a', 'c', 'a', 'a', 'b']); // 'a'"
},
"tags": [
"array",
"intermediate"
]
},
"meta": {
"hash": "0c04c74cdbb51195f740a163776cb5c4e21a57a59099a1740211cf0764c6c9cc",
"firstSeen": "1578058366",
"lastUpdated": "1578058366",
"updateCount": 2,
"authorCount": 2
}
},
{ {
"id": "mostPerformant", "id": "mostPerformant",
"title": "mostPerformant", "title": "mostPerformant",
@ -5616,10 +5666,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52", "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965", "firstSeen": "1570824965",
"lastUpdated": "1577431401", "lastUpdated": "1577791301",
"updateCount": 23, "updateCount": 24,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -6175,7 +6225,7 @@
"codeBlocks": { "codeBlocks": {
"es6": "const pipeAsyncFunctions = (...fns) => arg => fns.reduce((p, f) => p.then(f), Promise.resolve(arg));", "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};", "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(\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})();" "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": [ "tags": [
"adapter", "adapter",
@ -6185,10 +6235,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff", "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a",
"firstSeen": "1517069864", "firstSeen": "1517069864",
"lastUpdated": "1577431401", "lastUpdated": "1577791301",
"updateCount": 80, "updateCount": 81,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -6832,10 +6882,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc", "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9",
"firstSeen": "1513521691", "firstSeen": "1513521691",
"lastUpdated": "1577431401", "lastUpdated": "1577791301",
"updateCount": 77, "updateCount": 78,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -7348,10 +7398,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2", "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161", "firstSeen": "1514645161",
"lastUpdated": "1577431401", "lastUpdated": "1577791301",
"updateCount": 22, "updateCount": 23,
"authorCount": 5 "authorCount": 5
} }
}, },

6
snippets/frequencies.md
View File

@ -9,12 +9,10 @@ Use `Array.prototype.reduce()` to map unique values to an object's keys, adding
```js ```js
const frequencies = arr => const frequencies = arr =>
arr.reduce( arr.reduce((a, v) => {
(a, v) => {
a[v] = a[v] ? a[v] + 1 : 1; a[v] = a[v] ? a[v] + 1 : 1;
return a; return a;
}, {} }, {});
);
``` ```
```js ```js

8
snippets/mostFrequent.md
View File

@ -10,12 +10,12 @@ Use `Object.entries()` on the result in combination with `Array.prototype.reduce
```js ```js
const mostFrequent = arr => const mostFrequent = arr =>
Object.entries(arr.reduce( Object.entries(
(a, v) => { arr.reduce((a, v) => {
a[v] = a[v] ? a[v] + 1 : 1; a[v] = a[v] ? a[v] + 1 : 1;
return a; return a;
}, {} }, {})
)).reduce((a, v) => v[1] >= a[1] ? v : a, [null, 0])[0]; ).reduce((a, v) => (v[1] >= a[1] ? v : a), [null, 0])[0];
``` ```
```js ```js

1
snippets/objectToQueryString.md
View File

@ -10,6 +10,7 @@ Determine the `symbol` to be either `?` or `&` based on the `length` of `querySt
Return the `queryString` or an empty string when the `queryParameters` are falsy. Return the `queryString` or an empty string when the `queryParameters` are falsy.
```js ```js
const objectToQueryString = queryParameters => { const objectToQueryString = queryParameters => {
return queryParameters return queryParameters
? Object.entries(queryParameters).reduce((queryString, [key, val], index) => { ? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {

3
snippets/pipeAsyncFunctions.md
View File

@ -14,13 +14,14 @@ const pipeAsyncFunctions = (...fns) => arg => fns.reduce((p, f) => p.then(f), Pr
``` ```
```js ```js
const sum = pipeAsyncFunctions( const sum = pipeAsyncFunctions(
x => x + 1, x => x + 1,
x => new Promise(resolve => setTimeout(() => resolve(x + 2), 1000)), x => new Promise(resolve => setTimeout(() => resolve(x + 2), 1000)),
x => x + 3, x => x + 3,
async x => (await x) + 4 async x => (await x) + 4
); );
(async () => { (async() => {
console.log(await sum(5)); // 15 (after one second) console.log(await sum(5)); // 15 (after one second)
})(); })();
``` ```

1
snippets/remove.md
View File

@ -9,7 +9,6 @@ Use `Array.prototype.filter()` to find array elements that return truthy values
The `func` is invoked with three arguments (`value, index, array`). The `func` is invoked with three arguments (`value, index, array`).
```js ```js
const remove = (arr, func) => const remove = (arr, func) =>
Array.isArray(arr) Array.isArray(arr)
? arr.filter(func).reduce((acc, val) => { ? arr.filter(func).reduce((acc, val) => {

1
snippets/size.md
View File

@ -12,6 +12,7 @@ Use `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API
Split strings into array of characters with `split('')` and return its length. Split strings into array of characters with `split('')` and return its length.
```js ```js
const size = val => const size = val =>
Array.isArray(val) Array.isArray(val)
? val.length ? val.length

14
test/_30s.js
View File

@ -381,6 +381,11 @@ const forOwnRight = (obj, fn) =>
Object.keys(obj) Object.keys(obj)
.reverse() .reverse()
.forEach(key => fn(obj[key], key, obj)); .forEach(key => fn(obj[key], key, obj));
const frequencies = arr =>
arr.reduce((a, v) => {
a[v] = a[v] ? a[v] + 1 : 1;
return a;
}, {});
const fromCamelCase = (str, separator = '_') => const fromCamelCase = (str, separator = '_') =>
str str
.replace(/([a-z\d])([A-Z])/g, '$1' + separator + '$2') .replace(/([a-z\d])([A-Z])/g, '$1' + separator + '$2')
@ -755,6 +760,13 @@ const midpoint = ([x1, y1], [x2, y2]) => [(x1 + x2) / 2, (y1 + y2) / 2];
const minBy = (arr, fn) => Math.min(...arr.map(typeof fn === 'function' ? fn : val => val[fn])); const minBy = (arr, fn) => Math.min(...arr.map(typeof fn === 'function' ? fn : val => val[fn]));
const minDate = dates => new Date(Math.min(...dates)); const minDate = dates => new Date(Math.min(...dates));
const minN = (arr, n = 1) => [...arr].sort((a, b) => a - b).slice(0, n); const minN = (arr, n = 1) => [...arr].sort((a, b) => a - b).slice(0, n);
const mostFrequent = arr =>
Object.entries(
arr.reduce((a, v) => {
a[v] = a[v] ? a[v] + 1 : 1;
return a;
}, {})
).reduce((a, v) => (v[1] >= a[1] ? v : a), [null, 0])[0];
const mostPerformant = (fns, iterations = 10000) => { const mostPerformant = (fns, iterations = 10000) => {
const times = fns.map(fn => { const times = fns.map(fn => {
const before = performance.now(); const before = performance.now();
@ -1575,4 +1587,4 @@ const speechSynthesis = message => {
const squareSum = (...args) => args.reduce((squareSum, number) => squareSum + Math.pow(number, 2), 0); const squareSum = (...args) => args.reduce((squareSum, number) => squareSum + Math.pow(number, 2), 0);
module.exports = {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,checkProp,chunk,clampNumber,cloneRegExp,coalesce,coalesceFactory,collectInto,colorize,compact,compactWhitespace,compose,composeRight,converge,copyToClipboard,countBy,counter,countOccurrences,createDirIfNotExists,createElement,createEventHub,CSVToArray,CSVToJSON,currentURL,curry,dayOfYear,debounce,decapitalize,deepClone,deepFlatten,deepFreeze,deepGet,deepMapKeys,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,filterFalsy,filterNonUnique,filterNonUniqueBy,findKey,findLast,findLastIndex,findLastKey,flatten,flattenObject,flip,forEachRight,formatDuration,formToObject,forOwn,forOwnRight,fromCamelCase,functionName,functions,gcd,geometricProgression,get,getColonTimeFromDate,getDaysDiffBetweenDates,getImages,getMeridiemSuffixOfInteger,getScrollPosition,getStyle,getType,getURLParameters,groupBy,hammingDistance,hasClass,hasFlags,hashBrowser,hashNode,hasKey,head,hexToRGB,hide,httpGet,httpPost,httpsRedirect,hz,includesAll,includesAny,indentString,indexOfAll,initial,initialize2DArray,initializeArrayWithRange,initializeArrayWithRangeRight,initializeArrayWithValues,initializeNDArray,inRange,insertAfter,insertBefore,intersection,intersectionBy,intersectionWith,invertKeyValues,is,isAbsoluteURL,isAfterDate,isAnagram,isArrayLike,isBeforeDate,isBoolean,isBrowser,isBrowserTabFocused,isDivisible,isDuplexStream,isEmpty,isEven,isFunction,isLowerCase,isNegativeZero,isNil,isNull,isNumber,isObject,isObjectLike,isOdd,isPlainObject,isPowerOfTwo,isPrime,isPrimitive,isPromiseLike,isReadableStream,isSameDate,isSorted,isStream,isString,isSymbol,isTravisCI,isUndefined,isUpperCase,isValidJSON,isWeekday,isWeekend,isWritableStream,join,JSONtoCSV,JSONToFile,last,lcm,longestItem,lowercaseKeys,luhnCheck,mapKeys,mapNumRange,mapObject,mapString,mapValues,mask,matches,matchesWith,maxBy,maxDate,maxN,median,memoize,merge,midpoint,minBy,minDate,minN,mostPerformant,negate,nest,nodeListToArray,none,nthArg,nthElement,objectFromPairs,objectToPairs,objectToQueryString,observeMutations,off,offset,omit,omitBy,on,once,onUserInputChange,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,reducedFilter,reduceSuccessive,reduceWhich,reject,remove,removeNonASCII,renameKeys,reverseString,RGBToHex,round,runAsync,runPromisesInSeries,sample,sampleSize,scrollToTop,sdbm,serializeCookie,serializeForm,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,times,timeTaken,toCamelCase,toCurrency,toDecimalMark,toggleClass,toHash,toKebabCase,tomorrow,toOrdinalSuffix,toSafeInteger,toSnakeCase,toTitleCase,transform,triggerEvent,truncateString,truthCheckCollection,unary,uncurry,unescapeHTML,unflattenObject,unfold,union,unionBy,unionWith,uniqueElements,uniqueElementsBy,uniqueElementsByRight,uniqueSymmetricDifference,untildify,unzip,unzipWith,URLJoin,UUIDGeneratorBrowser,UUIDGeneratorNode,validateNumber,vectorDistance,weightedSample,when,without,words,xProd,yesNo,yesterday,zip,zipObject,zipWith,binarySearch,celsiusToFahrenheit,cleanObj,collatz,countVowels,factors,fahrenheitToCelsius,fibonacciCountUntilNum,fibonacciUntilNum,heronArea,howManyTimes,httpDelete,httpPut,isArmstrongNumber,isSimilar,JSONToDate,kmphToMph,levenshteinDistance,mphToKmph,pipeLog,quickSort,removeVowels,solveRPN,speechSynthesis,squareSum} module.exports = {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,checkProp,chunk,clampNumber,cloneRegExp,coalesce,coalesceFactory,collectInto,colorize,compact,compactWhitespace,compose,composeRight,converge,copyToClipboard,countBy,counter,countOccurrences,createDirIfNotExists,createElement,createEventHub,CSVToArray,CSVToJSON,currentURL,curry,dayOfYear,debounce,decapitalize,deepClone,deepFlatten,deepFreeze,deepGet,deepMapKeys,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,filterFalsy,filterNonUnique,filterNonUniqueBy,findKey,findLast,findLastIndex,findLastKey,flatten,flattenObject,flip,forEachRight,formatDuration,formToObject,forOwn,forOwnRight,frequencies,fromCamelCase,functionName,functions,gcd,geometricProgression,get,getColonTimeFromDate,getDaysDiffBetweenDates,getImages,getMeridiemSuffixOfInteger,getScrollPosition,getStyle,getType,getURLParameters,groupBy,hammingDistance,hasClass,hasFlags,hashBrowser,hashNode,hasKey,head,hexToRGB,hide,httpGet,httpPost,httpsRedirect,hz,includesAll,includesAny,indentString,indexOfAll,initial,initialize2DArray,initializeArrayWithRange,initializeArrayWithRangeRight,initializeArrayWithValues,initializeNDArray,inRange,insertAfter,insertBefore,intersection,intersectionBy,intersectionWith,invertKeyValues,is,isAbsoluteURL,isAfterDate,isAnagram,isArrayLike,isBeforeDate,isBoolean,isBrowser,isBrowserTabFocused,isDivisible,isDuplexStream,isEmpty,isEven,isFunction,isLowerCase,isNegativeZero,isNil,isNull,isNumber,isObject,isObjectLike,isOdd,isPlainObject,isPowerOfTwo,isPrime,isPrimitive,isPromiseLike,isReadableStream,isSameDate,isSorted,isStream,isString,isSymbol,isTravisCI,isUndefined,isUpperCase,isValidJSON,isWeekday,isWeekend,isWritableStream,join,JSONtoCSV,JSONToFile,last,lcm,longestItem,lowercaseKeys,luhnCheck,mapKeys,mapNumRange,mapObject,mapString,mapValues,mask,matches,matchesWith,maxBy,maxDate,maxN,median,memoize,merge,midpoint,minBy,minDate,minN,mostFrequent,mostPerformant,negate,nest,nodeListToArray,none,nthArg,nthElement,objectFromPairs,objectToPairs,objectToQueryString,observeMutations,off,offset,omit,omitBy,on,once,onUserInputChange,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,reducedFilter,reduceSuccessive,reduceWhich,reject,remove,removeNonASCII,renameKeys,reverseString,RGBToHex,round,runAsync,runPromisesInSeries,sample,sampleSize,scrollToTop,sdbm,serializeCookie,serializeForm,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,times,timeTaken,toCamelCase,toCurrency,toDecimalMark,toggleClass,toHash,toKebabCase,tomorrow,toOrdinalSuffix,toSafeInteger,toSnakeCase,toTitleCase,transform,triggerEvent,truncateString,truthCheckCollection,unary,uncurry,unescapeHTML,unflattenObject,unfold,union,unionBy,unionWith,uniqueElements,uniqueElementsBy,uniqueElementsByRight,uniqueSymmetricDifference,untildify,unzip,unzipWith,URLJoin,UUIDGeneratorBrowser,UUIDGeneratorNode,validateNumber,vectorDistance,weightedSample,when,without,words,xProd,yesNo,yesterday,zip,zipObject,zipWith,binarySearch,celsiusToFahrenheit,cleanObj,collatz,countVowels,factors,fahrenheitToCelsius,fibonacciCountUntilNum,fibonacciUntilNum,heronArea,howManyTimes,httpDelete,httpPut,isArmstrongNumber,isSimilar,JSONToDate,kmphToMph,levenshteinDistance,mphToKmph,pipeLog,quickSort,removeVowels,solveRPN,speechSynthesis,squareSum}

24
vscode_snippets/snippets.json
View File

@ -961,6 +961,17 @@
], ],
"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.\n" "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.\n"
}, },
"frequencies": {
"prefix": "30s_frequencies",
"body": [
"const frequencies = arr =>",
" arr.reduce((a, v) => {",
" a[v] = a[v] ? a[v] + 1 : 1;",
" return a;",
" }, {});"
],
"description": "Returns an object with the unique values of an array as keys and their frequencies as the values.\n\nUse `Array.prototype.reduce()` to map unique values to an object's keys, adding to existing keys every time the same value is encountered.\n"
},
"fromCamelCase": { "fromCamelCase": {
"prefix": "30s_fromCamelCase", "prefix": "30s_fromCamelCase",
"body": [ "body": [
@ -2001,6 +2012,19 @@
], ],
"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.\n" "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.\n"
}, },
"mostFrequent": {
"prefix": "30s_mostFrequent",
"body": [
"const mostFrequent = arr =>",
" Object.entries(",
" arr.reduce((a, v) => {",
" a[v] = a[v] ? a[v] + 1 : 1;",
" return a;",
" }, {})",
" ).reduce((a, v) => (v[1] >= a[1] ? v : a), [null, 0])[0];"
],
"description": "Returns the most frequent element in an array.\n\nUse `Array.prototype.reduce()` to map unique values to an object's keys, adding to existing keys every time the same value is encountered.\nUse `Object.entries()` on the result in combination with `Array.prototype.reduce()` to get the most frequent value in the array.\n"
},
"mostPerformant": { "mostPerformant": {
"prefix": "30s_mostPerformant", "prefix": "30s_mostPerformant",
"body": [ "body": [