nonoverlapping_interval_tree
| Crates.io | nonoverlapping_interval_tree |
| lib.rs | nonoverlapping_interval_tree |
| version | 0.1.6 |
| created_at | 2022-01-08 02:07:30.51232+00 |
| updated_at | 2025-08-11 21:17:30.829459+00 |
| description | Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate). |
| homepage | https://github.com/dbittman/non-overlapping-interval-tree.git |
| repository | https://github.com/dbittman/non-overlapping-interval-tree.git |
| max_upload_size | |
| id | 510038 |
| size | 21,494 |
Daniel Bittman (dbittman)
documentation
https://docs.rs/nonoverlapping_interval_tree
README
Non-overlapping Interval Tree
Simple library for a map data structure that contains elements keyed on ranges, whose keys cannot overlap. Lookup queries can lookup a specific point in a range, and get back the value for that range.
Docs: docs.rs
This library supports no_std (but requires core and the alloc crate). To enable no_std, disable default features.