Given a key and a set of arguments, call them when given a context. Primarily useful in composition.
Use a closure to call a stored key with stored arguments.
-const call = (key, ...args) => context => context[ key ](...args);
+const call = (key, ...args) => context => context[key](...args);
-Promise.resolve( [ 1, 2, 3 ] ).then( call('map', x => 2 * x ) ).then( console.log ) //[ 2, 4, 6 ]
-const map = call.bind(null, 'map')
-Promise.resolve( [ 1, 2, 3 ] ).then( map( x => 2 * x ) ).then( console.log ) //[ 2, 4, 6 ]
+Promise.resolve([1, 2, 3])
+ .then(call('map', x => 2 * x))
+ .then(console.log); //[ 2, 4, 6 ]
+const map = call.bind(null, 'map');
+Promise.resolve([1, 2, 3])
+ .then(map(x => 2 * x))
+ .then(console.log); //[ 2, 4, 6 ]
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.
const collectInto = fn => (...args) => fn(args);
const Pall = collectInto( Promise.all.bind(Promise) )
-let p1 = Promise.resolve(1)
-let p2 = Promise.resolve(2)
-let p3 = new Promise((resolve) => setTimeout(resolve,2000,3))
-Pall(p1, p2, p3).then(console.log)
+const Pall = collectInto(Promise.all.bind(Promise));
+let p1 = Promise.resolve(1);
+let p2 = Promise.resolve(2);
+let p3 = new Promise(resolve => setTimeout(resolve, 2000, 3));
+Pall(p1, p2, p3).then(console.log);
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.
const flip = fn => (...args) => fn(args.pop(), ...args);
let a = {name: 'John Smith'}
-let b = {}
-const mergeFrom = flip(Object.assign)
-let mergePerson = mergeFrom.bind(null, a)
-mergePerson(b) // == b
-b = {}
-Object.assign(b, a) // == b
+let a = { name: 'John Smith' };
+let b = {};
+const mergeFrom = flip(Object.assign);
+let mergePerson = mergeFrom.bind(null, a);
+mergePerson(b); // == b
+b = {};
+Object.assign(b, a); // == b
Performs left-to-right function composition.
@@ -278,72 +282,70 @@ Object.assign(b, a) // == b The first (leftmost) function can accept one or more arguments; the remaining functions must be unary.const pipeFunctions = (...fns) => fns.reduce((f, g) => (...args) => g(f(...args)));
const add5 = x => x + 5
-const multiply = (x, y) => x * y
-const multiplyAndAdd5 = pipeFunctions(multiply, add5)
-multiplyAndAdd5(5, 2) // 15
+const add5 = x => x + 5;
+const multiply = (x, y) => x * y;
+const multiplyAndAdd5 = pipeFunctions(multiply, add5);
+multiplyAndAdd5(5, 2); // 15
Converts an asynchronous function to return a promise.
Use currying to return a function returning a Promise that calls the original function.
Use the ...rest operator to pass in all the parameters.
In Node 8+, you can use util.promisify
const promisify = func =>
- (...args) =>
- new Promise((resolve, reject) =>
- func(...args, (err, result) =>
- err ? reject(err) : resolve(result))
- );
+const promisify = func => (...args) =>
+ new Promise((resolve, reject) =>
+ func(...args, (err, result) => (err ? reject(err) : resolve(result)))
+ );
-const delay = promisify((d, cb) => setTimeout(cb, d))
-delay(2000).then(() => console.log('Hi!')) // // Promise resolves after 2s
+const delay = promisify((d, cb) => setTimeout(cb, d));
+delay(2000).then(() => console.log('Hi!')); // // Promise resolves after 2s
Takes a variadic function and returns a closure that accepts an array of arguments to map to the inputs of the function.
Use closures and the spread operator (...) to map the array of arguments to the inputs of the function.
const spreadOver = fn => argsArr => fn(...argsArr);
const arrayMax = spreadOver(Math.max)
-arrayMax([1,2,3]) // 3
-arrayMax([1,2,4]) // 4
+const arrayMax = spreadOver(Math.max);
+arrayMax([1, 2, 3]); // 3
+arrayMax([1, 2, 4]); // 4
Calculates the greatest common denominator (gcd) of an array of numbers.
Use Array.reduce() and the gcd formula (uses recursion) to calculate the greatest common denominator of an array of numbers.
const arrayGcd = arr => {
- const gcd = (x, y) => !y ? x : gcd(y, x % y);
+ const gcd = (x, y) => (!y ? x : gcd(y, x % y));
return arr.reduce((a, b) => gcd(a, b));
};
arrayGcd([1,2,3,4,5]) // 1
-arrayGcd([4,8,12]) // 4
+arrayGcd([1, 2, 3, 4, 5]); // 1
+arrayGcd([4, 8, 12]); // 4
Calculates the lowest common multiple (lcm) of an array of numbers.
Use Array.reduce() and the lcm formula (uses recursion) to calculate the lowest common multiple of an array of numbers.
const arrayLcm = arr => {
- const gcd = (x, y) => !y ? x : gcd(y, x % y);
- const lcm = (x, y) => (x * y) / gcd(x, y);
+ const gcd = (x, y) => (!y ? x : gcd(y, x % y));
+ const lcm = (x, y) => x * y / gcd(x, y);
return arr.reduce((a, b) => lcm(a, b));
};
arrayLcm([1,2,3,4,5]) // 60
-arrayLcm([4,8,12]) // 24
+arrayLcm([1, 2, 3, 4, 5]); // 60
+arrayLcm([4, 8, 12]); // 24
Returns the maximum value in an array.
Use Math.max() combined with the spread operator (...) to get the maximum value in the array.
const arrayMax = arr => Math.max(...arr);
arrayMax([10, 1, 5]) // 10
+arrayMax([10, 1, 5]); // 10
Returns the minimum value in an array.
Use Math.min() combined with the spread operator (...) to get the minimum value in the array.
const arrayMin = arr => Math.min(...arr);
arrayMin([10, 1, 5]) // 1
+arrayMin([10, 1, 5]); // 1
Chunks an array into smaller arrays of a specified size.
@@ -351,53 +353,58 @@ arrayLcm([4,8,12]) // 24 UseArray.slice() to map each element of the new array to a chunk the length of size.
If the original array can't be split evenly, the final chunk will contain the remaining elements.
const chunk = (arr, size) =>
- Array.from({length: Math.ceil(arr.length / size)}, (v, i) => arr.slice(i * size, i * size + size));
+ Array.from({ length: Math.ceil(arr.length / size) }, (v, i) =>
+ arr.slice(i * size, i * size + size)
+ );
chunk([1,2,3,4,5], 2) // [[1,2],[3,4],[5]]
+chunk([1, 2, 3, 4, 5], 2); // [[1,2],[3,4],[5]]
Removes falsey values from an array.
Use Array.filter() to filter out falsey values (false, null, 0, "", undefined, and NaN).
const compact = arr => arr.filter(Boolean);
compact([0, 1, false, 2, '', 3, 'a', 'e'*23, NaN, 's', 34]) // [ 1, 2, 3, 'a', 's', 34 ]
+compact([0, 1, false, 2, '', 3, 'a', 'e' * 23, NaN, 's', 34]); // [ 1, 2, 3, 'a', 's', 34 ]
Counts the occurrences of a value in an array.
Use Array.reduce() to increment a counter each time you encounter the specific value inside the array.
const countOccurrences = (arr, value) => arr.reduce((a, v) => v === value ? a + 1 : a + 0, 0);
+const countOccurrences = (arr, value) => arr.reduce((a, v) => (v === value ? a + 1 : a + 0), 0);
-countOccurrences([1,1,2,1,2,3], 1) // 3
+countOccurrences([1, 1, 2, 1, 2, 3], 1); // 3
Deep flattens an array.
Use recursion.
Use Array.concat() with an empty array ([]) and the spread operator (...) to flatten an array.
Recursively flatten each element that is an array.
const deepFlatten = arr => [].concat(...arr.map(v => Array.isArray(v) ? deepFlatten(v) : v));
+const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));
-deepFlatten([1,[2],[[3],4],5]) // [1,2,3,4,5]
+deepFlatten([1, [2], [[3], 4], 5]); // [1,2,3,4,5]
Returns the difference between two arrays.
Create a Set from b, then use Array.filter() on a to only keep values not contained in b.
const difference = (a, b) => { const s = new Set(b); return a.filter(x => !s.has(x)); };
+const difference = (a, b) => {
+ const s = new Set(b);
+ return a.filter(x => !s.has(x));
+};
-difference([1,2,3], [1,2,4]) // [3]
+difference([1, 2, 3], [1, 2, 4]); // [3]
Filters out all values from an array for which the comparator function does not return true.
Use Array.filter() and Array.find() to find the appropriate values.
const differenceWith = (arr, val, comp) => arr.filter(a => !val.find(b => comp(a, b)));
differenceWith([1, 1.2, 1.5, 3], [1.9, 3], (a,b) => Math.round(a) == Math.round(b)) // [1, 1.2]
+differenceWith([1, 1.2, 1.5, 3], [1.9, 3], (a, b) => Math.round(a) == Math.round(b)); // [1, 1.2]
Returns all the distinct values of an array.
Use ES6 Set and the ...rest operator to discard all duplicated values.
const distinctValuesOfArray = arr => [...new Set(arr)];
distinctValuesOfArray([1,2,2,3,4,4,5]) // [1,2,3,4,5]
+distinctValuesOfArray([1, 2, 2, 3, 4, 4, 5]); // [1,2,3,4,5]
Removes elements in an array until the passed function returns true. Returns the remaining elements in the array.
dropElements([1, 2, 3, 4], n => n >= 3) // [3,4]
+dropElements([1, 2, 3, 4], n => n >= 3); // [3,4]
Returns a new array with n elements removed from the right.
Use Array.slice() to slice the remove the specified number of elements from the right.
const dropRight = (arr, n = 1) => arr.slice(0, -n);
dropRight([1,2,3]) // [1,2]
-dropRight([1,2,3], 2) // [1]
-dropRight([1,2,3], 42) // []
+dropRight([1, 2, 3]); // [1,2]
+dropRight([1, 2, 3], 2); // [1]
+dropRight([1, 2, 3], 42); // []
Returns every nth element in an array.
Use Array.filter() to create a new array that contains every nth element of a given array.
const everyNth = (arr, nth) => arr.filter((e, i) => i % nth === nth - 1);
everyNth([1,2,3,4,5,6], 2) // [ 2, 4, 6 ]
+everyNth([1, 2, 3, 4, 5, 6], 2); // [ 2, 4, 6 ]
Filters out the non-unique values in an array.
Use Array.filter() for an array containing only the unique values.
const filterNonUnique = arr => arr.filter(i => arr.indexOf(i) === arr.lastIndexOf(i));
filterNonUnique([1,2,2,3,4,4,5]) // [1,3,5]
+filterNonUnique([1, 2, 2, 3, 4, 4, 5]); // [1,3,5]
Flattens an array.
Use a new array and concatenate it with the spread input array causing a shallow denesting of any contained arrays.
-const flatten = arr => [ ].concat(...arr);
+const flatten = arr => [].concat(...arr);
-flatten([1,[2],3,4]) // [1,2,3,4]
+flatten([1, [2], 3, 4]); // [1,2,3,4]
Flattens an array up to the specified depth.
@@ -447,52 +454,58 @@ UseArray.reduce() and Array.concat() to merge element
Base case, for depth equal to 1 stops recursion.
Omit the second element, depth to flatten only to a depth of 1 (single flatten).
const flattenDepth = (arr, depth = 1) =>
- depth != 1 ? arr.reduce((a, v) => a.concat(Array.isArray(v) ? flattenDepth(v, depth - 1) : v), [])
- : arr.reduce((a, v) => a.concat(v), []);
+ depth != 1
+ ? arr.reduce((a, v) => a.concat(Array.isArray(v) ? flattenDepth(v, depth - 1) : v), [])
+ : arr.reduce((a, v) => a.concat(v), []);
flattenDepth([1,[2],3,4]) // [1,2,3,4]
+flattenDepth([1, [2], 3, 4]); // [1,2,3,4]
Groups the elements of an array based on the given function.
Use Array.map() to map the values of an array to a function or property name.
Use Array.reduce() to create an object, where the keys are produced from the mapped results.
const groupBy = (arr, func) =>
- arr.map(typeof func === 'function' ? func : val => val[func])
- .reduce((acc, val, i) => { acc[val] = (acc[val] || []).concat(arr[i]); return acc; }, {});
+ arr.map(typeof func === 'function' ? func : val => val[func]).reduce((acc, val, i) => {
+ acc[val] = (acc[val] || []).concat(arr[i]);
+ return acc;
+ }, {});
groupBy([6.1, 4.2, 6.3], Math.floor) // {4: [4.2], 6: [6.1, 6.3]}
-groupBy(['one', 'two', 'three'], 'length') // {3: ['one', 'two'], 5: ['three']}
+groupBy([6.1, 4.2, 6.3], Math.floor); // {4: [4.2], 6: [6.1, 6.3]}
+groupBy(['one', 'two', 'three'], 'length'); // {3: ['one', 'two'], 5: ['three']}
Returns the head of a list.
Use arr[0] to return the first element of the passed array.
const head = arr => arr[0];
head([1,2,3]) // 1
+head([1, 2, 3]); // 1
Returns all the elements of an array except the last one.
Use arr.slice(0,-1) to return all but the last element of the array.
const initial = arr => arr.slice(0, -1);
initial([1,2,3]) // [1,2]
+initial([1, 2, 3]); // [1,2]
Initializes a 2D array of given width and height and value.
Use Array.map() to generate h rows where each is a new array of size w initialize with value. If the value is not provided, default to null.
const initialize2DArray = (w, h, val = null) => Array(h).fill().map(() => Array(w).fill(val));
+const initialize2DArray = (w, h, val = null) =>
+ Array(h)
+ .fill()
+ .map(() => Array(w).fill(val));
-initialize2DArray(2, 2, 0) // [[0,0], [0,0]]
+initialize2DArray(2, 2, 0); // [[0,0], [0,0]]
Initializes an array containing the numbers in the specified range where start and end are inclusive.
Use Array((end + 1) - start) to create an array of the desired length, Array.map() to fill with the desired values in a range.
You can omit start to use a default value of 0.
const initializeArrayWithRange = (end, start = 0) =>
- Array.from({ length: (end + 1) - start }).map((v, i) => i + start);
+ Array.from({ length: end + 1 - start }).map((v, i) => i + start);
initializeArrayWithRange(5) // [0,1,2,3,4,5]
-initializeArrayWithRange(7, 3) // [3,4,5,6,7]
+initializeArrayWithRange(5); // [0,1,2,3,4,5]
+initializeArrayWithRange(7, 3); // [3,4,5,6,7]
Initializes and fills an array with the specified values.
@@ -500,30 +513,35 @@ initializeArrayWithRange(7, 3) // [3,4,5,6,7] You can omitvalue to use a default value of 0.
const initializeArrayWithValues = (n, value = 0) => Array(n).fill(value);
initializeArrayWithValues(5, 2) // [2,2,2,2,2]
+initializeArrayWithValues(5, 2); // [2,2,2,2,2]
Returns a list of elements that exist in both arrays.
Create a Set from b, then use Array.filter() on a to only keep values contained in b.
const intersection = (a, b) => { const s = new Set(b); return a.filter(x => s.has(x)); };
+const intersection = (a, b) => {
+ const s = new Set(b);
+ return a.filter(x => s.has(x));
+};
-intersection([1,2,3], [4,3,2]) // [2,3]
+intersection([1, 2, 3], [4, 3, 2]); // [2,3]
Returns the last element in an array.
Use arr.length - 1 to compute the index of the last element of the given array and returning it.
const last = arr => arr[arr.length - 1];
last([1,2,3]) // 3
+last([1, 2, 3]); // 3
Maps the values of an array to an object using a function, where the key-value pairs consist of the original value as the key and the mapped value.
Use an anonymous inner function scope to declare an undefined memory space, using closures to store a return value. Use a new Array to store the array with a map of the function over its data set and a comma operator to return a second step, without needing to move from one context to another (due to closures and order of operations).
const mapObject = (arr, fn) =>
- (a => (a = [arr, arr.map(fn)], a[0].reduce((acc, val, ind) => (acc[val] = a[1][ind], acc), {})))();
+ (a => (
+ (a = [arr, arr.map(fn)]), a[0].reduce((acc, val, ind) => ((acc[val] = a[1][ind]), acc), {})
+ ))();
const squareIt = arr => mapObject(arr, a => a*a)
-squareIt([1,2,3]) // { 1: 1, 2: 4, 3: 9 }
+const squareIt = arr => mapObject(arr, a => a * a);
+squareIt([1, 2, 3]); // { 1: 1, 2: 4, 3: 9 }
Returns the nth element of an array.
@@ -532,8 +550,8 @@ If the index is out of bounds, return[].
Omit the second argument, n, to get the first element of the array.
const nthElement = (arr, n = 0) => (n > 0 ? arr.slice(n, n + 1) : arr.slice(n))[0];
nthElement(['a','b','c'],1) // 'b'
-nthElement(['a','b','b'],-3) // 'a'
+nthElement(['a', 'b', 'c'], 1); // 'b'
+nthElement(['a', 'b', 'b'], -3); // 'a'
Picks the key-value pairs corresponding to the given keys from an object.
@@ -541,7 +559,7 @@ nthElement(['a','b','b'],-3) // 'a'const pick = (obj, arr) =>
arr.reduce((acc, curr) => (curr in obj && (acc[curr] = obj[curr]), acc), {});
pick({ 'a': 1, 'b': '2', 'c': 3 }, ['a', 'c']) // { 'a': 1, 'c': 3 }
+pick({ a: 1, b: '2', c: 3 }, ['a', 'c']); // { 'a': 1, 'c': 3 }
Mutates the original array to filter out the values specified.
@@ -557,11 +575,11 @@ UseArray.length = 0 to mutate the passed in an array by resetting
let myArray1 = ['a', 'b', 'c', 'a', 'b', 'c'];
pull(myArray1, 'a', 'c');
-console.log(myArray1) // [ 'b', 'b' ]
+console.log(myArray1); // [ 'b', 'b' ]
let myArray2 = ['a', 'b', 'c', 'a', 'b', 'c'];
pull(myArray2, ['a', 'c']);
-console.log(myArray2) // [ 'b', 'b' ]
+console.log(myArray2); // [ 'b', 'b' ]
Mutates the original array to filter out the values at the specified indexes.
@@ -570,8 +588,9 @@ UseArray.length = 0 to mutate the passed in an array by resetting
Use Array.push() to keep track of pulled values
const pullAtIndex = (arr, pullArr) => {
let removed = [];
- let pulled = arr.map((v, i) => pullArr.includes(i) ? removed.push(v) : v)
- .filter((v, i) => !pullArr.includes(i));
+ let pulled = arr
+ .map((v, i) => (pullArr.includes(i) ? removed.push(v) : v))
+ .filter((v, i) => !pullArr.includes(i));
arr.length = 0;
pulled.forEach(v => arr.push(v));
return removed;
@@ -590,7 +609,7 @@ Use Array.length = 0 to mutate the passed in an array by resetting
Use Array.push() to keep track of pulled values
const pullAtValue = (arr, pullArr) => {
let removed = [],
- pushToRemove = arr.forEach((v, i) => pullArr.includes(v) ? removed.push(v) : v),
+ pushToRemove = arr.forEach((v, i) => (pullArr.includes(v) ? removed.push(v) : v)),
mutateTo = arr.filter((v, i) => !pullArr.includes(v));
arr.length = 0;
mutateTo.forEach(v => arr.push(v));
@@ -607,12 +626,14 @@ console.log(pulled); // [ 'b', 'd' ]
Use Array.filter() to find array elements that return truthy values and Array.reduce() to remove elements using Array.splice().
The func is invoked with three arguments (value, index, array).
const remove = (arr, func) =>
- Array.isArray(arr) ? arr.filter(func).reduce((acc, val) => {
- arr.splice(arr.indexOf(val), 1); return acc.concat(val);
- }, [])
- : [];
+ Array.isArray(arr)
+ ? arr.filter(func).reduce((acc, val) => {
+ arr.splice(arr.indexOf(val), 1);
+ return acc.concat(val);
+ }, [])
+ : [];
-remove([1, 2, 3, 4], n => n % 2 == 0) // [2, 4]
+remove([1, 2, 3, 4], n => n % 2 == 0); // [2, 4]
Returns a random element from an array.
@@ -620,7 +641,7 @@ Thefunc is invoked with three arguments (value, index, array
This method also works with strings.
const sample = arr => arr[Math.floor(Math.random() * arr.length)];
-sample([3, 7, 9, 11]) // 9
+sample([3, 7, 9, 11]); // 9
Randomizes the order of the values of an array, returning a new array.
@@ -634,57 +655,58 @@ This method also works with strings. return arr; }; -const foo = [1,2,3]
-shuffle(foo) // [2,3,1]
-console.log(foo) // [1,2,3]
+const foo = [1, 2, 3];
+shuffle(foo); // [2,3,1]
+console.log(foo); // [1,2,3]
Returns an array of elements that appear in both arrays.
Use filter() to remove values that are not part of values, determined using includes().
const similarity = (arr, values) => arr.filter(v => values.includes(v));
similarity([1,2,3], [1,2,4]) // [1,2]
+similarity([1, 2, 3], [1, 2, 4]); // [1,2]
Returns the symmetric difference between two arrays.
Create a Set from each array, then use Array.filter() on each of them to only keep values not contained in the other.
const symmetricDifference = (a, b) => {
- const sA = new Set(a), sB = new Set(b);
+ const sA = new Set(a),
+ sB = new Set(b);
return [...a.filter(x => !sB.has(x)), ...b.filter(x => !sA.has(x))];
};
symmetricDifference([1,2,3], [1,2,4]) // [3,4]
+symmetricDifference([1, 2, 3], [1, 2, 4]); // [3,4]
Returns all elements in an array except for the first one.
Return arr.slice(1) if the array's length is more than 1, otherwise, return the whole array.
const tail = arr => arr.length > 1 ? arr.slice(1) : arr;
+const tail = arr => (arr.length > 1 ? arr.slice(1) : arr);
-tail([1,2,3]) // [2,3]
-tail([1]) // [1]
+tail([1, 2, 3]); // [2,3]
+tail([1]); // [1]
Returns an array with n elements removed from the beginning.
Use Array.slice() to create a slice of the array with n elements taken from the beginning.
const take = (arr, n = 1) => arr.slice(0, n);
take([1, 2, 3], 5) // [1, 2, 3]
-take([1, 2, 3], 0) // []
+take([1, 2, 3], 5); // [1, 2, 3]
+take([1, 2, 3], 0); // []
Returns an array with n elements removed from the end.
Use Array.slice() to create a slice of the array with n elements taken from the end.
const takeRight = (arr, n = 1) => arr.slice(arr.length - n, arr.length);
takeRight([1, 2, 3], 2) // [ 2, 3 ]
-takeRight([1, 2, 3]) // [3]
+takeRight([1, 2, 3], 2); // [ 2, 3 ]
+takeRight([1, 2, 3]); // [3]
Returns every element that exists in any of the two arrays once.
Create a Set with all values of a and b and convert to an array.
const union = (a, b) => Array.from(new Set([...a, ...b]));
union([1,2,3], [4,3,2]) // [1,2,3,4]
+union([1, 2, 3], [4, 3, 2]); // [1,2,3,4]
Filters out the elements of an array, that have one of the specified values.
@@ -692,7 +714,7 @@ takeRight([1, 2, 3]) // [3](For a snippet that mutates the original array see pull)
const without = (arr, ...args) => arr.filter(v => !args.includes(v));
without([2, 1, 2, 3], 1, 2) // [3]
+without([2, 1, 2, 3], 1, 2); // [3]
Creates an array of elements, grouped based on the position in the original arrays.
@@ -701,8 +723,8 @@ Creates an array with that length as return value and useArray.from()undefined is used where no value could be found.
const zip = (...arrays) => {
const maxLength = Math.max(...arrays.map(x => x.length));
- return Array.from({length: maxLength}).map((_, i) => {
- return Array.from({length: arrays.length}, (_, k) => arrays[k][i]);
+ return Array.from({ length: maxLength }).map((_, i) => {
+ return Array.from({ length: arrays.length }, (_, k) => arrays[k][i]);
});
};
Given an array of valid property identifiers and an array of values, return an object associating the properties to the values.
Since an object can have undefined values but not undefined property pointers, the array of properties is used to decide the structure of the resulting object using Array.reduce().
const zipObject = (props, values) => props.reduce((obj, prop, index) => (obj[prop] = values[index], obj), {});
+const zipObject = (props, values) =>
+ props.reduce((obj, prop, index) => ((obj[prop] = values[index]), obj), {});
-zipObject(['a','b','c'], [1,2]) // {a: 1, b: 2, c: undefined}
-zipObject(['a','b'], [1,2,3]) // {a: 1, b: 2}
+zipObject(['a', 'b', 'c'], [1, 2]); // {a: 1, b: 2, c: undefined}
+zipObject(['a', 'b'], [1, 2, 3]); // {a: 1, b: 2}
Converts the given array elements into <li> tags and appends them to the list of the given id.
Use Array.map() and document.querySelector() to create a list of html tags.
const arrayToHtmlList = (arr, listID) => arr.map(item => document.querySelector('#' + listID).innerHTML += `<li>${item}</li>`);
+const arrayToHtmlList = (arr, listID) =>
+ arr.map(item => (document.querySelector('#' + listID).innerHTML += `<li>${item}</li>`));
-arrayToHtmlList(['item 1', 'item 2'],'myListID')
+arrayToHtmlList(['item 1', 'item 2'], 'myListID');
Returns true if the bottom of the page is visible, false otherwise.
Use scrollY, scrollHeight and clientHeight to determine if the bottom of the page is visible.
const bottomVisible = () =>
- document.documentElement.clientHeight + window.scrollY >= (document.documentElement.scrollHeight || document.documentElement.clientHeight);
+ document.documentElement.clientHeight + window.scrollY >=
+ (document.documentElement.scrollHeight || document.documentElement.clientHeight);
bottomVisible() // true
+bottomVisible(); // true
Returns the current URL.
Use window.location.href to get current URL.
const currentURL = () => window.location.href;
currentURL() // 'https://google.com'
+currentURL(); // 'https://google.com'
Detects wether the website is being opened in a mobile device or a desktop/laptop.
Use a regular expression to test the navigator.userAgent property to figure out if the device is a mobile device or a desktop/laptop.
const detectDeviceType = () => /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent) ? 'Mobile' : 'Desktop';
+const detectDeviceType = () =>
+ /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent)
+ ? 'Mobile'
+ : 'Desktop';
-detectDeviceType() // "Mobile"
-detectDeviceType() // "Desktop"
+detectDeviceType(); // "Mobile"
+detectDeviceType(); // "Desktop"
Returns true if the element specified is visible in the viewport, false otherwise.
// e.g. 100x100 viewport and a 10x10px element at position {top: -1, left: 0, bottom: 9, right: 10}
-elementIsVisibleInViewport(el) // false // (not fully visible)
-elementIsVisibleInViewport(el, true) // true // (partially visible)
+elementIsVisibleInViewport(el); // false // (not fully visible)
+elementIsVisibleInViewport(el, true); // true // (partially visible)
Returns the scroll position of the current page.
Use pageXOffset and pageYOffset if they are defined, otherwise scrollLeft and scrollTop.
You can omit el to use a default value of window.
const getScrollPosition = (el = window) =>
- ({x: (el.pageXOffset !== undefined) ? el.pageXOffset : el.scrollLeft,
- y: (el.pageYOffset !== undefined) ? el.pageYOffset : el.scrollTop});
+const getScrollPosition = (el = window) => ({
+ x: el.pageXOffset !== undefined ? el.pageXOffset : el.scrollLeft,
+ y: el.pageYOffset !== undefined ? el.pageYOffset : el.scrollTop
+});
-getScrollPosition() // {x: 0, y: 200}
+getScrollPosition(); // {x: 0, y: 200}
Returns an object containing the parameters of the current URL.
Use match() with an appropriate regular expression to get all key-value pairs, Array.reduce() to map and combine them into a single object.
Pass location.search as the argument to apply to the current url.
const getURLParameters = url =>
- url.match(/([^?=&]+)(=([^&]*))/g).reduce(
- (a, v) => (a[v.slice(0, v.indexOf('='))] = v.slice(v.indexOf('=') + 1), a), {}
- );
+ url
+ .match(/([^?=&]+)(=([^&]*))/g)
+ .reduce((a, v) => ((a[v.slice(0, v.indexOf('='))] = v.slice(v.indexOf('=') + 1)), a), {});
getURLParameters('http://url.com/page?name=Adam&surname=Smith') // {name: 'Adam', surname: 'Smith'}
+getURLParameters('http://url.com/page?name=Adam&surname=Smith'); // {name: 'Adam', surname: 'Smith'}
Redirects the page to HTTPS if its currently in HTTP. Also, pressing the back button doesn't take it back to the HTTP page as its replaced in the history.
@@ -800,9 +829,9 @@ Passlocation.search as the argument to apply to the current
Use window.location.href or window.location.replace() to redirect to url.
Pass a second argument to simulate a link click (true - default) or an HTTP redirect (false).
const redirect = (url, asLink = true) =>
- asLink ? window.location.href = url : window.location.replace(url);
+ asLink ? (window.location.href = url) : window.location.replace(url);
-redirect('https://google.com')
+redirect('https://google.com');
Smooth-scrolls to the top of the page.
@@ -816,15 +845,16 @@ Scroll by a fraction of the distance from the top. Usewindow.requestAnima
}
};
-scrollToTop()
+scrollToTop();
Returns the difference (in days) between two dates.
Calculate the difference (in days) between two Date objects.
const getDaysDiffBetweenDates = (dateInitial, dateFinal) => (dateFinal - dateInitial) / (1000 * 3600 * 24);
+const getDaysDiffBetweenDates = (dateInitial, dateFinal) =>
+ (dateFinal - dateInitial) / (1000 * 3600 * 24);
-getDaysDiffBetweenDates(new Date("2017-12-13"), new Date("2017-12-22")) // 9
+getDaysDiffBetweenDates(new Date('2017-12-13'), new Date('2017-12-22')); // 9
Converts a JSON object to a date.
@@ -834,34 +864,53 @@ Scroll by a fraction of the distance from the top. Usewindow.requestAnima
return `${dt.getDate()}/${dt.getMonth() + 1}/${dt.getFullYear()}`;
};
-JSONToDate(/Date(1489525200000)/) // "14/3/2017"
+JSONToDate(/Date(1489525200000)/); // "14/3/2017"
Converts a date from American format to English format.
Use Date.toISOString(), split('T') and replace() to convert a date from American format to the English format.
Throws an error if the passed time cannot be converted to a date.
const toEnglishDate = (time) => { try { return new Date(time).toISOString().split('T')[0].replace(/-/g, '/'); } catch (e) {} };
+const toEnglishDate = time => {
+ try {
+ return new Date(time)
+ .toISOString()
+ .split('T')[0]
+ .replace(/-/g, '/');
+ } catch (e) {}
+};
-toEnglishDate('09/21/2010') // '21/09/2010'
+toEnglishDate('09/21/2010'); // '21/09/2010'
Results in a string representation of tomorrow's date.
Use new Date() to get today's date, adding 86400000 of seconds to it(24 hours), using toISOString to convert Date object to string.
const tomorrow = () => new Date(new Date().getTime() + 86400000).toISOString().split('T')[0];
tomorrow() // 2017-12-27 (if current date is 2017-12-26)
+tomorrow(); // 2017-12-27 (if current date is 2017-12-26)
Chains asynchronous functions.
Loop through an array of functions containing asynchronous events, calling next when each asynchronous event has completed.
const chainAsync = fns => { let curr = 0; const next = () => fns[curr++](next); next(); };
+const chainAsync = fns => {
+ let curr = 0;
+ const next = () => fns[curr++](next);
+ next();
+};
chainAsync([
- next => { console.log('0 seconds'); setTimeout(next, 1000); },
- next => { console.log('1 second'); setTimeout(next, 1000); },
- next => { console.log('2 seconds'); }
-])
+ next => {
+ console.log('0 seconds');
+ setTimeout(next, 1000);
+ },
+ next => {
+ console.log('1 second');
+ setTimeout(next, 1000);
+ },
+ next => {
+ console.log('2 seconds');
+ }
+]);
Performs right-to-left function composition.
@@ -869,10 +918,10 @@ Usenew Date() to get today's date, adding 86400000 of
The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.
const compose = (...fns) => fns.reduce((f, g) => (...args) => f(g(...args)));
const add5 = x => x + 5
-const multiply = (x, y) => x * y
-const multiplyAndAdd5 = compose(add5, multiply)
-multiplyAndAdd5(5, 2) // 15
+const add5 = x => x + 5;
+const multiply = (x, y) => x * y;
+const multiplyAndAdd5 = compose(add5, multiply);
+multiplyAndAdd5(5, 2); // 15
Curries a function.
@@ -881,27 +930,25 @@ If the number of provided arguments (args) is sufficient, call the
Otherwise, return a curried function fn that expects the rest of the arguments.
If you want to curry a function that accepts a variable number of arguments (a variadic function, e.g. Math.min()), you can optionally pass the number of arguments to the second parameter arity.
const curry = (fn, arity = fn.length, ...args) =>
- arity <= args.length
- ? fn(...args)
- : curry.bind(null, fn, arity, ...args);
+ arity <= args.length ? fn(...args) : curry.bind(null, fn, arity, ...args);
curry(Math.pow)(2)(10) // 1024
-curry(Math.min, 3)(10)(50)(2) // 2
+curry(Math.pow)(2)(10); // 1024
+curry(Math.min, 3)(10)(50)(2); // 2
Logs the name of a function.
Use console.debug() and the name property of the passed method to log the method's name to the debug channel of the console.
const functionName = fn => (console.debug(fn.name), fn);
functionName(Math.max) // max (logged in debug channel of console)
+functionName(Math.max); // max (logged in debug channel of console)
Runs an array of promises in series.
Use Array.reduce() to create a promise chain, where each promise returns the next promise when resolved.
const runPromisesInSeries = ps => ps.reduce((p, next) => p.then(next), Promise.resolve());
const delay = (d) => new Promise(r => setTimeout(r, d))
-runPromisesInSeries([() => delay(1000), () => delay(2000)]) // //executes each promise sequentially, taking a total of 3 seconds to complete
+const delay = d => new Promise(r => setTimeout(r, d));
+runPromisesInSeries([() => delay(1000), () => delay(2000)]); // //executes each promise sequentially, taking a total of 3 seconds to complete
Delays the execution of an asynchronous function.
@@ -909,7 +956,7 @@ runPromisesInSeries([() => delay(1000), () => delay(2000)]) // //executesconst sleep = ms => new Promise(resolve => setTimeout(resolve, ms));
async function sleepyWork() {
- console.log('I\'m going to sleep for 1 second.');
+ console.log("I'm going to sleep for 1 second.");
await sleep(1000);
console.log('I woke up after 1 second.');
}
@@ -920,8 +967,8 @@ runPromisesInSeries([() => delay(1000), () => delay(2000)]) // //executes
Take a predicate function and apply not to it with its arguments.
const negate = func => (...args) => !func(...args);
-filter([1, 2, 3, 4, 5, 6], negate(isEven)) // [1, 3, 5]
-negate(isOdd)(1) // false
+filter([1, 2, 3, 4, 5, 6], negate(isEven)); // [1, 3, 5]
+negate(isOdd)(1); // false
Use Array.reduce() to add each value to an accumulator, initialized with a value of 0, divide by the length of the array.
const arrayAverage = arr => arr.reduce((acc, val) => acc + val, 0) / arr.length;
arrayAverage([1,2,3]) // 2
+arrayAverage([1, 2, 3]); // 2
Returns the sum of an array of numbers.
Use Array.reduce() to add each value to an accumulator, initialized with a value of 0.
const arraySum = arr => arr.reduce((acc, val) => acc + val, 0);
arraySum([1,2,3,4]) // 10
+arraySum([1, 2, 3, 4]); // 10
Clamps num within the inclusive range specified by the boundary values a and b.
const clampNumber = (num, a, b) => Math.max(Math.min(num, Math.max(a, b)), Math.min(a, b));
clampNumber(2, 3, 5) // 3
-clampNumber(1, -1, -5) // -1
-clampNumber(3, 2, 4) // 3
+clampNumber(2, 3, 5); // 3
+clampNumber(1, -1, -5); // -1
+clampNumber(3, 2, 4); // 3
Applies the Collatz algorithm.
If n is even, return n/2. Otherwise, return 3n+1.
const collatz = n => (n % 2 == 0) ? (n / 2) : (3 * n + 1);
+const collatz = n => (n % 2 == 0 ? n / 2 : 3 * n + 1);
-collatz(8) // 4
-collatz(5) // 16
+collatz(8); // 4
+collatz(5); // 16
Converts a number to an array of digits.
Convert the number to a string, using spread operators in ES6([...string]) build an array.
Use Array.map() and parseInt() to transform each value to an integer.
const digitize = n => [...'' + n].map(i => parseInt(i));
+const digitize = n => [...('' + n)].map(i => parseInt(i));
-digitize(123) // [1, 2, 3]
+digitize(123); // [1, 2, 3]
Returns the distance between two points.
Use Math.hypot() to calculate the Euclidean distance between two points.
const distance = (x0, y0, x1, y1) => Math.hypot(x1 - x0, y1 - y0);
distance(1,1, 2,3) // 2.23606797749979
+distance(1, 1, 2, 3); // 2.23606797749979
Calculates the factorial of a number.
@@ -978,19 +1025,25 @@ Ifn is less than or equal to 1, return 1
Otherwise, return the product of n and the factorial of n - 1.
Throws an exception if n is a negative number.
const factorial = n =>
- n < 0 ? (() => { throw new TypeError('Negative numbers are not allowed!'); })()
- : n <= 1 ? 1 : n * factorial(n - 1);
+ n < 0
+ ? (() => {
+ throw new TypeError('Negative numbers are not allowed!');
+ })()
+ : n <= 1 ? 1 : n * factorial(n - 1);
factorial(6) // 720
+factorial(6); // 720
Generates an array, containing the Fibonacci sequence, up until the nth term.
Create an empty array of the specific length, initializing the first two values (0 and 1).
Use Array.reduce() to add values into the array, using the sum of the last two values, except for the first two.
const fibonacci = n =>
- Array.from({ length: n}).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []);
+ Array.from({ length: n }).reduce(
+ (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),
+ []
+ );
fibonacci(6) // 720
+fibonacci(6); // 720
Returns the number of fibonnacci numbers up to num(0 and num inclusive).
Array.reduce() to add values into the array, using the sum of t
const fibonacciCountUntilNum = num =>
Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));
fibonacciCountUntilNum(10) // 7
+fibonacciCountUntilNum(10); // 7
Generates an array, containing the Fibonacci sequence, up until the nth term.
@@ -1007,59 +1060,63 @@ UseArray.reduce() to add values into the array, using the sum of t
Uses a mathematical formula to calculate the length of the array required.
const fibonacciUntilNum = num => {
let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));
- return Array.from({ length: n}).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []);
+ return Array.from({ length: n }).reduce(
+ (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i),
+ []
+ );
};
fibonacciCountUntilNum(10) // 7
+fibonacciCountUntilNum(10); // 7
Calculates the greatest common divisor between two numbers.
Use recursion.
Base case is when y equals 0. In this case, return x.
Otherwise, return the GCD of y and the remainder of the division x/y.
const gcd = (x, y) => !y ? x : gcd(y, x % y);
+const gcd = (x, y) => (!y ? x : gcd(y, x % y));
-gcd (8, 36) // 4
+gcd(8, 36); // 4
Calculates the Hamming distance between two values.
Use XOR operator (^) to find the bit difference between the two numbers, convert to a binary string using toString(2).
Count and return the number of 1s in the string, using match(/1/g).
const hammingDistance = (num1, num2) =>
- ((num1 ^ num2).toString(2).match(/1/g) || '').length;
+const hammingDistance = (num1, num2) => ((num1 ^ num2).toString(2).match(/1/g) || '').length;
-hammingDistance(2,3) // 1
+hammingDistance(2, 3); // 1
Checks if the given number falls within the given range.
Use arithmetic comparison to check if the given number is in the specified range.
If the second parameter, end, is not specified, the range is considered to be from 0 to start.
const inRange = (n, start, end = null) => {
- if (end && start > end) end = [start, start = end][0];
- return (end == null) ? (n >= 0 && n < start) : (n >= start && n < end);
+ if (end && start > end) end = [start, (start = end)][0];
+ return end == null ? n >= 0 && n < start : n >= start && n < end;
};
inRange(3, 2, 5) // true
-inRange(3, 4) // true
-inRange(2, 3, 5) // false
-inrange(3, 2) // false
+inRange(3, 2, 5); // true
+inRange(3, 4); // true
+inRange(2, 3, 5); // false
+inrange(3, 2); // false
Checks if the given number is an Armstrong number or not.
Convert the given number into an array of digits. Use Math.pow() to get the appropriate power for each digit and sum them up. If the sum is equal to the number itself, return true otherwise false.
const isArmstrongNumber = digits =>
- (arr => arr.reduce((a, d) => a + Math.pow(parseInt(d), arr.length), 0) == digits)((digits + '').split(''));
+ (arr => arr.reduce((a, d) => a + Math.pow(parseInt(d), arr.length), 0) == digits)(
+ (digits + '').split('')
+ );
isArmstrongNumber(1634) // true
-isArmstrongNumber(371) // true
-isArmstrongNumber(56) // false
+isArmstrongNumber(1634); // true
+isArmstrongNumber(371); // true
+isArmstrongNumber(56); // false
Checks if the first numeric argument is divisible by the second one.
Use the modulo operator (%) to check if the remainder is equal to 0.
const isDivisible = (dividend, divisor) => dividend % divisor === 0;
isDivisible(6,3) // true
+isDivisible(6, 3); // true
Returns true if the given number is even, false otherwise.
true if the number is even, false if the number is odd.
const isEven = num => num % 2 === 0;
isEven(3) // false
+isEven(3); // false
Checks if the provided integer is a prime number.
@@ -1079,31 +1136,32 @@ Returnfalse if any of them divides the given number, else return <
return num >= 2;
};
-isPrime(11) // true
-isPrime(12) // false
+isPrime(11); // true
+isPrime(12); // false
Returns the least common multiple of two numbers.
Use the greatest common divisor (GCD) formula and Math.abs() to determine the least common multiple.
The GCD formula uses recursion.
const lcm = (x, y) => {
- const gcd = (x, y) => !y ? x : gcd(y, x % y);
- return Math.abs(x * y) / (gcd(x, y));
+ const gcd = (x, y) => (!y ? x : gcd(y, x % y));
+ return Math.abs(x * y) / gcd(x, y);
};
lcm(12,7) // 84
+lcm(12, 7); // 84
Returns the median of an array of numbers.
Find the middle of the array, use Array.sort() to sort the values.
Return the number at the midpoint if length is odd, otherwise the average of the two middle numbers.
const median = arr => {
- const mid = Math.floor(arr.length / 2), nums = [...arr].sort((a, b) => a - b);
+ const mid = Math.floor(arr.length / 2),
+ nums = [...arr].sort((a, b) => a - b);
return arr.length % 2 !== 0 ? nums[mid] : (nums[mid - 1] + nums[mid]) / 2;
};
median([5,6,50,1,-5]) // 5
-median([0,10,-2,7]) // 3.5
+median([5, 6, 50, 1, -5]); // 5
+median([0, 10, -2, 7]); // 3.5
Returns true if the given string is a palindrome, false otherwise.
split('') into individual characters, reverse(), join('') and compare to the original, unreversed string, after converting it tolowerCase().
const palindrome = str => {
const s = str.toLowerCase().replace(/[\W_]/g, '');
- return s === s.split('').reverse().join('');
+ return (
+ s ===
+ s
+ .split('')
+ .reverse()
+ .join('')
+ );
};
palindrome('taco cat') // true
+palindrome('taco cat'); // true
Uses the percentile formula to calculate how many numbers in the given array are less or equal to the given value.
@@ -1122,42 +1186,41 @@ Then,split('') into individual characters, reverse(),
const percentile = (arr, val) =>
100 * arr.reduce((acc, v) => acc + (v < val ? 1 : 0) + (v === val ? 0.5 : 0), 0) / arr.length;
percentile([1,2,3,4,5,6,7,8,9,10], 6) // 55
+percentile([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 6); // 55
Returns the powerset of a given array of numbers.
Use Array.reduce() combined with Array.map() to iterate over elements and combine into an array containing all combinations.
const powerset = arr =>
- arr.reduce((a, v) => a.concat(a.map(r => [v].concat(r))), [[]]);
+const powerset = arr => arr.reduce((a, v) => a.concat(a.map(r => [v].concat(r))), [[]]);
-powerset([1,2]) // [[], [1], [2], [2,1]]
+powerset([1, 2]); // [[], [1], [2], [2,1]]
Generates primes up to a given number, using the Sieve of Eratosthenes.
Generate an array from 2 to the given number. Use Array.filter() to filter out the values divisible by any number from 2 to the square root of the provided number.
const primes = num => {
- let arr = Array.from({length: num - 1}).map((x, i) => i + 2),
+ let arr = Array.from({ length: num - 1 }).map((x, i) => i + 2),
sqroot = Math.floor(Math.sqrt(num)),
- numsTillSqroot = Array.from({length: sqroot - 1}).map((x, i) => i + 2);
- numsTillSqroot.forEach(x => arr = arr.filter(y => ((y % x) !== 0) || (y == x)));
+ numsTillSqroot = Array.from({ length: sqroot - 1 }).map((x, i) => i + 2);
+ numsTillSqroot.forEach(x => (arr = arr.filter(y => y % x !== 0 || y == x)));
return arr;
};
primes(10) // [2,3,5,7]
+primes(10); // [2,3,5,7]
Returns a random integer in the specified range.
Use Math.random() to generate a random number and map it to the desired range, using Math.floor() to make it an integer.
const randomIntegerInRange = (min, max) => Math.floor(Math.random() * (max - min + 1)) + min;
randomIntegerInRange(0, 5) // 2
+randomIntegerInRange(0, 5); // 2
Returns a random number in the specified range.
Use Math.random() to generate a random value, map it to the desired range using multiplication.
const randomNumberInRange = (min, max) => Math.random() * (max - min) + min;
randomNumberInRange(2,10) // 6.0211363285087005
+randomNumberInRange(2, 10); // 6.0211363285087005
Rounds a number to a specified amount of digits.
@@ -1165,7 +1228,7 @@ Then,split('') into individual characters, reverse(),
Omit the second argument, decimals to round to an integer.
const round = (n, decimals = 0) => Number(`${Math.round(`${n}e${decimals}`)}e-${decimals}`);
round(1.005, 2) // 1.01
+round(1.005, 2); // 1.01
Returns the standard deviation of an array of numbers.
@@ -1175,13 +1238,15 @@ You can omit the second argument to get the sample standard deviation or set itconst standardDeviation = (arr, usePopulation = false) => {
const mean = arr.reduce((acc, val) => acc + val, 0) / arr.length;
return Math.sqrt(
- arr.reduce((acc, val) => acc.concat(Math.pow(val - mean, 2)), [])
- .reduce((acc, val) => acc + val, 0) / (arr.length - (usePopulation ? 0 : 1))
+ arr
+ .reduce((acc, val) => acc.concat(Math.pow(val - mean, 2)), [])
+ .reduce((acc, val) => acc + val, 0) /
+ (arr.length - (usePopulation ? 0 : 1))
);
};
standardDeviation([10,2,38,23,38,23,21]) // 13.284434142114991 (sample)
-standardDeviation([10,2,38,23,38,23,21], true) // 12.29899614287479 (population)
+standardDeviation([10, 2, 38, 23, 38, 23, 21]); // 13.284434142114991 (sample)
+standardDeviation([10, 2, 38, 23, 38, 23, 21], true); // 12.29899614287479 (population)
window.speechSynthesis.speak() to play the message.
window.speechSynthesis.speak(msg);
};
-speechSynthesis('Hello, World') // // plays the message
+speechSynthesis('Hello, World'); // // plays the message
Writes a JSON object to a file.
Use fs.writeFile(), template literals and JSON.stringify() to write a json object to a .json file.
const fs = require('fs');
-const JSONToFile = (obj, filename) => fs.writeFile(`${filename}.json`, JSON.stringify(obj, null, 2));
+const JSONToFile = (obj, filename) =>
+ fs.writeFile(`${filename}.json`, JSON.stringify(obj, null, 2));
JSONToFile({test: "is passed"}, 'testJsonFile') // writes the object to 'testJsonFile.json'
+JSONToFile({ test: 'is passed' }, 'testJsonFile'); // writes the object to 'testJsonFile.json'
Returns an array of lines from the specified file.
@@ -1212,7 +1278,11 @@ const JSONToFile = (obj, filename) => fs.writeFile(`${filename}.json`, JSON.s convert buffer to string usingtoString(encoding) function.
creating an array from contents of file by spliting file content line by line (each \n).
const fs = require('fs');
-const readFileLines = filename => fs.readFileSync(filename).toString('UTF8').split('\n');
+const readFileLines = filename =>
+ fs
+ .readFileSync(filename)
+ .toString('UTF8')
+ .split('\n');
/*
contents of test.txt :
@@ -1221,8 +1291,8 @@ contents of test.txt :
line3
___________________________
*/
-let arr = readFileLines('test.txt')
-console.log(arr) // ['line1', 'line2', 'line3']
+let arr = readFileLines('test.txt');
+console.log(arr); // ['line1', 'line2', 'line3']
childIndicator) it will search d
} else if (!keysToKeep.includes(key)) {
delete obj[key];
}
- });
+ });
return obj;
};
-const testObj = {a: 1, b: 2, children: {a: 1, b: 2}}
-cleanObj(testObj, ["a"],"children") // { a: 1, children : { a: 1}}
+const testObj = { a: 1, b: 2, children: { a: 1, b: 2 } };
+cleanObj(testObj, ['a'], 'children'); // { a: 1, children : { a: 1}}
Creates an object from the given key-value pairs.
Use Array.reduce() to create and combine key-value pairs.
const objectFromPairs = arr => arr.reduce((a, v) => (a[v[0]] = v[1], a), {});
+const objectFromPairs = arr => arr.reduce((a, v) => ((a[v[0]] = v[1]), a), {});
-objectFromPairs([['a',1],['b',2]]) // {a: 1, b: 2}
+objectFromPairs([['a', 1], ['b', 2]]); // {a: 1, b: 2}
Creates an array of key-value pair arrays from an object.
Use Object.keys() and Array.map() to iterate over the object's keys and produce an array with key-value pairs.
const objectToPairs = obj => Object.keys(obj).map(k => [k, obj[k]]);
objectToPairs({a: 1, b: 2}) // [['a',1],['b',2]])
+objectToPairs({ a: 1, b: 2 }); // [['a',1],['b',2]])
Returns a sorted array of objects ordered by properties and orders.
@@ -1272,10 +1342,14 @@ If no orders array is passed it sort by 'asc' by default. }, 0) ); -const users = [{ 'name': 'fred', 'age': 48 },{ 'name': 'barney', 'age': 36 },
- { 'name': 'fred', 'age': 40 },{ 'name': 'barney', 'age': 34 }];
-orderby(users, ['name', 'age'], ['asc', 'desc']) // [{name: 'barney', age: 36}, {name: 'barney', age: 34}, {name: 'fred', age: 48}, {name: 'fred', age: 40}]
-orderby(users, ['name', 'age']) // [{name: 'barney', age: 34}, {name: 'barney', age: 36}, {name: 'fred', age: 40}, {name: 'fred', age: 48}]
+const users = [
+ { name: 'fred', age: 48 },
+ { name: 'barney', age: 36 },
+ { name: 'fred', age: 40 },
+ { name: 'barney', age: 34 }
+];
+orderby(users, ['name', 'age'], ['asc', 'desc']); // [{name: 'barney', age: 36}, {name: 'barney', age: 34}, {name: 'fred', age: 48}, {name: 'fred', age: 40}]
+orderby(users, ['name', 'age']); // [{name: 'barney', age: 34}, {name: 'barney', age: 36}, {name: 'fred', age: 40}, {name: 'fred', age: 48}]
Retrieve a property that indicated by the selector from an object.
@@ -1283,7 +1357,7 @@ orderby(users, ['name', 'age']) // [{name: 'barney', age: 34}, {name: 'barney',const select = (from, selector) =>
selector.split('.').reduce((prev, cur) => prev && prev[cur], from);
const obj = {selector: {to: {val: 'val to select'}}};
+const obj = { selector: { to: { val: 'val to select' } } };
select(obj, 'selector.to.val'); // 'val to select'
const a = { x: true, y: 1 };
const b = shallowClone(a);
-a === b // false
+a === b; // false
Checks if the predicate (second argument) is truthy on all elements of a collection (first argument).
Use Array.every() to check if each passed object has the specified property and if it returns a truthy value.
const truthCheckCollection = (collection, pre) => (collection.every(obj => obj[pre]));
+const truthCheckCollection = (collection, pre) => collection.every(obj => obj[pre]);
-truthCheckCollection([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}], "sex") // true
+truthCheckCollection([{ user: 'Tinky-Winky', sex: 'male' }, { user: 'Dipsy', sex: 'male' }], 'sex'); // true
Array.map() to combine the letter with each partial anagram, th
Base cases are for string length equal to 2 or 1.
const anagrams = str => {
if (str.length <= 2) return str.length === 2 ? [str, str[1] + str[0]] : [str];
- return str.split('').reduce((acc, letter, i) =>
- acc.concat(anagrams(str.slice(0, i) + str.slice(i + 1)).map(val => letter + val)), []);
+ return str
+ .split('')
+ .reduce(
+ (acc, letter, i) =>
+ acc.concat(anagrams(str.slice(0, i) + str.slice(i + 1)).map(val => letter + val)),
+ []
+ );
};
anagrams('abc') // ['abc','acb','bac','bca','cab','cba']
+anagrams('abc'); // ['abc','acb','bac','bca','cab','cba']
Capitalizes the first letter of a string.
@@ -1324,42 +1403,44 @@ Omit thelowerRest parameter to keep the rest of the string intact,
const capitalize = ([first, ...rest], lowerRest = false) =>
first.toUpperCase() + (lowerRest ? rest.join('').toLowerCase() : rest.join(''));
capitalize('fooBar') // 'FooBar'
-capitalize('fooBar', true) // 'Foobar'
+capitalize('fooBar'); // 'FooBar'
+capitalize('fooBar', true); // 'Foobar'
Capitalizes the first letter of every word in a string.
Use replace() to match the first character of each word and toUpperCase() to capitalize it.
const capitalizeEveryWord = str => str.replace(/\b[a-z]/g, char => char.toUpperCase());
capitalizeEveryWord('hello world!') // 'Hello World!'
+capitalizeEveryWord('hello world!'); // 'Hello World!'
Retuns number of vowels in provided string.
Use a regular expression to count the number of vowels (A, E, I, O, U) in a string.
const countVowels = str => (str.match(/[aeiou]/ig) || []).length;
+const countVowels = str => (str.match(/[aeiou]/gi) || []).length;
-countVowels('foobar') // 3
-countVowels('gym') // 0
+countVowels('foobar'); // 3
+countVowels('gym'); // 0
Escapes a string to use in a regular expression.
Use replace() to escape special characters.
const escapeRegExp = str => str.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
escapeRegExp('(test)') // \\(test\\)
+escapeRegExp('(test)'); // \\(test\\)
Converts a string from camelcase.
Use replace() to remove underscores, hyphens, and spaces and convert words to camelcase.
Omit the second argument to use a default separator of _.
const fromCamelCase = (str, separator = '_') =>
- str.replace(/([a-z\d])([A-Z])/g, '$1' + separator + '$2')
- .replace(/([A-Z]+)([A-Z][a-z\d]+)/g, '$1' + separator + '$2').toLowerCase();
+ str
+ .replace(/([a-z\d])([A-Z])/g, '$1' + separator + '$2')
+ .replace(/([A-Z]+)([A-Z][a-z\d]+)/g, '$1' + separator + '$2')
+ .toLowerCase();
fromCamelCase('someDatabaseFieldName', ' ') // 'some database field name'
-fromCamelCase('someLabelThatNeedsToBeCamelized', '-') // 'some-label-that-needs-to-be-camelized'
-fromCamelCase('someJavascriptProperty', '_') // 'some_javascript_property'
+fromCamelCase('someDatabaseFieldName', ' '); // 'some database field name'
+fromCamelCase('someLabelThatNeedsToBeCamelized', '-'); // 'some-label-that-needs-to-be-camelized'
+fromCamelCase('someJavascriptProperty', '_'); // 'some_javascript_property'
Repeats a string n times using String.repeat()
repeatString("abc",3) // 'abcabcabc'
-repeatString("abc") // 'abcabc'
+repeatString('abc', 3); // 'abcabcabc'
+repeatString('abc'); // 'abcabc'
Reverses a string.
Use split('') and Array.reverse() to reverse the order of the characters in the string.
Combine characters to get a string using join('').
const reverseString = str => str.split('').reverse().join('');
+const reverseString = str =>
+ str
+ .split('')
+ .reverse()
+ .join('');
-reverseString('foobar') // 'raboof'
+reverseString('foobar'); // 'raboof'
Alphabetically sorts the characters in a string.
Split the string using split(''), Array.sort() utilizing localeCompare(), recombine using join('').
const sortCharactersInString = str =>
- str.split('').sort((a, b) => a.localeCompare(b)).join('');
+ str
+ .split('')
+ .sort((a, b) => a.localeCompare(b))
+ .join('');
sortCharactersInString('cabbage') // 'aabbceg'
+sortCharactersInString('cabbage'); // 'aabbceg'
Converts a string to camelcase.
Break the string into words and combine them capitalizing the first letter of each word. For more detailed explanation of this Regex, visit this Site.
const toCamelCase = str => {
- let s = str && str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
- .map(x => x.slice(0, 1).toUpperCase() + x.slice(1).toLowerCase())
- .join('');
+ let s =
+ str &&
+ str
+ .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
+ .map(x => x.slice(0, 1).toUpperCase() + x.slice(1).toLowerCase())
+ .join('');
return s.slice(0, 1).toLowerCase() + s.slice(1);
};
toCamelCase("some_database_field_name") // 'someDatabaseFieldName'
-toCamelCase("Some label that needs to be camelized") // 'someLabelThatNeedsToBeCamelized'
-toCamelCase("some-javascript-property") // 'someJavascriptProperty'
-toCamelCase("some-mixed_string with spaces_underscores-and-hyphens") // 'someMixedStringWithSpacesUnderscoresAndHyphens'
+toCamelCase('some_database_field_name'); // 'someDatabaseFieldName'
+toCamelCase('Some label that needs to be camelized'); // 'someLabelThatNeedsToBeCamelized'
+toCamelCase('some-javascript-property'); // 'someJavascriptProperty'
+toCamelCase('some-mixed_string with spaces_underscores-and-hyphens'); // 'someMixedStringWithSpacesUnderscoresAndHyphens'
Converts a string to kebab case.
Break the string into words and combine them using - as a separator.
For more detailed explanation of this Regex, visit this Site.
const toKebabCase = str =>
- str && str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
+ str &&
+ str
+ .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
.map(x => x.toLowerCase())
.join('-');
toKebabCase("camelCase") // 'camel-case'
-toKebabCase("some text") // 'some-text'
-toKebabCase("some-mixed_string With spaces_underscores-and-hyphens") // 'some-mixed-string-with-spaces-underscores-and-hyphens'
-toKebabCase("AllThe-small Things") // "all-the-small-things"
-toKebabCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML') // "i-am-listening-to-fm-while-loading-different-url-on-my-browser-and-also-editing-xml-and-html"
+toKebabCase('camelCase'); // 'camel-case'
+toKebabCase('some text'); // 'some-text'
+toKebabCase('some-mixed_string With spaces_underscores-and-hyphens'); // 'some-mixed-string-with-spaces-underscores-and-hyphens'
+toKebabCase('AllThe-small Things'); // "all-the-small-things"
+toKebabCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML'); // "i-am-listening-to-fm-while-loading-different-url-on-my-browser-and-also-editing-xml-and-html"
Converts a string to snake case.
Break the string into words and combine them using _ as a separator.
For more detailed explanation of this Regex, visit this Site.
const toSnakeCase = str => {
- str && str.match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
- .map(x => x.toLowerCase())
- .join('_');
+ str &&
+ str
+ .match(/[A-Z]{2,}(?=[A-Z][a-z]+[0-9]*|\b)|[A-Z]?[a-z]+[0-9]*|[A-Z]|[0-9]+/g)
+ .map(x => x.toLowerCase())
+ .join('_');
};
toSnakeCase("camelCase") // 'camel_case'
-toSnakeCase("some text") // 'some_text'
-toSnakeCase("some-javascript-property") // 'some_javascript_property'
-toSnakeCase("some-mixed_string With spaces_underscores-and-hyphens") // 'some_mixed_string_with_spaces_underscores_and_hyphens'
-toSnakeCase("AllThe-small Things") // "all_the_smal_things"
-toSnakeCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML') // "i_am_listening_to_fm_while_loading_different_url_on_my_browser_and_also_editing_some_xml_and_html"
+toSnakeCase('camelCase'); // 'camel_case'
+toSnakeCase('some text'); // 'some_text'
+toSnakeCase('some-javascript-property'); // 'some_javascript_property'
+toSnakeCase('some-mixed_string With spaces_underscores-and-hyphens'); // 'some_mixed_string_with_spaces_underscores_and_hyphens'
+toSnakeCase('AllThe-small Things'); // "all_the_smal_things"
+toSnakeCase('IAmListeningToFMWhileLoadingDifferentURLOnMyBrowserAndAlsoEditingSomeXMLAndHTML'); // "i_am_listening_to_fm_while_loading_different_url_on_my_browser_and_also_editing_some_xml_and_html"
Truncates a string up to a specified length.
@@ -1442,7 +1537,7 @@ Return the string truncated to the desired length, with... appende
const truncateString = (str, num) =>
str.length > num ? str.slice(0, num > 3 ? num - 3 : num) + '...' : str;
truncateString('boomerang', 7) // 'boom...'
+truncateString('boomerang', 7); // 'boom...'
Converts a given string into an array of words.
@@ -1450,8 +1545,8 @@ Return the string truncated to the desired length, with... appende
Omit the second argument to use the default regex.
const words = (str, pattern = /[^a-zA-Z-]+/) => str.split(pattern).filter(Boolean);
words("I love javaScript!!") // ["I", "love", "javaScript"]
-words("python, javaScript & coffee") // ["python", "javaScript", "coffee"]
+words('I love javaScript!!'); // ["I", "love", "javaScript"]
+words('python, javaScript & coffee'); // ["python", "javaScript", "coffee"]
Use Array.find() to return the first non null/undefined argument.
const coalesce = (...args) => args.find(_ => ![undefined, null].includes(_));
coalesce(null,undefined,"",NaN, "Waldo") // ""
+coalesce(null, undefined, '', NaN, 'Waldo'); // ""
Returns a customized coalesce function that returns the first argument that returns true from the provided argument validation function.
Use Array.find() to return the first argument that returns true from the provided argument validation function.
const coalesceFactory = valid => (...args) => args.find(valid);
const customCoalesce = coalesceFactory(_ => ![null, undefined, "", NaN].includes(_))
-customCoalesce(undefined, null, NaN, "", "Waldo") // "Waldo"
+const customCoalesce = coalesceFactory(_ => ![null, undefined, '', NaN].includes(_));
+customCoalesce(undefined, null, NaN, '', 'Waldo'); // "Waldo"
Extends a 3-digit color code to a 6-digit color code.
Use Array.map(), split() and Array.join() to join the mapped array for converting a 3-digit RGB notated hexadecimal color-code to the 6-digit form.
String.slice() is used to remove # from string start since it's added once.
const extendHex = shortHex =>
- '#' + shortHex.slice(shortHex.startsWith('#') ? 1 : 0).split('').map(x => x + x).join('');
+ '#' +
+ shortHex
+ .slice(shortHex.startsWith('#') ? 1 : 0)
+ .split('')
+ .map(x => x + x)
+ .join('');
extendHex('#03f') // '#0033ff'
-extendHex('05a') // '#0055aa'
+extendHex('#03f'); // '#0033ff'
+extendHex('05a'); // '#0055aa'
Returns the native type of a value.
@@ -1485,124 +1585,135 @@ extendHex('05a') // '#0055aa'const getType = v =>
v === undefined ? 'undefined' : v === null ? 'null' : v.constructor.name.toLowerCase();
getType(new Set([1,2,3])) // "set"
+getType(new Set([1, 2, 3])); // "set"
Converts a color code to a rgb() or rgba() string if alpha value is provided.
Use bitwise right-shift operator and mask bits with & (and) operator to convert a hexadecimal color code (with or without prefixed with #) to a string with the RGB values. If it's 3-digit color code, first convert to 6-digit version. If an alpha value is provided alongside 6-digit hex, give rgba() string in return.
const hexToRGB = hex => {
- let alpha = false, h = hex.slice(hex.startsWith('#') ? 1 : 0);
+ let alpha = false,
+ h = hex.slice(hex.startsWith('#') ? 1 : 0);
if (h.length === 3) h = [...h].map(x => x + x).join('');
else if (h.length === 8) alpha = true;
h = parseInt(h, 16);
- return 'rgb' + (alpha ? 'a' : '') + '(' +
- (h >>> (alpha ? 24 : 16)) + ', ' +
- ((h & (alpha ? 0x00ff0000 : 0x00ff00)) >>> (alpha ? 16 : 8)) + ', ' +
+ return (
+ 'rgb' +
+ (alpha ? 'a' : '') +
+ '(' +
+ (h >>> (alpha ? 24 : 16)) +
+ ', ' +
+ ((h & (alpha ? 0x00ff0000 : 0x00ff00)) >>> (alpha ? 16 : 8)) +
+ ', ' +
((h & (alpha ? 0x0000ff00 : 0x0000ff)) >>> (alpha ? 8 : 0)) +
- (alpha ? `, ${(h & 0x000000ff)}` : '') + ')';
+ (alpha ? `, ${h & 0x000000ff}` : '') +
+ ')'
+ );
};
hexToRGB('#27ae60ff') // 'rgba(39, 174, 96, 255)'
-hexToRGB('27ae60') // 'rgb(39, 174, 96)'
-hexToRGB('#fff') // 'rgb(255, 255, 255)'
+hexToRGB('#27ae60ff'); // 'rgba(39, 174, 96, 255)'
+hexToRGB('27ae60'); // 'rgb(39, 174, 96)'
+hexToRGB('#fff'); // 'rgb(255, 255, 255)'
Checks if the given argument is an array.
Use Array.isArray() to check if a value is classified as an array.
const isArray = val => !!val && Array.isArray(val);
isArray(null) // false
-isArray([1]) // true
+isArray(null); // false
+isArray([1]); // true
Checks if the given argument is a native boolean element.
Use typeof to check if a value is classified as a boolean primitive.
const isBoolean = val => typeof val === 'boolean';
isBoolean(null) // false
-isBoolean(false) // true
+isBoolean(null); // false
+isBoolean(false); // true
Checks if the given argument is a function.
Use typeof to check if a value is classified as a function primitive.
const isFunction = val => val && typeof val === 'function';
isFunction('x') // false
-isFunction(x => x) // true
+isFunction('x'); // false
+isFunction(x => x); // true
Checks if the given argument is a number.
Use typeof to check if a value is classified as a number primitive.
const isNumber = val => typeof val === 'number';
isNumber('1') // false
-isNumber(1) // true
+isNumber('1'); // false
+isNumber(1); // true
Checks if the given argument is a string.
Use typeof to check if a value is classified as a string primitive.
const isString = val => typeof val === 'string';
isString(10) // false
-isString('10') // true
+isString(10); // false
+isString('10'); // true
Checks if the given argument is a symbol.
Use typeof to check if a value is classified as a symbol primitive.
const isSymbol = val => typeof val === 'symbol';
isSymbol('x') // false
-isSymbol(Symbol('x')) // true
+isSymbol('x'); // false
+isSymbol(Symbol('x')); // true
Generates a random hexadecimal color code.
Use Math.random to generate a random 24-bit(6x4bits) hexadecimal number. Use bit shifting and then convert it to an hexadecimal String using toString(16).
const randomHexColorCode = () => {
- let n = (Math.random() * 0xfffff | 0).toString(16);
- return '#' + (n.length !== 6
- ? (Math.random() * 0xf | 0).toString(16) + n : n);
-};
+const randomHexColorCode = () => {
+ let n = ((Math.random() * 0xfffff) | 0).toString(16);
+ return '#' + (n.length !== 6 ? ((Math.random() * 0xf) | 0).toString(16) + n : n);
+};
-randomHexColorCode() // "#e34155"
-randomHexColorCode() // "#fd73a6"
-randomHexColorCode() // "#4144c6"
+randomHexColorCode(); // "#e34155"
+randomHexColorCode(); // "#fd73a6"
+randomHexColorCode(); // "#4144c6"
Converts the values of RGB components to a color code.
Convert given RGB parameters to hexadecimal string using bitwise left-shift operator (<<) and toString(16), then padStart(6,'0') to get a 6-digit hexadecimal value.
const RGBToHex = (r, g, b) => ((r << 16) + (g << 8) + b).toString(16).padStart(6, '0');
RGBToHex(255, 165, 1) // 'ffa501'
+RGBToHex(255, 165, 1); // 'ffa501'
This algorithm is a simple hash-algorithm that hashes it input string s into a whole number.
Use split('') and Array.reduce() to create a hash of the input string, utilizing bit shifting.
const sdbm = str => {
let arr = str.split('');
- return arr.reduce((hashCode, currentVal) =>
- hashCode = currentVal.charCodeAt(0) + (hashCode << 6) + (hashCode << 16) - hashCode
- ,0)
-}
+ return arr.reduce(
+ (hashCode, currentVal) =>
+ (hashCode = currentVal.charCodeAt(0) + (hashCode << 6) + (hashCode << 16) - hashCode),
+ 0
+ );
+};
console.log(sdbm("name")) // -3521204949
-console.log(sdbm("age")) // 808122783
+console.log(sdbm('name')); // -3521204949
+console.log(sdbm('age')); // 808122783
Measures the time taken by a function to execute.
Use console.time() and console.timeEnd() to measure the difference between the start and end times to determine how long the callback took to execute.
const timeTaken = callback => {
- console.time('timeTaken'); const r = callback();
- console.timeEnd('timeTaken'); return r;
+ console.time('timeTaken');
+ const r = callback();
+ console.timeEnd('timeTaken');
+ return r;
};
timeTaken(() => Math.pow(2, 10)) // 1024
+timeTaken(() => Math.pow(2, 10)); // 1024
// (logged): timeTaken: 0.02099609375ms
Use toLocaleString() to convert a float-point arithmetic to the Decimal mark form. It makes a comma separated string from a number.
const toDecimalMark = num => num.toLocaleString('en-US');
toDecimalMark(12305030388.9087) // "12,305,030,388.9087"
+toDecimalMark(12305030388.9087); // "12,305,030,388.9087"
Adds an ordinal suffix to a number.
@@ -1610,23 +1721,27 @@ console.log(sdbm("age")) // 808122783 Find which ordinal pattern digits match. If digit is found in teens pattern, use teens ordinal.const toOrdinalSuffix = num => {
- const int = parseInt(num), digits = [(int % 10), (int % 100)],
- ordinals = ['st', 'nd', 'rd', 'th'], oPattern = [1, 2, 3, 4],
+ const int = parseInt(num),
+ digits = [int % 10, int % 100],
+ ordinals = ['st', 'nd', 'rd', 'th'],
+ oPattern = [1, 2, 3, 4],
tPattern = [11, 12, 13, 14, 15, 16, 17, 18, 19];
- return oPattern.includes(digits[0]) && !tPattern.includes(digits[1]) ? int + ordinals[digits[0] - 1] : int + ordinals[3];
+ return oPattern.includes(digits[0]) && !tPattern.includes(digits[1])
+ ? int + ordinals[digits[0] - 1]
+ : int + ordinals[3];
};
toOrdinalSuffix("123") // "123rd"
+toOrdinalSuffix('123'); // "123rd"
Generates a UUID.
Use crypto API to generate a UUID, compliant with RFC4122 version 4.
const UUIDGenerator = () =>
([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, c =>
- (c ^ crypto.getRandomValues(new Uint8Array(1))[0] & 15 >> c / 4).toString(16)
+ (c ^ (crypto.getRandomValues(new Uint8Array(1))[0] & (15 >> (c / 4)))).toString(16)
);
UUIDGenerator() // '7982fcfe-5721-4632-bede-6000885be57d'
+UUIDGenerator(); // '7982fcfe-5721-4632-bede-6000885be57d'
Returns true if the given value is a number, false otherwise.
isFinite() to check if the number is finite.
Use Number() to check if the coercion holds.
const validateNumber = n => !isNaN(parseFloat(n)) && isFinite(n) && Number(n) == n;
validateNumber('10') // true
+validateNumber('10'); // true