treeclimber 0.0.1

An iterator that climbs trees.
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

use std::collections::VecDeque;

use crate::IndexedClimber;

pub struct Bfs<C: IndexedClimber> {
    climber: C,
    queue: VecDeque<C::Index>,
}
pub struct BfsWithDepth<C: IndexedClimber> {
    climber: C,
    queue: VecDeque<(C::Index, usize)>,
}
impl<C: IndexedClimber> Bfs<C> {
    pub fn new(climber: C) -> Self {
        let index = climber.index();
        Self {
            climber,
            queue: VecDeque::from([index]),
        }
    }
    pub fn with_depth(self) -> BfsWithDepth<C> {
        BfsWithDepth {
            climber: self.climber,
            queue: self.queue.into_iter().map(|index| (index, 0)).collect(),
        }
    }
}
impl<C: IndexedClimber> Iterator for Bfs<C> {
    type Item = C::Item;
    fn next(&mut self) -> Option<Self::Item> {
        let index = self.queue.pop_front()?;
        let item = self.climber.go_to(&index)?;
        self.queue.extend(self.climber.child_indices());
        Some(item)
    }
}
impl<C: IndexedClimber> Iterator for BfsWithDepth<C> {
    type Item = (usize, C::Item);
    fn next(&mut self) -> Option<Self::Item> {
        let (index, depth) = self.queue.pop_front()?;
        let item = self.climber.go_to(&index)?;
        self.queue
            .extend(self.climber.child_indices().map(|index| (index, depth + 1)));
        Some((depth, item))
    }
}