Travis build: 1868

This commit is contained in:
30secondsofcode
2020-04-15 15:35:47 +00:00
parent a8ff9bd9cc
commit 66fbafd0db
13 changed files with 94 additions and 101 deletions

View File

@ -848,7 +848,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f" "hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
} }
}, },
{ {
@ -911,7 +911,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d" "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
} }
}, },
{ {
@ -1050,7 +1050,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba" "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
} }
}, },
{ {
@ -1286,7 +1286,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b" "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
} }
}, },
{ {
@ -1690,7 +1690,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532" "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
} }
}, },
{ {
@ -2922,7 +2922,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8" "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
} }
}, },
{ {
@ -3073,15 +3073,15 @@
"type": "snippetListing", "type": "snippetListing",
"title": "mapObject", "title": "mapObject",
"attributes": { "attributes": {
"text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the stringified value as the key and the mapped value.\n\nUse an anonymous inner function scope to declare an undefined memory space, using closures to store a return value. Use a new `Array` to store the array with a map of the function over its data set and a comma operator to return a second step, without needing to move from one context to another (due to closures and order of operations).\n\n", "text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the original value as the key and the result of the function as the value.\n\nUse `Array.prototype.reduce()` to apply `fn` to each element in `arr` and combine the results into an object.\nUse `el` as the key for each property and the result of `fn` as the value.\n\n",
"tags": [ "tags": [
"array", "array",
"object", "object",
"advanced" "intermediate"
] ]
}, },
"meta": { "meta": {
"hash": "3afc30c02480be79ae5fb41e05ee2b1cc6f3b408ccb64a1a192d0ad34148ede2" "hash": "c593a74e3e8e15ff07271ccdcc5d153d7b363e518f7dc59693cd6d4967973b3a"
} }
}, },
{ {
@ -3497,7 +3497,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26" "hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52"
} }
}, },
{ {
@ -3843,7 +3843,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0" "hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd"
} }
}, },
{ {
@ -4237,7 +4237,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71" "hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05"
} }
}, },
{ {
@ -4553,7 +4553,7 @@
] ]
}, },
"meta": { "meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347" "hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2"
} }
}, },
{ {

View File

@ -1384,10 +1384,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "5ab25ab96afd4f1f481fc318b5b290ba8c57a468ef6bca0ca200cfb7fcf3ba9f", "hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"firstSeen": "1516733326", "firstSeen": "1516733326",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 79, "updateCount": 80,
"authorCount": 9 "authorCount": 9
} }
}, },
@ -1487,10 +1487,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d", "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf",
"firstSeen": "1544374334", "firstSeen": "1544374334",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 91, "updateCount": 92,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -1716,10 +1716,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba", "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"firstSeen": "1531080384", "firstSeen": "1531080384",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 116, "updateCount": 117,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -2102,10 +2102,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b", "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"firstSeen": "1512650493", "firstSeen": "1512650493",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 121, "updateCount": 122,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -2766,10 +2766,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532", "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"firstSeen": "1515856488", "firstSeen": "1515856488",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 80, "updateCount": 81,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -4778,10 +4778,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8", "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a",
"firstSeen": "1514801920", "firstSeen": "1514801920",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 87, "updateCount": 88,
"authorCount": 7 "authorCount": 7
} }
}, },
@ -5024,24 +5024,24 @@
"type": "snippet", "type": "snippet",
"attributes": { "attributes": {
"fileName": "mapObject.md", "fileName": "mapObject.md",
"text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the stringified value as the key and the mapped value.\n\nUse an anonymous inner function scope to declare an undefined memory space, using closures to store a return value. Use a new `Array` to store the array with a map of the function over its data set and a comma operator to return a second step, without needing to move from one context to another (due to closures and order of operations).\n\n", "text": "Maps the values of an array to an object using a function, where the key-value pairs consist of the original value as the key and the result of the function as the value.\n\nUse `Array.prototype.reduce()` to apply `fn` to each element in `arr` and combine the results into an object.\nUse `el` as the key for each property and the result of `fn` as the value.\n\n",
"codeBlocks": { "codeBlocks": {
"es6": "const mapObject = (arr, fn) =>\n (a => (\n (a = [arr, arr.map(fn)]), a[0].reduce((acc, val, ind) => ((acc[val] = a[1][ind]), acc), {})\n ))();", "es6": "const mapObject = (arr, fn) =>\n arr.reduce((acc, el, i) => {\n acc[el] = fn(el, i, arr);\n return acc;\n }, {});",
"es5": "var mapObject = function mapObject(arr, fn) {\n return function (a) {\n return a = [arr, arr.map(fn)], a[0].reduce(function (acc, val, ind) {\n return acc[val] = a[1][ind], acc;\n }, {});\n }();\n};", "es5": "var mapObject = function mapObject(arr, fn) {\n return arr.reduce(function (acc, el, i) {\n acc[el] = fn(el, i, arr);\n return acc;\n }, {});\n};",
"example": "const squareIt = arr => mapObject(arr, a => a * a);\nsquareIt([1, 2, 3]); // { 1: 1, 2: 4, 3: 9 }" "example": "mapObject([1, 2, 3], a => a * a); // { 1: 1, 2: 4, 3: 9 }"
}, },
"tags": [ "tags": [
"array", "array",
"object", "object",
"advanced" "intermediate"
] ]
}, },
"meta": { "meta": {
"hash": "3afc30c02480be79ae5fb41e05ee2b1cc6f3b408ccb64a1a192d0ad34148ede2", "hash": "c593a74e3e8e15ff07271ccdcc5d153d7b363e518f7dc59693cd6d4967973b3a",
"firstSeen": "1513591918", "firstSeen": "1513591918",
"lastUpdated": "1565681352", "lastUpdated": "1586964718",
"updateCount": 9, "updateCount": 11,
"authorCount": 6 "authorCount": 7
} }
}, },
{ {
@ -5713,10 +5713,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26", "hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52",
"firstSeen": "1570824965", "firstSeen": "1570824965",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 54, "updateCount": 55,
"authorCount": 4 "authorCount": 4
} }
}, },
@ -6270,7 +6270,7 @@
"codeBlocks": { "codeBlocks": {
"es6": "const pipeAsyncFunctions = (...fns) => arg => fns.reduce((p, f) => p.then(f), Promise.resolve(arg));", "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};", "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": [ "tags": [
"function", "function",
@ -6279,10 +6279,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0", "hash": "a2b9ac4f1209c3791caa6f40f0d041acd75514e9ee8909f2e3833635f357c0bd",
"firstSeen": "1517069864", "firstSeen": "1517069864",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 112, "updateCount": 113,
"authorCount": 5 "authorCount": 5
} }
}, },
@ -6923,10 +6923,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "ffb9c0d1d09aeb989789286efb91cc237b89ce13f44ad9510a014f9ab150df71", "hash": "be8ec39c092128ba679a3f0421b6abc34ad891dec85354caa419dc4104687a05",
"firstSeen": "1513521691", "firstSeen": "1513521691",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 109, "updateCount": 110,
"authorCount": 6 "authorCount": 6
} }
}, },
@ -7439,10 +7439,10 @@
] ]
}, },
"meta": { "meta": {
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347", "hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2",
"firstSeen": "1514645161", "firstSeen": "1514645161",
"lastUpdated": "1586008652", "lastUpdated": "1586357249",
"updateCount": 51, "updateCount": 52,
"authorCount": 5 "authorCount": 5
} }
}, },

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. Use `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.
```js ```js
const deepClone = obj => { const deepClone = obj => {
if (obj === null) return null; if (obj === null) return null;
let clone = Object.assign({}, obj); let clone = Object.assign({}, obj);

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`. Use `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.
```js ```js
const deepMapKeys = (obj, f) => const deepMapKeys = (obj, f) =>
Array.isArray(obj) Array.isArray(obj)
? obj.map(val => deepMapKeys(val, f)) ? obj.map(val => deepMapKeys(val, f))

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]

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

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'

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

View File

@ -9,6 +9,7 @@ Use `Array.prototype.reduce()` to apply `fn` to each element in `arr` and combin
Use `el` as the key for each property and the result of `fn` as the value. Use `el` as the key for each property and the result of `fn` as the value.
```js ```js
const mapObject = (arr, fn) => const mapObject = (arr, fn) =>
arr.reduce((acc, el, i) => { arr.reduce((acc, el, i) => {
acc[el] = fn(el, i, arr); acc[el] = fn(el, i, arr);

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

View File

@ -14,14 +14,13 @@ 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)
})(); })();
``` ```

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

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. 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