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.
Documentation
  • Feature flags
  • This release does not have any feature flags.

kd_interval_tree

There is very little structured metadata to build this page from currently. You should check the main library docs, readme, or Cargo.toml in case the author documented the features in them.

This release does not have any feature flags.