Comparing
fix/busy-sleep-time-scale-benches
(e5436a5
) withmain
(550d10f
)-10%
- Improvement
- 3
- Untouched
- 363
- 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
394 total
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs×320
62,315 ns194 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs×58
63.3 µs1.1 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs+62%
162.2 µs100.1 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+49%
1,211 ns815 ns
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+31%
1.6 µs1.2 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-21%
1.6 µs2 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+19%
1,145 ns959 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench-16%
154.4 ns183.6 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench-16%
154.4 ns183.6 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench-16%
154.4 ns183.6 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-15%
2.7 µs3.2 µs
mut_borrow
crates/divan_compat/benches/basic_example.rs+14%
8 ns7 ns
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+14%
3.2 µs2.8 µs
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3-13%
45.6 µs*52.5 µs
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci-13%
45.6 µs*52.5 µs
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3-13%
74.2 µs*85.1 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-13%
7 ns8 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-13%
7 ns8 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-13%
7 ns8 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-13%
7 ns8 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation-13%
7 ns8 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead-10%
36 ns*40 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead-10%
36 ns*40 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking+9%
5.7 µs5.2 µs
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop+9%
51 ns*47 ns
Commits
Click on a commit to change the comparison rangeBase
main
550d10f
-10%
fix(divan): use busy sleep in time scale examples
e5436a5
11 months ago
by GuillaumeLagrange