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

Travis build: 1777

Browse Source
This commit is contained in:
30secondsofcode
2020-02-18 20:18:30 +00:00
parent a92838a3fb
commit 0260fc759e
12 changed files with 96 additions and 94 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
snippet_data/snippetList.json
View File

@ -832,7 +832,7 @@
]
},
"meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
"hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f"
}
},
{
@ -895,7 +895,7 @@
]
},
"meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
}
},
{
@ -1034,7 +1034,7 @@
]
},
"meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
}
},
{
@ -1270,7 +1270,7 @@
]
},
"meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
}
},
{
@ -1689,7 +1689,7 @@
]
},
"meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
}
},
{
@ -2224,7 +2224,7 @@
]
},
"meta": {
"hash": "ad560d72d29aa86e305bdbd54a7a5b5cde8c57a38386342fd8d6905575de1f7a"
"hash": "6fd8156a416578b0051bd7aaa5078ee3f34a6c6d0c1dbab97436ad10f6d3efc9"
}
},
{
@ -2920,7 +2920,7 @@
]
},
"meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
}
},
{
@ -3495,7 +3495,7 @@
]
},
"meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52"
}
},
{
@ -3841,7 +3841,7 @@
]
},
"meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd"
}
},
{
@ -4235,7 +4235,7 @@
]
},
"meta": {
"hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc"
}
},
{
@ -4551,7 +4551,7 @@
]
},
"meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2"
}
},
{
@ -5306,7 +5306,7 @@
]
},
"meta": {
"hash": "9b1bc0a79c182b07f6c9142ceb346a2958e1902c7b5defa906f071573583dcb7"
"hash": "708c0fdf381b5eab2ea2df4de5da8e8171dbe38498c5d46ebab864b6ed1296a9"
}
},
{

80
snippet_data/snippets.json
View File

@ -1358,10 +1358,10 @@
]
},
"meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f",
"firstSeen": "1516733326",
"lastUpdated": "1582050443",
"updateCount": 63,
"lastUpdated": "1582054301",
"updateCount": 64,
"authorCount": 9
}
},
@ -1461,10 +1461,10 @@
]
},
"meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf",
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d",
"firstSeen": "1544374334\n1543497773",
"lastUpdated": "1582050443",
"updateCount": 75,
"lastUpdated": "1582054301",
"updateCount": 76,
"authorCount": 4
}
},
@ -1690,10 +1690,10 @@
]
},
"meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba",
"firstSeen": "1531080384",
"lastUpdated": "1582050443",
"updateCount": 100,
"lastUpdated": "1582054301",
"updateCount": 101,
"authorCount": 5
}
},
@ -2076,10 +2076,10 @@
]
},
"meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b",
"firstSeen": "1512650493",
"lastUpdated": "1582050443",
"updateCount": 105,
"lastUpdated": "1582054301",
"updateCount": 106,
"authorCount": 6
}
},
@ -2765,10 +2765,10 @@
]
},
"meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532",
"firstSeen": "1515856488",
"lastUpdated": "1582050443",
"updateCount": 64,
"lastUpdated": "1582054301",
"updateCount": 65,
"authorCount": 4
}
},
@ -3629,8 +3629,8 @@
"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.\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.\n\n",
"codeBlocks": {
"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};",
"es6": "const intersectionBy = (a, b, fn) => {\n const s = new Set(b.map(fn));\n return [...new Set(a)].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 intersectionBy = function intersectionBy(a, b, fn) {\n var s = new Set(b.map(fn));\n return _toConsumableArray(new Set(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]"
},
"tags": [
@ -3640,10 +3640,10 @@
]
},
"meta": {
"hash": "ad560d72d29aa86e305bdbd54a7a5b5cde8c57a38386342fd8d6905575de1f7a",
"hash": "6fd8156a416578b0051bd7aaa5078ee3f34a6c6d0c1dbab97436ad10f6d3efc9",
"firstSeen": "1516791198",
"lastUpdated": "1565681352",
"updateCount": 5,
"lastUpdated": "1582054161",
"updateCount": 6,
"authorCount": 4
}
},
@ -4776,10 +4776,10 @@
]
},
"meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a",
"firstSeen": "1514801920",
"lastUpdated": "1582050443",
"updateCount": 71,
"lastUpdated": "1582054301",
"updateCount": 72,
"authorCount": 7
}
},
@ -5711,10 +5711,10 @@
]
},
"meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52",
"firstSeen": "1570824965",
"lastUpdated": "1582050443",
"updateCount": 38,
"lastUpdated": "1582054301",
"updateCount": 39,
"authorCount": 4
}
},
@ -6268,7 +6268,7 @@
"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(\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": [
"function",
@ -6277,10 +6277,10 @@
]
},
"meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd",
"firstSeen": "1517069864",
"lastUpdated": "1582050443",
"updateCount": 96,
"lastUpdated": "1582054301",
"updateCount": 97,
"authorCount": 5
}
},
@ -6921,10 +6921,10 @@
]
},
"meta": {
"hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9",
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc",
"firstSeen": "1513521691",
"lastUpdated": "1582050443",
"updateCount": 92,
"lastUpdated": "1582054301",
"updateCount": 93,
"authorCount": 6
}
},
@ -7437,10 +7437,10 @@
]
},
"meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2",
"firstSeen": "1514645161",
"lastUpdated": "1582050443",
"updateCount": 37,
"lastUpdated": "1582054301",
"updateCount": 38,
"authorCount": 5
}
},
@ -8663,7 +8663,7 @@
"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([].concat(_toConsumableArray(a), _toConsumableArray(b))));\n};",
"example": "union([1, 2, 3], [4, 3, 2]); // [1,2,3,4]"
"example": "union([1, 2, 3], [4, 3, 2]); // [1, 2, 3, 4]"
},
"tags": [
"array",
@ -8672,10 +8672,10 @@
]
},
"meta": {
"hash": "9b1bc0a79c182b07f6c9142ceb346a2958e1902c7b5defa906f071573583dcb7",
"hash": "708c0fdf381b5eab2ea2df4de5da8e8171dbe38498c5d46ebab864b6ed1296a9",
"firstSeen": "1513521691",
"lastUpdated": "1565681352",
"updateCount": 7,
"lastUpdated": "1582056925",
"updateCount": 8,
"authorCount": 4
}
},

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.
```js
const deepClone = obj => {
if (obj === null) return null;
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`.
```js
const deepMapKeys = (obj, f) =>
Array.isArray(obj)
? 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.
```js
const dig = (obj, target) =>
target in obj
? 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.
```js
const factorial = n =>
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.
```js
const getMeridiemSuffixOfInteger = num =>
num === 0 || num === 24
? 12 + 'am'

1
snippets/join.md
View File

@ -11,7 +11,6 @@ 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.
```js
const join = (arr, separator = ',', end = separator) =>
arr.reduce(
(acc, val, i) =>

1
snippets/objectToQueryString.md
View File

@ -10,7 +10,6 @@ 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.
```js
const objectToQueryString = queryParameters => {
return queryParameters
? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {

3
snippets/pipeAsyncFunctions.md
View File

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

1
snippets/remove.md
View File

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

1
snippets/size.md
View File

@ -12,7 +12,6 @@ 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.
```js
const size = val =>
Array.isArray(val)
? val.length