jleony/nanoreth
1
0
Fork 0
mirror of https://github.com/hl-archive-node/nanoreth.git synced 2025-12-06 10:59:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(bench): make benchmark inputs deterministic using fixed seed (#13586)

Browse Source 
Co-authored-by: Dan Cline <6798349+Rjected@users.noreply.github.com>
This commit is contained in:
Ragnar
2024-12-30 22:11:27 +01:00
committed by GitHub
parent 0b135a2670
commit 5629ba0bb1
4 changed files with 12 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
crates/trie/sparse/benches/rlp_node.rs
View File

@ -10,13 +10,12 @@ use reth_trie::Nibbles;
use reth_trie_sparse::RevealedSparseTrie;
fn update_rlp_node_level(c: &mut Criterion) {
let mut rng = generators::rng();
let mut rng = generators::rng_with_seed(&12345_u16.to_be_bytes());
let mut group = c.benchmark_group("update rlp node level");
group.sample_size(20);
for size in [100_000] {
let mut runner = TestRunner::new(ProptestConfig::default());
let mut runner = TestRunner::deterministic();
let state = proptest::collection::hash_map(any::<B256>(), any::<U256>(), size)
.new_tree(&mut runner)
.unwrap()

2
crates/trie/sparse/benches/root.rs
View File

@ -214,7 +214,7 @@ fn calculate_root_from_leaves_repeated(c: &mut Criterion) {
}
fn generate_test_data(size: usize) -> B256HashMap<U256> {
let mut runner = TestRunner::new(ProptestConfig::default());
let mut runner = TestRunner::deterministic();
proptest::collection::hash_map(any::<B256>(), any::<U256>(), size)
.new_tree(&mut runner)
.unwrap()