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
  • Coverage
  • 65.38%
    17 out of 26 items documented0 out of 2 items with examples
  • Size
  • Source code size: 42.08 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 4 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 14s Average build duration of successful builds.
  • all releases: 14s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • lesurp

K-dimensional Interval Tree

This crates implements a K-dimensional interval tree, based on a binary search (with the same complexity w.r.t operations).

Features

  • Creation of the tree from a Vec
  • Overlap / inclusion test
  • Overlapping intervals retrieval
  • Overlapping volume computation

~~ That's all folks ~~

TODOs

  1. Support insertion!
  2. ... and deletion, mutation in general
  3. Make API safer: how to get the desired behavior for the dynamic case?) -> without using more than one trait...
  4. Make API safer: add different overload when "borrowing" is desired, or exact same type is expected.
  5. Real benchmarks...