kd_interval_tree 0.1.1

Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.

mod interval_tree;
pub mod iter;
#[cfg(test)]
mod tests;
pub use crate::interval_tree::*;