Library to enumerate all natural number lists with a target sum.
Cartesian product for big inputs
Fast cartesian product
Generate an array full of object copies, each containing a unique Boolean value combination. Includes overrides.
A minimalistic es6 implementation of set
Generate all words up to four letters super fast
Generates all the permutations of sentences from words in a 2D array.
Produce all the 21 possible combinations of texas hold'em cards
generate multiset combinations using an efficient loopless algorithm
returns a list of all possible combinations / permutations of an array of items
Given n arrays, iterate over all possible combinations of values by taking a single value from each array.
Easily create a combination of strings
Generates all possible combinations for a set of possible attributes and values
Possible combinations of input
Streams all the variations (with repetitions) of a set
get all combinations
To find all the possible combinations of an array
A function to get the unique item combinations from an array
An implementation of the Johnson-Trotter permutation algorithm.