Comparing
staging-test
(9f7a0c9
) withmain
(4be2e55
)-12%
- Improvements
- 3
- Regressions
- 6
- Untouched
- 158
- Ignored
- 9
Benchmarks
Failed
mut_borrowRegression
crates/divan_compat/benches/basic_example.rs::mut_borrow-3%
895 ns924.2 ns
recursive[0]Regression
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[0]-12%
211.1 ns240.3 ns
recursive[5]Regression
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[5]-9%
291.1 ns320.3 ns
instantRegression
crates/divan_compat/examples/benches/time.rs::now::instant-8%
334.4 ns363.6 ns
recursive_memoized[HashMap<u64, u64>, 0]Regression
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 0]-3%
929.2 ns958.3 ns
system_timeRegression
crates/divan_compat/examples/benches/time.rs::now::system_time-8%
334.4 ns363.6 ns
Improved
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[4]+19%
183.6 ns154.4 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[4]+19%
183.6 ns154.4 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[4]+19%
183.6 ns154.4 ns
Passed
b
crates/bencher_compat/benches/bencher_example.rs::b+1%
2.3 µs2.2 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[10]+1%
2.4 µs2.3 µs
b
crates/bencher_compat/benches/bencher_example.rs::c::b+1%
2.5 µs2.5 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[5]+1%
5.7 µs5.7 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[7]0%
6.6 µs6.6 µs
print_env_hello
crates/divan_compat/examples/benches/env.rs::print_env_hello0%
7.9 µs7.9 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[8]0%
6.9 µs6.9 µs
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[1]0%
90 ns90 ns
fibo_50
crates/divan_compat/benches/basic_example.rs::fibo_500%
119.4 ns119.4 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[1000]0%
9.2 µs9.2 µs
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[1]0%
90 ns90 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[10]0%
254.2 ns254.2 ns
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[10]0%
254.2 ns254.2 ns
fibo_10
crates/divan_compat/benches/basic_example.rs::fibo_100%
90 ns90 ns
fibo_recursive
crates/codspeed/benches/native.rs::fibo_recursive0%
916.9 ns916.9 ns
fibo_iterative
crates/codspeed/benches/native.rs::fibo_iterative0%
126.9 ns126.9 ns
a
crates/bencher_compat/benches/bencher_example.rs::c::a0%
310.3 ns310.3 ns
a
crates/bencher_compat/benches/bencher_example.rs::a0%
310.6 ns310.6 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[0]0%
119.2 ns119.2 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[1024]0%
121.1 ns121.1 ns
add
crates/divan_compat/examples/benches/math.rs::add0%
120.6 ns120.6 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[10]0%
175.8 ns175.8 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[20]0%
206.4 ns206.4 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[30]0%
236.9 ns236.9 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[6]0%
32.2 µs32.2 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[0]0%
119.2 ns119.2 ns
div
crates/divan_compat/examples/benches/math.rs::div0%
95 ns95 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[5]0%
160.6 ns160.6 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[1]0%
2.6 µs2.6 µs
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[4]0%
4.9 µs4.9 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[65535]0%
121.1 ns121.1 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[255]0%
121.1 ns121.1 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[12]0%
4 µs4 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[8]0%
617.6 µs617.6 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[6]0%
184.8 µs184.8 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[7]0%
160.5 µs160.6 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[4]0%
11.1 µs11.2 µs
fibo_recursive_cached
crates/codspeed/benches/native.rs::fibo_recursive_cached0%
6.5 µs6.5 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[3]0%
6.2 µs6.2 µs
tsc (x86)
crates/divan_compat/examples/benches/time.rs::duration_since::tsc (x86)N/A
< 1 ns< 1 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[14]+1%
4.3 µs4.3 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[5]+1%
5.2 µs5.1 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[4]+1%
5.4 µs5.4 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[6]0%
6.2 µs6.1 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[4]0%
6.3 µs6.3 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[6]0%
6.9 µs6.9 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[18]0%
8.1 µs8.1 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::sudoku0%
117.1 µs117.1 µs
sort
crates/divan_compat/examples/benches/sort.rs::random::sort0%
8.1 ms8.1 ms
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[42]0%
121.1 ns121.1 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[2]0%
2.9 µs2.9 µs
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 0]0%
400.8 ns400.8 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 10]0%
3 µs3 µs
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 20]0%
6.6 µs6.6 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[5]0%
7.7 µs7.7 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs::sleep_100us0%
536.9 ns536.9 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs::sleep_1ms0%
536.9 ns536.9 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs::sleep_100ns0%
536.9 ns536.9 ns
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 5]0%
2.4 µs2.4 µs
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs::sleep_1us0%
536.9 ns536.9 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 30]0%
8.2 µs8.2 µs
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs::sleep_1ns0%
536.9 ns536.9 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[16]0%
7.8 µs7.8 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[5]0%
33.6 µs33.6 µs
rem
crates/divan_compat/examples/benches/math.rs::rem0%
95.3 ns95.3 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(255, 255)]0%
154.4 ns154.4 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[1024]0%
120.8 ns120.8 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[0]0%
119.2 ns119.2 ns
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(65535, -65535)]0%
257.8 ns257.8 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(0, 0)]0%
121.1 ns121.1 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[42]0%
123.1 ns123.1 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(1024, -1024)]0%
241.1 ns241.1 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[7]0%
1.3 ms1.3 ms
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[30]0%
9.7 ms9.7 ms
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[20]0%
79.1 µs79.2 µs
tsc (x86)
crates/divan_compat/examples/benches/time.rs::now::tsc (x86)N/A
< 1 ns< 1 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[3]+1%
7 µs6.9 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[7]+1%
7.2 µs7.1 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[6]+1%
5.2 µs5.2 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[5]0%
6.6 µs6.5 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[7]0%
289.4 µs289.4 µs
mul
crates/divan_compat/examples/benches/math.rs::mul0%
120.6 ns120.6 ns
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(42, 13)]0%
154.4 ns154.4 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[65535]0%
137.5 ns137.5 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[6]0%
19 ms19 ms
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[255]0%
128.6 ns128.6 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[4]0%
8.6 µs8.6 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted::sort_unstable0%
404.7 µs404.7 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[5]0%
21 µs21 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[8]0%
661.1 ms661.1 ms
sort
crates/divan_compat/examples/benches/sort.rs::sorted::sort0%
464 µs464 µs
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[5]0%
665.9 µs665.9 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[3]0%
3.6 µs3.6 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[7]0%
568.2 ms568.2 ms
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[9]0%
21.6 µs21.6 µs
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a::sum_fold0%
254.7 ns254.7 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b::build_vec0%
2.8 µs2.8 µs
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[1024]0%
1.9 µs1.9 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random::sort_unstable0%
6.5 ms6.5 ms
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[6]0%
120.3 µs120.3 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[5]0%
44.6 µs44.6 µs
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[16384]0%
19.6 µs19.7 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[4]0%
16.7 µs16.7 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[8]0%
15.6 µs15.7 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[3]0%
9.6 µs9.6 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[6]0%
9.5 µs9.5 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[5]0%
7.5 µs7.5 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 5]-1%
3.6 µs3.6 µs
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_small_inputN/A
< 1 ns< 1 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_ref_large_inputN/A
< 1 ns< 1 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_per_iterationN/A
< 1 ns< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iterN/A
< 1 ns< 1 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[4096]0%
7.2 µs7.3 µs
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_per_iterationN/A
< 1 ns< 1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_setupN/A
< 1 ns< 1 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_large_dropN/A
< 1 ns< 1 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_large_setupN/A
< 1 ns< 1 ns
sleep_100ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks::sleep_100ms0%
536.9 ns536.9 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[1024]0%
1.9 µs1.9 µs
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[8192]0%
11.4 µs11.4 µs
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[2048]-1%
4.1 µs4.1 µs
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[2048]-1%
4.1 µs4.1 µs
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_small_inputN/A
< 1 ns< 1 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_ref_per_iterationN/A
< 1 ns< 1 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_with_large_setupN/A
< 1 ns< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench::with_input[5]N/A
< 1 ns< 1 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_ref_small_inputN/A
< 1 ns< 1 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[21]0%
134.2 ns134.2 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci::Iterative0%
132.5 ns132.5 ns
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_small_inputN/A
< 1 ns< 1 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group::bench_explicit_measurementN/A
< 1 ns< 1 ns
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[20]0%
80.9 µs80.9 µs
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime::with_input[5]N/A
< 1 ns< 1 ns
bench_without_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::only_codspeed::bench_using_group_without_explicit_measurement::group::bench_without_explicit_measurementN/A
< 1 ns< 1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_with_setupN/A
< 1 ns< 1 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci::Recursive0%
80.9 µs80.9 µs
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_with_large_dropN/A
< 1 ns< 1 ns
sleep_10ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks::sleep_10ms0%
536.9 ns536.9 ns
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup::large_setupN/A
< 1 ns< 1 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_large_inputN/A
< 1 ns< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench::with_input[5]N/A
< 1 ns< 1 ns
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[20]0%
132.5 ns132.5 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup::small_setupN/A
< 1 ns< 1 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles::fibonacci_custom_measurement0%
945.8 ns945.8 ns
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop::large_drop0%
1 ms1 ms
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_large_inputN/A
< 1 ns< 1 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop::small_dropN/A
< 1 ns< 1 ns
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"::"*benchmark/" 'N/A
< 1 ns< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iterN/A
< 1 ns< 1 ns
sleep_1ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks::sleep_1ms0%
536.9 ns536.9 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup::iter_with_setupN/A
< 1 ns< 1 ns
sleep_50ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks::sleep_50ms0%
536.9 ns536.9 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[21]0%
130.6 µs130.7 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 10]0%
4.9 µs4.9 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 30]-1%
13.2 µs13.3 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 20]-1%
8 µs8.1 µs
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_large_inputN/A
< 1 ns< 1 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_per_iterationN/A
< 1 ns< 1 ns
Ignored
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[42]Ignored
+4%
809.7 ns780.6 ns
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[42]Ignored
+4%
809.7 ns780.6 ns
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[42]Ignored
+4%
809.7 ns780.6 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since::system_timeIgnored
-8%
317.5 ns346.7 ns
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[10]Ignored
-3%
903.3 ns932.5 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since::instantIgnored
0%
345.3 ns345.3 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::LinearIgnored
0%
186.1 ns186.1 ns
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::AutoIgnored
0%
186.1 ns186.1 ns
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::FlatIgnored
0%
536.9 ns536.9 ns
Commits
Click on a commit to change the comparison rangeBase
main
4be2e55
-12.14%
temp: test with new runner on staging
d5d8014
2 days ago
by not-matthias0%
temp: old runner with old integration
9f7a0c9
2 days ago
by not-matthias