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

Travis build: 1854

Browse Source
This commit is contained in:
30secondsofcode
2020-04-04 13:57:32 +00:00
parent 439b79832a
commit 09a8ba5219
12 changed files with 87 additions and 95 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": {
"hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f"
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
}
},
{
@ -911,7 +911,7 @@
]
},
"meta": {
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
}
},
{
@ -1050,7 +1050,7 @@
]
},
"meta": {
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
}
},
{
@ -1286,7 +1286,7 @@
]
},
"meta": {
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
}
},
{
@ -1690,7 +1690,7 @@
]
},
"meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
}
},
{
@ -2922,7 +2922,7 @@
]
},
"meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
}
},
{
@ -3497,7 +3497,7 @@
]
},
"meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52"
}
},
{
@ -3843,7 +3843,7 @@
]
},
"meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd"
}
},
{
@ -4215,14 +4215,14 @@
"type": "snippetListing",
"title": "reject",
"attributes": {
"text": "Filters an array's values based on a predicate function, returning only values for which the predicate function returns `true`.\n\nUse `Array.prototype.filter()` in combination with the predicate function, `pred`, to return only the values for which `pred()` returns `true`.\n\n",
"text": "Filters an array's values based on a predicate function, returning only values for which the predicate function returns `false`.\n\nUse `Array.prototype.filter()` in combination with the predicate function, `pred`, to return only the values for which `pred()` returns `false`.\n\n",
"tags": [
"array",
"beginner"
]
},
"meta": {
"hash": "64c311bfab7115cd3df81172f9ed524a1f71e1d57100f8b003830ca41d9fd77f"
"hash": "9c12d3a1a037b2e56c55163e2ecacce08f4324ad1459e9349592bb718c894112"
}
},
{
@ -4237,7 +4237,7 @@
]
},
"meta": {
"hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71"
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05"
}
},
{
@ -4553,7 +4553,7 @@
]
},
"meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2"
}
},
{

72
snippet_data/snippets.json
View File

@ -1384,10 +1384,10 @@
]
},
"meta": {
"hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f",
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"firstSeen": "1516733326",
"lastUpdated": "1585031872",
"updateCount": 77,
"lastUpdated": "1585132841",
"updateCount": 78,
"authorCount": 9
}
},
@ -1487,10 +1487,10 @@
]
},
"meta": {
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d",
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf",
"firstSeen": "1544374334",
"lastUpdated": "1585031872",
"updateCount": 89,
"lastUpdated": "1585132841",
"updateCount": 90,
"authorCount": 4
}
},
@ -1716,10 +1716,10 @@
]
},
"meta": {
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba",
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"firstSeen": "1531080384",
"lastUpdated": "1585031872",
"updateCount": 114,
"lastUpdated": "1585132841",
"updateCount": 115,
"authorCount": 5
}
},
@ -2102,10 +2102,10 @@
]
},
"meta": {
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b",
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"firstSeen": "1512650493",
"lastUpdated": "1585031872",
"updateCount": 119,
"lastUpdated": "1585132841",
"updateCount": 120,
"authorCount": 6
}
},
@ -2766,10 +2766,10 @@
]
},
"meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532",
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"firstSeen": "1515856488",
"lastUpdated": "1585031872",
"updateCount": 78,
"lastUpdated": "1585132841",
"updateCount": 79,
"authorCount": 4
}
},
@ -4778,10 +4778,10 @@
]
},
"meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a",
"firstSeen": "1514801920",
"lastUpdated": "1585031872",
"updateCount": 85,
"lastUpdated": "1585132841",
"updateCount": 86,
"authorCount": 7
}
},
@ -5713,10 +5713,10 @@
]
},
"meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52",
"firstSeen": "1570824965",
"lastUpdated": "1585031872",
"updateCount": 52,
"lastUpdated": "1585132841",
"updateCount": 53,
"authorCount": 4
}
},
@ -6270,7 +6270,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",
@ -6279,10 +6279,10 @@
]
},
"meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd",
"firstSeen": "1517069864",
"lastUpdated": "1585031872",
"updateCount": 110,
"lastUpdated": "1585132841",
"updateCount": 111,
"authorCount": 5
}
},
@ -6886,7 +6886,7 @@
"type": "snippet",
"attributes": {
"fileName": "reject.md",
"text": "Filters an array's values based on a predicate function, returning only values for which the predicate function returns `true`.\n\nUse `Array.prototype.filter()` in combination with the predicate function, `pred`, to return only the values for which `pred()` returns `true`.\n\n",
"text": "Filters an array's values based on a predicate function, returning only values for which the predicate function returns `false`.\n\nUse `Array.prototype.filter()` in combination with the predicate function, `pred`, to return only the values for which `pred()` returns `false`.\n\n",
"codeBlocks": {
"es6": "const reject = (pred, array) => array.filter((...args) => !pred(...args));",
"es5": "var reject = function reject(pred, array) {\n return array.filter(function () {\n return !pred.apply(void 0, arguments);\n });\n};",
@ -6898,11 +6898,11 @@
]
},
"meta": {
"hash": "64c311bfab7115cd3df81172f9ed524a1f71e1d57100f8b003830ca41d9fd77f",
"hash": "9c12d3a1a037b2e56c55163e2ecacce08f4324ad1459e9349592bb718c894112",
"firstSeen": "1524788235",
"lastUpdated": "1568054097",
"updateCount": 6,
"authorCount": 4
"lastUpdated": "1585924173",
"updateCount": 7,
"authorCount": 5
}
},
{
@ -6923,10 +6923,10 @@
]
},
"meta": {
"hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71",
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05",
"firstSeen": "1513521691",
"lastUpdated": "1585031872",
"updateCount": 107,
"lastUpdated": "1585132841",
"updateCount": 108,
"authorCount": 6
}
},
@ -7439,10 +7439,10 @@
]
},
"meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2",
"firstSeen": "1514645161",
"lastUpdated": "1585031872",
"updateCount": 49,
"lastUpdated": "1585132841",
"updateCount": 50,
"authorCount": 5
}
},

1
snippets/deepClone.md
View File

@ -11,7 +11,6 @@ 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,7 +10,6 @@ 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,7 +9,6 @@ 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,7 +11,6 @@ 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,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,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