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

Travis build: 1774

Browse Source
This commit is contained in:
30secondsofcode
2020-02-18 19:31:41 +00:00
parent 68fbabc5e4
commit a5d7eb2c46
12 changed files with 89 additions and 87 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
snippet_data/snippetList.json
View File

@ -832,7 +832,7 @@
]
},
"meta": {
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4"
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
}
},
{
@ -895,7 +895,7 @@
]
},
"meta": {
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7"
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
}
},
{
@ -1034,7 +1034,7 @@
]
},
"meta": {
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d"
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
}
},
{
@ -1270,7 +1270,7 @@
]
},
"meta": {
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2"
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
}
},
{
@ -1689,7 +1689,7 @@
]
},
"meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
}
},
{
@ -2208,7 +2208,7 @@
]
},
"meta": {
"hash": "8d42afae6c90ddcd75a078a39db780eedd9a484103fc2174f7b392613a31085f"
"hash": "2aaacc455daf09a786616441e0f63fb5036d02d16611221135eede83724e9b73"
}
},
{
@ -2920,7 +2920,7 @@
]
},
"meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
}
},
{
@ -3495,7 +3495,7 @@
]
},
"meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52"
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
}
},
{
@ -3841,7 +3841,7 @@
]
},
"meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd"
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
}
},
{
@ -4235,7 +4235,7 @@
]
},
"meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc"
"hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
}
},
{
@ -4551,7 +4551,7 @@
]
},
"meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2"
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
}
},
{

70
snippet_data/snippets.json
View File

@ -1358,10 +1358,10 @@
]
},
"meta": {
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4",
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"firstSeen": "1516733326",
"lastUpdated": "1582040814",
"updateCount": 62,
"lastUpdated": "1582050443",
"updateCount": 63,
"authorCount": 9
}
},
@ -1461,10 +1461,10 @@
]
},
"meta": {
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7",
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf",
"firstSeen": "1544374334\n1543497773",
"lastUpdated": "1582040814",
"updateCount": 74,
"lastUpdated": "1582050443",
"updateCount": 75,
"authorCount": 4
}
},
@ -1690,10 +1690,10 @@
]
},
"meta": {
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d",
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"firstSeen": "1531080384",
"lastUpdated": "1582040814",
"updateCount": 99,
"lastUpdated": "1582050443",
"updateCount": 100,
"authorCount": 5
}
},
@ -2076,10 +2076,10 @@
]
},
"meta": {
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2",
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"firstSeen": "1512650493",
"lastUpdated": "1582040814",
"updateCount": 104,
"lastUpdated": "1582050443",
"updateCount": 105,
"authorCount": 6
}
},
@ -2765,10 +2765,10 @@
]
},
"meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532",
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"firstSeen": "1515856488",
"lastUpdated": "1582040814",
"updateCount": 63,
"lastUpdated": "1582050443",
"updateCount": 64,
"authorCount": 4
}
},
@ -3603,8 +3603,8 @@
"fileName": "intersection.md",
"text": "Returns a list of elements that exist in both arrays.\n\nCreate a `Set` from `b`, then use `Array.prototype.filter()` on `a` to only keep values contained in `b`.\n\n",
"codeBlocks": {
"es6": "const intersection = (a, b) => {\n const s = new Set(b);\n return a.filter(x => s.has(x));\n};",
"es5": "var intersection = function intersection(a, b) {\n var s = new Set(b);\n return a.filter(function (x) {\n return s.has(x);\n });\n};",
"es6": "const intersection = (a, b) => {\n const s = new Set(b);\n return [...new Set(a)].filter(x => s.has(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 intersection = function intersection(a, b) {\n var s = new Set(b);\n return _toConsumableArray(new Set(a)).filter(function (x) {\n return s.has(x);\n });\n};",
"example": "intersection([1, 2, 3], [4, 3, 2]); // [2, 3]"
},
"tags": [
@ -3614,10 +3614,10 @@
]
},
"meta": {
"hash": "8d42afae6c90ddcd75a078a39db780eedd9a484103fc2174f7b392613a31085f",
"hash": "2aaacc455daf09a786616441e0f63fb5036d02d16611221135eede83724e9b73",
"firstSeen": "1513521691",
"lastUpdated": "1565681352",
"updateCount": 9,
"lastUpdated": "1582054138",
"updateCount": 10,
"authorCount": 5
}
},
@ -4776,10 +4776,10 @@
]
},
"meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a",
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"firstSeen": "1514801920",
"lastUpdated": "1582040814",
"updateCount": 70,
"lastUpdated": "1582050443",
"updateCount": 71,
"authorCount": 7
}
},
@ -5711,10 +5711,10 @@
]
},
"meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52",
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965",
"lastUpdated": "1582040814",
"updateCount": 37,
"lastUpdated": "1582050443",
"updateCount": 38,
"authorCount": 4
}
},
@ -6277,10 +6277,10 @@
]
},
"meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd",
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"firstSeen": "1517069864",
"lastUpdated": "1582040814",
"updateCount": 95,
"lastUpdated": "1582050443",
"updateCount": 96,
"authorCount": 5
}
},
@ -6921,10 +6921,10 @@
]
},
"meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc",
"hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9",
"firstSeen": "1513521691",
"lastUpdated": "1582040814",
"updateCount": 91,
"lastUpdated": "1582050443",
"updateCount": 92,
"authorCount": 6
}
},
@ -7437,10 +7437,10 @@
]
},
"meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2",
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161",
"lastUpdated": "1582040814",
"updateCount": 36,
"lastUpdated": "1582050443",
"updateCount": 37,
"authorCount": 5
}
},

1
snippets/getMeridiemSuffixOfInteger.md
View File

@ -8,7 +8,6 @@ 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,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.
```js
const join = (arr, separator = ',', end = separator) =>
arr.reduce(
(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.
```js
const objectToQueryString = queryParameters => {
return queryParameters
? 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
const sum = pipeAsyncFunctions(
x => x + 1,
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`).
```js
const remove = (arr, func) =>
Array.isArray(arr)
? 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.
```js
const size = val =>
Array.isArray(val)
? val.length