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).

Required Ruby Version

>= 2.7.0

Authors

Romain PEREIRA

Versions

  1. 0.2.0

    1. source

      1. 0.2.0 source September 21, 2026 (43 KB)
  2. 0.1.0

    1. source

      1. 0.1.0 source September 21, 2026 (35.5 KB)

Pushed by

rpereira-dev

SHA 256 checksum

← Previous version