@tanasorn/first.create
cloning object or array
cloning object or array
A small library that takes an array as input and returns a new array that is shuffled.
Array subclasses that remain continuously sorted on insert() or push() calls, featuring optimized includes() and indexOf()
Determine if value is an array.
[Deprecated] JST to perform set intersection and set subtraction operations on 2 user provided arrays
[Deprecated] JST that converts strings & strings within objects to numbers
[Deprecated] Allows you to separate an array of objects into matching and non matching items by providing a key and a value to match on.
Iterable to Array for JavaScript
Calculate the variance of a single-precision floating-point strided array ignoring NaN values and using a one-pass trial mean algorithm.
Calculate the variance of a single-precision floating-point strided array ignoring NaN values and using a two-pass algorithm.
Calculate the variance of a single-precision floating-point strided array ignoring NaN values and using a one-pass textbook algorithm.
Calculate the variance of a single-precision floating-point strided array ignoring NaN values and using Welford's algorithm.
Calculate the variance of a single-precision floating-point strided array ignoring NaN values and using a one-pass algorithm proposed by Youngs and Cramer.
Calculate the range of a single-precision floating-point strided array.
Calculate the standard deviation of a single-precision floating-point strided array.
Calculate the standard deviation of a single-precision floating-point strided array using a one-pass trial mean algorithm.
Calculate the standard deviation of a single-precision floating-point strided array using a two-pass algorithm.
Calculate the standard deviation of a single-precision floating-point strided array using a one-pass textbook algorithm.
Calculate the standard deviation of a single-precision floating-point strided array using Welford's algorithm.
Calculate the standard deviation of a single-precision floating-point strided array using a one-pass algorithm proposed by Youngs and Cramer.