interval-rbtree 0.1.0

An interval tree implementation using Red-Black Tree as its underlying data structure.
Documentation
  • Coverage
  • 32.73%
    18 out of 55 items documented0 out of 45 items with examples
  • Size
  • Source code size: 38.66 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 6.39 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 11s Average build duration of successful builds.
  • all releases: 11s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • dwuggh

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.