Comparing
add-explcit-codspeed-mode-to-ci
(8f962df
) withmain
(0565866
)-7%
- Untouched
- 158
- Ignored
- 18
Benchmarks
176 total
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci+14%
240.3 ns211.1 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci+10%
320.3 ns291.1 ns
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+1%
6.2 µs6.1 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci+1%
13.3 µs13.2 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+1%
9.6 µs9.6 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci+1%
4.9 µs4.9 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+1%
5.7 µs5.7 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
6.1 µs6.1 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
6.6 µs6.6 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
6.9 µs6.9 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci0%
8 µs8 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
7.5 µs7.5 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
16.7 µs16.7 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
8.6 µs8.5 µs
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench0%
9.2 µs9.1 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
9.5 µs9.5 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
11.2 µs11.1 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
15.7 µs15.6 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
21 µs20.9 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
44.6 µs44.5 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
32.2 µs32.1 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
33.6 µs33.6 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
120.3 µs120.3 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci0%
79.2 µs79.1 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
160.6 µs160.5 µs
Commits
Click on a commit to change the comparison rangeBase
main
0565866
-18.07%
ci: add explicit mode after action's breaking change
8f962df
5 months ago
by GuillaumeLagrange