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

use crate::{
    Dyn, DynTree, NodeRef,
    memory::Auto,
    node_ref::NodeRefCore,
    pinned_storage::SplitRecursive,
    traversal::{
        breadth_first::{iter_ptr::BfsIterPtr, iter_ref::BfsIterRef},
        enumerations::{DepthSiblingIdxVal, DepthVal, SiblingIdxVal, Val},
        node_item::NodeItem,
        over::{Over, OverData, OverNode, OverPtr},
    },
};
use alloc::collections::VecDeque;
use alloc::vec::Vec;
use orx_selfref_col::{NodePtr, Variant};

/// ```
///      1
///     ╱ ╲
///    ╱   ╲
///   2     3
///  ╱ ╲   ╱ ╲
/// 4   5 6   7
/// |     |  ╱ ╲
/// 8     9 10  11
/// ```
fn tree() -> DynTree<i32> {
    let mut tree = DynTree::new(1);

    let mut root = tree.root_mut();
    let [id2, id3] = root.push_children([2, 3]);

    let mut n2 = tree.node_mut(id2);
    let [id4, _] = n2.push_children([4, 5]);

    tree.node_mut(id4).push_child(8);

    let mut n3 = tree.node_mut(id3);
    let [id6, id7] = n3.push_children([6, 7]);

    tree.node_mut(id6).push_child(9);
    tree.node_mut(id7).push_children([10, 11]);

    tree
}

#[test]
fn bfs_iter_ref_empty() {
    let tree = DynTree::empty();
    let iter = BfsIterPtr::<Dyn<i32>, Val>::default();
    let mut iter = BfsIterRef::<_, Auto, SplitRecursive, Val, _, NodePtr<_>>::from((&tree.0, iter));
    assert_eq!(iter.next(), None);
}

type Item<'a, O> = <O as Over>::NodeItem<'a, Dyn<i32>, Auto, SplitRecursive>;

fn bfs_iter_for<O: Over>() {
    fn data<'a, O: Over>(
        iter: impl Iterator<Item = Item<'a, O>>,
    ) -> Vec<<Dyn<i32> as Variant>::Item> {
        iter.map(|x| *x.node_data()).collect()
    }

    let tree = tree();
    let mut queue = VecDeque::default();

    let root = tree.root();
    let ptr = root.node_ptr();
    let iter = BfsIterPtr::<_, Val, _>::from((&mut queue, ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, Val, _, Item<'_, O>>::from((root.col(), iter));
    assert_eq!(data::<'_, O>(iter), [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]);

    let n3 = root.get_child(1).unwrap();
    let ptr = n3.node_ptr();
    let iter = BfsIterPtr::<_, Val, _>::from((&mut queue, ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, Val, _, Item<'_, O>>::from((root.col(), iter));
    assert_eq!(data::<'_, O>(iter), [3, 6, 7, 9, 10, 11]);

    let n7 = n3.get_child(1).unwrap();
    let ptr = n7.node_ptr();
    let iter = BfsIterPtr::<_, Val, _>::from((queue, ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, Val, _, Item<'_, O>>::from((root.col(), iter));
    assert_eq!(data::<'_, O>(iter), [7, 10, 11]);
}

#[test]
fn bfs_iter_ref_ptr() {
    bfs_iter_for::<OverPtr>();
}

#[test]
fn bfs_iter_ref_val() {
    bfs_iter_for::<OverNode>();
}

#[test]
fn bfs_iter_ref_node() {
    bfs_iter_for::<OverData>();
}

#[test]
fn bfs_iter_ref_depth() {
    let tree = tree();
    let mut queue = VecDeque::default();

    let root = tree.root();
    let ptr = root.node_ptr();
    let iter = BfsIterPtr::<_, DepthVal, _>::from((&mut queue, ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, DepthVal, _, &i32>::from((root.col(), iter));
    assert_eq!(
        iter.map(|x| x.0).collect::<Vec<_>>(),
        [0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3]
    );

    let n3 = root.get_child(1).unwrap();
    let ptr = n3.node_ptr();
    let iter = BfsIterPtr::<_, DepthVal, _>::from((&mut queue, ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, DepthVal, _, &i32>::from((root.col(), iter));
    assert_eq!(iter.map(|x| x.0).collect::<Vec<_>>(), [0, 1, 1, 2, 2, 2]);
}

#[test]
fn bfs_iter_ref_sibling() {
    let tree = tree();
    let mut queue = VecDeque::default();

    let root = tree.root();
    let ptr = root.node_ptr();
    let iter = BfsIterPtr::<_, SiblingIdxVal, _>::from((&mut queue, ptr));
    let iter =
        BfsIterRef::<_, Auto, SplitRecursive, SiblingIdxVal, _, &i32>::from((root.col(), iter));
    assert_eq!(
        iter.map(|x| x.0).collect::<Vec<_>>(),
        [0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1]
    );

    let n3 = root.get_child(1).unwrap();
    let ptr = n3.node_ptr();
    let iter = BfsIterPtr::<_, SiblingIdxVal, _>::from((&mut queue, ptr));
    let iter =
        BfsIterRef::<_, Auto, SplitRecursive, SiblingIdxVal, _, &i32>::from((root.col(), iter));
    assert_eq!(iter.map(|x| x.0).collect::<Vec<_>>(), [0, 0, 1, 0, 0, 1]);
}

#[test]
fn bfs_iter_ref_depth_sibling() {
    let tree = tree();

    let root = tree.root();
    let ptr = root.node_ptr();
    let iter = BfsIterPtr::<_, DepthSiblingIdxVal, _>::from((VecDeque::default(), ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, DepthSiblingIdxVal, _, &i32>::from((
        root.col(),
        iter,
    ));
    assert_eq!(
        iter.clone().map(|x| x.0).collect::<Vec<_>>(),
        [0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3]
    );

    assert_eq!(
        iter.map(|x| x.1).collect::<Vec<_>>(),
        [0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1]
    );

    let n3 = root.get_child(1).unwrap();
    let ptr = n3.node_ptr();
    let iter = BfsIterPtr::<_, DepthSiblingIdxVal, _>::from((VecDeque::default(), ptr));
    let iter = BfsIterRef::<_, Auto, SplitRecursive, DepthSiblingIdxVal, _, &i32>::from((
        root.col(),
        iter,
    ));
    assert_eq!(
        iter.clone().map(|x| x.0).collect::<Vec<_>>(),
        [0, 1, 1, 2, 2, 2]
    );

    assert_eq!(iter.map(|x| x.1).collect::<Vec<_>>(), [0, 0, 1, 0, 0, 1]);
}