Search results

8 packages found

Binary search -based indexOf for sorted arrays.

published version 1.0.2, 5 years ago1 dependents licensed under $MIT
17

Binary search -based indexOf for sorted arrays.

published version 1.0.2, 5 years ago3 dependents licensed under $MIT
13

Find all indexes at which an array element exists, by binary search.

published version 1.0.1, 5 years ago1 dependents licensed under $MIT
12

Create array comparator function.

published version 1.0.5, 5 years ago7 dependents licensed under $MIT
14

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

published version 1.0.4, 5 years ago1 dependents licensed under $MIT
12

Remove all duplicate elements in a sorted array, leaving only uniques.

published version 1.0.1, 5 years ago1 dependents licensed under $MIT
11

Find the array index of where to add an element to keep it sorted.

published version 3.0.2, 5 years ago1 dependents licensed under $MIT
9

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

published version 1.0.2, 5 years ago1 dependents licensed under $MIT
9