[comparedescending=false] Packages

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.

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

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.