stdlib-js/math-base-assert-is-integ...

Round a double-precision floating-point number toward negative infinity.

Load a manifest for compiling source files.

Test if a value is a boolean.

Boolean constructor.

Double-precision floating-point negative infinity.

Double-precision floating-point positive infinity.

Round a double-precision floating-point number toward zero.

Uniformly distributed pseudorandom numbers between 0 and 1.

Wrap `require` in a try/catch block.

tap-producing test harness for node and browsers

Yet another JS code coverage tool that computes statement, line, function and branch coverage with module loader hooks to transparently add coverage when running tests. Supports all JS coverage use cases including unit tests, server side functional tests and browser tests. Built for scale

Minimal TAP output formatter.

Benchmark harness.

Evaluate a normalized Hermite polynomial using single-precision floating-point arithmetic.

Compute the tangent of an angle measured in degrees

Compute the cotangent of an angle measured in degrees

Compute the cosine of an angle measured in degrees.

Evaluate the double factorial.

Multidimensional arrays.

Complex128Array.

Complex64Array.

Discrete uniform distributed pseudorandom numbers.

Determine the minimum ndarray data type of the closest kind necessary for storing a provided scalar value.

Base mathematical assertion utilities.

Compute the rising factorial.

Compute the falling factorial.

Compute the natural logarithm of the binomial coefficient.

Evaluate a factorial.

Riemann Zeta function.

Gamma function.

Discrete uniform distribution moment-generating function (MGF).

Evaluate a physicist's Hermite polynomial.

Discrete uniform distribution excess kurtosis.

Discrete uniform distribution standard deviation.

Discrete uniform distribution variance.

Exponential function.

Compute the Fibonacci number index.

Compute the nth non-Fibonacci number.

Discrete uniform distribution entropy.

Natural logarithm of the cumulative distribution function (CDF)for a discrete uniform distribution.

Natural logarithm of the probability mass function (PMF) for a discrete uniform distribution.

Compute the nth negaFibonacci number.

Compute the nth negaLucas number.

Determine the minimum array data type of the closest kind necessary for storing a provided scalar value.

Test if a value is an arguments object.

Compute the binomial coefficient.

Compute the nth Fibonacci number.

Compute the greatest common divisor (gcd).

Compute the nth Lucas number.