A reference document that can be used in programming competitions
-
Updated
Sep 19, 2024 - TeX
A reference document that can be used in programming competitions
🌲 Persistent data structures for JavaScript
The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.
A C++ header only interval tree implementation.
Interval B+ Tree Library for C++
c++ associative containers based on the scapegoat tree
c++ associative containers based on the XOR scapegoat tree
A .NET package intended to simplify the work with sets of generic intervals.
Golang generic Interval Search Tree
Augmented Interval Tree implemented in Cython/C
Rust implementation of a fast, easy, interval tree library nim-lapper
Space partitioning algorithms in Rust
A crate that provides a gap-query optimized interval-tree data-structure.
generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.
Advanced-Data-Structures Implementation in C++
The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).
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."