#interval-tree #tree #node #algorithm #store #included

no-std store-interval-tree

A balanced unbounded interval-tree in Rust with associated values in the nodes

5 releases (3 breaking)

0.4.0 Nov 22, 2022
0.3.1 Oct 14, 2022
0.3.0 Oct 14, 2022
0.2.0 Oct 13, 2022
0.1.0 Oct 13, 2022

#2391 in Data structures

Download history 47/week @ 2024-11-17 74/week @ 2024-11-24 91/week @ 2024-12-01 84/week @ 2024-12-08 98/week @ 2024-12-15 10/week @ 2024-12-22 5/week @ 2024-12-29 17/week @ 2025-01-05 33/week @ 2025-01-12 22/week @ 2025-01-19 57/week @ 2025-01-26 28/week @ 2025-02-02 32/week @ 2025-02-09 274/week @ 2025-02-16 250/week @ 2025-02-23 204/week @ 2025-03-02

765 downloads per month

MIT/Apache

93KB
1.5K SLoC

store-interval-tree

A balanced unbounded interval-tree in Rust with associated values in the nodes.

Based on rudac and bio.

Example

use store_interval_tree::IntervalTree;
use store_interval_tree::Interval;
use std::ops::Bound::*;

let mut interval_tree = IntervalTree::<usize, bool>::new();

interval_tree.insert(Interval::new(Excluded(0), Included(1)), true);
interval_tree.insert(Interval::new(Included(0), Excluded(3)), true);
interval_tree.insert(Interval::new(Included(6), Included(10)), true);
interval_tree.insert(Interval::new(Excluded(8), Included(9)), true);
interval_tree.insert(Interval::new(Excluded(15), Excluded(23)), true);
interval_tree.insert(Interval::new(Included(16), Excluded(21)), true);
interval_tree.insert(Interval::new(Included(17), Excluded(19)), true);
interval_tree.insert(Interval::new(Excluded(19), Included(20)), true);
interval_tree.insert(Interval::new(Excluded(25), Included(30)), true);
interval_tree.insert(Interval::new(Included(26), Included(26)), true);

let interval = Interval::new(Included(8), Included(26));
let iter = interval_tree.query_mut(&interval);

for mut entry in iter {
    *entry.value() = false;
}

Dependencies

~465KB