#rb-tree #end #interval-rbtree

interval-rbtree

An interval tree implementation using Red-Black Tree as its underlying data structure

1 unstable release

0.1.0 Feb 14, 2025

#861 in Data structures

MIT license

39KB
958 lines

interval-rbtree


An interval tree implementation using Red-Black Tree as its underlying data structure.

This crate is initially designed for storing emacs's face intervals, so you may see connections through the API.

Credit of the RB Tree's algorithms go for the infamous textbook, Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

No runtime deps