read-tree 0.1.0

A read-only tree 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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144

use super::*;

fn tiny() -> Tree<usize> {
    let mut sap = Sapling::new();
    sap.push_leaf(1);
    sap.build().unwrap()
}

fn small() -> Tree<usize> {
    let mut sap = Sapling::new();
    sap.push(1);
    sap.push_leaf(11);
    sap.push(12);
    sap.push(121);
    sap.push_leaf(1211);
    sap.pop();
    sap.push_leaf(122);
    sap.pop();
    sap.pop();
    sap.build().unwrap()
}

mod test_sapling {
    use super::*;

    #[test]
    fn test_tiny() {
        tiny();
    }

    #[test]
    fn test_small() {
        small();
    }

    #[test]
    fn test_err() {
        let sap = Sapling::<usize>::new();
        sap.build().unwrap_err();

        let mut sap = Sapling::<usize>::new();
        assert!(sap.pop().is_none());

        let mut sap = Sapling::new();
        sap.push(0);
        sap.build().unwrap_err();

        let mut sap = Sapling::new();
        sap.push_leaf(0);
        sap.push_leaf(0);
        sap.build().unwrap_err();

        let mut sap = Sapling::new();
        sap.push(0);
        sap.push(0);
        sap.pop();
        sap.build().unwrap_err();
    }

    #[test]
    fn test_clear() {
        let mut sap = Sapling::new();
        sap.push_leaf(0);
        sap.clear();
        sap.build().unwrap_err();

        let mut sap = Sapling::new();
        sap.push(0);
        sap.clear();
        sap.push_leaf(0);
        sap.build().unwrap();

        let mut sap = Sapling::new();
        sap.push_leaf(0);
        sap.clear();
        sap.push_leaf(0);
        sap.build().unwrap();
    }
}

mod test_node {
    use super::*;

    #[test]
    fn test_to_tree() {
        let tree_1 = small();
        let tree_2 = tree_1.root().into_tree();
        for (n1, n2) in tree_1.root().iter().zip(tree_2.root().iter()) {
            assert_eq!(n1.data(), n2.data());
        }
    }
}

mod test_iter {
    use super::*;

    #[test]
    fn test_iter_children() {
        let tree = small();
        let mut iter = tree.root().children();

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 1);
        assert_eq!(node.data(), &11);

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 1);
        assert_eq!(node.data(), &12);

        assert!(iter.next().is_none());
    }

    #[test]
    fn test_iter_descendants() {
        let tree = small();
        let mut iter = tree.root().iter();

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 0);
        assert_eq!(node.data(), &1);

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 1);
        assert_eq!(node.data(), &11);

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 1);
        assert_eq!(node.data(), &12);

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 2);
        assert_eq!(node.data(), &121);

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 3);
        assert_eq!(node.data(), &1211);

        let node = iter.next().unwrap();
        assert_eq!(node.depth(), 2);
        assert_eq!(node.data(), &122);

        assert!(iter.next().is_none());
    }
}