Crate store_interval_tree
source · [−]Structs
A
find query on the interval tree does not directly return references to the nodes in the tree, but
wraps the fields interval and data in an Entry.A
find_mut query on the interval tree does not directly return references to the nodes in the tree, but
wraps the fields interval and data in an EntryMut. Only the data part can be mutably accessed
using the data methodA utility data structure to represent intervals.
It supports open, close and unbounded intervals
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.
An
IntervalTreeIterator is returned by Intervaltree::find and iterates over the entries
overlapping the queryAn
IntervalTreeIteratorMut is returned by Intervaltree::find_mut and iterates over the entries
overlapping the query allowing mutable access to the data D, not the Interval.