From 164fad4f5e1a60ab8fb9886e88fc986390158b5c Mon Sep 17 00:00:00 2001 From: 30secondsofcode <30secondsofcode@gmail.com> Date: Mon, 13 Jan 2020 08:19:45 +0000 Subject: [PATCH] Travis build: 1705 --- snippet_data/snippetList.json | 57 ++++----- snippet_data/snippets.json | 163 ++++++++++++------------- snippets/call.md | 4 +- snippets/collectInto.md | 4 +- snippets/deepClone.md | 4 +- snippets/deepMapKeys.md | 4 +- snippets/dig.md | 6 +- snippets/factorial.md | 8 +- snippets/flip.md | 4 +- snippets/getMeridiemSuffixOfInteger.md | 8 +- snippets/isContainedIn.md | 6 +- snippets/join.md | 5 +- snippets/objectToQueryString.md | 9 +- snippets/pipeAsyncFunctions.md | 3 +- snippets/remove.md | 7 +- snippets/size.md | 9 +- snippets/spreadOver.md | 4 +- test/_30s.js | 61 +++++---- vscode_snippets/snippets.json | 61 +++++---- 19 files changed, 199 insertions(+), 228 deletions(-) diff --git a/snippet_data/snippetList.json b/snippet_data/snippetList.json index 6efa7038c..8d36a8982 100644 --- a/snippet_data/snippetList.json +++ b/snippet_data/snippetList.json @@ -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" } }, { diff --git a/snippet_data/snippets.json b/snippet_data/snippets.json index fa1846cd0..79df19f04 100644 --- a/snippet_data/snippets.json +++ b/snippet_data/snippets.json @@ -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 } }, @@ -1350,7 +1347,7 @@ "fileName": "deepClone.md", "text": "Creates a deep clone of an object.\n\nUse recursion.\nCheck if the passed object is `null` and, if so, return `null`.\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.\n\n", "codeBlocks": { - "es6": "const deepClone = obj => {\n if (obj === null) return null;\n let clone = Object.assign({}, obj);\n Object.keys(clone).forEach(\n key => (clone[key] = typeof obj[key] === 'object' ? deepClone(obj[key]) : obj[key])\n );\n return Array.isArray(obj) && obj.length\n ? (clone.length = obj.length) && Array.from(clone)\n : Array.isArray(obj)\n ? Array.from(obj)\n : clone;\n};", + "es6": "const deepClone = obj => {\n if (obj === null) return null;\n let clone = Object.assign({}, obj);\n Object.keys(clone).forEach(\n key => (clone[key] = typeof obj[key] === 'object' ? deepClone(obj[key]) : obj[key])\n );\n return Array.isArray(obj) && obj.length\n ? (clone.length = obj.length) && Array.from(clone)\n : Array.isArray(obj)\n ? Array.from(obj)\n : clone;\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 deepClone = function deepClone(obj) {\n if (obj === null) return null;\n var clone = Object.assign({}, obj);\n Object.keys(clone).forEach(function (key) {\n return clone[key] = _typeof(obj[key]) === 'object' ? deepClone(obj[key]) : obj[key];\n });\n return Array.isArray(obj) && obj.length ? (clone.length = obj.length) && Array.from(clone) : Array.isArray(obj) ? Array.from(obj) : clone;\n};", "example": "const a = { foo: 'bar', obj: { a: 1, b: 2 } };\nconst b = deepClone(a); // a !== b, a.obj !== b.obj" }, @@ -1361,7 +1358,7 @@ ] }, "meta": { - "hash": "77a01af8797ecbe71b9c9412d21c144c03a46a49dd3d0e7d869c3df38b39b2b4", + "hash": "0a4684d6fc79bdbbac31df3af6c493ba7c881936ada5bc52824b4f26ca177459", "firstSeen": "1516733326", "lastUpdated": "1577785133", "updateCount": 55, @@ -1453,7 +1450,7 @@ "fileName": "deepMapKeys.md", "text": "Deep maps an object's keys.\n\nCreates an object with the same values as the provided object and keys generated by running the provided function for each key.\nUse `Object.keys(obj)` to iterate over the object's keys. \nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n\n", "codeBlocks": { - "es6": "const deepMapKeys = (obj, f) =>\n Array.isArray(obj)\n ? obj.map(val => deepMapKeys(val, f))\n : typeof obj === 'object'\n ? Object.keys(obj).reduce((acc, current) => {\n const val = obj[current];\n acc[f(current)] =\n val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);\n return acc;\n }, {})\n : obj;", + "es6": "const deepMapKeys = (obj, f) =>\n Array.isArray(obj)\n ? obj.map(val => deepMapKeys(val, f))\n : typeof obj === 'object'\n ? Object.keys(obj).reduce((acc, current) => {\n const val = obj[current];\n acc[f(current)] =\n val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);\n return acc;\n }, {})\n : obj;", "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 deepMapKeys = function deepMapKeys(obj, f) {\n return Array.isArray(obj) ? obj.map(function (val) {\n return deepMapKeys(val, f);\n }) : _typeof(obj) === 'object' ? Object.keys(obj).reduce(function (acc, current) {\n var val = obj[current];\n acc[f(current)] = val !== null && _typeof(val) === 'object' ? deepMapKeys(val, f) : acc[f(current)] = val;\n return acc;\n }, {}) : obj;\n};", "example": "const obj = {\n foo: '1',\n nested: {\n child: {\n withArray: [\n {\n grandChild: ['hello']\n }\n ]\n }\n }\n};\nconst upperKeysObj = deepMapKeys(obj, key => key.toUpperCase());\n/*\n{\n \"FOO\":\"1\",\n \"NESTED\":{\n \"CHILD\":{\n \"WITHARRAY\":[\n {\n \"GRANDCHILD\":[ 'hello' ]\n }\n ]\n }\n }\n}\n*/" }, @@ -1464,7 +1461,7 @@ ] }, "meta": { - "hash": "6fa14364405f7b99aa49c2157bdc08c02b4ce2f288db29a4348a6983460933c7", + "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf", "firstSeen": "1544374334\n1543497773", "lastUpdated": "1577785133", "updateCount": 69, @@ -1682,7 +1679,7 @@ "fileName": "dig.md", "text": "Returns the target value in a nested JSON object, based on the given key.\n\nUse the `in` operator to check if `target` exists in `obj`.\nIf 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.\n\n", "codeBlocks": { - "es6": "const dig = (obj, target) =>\n target in obj\n ? obj[target]\n : Object.values(obj).reduce((acc, val) => {\n if (acc !== undefined) return acc;\n if (typeof val === 'object') return dig(val, target);\n }, undefined);", + "es6": "const dig = (obj, target) =>\n target in obj\n ? obj[target]\n : Object.values(obj).reduce((acc, val) => {\n if (acc !== undefined) return acc;\n if (typeof val === 'object') return dig(val, target);\n }, undefined);", "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 dig = function dig(obj, target) {\n return target in obj ? obj[target] : Object.values(obj).reduce(function (acc, val) {\n if (acc !== undefined) return acc;\n if (_typeof(val) === 'object') return dig(val, target);\n }, undefined);\n};", "example": "const data = {\n level1: {\n level2: {\n level3: 'some data'\n }\n }\n};\ndig(data, 'level3'); // 'some data'\ndig(data, 'level4'); // undefined" }, @@ -1693,7 +1690,7 @@ ] }, "meta": { - "hash": "bdc202436bee09f06a353d31841c6cfff33e8efead34c6c56ae1a1413284976d", + "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528", "firstSeen": "1531080384", "lastUpdated": "1577791301", "updateCount": 91, @@ -2068,7 +2065,7 @@ "fileName": "factorial.md", "text": "Calculates the factorial of a number.\n\nUse recursion.\nIf `n` is less than or equal to `1`, return `1`.\nOtherwise, return the product of `n` and the factorial of `n - 1`.\nThrows an exception if `n` is a negative number.\n\n", "codeBlocks": { - "es6": "const factorial = n =>\n n < 0\n ? (() => {\n throw new TypeError('Negative numbers are not allowed!');\n })()\n : n <= 1\n ? 1\n : n * factorial(n - 1);", + "es6": "const factorial = n =>\n n < 0\n ? (() => {\n throw new TypeError('Negative numbers are not allowed!');\n })()\n : n <= 1\n ? 1\n : n * factorial(n - 1);", "es5": "var factorial = function factorial(n) {\n return n < 0 ? function () {\n throw new TypeError('Negative numbers are not allowed!');\n }() : n <= 1 ? 1 : n * factorial(n - 1);\n};", "example": "factorial(6); // 720" }, @@ -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 } }, @@ -2759,7 +2755,7 @@ "fileName": "getMeridiemSuffixOfInteger.md", "text": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\n\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.\n\n", "codeBlocks": { - "es6": "const getMeridiemSuffixOfInteger = num =>\n num === 0 || num === 24\n ? 12 + 'am'\n : num === 12\n ? 12 + 'pm'\n : num < 12\n ? (num % 12) + 'am'\n : (num % 12) + 'pm';", + "es6": "const getMeridiemSuffixOfInteger = num =>\n num === 0 || num === 24\n ? 12 + 'am'\n : num === 12\n ? 12 + 'pm'\n : num < 12\n ? (num % 12) + 'am'\n : (num % 12) + 'pm';", "es5": "var getMeridiemSuffixOfInteger = function getMeridiemSuffixOfInteger(num) {\n return num === 0 || num === 24 ? 12 + 'am' : num === 12 ? 12 + 'pm' : num < 12 ? num % 12 + 'am' : num % 12 + 'pm';\n};", "example": "getMeridiemSuffixOfInteger(0); // \"12am\"\ngetMeridiemSuffixOfInteger(11); // \"11am\"\ngetMeridiemSuffixOfInteger(13); // \"1pm\"\ngetMeridiemSuffixOfInteger(25); // \"1pm\"" }, @@ -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 } }, { @@ -4770,7 +4766,7 @@ "fileName": "join.md", "text": "Joins all elements of an array into a string and returns this string.\nUses a separator and an end separator.\n\nUse `Array.prototype.reduce()` to combine elements into a string.\nOmit the second argument, `separator`, to use a default separator of `','`.\nOmit the third argument, `end`, to use the same value as `separator` by default.\n\n", "codeBlocks": { - "es6": "const join = (arr, separator = ',', end = separator) =>\n arr.reduce(\n (acc, val, i) =>\n i === arr.length - 2\n ? acc + val + end\n : i === arr.length - 1\n ? acc + val\n : acc + val + separator,\n ''\n );", + "es6": "const join = (arr, separator = ',', end = separator) =>\n arr.reduce(\n (acc, val, i) =>\n i === arr.length - 2\n ? acc + val + end\n : i === arr.length - 1\n ? acc + val\n : acc + val + separator,\n ''\n );", "es5": "var join = function join(arr) {\n var separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : separator;\n return arr.reduce(function (acc, val, i) {\n return i === arr.length - 2 ? acc + val + end : i === arr.length - 1 ? acc + val : acc + val + separator;\n }, '');\n};", "example": "join(['pen', 'pineapple', 'apple', 'pen'], ',', '&'); // \"pen,pineapple,apple&pen\"\njoin(['pen', 'pineapple', 'apple', 'pen'], ','); // \"pen,pineapple,apple,pen\"\njoin(['pen', 'pineapple', 'apple', 'pen']); // \"pen,pineapple,apple,pen\"" }, @@ -4780,10 +4776,10 @@ ] }, "meta": { - "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a", + "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8", "firstSeen": "1514801920", - "lastUpdated": "1578058637", - "updateCount": 58, + "lastUpdated": "1578253557", + "updateCount": 59, "authorCount": 7 } }, @@ -5704,7 +5700,7 @@ "fileName": "objectToQueryString.md", "text": "Returns a query string generated from the key-value pairs of the given object.\n\nUse `Array.prototype.reduce()` on `Object.entries(queryParameters)` to create the query string.\nDetermine the `symbol` to be either `?` or `&` based on the `length` of `queryString` and concatenate `val` to `queryString` only if it's a string.\nReturn the `queryString` or an empty string when the `queryParameters` are falsy.\n\n", "codeBlocks": { - "es6": "const objectToQueryString = queryParameters => {\n return queryParameters\n ? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {\n const symbol = queryString.length === 0 ? '?' : '&';\n queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';\n return queryString;\n }, '')\n : '';\n};", + "es6": "const objectToQueryString = queryParameters => {\n return queryParameters\n ? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {\n const symbol = queryString.length === 0 ? '?' : '&';\n queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';\n return queryString;\n }, '')\n : '';\n};", "es5": "function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { if (!(Symbol.iterator in Object(arr) || Object.prototype.toString.call(arr) === \"[object Arguments]\")) { return; } var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nvar objectToQueryString = function objectToQueryString(queryParameters) {\n return queryParameters ? Object.entries(queryParameters).reduce(function (queryString, _ref, index) {\n var _ref2 = _slicedToArray(_ref, 2),\n key = _ref2[0],\n val = _ref2[1];\n\n var symbol = queryString.length === 0 ? '?' : '&';\n queryString += typeof val === 'string' ? \"\".concat(symbol).concat(key, \"=\").concat(val) : '';\n return queryString;\n }, '') : '';\n};", "example": "objectToQueryString({ page: '1', size: '2kg', key: undefined }); // '?page=1&size=2kg'" }, @@ -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 } }, @@ -6922,7 +6912,7 @@ "fileName": "remove.md", "text": "Removes elements from an array for which the given function returns `false`.\n\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\nThe `func` is invoked with three arguments (`value, index, array`).\n\n", "codeBlocks": { - "es6": "const remove = (arr, func) =>\n Array.isArray(arr)\n ? arr.filter(func).reduce((acc, val) => {\n arr.splice(arr.indexOf(val), 1);\n return acc.concat(val);\n }, [])\n : [];", + "es6": "const remove = (arr, func) =>\n Array.isArray(arr)\n ? arr.filter(func).reduce((acc, val) => {\n arr.splice(arr.indexOf(val), 1);\n return acc.concat(val);\n }, [])\n : [];", "es5": "var remove = function remove(arr, func) {\n return Array.isArray(arr) ? arr.filter(func).reduce(function (acc, val) {\n arr.splice(arr.indexOf(val), 1);\n return acc.concat(val);\n }, []) : [];\n};", "example": "remove([1, 2, 3, 4], n => n % 2 === 0); // [2, 4]" }, @@ -6932,10 +6922,10 @@ ] }, "meta": { - "hash": "c1542907e6295eb81df918174c247a65d73c8daccc56769f2eb32d609b7846fc", + "hash": "069472d018c3102412dafc2ae8ec6e9396e53c01d0073079f2e3f1ac3c99b6e9", "firstSeen": "1513521691", - "lastUpdated": "1578058637", - "updateCount": 79, + "lastUpdated": "1578253557", + "updateCount": 80, "authorCount": 6 } }, @@ -7436,7 +7426,7 @@ "fileName": "size.md", "text": "Gets the size of an array, object or string.\n\nGet type of `val` (`array`, `object` or `string`). \nUse `length` property for arrays.\nUse `length` or `size` value if available or number of keys for objects.\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\nSplit strings into array of characters with `split('')` and return its length.\n\n", "codeBlocks": { - "es6": "const size = val =>\n Array.isArray(val)\n ? val.length\n : val && typeof val === 'object'\n ? val.size || val.length || Object.keys(val).length\n : typeof val === 'string'\n ? new Blob([val]).size\n : 0;", + "es6": "const size = val =>\n Array.isArray(val)\n ? val.length\n : val && typeof val === 'object'\n ? val.size || val.length || Object.keys(val).length\n : typeof val === 'string'\n ? new Blob([val]).size\n : 0;", "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 size = function size(val) {\n return Array.isArray(val) ? val.length : val && _typeof(val) === 'object' ? val.size || val.length || Object.keys(val).length : typeof val === 'string' ? new Blob([val]).size : 0;\n};", "example": "size([1, 2, 3, 4, 5]); // 5\nsize('size'); // 4\nsize({ one: 1, two: 2, three: 3 }); // 3" }, @@ -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 } }, diff --git a/snippets/call.md b/snippets/call.md index d6976db99..f8db81575 100644 --- a/snippets/call.md +++ b/snippets/call.md @@ -7,11 +7,11 @@ Given a key and a set of arguments, call them when given a context. Primarily us Use a closure to call a stored key with stored arguments. -```js +```js const call = (key, ...args) => context => context[key](...args); ``` -```js +```js Promise.resolve([1, 2, 3]) .then(call('map', x => 2 * x)) .then(console.log); // [ 2, 4, 6 ] diff --git a/snippets/collectInto.md b/snippets/collectInto.md index 93d00feec..107e7e965 100644 --- a/snippets/collectInto.md +++ b/snippets/collectInto.md @@ -7,11 +7,11 @@ Changes a function that accepts an array into a variadic function. Given a function, return a closure that collects all inputs into an array-accepting function. -```js +```js const collectInto = fn => (...args) => fn(args); ``` -```js +```js const Pall = collectInto(Promise.all.bind(Promise)); let p1 = Promise.resolve(1); let p2 = Promise.resolve(2); diff --git a/snippets/deepClone.md b/snippets/deepClone.md index 583169aa7..a0da1f0a5 100644 --- a/snippets/deepClone.md +++ b/snippets/deepClone.md @@ -20,8 +20,8 @@ const deepClone = obj => { return Array.isArray(obj) && obj.length ? (clone.length = obj.length) && Array.from(clone) : Array.isArray(obj) - ? Array.from(obj) - : clone; + ? Array.from(obj) + : clone; }; ``` diff --git a/snippets/deepMapKeys.md b/snippets/deepMapKeys.md index e9561091d..e07084847 100644 --- a/snippets/deepMapKeys.md +++ b/snippets/deepMapKeys.md @@ -14,13 +14,13 @@ const deepMapKeys = (obj, f) => Array.isArray(obj) ? obj.map(val => deepMapKeys(val, f)) : typeof obj === 'object' - ? Object.keys(obj).reduce((acc, current) => { + ? Object.keys(obj).reduce((acc, current) => { const val = obj[current]; acc[f(current)] = val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val); return acc; }, {}) - : obj; + : obj; ``` ```js diff --git a/snippets/dig.md b/snippets/dig.md index 4484cdd6f..16c08bebe 100644 --- a/snippets/dig.md +++ b/snippets/dig.md @@ -13,9 +13,9 @@ const dig = (obj, target) => target in obj ? obj[target] : Object.values(obj).reduce((acc, val) => { - if (acc !== undefined) return acc; - if (typeof val === 'object') return dig(val, target); - }, undefined); + if (acc !== undefined) return acc; + if (typeof val === 'object') return dig(val, target); + }, undefined); ``` ```js diff --git a/snippets/factorial.md b/snippets/factorial.md index 461dbd4f1..0b1413c15 100644 --- a/snippets/factorial.md +++ b/snippets/factorial.md @@ -14,11 +14,11 @@ Throws an exception if `n` is a negative number. const factorial = n => n < 0 ? (() => { - throw new TypeError('Negative numbers are not allowed!'); - })() + throw new TypeError('Negative numbers are not allowed!'); + })() : n <= 1 - ? 1 - : n * factorial(n - 1); + ? 1 + : n * factorial(n - 1); ``` ```js diff --git a/snippets/flip.md b/snippets/flip.md index 803dfb2ed..62a12bef3 100644 --- a/snippets/flip.md +++ b/snippets/flip.md @@ -7,11 +7,11 @@ Flip takes a function as an argument, then makes the first argument the last. Return a closure that takes variadic inputs, and splices the last argument to make it the first argument before applying the rest. -```js +```js const flip = fn => (first, ...rest) => fn(...rest, first); ``` -```js +```js let a = { name: 'John Smith' }; let b = {}; const mergeFrom = flip(Object.assign); diff --git a/snippets/getMeridiemSuffixOfInteger.md b/snippets/getMeridiemSuffixOfInteger.md index 1d9c01ee0..c460f5644 100644 --- a/snippets/getMeridiemSuffixOfInteger.md +++ b/snippets/getMeridiemSuffixOfInteger.md @@ -12,10 +12,10 @@ const getMeridiemSuffixOfInteger = num => num === 0 || num === 24 ? 12 + 'am' : num === 12 - ? 12 + 'pm' - : num < 12 - ? (num % 12) + 'am' - : (num % 12) + 'pm'; + ? 12 + 'pm' + : num < 12 + ? (num % 12) + 'am' + : (num % 12) + 'pm'; ``` ```js diff --git a/snippets/isContainedIn.md b/snippets/isContainedIn.md index 4d5802121..1ee3121df 100644 --- a/snippets/isContainedIn.md +++ b/snippets/isContainedIn.md @@ -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; diff --git a/snippets/join.md b/snippets/join.md index 6df3c9145..6bf258224 100644 --- a/snippets/join.md +++ b/snippets/join.md @@ -11,14 +11,15 @@ 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) => i === arr.length - 2 ? acc + val + end : i === arr.length - 1 - ? acc + val - : acc + val + separator, + ? acc + val + : acc + val + separator, '' ); ``` diff --git a/snippets/objectToQueryString.md b/snippets/objectToQueryString.md index e83fdddce..0b63cd94f 100644 --- a/snippets/objectToQueryString.md +++ b/snippets/objectToQueryString.md @@ -10,13 +10,14 @@ 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) => { - const symbol = queryString.length === 0 ? '?' : '&'; - queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : ''; - return queryString; - }, '') + const symbol = queryString.length === 0 ? '?' : '&'; + queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : ''; + return queryString; + }, '') : ''; }; ``` diff --git a/snippets/pipeAsyncFunctions.md b/snippets/pipeAsyncFunctions.md index 3044ba7ea..921de2bd4 100644 --- a/snippets/pipeAsyncFunctions.md +++ b/snippets/pipeAsyncFunctions.md @@ -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) })(); ``` diff --git a/snippets/remove.md b/snippets/remove.md index c9f127afb..1b3b066a1 100644 --- a/snippets/remove.md +++ b/snippets/remove.md @@ -9,13 +9,12 @@ 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) => { - arr.splice(arr.indexOf(val), 1); - return acc.concat(val); - }, []) + arr.splice(arr.indexOf(val), 1); + return acc.concat(val); + }, []) : []; ``` diff --git a/snippets/size.md b/snippets/size.md index b940a8ea5..c658adcb7 100644 --- a/snippets/size.md +++ b/snippets/size.md @@ -12,14 +12,15 @@ 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 : val && typeof val === 'object' - ? val.size || val.length || Object.keys(val).length - : typeof val === 'string' - ? new Blob([val]).size - : 0; + ? val.size || val.length || Object.keys(val).length + : typeof val === 'string' + ? new Blob([val]).size + : 0; ``` ```js diff --git a/snippets/spreadOver.md b/snippets/spreadOver.md index c967d21e0..02c4e7a5c 100644 --- a/snippets/spreadOver.md +++ b/snippets/spreadOver.md @@ -7,11 +7,11 @@ Takes a variadic function and returns a closure that accepts an array of argumen Use closures and the spread operator (`...`) to map the array of arguments to the inputs of the function. -```js +```js const spreadOver = fn => argsArr => fn(...argsArr); ``` -```js +```js const arrayMax = spreadOver(Math.max); arrayMax([1, 2, 3]); // 3 ``` diff --git a/test/_30s.js b/test/_30s.js index 75a9a1c45..5b782cfc4 100644 --- a/test/_30s.js +++ b/test/_30s.js @@ -199,8 +199,8 @@ const deepClone = obj => { return Array.isArray(obj) && obj.length ? (clone.length = obj.length) && Array.from(clone) : Array.isArray(obj) - ? Array.from(obj) - : clone; + ? Array.from(obj) + : clone; }; const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v))); const deepFreeze = obj => @@ -212,13 +212,13 @@ const deepMapKeys = (obj, f) => Array.isArray(obj) ? obj.map(val => deepMapKeys(val, f)) : typeof obj === 'object' - ? Object.keys(obj).reduce((acc, current) => { + ? Object.keys(obj).reduce((acc, current) => { const val = obj[current]; acc[f(current)] = val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val); return acc; }, {}) - : obj; + : obj; const defaults = (obj, ...defs) => Object.assign({}, obj, ...defs.reverse(), obj); const defer = (fn, ...args) => setTimeout(fn, 1, ...args); const degreesToRads = deg => (deg * Math.PI) / 180.0; @@ -240,9 +240,9 @@ const dig = (obj, target) => target in obj ? obj[target] : Object.values(obj).reduce((acc, val) => { - if (acc !== undefined) return acc; - if (typeof val === 'object') return dig(val, target); - }, undefined); + if (acc !== undefined) return acc; + if (typeof val === 'object') return dig(val, target); + }, undefined); const digitize = n => [...`${n}`].map(i => parseInt(i)); const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0); const drop = (arr, n = 1) => arr.slice(n); @@ -314,11 +314,11 @@ const extendHex = shortHex => const factorial = n => n < 0 ? (() => { - throw new TypeError('Negative numbers are not allowed!'); - })() + throw new TypeError('Negative numbers are not allowed!'); + })() : n <= 1 - ? 1 - : n * factorial(n - 1); + ? 1 + : n * factorial(n - 1); const fibonacci = n => Array.from({ length: n }).reduce( (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), @@ -424,10 +424,10 @@ const getMeridiemSuffixOfInteger = num => num === 0 || num === 24 ? 12 + 'am' : num === 12 - ? 12 + 'pm' - : num < 12 - ? (num % 12) + 'am' - : (num % 12) + 'pm'; + ? 12 + 'pm' + : num < 12 + ? (num % 12) + 'am' + : (num % 12) + 'pm'; const getScrollPosition = (el = window) => ({ x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft, y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop @@ -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; @@ -677,8 +674,8 @@ const join = (arr, separator = ',', end = separator) => i === arr.length - 2 ? acc + val + end : i === arr.length - 1 - ? acc + val - : acc + val + separator, + ? acc + val + : acc + val + separator, '' ); const JSONtoCSV = (arr, columns, delimiter = ',') => @@ -804,10 +801,10 @@ const objectToPairs = obj => Object.keys(obj).map(k => [k, obj[k]]); const objectToQueryString = queryParameters => { return queryParameters ? Object.entries(queryParameters).reduce((queryString, [key, val], index) => { - const symbol = queryString.length === 0 ? '?' : '&'; - queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : ''; - return queryString; - }, '') + const symbol = queryString.length === 0 ? '?' : '&'; + queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : ''; + return queryString; + }, '') : ''; }; const observeMutations = (element, callback, options) => { @@ -1039,9 +1036,9 @@ const reject = (pred, array) => array.filter((...args) => !pred(...args)); const remove = (arr, func) => Array.isArray(arr) ? arr.filter(func).reduce((acc, val) => { - arr.splice(arr.indexOf(val), 1); - return acc.concat(val); - }, []) + arr.splice(arr.indexOf(val), 1); + return acc.concat(val); + }, []) : []; const removeNonASCII = str => str.replace(/[^\x20-\x7E]/g, ''); const renameKeys = (keysMap, obj) => @@ -1119,10 +1116,10 @@ const size = val => Array.isArray(val) ? val.length : val && typeof val === 'object' - ? val.size || val.length || Object.keys(val).length - : typeof val === 'string' - ? new Blob([val]).size - : 0; + ? val.size || val.length || Object.keys(val).length + : typeof val === 'string' + ? new Blob([val]).size + : 0; const sleep = ms => new Promise(resolve => setTimeout(resolve, ms)); const smoothScroll = element => document.querySelector(element).scrollIntoView({ diff --git a/vscode_snippets/snippets.json b/vscode_snippets/snippets.json index 22ba5df65..a4dabf93e 100644 --- a/vscode_snippets/snippets.json +++ b/vscode_snippets/snippets.json @@ -512,8 +512,8 @@ " return Array.isArray(obj) && obj.length", " ? (clone.length = obj.length) && Array.from(clone)", " : Array.isArray(obj)", - " ? Array.from(obj)", - " : clone;", + " ? Array.from(obj)", + " : clone;", "};" ], "description": "Creates a deep clone of an object.\n\nUse recursion.\nCheck if the passed object is `null` and, if so, return `null`.\nUse `Object.assign()` and an empty object (`{}`) to create a shallow clone of the original.\nUse `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.\n" @@ -549,13 +549,13 @@ " Array.isArray(obj)", " ? obj.map(val => deepMapKeys(val, f))", " : typeof obj === 'object'", - " ? Object.keys(obj).reduce((acc, current) => {", + " ? Object.keys(obj).reduce((acc, current) => {", " const val = obj[current];", " acc[f(current)] =", " val !== null && typeof val === 'object' ? deepMapKeys(val, f) : (acc[f(current)] = val);", " return acc;", " }, {})", - " : obj;" + " : obj;" ], "description": "Deep maps an object's keys.\n\nCreates an object with the same values as the provided object and keys generated by running the provided function for each key.\nUse `Object.keys(obj)` to iterate over the object's keys. \nUse `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.\n" }, @@ -631,9 +631,9 @@ " target in obj", " ? obj[target]", " : Object.values(obj).reduce((acc, val) => {", - " if (acc !== undefined) return acc;", - " if (typeof val === 'object') return dig(val, target);", - " }, undefined);" + " if (acc !== undefined) return acc;", + " if (typeof val === 'object') return dig(val, target);", + " }, undefined);" ], "description": "Returns the target value in a nested JSON object, based on the given key.\n\nUse the `in` operator to check if `target` exists in `obj`.\nIf 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.\n" }, @@ -795,11 +795,11 @@ "const factorial = n =>", " n < 0", " ? (() => {", - " throw new TypeError('Negative numbers are not allowed!');", - " })()", + " throw new TypeError('Negative numbers are not allowed!');", + " })()", " : n <= 1", - " ? 1", - " : n * factorial(n - 1);" + " ? 1", + " : n * factorial(n - 1);" ], "description": "Calculates the factorial of a number.\n\nUse recursion.\nIf `n` is less than or equal to `1`, return `1`.\nOtherwise, return the product of `n` and the factorial of `n - 1`.\nThrows an exception if `n` is a negative number.\n" }, @@ -1067,10 +1067,10 @@ " num === 0 || num === 24", " ? 12 + 'am'", " : num === 12", - " ? 12 + 'pm'", - " : num < 12", - " ? (num % 12) + 'am'", - " : (num % 12) + 'pm';" + " ? 12 + 'pm'", + " : num < 12", + " ? (num % 12) + 'am'", + " : (num % 12) + 'pm';" ], "description": "Converts an integer to a suffixed string, adding `am` or `pm` based on its value.\n\nUse the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.\n" }, @@ -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;", @@ -1788,8 +1785,8 @@ " i === arr.length - 2", " ? acc + val + end", " : i === arr.length - 1", - " ? acc + val", - " : acc + val + separator,", + " ? acc + val", + " : acc + val + separator,", " ''", " );" ], @@ -2131,10 +2128,10 @@ "const objectToQueryString = queryParameters => {", " return queryParameters", " ? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {", - " const symbol = queryString.length === 0 ? '?' : '&';", - " queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';", - " return queryString;", - " }, '')", + " const symbol = queryString.length === 0 ? '?' : '&';", + " queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';", + " return queryString;", + " }, '')", " : '';", "};" ], @@ -2648,9 +2645,9 @@ "const remove = (arr, func) =>", " Array.isArray(arr)", " ? arr.filter(func).reduce((acc, val) => {", - " arr.splice(arr.indexOf(val), 1);", - " return acc.concat(val);", - " }, [])", + " arr.splice(arr.indexOf(val), 1);", + " return acc.concat(val);", + " }, [])", " : [];" ], "description": "Removes elements from an array for which the given function returns `false`.\n\nUse `Array.prototype.filter()` to find array elements that return truthy values and `Array.prototype.reduce()` to remove elements using `Array.prototype.splice()`.\nThe `func` is invoked with three arguments (`value, index, array`).\n" @@ -2848,10 +2845,10 @@ " Array.isArray(val)", " ? val.length", " : val && typeof val === 'object'", - " ? val.size || val.length || Object.keys(val).length", - " : typeof val === 'string'", - " ? new Blob([val]).size", - " : 0;" + " ? val.size || val.length || Object.keys(val).length", + " : typeof val === 'string'", + " ? new Blob([val]).size", + " : 0;" ], "description": "Gets the size of an array, object or string.\n\nGet type of `val` (`array`, `object` or `string`). \nUse `length` property for arrays.\nUse `length` or `size` value if available or number of keys for objects.\nUse `size` of a [`Blob` object](https://developer.mozilla.org/en-US/docs/Web/API/Blob) created from `val` for strings.\nSplit strings into array of characters with `split('')` and return its length.\n" },