Wall TimeCPU SimulationMemory 3 months ago 7fc87c3 main workflow_dispatchCompare
Suggested base runs: 603 total
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 crates/divan_compat/examples/benches/math.rs::fibonacci crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::backtracking 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 add_two_integers[(1024, -1024)] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationcrates/divan_compat/examples/benches/the_algorithms.rs::backtracking recursive_memoized[HashMap<u64, u64>, 30] crates/divan_compat/examples/benches/math.rs::fibonaccicrates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/sort.rs::random recursive_memoized[BTreeMap<u64, u64>, 30] crates/divan_compat/examples/benches/math.rs::fibonaccicrates/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 find_highest_set_bit[1024] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationcrates/divan_compat/examples/benches/the_algorithms.rs::backtracking process_with_multiple_counters crates/divan_compat/examples/benches/counters.rs::multiple_counters_examplescrates/divan_compat/examples/benches/time_scale.rs crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/time.rs::duration_since © 2026 CodSpeed Technology