xdag 0.1.4

A simple Rust DAG(Directed Acyclic Graph) lib
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
64
65

/// iterator of the children in `DAG`
pub struct ChildrenIter<'a, NodeId, EdgeData> {
    pub(crate) iter: Option<std::collections::hash_map::Iter<'a, NodeId, EdgeData>>,
}

impl<'a, NodeId, EdgeData> Iterator for ChildrenIter<'a, NodeId, EdgeData>
where
    NodeId: Copy,
{
    type Item = (NodeId, &'a EdgeData);

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(iter) = &mut self.iter {
            iter.next().map(|(id, data)| (*id, data))
        } else {
            None
        }
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        if let Some(iter) = &self.iter {
            iter.size_hint()
        } else {
            (0, Some(0))
        }
    }
}

impl<'a, NodeId, EdgeData> ExactSizeIterator for ChildrenIter<'a, NodeId, EdgeData> where
    NodeId: Copy
{
}

/// iterator of the children in `DAG`
pub struct ChildrenIterMut<'a, NodeId, EdgeData> {
    pub(crate) iter: Option<std::collections::hash_map::IterMut<'a, NodeId, EdgeData>>,
}

impl<'a, NodeId, EdgeData> Iterator for ChildrenIterMut<'a, NodeId, EdgeData>
where
    NodeId: Copy,
{
    type Item = (NodeId, &'a mut EdgeData);

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(iter) = &mut self.iter {
            iter.next().map(|(id, data)| (*id, data))
        } else {
            None
        }
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        if let Some(iter) = &self.iter {
            iter.size_hint()
        } else {
            (0, Some(0))
        }
    }
}

impl<'a, NodeId, EdgeData> ExactSizeIterator for ChildrenIterMut<'a, NodeId, EdgeData> where
    NodeId: Copy
{
}