Categories: None [Edit]
disjoint_interval_tree
A set of pairwise disjoint half-open intervals [a..b[, backed by an
augmented AVL tree written in C. Insertion, point lookup, intersection
queries and range removal are all logarithmic. Each node caches the hull of
the subtree it roots, so intersection queries prune whole subtrees in O(1).
Total
Ranking: 164,999 of 198,650
Downloads: 3,425
Daily
Ranking: 20,244 of 198,575
Downloads: 12
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
| Rank | Downloads | Name |
|---|
Depends on
| Rank | Downloads | Name |
|---|
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | rpereira-dev |