Combinatorics Packages

Efficient Combinatorics library for JavaScript using ES2015 generator functions. Generate power set, combination, and permutation.

Shuffle the words in a string and optionally the letters in each word using the Fisher-Yates algorithm. Useful for creating test fixtures, benchmarking samples, etc.

Calculates the Cartesian product between multiple collections.

Calculates all possible combinations without repetition of a certain size.

Fast cartesian product

Cartesian product for big inputs

Type safe combinatorics utility for getting all combinations.

Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements, with and without replacement.

Shuffles array elements in place.

Visit all k combinations of an array in lexicographic order

A simple combinatorial iterator, supporting a stream of combinations.

A module that helps generate not random id's, shorten user names, etc.

A simple permutations and combinatorics library for JavaScript

Removes all spaces from a string

Calculates all possible multicombinations of a certain size.

Calculates all possible permutations of a certain size.

Calculates all possible multipermutations of a certain size.

generate multiset combinations using an efficient loopless algorithm

Combinations generator (combinatorics) Generates all possible combinations of (n/k) k elements from n elements with no repetitions. Iterate or display combinations.

Brando, is a module to handle pseudo-random sequences/permutations of integers using Buffers.