This crates implements map and set with interval keys (ranges
IntervalMap is implemented using red-black binary tree, where each node contains
information about the smallest start and largest end in its subtree.
The tree takes O(N) space and allows insertion in O(log N).
IntervalMap allows to search for all entries overlapping a query (interval or a point,
output would be sorted by keys). Search takes O(log N + K) where K is the size of the output.
Additionally, you can extract smallest/largest interval with its value in O(log N).
This crate allows to write interval maps and sets to .dot files
You can disable this feature using
cargo build --no-default-features,
in that case the crate supports
Since version 0.0.5, this crate supports serialization/deserialization (use optional feature
Module with various iterators over
Macros for IntervalMap creation.
Macros for IntervalSet creation.
Map with interval keys (ranges
Set with interval keys (ranges
Default index type.