xtree 0.1.8

A simple general purpose tree data structure.
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::Tree;

/// The immutable iterator over all the children
pub struct ChildrenIter<'a,T>{
    pub (in crate) raw_iter : std::slice::Iter<'a, Tree<T>>
}

impl<'a,T> Iterator for ChildrenIter<'a,T>{
    type Item = &'a T;

    fn next(&mut self) -> Option<Self::Item> {
        self.raw_iter.next().map(|v| &v.data)
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        self.raw_iter.size_hint()
    }

    fn count(self) -> usize where
        Self: Sized, {
        self.raw_iter.count()
    }

    fn last(self) -> Option<Self::Item> where
        Self: Sized, {
        self.raw_iter.last().map(|v| &v.data)
    }

    fn nth(&mut self, n: usize) -> Option<Self::Item> {
        self.raw_iter.nth(n).map(|v| &v.data)
    }
}

/// The mutable iterator over all the children
pub struct ChildrenIterMut<'a,T>{
    pub (in crate) raw_iter : std::slice::IterMut<'a, Tree<T>>
}

impl<'a,T> Iterator for ChildrenIterMut<'a,T>{
    type Item = &'a mut T;

    fn next(&mut self) -> Option<Self::Item> {
        self.raw_iter.next().map(|v| &mut v.data)
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        self.raw_iter.size_hint()
    }

    fn count(self) -> usize where
        Self: Sized, {
        self.raw_iter.count()
    }

    fn last(self) -> Option<Self::Item> where
        Self: Sized, {
        self.raw_iter.last().map(|v| &mut v.data)
    }

    fn nth(&mut self, n: usize) -> Option<Self::Item> {
        self.raw_iter.nth(n).map(|v| &mut v.data)
    }
}