A self-balancing binary search tree for mapping discrete, disjoint segments to values.
-
Updated
Aug 23, 2020 - Rust
A self-balancing binary search tree for mapping discrete, disjoint segments to values.
Add a description, image, and links to the interval-map topic page so that developers can more easily learn about it.
To associate your repository with the interval-map topic, visit your repo's landing page and select "manage topics."