@stdlib/math-iter-sequences-triangular
Create an iterator which generates a sequence of triangular numbers.
Create an iterator which generates a sequence of triangular numbers.
Create an iterator which generates a nonnegative integer sequence.
Create an iterator which generates a sequence of nonpositive even integers.
Test if a value is a number having a positive integer value.
Test if a value is an array-like object containing only positive integers.
Test if a value is a prime number.
Test if a value is a composite number.
Return an unsigned 32-bit integer corresponding to the IEEE 754 binary representation of a single-precision floating-point number.
Convert a signed 64-bit integer byte array to a double-precision floating-point number.
Convert a double-precision floating-point number to a signed 32-bit integer.
Convert a double-precision floating-point number to an unsigned 32-bit integer.
Utilities for signed 32-bit integers.
Convert a signed 32-bit integer to an unsigned 32-bit integer.
Utilities for unsigned 16-bit integers.
Base utilities for unsigned 16-bit integers.
Convert an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order.
Base utilities for signed 32-bit integers.
A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer
Easy way to deal with decimals
A robust utility function for validating if two numbers are strictly equal, with robust error handling for non-integer inputs.