GitHub Actions run
CPU SimulationMemory
3 months ago c3259a2 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
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking1.1 KB
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation128 B
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs128 B
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking560 B
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking3.4 KB
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking128 B
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
slice_into_vec_with_bytes
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples192 B
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci1.6 KB
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking128 B
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking446 B
add
crates/divan_compat/examples/benches/math.rs128 B
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking128 B
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation128 B
hash_computation_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples128 B
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking4.3 KB
rem
crates/divan_compat/examples/benches/math.rs128 B
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation192 B
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation128 B
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking12 KB
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking128 B
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking128 B
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking1.8 KB