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

Travis build: 1719

Browse Source
This commit is contained in:
30secondsofcode
2020-01-22 08:54:15 +00:00
parent 4e37135d2c
commit 6f2e8fd49c
13 changed files with 137 additions and 137 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": { "meta": {
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4" "hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
} }
}, },
{ {
@ -1034,7 +1034,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba" "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
} }
}, },
{ {
@ -1270,7 +1270,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b" "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
} }
}, },
{ {
@ -1689,7 +1689,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532" "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
} }
}, },
{ {
@ -2315,7 +2315,7 @@
"type": "snippetListing", "type": "snippetListing",
"title": "isAnagram", "title": "isAnagram",
"attributes": { "attributes": {
"text": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n\n", "text": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.prototype.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n\n",
"tags": [ "tags": [
"string", "string",
"regexp", "regexp",
@ -2323,7 +2323,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "d5d6a4a5652dfb641a7cade70e041e2e91aec06e9184d06f6bb82499bfee0498" "hash": "0988d3506c206c544948142c4b65b471d0d0bdabdfc464fc40260f9ccc054f52"
} }
}, },
{ {
@ -2920,7 +2920,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a" "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
} }
}, },
{ {
@ -3496,7 +3496,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52" "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
} }
}, },
{ {
@ -3842,7 +3842,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd" "hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
} }
}, },
{ {
@ -4236,7 +4236,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc" "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
} }
}, },
{ {
@ -4552,7 +4552,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2" "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
} }
}, },
{ {

66
snippet_data/snippets.json
View File

@ -1358,10 +1358,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4", "hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"firstSeen": "1516733326", "firstSeen": "1516733326",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 56, "updateCount": 57,
"authorCount": 9 "authorCount": 9
} }
}, },
@ -1463,8 +1463,8 @@
"meta": { "meta": {
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7", "hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7",
"firstSeen": "1544374334\n1543497773", "firstSeen": "1544374334\n1543497773",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 70, "updateCount": 71,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -1690,10 +1690,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba", "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"firstSeen": "1531080384", "firstSeen": "1531080384",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 92, "updateCount": 93,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -2076,10 +2076,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b", "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"firstSeen": "1512650493", "firstSeen": "1512650493",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 97, "updateCount": 98,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -2765,10 +2765,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532", "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"firstSeen": "1515856488", "firstSeen": "1515856488",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 54, "updateCount": 55,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -3786,7 +3786,7 @@
"type": "snippet", "type": "snippet",
"attributes": { "attributes": {
"fileName": "isAnagram.md", "fileName": "isAnagram.md",
"text": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n\n", "text": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.prototype.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n\n",
"codeBlocks": { "codeBlocks": {
"es6": "const isAnagram = (str1, str2) => {\n const normalize = str =>\n str\n .toLowerCase()\n .replace(/[^a-z0-9]/gi, '')\n .split('')\n .sort()\n .join('');\n return normalize(str1) === normalize(str2);\n};", "es6": "const isAnagram = (str1, str2) => {\n const normalize = str =>\n str\n .toLowerCase()\n .replace(/[^a-z0-9]/gi, '')\n .split('')\n .sort()\n .join('');\n return normalize(str1) === normalize(str2);\n};",
"es5": "var isAnagram = function isAnagram(str1, str2) {\n var normalize = function normalize(str) {\n return str.toLowerCase().replace(/[^a-z0-9]/gi, '').split('').sort().join('');\n };\n\n return normalize(str1) === normalize(str2);\n};", "es5": "var isAnagram = function isAnagram(str1, str2) {\n var normalize = function normalize(str) {\n return str.toLowerCase().replace(/[^a-z0-9]/gi, '').split('').sort().join('');\n };\n\n return normalize(str1) === normalize(str2);\n};",
@ -3799,10 +3799,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "d5d6a4a5652dfb641a7cade70e041e2e91aec06e9184d06f6bb82499bfee0498", "hash": "0988d3506c206c544948142c4b65b471d0d0bdabdfc464fc40260f9ccc054f52",
"firstSeen": "1519048067", "firstSeen": "1519048067",
"lastUpdated": "1565681352", "lastUpdated": "1579682956",
"updateCount": 6, "updateCount": 7,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -4776,10 +4776,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a", "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"firstSeen": "1514801920", "firstSeen": "1514801920",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 60, "updateCount": 61,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -5712,10 +5712,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52", "hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965", "firstSeen": "1570824965",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 27, "updateCount": 28,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -6278,10 +6278,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd", "hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"firstSeen": "1517069864", "firstSeen": "1517069864",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 85, "updateCount": 86,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -6922,10 +6922,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc", "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9",
"firstSeen": "1513521691", "firstSeen": "1513521691",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 81, "updateCount": 82,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -7438,10 +7438,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2", "hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161", "firstSeen": "1514645161",
"lastUpdated": "1578903585", "lastUpdated": "1579643089",
"updateCount": 26, "updateCount": 27,
"authorCount": 5 "authorCount": 5
} }
}, },

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

2
vscode_snippets/snippets.json
View File

@ -1467,7 +1467,7 @@
" return normalize(str1) === normalize(str2);", " return normalize(str1) === normalize(str2);",
"};" "};"
], ],
"description": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n" "description": "Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).\n\nUse `String.prototype.toLowerCase()`, `String.prototype.replace()` with an appropriate regular expression to remove unnecessary characters, `String.prototype.split('')`, `Array.prototype.sort()` and `Array.prototype.join('')` on both strings to normalize them, then check if their normalized forms are equal.\n"
}, },
"isArrayLike": { "isArrayLike": {
"prefix": "30s_isArrayLike", "prefix": "30s_isArrayLike",