nano-binary-search
esm
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
Version 1.1.0 License BSD-3-Clause
Keywords
binary searchbisectbisect-leftbisect-rightlower boundupper boundsorted arrayinsertion pointequal rangeinsortsplicecomparatortypescriptzero dependencies
INSTALL