Given two sorted arrays, a and b, efficiently return an array of indexes of b's elements in a.
MIT License
No README available, please check again later.
Binary search for JavaScript done right.
An in memory sorted set that uses binary search on numeric indexes to find values next to each other
Get the union of two sorted streams
Maintain and search through a sorted array using some low level functions
A sparse array optimised for low memory whilst still being fast
Simple ES6 Array.prototype.findIndex polyfill for older environments.
Intersect sorted lists using merge intersection with galloping lookahead
Recursively sort the array values in an object.
Sort an object's keys, including an optional key list
Fast and efficient sorted arrays in JavaScript with binary search
Fast and iterable data structure for sorting bounded values
Sort array elements in descending order..
TimSort implementation in JS/ES.
Sort array elements in ascending order.
Get the index of the first element in an array that returns truthy for the given value, using str...