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

Travis build: 1629

Browse Source
This commit is contained in:
30secondsofcode
2019-12-18 09:52:31 +00:00
parent aeb9d197b3
commit 0e69f4a366
15 changed files with 870 additions and 865 deletions
Download Patch File Download Diff File Expand all files Collapse all files

100
snippet_data/archivedSnippets.json
View File

@ -19,8 +19,8 @@
}, },
"meta": { "meta": {
"hash": "48d538bccbc7be7e78b8f6a69004055c4b21324d2c8d7cbc4cba0cd42e4f67fb", "hash": "48d538bccbc7be7e78b8f6a69004055c4b21324d2c8d7cbc4cba0cd42e4f67fb",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -44,8 +44,8 @@
}, },
"meta": { "meta": {
"hash": "d59410c4fa0ea5173af553068c1e1d4ef931695e084c50cdd8166b0cd0278722", "hash": "d59410c4fa0ea5173af553068c1e1d4ef931695e084c50cdd8166b0cd0278722",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -69,8 +69,8 @@
}, },
"meta": { "meta": {
"hash": "aaefc9bd6e9170001fe4754b1bc7bb9808ab97a5bec7fc6ceb1193be2f8009b1", "hash": "aaefc9bd6e9170001fe4754b1bc7bb9808ab97a5bec7fc6ceb1193be2f8009b1",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -94,8 +94,8 @@
}, },
"meta": { "meta": {
"hash": "0280a47e49f505d5f10e0e0bd2c3ab28a6ea2b931fc83f63155f8395f64a1840", "hash": "0280a47e49f505d5f10e0e0bd2c3ab28a6ea2b931fc83f63155f8395f64a1840",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -119,8 +119,8 @@
}, },
"meta": { "meta": {
"hash": "961b406dfe98746e3a267532b0703ee7c5c1b1c01a0e04c1f9e13e0fd0aeced1", "hash": "961b406dfe98746e3a267532b0703ee7c5c1b1c01a0e04c1f9e13e0fd0aeced1",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -144,8 +144,8 @@
}, },
"meta": { "meta": {
"hash": "8eed39b1040d6472e2fd619abf744848d30f12eebffda2711966c616d474524f", "hash": "8eed39b1040d6472e2fd619abf744848d30f12eebffda2711966c616d474524f",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -169,8 +169,8 @@
}, },
"meta": { "meta": {
"hash": "a39ade2ae05ad86443446b335dbc019e3ac734fe0c1a542d50b929c554040fc0", "hash": "a39ade2ae05ad86443446b335dbc019e3ac734fe0c1a542d50b929c554040fc0",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -194,8 +194,8 @@
}, },
"meta": { "meta": {
"hash": "35488eb0f56b59035b56cc67fa0a5e1a970162ede4aafd97ebb2b4009c321c01", "hash": "35488eb0f56b59035b56cc67fa0a5e1a970162ede4aafd97ebb2b4009c321c01",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -219,8 +219,8 @@
}, },
"meta": { "meta": {
"hash": "6ff845c13444a06569be548ce9e69900b7001516c44c315795f34b31e9baa833", "hash": "6ff845c13444a06569be548ce9e69900b7001516c44c315795f34b31e9baa833",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -244,8 +244,8 @@
}, },
"meta": { "meta": {
"hash": "d0be594ab377cbeb2910308610af5890b3468c06e7567cd0995a84d11aaccf47", "hash": "d0be594ab377cbeb2910308610af5890b3468c06e7567cd0995a84d11aaccf47",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -269,8 +269,8 @@
}, },
"meta": { "meta": {
"hash": "52ffa251dfc4e2bec7160a9066ef24a8c3047706e1ad2837f9d987cdf4d5f73e", "hash": "52ffa251dfc4e2bec7160a9066ef24a8c3047706e1ad2837f9d987cdf4d5f73e",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -294,8 +294,8 @@
}, },
"meta": { "meta": {
"hash": "4fccb2abe966313a742d13965ee46cfd1094763a2697591eddb19c1c5af1db7e", "hash": "4fccb2abe966313a742d13965ee46cfd1094763a2697591eddb19c1c5af1db7e",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -319,8 +319,8 @@
}, },
"meta": { "meta": {
"hash": "7eb4b1ffc1cbe28c10190bb82b7731ade2d79e78a5569bdee62af33a1020f2f5", "hash": "7eb4b1ffc1cbe28c10190bb82b7731ade2d79e78a5569bdee62af33a1020f2f5",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -344,8 +344,8 @@
}, },
"meta": { "meta": {
"hash": "71ebcdb61794d8222fcf447509d206ffb10dc8068072a88c6b587e21e76fc7f2", "hash": "71ebcdb61794d8222fcf447509d206ffb10dc8068072a88c6b587e21e76fc7f2",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -369,8 +369,8 @@
}, },
"meta": { "meta": {
"hash": "250615cfc281e99014b97d054c722d3ba6aa4190ccf66dd719e530ec80aec3bd", "hash": "250615cfc281e99014b97d054c722d3ba6aa4190ccf66dd719e530ec80aec3bd",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -395,8 +395,8 @@
}, },
"meta": { "meta": {
"hash": "33e1e304fead4088971a60d4da974d0e9380370560f383ddb1ddc14e628df18b", "hash": "33e1e304fead4088971a60d4da974d0e9380370560f383ddb1ddc14e628df18b",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -420,8 +420,8 @@
}, },
"meta": { "meta": {
"hash": "f885a599e1185f8480445e1eb0c4a5cb8bf33948d7893f013dd4e8085478fe7a", "hash": "f885a599e1185f8480445e1eb0c4a5cb8bf33948d7893f013dd4e8085478fe7a",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -445,8 +445,8 @@
}, },
"meta": { "meta": {
"hash": "9f71509c5937cb68b65ef31893b1ad723ce6690e8ecd161707cb222ab67a475b", "hash": "9f71509c5937cb68b65ef31893b1ad723ce6690e8ecd161707cb222ab67a475b",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -470,8 +470,8 @@
}, },
"meta": { "meta": {
"hash": "d1ec7968c8f8c48642a3f91878db84330231bdf84bf74633dc0754456e951338", "hash": "d1ec7968c8f8c48642a3f91878db84330231bdf84bf74633dc0754456e951338",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -495,8 +495,8 @@
}, },
"meta": { "meta": {
"hash": "dba6fa36424c23d601c4e463463a5f23d32b51d8b058a6c5020d3b4098a65e51", "hash": "dba6fa36424c23d601c4e463463a5f23d32b51d8b058a6c5020d3b4098a65e51",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -521,8 +521,8 @@
}, },
"meta": { "meta": {
"hash": "5c26069a02342eadd2c5ba2656a1b211da8f1a94da03c2cc31a5090be556d7b7", "hash": "5c26069a02342eadd2c5ba2656a1b211da8f1a94da03c2cc31a5090be556d7b7",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -546,8 +546,8 @@
}, },
"meta": { "meta": {
"hash": "5c6f8e292db8506568de362aa63890047f9d5a65d35143cfca1e27562642c414", "hash": "5c6f8e292db8506568de362aa63890047f9d5a65d35143cfca1e27562642c414",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -571,8 +571,8 @@
}, },
"meta": { "meta": {
"hash": "0c37cf46586652fd20dfa9ca682d3635f01fe61c46864f9773f6b258e8f3b6f6", "hash": "0c37cf46586652fd20dfa9ca682d3635f01fe61c46864f9773f6b258e8f3b6f6",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -596,8 +596,8 @@
}, },
"meta": { "meta": {
"hash": "9859dbef05dc0398e825150b50fccfea370583cf6b807c00c9e83b769d2b51c0", "hash": "9859dbef05dc0398e825150b50fccfea370583cf6b807c00c9e83b769d2b51c0",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }
@ -621,8 +621,8 @@
}, },
"meta": { "meta": {
"hash": "19837ac6714833e9c5fe698811e171cc2598f7b9405a4847b33b8d3b35debf8a", "hash": "19837ac6714833e9c5fe698811e171cc2598f7b9405a4847b33b8d3b35debf8a",
"firstSeen": "1567184900", "firstSeen": "1567442544",
"lastUpdated": "1567184900", "lastUpdated": "1567442544",
"updateCount": 2, "updateCount": 2,
"authorCount": 2 "authorCount": 2
} }

20
snippet_data/snippetList.json
View File

@ -835,7 +835,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459" "hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4"
} }
}, },
{ {
@ -898,7 +898,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf" "hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7"
} }
}, },
{ {
@ -1037,7 +1037,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528" "hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
} }
}, },
{ {
@ -1273,7 +1273,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05" "hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2"
} }
}, },
{ {
@ -1678,7 +1678,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e" "hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
} }
}, },
{ {
@ -2864,7 +2864,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a" "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
} }
}, },
{ {
@ -3425,7 +3425,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52" "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
} }
}, },
{ {
@ -3774,7 +3774,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff" "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
} }
}, },
{ {
@ -4171,7 +4171,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc" "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
} }
}, },
{ {
@ -4487,7 +4487,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "fc085a3110ffbbfa36c63ce282a3ab59e96d101eb4f489a59b68c1fda1814c14" "hash": "532a39b77c025041de48f14122ac229a675d0af3e0a990d55a26c5f971ec3725"
} }
}, },
{ {

1438
snippet_data/snippets.json
View File

File diff suppressed because it is too large Load Diff

4
snippets/deepClone.md
View File

@ -20,8 +20,8 @@ const deepClone = obj => {
return Array.isArray(obj) && obj.length return Array.isArray(obj) && obj.length
? (clone.length = obj.length) && Array.from(clone) ? (clone.length = obj.length) && Array.from(clone)
: Array.isArray(obj) : Array.isArray(obj)
? Array.from(obj) ? Array.from(obj)
: clone; : clone;
}; };
``` ```

4
snippets/deepMapKeys.md
View File

@ -14,13 +14,13 @@ const deepMapKeys = (obj, f) =>
Array.isArray(obj) Array.isArray(obj)
? obj.map(val => deepMapKeys(val, f)) ? obj.map(val => deepMapKeys(val, f))
: typeof obj === 'object' : typeof obj === 'object'
? Object.keys(obj).reduce((acc, current) => { ? Object.keys(obj).reduce((acc, current) => {
const val = obj[current]; const val = obj[current];
acc[f(current)] = acc[f(current)] =
val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val); val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);
return acc; return acc;
}, {}) }, {})
: obj; : obj;
``` ```
```js ```js

7
snippets/dig.md
View File

@ -9,13 +9,14 @@ 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]
: Object.values(obj).reduce((acc, val) => { : Object.values(obj).reduce((acc, val) => {
if (acc !== undefined) return acc; if (acc !== undefined) return acc;
if (typeof val === 'object') return dig(val, target); if (typeof val === 'object') return dig(val, target);
}, undefined); }, undefined);
``` ```
```js ```js

8
snippets/factorial.md
View File

@ -14,11 +14,11 @@ Throws an exception if `n` is a negative number.
const factorial = n => const factorial = n =>
n < 0 n < 0
? (() => { ? (() => {
throw new TypeError('Negative numbers are not allowed!'); throw new TypeError('Negative numbers are not allowed!');
})() })()
: n <= 1 : n <= 1
? 1 ? 1
: n * factorial(n - 1); : n * factorial(n - 1);
``` ```
```js ```js

9
snippets/getMeridiemSuffixOfInteger.md
View File

@ -8,14 +8,15 @@ 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'
: num === 12 : num === 12
? 12 + 'pm' ? 12 + 'pm'
: num < 12 : num < 12
? (num % 12) + 'am' ? (num % 12) + 'am'
: (num % 12) + 'pm'; : (num % 12) + 'pm';
``` ```
```js ```js

5
snippets/join.md
View File

@ -11,14 +11,15 @@ 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) =>
i === arr.length - 2 i === arr.length - 2
? acc + val + end ? acc + val + end
: i === arr.length - 1 : i === arr.length - 1
? acc + val ? acc + val
: acc + val + separator, : acc + val + separator,
'' ''
); );
``` ```

9
snippets/objectToQueryString.md
View File

@ -10,13 +10,14 @@ 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) => {
const symbol = queryString.length === 0 ? '?' : '&'; const symbol = queryString.length === 0 ? '?' : '&';
queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : ''; queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';
return queryString; return queryString;
}, '') }, '')
: ''; : '';
}; };
``` ```

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)
})(); })();
``` ```

7
snippets/remove.md
View File

@ -9,13 +9,12 @@ 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) => {
arr.splice(arr.indexOf(val), 1); arr.splice(arr.indexOf(val), 1);
return acc.concat(val); return acc.concat(val);
}, []) }, [])
: []; : [];
``` ```

9
snippets/size.md
View File

@ -12,14 +12,15 @@ 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
: val && typeof val === 'object' : val && typeof val === 'object'
? val.size || val.length || Object.keys(val).length ? val.size || val.length || Object.keys(val).length
: typeof val === 'string' : typeof val === 'string'
? new Blob([val]).size ? new Blob([val]).size
: 0; : 0;
``` ```
```js ```js

56
test/_30s.js
View File

@ -199,8 +199,8 @@ const deepClone = obj => {
return Array.isArray(obj) && obj.length return Array.isArray(obj) && obj.length
? (clone.length = obj.length) && Array.from(clone) ? (clone.length = obj.length) && Array.from(clone)
: Array.isArray(obj) : Array.isArray(obj)
? Array.from(obj) ? Array.from(obj)
: clone; : clone;
}; };
const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v))); const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));
const deepFreeze = obj => const deepFreeze = obj =>
@ -212,13 +212,13 @@ const deepMapKeys = (obj, f) =>
Array.isArray(obj) Array.isArray(obj)
? obj.map(val => deepMapKeys(val, f)) ? obj.map(val => deepMapKeys(val, f))
: typeof obj === 'object' : typeof obj === 'object'
? Object.keys(obj).reduce((acc, current) => { ? Object.keys(obj).reduce((acc, current) => {
const val = obj[current]; const val = obj[current];
acc[f(current)] = acc[f(current)] =
val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val); val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);
return acc; return acc;
}, {}) }, {})
: obj; : obj;
const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj); const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj);
const defer = (fn, ...args) => setTimeout(fn, 1, ...args); const defer = (fn, ...args) => setTimeout(fn, 1, ...args);
const degreesToRads = deg => (deg * Math.PI) / 180.0; const degreesToRads = deg => (deg * Math.PI) / 180.0;
@ -240,9 +240,9 @@ const dig = (obj, target) =>
target in obj target in obj
? obj[target] ? obj[target]
: Object.values(obj).reduce((acc, val) => { : Object.values(obj).reduce((acc, val) => {
if (acc !== undefined) return acc; if (acc !== undefined) return acc;
if (typeof val === 'object') return dig(val, target); if (typeof val === 'object') return dig(val, target);
}, undefined); }, undefined);
const digitize = n => [...`${n}`].map(i => parseInt(i)); const digitize = n => [...`${n}`].map(i => parseInt(i));
const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0); const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0);
const drop = (arr, n = 1) => arr.slice(n); const drop = (arr, n = 1) => arr.slice(n);
@ -314,11 +314,11 @@ const extendHex = shortHex =>
const factorial = n => const factorial = n =>
n < 0 n < 0
? (() => { ? (() => {
throw new TypeError('Negative numbers are not allowed!'); throw new TypeError('Negative numbers are not allowed!');
})() })()
: n <= 1 : n <= 1
? 1 ? 1
: n * factorial(n - 1); : n * factorial(n - 1);
const fibonacci = n => const fibonacci = n =>
Array.from({ length: n }).reduce( Array.from({ length: n }).reduce(
(acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),
@ -419,10 +419,10 @@ const getMeridiemSuffixOfInteger = num =>
num === 0 || num === 24 num === 0 || num === 24
? 12 + 'am' ? 12 + 'am'
: num === 12 : num === 12
? 12 + 'pm' ? 12 + 'pm'
: num < 12 : num < 12
? (num % 12) + 'am' ? (num % 12) + 'am'
: (num % 12) + 'pm'; : (num % 12) + 'pm';
const getScrollPosition = (el = window) => ({ const getScrollPosition = (el = window) => ({
x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft, x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,
y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop
@ -656,8 +656,8 @@ const join = (arr, separator = ',', end = separator) =>
i === arr.length - 2 i === arr.length - 2
? acc + val + end ? acc + val + end
: i === arr.length - 1 : i === arr.length - 1
? acc + val ? acc + val
: acc + val + separator, : acc + val + separator,
'' ''
); );
const JSONtoCSV = (arr, columns, delimiter = ',') => const JSONtoCSV = (arr, columns, delimiter = ',') =>
@ -776,10 +776,10 @@ const objectToPairs = obj => Object.keys(obj).map(k => [k, obj[k]]);
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) => {
const symbol = queryString.length === 0 ? '?' : '&'; const symbol = queryString.length === 0 ? '?' : '&';
queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : ''; queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';
return queryString; return queryString;
}, '') }, '')
: ''; : '';
}; };
const observeMutations = (element, callback, options) => { const observeMutations = (element, callback, options) => {
@ -1011,9 +1011,9 @@ const reject = (pred, array) => array.filter((...args) => !pred(...args));
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) => {
arr.splice(arr.indexOf(val), 1); arr.splice(arr.indexOf(val), 1);
return acc.concat(val); return acc.concat(val);
}, []) }, [])
: []; : [];
const removeNonASCII = str => str.replace(/[^\x20-\x7E]/g, ''); const removeNonASCII = str => str.replace(/[^\x20-\x7E]/g, '');
const renameKeys = (keysMap, obj) => const renameKeys = (keysMap, obj) =>
@ -1091,10 +1091,10 @@ const size = val =>
Array.isArray(val) Array.isArray(val)
? val.length ? val.length
: val && typeof val === 'object' : val && typeof val === 'object'
? val.size || val.length || Object.keys(val).length ? val.size || val.length || Object.keys(val).length
: typeof val === 'string' : typeof val === 'string'
? new Blob([val]).size ? new Blob([val]).size
: 0; : 0;
const sleep = ms => new Promise(resolve => setTimeout(resolve, ms)); const sleep = ms => new Promise(resolve => setTimeout(resolve, ms));
const smoothScroll = element => const smoothScroll = element =>
document.querySelector(element).scrollIntoView({ document.querySelector(element).scrollIntoView({

56
vscode_snippets/snippets.json
View File

@ -512,8 +512,8 @@
" return Array.isArray(obj) && obj.length", " return Array.isArray(obj) && obj.length",
" ? (clone.length = obj.length) && Array.from(clone)", " ? (clone.length = obj.length) && Array.from(clone)",
" : Array.isArray(obj)", " : Array.isArray(obj)",
" ? Array.from(obj)", " ? Array.from(obj)",
" : clone;", " : clone;",
"};" "};"
], ],
"description": "Creates a deep clone of an object.\n\nUse recursion.\nCheck if the passed object is `null` and, if so, return `null`.\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.\n" "description": "Creates a deep clone of an object.\n\nUse recursion.\nCheck if the passed object is `null` and, if so, return `null`.\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.\n"
@ -549,13 +549,13 @@
" Array.isArray(obj)", " Array.isArray(obj)",
" ? obj.map(val => deepMapKeys(val, f))", " ? obj.map(val => deepMapKeys(val, f))",
" : typeof obj === 'object'", " : typeof obj === 'object'",
" ? Object.keys(obj).reduce((acc, current) => {", " ? Object.keys(obj).reduce((acc, current) => {",
" const val = obj[current];", " const val = obj[current];",
" acc[f(current)] =", " acc[f(current)] =",
" val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);", " val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);",
" return acc;", " return acc;",
" }, {})", " }, {})",
" : obj;" " : obj;"
], ],
"description": "Deep maps an object's keys.\n\nCreates an object with the same values as the provided object and keys generated by running the provided function for each key.\nUse `Object.keys(obj)` to iterate over the object's keys. \nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n" "description": "Deep maps an object's keys.\n\nCreates an object with the same values as the provided object and keys generated by running the provided function for each key.\nUse `Object.keys(obj)` to iterate over the object's keys. \nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n"
}, },
@ -631,9 +631,9 @@
" target in obj", " target in obj",
" ? obj[target]", " ? obj[target]",
" : Object.values(obj).reduce((acc, val) => {", " : Object.values(obj).reduce((acc, val) => {",
" if (acc !== undefined) return acc;", " if (acc !== undefined) return acc;",
" if (typeof val === 'object') return dig(val, target);", " if (typeof val === 'object') return dig(val, target);",
" }, undefined);" " }, undefined);"
], ],
"description": "Returns the target value in a nested JSON object, based on the given key.\n\nUse the `in` operator to check if `target` exists in `obj`.\nIf 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.\n" "description": "Returns the target value in a nested JSON object, based on the given key.\n\nUse the `in` operator to check if `target` exists in `obj`.\nIf 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.\n"
}, },
@ -795,11 +795,11 @@
"const factorial = n =>", "const factorial = n =>",
" n < 0", " n < 0",
" ? (() => {", " ? (() => {",
" throw new TypeError('Negative numbers are not allowed!');", " throw new TypeError('Negative numbers are not allowed!');",
" })()", " })()",
" : n <= 1", " : n <= 1",
" ? 1", " ? 1",
" : n * factorial(n - 1);" " : n * factorial(n - 1);"
], ],
"description": "Calculates the factorial of a number.\n\nUse recursion.\nIf `n` is less than or equal to `1`, return `1`.\nOtherwise, return the product of `n` and the factorial of `n - 1`.\nThrows an exception if `n` is a negative number.\n" "description": "Calculates the factorial of a number.\n\nUse recursion.\nIf `n` is less than or equal to `1`, return `1`.\nOtherwise, return the product of `n` and the factorial of `n - 1`.\nThrows an exception if `n` is a negative number.\n"
}, },
@ -1056,10 +1056,10 @@
" num === 0 || num === 24", " num === 0 || num === 24",
" ? 12 + 'am'", " ? 12 + 'am'",
" : num === 12", " : num === 12",
" ? 12 + 'pm'", " ? 12 + 'pm'",
" : num < 12", " : num < 12",
" ? (num % 12) + 'am'", " ? (num % 12) + 'am'",
" : (num % 12) + 'pm';" " : (num % 12) + 'pm';"
], ],
"description": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\n\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.\n" "description": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\n\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.\n"
}, },
@ -1743,8 +1743,8 @@
" i === arr.length - 2", " i === arr.length - 2",
" ? acc + val + end", " ? acc + val + end",
" : i === arr.length - 1", " : i === arr.length - 1",
" ? acc + val", " ? acc + val",
" : acc + val + separator,", " : acc + val + separator,",
" ''", " ''",
" );" " );"
], ],
@ -2073,10 +2073,10 @@
"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) => {",
" const symbol = queryString.length === 0 ? '?' : '&';", " const symbol = queryString.length === 0 ? '?' : '&';",
" queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';", " queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';",
" return queryString;", " return queryString;",
" }, '')", " }, '')",
" : '';", " : '';",
"};" "};"
], ],
@ -2590,9 +2590,9 @@
"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) => {",
" arr.splice(arr.indexOf(val), 1);", " arr.splice(arr.indexOf(val), 1);",
" return acc.concat(val);", " return acc.concat(val);",
" }, [])", " }, [])",
" : [];" " : [];"
], ],
"description": "Removes elements from an array for which the given function returns `false`.\n\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\nThe `func` is invoked with three arguments (`value, index, array`).\n" "description": "Removes elements from an array for which the given function returns `false`.\n\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\nThe `func` is invoked with three arguments (`value, index, array`).\n"
@ -2790,10 +2790,10 @@
" Array.isArray(val)", " Array.isArray(val)",
" ? val.length", " ? val.length",
" : val && typeof val === 'object'", " : val && typeof val === 'object'",
" ? val.size || val.length || Object.keys(val).length", " ? val.size || val.length || Object.keys(val).length",
" : typeof val === 'string'", " : typeof val === 'string'",
" ? new Blob([val]).size", " ? new Blob([val]).size",
" : 0;" " : 0;"
], ],
"description": "Get size of arrays, objects or strings.\n\nGet type of `val` (`array`, `object` or `string`). \nUse `length` property for arrays.\nUse `length` or `size` value if available or number of keys for objects.\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\nSplit strings into array of characters with `split('')` and return its length.\n" "description": "Get size of arrays, objects or strings.\n\nGet type of `val` (`array`, `object` or `string`). \nUse `length` property for arrays.\nUse `length` or `size` value if available or number of keys for objects.\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\nSplit strings into array of characters with `split('')` and return its length.\n"
}, },