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/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/math.rs crates/divan_compat/examples/benches/math.rs::fibonacci 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 crates/divan_compat/examples/benches/the_algorithms.rs::backtracking recursive_memoized[HashMap<u64, u64>, 0] crates/divan_compat/examples/benches/math.rs::fibonaccifind_highest_set_bit[255] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationcrates/divan_compat/examples/benches/sort.rs::random add_two_integers[(42, 13)] crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulationcrates/divan_compat/examples/benches/time.rs::now crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/time.rs::duration_since crates/divan_compat/examples/benches/math.rs::fibonacci 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/benches/thread_example.rs crates/divan_compat/benches/basic_example.rs::const_bench © 2026 CodSpeed Technology