nano-binary-search

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

v1.2.0 BSD-3-Clause 17 versions Maintained by elazutkin

• binary search
• bisect
• bisect-left
• bisect-right
• lower bound
• upper bound
• sorted array
• insertion point
• equal range
• insort
• splice
• comparator