reactive-signals 0.1.0-alpha.4

reactive-signals is a dx-first scope-based fine-grained reactive system.
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

use super::Tree;
use insta::assert_snapshot;

use super::StringStore;

fn create_tree() -> Tree<usize> {
    let mut tree = Tree::create_and_init(0);

    let c1 = tree.add_child(tree.root(), 1);
    let _c1_1 = tree.add_child(c1, 11);

    let c2 = tree.add_child(tree.root(), 2);
    let _c2_0 = tree.add_child(c2, 20);
    let _c2_1 = tree.add_child(c2, 21);
    let c2_2 = tree.add_child(c2, 22);
    let _c2_2_0 = tree.add_child(c2_2, 220);
    let _c2_2_1 = tree.add_child(c2_2, 221);
    let _c3 = tree.add_child(tree.root(), 3);
    let _c4 = tree.add_child(tree.root(), 4);

    tree
}

#[test]
fn show_tree() {
    let tree = create_tree();
    assert_snapshot!(tree.dump_used(), @"[0] 0, [1] 1, [2] 11, [3] 2, [4] 20, [5] 21, [6] 22, [7] 220, [8] 221, [9] 3, [10] 4");

    assert_snapshot!(tree.ascii(&|d| d.to_string()), @r###"
    0
     ├─ 1
     │   └─ 11
     ├─ 2
     │   ├─ 20
     │   ├─ 21
     │   └─ 22
     │       ├─ 220
     │       └─ 221
     ├─ 3
     └─ 4
    "###);
}

const ITER_ORDER: &str = "4, 3, 221, 220, 22, 21, 20, 2, 11, 1, 0";

#[test]
fn iter() {
    let tree = create_tree();
    let mut visits = vec![];
    for node in tree.iter_from(tree.root()) {
        visits.push(format!("{}", tree.nodes[node.index()].data));
    }

    assert_eq!(visits.join(", "), ITER_ORDER);
}

#[test]
fn iter_single_node() {
    let mut tree = Tree::create_and_init(0);

    let c1 = tree.add_child(tree.root(), 1);
    let mut visits = vec![];
    for node in tree.iter_from(c1) {
        visits.push(format!("{}", tree.nodes[node.index()].data));
    }

    assert_eq!(visits.join(", "), "1");
}

#[test]
fn iter_single_with_sibling() {
    let mut tree = Tree::create_and_init(0);

    let c1 = tree.add_child(tree.root(), 1);
    let _ = tree.add_child(tree.root(), 2);

    assert_snapshot!(tree.ascii(&|d| d.to_string()), @r###"
    0
     ├─ 1
     └─ 2
    "###);
    let mut visits = vec![];
    for node in tree.iter_from(c1) {
        visits.push(format!("{}", tree.nodes[node.index()].data));
    }

    assert_eq!(visits.join(", "), "1");
}

#[test]
fn mut_iter() {
    let mut tree = create_tree();

    let visits = StringStore::new();
    tree.iter_mut_from(tree.root()).for_each(|tree, node| {
        visits.push(format!("{}", tree.nodes[node.index()].data));
        // just to make sure we can write to it
        tree.nodes[node.index()].data += 1;
    });

    assert_eq!(visits.values(), ITER_ORDER);
}