NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
- Updated
- C
#
interval-tree
Here are 80 public repositories matching this topic...
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
data-structure cpp14 red-black-tree interval-tree segment-tree search-trees interval-set interval-map zip-tree weight-balanced-tree
- Updated
- C++
Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.
java time data-structure timeseries time-series container series bucket index timeinterval interval-tree interval time-interval index-structure time-utils temporal-data intervaltree temporaldata time-driven
- Updated
- Java
A C++ header only interval tree implementation.
- Updated
- C++
Rust implementation of a fast, easy, interval tree library nim-lapper
- Updated
- Rust
Fast interval intersection library
- Updated
- C++
A red-black self-balancing interval tree
segment cplusplus cpp cpp11 header-only red-black-tree balanced-tree interval-tree segments interval self-balancing-trees segmenttree intervals redblacktree segment-tree balanced-trees redblacktrees cplusplus-11 red-black-trees intervaltree
- Updated
- C++
The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).
- Updated
- C
Data Structure & Algorithms notes - comes in handy if you are currently taking a Data Structures and Algorithms course
sorting computer-vision avl-tree graph cuda sorting-algorithms convolution interval-tree sorting-algorithms-implemented sort-algorithms redblacktree dsa bplustree clrs-algorithhms dsa-learning-series
- Updated
- Python
Augmented Interval Tree implemented in Cython/C
- Updated
- C
Implementation of self balancing binary search tree data structure called Red-Black Tree. Based on interval tree described in "Introduction to Algorithms 3rd Edition", published by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
- Updated
- PHP
Advance algorithm implementations
markov-chain kmp-algorithm interval-tree number-theory tarjan-algorithm segment-tree kosaraju max-flow suffix-array hopcroft-karp fenwick-tree z-algorithm edmonds-karp-algorithm square-root-decomposition blossom-algorithm sparse-table heavy-light-decomposition mo-algorithm hierholzer manacher-s-algorithm
- Updated
- C++
Data Structures and Algorithms
c avl-tree queue algorithms datastructures graph-algorithms bit sorting-algorithms heap interval-tree trees stacks segment-tree union-find advanced-data-structures
- Updated
- C
BST, Red-Black-Tree & Interval Tree in Golang
- Updated
- Go
C++ implementations of real time dynamic planar convex hull construction algorithms.
c-plus-plus library algorithms cpp convex-hull interval-tree huffman-tree segment-tree template-library convex-hull-algorithms treaps cpp20 c-plus-plus-20 treap convex-hull-trick convex-hull-algorithm segment-trees interval-trees treap-data-structure dynamic-convex-hull
- Updated
- C++
🌲 Improved Interval B+ tree implementation, in TS 🌲 https://edgaracarneiro.github.io/I2Bplus-tree/
- Updated
- TypeScript
Improve this page
Add a description, image, and links to the interval-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the interval-tree topic, visit your repo's landing page and select "manage topics."