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

Travis build: 1870

Browse Source
This commit is contained in:
30secondsofcode
2020-04-15 17:26:52 +00:00
parent d85785b540
commit 35403ccebb
13 changed files with 99 additions and 92 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
snippet_data/snippetList.json
View File

@ -848,7 +848,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459" "hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f"
} }
}, },
{ {
@ -911,7 +911,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf" "hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
} }
}, },
{ {
@ -1050,7 +1050,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528" "hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
} }
}, },
{ {
@ -1286,7 +1286,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05" "hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
} }
}, },
{ {
@ -1690,7 +1690,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e" "hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
} }
}, },
{ {
@ -2922,7 +2922,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a" "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
} }
}, },
{ {
@ -3081,7 +3081,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "c593a74e3e8e15ff07271ccdcc5d153d7b363e518f7dc59693cd6d4967973b3a" "hash": "68636f34d8e41a72c156ff12a2e9e3916c6a841eead638c7124da5a1f4c730bd"
} }
}, },
{ {
@ -3385,7 +3385,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "6133ec3409b8c18ccfc89d857149c7875eb4733803772b43743df3b7c51bd02c" "hash": "a8c2b230cf3de941c15102a93ef59093f779e424d20b6b1f7f64697f7e52b47c"
} }
}, },
{ {
@ -3497,7 +3497,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52" "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
} }
}, },
{ {
@ -3843,7 +3843,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd" "hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
} }
}, },
{ {
@ -4237,7 +4237,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05" "hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71"
} }
}, },
{ {
@ -4553,7 +4553,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2" "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
} }
}, },
{ {

80
snippet_data/snippets.json
View File

@ -1384,10 +1384,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459", "hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f",
"firstSeen": "1516733326", "firstSeen": "1516733326",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 80, "updateCount": 81,
"authorCount": 9 "authorCount": 9
} }
}, },
@ -1487,10 +1487,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf", "hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d",
"firstSeen": "1544374334", "firstSeen": "1544374334",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 92, "updateCount": 93,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -1716,10 +1716,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528", "hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba",
"firstSeen": "1531080384", "firstSeen": "1531080384",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 117, "updateCount": 118,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -2102,10 +2102,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05", "hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b",
"firstSeen": "1512650493", "firstSeen": "1512650493",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 122, "updateCount": 123,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -2766,10 +2766,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e", "hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532",
"firstSeen": "1515856488", "firstSeen": "1515856488",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 81, "updateCount": 82,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -4778,10 +4778,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a", "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"firstSeen": "1514801920", "firstSeen": "1514801920",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 88, "updateCount": 89,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -5037,11 +5037,11 @@
] ]
}, },
"meta": { "meta": {
"hash": "c593a74e3e8e15ff07271ccdcc5d153d7b363e518f7dc59693cd6d4967973b3a", "hash": "68636f34d8e41a72c156ff12a2e9e3916c6a841eead638c7124da5a1f4c730bd",
"firstSeen": "1513591918", "firstSeen": "1513591918",
"lastUpdated": "1586964718", "lastUpdated": "1586964947",
"updateCount": 11, "updateCount": 12,
"authorCount": 7 "authorCount": 8
} }
}, },
{ {
@ -5521,8 +5521,8 @@
"fileName": "nest.md", "fileName": "nest.md",
"text": "Given a flat array of objects linked to one another, it will nest them recursively.\nUseful for nesting comments, such as the ones on reddit.com.\n\nUse recursion.\nUse `Array.prototype.filter()` to filter the items where the `id` matches the `link`, then `Array.prototype.map()` to map each one to a new object that has a `children` property which recursively nests the items based on which ones are children of the current item.\nOmit the second argument, `id`, to default to `null` which indicates the object is not linked to another one (i.e. it is a top level object).\nOmit the third argument, `link`, to use `'parent_id'` as the default property which links the object to another one by its `id`.\n\n", "text": "Given a flat array of objects linked to one another, it will nest them recursively.\nUseful for nesting comments, such as the ones on reddit.com.\n\nUse recursion.\nUse `Array.prototype.filter()` to filter the items where the `id` matches the `link`, then `Array.prototype.map()` to map each one to a new object that has a `children` property which recursively nests the items based on which ones are children of the current item.\nOmit the second argument, `id`, to default to `null` which indicates the object is not linked to another one (i.e. it is a top level object).\nOmit the third argument, `link`, to use `'parent_id'` as the default property which links the object to another one by its `id`.\n\n",
"codeBlocks": { "codeBlocks": {
"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) }));", "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, link) }));",
"es5": "function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar nest = function nest(items) {\n var id = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n var link = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'parent_id';\n return items.filter(function (item) {\n return item[link] === id;\n }).map(function (item) {\n return _objectSpread({}, item, {\n children: nest(items, item.id)\n });\n });\n};", "es5": "function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar nest = function nest(items) {\n var id = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n var link = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'parent_id';\n return items.filter(function (item) {\n return item[link] === id;\n }).map(function (item) {\n return _objectSpread({}, item, {\n children: nest(items, item.id, link)\n });\n });\n};",
"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: [...] }]" "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": [ "tags": [
@ -5531,10 +5531,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "6133ec3409b8c18ccfc89d857149c7875eb4733803772b43743df3b7c51bd02c", "hash": "a8c2b230cf3de941c15102a93ef59093f779e424d20b6b1f7f64697f7e52b47c",
"firstSeen": "1519472996", "firstSeen": "1519472996",
"lastUpdated": "1565681352", "lastUpdated": "1586971425",
"updateCount": 7, "updateCount": 8,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -5713,10 +5713,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52", "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965", "firstSeen": "1570824965",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 55, "updateCount": 56,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -6270,7 +6270,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": [
"function", "function",
@ -6279,10 +6279,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd", "hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"firstSeen": "1517069864", "firstSeen": "1517069864",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 113, "updateCount": 114,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -6923,10 +6923,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05", "hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71",
"firstSeen": "1513521691", "firstSeen": "1513521691",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 110, "updateCount": 111,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -7439,10 +7439,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2", "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161", "firstSeen": "1514645161",
"lastUpdated": "1586357249", "lastUpdated": "1586964947",
"updateCount": 52, "updateCount": 53,
"authorCount": 5 "authorCount": 5
} }
}, },

1
snippets/deepClone.md
View File

@ -11,6 +11,7 @@ Use `Object.assign()` and an empty object (`{}`) to create a shallow clone of th
Use `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned. Use `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.
```js ```js
const deepClone = obj => { const deepClone = obj => {
if (obj === null) return null; if (obj === null) return null;
let clone = Object.assign({}, obj); let clone = Object.assign({}, obj);

1
snippets/deepMapKeys.md
View File

@ -10,6 +10,7 @@ Use `Object.keys(obj)` to iterate over the object's keys.
Use `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`. Use `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.
```js ```js
const deepMapKeys = (obj, f) => const deepMapKeys = (obj, f) =>
Array.isArray(obj) Array.isArray(obj)
? obj.map(val => deepMapKeys(val, f)) ? obj.map(val => deepMapKeys(val, f))

1
snippets/dig.md
View File

@ -9,6 +9,7 @@ Use the `in` operator to check if `target` exists in `obj`.
If 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. If 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.
```js ```js
const dig = (obj, target) => const dig = (obj, target) =>
target in obj target in obj
? obj[target] ? obj[target]

1
snippets/factorial.md
View File

@ -11,6 +11,7 @@ Otherwise, return the product of `n` and the factorial of `n - 1`.
Throws an exception if `n` is a negative number. Throws an exception if `n` is a negative number.
```js ```js
const factorial = n => const factorial = n =>
n < 0 n < 0
? (() => { ? (() => {

1
snippets/getMeridiemSuffixOfInteger.md
View File

@ -8,6 +8,7 @@ Converts an integer to a suffixed string, adding `am` or `pm` based on its value
Use the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix. Use the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.
```js ```js
const getMeridiemSuffixOfInteger = num => const getMeridiemSuffixOfInteger = num =>
num === 0 || num === 24 num === 0 || num === 24
? 12 + 'am' ? 12 + 'am'

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/mapObject.md
View File

@ -9,7 +9,6 @@ Use `Array.prototype.reduce()` to apply `fn` to each element in `arr` and combin
Use `el` as the key for each property and the result of `fn` as the value. Use `el` as the key for each property and the result of `fn` as the value.
```js ```js
const mapObject = (arr, fn) => const mapObject = (arr, fn) =>
arr.reduce((acc, el, i) => { arr.reduce((acc, el, i) => {
acc[el] = fn(el, i, arr); acc[el] = fn(el, i, arr);

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