Categories: None [Edit]

disjoint_interval_tree

https://rubygems.org/gems/disjoint_interval_tree
https://github.com/anlsys/ruby-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

Depended by

RankDownloadsName

Depends on

RankDownloadsName

Owners

#GravatarHandle
1iconrpereira-dev