Comparing
cod-1051-api-validation-error-handling-stdev-is-null-for-divan
(b6a7be8
) withmain
(5caa771
)-87%
- Improvements
- 10
- Regressions
- 10
- Untouched
- 125
- New
- 0
- Dropped
- 0
- Ignored
- 9
Benchmarks
Failed
large_dropRegression
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop::large_drop-8%
169.7 µs
185.2 µs
generate_combinations[6]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[6]-48%
1.3 µs
2.6 µs
generate_combinations[8]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[8]-4%
3.9 µs
4 µs
n_queens_solver[5]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[5]-8%
7.9 µs
8.5 µs
add_two_integers[(0, 0)]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(0, 0)]-6%
5.6 µs
5.9 µs
generate_gray_code[1]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[1]-76%
1 µs
4.3 µs
generate_gray_code[2]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[2]-76%
920 ns
3,802 ns
generate_gray_code[3]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[3]-87%
455 ns
3,629 ns
generate_gray_code[4]Regression
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[4]-75%
911 ns
3,632 ns
sleep_100nsRegression
crates/divan_compat/examples/benches/time_scale.rs::sleep_100ns-4%
55.1 µs
57.6 µs
Improved
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[3]×2.3
2.4 µs
1 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[6]+98%
5.8 µs
2.9 µs
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs::sleep_1ns+51%
57.7 µs
38.1 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[5]+26%
13.4 µs
10.6 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs::sleep_100us+12%
129.4 µs
115.5 µs
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup::large_setup+8%
13 ns
12 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[5]+6%
21.9 µs
20.6 µs
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[4096]+5%
332 ns
317 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[2048]+4%
256 ns
245 ns
instant
crates/divan_compat/examples/benches/time.rs::now::instant+3%
5.1 µs
4.9 µs
Passed
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[2048]+3%
249 ns
242 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[16384]+3%
839 ns
816 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 10]+2%
4.1 µs
4 µs
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[8192]+1%
487 ns
483 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[1]0%
3.6 µs
3.6 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 5]0%
5.9 µs
5.9 µs
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[20]0%
50.4 µs
50.4 µs
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci::Recursive0%
50.4 µs
50.4 µs
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a::sum_fold0%
304 ns
304 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci::Iterative0%
21 ns
21 ns
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[20]0%
21 ns
21 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[21]0%
22 ns
22 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup::small_setup0%
1 ns
1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup::iter_with_setup0%
39 ns
39 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_per_iteration0%
40 ns
40 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_setup0%
40 ns
40 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[1024]0%
79 ns
79 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[1024]0%
79 ns
79 ns
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[10]0%
5.2 µs
5.2 µs
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[4]0%
3.9 µs
3.9 µs
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[4]0%
3.9 µs
3.9 µs
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[1000]0%
1.7 µs
1.7 µs
fibo_10
crates/divan_compat/benches/basic_example.rs::fibo_100%
4.5 µs
4.5 µs
mut_borrow
crates/divan_compat/benches/basic_example.rs::mut_borrow0%
4 µs
4 µs
add
crates/divan_compat/examples/benches/math.rs::add0%
5.4 µs
5.4 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[0]0%
3.4 µs
3.4 µs
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[30]0%
6.6 µs
6.6 µs
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[5]0%
4.3 µs
4.3 µs
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[5]0%
4.1 µs
4.1 µs
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 0]0%
3.7 µs
3.7 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 30]0%
2.8 µs
2.8 µs
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[21]0%
81.5 µs
81.5 µs
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles::fibonacci_custom_measurement0%
407 ns
408 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b::build_vec-2%
212 ns
216 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
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iterN/A
< 1 ns
< 1 ns
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
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_per_iteration0%
40 ns
40 ns
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_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_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_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
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"::"*benchmark/" 'N/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
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
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime::with_input[5]N/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
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[12]+3%
4 µs
3.9 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[5]+2%
4.4 µs
4.3 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[4]+2%
4.6 µs
4.5 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[6]+1%
4.7 µs
4.7 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[6]+1%
22.3 µs
22 µs
system_time
crates/divan_compat/examples/benches/time.rs::now::system_time+1%
5 µs
4.9 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[3]+1%
2.9 µs
2.9 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[4]+1%
1.6 µs
1.6 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[7]+1%
6.4 µs
6.4 µs
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[5]+1%
296.6 µs
295.1 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[8]0%
293.9 ms
292.7 ms
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[7]0%
3.3 µs
3.3 µs
rem
crates/divan_compat/examples/benches/math.rs::rem0%
3.6 µs
3.6 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[10]0%
4 µs
4 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[14]0%
4.1 µs
4.1 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(1024, -1024)]0%
4.2 µs
4.2 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[7]0%
125.6 µs
125.3 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[8]0%
532.3 µs
531.1 µs
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs::sleep_1us0%
58.6 µs
58.5 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[7]0%
248.9 ms
248.7 ms
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[6]0%
66.8 µs
66.7 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[6]0%
68.2 µs
68.2 µs
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[6]0%
8.6 ms
8.6 ms
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs::sleep_1ms0%
1.1 ms
1.1 ms
sort
crates/divan_compat/examples/benches/sort.rs::sorted::sort0%
116.5 µs
116.5 µs
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[10]0%
5.2 µs
5.2 µs
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[4]0%
3.9 µs
3.9 µs
fibo_50
crates/divan_compat/benches/basic_example.rs::fibo_500%
4.5 µs
4.5 µs
print_env_hello
crates/divan_compat/examples/benches/env.rs::print_env_hello0%
2 µs
2 µs
div
crates/divan_compat/examples/benches/math.rs::div0%
3.6 µs
3.6 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[10]0%
4.3 µs
4.3 µs
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[0]0%
4.5 µs
4.5 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 0]0%
4 µs
4 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 30]0%
5.7 µs
5.7 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 5]0%
4.6 µs
4.6 µs
mul
crates/divan_compat/examples/benches/math.rs::mul0%
5.4 µs
5.4 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted::sort_unstable0%
130.5 µs
130.5 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[5]0%
803 ns
803 ns
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[5]0%
5 µs
5 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[16]0%
4 µs
4 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[18]0%
4.1 µs
4.1 µs
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(255, 255)]0%
5 µs
5 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(42, 13)]0%
5 µs
5 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(65535, -65535)]0%
4.8 µs
4.8 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[0]0%
3.5 µs
3.5 µs
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[1024]0%
3.5 µs
3.5 µs
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[255]0%
3.5 µs
3.5 µs
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[42]0%
3.5 µs
3.5 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[65535]0%
3.5 µs
3.5 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[0]0%
5.8 µs
5.8 µs
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[1024]0%
5.8 µs
5.8 µs
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[42]0%
5.8 µs
5.8 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since::tsc (aarch64)0%
1.9 µs
1.9 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now::tsc (aarch64)0%
3.1 µs
3.1 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[30]0%
5.8 ms
5.8 ms
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[1]0%
3.6 µs
3.6 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random::sort_unstable0%
3.3 ms
3.3 ms
sort
crates/divan_compat/examples/benches/sort.rs::random::sort0%
4.8 ms
4.8 ms
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[4]0%
6.8 µs
6.8 µs
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[255]0%
5.8 µs
5.8 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[65535]0%
5.8 µs
5.8 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::sudoku0%
108.7 µs
108.9 µs
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[20]0%
5 µs
5 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 20]0%
3.3 µs
3.3 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[20]0%
47.6 µs
47.8 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[5]0%
5 µs
5 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[7]-1%
2 µs
2 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[5]-1%
1.9 µs
1.9 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[8]-1%
3.8 µs
3.8 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 10]-1%
6.2 µs
6.2 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[3]-1%
2.3 µs
2.3 µs
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[7]-1%
776.7 µs
785.8 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[6]-1%
5.7 µs
5.8 µs
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 20]-2%
3.4 µs
3.5 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[4]-2%
3.8 µs
3.9 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[4]-2%
2.3 µs
2.4 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[9]-2%
4.2 µs
4.3 µs
Ignored
AutoIgnored
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::Auto0%
3 ns
3 ns
FlatIgnored
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::Flat0%
10.1 ms
10.1 ms
LinearIgnored
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::Linear0%
3 ns
3 ns
bench_array1[42]Ignored
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[42]0%
6.6 µs
6.6 µs
bench_array2[42]Ignored
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[42]0%
6.6 µs
6.6 µs
init_array[42]Ignored
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[42]0%
6.6 µs
6.6 µs
recursive[10]Ignored
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[10]0%
6.3 µs
6.3 µs
instantIgnored
crates/divan_compat/examples/benches/time.rs::duration_since::instant0%
5.2 µs
5.2 µs
system_timeIgnored
crates/divan_compat/examples/benches/time.rs::duration_since::system_time-2%
6.6 µs
6.8 µs
Commits
Click on a commit to change the comparison rangeBase
main
5caa771
-87%
fix: stdev calculation for less than 2 runs
b6a7be8
2 months ago
by not-matthias