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

Travis build: 1648

Browse Source
This commit is contained in:
30secondsofcode
2019-12-22 21:26:08 +00:00
parent 87e0d678d6
commit c0772b6f46
14 changed files with 146 additions and 143 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
snippet_data/snippetList.json
View File

@ -835,7 +835,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459" "hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4"
} }
}, },
{ {
@ -898,7 +898,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf" "hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7"
} }
}, },
{ {
@ -1037,7 +1037,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528" "hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d"
} }
}, },
{ {
@ -1273,7 +1273,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05" "hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2"
} }
}, },
{ {
@ -1678,7 +1678,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e" "hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54"
} }
}, },
{ {
@ -2864,7 +2864,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a" "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
} }
}, },
{ {
@ -3425,7 +3425,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52" "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
} }
}, },
{ {
@ -3774,7 +3774,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff" "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
} }
}, },
{ {
@ -4171,7 +4171,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc" "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
} }
}, },
{ {
@ -4446,7 +4446,7 @@
"type": "snippetListing", "type": "snippetListing",
"title": "shuffle", "title": "shuffle",
"attributes": { "attributes": {
"text": "Randomizes the order of the values of an array, returning a new array.\n\nUses the [Fisher-Yates algorithm](https://github.com/30-seconds/30-seconds-of-code#shuffle) to reorder the elements of the array.\n\n", "text": "Randomizes the order of the values of an array, returning a new array.\n\nUse the [Fisher-Yates algorithm](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#Fisher_and_Yates'_original_method) to reorder the elements of the array.\n\n",
"tags": [ "tags": [
"array", "array",
"random", "random",
@ -4454,7 +4454,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "10ea54fc484a0ccc346126ff9665835da5ef5bfa6f75fdea98bfaacfb2dbb65e" "hash": "d01a5226fd9306ed492f80e84b22e6c7cc7950500f9cabbeac699103c83e5643"
} }
}, },
{ {
@ -4487,7 +4487,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2" "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
} }
}, },
{ {

70
snippet_data/snippets.json
View File

@ -1361,10 +1361,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459", "hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4",
"firstSeen": "1516733326", "firstSeen": "1516733326",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 50, "updateCount": 51,
"authorCount": 9 "authorCount": 9
} }
}, },
@ -1464,10 +1464,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf", "hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7",
"firstSeen": "1544374334\n1543497773", "firstSeen": "1544374334\n1543497773",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 64, "updateCount": 65,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -1693,10 +1693,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528", "hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d",
"firstSeen": "1531080384", "firstSeen": "1531080384",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 84, "updateCount": 85,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -2079,10 +2079,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05", "hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2",
"firstSeen": "1512650493", "firstSeen": "1512650493",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 89, "updateCount": 90,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -2744,10 +2744,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e", "hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54",
"firstSeen": "1515856488", "firstSeen": "1515856488",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 46, "updateCount": 47,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -4680,10 +4680,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a", "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"firstSeen": "1514801920", "firstSeen": "1514801920",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 52, "updateCount": 53,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -5591,10 +5591,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52", "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965", "firstSeen": "1570824965",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 19, "updateCount": 20,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -6150,7 +6150,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",
@ -6160,10 +6160,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff", "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a",
"firstSeen": "1517069864", "firstSeen": "1517069864",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 76, "updateCount": 77,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -6807,10 +6807,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc", "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9",
"firstSeen": "1513521691", "firstSeen": "1513521691",
"lastUpdated": "1576739233", "lastUpdated": "1576828663",
"updateCount": 73, "updateCount": 74,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -7257,7 +7257,7 @@
"type": "snippet", "type": "snippet",
"attributes": { "attributes": {
"fileName": "shuffle.md", "fileName": "shuffle.md",
"text": "Randomizes the order of the values of an array, returning a new array.\n\nUses the [Fisher-Yates algorithm](https://github.com/30-seconds/30-seconds-of-code#shuffle) to reorder the elements of the array.\n\n", "text": "Randomizes the order of the values of an array, returning a new array.\n\nUse the [Fisher-Yates algorithm](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#Fisher_and_Yates'_original_method) to reorder the elements of the array.\n\n",
"codeBlocks": { "codeBlocks": {
"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};", "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};", "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};",
@ -7270,10 +7270,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "10ea54fc484a0ccc346126ff9665835da5ef5bfa6f75fdea98bfaacfb2dbb65e", "hash": "d01a5226fd9306ed492f80e84b22e6c7cc7950500f9cabbeac699103c83e5643",
"firstSeen": "1513526151", "firstSeen": "1513526151",
"lastUpdated": "1565681352", "lastUpdated": "1577049705",
"updateCount": 15, "updateCount": 16,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -7323,10 +7323,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2", "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161", "firstSeen": "1514645161",
"lastUpdated": "1576828393", "lastUpdated": "1576828663",
"updateCount": 18, "updateCount": 19,
"authorCount": 5 "authorCount": 5
} }
}, },

1
snippets/join.md
View File

@ -11,6 +11,7 @@ Omit the second argument, `separator`, to use a default separator of `','`.
Omit the third argument, `end`, to use the same value as `separator` by default. Omit the third argument, `end`, to use the same value as `separator` by default.
```js ```js
const join = (arr, separator = ',', end = separator) => const join = (arr, separator = ',', end = separator) =>
arr.reduce( arr.reduce(
(acc, val, i) => (acc, val, i) =>

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

2
vscode_snippets/snippets.json
View File

@ -2774,7 +2774,7 @@
" return arr;", " return arr;",
"};" "};"
], ],
"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.\n" "description": "Randomizes the order of the values of an array, returning a new array.\n\nUse the [Fisher-Yates algorithm](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#Fisher_and_Yates'_original_method) to reorder the elements of the array.\n"
}, },
"similarity": { "similarity": {
"prefix": "30s_similarity", "prefix": "30s_similarity",