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
#[cfg(test)]
mod test {
use crate::primitives::tree::lazy_tree_it::LazyTreeIterator;
use crate::primitives::tree::tree_node::TreeNode;
use crate::widget::stupid_tree::get_stupid_tree;
use std::collections::HashSet;
#[test]
fn tree_it_test_1() {
let root = get_stupid_tree();
let mut expanded: HashSet<usize> = HashSet::new();
expanded.insert(0);
expanded.insert(1);
let try_out = |expanded_ref: &HashSet<usize>| {
let items: Vec<(u16, String)> = LazyTreeIterator::new(root.clone(), None)
.with_expanded(expanded_ref)
.map(|(d, f)| (d as u16, format!("{:?}", f.id())))
.collect();
let max_len = items
.iter()
.fold(0, |acc, (_, item)| if acc > item.len() { acc } else { item.len() });
(items, max_len)
};
{
let (items, max_len) = try_out(&expanded);
assert_eq!(items.len(), 7);
/*
0: 0 -
1: 1 -
2: 10001
3: 10002
4: 2 *
5: 3
6: 4 *
len 7.
*/
assert_eq!(max_len, 5);
}
expanded.insert(2);
{
let (items, max_len) = try_out(&expanded);
/*
0: 0 -
1: 1 -
2: 10001
3: 10002
4: 2 -
5: 20001
6: 20002
7: 20003 *
8: 3
9: 4 *
len 10.
*/
assert_eq!(items.len(), 10);
assert_eq!(max_len, 5);
}
expanded.insert(20003);
{
/*
0: 0 -
1: 1 -
2: 10001
3: 10002
4: 2 -
5: 20001
6: 20002
7: 20003 -
8: 2000301
9: 3
10: 4 *
len 11.
*/
let (items, max_len) = try_out(&expanded);
assert_eq!(items.len(), 11);
assert_eq!(max_len, 7);
}
}
}