Tiny, zero-dependency binary search and sorted-array operations (indexOf, includes, insert, remove) for JavaScript and TypeScript. Every result is a valid Array.splice() index — no bounds checks, no off-by-one. Equivalent to std::lower_bound / bisect_left.
typescript splice bisect binary-search insort comparator sorted-array lower-bound upper-bound zero-dependencies bisect-left bisect-right insertion-point equal-range
-
Updated
Aug 21, 2026 - JavaScript