interavl 0.6.0

An optimised interval tree for efficient interval stabbing
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

use crate::node::Node;
use alloc::vec::Vec;

#[derive(Debug)]
pub(crate) struct RefIter<'a, R, V> {
    stack: Vec<&'a Node<R, V>>,
}

impl<'a, R, V> RefIter<'a, R, V> {
    pub(crate) fn new(root: &'a Node<R, V>) -> Self {
        let mut this = Self { stack: vec![] };

        // Descend down the left side of the tree.
        this.push_subtree(root);

        this
    }

    fn push_subtree(&mut self, subtree_root: &'a Node<R, V>) {
        let mut ptr = Some(subtree_root);

        while let Some(v) = ptr {
            self.stack.push(v);
            ptr = v.left();
        }
    }
}

impl<'a, R, V> Iterator for RefIter<'a, R, V> {
    type Item = &'a Node<R, V>;

    fn next(&mut self) -> Option<Self::Item> {
        let v = self.stack.pop()?;

        // Descend down the left side of the right hand child of this node, if
        // any.
        if let Some(right) = v.right() {
            self.push_subtree(right);
        }

        Some(v)
    }
}