Crate kd_interval_tree

Modules§

IntervalTreeNode: Implementation detail. Contains sub-trees, which either contain the raw intervals, or the nodes of trees at dimension k+1. Also contain the left and right nodes, which contain intervals with lower or greater values respectively for dimension k.

NodeContent: Should not be matched on. Internal representation of the tree, based on whether there are further dimensions to process.

Interval: This trait defines what our intervals are. Note that the dimension of the interval should be greater than 0. K: The dimension should be 0 for dynamically sized Point’s, and the dimension() function should then be overriden to return the proper dimension. Failure to override the method will panic at runtime.
Point: This trait has to be implemented when searching intervals containing specific values. Note that implementors of Point automatically implement Interval, meaning nothing else is required for computing Interval’s in the tree containing a given Point. K: The dimension should be 0 for dynamically sized Point’s, and the dimension() function should then be overriden to return the proper dimension. Failure to override the method will panic at runtime.
Scalar: Most scalar types should already implement these (refer to num_traits for details)