Comparing
feat/no-benchmarks-message
(8923641
) withmain
(d71bcc0
)-66%
- Improvement
- 2
- Regression
- 5
- Untouched
- 337
- Ignored
- 28
Some benchmarks measured no execution time
Nothing ran under measurement, usually because the compiler removed the code under test. These results are not comparable, so they count as unchanged.Preventing compiler optimizationsBenchmarks
372 total
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop+6%
832.3 µs783.1 µs
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation+6%
1.2 µs1.1 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+5%
1.9 µs1.8 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-5%
17.6 µs18.5 µs
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation+4%
293 ns282 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-4%
3 µs3.2 µs
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem-3%
524 ns542 ns
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+3%
788 ns764 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci+3%
958.3 ns929.2 ns
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation+2%
575 ns561 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci-2%
584 ns597 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop+2%
50 ns49 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-2%
2.4 µs2.4 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci-1%
6.4 µs6.5 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+1%
4 µs3.9 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-1%
968 ns980 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench-1%
2.1 µs2.1 µs
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs+1%
1.1 ms1.1 ms
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci+1%
3 µs3 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-1%
3 µs3 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-1%
1.1 µs1.1 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-1%
119.6 µs120.5 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-1%
824 ns830 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs+1%
5.1 µs5.1 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+1%
22.6 µs22.5 µs
Commits
Click on a commit to change the comparison rangeBase
main
d71bcc0
-65.9%
feat(cargo-codspeed): add explicit mode with command when no benchmarks are found in run
8923641
1 year ago
by adriencaccia