kd_interval_tree
| Crates.io | kd_interval_tree |
| lib.rs | kd_interval_tree |
| version | 0.1.1 |
| source | src |
| created_at | 2023-02-16 12:56:05.078947 |
| updated_at | 2023-02-16 13:02:51.93166 |
| description | Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups. |
| homepage | |
| repository | |
| max_upload_size | |
| id | 786734 |
| size | 24,641 |
Paul Lesur (lesurp)
documentation
README
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
- Support insertion!
- ... and deletion, mutation in general
- Make API safer: how to get the desired behavior for the dynamic case?) -> without using more than one trait...
- Make API safer: add different overload when "borrowing" is desired, or exact same type is expected.
- Real benchmarks...