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

Travis build: 1896

Browse Source
This commit is contained in:
30secondsofcode
2020-04-16 20:16:20 +00:00
parent 72bd003b81
commit 5fbf193e3a
12 changed files with 86 additions and 91 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
snippet_data/snippetList.json
View File

@ -856,7 +856,7 @@
]
},
"meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4"
}
},
{
@ -919,7 +919,7 @@
]
},
"meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7"
}
},
{
@ -1058,7 +1058,7 @@
]
},
"meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d"
}
},
{
@ -1293,7 +1293,7 @@
]
},
"meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2"
}
},
{
@ -1710,7 +1710,7 @@
]
},
"meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
"hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54"
}
},
{
@ -2974,7 +2974,7 @@
]
},
"meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
}
},
{
@ -3559,7 +3559,7 @@
]
},
"meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52"
}
},
{
@ -3905,7 +3905,7 @@
]
},
"meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd"
}
},
{
@ -4293,7 +4293,7 @@
]
},
"meta": {
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05"
"hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71"
}
},
{
@ -4609,7 +4609,7 @@
]
},
"meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2"
}
},
{
@ -5598,7 +5598,7 @@
]
},
"meta": {
"hash": "a2c8560a2e285ebe11caad3a46c07ee0e41a64bd850b2e5a4f5aebc12da09dcc"
"hash": "be3eab6a1193f0fc80764d89b6e15d2c169fb8c423355385011171ff3cd10b3f"
}
},
{

72
snippet_data/snippets.json
View File

@ -1402,10 +1402,10 @@
]
},
"meta": {
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4",
"firstSeen": "1516733326",
"lastUpdated": "1587046062",
"updateCount": 87,
"lastUpdated": "1587067825",
"updateCount": 88,
"authorCount": 9
}
},
@ -1505,10 +1505,10 @@
]
},
"meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf",
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7",
"firstSeen": "1544374334",
"lastUpdated": "1587046062",
"updateCount": 99,
"lastUpdated": "1587067825",
"updateCount": 100,
"authorCount": 4
}
},
@ -1734,10 +1734,10 @@
]
},
"meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d",
"firstSeen": "1531080384",
"lastUpdated": "1587046062",
"updateCount": 124,
"lastUpdated": "1587067825",
"updateCount": 125,
"authorCount": 5
}
},
@ -2119,10 +2119,10 @@
]
},
"meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2",
"firstSeen": "1512650493",
"lastUpdated": "1587046062",
"updateCount": 130,
"lastUpdated": "1587067825",
"updateCount": 131,
"authorCount": 6
}
},
@ -2806,10 +2806,10 @@
]
},
"meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54",
"firstSeen": "1515856488",
"lastUpdated": "1587046062",
"updateCount": 89,
"lastUpdated": "1587067825",
"updateCount": 90,
"authorCount": 4
}
},
@ -4880,10 +4880,10 @@
]
},
"meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a",
"firstSeen": "1514801920",
"lastUpdated": "1587067469",
"updateCount": 97,
"lastUpdated": "1587067825",
"updateCount": 98,
"authorCount": 7
}
},
@ -5835,10 +5835,10 @@
]
},
"meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52",
"firstSeen": "1570824965",
"lastUpdated": "1587067662",
"updateCount": 66,
"lastUpdated": "1587067825",
"updateCount": 67,
"authorCount": 4
}
},
@ -6401,10 +6401,10 @@
]
},
"meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd",
"firstSeen": "1517069864",
"lastUpdated": "1587067469",
"updateCount": 122,
"lastUpdated": "1587067825",
"updateCount": 123,
"authorCount": 5
}
},
@ -7039,10 +7039,10 @@
]
},
"meta": {
"hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05",
"hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71",
"firstSeen": "1513521691",
"lastUpdated": "1587067469",
"updateCount": 119,
"lastUpdated": "1587067825",
"updateCount": 120,
"authorCount": 6
}
},
@ -7555,10 +7555,10 @@
]
},
"meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2",
"firstSeen": "1514645161",
"lastUpdated": "1587067469",
"updateCount": 61,
"lastUpdated": "1587067825",
"updateCount": 62,
"authorCount": 5
}
},
@ -9164,9 +9164,9 @@
"fileName": "vectorDistance.md",
"text": "Returns the distance between two vectors.\n\nUse `Array.prototype.reduce()`, `Math.pow()` and `Math.sqrt()` to calculate the Euclidean distance between two vectors.\n\n",
"codeBlocks": {
"es6": "const vectorDistance = (...coords) => {\n let pointLength = Math.trunc(coords.length / 2);\n let sum = coords\n .slice(0, pointLength)\n .reduce((acc, val, i) => acc + Math.pow(val - coords[pointLength + i], 2), 0);\n return Math.sqrt(sum);\n};",
"es5": "var vectorDistance = function vectorDistance() {\n for (var _len = arguments.length, coords = new Array(_len), _key = 0; _key < _len; _key++) {\n coords[_key] = arguments[_key];\n }\n\n var pointLength = Math.trunc(coords.length / 2);\n var sum = coords.slice(0, pointLength).reduce(function (acc, val, i) {\n return acc + Math.pow(val - coords[pointLength + i], 2);\n }, 0);\n return Math.sqrt(sum);\n};",
"example": "vectorDistance(10, 0, 5, 20, 0, 10); // 11.180339887498949"
"es6": "const vectorDistance = (x, y) =>\n Math.sqrt(x.reduce((acc, val, i) => acc + Math.pow(val - y[i], 2), 0));",
"es5": "var vectorDistance = function vectorDistance(x, y) {\n return Math.sqrt(x.reduce(function (acc, val, i) {\n return acc + Math.pow(val - y[i], 2);\n }, 0));\n};",
"example": "vectorDistance([10, 0, 5], [20, 0, 10]); // 11.180339887498949"
},
"tags": [
"math",
@ -9174,10 +9174,10 @@
]
},
"meta": {
"hash": "a2c8560a2e285ebe11caad3a46c07ee0e41a64bd850b2e5a4f5aebc12da09dcc",
"hash": "be3eab6a1193f0fc80764d89b6e15d2c169fb8c423355385011171ff3cd10b3f",
"firstSeen": "1550942028",
"lastUpdated": "1565681352",
"updateCount": 6,
"lastUpdated": "1587068011",
"updateCount": 7,
"authorCount": 4
}
},

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) => {

1
snippets/pipeAsyncFunctions.md
View File

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