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

Travis build: 1860

Browse Source
This commit is contained in:
30secondsofcode
2020-04-08 14:47:29 +00:00
parent 35fd142d57
commit 1611d9c463
12 changed files with 95 additions and 87 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
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"
} }
}, },
{ {
@ -2752,7 +2752,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "b916ab345483f3d11d921f5f54da89bbf1c724aceb1d1c16f5b7365794da6e0e" "hash": "7223718443e7ba6c978087e1af7792f9567ed8910b9d3c0c5c7f3b13ac634db7"
} }
}, },
{ {
@ -2922,7 +2922,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a" "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
} }
}, },
{ {
@ -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"
} }
}, },
{ {

72
snippet_data/snippets.json
View File

@ -1384,10 +1384,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459", "hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f",
"firstSeen": "1516733326", "firstSeen": "1516733326",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 78, "updateCount": 79,
"authorCount": 9 "authorCount": 9
} }
}, },
@ -1487,10 +1487,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf", "hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d",
"firstSeen": "1544374334", "firstSeen": "1544374334",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 90, "updateCount": 91,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -1716,10 +1716,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528", "hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba",
"firstSeen": "1531080384", "firstSeen": "1531080384",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 115, "updateCount": 116,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -2102,10 +2102,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05", "hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b",
"firstSeen": "1512650493", "firstSeen": "1512650493",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 120, "updateCount": 121,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -2766,10 +2766,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e", "hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532",
"firstSeen": "1515856488", "firstSeen": "1515856488",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 79, "updateCount": 80,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -4488,8 +4488,8 @@
"fileName": "isSorted.md", "fileName": "isSorted.md",
"text": "Returns `1` if the array is sorted in ascending order, `-1` if it is sorted in descending order or `0` if it is not sorted.\n\nCalculate the ordering `direction` for the first two elements.\nUse `Object.entries()` to loop over array objects and compare them in pairs.\nReturn `0` if the `direction` changes or the `direction` if the last element is reached.\n\n", "text": "Returns `1` if the array is sorted in ascending order, `-1` if it is sorted in descending order or `0` if it is not sorted.\n\nCalculate the ordering `direction` for the first two elements.\nUse `Object.entries()` to loop over array objects and compare them in pairs.\nReturn `0` if the `direction` changes or the `direction` if the last element is reached.\n\n",
"codeBlocks": { "codeBlocks": {
"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};", "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 / Math.abs(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) { if (!(Symbol.iterator in Object(arr) || Object.prototype.toString.call(arr) === \"[object Arguments]\")) { return; } 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};", "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) { if (!(Symbol.iterator in Object(arr) || Object.prototype.toString.call(arr) === \"[object Arguments]\")) { return; } 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 / Math.abs(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\nisSorted([4, 3, 2]); // -1\nisSorted([4, 3, 5]); // 0" "example": "isSorted([0, 1, 2, 2]); // 1\nisSorted([4, 3, 2]); // -1\nisSorted([4, 3, 5]); // 0"
}, },
"tags": [ "tags": [
@ -4498,11 +4498,11 @@
] ]
}, },
"meta": { "meta": {
"hash": "b916ab345483f3d11d921f5f54da89bbf1c724aceb1d1c16f5b7365794da6e0e", "hash": "7223718443e7ba6c978087e1af7792f9567ed8910b9d3c0c5c7f3b13ac634db7",
"firstSeen": "1514827814", "firstSeen": "1514827814",
"lastUpdated": "1565681352", "lastUpdated": "1586351099",
"updateCount": 6, "updateCount": 7,
"authorCount": 3 "authorCount": 4
} }
}, },
{ {
@ -4778,10 +4778,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a", "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"firstSeen": "1514801920", "firstSeen": "1514801920",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 86, "updateCount": 87,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -5713,10 +5713,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52", "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965", "firstSeen": "1570824965",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 53, "updateCount": 54,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -6279,10 +6279,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd", "hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"firstSeen": "1517069864", "firstSeen": "1517069864",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 111, "updateCount": 112,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -6923,10 +6923,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05", "hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71",
"firstSeen": "1513521691", "firstSeen": "1513521691",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 108, "updateCount": 109,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -7439,10 +7439,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2", "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161", "firstSeen": "1514645161",
"lastUpdated": "1585132841", "lastUpdated": "1586008652",
"updateCount": 50, "updateCount": 51,
"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/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) => {

1
snippets/pipeAsyncFunctions.md
View File

@ -14,6 +14,7 @@ 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)),

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