Randomly permutate an array from an optinal seed, generating set of arrays that similar to the seed array
generates permutation of elements in an array
Array manipulation, ordering, searching, summarizing, etc.
A simple list of possible Typed Array names.
Which kind of Typed Array is this JavaScript value? Works cross-realm, without `instanceof`, and despite Symbol.toStringTag.
Is this value a JS ArrayBuffer?
Get the byte length of an ArrayBuffer, even in engines without a `.byteLength` method.
An ES7/ES2016 spec-compliant `Array.prototype.includes` shim/polyfill/replacement that works as far down as ES3.
Robustly get the length of a Typed Array
Robustly get the byte offset of a Typed Array
Is this value a JS SharedArrayBuffer?
`Array.prototype.concat`, but made safe by ignoring Symbol.isConcatSpreadable
Robustly get the byte length of a Typed Array
Get the ArrayBuffer out of a TypedArray, robustly.
Is this value a JS Typed Array? This module works cross-realm/iframe, does not depend on `instanceof` or mutable properties, and despite ES6 Symbol.toStringTag.
General purpose glob-based configuration matching.
Parse postgres array columns
Run an array of functions in parallel
Flatten nested arrays
TypeScript definitions for d3-array
Guarantees an array back
Create an array of unique values, in order, from the input arrays
Matches strings against configurable strings, globs, regular expressions, and/or functions
Workaround a Safari bug where rest destructuring with an array literal on the rhs can yield incorrect results
Adds `Array#unique_permutation` method.
Permutations is a library that allows you to generate permutations from Arrays and Strings.
Generates an array of permutations without duplicates using a tree
Generates permutations and returns an array, or prints to csv, or prints to console. See https://github.com/andydwyer/brutalitops for usage.
Library to perform different operations with permutations of sequences (strings, arrays, etc.)
Reproduction methods for genetic (and other iterative improvement) algorithms, being used to solve permutation problems, where permutations are arrays of unique objects. github: https://github.com/edwardchalstrey1/pmeth
BLAKE is a cryptographic hash function based on Dan Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants, is added before each ChaCha round. Like SHA-2, there are two variants differing in the word size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16 message words, truncating the ChaCha result to obtain the next hash value. BLAKE-256 and BLAKE-224 use 32-bit words and produce digest sizes of 256 bits and 224 bits, respectively, while BLAKE-512 and BLAKE-384 use 64-bit words and produce digest sizes of 512 bits and 384 bits, respectively.
BLAKE is a cryptographic hash function based on Dan Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants, is added before each ChaCha round. Like SHA-2, there are two variants differing in the word size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16 message words, truncating the ChaCha result to obtain the next hash value. BLAKE-256 and BLAKE-224 use 32-bit words and produce digest sizes of 256 bits and 224 bits, respectively, while BLAKE-512 and BLAKE-384 use 64-bit words and produce digest sizes of 512 bits and 384 bits, respectively.