5 months ago 9181bce main workflow_dispatch Compare
Suggested base runs: 394 total
crates/divan_compat/examples/benches/sort.rs::sorted crates/divan_compat/examples/benches/math.rs::fibonacci crates/divan_compat/examples/benches/time.rs::now crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/time.rs::duration_since find_highest_set_bit[255] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationcrates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/math.rs::fibonacci crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/math.rs::fibonacci crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/counters.rs::chars_counter_examples crates/divan_compat/examples/benches/env.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking recursive_memoized[HashMap<u64, u64>, 10] crates/divan_compat/examples/benches/math.rs::fibonaccirecursive_memoized[BTreeMap<u64, u64>, 0] crates/divan_compat/examples/benches/math.rs::fibonaccicrates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/time.rs::now crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/sort.rs::random crates/divan_compat/examples/benches/sort.rs::random crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode © 2026 CodSpeed Technology