sauron 0.70.0

A versatile web framework and library for building client-side and/or server-side web applications
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

use sauron::vdom::{diff::*, patch::*, *};

#[test]
fn test_multiple_replace() {
    let old: Node<()> = element(
        "main",
        vec![attr("class", "multi_replace")],
        vec![element(
            "ul",
            vec![attr("class", "todo")],
            vec![
                element("li", vec![attr("key", "1")], vec![leaf("item1")]),
                element("li", vec![attr("key", "2")], vec![leaf("item2")]),
                element("li", vec![attr("key", "3")], vec![leaf("item3")]),
            ],
        )],
    );

    // we remove the key1
    let update1: Node<()> = element(
        "main",
        vec![attr("class", "multi_replace")],
        vec![element(
            "ul",
            vec![attr("class", "todo")],
            vec![
                element("li", vec![attr("key", "10")], vec![leaf("item10")]),
                element("li", vec![attr("key", "20")], vec![leaf("item20")]),
                element("li", vec![attr("key", "30")], vec![leaf("item30")]),
            ],
        )],
    );

    let patches = diff(&old, &update1);

    dbg!(&patches);

    assert_eq!(
        patches,
        vec![
            Patch::remove_node(Some(&"li"), TreePath::new(vec![0, 1]),),
            Patch::remove_node(Some(&"li"), TreePath::new(vec![0, 2]),),
            Patch::replace_node(
                Some(&"li"),
                TreePath::new(vec![0, 0]),
                vec![
                    &element("li", vec![attr("key", "10")], vec![leaf("item10")]),
                    &element("li", vec![attr("key", "20")], vec![leaf("item20")]),
                    &element("li", vec![attr("key", "30")], vec![leaf("item30")]),
                ],
            ),
        ]
    );
}