5 months ago 9181bce main workflow_dispatch Compare
Suggested base runs: 394 total
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/time_scale.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/math.rs::fibonacci filter_items_with_counter crates/divan_compat/examples/benches/counters.rs::items_counter_examplesfind_highest_set_bit[1024] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationcrates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/the_algorithms.rs::backtracking simulated_processing_cycles crates/divan_compat/examples/benches/counters.rs::cycles_counter_examplesrecursive_memoized[BTreeMap<u64, u64>, 5] crates/divan_compat/examples/benches/math.rs::fibonacciuppercase_chars_with_counter crates/divan_compat/examples/benches/counters.rs::chars_counter_examplescrates/divan_compat/examples/benches/the_algorithms.rs::backtracking find_highest_set_bit[65535] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationrecursive_memoized[BTreeMap<u64, u64>, 20] crates/divan_compat/examples/benches/math.rs::fibonaccirecursive_memoized[BTreeMap<u64, u64>, 30] crates/divan_compat/examples/benches/math.rs::fibonaccicrates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation vec_copy_with_bytes_counter crates/divan_compat/examples/benches/counters.rs::bytes_counter_examplescrates/divan_compat/examples/benches/time_scale.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/math.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking recursive_memoized[HashMap<u64, u64>, 20] crates/divan_compat/examples/benches/math.rs::fibonaccicrates/divan_compat/examples/benches/time_scale.rs crates/divan_compat/examples/benches/math.rs crates/divan_compat/examples/benches/math.rs::fibonacci © 2026 CodSpeed Technology