Expand description
According to Wikipedia:
An interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point.
Structs§
- Inorder
Iterator - Interval
- Structure to represent an interval.
- Interval
Tree - An Interval Tree.
- Interval
Tree Entry
Traits§
- Interval
Type - A marker trait for interval types. Default implemented for standard integral and floating-point types.