Interval binary search tree
TypeScript
53
23
MIT License
This is an interval binary search tree implementation for Node.js, providing efficient O(log n) insertion, deletion, and range queries for storing and searching intervals. It's designed for developers needing fast interval lookups, such as in scheduling systems, computational geometry, or any application requiring overlap detection between ranges.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of alexbol99/flatten-interval-tree
Runtime library for TypeScript helper functions
TypeScript definitions for chai
TypeScript definitions for mocha
TypeScript definitions for node
output coverage reports using Node.js' built in coverage
BDD/TDD assertion library for node.js and the browser. Test framework agnostic.
simple, flexible, fun test framework
Next-generation ES module bundler
TypeScript execution environment and REPL for node.js, with source map support
Create api documentation for TypeScript projects.
TypeScript is a language for application scale JavaScript development
Support the repos that depend on alexbol99/flatten-interval-tree
Top contributors
alexbol99
124 contributions
theSherwood
6 contributions
valoricDe
6 contributions
alexbol-fls
3 contributions
jeremy-rifkin
2 contributions
subdavis
1 contributions
joelrbrandt
1 contributions
leonidasv
1 contributions
Meir017
1 contributions
noomorph
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet