GitHub Actions run
CPU SimulationMemory
3 months ago 36000f5 cod-1711-codspeed-rust-add-analysis-mode-support pull_requestThis run is associated to a commit that was force-pushed
It will not be associated with its branch history. Be careful when comparing its performance to other runs.Compare
Base
Search a run
Head
Comparefeat: add support for analysis mode
#152
cod-1711-codspeed-rust-add-analysis-mode-support
3 months ago
CPU SimulationMemory
414 total
process_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples806.7 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs7.6 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci79.1 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci175.8 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci160.6 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking617.5 µs
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci236.9 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci9.7 ms
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking5.7 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci5 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci3 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci12.9 µs
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation150.8 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking289.4 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted404.7 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation155 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking21.5 µs
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation122.2 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking5.3 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking17.6 µs
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation2.9 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking6.5 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking5.4 µs
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation122.2 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since375.8 ns