orx-tree 2.2.0

A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213

use crate::tests::node_mut::utils::{
    collect_sorted_subtree, get_main_tree, get_main_tree_copy, get_other_tree, get_other_tree_copy,
};
use crate::*;
use std::vec::Vec;

fn expected_nodes<T: Clone + Eq + Ord>(
    initial_nodes: &[T],
    expected_removed: &[T],
    expected_inserted: &[T],
) -> Vec<T> {
    let mut expected_nodes: Vec<_> = initial_nodes
        .iter()
        .filter(|x| !expected_removed.contains(x))
        .cloned()
        .collect();

    expected_nodes.extend_from_slice(expected_inserted);

    expected_nodes.sort();

    expected_nodes
}

#[test]
fn replace_cloned() {
    let tree = get_main_tree();
    let initial_nodes = collect_sorted_subtree(tree.root());

    let other = get_other_tree();
    let ids_other: Vec<_> = other.root().indices::<Bfs>().collect();

    for i in 0..tree.len() {
        for id_src in ids_other.iter().copied() {
            let mut tree = tree.clone();
            let id_dst = tree.root().indices::<Bfs>().nth(i).unwrap();

            let expected_removed = collect_sorted_subtree(tree.node(id_dst));
            let expected_inserted = collect_sorted_subtree(other.node(id_src));
            let expected_nodes =
                expected_nodes(&initial_nodes, &expected_removed, &expected_inserted);

            let root_value = other.node(id_src).data().clone();
            let subtree = other.node(id_src).as_cloned_subtree();
            let idx = tree.node_mut(id_dst).replace(subtree);

            let nodes = collect_sorted_subtree(tree.root());
            assert_eq!(nodes, expected_nodes);

            assert_eq!(tree.node(idx).data(), &root_value);
        }
    }
}

#[test]
fn replace_copied() {
    let tree = get_main_tree_copy();
    let initial_nodes = collect_sorted_subtree(tree.root());

    let other = get_other_tree_copy();
    let ids_other: Vec<_> = other.root().indices::<Bfs>().collect();

    for i in 0..tree.len() {
        for id_src in ids_other.iter().copied() {
            let mut tree = tree.clone();
            let id_dst = tree.root().indices::<Bfs>().nth(i).unwrap();

            let expected_removed = collect_sorted_subtree(tree.node(id_dst));
            let expected_inserted = collect_sorted_subtree(other.node(id_src));
            let expected_nodes =
                expected_nodes(&initial_nodes, &expected_removed, &expected_inserted);

            let root_value = *other.node(id_src).data();
            let subtree = other.node(id_src).as_copied_subtree();
            let idx = tree.node_mut(id_dst).replace(subtree);

            let nodes = collect_sorted_subtree(tree.root());
            assert_eq!(nodes, expected_nodes);

            assert_eq!(tree.node(idx).data(), &root_value);
        }
    }
}

#[test]
fn replace_moved() {
    let tree = get_main_tree();
    let initial_nodes = collect_sorted_subtree(tree.root());

    let other = get_other_tree();

    for i in 0..tree.len() {
        for j in 0..other.len() {
            let mut tree = tree.clone();
            let mut other = other.clone();
            let id_dst = tree.root().indices::<Bfs>().nth(i).unwrap();
            let id_src = other.root().indices::<Bfs>().nth(j).unwrap();

            let expected_removed = collect_sorted_subtree(tree.node(id_dst));
            let expected_inserted = collect_sorted_subtree(other.node(id_src));
            let expected_nodes =
                expected_nodes(&initial_nodes, &expected_removed, &expected_inserted);

            let root_value = other.node(id_src).data().clone();
            let subtree = other.node_mut(id_src).into_subtree();
            let idx = tree.node_mut(id_dst).replace(subtree);

            let nodes = collect_sorted_subtree(tree.root());
            assert_eq!(nodes, expected_nodes);

            assert_eq!(tree.node(idx).data(), &root_value);
        }
    }
}

// replace_with

#[test]
fn replace_with_cloned() {
    let tree = get_main_tree().into_lazy_reclaim();
    let initial_nodes = collect_sorted_subtree(tree.root());

    let other = get_other_tree();
    let ids_other: Vec<_> = other.root().indices::<Bfs>().collect();

    for i in 0..tree.len() {
        for id_src in ids_other.iter().copied() {
            let mut tree = tree.clone();
            let id_dst = tree.root().indices::<Bfs>().nth(i).unwrap();

            let expected_removed = collect_sorted_subtree(tree.node(id_dst));
            let expected_inserted = collect_sorted_subtree(other.node(id_src));
            let expected_nodes =
                expected_nodes(&initial_nodes, &expected_removed, &expected_inserted);

            let root_value = other.node(id_src).data().clone();
            let subtree = other.node(id_src).as_cloned_subtree();
            let (idx, removed) = tree.node_mut(id_dst).replace_with::<Bfs, _>(subtree);
            let removed: Vec<_> = removed.collect();

            let nodes = collect_sorted_subtree(tree.root());
            assert_eq!(nodes, expected_nodes);

            assert_eq!(removed, expected_removed);
            assert_eq!(tree.node(idx).data(), &root_value);
        }
    }
}

#[test]
fn replace_with_copied() {
    let tree = get_main_tree_copy().into_lazy_reclaim();
    let initial_nodes = collect_sorted_subtree(tree.root());

    let other = get_other_tree_copy();
    let ids_other: Vec<_> = other.root().indices::<Bfs>().collect();

    for i in 0..tree.len() {
        for id_src in ids_other.iter().copied() {
            let mut tree = tree.clone();
            let id_dst = tree.root().indices::<Bfs>().nth(i).unwrap();

            let expected_removed = collect_sorted_subtree(tree.node(id_dst));
            let expected_inserted = collect_sorted_subtree(other.node(id_src));
            let expected_nodes =
                expected_nodes(&initial_nodes, &expected_removed, &expected_inserted);

            let root_value = *other.node(id_src).data();
            let subtree = other.node(id_src).as_copied_subtree();
            let (idx, removed) = tree.node_mut(id_dst).replace_with::<Bfs, _>(subtree);
            let removed: Vec<_> = removed.collect();

            let nodes = collect_sorted_subtree(tree.root());
            assert_eq!(nodes, expected_nodes);

            assert_eq!(removed, expected_removed);
            assert_eq!(tree.node(idx).data(), &root_value);
        }
    }
}

#[test]
fn replace_with_moved() {
    let tree = get_main_tree().into_lazy_reclaim();
    let initial_nodes = collect_sorted_subtree(tree.root());

    let other = get_other_tree();

    for i in 0..tree.len() {
        for j in 0..other.len() {
            let mut tree = tree.clone();
            let mut other = other.clone();
            let id_dst = tree.root().indices::<Bfs>().nth(i).unwrap();
            let id_src = other.root().indices::<Bfs>().nth(j).unwrap();

            let expected_removed = collect_sorted_subtree(tree.node(id_dst));
            let expected_inserted = collect_sorted_subtree(other.node(id_src));
            let expected_nodes =
                expected_nodes(&initial_nodes, &expected_removed, &expected_inserted);

            let root_value = other.node(id_src).data().clone();
            let subtree = other.node_mut(id_src).into_subtree();
            let (idx, removed) = tree.node_mut(id_dst).replace_with::<Bfs, _>(subtree);
            let removed: Vec<_> = removed.collect();

            let nodes = collect_sorted_subtree(tree.root());
            assert_eq!(nodes, expected_nodes);

            assert_eq!(removed, expected_removed);
            assert_eq!(tree.node(idx).data(), &root_value);
        }
    }
}