add
A cross-browser, numerically stable algorithm to add floats accurately
A cross-browser, numerically stable algorithm to add floats accurately
Solve equations using numerical methods
Sorts array of objects by the value of a particular property
Compare (Big Endian) Buffers numerically
Linear álgebra and solver of linear equation system
Solve equations using numerical methods, linear álgebra of matrices and solve linear equation system
Sort an array considerably faster than the native Array.prototype.sort as a drop-in replacement. Fork of of the famous timsort module, but this module allows for passing comparator-builder options instead of a comparator function. In short, advanced compa
Create array comparator function.
For a sorted array, add an element. Whichever comparator function was used to sort the array, can be passed. Also supports comparator-builder options. For reference, see: https://github.com/bemoje/bemoje-arr-sort-comparator
Binary search -based indexOf for sorted arrays.
Binary search -based indexOf for sorted arrays.
Find all indexes at which an array element exists, by binary search.
Find the array index of where to add an element to keep it sorted.
Remove all duplicate elements in a sorted array, leaving only uniques.
Sorts array of objects by the value of a particular property