Comparing
cod-2186-warn-users-when-the-linked-libraries-is-not-the-same
(d251e73
) withmain
(8637676
)-99%
- Improvement
- 16
- Regression
- 9
- Untouched
- 550
- 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
603 total
fibo_10
crates/divan_compat/benches/basic_example.rs-99%
1 ns71 ns
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-44%
908 ns*1,631 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-24%
90 ns119.2 ns
fibo_10
crates/divan_compat/benches/basic_example.rs-24%
90 ns119.2 ns
div
crates/divan_compat/examples/benches/math.rs-23%
95 ns124.2 ns
rem
crates/divan_compat/examples/benches/math.rs-23%
95.3 ns124.4 ns
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci-5%
2.4 µs2.5 µs
string_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples-3%
826.4 ns855.6 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-3%
2.6 µs2.6 µs
slice_into_vec_with_bytes
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples+81%
94 ns*52 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+34%
1.5 µs*1.1 µs
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench+32%
119.2 ns90 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench+32%
119.2 ns90 ns
string_processing_multi_counter
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples+25%
4.5 µs3.6 µs
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup+22%
44 ns*36 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead+22%
44 ns*36 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead+10%
44 ns*40 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead+10%
44 ns*40 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+7%
17.8 µs16.6 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation+5%
3.7 µs3.5 µs
fib_10
crates/divan_compat/benches/fib_example.rs+5%
404 ns386 ns
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+4%
5.4 µs5.2 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+4%
7 µs6.8 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+4%
2.4 µs2.4 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+3%
6.9 µs6.7 µs
Commits
Click on a commit to change the comparison rangeBase
main
8637676
-98.59%
chore: update submodule
d251e73
6 months ago
by GuillaumeLagrange