gap_query_interval_tree
| Crates.io | gap_query_interval_tree |
| lib.rs | gap_query_interval_tree |
| version | 0.2.0 |
| source | src |
| created_at | 2023-06-11 17:25:13.734815 |
| updated_at | 2023-12-03 21:03:30.660277 |
| description | A crate that provides a gap-query optimized interval-tree data-structure. |
| homepage | https://github.com/ripytide/gap_query_interval_tree |
| repository | https://github.com/ripytide/gap_query_interval_tree |
| max_upload_size | |
| id | 887494 |
| size | 131,478 |
ripytide (ripytide)
documentation
https://docs.rs/gap_query_interval_tree
README
A crate that provides a gap-query optimized interval-tree data-structure.
no_std is supported and should work with the default features.
There are three main operations available on this data-structure:
insertion, removal and gap-queries. Each of which are O(log(N) + K)
where N is the total number of intervals in the tree and K is the
number of intervals required to be processed.
Here are visualizations of the three operations:
Insertion
Removal
Gap-Query
