Package Exports
- @xcmats/js-toolbox
This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (@xcmats/js-toolbox) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.
Readme
js-toolbox
Various JS utilities.
$ npm install @xcmats/js-toolboxexperimenting in browser
list member functions (link):
var jsToolbox = require("@xcmats/js-toolbox") Object.keys(jsToolbox).sort()
[ "Y", "access", "asciiLetters", "asciiLowercase", "asciiUppercase", "asyncMap", "asyncReduce", "average", "bigString", "camelToPascal", "camelToSnake", "capitalize", "choose", ... ]
play with
shuffleandrange(link):jsToolbox.shuffle(jsToolbox.range(16))
[ 14, 12, 15, 8, 13, 4, 5, 6, 1, 7, 10, 0, 2, 3, 9, 11 ]
experimenting in node.js
$ git clone git@github.com:drmats/js-toolbox.git
Cloning into 'js-toolbox'...
$ cd js-toolbox
$ npm i
$ npm start
🎉 Successfully compiled 9 files with Babel.> array
{ countBy: [Function: countBy],
draw: [Function: draw],
findDuplicates: [Function: findDuplicates],
flatten: [Function: flatten],
head: [Function: head],
init: [Function: init],
last: [Function: last],
range: [Function: range],
shuffle: [Function: shuffle],
sparse: [Function: sparse],
tail: [Function: tail] }> async
{ delay: [Function: delay],
interval: [Function: interval],
map: [Function: map],
parMap: [Function: parMap],
reduce: [Function: reduce],
repeat: [Function: repeat],
timeout: [Function: timeout] }> func
{ curry: [Function: curry],
partial: [Function: partial],
Y: [Function: Y] }> math
{ average: [Function: average],
log10: [Function: log10],
log2: [Function: log2],
roundIfClose: [Function: roundIfClose],
sum: [Function: sum] }> redux
{ createReducer: [Function: createReducer] }> string
{ asciiLetters: [Function: asciiLetters],
asciiLowercase: [Function: asciiLowercase],
asciiUppercase: [Function: asciiUppercase],
big: [Function],
camelToPascal: [Function: camelToPascal],
camelToSnake: [Function: camelToSnake],
capitalize: [Function: capitalize],
digits: [Function: digits],
empty: [Function: empty],
pascalToCamel: [Function: pascalToCamel],
pascalToSnake: [Function: pascalToSnake],
quote: [Function: quote],
random: [Function: random],
snakeToCamel: [Function: snakeToCamel],
snakeToPascal: [Function: snakeToPascal],
wrap: [Function: wrap] }> type
{ isFunction: [Function: isFunction],
isNumber: [Function: isNumber],
isObject: [Function: isObject],
isString: [Function: isString],
maxInt: 9007199254740991,
minInt: -9007199254740991,
nullToUndefined: [Function: nullToUndefined],
toBool: [Function: toBool] }> utils
{ access: [Function: access],
choose: [Function: choose],
clone: [Function: clone],
dict: [Function: dict],
handleException: [Function: handleException],
identity: [Function: identity],
objectMap: [Function: objectMap],
objectReduce: [Function: objectReduce],
randomInt: [Function: randomInt],
swap: [Function: swap],
timeUnit: { ... } }examples
Find the lenghts of the words in a given sentence and count how many of them exists in each length group.
> array.countBy( ... 'exemplo plus quam ratione vivimus'.split(' '), ... (w) => w.length ... ) { '4': 2, '7': 3 }
Choose a random element from a given
array(or a random character from a givenstring).> array.draw(string.asciiLetters()) 'S'
Find duplicates in a given
array.> array.findDuplicates(['one', 'two', 'one', 'three', 'six', 'two', 'two']) [ 'one', 'two' ]
Flatten passed
array, i.e. transform[[1, 2,], ..., [3, 4,],]to[1, 2, ..., 3, 4,].> array.flatten(Object.entries({ a: 'b', c: 'd', e: 'f' })) [ 'a', 'b', 'c', 'd', 'e', 'f' ]
Return a list containing an arithmetic progression.
range(i, j)returns[i, i+1, i+2, ..., j-1]. Possible invocations are:range(stop),range(start, stop),range(start, stop, step). Whenstartis omitted it defaults to0. Whenstepis given, it specifies the increment (or decrement).> array.range(10) [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ] > array.range(-128, -256, -16) [ -128, -144, -160, -176, -192, -208, -224, -240 ]
Randomly shuffle all elements in the given
array(Durstenfeld's modification to the Fisher-Yates shuffle algorithm). The operation is taken in-place.> array.shuffle(array.range(12)) [ 9, 7, 0, 8, 2, 10, 3, 1, 11, 4, 5, 6 ]
Generate sparse array of distinct integers.
sparse(stop, size)returnsarrayofsizedistinct integers in range[0..stop-1].sparse(start, stop, size)returnsarrayofsizedistinct integers in range[start..stop-1].> array.sparse(1024, 8) [ 6, 34, 170, 422, 530, 643, 855, 862 ]
Delay current async execution by
timemiliseconds.(async () => { await async.delay() console.log('Hello ...') await async.delay() console.log('... world') })()
Invoke a sequence of asynchronous operations on an array of elements.
(async () => { let x = await async.map( array.range(10), (x) => async.timeout(() => { console.log(4*x); return 4*x; }, array.head(array.sparse(1000, 1))) ) console.log(`Result: ${x}`) })()
Paralelly execute operation on each element of the array.
(async () => { let x = await async.parMap( array.range(10), (x) => async.timeout(() => { console.log(4*x); return 4*x; }, array.head(array.sparse(1000, 1))) ) console.log(`Result: ${x}`) })()
Accumulate value over an array of elements using asynchronous operation.
(async () => { let x = await async.reduce( array.range(10), (acc, x) => async.timeout(() => { console.log(acc+x); return acc+x; }, 100*x) ) console.log(`Accumulated value: ${x}`) })()
Translate the evaluation of function
ftaking multiple arguments into an evaluation of sequence of functions, each with a single argument.> sum = (...args) => math.sum(args) [Function: sum] > func.curry(sum)(1)(2)(3)(4)(5)() 15
Y-combinator - returns fixed point of a higher-order function passed as
f. Anonymous recursion in Javascript.> factorial = func.Y((r) => (n) => n <= 0 ? 1 : n * r(n - 1)) [Function] > factorial(5) 120
Compute mathematical average of array of numbers.
> math.average([1, 2, 3, 4, 5]) 3
Base 2 logarithm.
> math.log2(2**32) 32
Base 10 logarithm.
> math.log10(1e9) 9
Sum of numbers in passed
array.> math.sum([5, 6, 7, 8, 9, 10]) 45
Allocate a big string (of size
2^n).> string.big(5) 'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx'
Convert
camelTexttosnake_text.> string.camelToSnake('someNightsIStayUpCashingInMyBadLuck') 'some_nights_i_stay_up_cashing_in_my_bad_luck'
Quote text.
> string.quote('div', '<>') '<div>'
Construct random string of desired length.
> string.random(16) 'MxWGe8MoOss0yUAP'
Convert
snake_texttocamelText.> string.snakeToCamel('some_nights_i_call_it_a_draw') 'someNightsICallItADraw'
Determine if a given value is a proper
Number(notNaNand notInfinity).> type.isNumber(NaN) false > type.isNumber(-Infinity) false > type.isNumber(1234.5678) true
Determine if a given value is an
Object(notnull, notundefinedand notArray).> type.isObject(null) false > type.isObject([]) false > type.isObject({}) true
Apply
pathto an object.> utils.access({ a: { b: { c: 42 } } }, ['a', 'b', 'c']) 42
Construct
Objectfrom the result ofObject.entries()call.entries = [[k1, v1,], ..., [kn, vn,]]> utils.dict([['a', 'b'], ['c', 'd'], ['e', 'f']]) { a: 'b', c: 'd', e: 'f' }
Shallow map (iteration) on objects.
> utils.objectMap( ... { what: 'od', i: '?rof dnats' }, ... ([k, v,]) => [ ... string.capitalize(k), ... v.split('').reverse().join('') ... ] ... ) { What: 'do', I: 'stand for?' }
Swap keys with values in a given
Object.> utils.swap({ a: 'b', c: 'd', e: 'f' }) { b: 'a', d: 'c', f: 'e' }