Discrete Packages

Discrete event simulation with TypeScript

Simple pure Javascript implementation of the Cooley-Tukey algorithm. Note: fft-js was chosen as the name since a lot of the FFT implementations on NPM at the time this was published were wrappers for Ruby or C.

Perform a chi-square independence test.

Hypergeometric distributed pseudorandom numbers.

Create an array containing pseudorandom numbers drawn from a negative binomial distribution.

Create an array containing pseudorandom numbers drawn from a Poisson distribution.

Create an array containing pseudorandom numbers drawn from a binomial distribution.

Create an array containing pseudorandom numbers drawn from a discrete uniform distribution.

Create an array containing pseudorandom numbers drawn from a geometric distribution.

Create an array containing pseudorandom numbers drawn from a hypergeometric distribution.

Discrete uniform distributed pseudorandom numbers.

Geometric distributed pseudorandom numbers.

Bernoulli distributed pseudorandom numbers.

Create an iterator for generating pseudorandom numbers drawn from a Bernoulli distribution.

Create an iterator for generating pseudorandom numbers drawn from a binomial distribution.

Create an iterator for generating pseudorandom numbers drawn from a discrete uniform distribution.

Create an iterator for generating pseudorandom numbers drawn from a geometric distribution.

Create an array containing pseudorandom numbers drawn from a Bernoulli distribution.

Test if a value is an array of probabilities that sum to one.

Evaluate the Kronecker delta.