CodSpeedHQ
codspeed-rust
BlogDocsChangelog

GitHub Actions run

7 days ago 2d7d26b run-with-more-events pull_request

Compare

Base
Search a run

Head
chore: run with multi events
#157
run-with-more-events
7 days ago
Wall TimeCPU SimulationMemory

Compare
Suggested base runs: • •

Skipped (490)

Benchmarks

generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.2 µs
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
34 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
49.7 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
add
crates/divan_compat/examples/benches/math.rs
2 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.1 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
112.2 µs
uppercase_chars_with_counter
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples
365 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
22.4 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
629 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
11.7 µs
process_with_multiple_counters
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples
48 ns
allocate
crates/divan_compat/examples/benches/alloc.rs
1 s
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.4 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
2.4 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
5 ms
sort
crates/divan_compat/examples/benches/sort.rs::sorted
120.2 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
980 ns
filter_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples
825 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.2 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
3 ns
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
908 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
67 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
5.1 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.1 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
20 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.2 ms
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
simulated_processing_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples
885 ns
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.1 µs
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
1.1 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
294.7 ms
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
416 ns
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
100.1 µs
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.7 ms
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
603 ns
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
578 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.2 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
3.4 ms
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
1.1 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.4 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
69.2 µs
rem
crates/divan_compat/examples/benches/math.rs
3 ns
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
301.5 µs
hash_computation_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples
46 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.8 µs
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
7 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
12 ns
vec_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
61 ns
string_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
38 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
50 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
130.7 µs
string_processing_multi_counter
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples
364 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
131 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
118.7 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
803 ns
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1 µs
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
1.1 ms
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
251.3 ms
system_time
crates/divan_compat/examples/benches/time.rs::now
48 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
794.1 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.1 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.9 µs
mul
crates/divan_compat/examples/benches/math.rs
2 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
827 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.3 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
20.4 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
161 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
20 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
500.3 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.8 µs
slice_into_vec_with_bytes
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
58 ns
count_chars_in_string
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples
33 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since
10 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.3 µs
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
instant
crates/divan_compat/examples/benches/time.rs::now
39 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
300 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.4 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
887 ns
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
221 ns
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
67.1 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.8 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.6 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
75 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
40 ns
div
crates/divan_compat/examples/benches/math.rs
3 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
186 ns
process_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples
44 ns

Ignored

rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
1 µs
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
Ignored
2 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
716 ns
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
88 ns
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
1.4 µs
© 2026 CodSpeed Technology
Home Terms Privacy Docs