Wall TimeCPU SimulationMemory 3 months ago 693edb3 main workflow_dispatchCompare
Suggested base runs: 603 total
crates/divan_compat/examples/benches/env.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking uppercase_chars_with_counter crates/divan_compat/examples/benches/counters.rs::chars_counter_examplescrates/divan_compat/examples/benches/counters.rs::cycles_counter_examples recursive_memoized[BTreeMap<u64, u64>, 20] crates/divan_compat/examples/benches/math.rs::fibonaccicrates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation crates/divan_compat/examples/benches/time_scale.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking find_highest_set_bit[255] 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 crates/divan_compat/examples/benches/time.rs::duration_since crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/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/counters.rs::chars_counter_examples crates/divan_compat/examples/benches/math.rs::fibonacci crates/divan_compat/examples/benches/time_scale.rs crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/sort.rs::random crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/time.rs::duration_since crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/the_algorithms.rs::backtracking crates/divan_compat/examples/benches/time.rs::now © 2026 CodSpeed Technology