rose_tree 0.3.0

An indexable tree data structure with a variable and unbounded number of branches per node. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
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

extern crate rose_tree;

use rose_tree::RoseTree;

struct Weight;

#[test]
fn walk_children() {
    let (mut tree, root) = RoseTree::<Weight, u32>::new(Weight);
    let a = tree.add_child(root, Weight);
    let b = tree.add_child(root, Weight);
    let c = tree.add_child(root, Weight);

    let mut child_walker = tree.walk_children(root);
    assert_eq!(Some(c), child_walker.next(&tree));
    assert_eq!(Some(b), child_walker.next(&tree));
    assert_eq!(Some(a), child_walker.next(&tree));
    assert_eq!(None, child_walker.next(&tree));

    let d = tree.add_child(b, Weight);
    let e = tree.add_child(b, Weight);
    let f = tree.add_child(b, Weight);

    child_walker = tree.walk_children(b);
    assert_eq!(Some(f), child_walker.next(&tree));
    assert_eq!(Some(e), child_walker.next(&tree));
    assert_eq!(Some(d), child_walker.next(&tree));
    assert_eq!(None, child_walker.next(&tree));
}

#[test]
fn walk_siblings() {
    let (mut tree, root) = RoseTree::<Weight, u32>::new(Weight);
    let a = tree.add_child(root, Weight);
    let b = tree.add_child(root, Weight);
    let c = tree.add_child(root, Weight);
    let d = tree.add_child(root, Weight);

    let mut sibling_walker = tree.walk_siblings(a);
    assert_eq!(Some(d), sibling_walker.next(&tree));
    assert_eq!(Some(c), sibling_walker.next(&tree));
    assert_eq!(Some(b), sibling_walker.next(&tree));
    assert_eq!(None, sibling_walker.next(&tree));
}