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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
use std::hint::black_box;
use criterion::{Criterion, criterion_group, criterion_main};
use sheet_system::{
index_source::IndexSource,
mapping::{LocalMapping, LocalMappingForward},
sheet::SheetData,
sheet_tree::SheetDataTree,
};
fn sheet_tree_benchmark(c: &mut Criterion) {
c.bench_function("tree build 10 mappings", |b| {
b.iter(|| build_and_bench_tree(10))
});
c.bench_function("tree build 100 mappings", |b| {
b.iter(|| build_and_bench_tree(100))
});
c.bench_function("tree build 1000 mappings", |b| {
b.iter(|| build_and_bench_tree(1000))
});
c.bench_function("tree build 10000 mappings", |b| {
b.iter(|| build_and_bench_tree(10000))
});
c.bench_function("tree find shallow path (10 mappings)", |b| {
let sheet_data = create_sheet_data(10);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_shallow_path(&tree))
});
c.bench_function("tree find shallow path (100 mappings)", |b| {
let sheet_data = create_sheet_data(100);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_shallow_path(&tree))
});
c.bench_function("tree find shallow path (1000 mappings)", |b| {
let sheet_data = create_sheet_data(1000);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_shallow_path(&tree))
});
c.bench_function("tree find deep path (10 mappings)", |b| {
let sheet_data = create_sheet_data(10);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_deep_path(&tree))
});
c.bench_function("tree find deep path (100 mappings)", |b| {
let sheet_data = create_sheet_data(100);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_deep_path(&tree))
});
c.bench_function("tree find deep path (1000 mappings)", |b| {
let sheet_data = create_sheet_data(1000);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_deep_path(&tree))
});
c.bench_function("tree find in flat structure (1000 mappings)", |b| {
let sheet_data = create_flat_structure_sheet_data(1000);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_in_flat_structure(&tree))
});
c.bench_function("tree find in deep structure (100 mappings)", |b| {
let sheet_data = create_deep_structure_sheet_data(100);
let tree = SheetDataTree::from(&sheet_data);
b.iter(|| find_in_deep_structure(&tree))
});
c.bench_function("direct mapping find (1000 mappings)", |b| {
let sheet_data = create_sheet_data(1000);
b.iter(|| direct_mapping_find(&sheet_data))
});
}
fn build_and_bench_tree(count: u32) {
let sheet_data = create_sheet_data(count);
let tree = SheetDataTree::from(&sheet_data);
black_box(tree);
}
fn create_sheet_data(count: u32) -> SheetData {
let mut sheet = SheetData::empty().pack("benchmark_sheet");
for n in 0..count {
let depth = (n % 3) + 1;
let mut path_parts = Vec::new();
for d in 0..depth {
path_parts.push(format!("dir_{}", d));
}
path_parts.push(format!("file_{}.txt", n));
sheet
.insert_mapping(
LocalMapping::new(
path_parts,
IndexSource::new(true, n as u32, 1),
LocalMappingForward::Latest,
)
.unwrap(),
)
.unwrap();
}
sheet.apply().unwrap();
sheet.unpack()
}
fn create_flat_structure_sheet_data(count: u32) -> SheetData {
let mut sheet = SheetData::empty().pack("flat_structure_sheet");
for n in 0..count {
sheet
.insert_mapping(
LocalMapping::new(
vec![format!("file_{}.txt", n)],
IndexSource::new(true, n as u32, 1),
LocalMappingForward::Latest,
)
.unwrap(),
)
.unwrap();
}
sheet.apply().unwrap();
sheet.unpack()
}
fn create_deep_structure_sheet_data(count: u32) -> SheetData {
let mut sheet = SheetData::empty().pack("deep_structure_sheet");
for n in 0..count {
let mut path_parts = Vec::new();
for d in 0..5 {
path_parts.push(format!("level_{}", d));
}
path_parts.push(format!("file_{}.txt", n));
sheet
.insert_mapping(
LocalMapping::new(
path_parts,
IndexSource::new(true, n as u32, 1),
LocalMappingForward::Latest,
)
.unwrap(),
)
.unwrap();
}
sheet.apply().unwrap();
sheet.unpack()
}
fn find_shallow_path(tree: &SheetDataTree) {
let root = tree.root();
if let Some(dir_node) = root.next("dir_0") {
if let Some(file_node) = dir_node.next("file_0.txt") {
black_box(file_node.mapping());
}
}
}
fn find_deep_path(tree: &SheetDataTree) {
let root = tree.root();
if let Some(dir0) = root.next("dir_0") {
if let Some(dir1) = dir0.next("dir_1") {
if let Some(dir2) = dir1.next("dir_2") {
if let Some(file_node) = dir2.next("file_0.txt") {
black_box(file_node.mapping());
}
}
}
}
}
fn find_in_flat_structure(tree: &SheetDataTree) {
let root = tree.root();
if let Some(file_node) = root.next("file_500.txt") {
black_box(file_node.mapping());
}
}
fn find_in_deep_structure(tree: &SheetDataTree) {
let root = tree.root();
if let Some(level0) = root.next("level_0") {
if let Some(level1) = level0.next("level_1") {
if let Some(level2) = level1.next("level_2") {
if let Some(level3) = level2.next("level_3") {
if let Some(level4) = level3.next("level_4") {
if let Some(file_node) = level4.next("file_50.txt") {
black_box(file_node.mapping());
}
}
}
}
}
}
}
/// 直接使用映射查找（作为对比基准）
fn direct_mapping_find(sheet_data: &SheetData) {
let key = vec![
"dir_0".to_string(),
"dir_1".to_string(),
"dir_2".to_string(),
"file_0.txt".to_string(),
];
if let Some(mapping) = sheet_data.mappings().get(&key) {
black_box(mapping);
}
}
criterion_group!(benches, sheet_tree_benchmark);
criterion_main!(benches);
|
