Travis build: 1464

This commit is contained in:
30secondsofcode
2019-09-21 06:16:31 +00:00
parent ded16155d1
commit 741ff01115
13 changed files with 101 additions and 93 deletions

View File

@ -412,7 +412,7 @@
]
},
"meta": {
"hash": "334944640f89ea89e71b57977e231e08370b7623f959958a92dd41500b850c79"
"hash": "57c13349b29a4d306650795dd94ced736ecd5ecdda13c74257aabd33eb82887a"
}
},
{
@ -835,7 +835,7 @@
]
},
"meta": {
"hash": "cdf3e756a5a73f7e6925d51b141089e991ef579ee8bfff99f194da8fb0ef6dc8"
"hash": "e45dca3875c65fe1af16b1dc48e9dd8264f4ab397994e6bbbd19741940ac7d4d"
}
},
{
@ -898,7 +898,7 @@
]
},
"meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
}
},
{
@ -1037,7 +1037,7 @@
]
},
"meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
}
},
{
@ -1273,7 +1273,7 @@
]
},
"meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
}
},
{
@ -1678,7 +1678,7 @@
]
},
"meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
}
},
{
@ -2805,7 +2805,7 @@
]
},
"meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
}
},
{
@ -3698,7 +3698,7 @@
]
},
"meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
"hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
}
},
{

View File

@ -568,7 +568,7 @@
]
},
"meta": {
"hash": "334944640f89ea89e71b57977e231e08370b7623f959958a92dd41500b850c79"
"hash": "57c13349b29a4d306650795dd94ced736ecd5ecdda13c74257aabd33eb82887a"
}
},
{
@ -1153,7 +1153,7 @@
]
},
"meta": {
"hash": "cdf3e756a5a73f7e6925d51b141089e991ef579ee8bfff99f194da8fb0ef6dc8"
"hash": "e45dca3875c65fe1af16b1dc48e9dd8264f4ab397994e6bbbd19741940ac7d4d"
}
},
{
@ -1240,7 +1240,7 @@
]
},
"meta": {
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
"hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
}
},
{
@ -1433,7 +1433,7 @@
]
},
"meta": {
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
"hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
}
},
{
@ -1759,7 +1759,7 @@
]
},
"meta": {
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
"hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
}
},
{
@ -2320,7 +2320,7 @@
]
},
"meta": {
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
"hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
}
},
{
@ -3873,7 +3873,7 @@
]
},
"meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
}
},
{
@ -5102,7 +5102,7 @@
]
},
"meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
"hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
}
},
{

View File

@ -28,6 +28,7 @@ const checkProp = (predicate, prop) => obj => !!predicate(obj[prop]);
const lengthIs4 = checkProp(l => l === 4, 'length');
lengthIs4([]); // false
lengthIs4([1,2,3,4]); // true

View File

@ -10,6 +10,7 @@ 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 => {
let clone = Object.assign({}, obj);
Object.keys(clone).forEach(

View File

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

View File

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

View File

@ -11,6 +11,7 @@ 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
? (() => {

View File

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

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.
```js
const join = (arr, separator = ',', end = separator) =>
arr.reduce(
(acc, val, i) =>

View File

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