Combinations Packages

generates all combinations (or non-unique permutations) of a given list of characters within a range of string length i.e. generate(['a','f','t','6','-','@','T',';'], 2, 4)

Library to enumerate all natural number lists with a target sum.

Generates all possible combinations for a set of possible attributes and values

Get all possibilities taking one value for each key ( from an array of values for that key )

Generate random combinations from pre-defined character sets

Implementing of discrete vectors

detect key combinations

get all combinations

An implementation of the Johnson-Trotter permutation algorithm.

Helper methods for stats, combinatorics, permutations, probabilities and matricies

Calculate the number of possible permutations.

Generate an array of all possible combinations of letters in a given string

Produce all the 21 possible combinations of texas hold'em cards

Tools for combinatorics

To find all the possible combinations of an array

Module for getting all possible combinations of values from given 'n' arraysnumber of arrays

combinations array

List all the combinations

A javascript implementation of the de Bruijn sequence algorithm

A JavaScript implementation of Heap's efficient Permutation Algorithm