A high-performance pure Ruby Red-Black Tree implementation. Features: O(1) key lookup via hybrid hash index, O(log n) insert/delete, lazy Enumerator-based range queries (lt/gt/between), nearest/prev/succ search, memory-efficient node pooling, and MultiRBTree for duplicate keys with first/last value access.
Required Ruby Version
>= 3.0.0
Authors
Masahito Suzuki
Versions
- 0.3.6 January 28, 2026 (33 KB)
- 0.3.5 January 26, 2026 (30 KB)
- 0.3.4 January 25, 2026 (29 KB)
- 0.3.3 January 23, 2026 (28.5 KB)
- 0.3.2 January 15, 2026 (27.5 KB)
