nb-tree 0.2.0-alpha01

Very simple tree structure with generic node and branch data.
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

use crate::prelude::{Entry, Path, Tree};

use super::{depth::Traversal, TraversalNode};

pub struct Combine<I, R, N, B, const BOUND: bool>
where
    R: Deref<Target = Tree<N, B>>,
{
    iter: I,
    other: Entry<R, N, B, BOUND>,
}

impl<I, R, N, B, const BOUND: bool> Combine<I, R, N, B, BOUND>
where
    I: Iterator,
    R: Deref<Target = Tree<N, B>>,
{
    pub fn new(iter: I, other: Entry<R, N, B, BOUND>) -> Combine<I, R, N, B, BOUND> {
        Combine { iter, other }
    }
}

impl<I, NI, R, N, B, const BOUND: bool> Iterator for Combine<I, R, N, B, BOUND>
where
    I: Iterator<Item = Traversal<NI, B>>,
    R: Deref<Target = Tree<N, B>>,
    B: Clone,
{
    type Item = TraversalNode<(Option<N1>, Option<N2>), B>;

    fn next(&mut self) -> Option<Self::Item> {
        //…
        todo!();
        //…
        if let Some(last) = self.children.last_mut() {
            // Iterate on a child (not the root)
            if let Some((branch, node_idx)) = last.next() {
                // Go down to a child
                let node = &self.tree.nodes[*node_idx];
                self.children.push(node.children.iter());
                //self.path.push_leaf(branch.clone());
                Some(Traversal::Step {
                    up: std::mem::replace(&mut self.up, 0),
                    branch,
                    data: T::target(self.tree, *node_idx),
                })
                //Some((self.path.clone(), &node.value))
            } else {
                // Move back up to the parent
                self.children.pop();
                //self.path.pop_leaf();
                self.up += 1;
                self.next()
            }
        } else if let Some(root) = self.root.take() {
            let node = &self.tree.nodes[root];
            self.children.push(node.children.iter());
            Some(Traversal::Start(T::target(self.tree, root)))
        } else {
            None
        }
    }
}