Travis build: 1705

This commit is contained in:
30secondsofcode
2020-01-13 08:19:45 +00:00
parent bd80172f4d
commit 164fad4f5e
19 changed files with 199 additions and 228 deletions

View File

@ -103,7 +103,6 @@
"attributes": {
"text": "Creates a function that accepts up to `n` arguments, ignoring any additional arguments.\n\nCall the provided function, `fn`, with up to `n` arguments, using `Array.prototype.slice(0, n)` and the spread operator (`...`).\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
@ -325,13 +324,12 @@
"attributes": {
"text": "Given a key and a set of arguments, call them when given a context. Primarily useful in composition.\n\nUse a closure to call a stored key with stored arguments.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "0a09f658c6bd2149c2a14528f12e8851e2ba02b9bd04c7df491a89f766b63083"
"hash": "8b606a9b76e65d602238eb487d504dda0f1fe8bba9166ae2accbc7984c8d6530"
}
},
{
@ -498,14 +496,13 @@
"attributes": {
"text": "Changes a function that accepts an array into a variadic function.\n\nGiven a function, return a closure that collects all inputs into an array-accepting function.\n\n",
"tags": [
"adapter",
"function",
"array",
"intermediate"
]
},
"meta": {
"hash": "952f58128e70180fd6a1406562cac8781c92d258dfa0993cfb9cc6c968b0abfb"
"hash": "cbf8e15f8c0f47c8e38f6f070ff90ac694aab206cc57ceef7e457d93d794e69c"
}
},
{
@ -835,7 +832,7 @@
]
},
"meta": {
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4"
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459"
}
},
{
@ -898,7 +895,7 @@
]
},
"meta": {
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7"
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
}
},
{
@ -1037,7 +1034,7 @@
]
},
"meta": {
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d"
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
}
},
{
@ -1273,7 +1270,7 @@
]
},
"meta": {
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2"
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
}
},
{
@ -1439,13 +1436,12 @@
"attributes": {
"text": "Flip takes a function as an argument, then makes the first argument the last.\n\nReturn a closure that takes variadic inputs, and splices the last argument to make it the first argument before applying the rest.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "cfc08612e65d9dc9a5c634e94a379644fbdd7a858f0cbaf1c2e272d038495be9"
"hash": "553f8cccba3bd6339b01a926661a2a3fcca310f02bbb7402d1e0eeca5bf5d729"
}
},
{
@ -1693,7 +1689,7 @@
]
},
"meta": {
"hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54"
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
}
},
{
@ -2420,7 +2416,7 @@
]
},
"meta": {
"hash": "b89ab73ffc7dd9b7650e80eb41a20194dfee6f93740876349b6af91dccc6ecd3"
"hash": "113eed606462730d4b4917d3a3125959303efda47a7c54afb0699a601e3e7fd0"
}
},
{
@ -2924,7 +2920,7 @@
]
},
"meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
}
},
{
@ -3500,7 +3496,7 @@
]
},
"meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52"
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26"
}
},
{
@ -3653,13 +3649,12 @@
"attributes": {
"text": "Creates a function that invokes each provided function with the arguments it receives and returns the results.\n\nUse `Array.prototype.map()` and `Function.prototype.apply()` to apply each function to the given arguments.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "ac660685eb10f64c7e573d0299936ae0bb562e531b2f3a76b048e3bbe9605bcc"
"hash": "d19ede265d140ecd73abb0a471042ab93591ef7b19ba92d3f8a0462661bdc99f"
}
},
{
@ -3669,13 +3664,12 @@
"attributes": {
"text": "Creates a function that invokes the provided function with its arguments transformed.\n\nUse `Array.prototype.map()` to apply `transforms` to `args` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "8aa05f5b221bb24bb52cf3b75b6087ca664ede628a8cfff2b3193ebe67f6b2e7"
"hash": "5a47cd886751568aa2ce0bd8a935d3f4730076c509666b66f7305f3660320847"
}
},
{
@ -3842,14 +3836,13 @@
"attributes": {
"text": "Performs left-to-right function composition for asynchronous functions.\n\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition using `Promise.then()`.\nThe functions can return a combination of: simple values, `Promise`'s, or they can be defined as `async` ones returning through `await`.\nAll functions must be unary.\n\n",
"tags": [
"adapter",
"function",
"promise",
"intermediate"
]
},
"meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0"
}
},
{
@ -3859,13 +3852,12 @@
"attributes": {
"text": "Performs left-to-right function composition.\n\nUse `Array.prototype.reduce()` with the spread operator (`...`) to perform left-to-right function composition.\nThe first (leftmost) function can accept one or more arguments; the remaining functions must be unary.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "dbdae1e05f13477865039be627fcd258943cbf2d7926e160de74a3ab5244dba1"
"hash": "6b85e9e5022873b5f6d6e955b383edb46e8c37615d9266fb5ee1af7939f08686"
}
},
{
@ -3954,14 +3946,13 @@
"attributes": {
"text": "Converts an asynchronous function to return a promise.\n\n*In Node 8+, you can use [`util.promisify`](https://nodejs.org/api/util.html#util_util_promisify_original)*\n\nUse currying to return a function returning a `Promise` that calls the original function.\nUse the `...rest` operator to pass in all the parameters.\n\n",
"tags": [
"adapter",
"function",
"promise",
"intermediate"
]
},
"meta": {
"hash": "a6fe92925d4c25fccd29ae85d1c2004f88c73222099091ce30824a917a2fcfa2"
"hash": "fa80063e1d74810a551c7f01397b126868a1a7f7b306859182b033aa4a2696d4"
}
},
{
@ -4131,13 +4122,12 @@
"attributes": {
"text": "Creates a function that invokes the provided function with its arguments arranged according to the specified indexes.\n\nUse `Array.prototype.map()` to reorder arguments based on `indexes` in combination with the spread operator (`...`) to pass the transformed arguments to `fn`.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "5f2f2e33d269de787a1aaa245c6324030cc5cbe8345b46352a218f3f2453c220"
"hash": "cb2326c19a1292426193785d4cf2c47b5e8d83a99edb7f3415f8c4e057f6a70b"
}
},
{
@ -4246,7 +4236,7 @@
]
},
"meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc"
"hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9"
}
},
{
@ -4562,7 +4552,7 @@
]
},
"meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2"
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347"
}
},
{
@ -4700,12 +4690,12 @@
"attributes": {
"text": "Takes a variadic function and returns a closure that accepts an array of arguments to map to the inputs of the function.\n\nUse closures and the spread operator (`...`) to map the array of arguments to the inputs of the function.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "53c9bc4c5b6a5131f5dd8591c10e5eac376cfd96715015d783d8466d49ed0058"
"hash": "b94cbdec64a2897b1a193d5fd32eeb59b315ea590d609a50b7fe50012b1d4ce4"
}
},
{
@ -5234,13 +5224,12 @@
"attributes": {
"text": "Creates a function that accepts up to one argument, ignoring any additional arguments.\n\nCall the provided function, `fn`, with just the first argument given.\n\n",
"tags": [
"adapter",
"function",
"intermediate"
"beginner"
]
},
"meta": {
"hash": "73046804bd1b91d397ee382d19eb59798f17319c1acf74393a550286be8cf087"
"hash": "f0eda594028997293121b8afca105772ce002f9fe0d5642ffd41c3167fd6b4f1"
}
},
{

View File

@ -169,7 +169,6 @@
"example": "const firstTwoMax = ary(Math.max, 2);\n[[2, 6, 'a'], [6, 4, 8], [10]].map(x => firstTwoMax(...x)); // [6, 6, 10]"
},
"tags": [
"adapter",
"function",
"intermediate"
]
@ -177,8 +176,8 @@
"meta": {
"hash": "533ab7f8259624322b5911b076d8e6fcd08f2fd396e9e0bec85449fc42769d9b",
"firstSeen": "1516795194",
"lastUpdated": "1575066838",
"updateCount": 6,
"lastUpdated": "1578902643",
"updateCount": 7,
"authorCount": 5
}
},
@ -528,19 +527,18 @@
"codeBlocks": {
"es6": "const call = (key, ...args) => context => context[key](...args);",
"es5": "var call = function call(key) {\n for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n args[_key - 1] = arguments[_key];\n }\n\n return function (context) {\n return context[key].apply(context, args);\n };\n};",
"example": "Promise.resolve([1, 2, 3])\n .then(call('map', x => 2 * x))\n .then(console.log); // [ 2, 4, 6 ]\nconst map = call.bind(null, 'map');\nPromise.resolve([1, 2, 3])\n .then(map(x => 2 * x))\n .then(console.log); // [ 2, 4, 6 ]"
"example": "Promise.resolve([1, 2, 3])\r\n .then(call('map', x => 2 * x))\r\n .then(console.log); // [ 2, 4, 6 ]\r\nconst map = call.bind(null, 'map');\r\nPromise.resolve([1, 2, 3])\r\n .then(map(x => 2 * x))\r\n .then(console.log); // [ 2, 4, 6 ]"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "0a09f658c6bd2149c2a14528f12e8851e2ba02b9bd04c7df491a89f766b63083",
"hash": "8b606a9b76e65d602238eb487d504dda0f1fe8bba9166ae2accbc7984c8d6530",
"firstSeen": "1513972470",
"lastUpdated": "1565681352",
"updateCount": 10,
"lastUpdated": "1578902874",
"updateCount": 11,
"authorCount": 5
}
},
@ -811,20 +809,19 @@
"codeBlocks": {
"es6": "const collectInto = fn => (...args) => fn(args);",
"es5": "var collectInto = function collectInto(fn) {\n return function () {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n return fn(args);\n };\n};",
"example": "const Pall = collectInto(Promise.all.bind(Promise));\nlet p1 = Promise.resolve(1);\nlet p2 = Promise.resolve(2);\nlet p3 = new Promise(resolve => setTimeout(resolve, 2000, 3));\nPall(p1, p2, p3).then(console.log); // [1, 2, 3] (after about 2 seconds)"
"example": "const Pall = collectInto(Promise.all.bind(Promise));\r\nlet p1 = Promise.resolve(1);\r\nlet p2 = Promise.resolve(2);\r\nlet p3 = new Promise(resolve => setTimeout(resolve, 2000, 3));\r\nPall(p1, p2, p3).then(console.log); // [1, 2, 3] (after about 2 seconds)"
},
"tags": [
"adapter",
"function",
"array",
"intermediate"
]
},
"meta": {
"hash": "952f58128e70180fd6a1406562cac8781c92d258dfa0993cfb9cc6c968b0abfb",
"hash": "cbf8e15f8c0f47c8e38f6f070ff90ac694aab206cc57ceef7e457d93d794e69c",
"firstSeen": "1513912116",
"lastUpdated": "1565681352",
"updateCount": 12,
"lastUpdated": "1578902681",
"updateCount": 13,
"authorCount": 5
}
},
@ -1361,7 +1358,7 @@
]
},
"meta": {
"hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4",
"hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459",
"firstSeen": "1516733326",
"lastUpdated": "1577785133",
"updateCount": 55,
@ -1464,7 +1461,7 @@
]
},
"meta": {
"hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7",
"hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf",
"firstSeen": "1544374334\n1543497773",
"lastUpdated": "1577785133",
"updateCount": 69,
@ -1693,7 +1690,7 @@
]
},
"meta": {
"hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d",
"hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528",
"firstSeen": "1531080384",
"lastUpdated": "1577791301",
"updateCount": 91,
@ -2079,7 +2076,7 @@
]
},
"meta": {
"hash": "6e9710c9117f500e74e65c0ee36b39fb80bd55537fa5ff9c4b1136b2667096f2",
"hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05",
"firstSeen": "1512650493",
"lastUpdated": "1577791301",
"updateCount": 96,
@ -2352,19 +2349,18 @@
"codeBlocks": {
"es6": "const flip = fn => (first, ...rest) => fn(...rest, first);",
"es5": "var flip = function flip(fn) {\n return function (first) {\n for (var _len = arguments.length, rest = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n rest[_key - 1] = arguments[_key];\n }\n\n return fn.apply(void 0, rest.concat([first]));\n };\n};",
"example": "let a = { name: 'John Smith' };\nlet b = {};\nconst mergeFrom = flip(Object.assign);\nlet mergePerson = mergeFrom.bind(null, a);\nmergePerson(b); // == b\nb = {};\nObject.assign(b, a); // == b"
"example": "let a = { name: 'John Smith' };\r\nlet b = {};\r\nconst mergeFrom = flip(Object.assign);\r\nlet mergePerson = mergeFrom.bind(null, a);\r\nmergePerson(b); // == b\r\nb = {};\r\nObject.assign(b, a); // == b"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "cfc08612e65d9dc9a5c634e94a379644fbdd7a858f0cbaf1c2e272d038495be9",
"hash": "553f8cccba3bd6339b01a926661a2a3fcca310f02bbb7402d1e0eeca5bf5d729",
"firstSeen": "1513903335",
"lastUpdated": "1565681352",
"updateCount": 18,
"lastUpdated": "1578902841",
"updateCount": 19,
"authorCount": 8
}
},
@ -2769,7 +2765,7 @@
]
},
"meta": {
"hash": "f9e6687cc28cd80e68f7a6776f893c7478aaa942710e0eb7144f105eba574a54",
"hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e",
"firstSeen": "1515856488",
"lastUpdated": "1577791301",
"updateCount": 53,
@ -3081,9 +3077,9 @@
"meta": {
"hash": "917079b8a868588894ebbd8d76a1bf5359d91d09dce294d7bb2cc0185900a2ae",
"firstSeen": "1578253239",
"lastUpdated": "1578253239",
"updateCount": 2,
"authorCount": 2
"lastUpdated": "1578253557",
"updateCount": 3,
"authorCount": 3
}
},
{
@ -3946,7 +3942,7 @@
"fileName": "isContainedIn.md",
"text": "Returns `true` if the elements of the first array are contained in the second one regardless of order, `false` otherwise.\n\nUse a `for...of` loop over a `Set` created from the first array.\nUse `Array.prototype.some()` to check if all distinct values are contained in the second array, use `Array.prototype.filter()` to compare the amount of occurences of each distinct value in both arrays.\nReturn `false` if the count of any element is greater in the first array than the second one, `true` otherwise.\n\n",
"codeBlocks": {
"es6": "const isContainedIn = (a, b) => {\n for (const v of new Set(a)) {\n if (\n !b.some(e => e === v) ||\n a.filter(e => e === v).length > b.filter(e => e === v).length\n )\n return false;\n }\n return true;\n};",
"es6": "const isContainedIn = (a, b) => {\n for (const v of new Set(a)) {\n if (!b.some(e => e === v) || a.filter(e => e === v).length > b.filter(e => e === v).length)\n return false;\n }\n return true;\n};",
"es5": "function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar isContainedIn = function isContainedIn(a, b) {\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n var _loop = function _loop() {\n var v = _step.value;\n if (!b.some(function (e) {\n return e === v;\n }) || a.filter(function (e) {\n return e === v;\n }).length > b.filter(function (e) {\n return e === v;\n }).length) return {\n v: false\n };\n };\n\n for (var _iterator = new Set(a)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var _ret = _loop();\n\n if (_typeof(_ret) === \"object\") return _ret.v;\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator[\"return\"] != null) {\n _iterator[\"return\"]();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n return true;\n};",
"example": "isContainedIn([1, 4], [2, 4, 1]); // true"
},
@ -3956,11 +3952,11 @@
]
},
"meta": {
"hash": "b89ab73ffc7dd9b7650e80eb41a20194dfee6f93740876349b6af91dccc6ecd3",
"hash": "113eed606462730d4b4917d3a3125959303efda47a7c54afb0699a601e3e7fd0",
"firstSeen": "1578253251",
"lastUpdated": "1578253251",
"updateCount": 2,
"authorCount": 2
"lastUpdated": "1578253557",
"updateCount": 3,
"authorCount": 3
}
},
{
@ -4780,10 +4776,10 @@
]
},
"meta": {
"hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a",
"hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8",
"firstSeen": "1514801920",
"lastUpdated": "1578058637",
"updateCount": 58,
"lastUpdated": "1578253557",
"updateCount": 59,
"authorCount": 7
}
},
@ -5716,10 +5712,10 @@
]
},
"meta": {
"hash": "e8f820ce6da97eabde082ffb829c9fb700e85efc79bdebe883c67237269e3f52",
"hash": "b031c3387ef66411ab5d295788eac4247ada5b4b068dda90603d3c973890bc26",
"firstSeen": "1570824965",
"lastUpdated": "1578058637",
"updateCount": 25,
"lastUpdated": "1578253557",
"updateCount": 26,
"authorCount": 4
}
},
@ -5969,16 +5965,15 @@
"example": "const minMax = over(Math.min, Math.max);\nminMax(1, 2, 3, 4, 5); // [1,5]"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "ac660685eb10f64c7e573d0299936ae0bb562e531b2f3a76b048e3bbe9605bcc",
"hash": "d19ede265d140ecd73abb0a471042ab93591ef7b19ba92d3f8a0462661bdc99f",
"firstSeen": "1516734137",
"lastUpdated": "1565681352",
"updateCount": 5,
"lastUpdated": "1578902833",
"updateCount": 6,
"authorCount": 4
}
},
@ -5995,16 +5990,15 @@
"example": "const square = n => n * n;\nconst double = n => n * 2;\nconst fn = overArgs((x, y) => [x, y], [square, double]);\nfn(9, 3); // [81, 6]"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "8aa05f5b221bb24bb52cf3b75b6087ca664ede628a8cfff2b3193ebe67f6b2e7",
"hash": "5a47cd886751568aa2ce0bd8a935d3f4730076c509666b66f7305f3660320847",
"firstSeen": "1517144056",
"lastUpdated": "1565681352",
"updateCount": 8,
"lastUpdated": "1578902749",
"updateCount": 9,
"authorCount": 5
}
},
@ -6275,20 +6269,19 @@
"codeBlocks": {
"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};",
"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": [
"adapter",
"function",
"promise",
"intermediate"
]
},
"meta": {
"hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff",
"hash": "0eb844801e767edcaa6a882a6dce4b5b1dadecb53a92d6ec259d36c57b6a3dd0",
"firstSeen": "1517069864",
"lastUpdated": "1578058637",
"updateCount": 82,
"lastUpdated": "1578902698",
"updateCount": 84,
"authorCount": 5
}
},
@ -6305,16 +6298,15 @@
"example": "const add5 = x => x + 5;\nconst multiply = (x, y) => x * y;\nconst multiplyAndAdd5 = pipeFunctions(multiply, add5);\nmultiplyAndAdd5(5, 2); // 15"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "dbdae1e05f13477865039be627fcd258943cbf2d7926e160de74a3ab5244dba1",
"hash": "6b85e9e5022873b5f6d6e955b383edb46e8c37615d9266fb5ee1af7939f08686",
"firstSeen": "1514307747",
"lastUpdated": "1565681352",
"updateCount": 7,
"lastUpdated": "1578902773",
"updateCount": 8,
"authorCount": 6
}
},
@ -6460,17 +6452,16 @@
"example": "const delay = promisify((d, cb) => setTimeout(cb, d));\ndelay(2000).then(() => console.log('Hi!')); // // Promise resolves after 2s"
},
"tags": [
"adapter",
"function",
"promise",
"intermediate"
]
},
"meta": {
"hash": "a6fe92925d4c25fccd29ae85d1c2004f88c73222099091ce30824a917a2fcfa2",
"hash": "fa80063e1d74810a551c7f01397b126868a1a7f7b306859182b033aa4a2696d4",
"firstSeen": "1513160863",
"lastUpdated": "1565952466",
"updateCount": 13,
"lastUpdated": "1578902784",
"updateCount": 14,
"authorCount": 5
}
},
@ -6747,16 +6738,15 @@
"example": "var rearged = rearg(\n function(a, b, c) {\n return [a, b, c];\n },\n [2, 0, 1]\n);\nrearged('b', 'c', 'a'); // ['a', 'b', 'c']"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "5f2f2e33d269de787a1aaa245c6324030cc5cbe8345b46352a218f3f2453c220",
"hash": "cb2326c19a1292426193785d4cf2c47b5e8d83a99edb7f3415f8c4e057f6a70b",
"firstSeen": "1517144661",
"lastUpdated": "1565681352",
"updateCount": 6,
"lastUpdated": "1578902791",
"updateCount": 7,
"authorCount": 4
}
},
@ -6932,10 +6922,10 @@
]
},
"meta": {
"hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc",
"hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9",
"firstSeen": "1513521691",
"lastUpdated": "1578058637",
"updateCount": 79,
"lastUpdated": "1578253557",
"updateCount": 80,
"authorCount": 6
}
},
@ -7448,10 +7438,10 @@
]
},
"meta": {
"hash": "6dd4c6a51d2c80fa4768c95ae01c16a8359c4140bcad28c7fde0cecd72d7d3e2",
"hash": "24b93b68a59b49f245590930fed6fb82e286ce09f90e292466cde63c1784c347",
"firstSeen": "1514645161",
"lastUpdated": "1578058637",
"updateCount": 24,
"lastUpdated": "1578253557",
"updateCount": 25,
"authorCount": 5
}
},
@ -7673,18 +7663,18 @@
"codeBlocks": {
"es6": "const spreadOver = fn => argsArr => fn(...argsArr);",
"es5": "function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar spreadOver = function spreadOver(fn) {\n return function (argsArr) {\n return fn.apply(void 0, _toConsumableArray(argsArr));\n };\n};",
"example": "const arrayMax = spreadOver(Math.max);\narrayMax([1, 2, 3]); // 3"
"example": "const arrayMax = spreadOver(Math.max);\r\narrayMax([1, 2, 3]); // 3"
},
"tags": [
"adapter",
"function",
"intermediate"
]
},
"meta": {
"hash": "53c9bc4c5b6a5131f5dd8591c10e5eac376cfd96715015d783d8466d49ed0058",
"hash": "b94cbdec64a2897b1a193d5fd32eeb59b315ea590d609a50b7fe50012b1d4ce4",
"firstSeen": "1513910037",
"lastUpdated": "1565681352",
"updateCount": 12,
"lastUpdated": "1578902735",
"updateCount": 13,
"authorCount": 6
}
},
@ -8550,16 +8540,15 @@
"example": "['6', '8', '10'].map(unary(parseInt)); // [6, 8, 10]"
},
"tags": [
"adapter",
"function",
"intermediate"
"beginner"
]
},
"meta": {
"hash": "73046804bd1b91d397ee382d19eb59798f17319c1acf74393a550286be8cf087",
"hash": "f0eda594028997293121b8afca105772ce002f9fe0d5642ffd41c3167fd6b4f1",
"firstSeen": "1516792952",
"lastUpdated": "1565681352",
"updateCount": 3,
"lastUpdated": "1578902854",
"updateCount": 4,
"authorCount": 2
}
},

View File

@ -10,13 +10,9 @@ Use `Array.prototype.some()` to check if all distinct values are contained in th
Return `false` if the count of any element is greater in the first array than the second one, `true` otherwise.
```js
const isContainedIn = (a, b) => {
for (const v of new Set(a)) {
if (
!b.some(e => e === v) ||
a.filter(e => e === v).length > b.filter(e => e === v).length
)
if (!b.some(e => e === v) || a.filter(e => e === v).length > b.filter(e => e === v).length)
return false;
}
return true;

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

@ -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.
```js
const objectToQueryString = queryParameters => {
return queryParameters
? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {

View File

@ -14,13 +14,14 @@ 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)),
x => x + 3,
async x => (await x) + 4
);
(async () => {
(async() => {
console.log(await sum(5)); // 15 (after one second)
})();
```

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

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.
```js
const size = val =>
Array.isArray(val)
? val.length

View File

@ -590,10 +590,7 @@ const isBrowser = () => ![typeof window, typeof document].includes('undefined');
const isBrowserTabFocused = () => !document.hidden;
const isContainedIn = (a, b) => {
for (const v of new Set(a)) {
if (
!b.some(e => e === v) ||
a.filter(e => e === v).length > b.filter(e => e === v).length
)
if (!b.some(e => e === v) || a.filter(e => e === v).length > b.filter(e => e === v).length)
return false;
}
return true;

View File

@ -1509,10 +1509,7 @@
"body": [
"const isContainedIn = (a, b) => {",
" for (const v of new Set(a)) {",
" if (",
" !b.some(e => e === v) ||",
" a.filter(e => e === v).length > b.filter(e => e === v).length",
" )",
" if (!b.some(e => e === v) || a.filter(e => e === v).length > b.filter(e => e === v).length)",
" return false;",
" }",
" return true;",