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

// tests on nodes without any children

use orx_tree::*;

/// https://github.com/orxfun/orx-tree/issues/183
#[test]
fn leaf_into_new_tree() {
    let mut tree = DynTree::new(0);
    let idx = tree.root_mut().push_child(1);

    let tree2: DynTree<_> = tree.node_mut(idx).into_new_tree();

    assert_eq!(tree2.len(), 1);
    assert_eq!(
        tree2.root().walk::<Dfs>().copied().collect::<Vec<_>>(),
        vec![1]
    );
}

#[test]
fn root_into_new_tree() {
    let mut tree = DynTree::new(0);

    let tree2: DynTree<_> = tree.root_mut().into_new_tree();

    assert_eq!(tree2.len(), 1);
    assert_eq!(
        tree2.root().walk::<Dfs>().copied().collect::<Vec<_>>(),
        vec![0]
    );
}

#[test]
fn leaf_into_walk() {
    let mut tree = DynTree::new(0);
    let idx = tree.root_mut().push_child(1);

    let values: Vec<_> = tree.node_mut(idx).into_walk::<Dfs>().collect();
    assert_eq!(values, vec![1]);

    let remaining: Vec<_> = tree.root().walk::<Dfs>().copied().collect();
    assert_eq!(remaining, vec![0]);
}

#[test]
fn leaf_into_leaves() {
    let mut tree = DynTree::new(0);
    let idx = tree.root_mut().push_child(1);

    let values: Vec<_> = tree.node_mut(idx).into_leaves::<Dfs>().collect();
    assert_eq!(values, vec![1]);

    let remaining: Vec<_> = tree.root().walk::<Dfs>().copied().collect();
    assert_eq!(remaining, vec![0]);
}

#[test]
fn leaf_into_subtree() {
    let mut tree = DynTree::new(0);
    let idx = tree.root_mut().push_child(1);

    let subtree = tree.node_mut(idx).into_subtree();
    let mut tree2 = DynTree::new(42);
    tree2.root_mut().push_child_tree(subtree);
    let values: Vec<_> = tree2.root().walk::<Dfs>().copied().collect();
    assert_eq!(values, vec![42, 1]);

    let remaining: Vec<_> = tree.root().walk::<Dfs>().copied().collect();
    assert_eq!(remaining, vec![0]);
}