flange-flat-tree 0.2.2

A tree that can be expanded by attaching new values to the node without mutability of the old ones
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

use crate::{tree::Subtree, Builder, Tree};

#[derive(Debug, PartialEq)]
struct MultValNode<'a> {
    pub v1: &'a u32,
    pub v2: &'a u32,
}

#[test]
fn test_subtree() {
    let mut builder = Builder::with_capacity(2);
    builder.start_element(1);
    builder.start_end_element(2);
    builder.end_element();
    let tree = builder.build();

    fn print_subtree<ST>(st: ST)
    where
        ST: Subtree<Node = u32>,
    {
        println!("{}", st.value())
    }

    let values: Vec<u32> = (10..12).collect();
    let tree_with_values = tree.map(|i, n| MultValNode {
        v1: n,
        v2: &values[i],
    });
    // let tree_with_values = tree.flange(values);
    // let (tree, values) = tree_with_values.un_flange();
    assert_eq!(tree.root().value(), &1);
    assert_eq!(tree_with_values.root().value().v1, &1);
    assert_eq!(tree_with_values.root().value().v2, &10);
    assert_eq!(values[0], 10);
}