Skip to content

Commit

Permalink
chore(bench): fix non deterministic bench IDs (#13530)
Browse files Browse the repository at this point in the history
  • Loading branch information
DaniPopes authored Dec 23, 2024
1 parent 5ea8f31 commit 02ad280
Showing 1 changed file with 8 additions and 8 deletions.
16 changes: 8 additions & 8 deletions crates/trie/common/benches/prefix_set.rs
Original file line number Diff line number Diff line change
Expand Up @@ -61,21 +61,25 @@ pub fn prefix_set_lookups(c: &mut Criterion) {
&mut group,
"`BTreeSet` with `Iterator:any` lookup",
test_data.clone(),
size,
);
prefix_set_bench::<BTreeRangeLastCheckedPrefixSet>(
&mut group,
"`BTreeSet` with `BTreeSet:range` lookup",
test_data.clone(),
size,
);
prefix_set_bench::<VecCursorPrefixSet>(
&mut group,
"`Vec` with custom cursor lookup",
test_data.clone(),
size,
);
prefix_set_bench::<VecBinarySearchPrefixSet>(
&mut group,
"`Vec` with binary search lookup",
test_data.clone(),
size,
);
}
}
Expand All @@ -84,6 +88,7 @@ fn prefix_set_bench<T>(
group: &mut BenchmarkGroup<'_, WallTime>,
description: &str,
(preload, input, expected): (Vec<Nibbles>, Vec<Nibbles>, Vec<bool>),
size: usize,
) where
T: PrefixSetMutAbstraction,
T::Frozen: PrefixSetAbstraction,
Expand All @@ -96,12 +101,7 @@ fn prefix_set_bench<T>(
(prefix_set.freeze(), input.clone(), expected.clone())
};

let group_id = format!(
"prefix set | preload size: {} | input size: {} | {}",
preload.len(),
input.len(),
description
);
let group_id = format!("prefix set | size: {size} | {description}");
group.bench_function(group_id, |b| {
b.iter_with_setup(setup, |(mut prefix_set, input, expected)| {
for (idx, key) in input.into_iter().enumerate() {
Expand All @@ -120,12 +120,12 @@ fn generate_test_data(size: usize) -> (Vec<Nibbles>, Vec<Nibbles>, Vec<bool>) {

let vec_of_nibbles = |range| vec(any_with::<Nibbles>(range), size);
let mut preload = vec_of_nibbles(32usize.into()).new_tree(&mut runner).unwrap().current();
preload.dedup();
preload.sort();
preload.dedup();

let mut input = vec_of_nibbles((0..=32usize).into()).new_tree(&mut runner).unwrap().current();
input.dedup();
input.sort();
input.dedup();

let expected = input
.iter()
Expand Down

0 comments on commit 02ad280

Please sign in to comment.