Travis build: 1576
This commit is contained in:
30secondsofcode
@ -352,7 +352,7 @@
|
||||
" }",
|
||||
"};"
|
||||
],
|
||||
"description": "⚠️ **NOTICE:** The same functionality can be easily implemented by using the new asynchronous Clipboard API, which is still experimental but should be used in the future instead of this snippet. Find out more about it [here](https://github.com/w3c/clipboard-apis/blob/master/explainer.adoc#writing-to-the-clipboard).\n\nCopy a string to the clipboard. \nOnly works as a result of user action (i.e. inside a `click` event listener).\n\nCreate a new `<textarea>` element, fill it with the supplied data and add it to the HTML document.\nUse `Selection.getRangeAt()`to store the selected range (if any).\nUse `document.execCommand('copy')` to copy to the clipboard.\nRemove the `<textarea>` element from the HTML document.\nFinally, use `Selection().addRange()` to recover the original selected range (if any).\n"
|
||||
"description": "Copy a string to the clipboard. \nOnly works as a result of user action (i.e. inside a `click` event listener).\n\n⚠️ **NOTICE:** The same functionality can be easily implemented by using the new asynchronous Clipboard API, which is still experimental but should be used in the future instead of this snippet. Find out more about it [here](https://github.com/w3c/clipboard-apis/blob/master/explainer.adoc#writing-to-the-clipboard).\n\nCreate a new `<textarea>` element, fill it with the supplied data and add it to the HTML document.\nUse `Selection.getRangeAt()`to store the selected range (if any).\nUse `document.execCommand('copy')` to copy to the clipboard.\nRemove the `<textarea>` element from the HTML document.\nFinally, use `Selection().addRange()` to recover the original selected range (if any).\n"
|
||||
},
|
||||
"countBy": {
|
||||
"prefix": "30s_countBy",
|
||||
@ -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"
|
||||
},
|
||||
@ -1056,10 +1056,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"
|
||||
},
|
||||
@ -1180,7 +1180,7 @@
|
||||
" );",
|
||||
"};"
|
||||
],
|
||||
"description": "Returns `true` if the target value exists in a JSON object, `false` otherwise.\n\nCheck if `keys` is non-empty and use `Array.prototype.every()` to sequentially check its keys to internal depth of the object, `obj`. \nUse `Object.prototype.hasOwnProperty()` to check if `obj` does not have the current key or is not an object, stop propagation and return `false`.\nOtherwise assign the key's value to `obj` to use on the next iteration.\n\nReturn `false` beforehand if given key list is empty.\n"
|
||||
"description": "Returns `true` if the target value exists in a JSON object, `false` otherwise.\n\nCheck if `keys` is non-empty and use `Array.prototype.every()` to sequentially check its keys to internal depth of the object, `obj`. \nUse `Object.prototype.hasOwnProperty()` to check if `obj` does not have the current key or is not an object, stop propagation and return `false`.\nOtherwise assign the key's value to `obj` to use on the next iteration.\nReturn `false` beforehand if given key list is empty.\n"
|
||||
},
|
||||
"head": {
|
||||
"prefix": "30s_head",
|
||||
@ -1743,8 +1743,8 @@
|
||||
" i === arr.length - 2",
|
||||
" ? acc + val + end",
|
||||
" : i === arr.length - 1",
|
||||
" ? acc + val",
|
||||
" : acc + val + separator,",
|
||||
" ? acc + val",
|
||||
" : acc + val + separator,",
|
||||
" ''",
|
||||
" );"
|
||||
],
|
||||
@ -2073,10 +2073,10 @@
|
||||
"const objectToQueryString = queryParameters => {",
|
||||
" return queryParameters",
|
||||
" ? Object.entries(queryParameters).reduce((queryString, [key, val], index) => {",
|
||||
" const symbol = index === 0 ? '?' : '&';",
|
||||
" queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';",
|
||||
" return queryString;",
|
||||
" }, '')",
|
||||
" const symbol = index === 0 ? '?' : '&';",
|
||||
" queryString += typeof val === 'string' ? `${symbol}${key}=${val}` : '';",
|
||||
" return queryString;",
|
||||
" }, '')",
|
||||
" : '';",
|
||||
"};"
|
||||
],
|
||||
@ -2297,7 +2297,7 @@
|
||||
" );",
|
||||
"};"
|
||||
],
|
||||
"description": "⚠️ **WARNING**: This function's execution time increases exponentially with each array element. Anything more than 8 to 10 entries will cause your browser to hang as it tries to solve all the different combinations.\n\nGenerates all permutations of an array's elements (contains duplicates).\n\nUse recursion.\nFor each element in the given array, create all the partial permutations for the rest of its elements.\nUse `Array.prototype.map()` to combine the element with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\nBase cases are for array `length` equal to `2` or `1`.\n"
|
||||
"description": "Generates all permutations of an array's elements (contains duplicates).\n\n⚠️ **WARNING**: This function's execution time increases exponentially with each array element. Anything more than 8 to 10 entries will cause your browser to hang as it tries to solve all the different combinations.\n\nUse recursion.\nFor each element in the given array, create all the partial permutations for the rest of its elements.\nUse `Array.prototype.map()` to combine the element with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\nBase cases are for array `length` equal to `2` or `1`.\n"
|
||||
},
|
||||
"pick": {
|
||||
"prefix": "30s_pick",
|
||||
@ -2922,7 +2922,7 @@
|
||||
" );",
|
||||
"};"
|
||||
],
|
||||
"description": "⚠️ **WARNING**: This function's execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your browser to hang as it tries to solve all the different combinations.\n\nGenerates all permutations of a string (contains duplicates).\n\nUse recursion.\nFor each letter in the given string, create all the partial permutations for the rest of its letters.\nUse `Array.prototype.map()` to combine the letter with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\nBase cases are for string `length` equal to `2` or `1`.\n"
|
||||
"description": "Generates all permutations of a string (contains duplicates).\n\n⚠️ **WARNING**: This function's execution time increases exponentially with each character. Anything more than 8 to 10 characters will cause your browser to hang as it tries to solve all the different combinations.\n\nUse recursion.\nFor each letter in the given string, create all the partial permutations for the rest of its letters.\nUse `Array.prototype.map()` to combine the letter with each partial permutation, then `Array.prototype.reduce()` to combine all permutations in one array.\nBase cases are for string `length` equal to `2` or `1`.\n"
|
||||
},
|
||||
"stripHTMLTags": {
|
||||
"prefix": "30s_stripHTMLTags",
|
||||
|
||||
Reference in New Issue
Block a user