Search results
74 packages found
Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements, with and without replacement.
- geco
- combinations
- combinations with repetition
- k-combinations
- multiset
- compositions
- compositions with restricted parts
- colex
- colexicographic order
- CAT
- combinatorics
- generators
- poker
Hypergeometric distribution quantile function.
- stdlib
- stdmath
- statistics
- stats
- distribution
- dist
- probability
- combinatorics
- cdf
- inverse
- hypergeometric
- univariate
- discrete
Create an iterator which evaluates the natural logarithm of the factorial function for each iterated value.
- stdlib
- stdmath
- math
- special functions
- special
- function
- factorial
- log-scale
- logarithm
- fact
- lfact
- factorialln
- combinatorics
- gamma
- View more
Create an iterator which generates a sequence of factorials.
- stdlib
- stdmath
- mathematics
- math
- factorial
- fact
- combinatorics
- integer
- int
- number
- sequence
- iterator
- iterate
- iteration
Create an iterator which evaluates the factorial function for each iterated value.
- stdlib
- stdmath
- math
- special functions
- special
- function
- factorial
- fact
- combinatorics
- gamma
- iterator
- iterable
- iterate
Evaluate the double factorial.
- stdlib
- stdmath
- mathematics
- math
- special functions
- special
- function
- factorial
- fact
- dfact
- factorial2
- combinatorics
- double
- number
Shuffle elements of an array-like object.
Catalan's constant.
Creates function generators that can create every combination of items. also unique combinations
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.
- algorithm
- benchmarking
- combinatorics
- efficient
- equally
- finite
- fisher
- fixtures
- knuth
- letters
- permutation
- random
- randomly
- randomize
- View more
Brando, is a module to handle pseudo-random sequences/permutations of integers using Buffers.
- brando
- random
- pseudo-random
- random buffers
- randomness
- randomize
- shuffle
- Fisher Yates
- sequences
- permutations
- full permutations
- partial permutations
- combinatorics
- stream
- View more
Combinatorics.js is a standalone math library for Javascript and Node.js. It features a solution to work with Permutations, Posets, Trees, and other enumerative collections.
Calculate the number of possible permutations.
Calculates all possible combinations without repetition of a certain size.
Gives back the result of the type of combinatoric given.
Computes a factorial.
- compute.io
- compute-io
- compute
- computation
- mathematics
- math.io
- math-io
- math
- special functions
- special
- function
- factorial
- fact
- combinatorics
- View more
Calculates the Cartesian product between multiple collections.
Catalan's constant.
- const-io
- const.io
- constant
- const
- compute.io
- compute
- computation
- math
- mathematics
- catalan
- combinatorics
- polygamma
- trigamma
- c
- View more