cod-1441-accept-simulation-as-a-value-instrumentation-which-is-now - Branch - CodSpeedHQ/codspeed-rust

feat: rename instrumentation to simulation

#150Merged

Comparing

cod-1441-accept-simulation-as-a-value-instrumentation-which-is-now

(

9181bce

) with

main

(

03f528f

)

-30%

Untouched: 366

Ignored: 28

Benchmarks

Passed

iter_with_setup

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

+11%

40 ns*36 ns

iter_batched_ref_per_iteration

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

+11%

40 ns*36 ns

from_elem[16384]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

+6%

988 ns*928 ns

count_chars_in_string

crates/divan_compat/examples/benches/counters.rs::chars_counter_examples

+4%

730.3 ns701.1 ns

large_drop

crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop

+4%

808.1 µs*776.8 µs

vec_copy_with_bytes_counter

crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples

+3%

887.5 ns858.3 ns

rat_in_maze[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

5.8 µs5.7 µs

rat_in_maze[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

6.9 µs6.8 µs

rat_in_maze[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

6.2 µs6.1 µs

uppercase_chars_with_counter

crates/divan_compat/examples/benches/counters.rs::chars_counter_examples

+1%

2.1 µs2.1 µs

subset_sum[14]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

4.4 µs4.3 µs

subset_sum[10]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

2.4 µs2.4 µs

hamiltonian_cycle[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

6.4 µs6.3 µs

rat_in_maze[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

6.6 µs6.6 µs

hamiltonian_cycle[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

6.6 µs6.6 µs

hamiltonian_cycle[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

7.2 µs7.2 µs

generate_parentheses[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

17.9 µs17.7 µs

permutations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

33.8 µs33.6 µs

n_queens_solver[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

20.6 µs20.4 µs

graph_coloring[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

5.3 µs5.3 µs

permutations[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

6.3 µs6.2 µs

recursive[20]

crates/divan_compat/examples/benches/math.rs::fibonacci

49.8 µs*49.6 µs

fibonacci_custom_measurement

crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles

410 ns*409 ns

n_queens_solver[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

32 µs31.9 µs

permutations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

184.8 µs184.6 µs

n_queens_solver[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

617.5 µs617.5 µs

permutations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

1.3 ms1.3 ms

sleep_1ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

1.1 ms*1.1 ms

large_drop

crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop

1 ms1 ms

Flat

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

10.1 ms*10.1 ms

sleep_100ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

100.1 ms*100.1 ms

Linear

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

3 ns*3 ns

small_setup

crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup

2 ns*2 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup

36 ns*36 ns

Iterative

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci

21 ns*21 ns

Auto

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

3 ns*3 ns

iter_batched_ref_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

36 ns*36 ns

Iterative[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

21 ns*21 ns

iter_batched_per_iteration

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

36 ns*36 ns

Iterative[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

22 ns*22 ns

sum_fold

crates/criterion_compat/benches/criterion_example.rs::benches::a

305 ns*305 ns

iter_batched_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

36 ns*36 ns

Recursive[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

84.7 µs*84.7 µs

mul

crates/divan_compat/examples/benches/math.rs

2 ns*2 ns

string_copy_with_bytes_counter

crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples

798.1 ns798.1 ns

process_items_with_counter

crates/divan_compat/examples/benches/counters.rs::items_counter_examples

835.8 ns835.8 ns

add

crates/divan_compat/examples/benches/math.rs

91.4 ns91.4 ns

string_processing_multi_counter

crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples

4.5 µs4.5 µs

simulated_processing_cycles

crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples

2 µs2 µs

div

crates/divan_compat/examples/benches/math.rs

124.2 ns124.2 ns

iterative[0]

crates/divan_compat/examples/benches/math.rs::fibonacci

148.3 ns148.3 ns

permutations[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

11.2 µs11.2 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

8.1 µs8.1 µs

iterative[20]

crates/divan_compat/examples/benches/math.rs::fibonacci

206.4 ns206.4 ns

find_highest_set_bit[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

121.1 ns121.1 ns

recursive[0]

crates/divan_compat/examples/benches/math.rs::fibonacci

211.1 ns211.1 ns

find_highest_set_bit[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

121.1 ns121.1 ns

iterative[10]

crates/divan_compat/examples/benches/math.rs::fibonacci

175.8 ns175.8 ns

subset_sum[12]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

4.1 µs4.1 µs

generate_gray_code[2]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

3 µs3 µs

generate_gray_code[3]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

3.6 µs3.6 µs

iterative[30]

crates/divan_compat/examples/benches/math.rs::fibonacci

236.9 ns236.9 ns

generate_gray_code[4]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5.1 µs5.1 µs

recursive[20]

crates/divan_compat/examples/benches/math.rs::fibonacci

79.1 µs79.1 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci

8.3 µs8.3 µs

recursive_memoized[BTreeMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci

6.7 µs6.7 µs

find_highest_set_bit[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

121.1 ns121.1 ns

n_queens_solver[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

160.4 µs160.5 µs

filter_items_with_counter

crates/divan_compat/examples/benches/counters.rs::items_counter_examples

-1%

4.8 µs4.8 µs

generate_gray_code[5]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

-1%

7.8 µs7.9 µs

recursive_memoized[BTreeMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci

-1%

3 µs3 µs

generate_gray_code[1]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

-1%

2.6 µs2.6 µs

hash_computation_cycles

crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples

-5%

512.5 ns541.7 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci

-7%

371.7 ns400.8 ns

instant

crates/divan_compat/examples/benches/time.rs::now

-9%

305.3 ns334.4 ns

tsc (x86)

crates/divan_compat/examples/benches/time.rs::duration_since

N/A

< 1 ns< 1 ns

graph_coloring[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

7 µs6.9 µs

hamiltonian_cycle[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

6.9 µs6.8 µs

recursive_memoized[HashMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci

+1%

13 µs12.9 µs

generate_combinations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

7.5 µs7.4 µs

recursive_memoized[HashMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci

+1%

3.8 µs3.7 µs

generate_combinations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

9.5 µs9.5 µs

subset_sum[18]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

8.2 µs8.1 µs

generate_parentheses[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

9.6 µs9.6 µs

generate_combinations[9]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

21.6 µs21.5 µs

sudoku

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

117.1 µs117.1 µs

generate_combinations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

289.5 µs289.4 µs

sort

crates/divan_compat/examples/benches/sort.rs::sorted

464 µs464 µs

recursive_memoized[HashMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci

8.2 µs8.2 µs

sort_unstable

crates/divan_compat/examples/benches/sort.rs::random

6.5 ms6.5 ms

recursive[30]

crates/divan_compat/examples/benches/math.rs::fibonacci

9.7 ms9.7 ms

system_time

crates/divan_compat/examples/benches/time.rs::now

-9%

305.3 ns334.4 ns

tsc (x86)

crates/divan_compat/examples/benches/time.rs::now

N/A

< 1 ns< 1 ns

recursive[5]

crates/divan_compat/examples/benches/math.rs::fibonacci

291.1 ns291.1 ns

iterative[5]

crates/divan_compat/examples/benches/math.rs::fibonacci

160.6 ns160.6 ns

subset_sum[16]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

7.9 µs7.9 µs

add_two_integers[(1024, -1024)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

241.1 ns241.1 ns

add_two_integers[(255, 255)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

154.4 ns154.4 ns

add_two_integers[(0, 0)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

150.3 ns150.3 ns

count_set_bits[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

128.6 ns128.6 ns

mul

crates/divan_compat/examples/benches/math.rs

91.4 ns91.4 ns

rem

crates/divan_compat/examples/benches/math.rs

124.4 ns124.4 ns

add_two_integers[(42, 13)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

154.4 ns154.4 ns

add_two_integers[(65535, -65535)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

257.8 ns257.8 ns

find_highest_set_bit[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

90 ns90 ns

count_set_bits[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

137.5 ns137.5 ns

sort_unstable

crates/divan_compat/examples/benches/sort.rs::sorted

404.7 µs404.7 µs

count_set_bits[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

123.1 ns123.1 ns

n_queens_solver[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

8.5 µs8.5 µs

knight_tour[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

665.9 µs665.9 µs

count_set_bits[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

120.8 ns120.8 ns

knight_tour[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

661.1 ms661.1 ms

count_set_bits[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

119.2 ns119.2 ns

generate_parentheses[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

120.4 µs120.4 µs

find_highest_set_bit[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

121.1 ns121.1 ns

from_elem[8192]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

11.3 µs11.3 µs

from_elem[4096]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

7.2 µs7.2 µs

from_elem_decimal[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

1.8 µs1.8 µs

knight_tour[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

568.2 ms568.2 ms

knight_tour[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

19 ms19 ms

sort

crates/divan_compat/examples/benches/sort.rs::random

8.1 ms8.1 ms

generate_parentheses[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

45 µs45.1 µs

generate_combinations[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

15.7 µs15.7 µs

graph_coloring[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

5.5 µs5.5 µs

recursive_memoized[HashMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci

-1%

5 µs5 µs

recursive_memoized[BTreeMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci

-1%

2.4 µs2.4 µs

graph_coloring[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-2%

5.3 µs5.4 µs

recursive_memoized[HashMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci

-3%

926.9 ns956.1 ns

iter_with_large_drop

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_batched_ref_small_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_batched_small_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

build_vec

crates/criterion_compat/benches/criterion_example.rs::benches::b

2.8 µs2.8 µs

from_elem[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

1.8 µs1.8 µs

sum_fold

crates/criterion_compat/benches/criterion_example.rs::benches::a

254.7 ns254.7 ns

from_elem[16384]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

19.6 µs19.6 µs

iter_batched_ref_per_iteration

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_with_large_setup

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_batched_per_iteration

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

"*benchmark/" '

crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"

N/A

< 1 ns< 1 ns

iter_batched_large_input

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench

N/A

< 1 ns< 1 ns

from_elem[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

4 µs4 µs

from_elem_decimal[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

4 µs4 µs

bench_without_explicit_measurement

crates/criterion_compat/benches/test_benches.rs::only_codspeed::bench_using_group_without_explicit_measurement::group

N/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

N/A

< 1 ns< 1 ns

bench_explicit_measurement

crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group

N/A

< 1 ns< 1 ns

Iterative[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

132.5 ns132.5 ns

iter_with_large_drop

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

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

N/A

< 1 ns< 1 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime

N/A

< 1 ns< 1 ns

iter_with_large_setup

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

iter_batched_small_input

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

large_setup

crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup

N/A

< 1 ns< 1 ns

Iterative

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci

132.5 ns132.5 ns

iter_batched_ref_per_iteration

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead

N/A

< 1 ns< 1 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup

N/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

N/A

< 1 ns< 1 ns

iter

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

small_setup

crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup

N/A

< 1 ns< 1 ns

fibonacci_custom_measurement

crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles

916.7 ns916.7 ns

iter_batched_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

Recursive[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

80.9 µs80.9 µs

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::nested::bench

N/A

< 1 ns< 1 ns

bench_array1[4]

crates/divan_compat/benches/basic_example.rs::const_bench

+19%

183.6 ns154.4 ns

init_array[4]

crates/divan_compat/benches/basic_example.rs::const_bench

+19%

183.6 ns154.4 ns

bench_array2[4]

crates/divan_compat/benches/basic_example.rs::const_bench

+19%

183.6 ns154.4 ns

bench_array1[10]

crates/divan_compat/benches/basic_example.rs::const_bench

+15%

225 ns195.8 ns

bench_array2[10]

crates/divan_compat/benches/basic_example.rs::const_bench

+15%

225 ns195.8 ns

crates/bencher_compat/benches/bencher_example.rs

+1%

2.3 µs2.2 µs

crates/bencher_compat/benches/bencher_example.rs::c

+1%

2.5 µs2.5 µs

init_array[1000]

crates/divan_compat/benches/basic_example.rs::const_bench

9.1 µs9.1 µs

bench_large_input_local

crates/divan_compat/benches/drop_example.rs

1.5 ms1.5 ms

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

9.7 ms9.7 ms

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

Recursive

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci

80.9 µs80.9 µs

Iterative[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

134.2 ns134.2 ns

bench_array1[1]

crates/divan_compat/benches/basic_example.rs::const_bench

90 ns90 ns

fibo_10

crates/divan_compat/benches/basic_example.rs

119.2 ns119.2 ns

bench_array2[1]

crates/divan_compat/benches/basic_example.rs::const_bench

90 ns90 ns

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

9.7 ms9.7 ms

bench_large_input

crates/divan_compat/benches/drop_example.rs

1.6 ms1.6 ms

fib_in_thread_bench[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

crates/bencher_compat/benches/bencher_example.rs::c

310.3 ns310.3 ns

crates/bencher_compat/benches/bencher_example.rs

310.6 ns310.6 ns

fibo_recursive_cached

crates/codspeed/benches/native.rs

6.5 µs6.5 µs

fibo_recursive

crates/codspeed/benches/native.rs

916.9 ns916.9 ns

sleep_50ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

50.1 ms*50.1 ms

fib_30

crates/divan_compat/benches/fib_example.rs

8.6 ms8.6 ms

sleep_10ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

10.1 ms*10.1 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

9.8 ms9.8 ms

Recursive[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

130.6 µs130.7 µs

Recursive[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

52.5 µs*52.6 µs

Recursive

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci

52.3 µs*52.5 µs

large_setup

crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup

-5%

19 ns*20 ns

from_elem_decimal[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

-7%

256 ns*274 ns

iter

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns*< 1 ns

from_elem[8192]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

-5%

511 ns*537 ns

iter_batched_ref_small_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns*< 1 ns

build_vec

crates/criterion_compat/benches/criterion_example.rs::benches::b

212 ns*212 ns

iter_with_large_drop

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns*< 1 ns

"*benchmark/" '

crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"

N/A

< 1 ns*< 1 ns

permutations[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+32%

1,145 ns*866 ns

sort_unstable

crates/divan_compat/examples/benches/sort.rs::sorted

+19%

130.6 µs*109.9 µs

hamiltonian_cycle[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+5%

983 ns*938 ns

count_chars_in_string

crates/divan_compat/examples/benches/counters.rs::chars_counter_examples

+3%

33 ns*32 ns

generate_parentheses[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+3%

3.2 µs*3.1 µs

iterative[20]

crates/divan_compat/examples/benches/math.rs::fibonacci

+3%

39 ns*38 ns

graph_coloring[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+3%

1.1 µs*1.1 µs

recursive[10]

crates/divan_compat/examples/benches/math.rs::fibonacci

+2%

417 ns*407 ns

permutations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

781.1 µs*762.5 µs

permutations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

67.4 µs*66.7 µs

subset_sum[12]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

1.9 µs*1.9 µs

knight_tour[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

295 µs*294.3 µs

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs

100.1 µs*100.1 µs

hash_computation_cycles

crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples

46 ns*46 ns

add_two_integers[(255, 255)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

20 ns*20 ns

add_two_integers[(42, 13)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

20 ns*20 ns

system_time

crates/divan_compat/examples/benches/time.rs::now

38 ns*38 ns

instant

crates/divan_compat/examples/benches/time.rs::now

38 ns*38 ns

generate_gray_code[4]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

1.1 µs*1.1 µs

div

crates/divan_compat/examples/benches/math.rs

3 ns*3 ns

subset_sum[10]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

989 ns*989 ns

recursive[5]

crates/divan_compat/examples/benches/math.rs::fibonacci

34 ns*34 ns

add

crates/divan_compat/examples/benches/math.rs

2 ns*2 ns

iterative[10]

crates/divan_compat/examples/benches/math.rs::fibonacci

16 ns*16 ns

string_copy_with_bytes_counter

crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples

61 ns*61 ns

subset_sum[14]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

2 µs*2 µs

find_highest_set_bit[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns*5 ns

count_set_bits[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

7 ns*7 ns

sort

crates/divan_compat/examples/benches/sort.rs::random

4.9 ms*4.9 ms

n_queens_solver[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

21.2 µs*21.2 µs

uppercase_chars_with_counter

crates/divan_compat/examples/benches/counters.rs::chars_counter_examples

361 ns*362 ns

knight_tour[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

290 ms*290.9 ms

recursive_memoized[HashMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci

630 ns*632 ns

hamiltonian_cycle[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

905 ns*908 ns

n_queens_solver[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

120.4 µs*120.8 µs

generate_combinations[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

4.8 µs*4.8 µs

process_items_with_counter

crates/divan_compat/examples/benches/counters.rs::items_counter_examples

-2%

62 ns*63 ns

recursive_memoized[BTreeMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci

-2%

2.2 µs*2.3 µs

vec_copy_with_bytes_counter

crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples

-2%

60 ns*61 ns

permutations[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-2%

3.3 µs*3.4 µs

generate_gray_code[1]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

-3%

159 ns*164 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

-4%

185 ns*193 ns

recursive_memoized[BTreeMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci

-4%

581 ns*608 ns

generate_combinations[9]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-10%

5.6 µs*6.2 µs

filter_items_with_counter

crates/divan_compat/examples/benches/counters.rs::items_counter_examples

-30%

802 ns*1,145 ns

tsc (aarch64)

crates/divan_compat/examples/benches/time.rs::duration_since

N/A

< 1 ns*< 1 ns

simulated_processing_cycles

crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples

+50%

1,325 ns*884 ns

system_time

crates/divan_compat/examples/benches/time.rs::duration_since

+8%

13 ns*12 ns

generate_combinations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+6%

1.2 µs*1.2 µs

generate_gray_code[5]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+5%

2.5 µs*2.4 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

+2%

5.1 µs*5.1 µs

slice_into_vec_with_bytes

crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples

-2%

58 ns*59 ns

from_elem[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

-2%

80 ns*82 ns

from_elem[4096]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

-4%

351 ns*366 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench

N/A

< 1 ns*< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::nested::bench

N/A

< 1 ns*< 1 ns

from_elem_decimal[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

-2%

80 ns*82 ns

from_elem[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

-6%

246 ns*261 ns

bench_explicit_measurement

crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group

N/A

< 1 ns*< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime

N/A

< 1 ns*< 1 ns

iter_with_large_setup

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/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

-13%

46 ns*53 ns

iter_batched_small_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns*< 1 ns

graph_coloring[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+5%

2.1 µs*2 µs

permutations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+5%

12.3 µs*11.8 µs

generate_combinations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

2.6 µs*2.5 µs

rat_in_maze[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

839 ns*824 ns

generate_parentheses[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

22.7 µs*22.4 µs

graph_coloring[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

1.1 µs*1.1 µs

subset_sum[18]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

4.1 µs*4.1 µs

graph_coloring[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

986 ns*977 ns

recursive_memoized[HashMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci

+1%

6.5 µs*6.4 µs

generate_gray_code[2]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

297 ns*296 ns

subset_sum[16]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

3.9 µs*3.9 µs

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

1.1 µs*1.1 µs

knight_tour[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

8.6 ms*8.6 ms

sort

crates/divan_compat/examples/benches/sort.rs::sorted

118.9 µs*118.7 µs

recursive[30]

crates/divan_compat/examples/benches/math.rs::fibonacci

6.2 ms*6.1 ms

fib_in_thread_bench[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

1.1 ms*1.1 ms

knight_tour[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

247.8 ms*247.7 ms

bench_large_input

crates/divan_compat/benches/drop_example.rs

50.5 ms50.5 ms

bench_large_input_local

crates/divan_compat/benches/drop_example.rs

50.4 ms50.4 ms

generate_gray_code[3]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

584 ns*584 ns

find_highest_set_bit[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns*5 ns

add_two_integers[(0, 0)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns*5 ns

count_set_bits[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

7 ns*7 ns

add_two_integers[(1024, -1024)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

67 ns*67 ns

generate_combinations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

1.8 µs*1.8 µs

count_set_bits[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

7 ns*7 ns

tsc (aarch64)

crates/divan_compat/examples/benches/time.rs::now

3 ns*3 ns

n_queens_solver[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

2.1 µs*2.1 µs

find_highest_set_bit[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns*5 ns

count_set_bits[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

7 ns*7 ns

find_highest_set_bit[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns*5 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci

14 ns*14 ns

iterative[30]

crates/divan_compat/examples/benches/math.rs::fibonacci

51 ns*51 ns

add_two_integers[(65535, -65535)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

75 ns*75 ns

iterative[0]

crates/divan_compat/examples/benches/math.rs::fibonacci

1 ns*1 ns

find_highest_set_bit[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns*5 ns

rem

crates/divan_compat/examples/benches/math.rs

3 ns*3 ns

instant

crates/divan_compat/examples/benches/time.rs::duration_since

10 ns*10 ns

count_set_bits[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

7 ns*7 ns

recursive_memoized[HashMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci

16 ns*16 ns

fib_10

crates/divan_compat/benches/fib_example.rs

375 ns375 ns

bench_array2[1]

crates/divan_compat/benches/basic_example.rs::const_bench

1 ns1 ns

init_array[1000]

crates/divan_compat/benches/basic_example.rs::const_bench

2.1 µs2.1 µs

bench_array1[10]

crates/divan_compat/benches/basic_example.rs::const_bench

9 ns9 ns

fib_20

crates/divan_compat/benches/fib_example.rs

45.6 µs45.6 µs

fibo_50

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

fibo_10

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

bench_array2[10]

crates/divan_compat/benches/basic_example.rs::const_bench

9 ns9 ns

bench_array1[1]

crates/divan_compat/benches/basic_example.rs::const_bench

1 ns1 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

8 ns8 ns

slice_into_vec_with_bytes

crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples

671.9 ns671.9 ns

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

50.1 ms50.1 ms

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

10.1 ms10.1 ms

sort_unstable

crates/divan_compat/examples/benches/sort.rs::random

3.3 ms*3.3 ms

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

fib_30

crates/divan_compat/benches/fib_example.rs

5.6 ms5.6 ms

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

1.1 ms1.1 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

6.7 ms6.7 ms

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

6.7 ms6.8 ms

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

6.7 ms6.8 ms

generate_parentheses[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

7.9 µs*7.9 µs

generate_parentheses[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

68.9 µs*69.1 µs

hamiltonian_cycle[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

1.1 µs*1.1 µs

n_queens_solver[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

8.1 µs*8.2 µs

n_queens_solver[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

506.8 µs*509.5 µs

recursive_memoized[HashMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci

-1%

1.8 µs*1.8 µs

hamiltonian_cycle[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

749 ns*755 ns

sudoku

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

109.4 µs*110.4 µs

recursive_memoized[HashMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci

-1%

3.8 µs*3.8 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci

-1%

3.3 µs*3.4 µs

bench_array1[42]

crates/divan_compat/benches/basic_example.rs::const_bench

-2%

47 ns48 ns

bench_array2[42]

crates/divan_compat/benches/basic_example.rs::const_bench

-2%

47 ns48 ns

init_array[42]

crates/divan_compat/benches/basic_example.rs::const_bench

-2%

47 ns48 ns

string_processing_multi_counter

crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples

-3%

372 ns*382 ns

recursive_memoized[BTreeMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci

-5%

209 ns*221 ns

process_with_multiple_counters

crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples

-8%

45 ns*49 ns

iterative[5]

crates/divan_compat/examples/benches/math.rs::fibonacci

-13%

7 ns*8 ns

bench_array2[4]

crates/divan_compat/benches/basic_example.rs::const_bench

-25%

3 ns4 ns

init_array[4]

crates/divan_compat/benches/basic_example.rs::const_bench

-25%

3 ns4 ns

bench_array1[4]

crates/divan_compat/benches/basic_example.rs::const_bench

-25%

3 ns4 ns

iter_batched_per_iteration

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_batched_ref_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

953.3 ns953.3 ns

fibo_50

crates/divan_compat/benches/basic_example.rs

90.3 ns90.3 ns

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

fibo_iterative

crates/codspeed/benches/native.rs

126.9 ns126.9 ns

fib_20

crates/divan_compat/benches/fib_example.rs

70 µs70 µs

fib_10

crates/divan_compat/benches/fib_example.rs

-3%

830.6 ns859.7 ns

process_with_multiple_counters

crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples

-5%

611.7 ns640.8 ns

Ignored

rat_in_maze[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

Ignored

+14%

1.2 µs*1 µs

recursive[0]

crates/divan_compat/examples/benches/math.rs::fibonacci

Ignored

1 ns*1 ns

rat_in_maze[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

Ignored

+53%

1,103 ns*719 ns

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

88 ns*88 ns

rat_in_maze[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

Ignored

+1%

935 ns*929 ns

recursive[10]

crates/divan_compat/examples/benches/math.rs::fibonacci

Ignored

-3%

903.3 ns932.5 ns

system_time

crates/divan_compat/examples/benches/time.rs::duration_since

Ignored

-14%

346.7 ns405 ns

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

Ignored

536.9 ns536.9 ns

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs

Ignored

+5%

579.4 ns550.3 ns

instant

crates/divan_compat/examples/benches/time.rs::duration_since

Ignored

+9%

345.3 ns316.1 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

+5%

579.4 ns550.3 ns

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

+5%

579.4 ns550.3 ns

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

Ignored

+5%

579.4 ns550.3 ns

Flat

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

Ignored

+5%

595.3 ns566.1 ns

Auto

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

Ignored

215.3 ns215.3 ns

Linear

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

Ignored

215.3 ns215.3 ns

sleep_100ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

Ignored

-5%

566.1 ns595.3 ns

sleep_50ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

Ignored

-5%

566.1 ns595.3 ns

sleep_10ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

Ignored

-5%

566.1 ns595.3 ns

sleep_1ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

Ignored

-5%

566.1 ns595.3 ns

bench_array1[42]

crates/divan_compat/benches/basic_example.rs::const_bench

Ignored

+7%

838.9 ns780.6 ns

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

+5%

595.3 ns566.1 ns

init_array[42]

crates/divan_compat/benches/basic_example.rs::const_bench

Ignored

+7%

838.9 ns780.6 ns

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

+5%

595.3 ns566.1 ns

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

+5%

595.3 ns566.1 ns

bench_array2[42]

crates/divan_compat/benches/basic_example.rs::const_bench

Ignored

+7%

838.9 ns780.6 ns

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

Ignored

+5%

595.3 ns566.1 ns

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

+5%

595.3 ns566.1 ns

Commits

Click on a commit to change the comparison range

Base

main

03f528f

-32.66%

feat: rename instrumentation to simulation `instrumentation` is still accepted as an input, but it maps to simulation internally, as we plan to phase it out.

8e5ffb4

22 days ago

by GuillaumeLagrange

+2.71%

ci: stop using @moonrepo/setup-rust for cache

9181bce

18 days ago

by GuillaumeLagrange

Home Terms Privacy Docs