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

use crate::prelude::Path;

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

pub struct Absolute<I, B> {
    iter: I,
    path: Path<B>,
}

impl<I, B> Absolute<I, B>
where
    I: Iterator,
{
    pub fn new(iter: I) -> Absolute<I, B> {
        Absolute {
            iter,
            path: Path::new(),
        }
    }
}

impl<N, I, B> Iterator for Absolute<I, B>
where
    I: Iterator<Item = Traversal<N, B>>,
    B: Clone,
{
    //TODO: No clone: &'a Path<B>
    type Item = TraversalNode<N, B>;

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(item) = self.iter.next() {
            Some(match item {
                Traversal::Start(data) => TraversalNode {
                    path: Path::new(),
                    data,
                },
                Traversal::Step { up, branch, data } => {
                    (0..up).for_each(|_| {
                        self.path.pop_last();
                    });
                    self.path.push_last(branch.clone());
                    TraversalNode {
                        path: self.path.clone(),
                        data,
                    }
                }
            })
        } else {
            None
        }
    }
}