A generic interval tree implementation in C#
-
Updated
May 3, 2021 - C#
A generic interval tree implementation in C#
The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.
A C++ header only interval tree implementation.
Golang generic Interval Search Tree
Data Structures and Algorithms
Rust implementation of a fast, easy, interval tree library nim-lapper
A red-black self-balancing interval tree
python3 implementation of trees. Including AVL Tree, Interval Tree and More.
Very fast static, flat Interval Tree for Go
An interval tree library interpretation based on augmented AVL balanced binary trees.
Space partitioning algorithms in Rust
Trace intervals between genomes using a synteny map
A reference document that can be used in programming competitions
A python library for constructing interval trees with associated exon/annotation information
Add a description, image, and links to the interval-tree topic page so that developers can more easily learn about it.
To associate your repository with the interval-tree topic, visit your repo's landing page and select "manage topics."