1 unstable release
| new 0.1.0 | Feb 14, 2025 |
|---|
#887 in Data structures
109 downloads per month
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.