fix/busy-sleep-time-scale-benches - Branch - CodSpeedHQ/codspeed-rust

fix(divan): use busy sleep in time scale examples

#149Merged

Comparing

fix/busy-sleep-time-scale-benches

(

e5436a5

) with

main

(

550d10f

)

-10%

Improvements: 3

Untouched: 363

Ignored: 28

Benchmarks

Improved

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

Passed

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

generate_combinations[5]

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

+19%

1,145 ns959 ns

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

generate_combinations[9]

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

+9%

5.7 µs5.2 µs

from_elem[8192]

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

+7%

544 ns*507 ns

generate_parentheses[4]

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

+7%

7.9 µs7.4 µs

large_setup

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

+7%

16 ns*15 ns

from_elem[4096]

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

+6%

350 ns*330 ns

hamiltonian_cycle[7]

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

+5%

1.1 µs1 µs

subset_sum[18]

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

+4%

4.3 µs4.1 µs

permutations[7]

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

+3%

787.5 µs765.6 µs

filter_items_with_counter

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

+3%

814 ns792 ns

recursive_memoized[BTreeMap<u64, u64>, 30]

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

+3%

3.4 µs3.4 µs

permutations[6]

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

+2%

68.4 µs66.9 µs

generate_gray_code[2]

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

+2%

302 ns296 ns

recursive[10]

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

+2%

416 ns409 ns

process_items_with_counter

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

+2%

63 ns62 ns

recursive_memoized[BTreeMap<u64, u64>, 20]

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

+2%

2.3 µs2.2 µs

permutations[5]

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

+1%

12 µs11.9 µs

recursive_memoized[HashMap<u64, u64>, 30]

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

+1%

13 µs12.9 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

+1%

8.2 µs8.1 µs

subset_sum[12]

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

+1%

4.1 µs4.1 µs

subset_sum[14]

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

+1%

4.4 µs4.4 µs

generate_parentheses[5]

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

+1%

22.6 µs22.5 µs

generate_gray_code[5]

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

+1%

2.4 µs2.4 µs

subset_sum[16]

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

7.9 µs7.9 µs

subset_sum[18]

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

8.2 µs8.2 µs

generate_gray_code[4]

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

1.1 µs1.1 µs

fib_10

crates/divan_compat/benches/fib_example.rs

375 ns374 ns

generate_parentheses[6]

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

69.1 µs68.9 µs

sudoku

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

109.8 µs109.6 µs

recursive_memoized[HashMap<u64, u64>, 20]

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

8.2 µs8.2 µs

knight_tour[6]

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

8.6 ms8.6 ms

recursive_memoized[HashMap<u64, u64>, 10]

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

5 µs5 µs

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

6.8 ms6.7 ms

recursive[20]

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

49.7 µs49.6 µs

n_queens_solver[8]

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

507.8 µs507.6 µs

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

1.1 ms1.1 ms

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

fib_20

crates/divan_compat/benches/fib_example.rs

45.6 µs45.6 µs

bench_large_input

crates/divan_compat/benches/drop_example.rs

50.5 ms50.5 ms

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

bench_large_input_local

crates/divan_compat/benches/drop_example.rs

50.4 ms50.4 ms

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

6.7 ms6.7 ms

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

50.1 ms50.1 ms

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

sort_unstable

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

6.5 ms6.5 ms

sleep_100ms

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

100.1 ms*100.1 ms

knight_tour[6]

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

19 ms19 ms

knight_tour[8]

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

661.1 ms661.1 ms

Linear

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

3 ns*3 ns

add_two_integers[(255, 255)]

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

20 ns20 ns

div

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

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

14 ns14 ns

recursive_memoized[HashMap<u64, u64>, 10]

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

1.8 µs1.8 µs

mul

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

iterative[5]

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

7 ns7 ns

instant

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

10 ns10 ns

count_chars_in_string

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

33 ns33 ns

iterative[0]

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

1 ns1 ns

graph_coloring[4]

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

977 ns977 ns

add_two_integers[(42, 13)]

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

20 ns20 ns

recursive_memoized[HashMap<u64, u64>, 20]

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

3.8 µs3.8 µs

process_with_multiple_counters

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

45 ns45 ns

recursive_memoized[BTreeMap<u64, u64>, 10]

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

596 ns596 ns

subset_sum[12]

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

1.9 µs1.9 µs

find_highest_set_bit[0]

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

5 ns5 ns

recursive[5]

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

34 ns34 ns

add_two_integers[(65535, -65535)]

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

75 ns75 ns

find_highest_set_bit[255]

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

5 ns5 ns

add_two_integers[(1024, -1024)]

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

67 ns67 ns

iterative[20]

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

39 ns39 ns

instant

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

38 ns38 ns

subset_sum[14]

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

2 µs2 µs

find_highest_set_bit[42]

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

5 ns5 ns

iterative[10]

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

16 ns16 ns

add_two_integers[(0, 0)]

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

5 ns5 ns

string_copy_with_bytes_counter

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

61 ns61 ns

find_highest_set_bit[1024]

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

5 ns5 ns

subset_sum[16]

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

3.9 µs3.9 µs

simulated_processing_cycles

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

1.3 µs1.3 µs

permutations[4]

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

3.6 µs3.6 µs

hash_computation_cycles

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

46 ns46 ns

rem

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

slice_into_vec_with_bytes

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

59 ns59 ns

add

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

system_time

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

13 ns13 ns

tsc (aarch64)

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

3 ns3 ns

system_time

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

38 ns38 ns

recursive_memoized[HashMap<u64, u64>, 0]

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

16 ns16 ns

find_highest_set_bit[65535]

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

5 ns5 ns

recursive_memoized[BTreeMap<u64, u64>, 5]

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

221 ns221 ns

uppercase_chars_with_counter

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

361 ns361 ns

fibo_50

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

bench_array2[1]

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

1 ns1 ns

bench_array1[4]

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

3 ns3 ns

fibo_10

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

bench_array2[42]

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

47 ns47 ns

init_array[4]

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

3 ns3 ns

init_array[42]

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

47 ns47 ns

bench_array1[10]

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

9 ns9 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

init_array[1000]

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

2.1 µs2.1 µs

bench_array1[42]

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

47 ns47 ns

bench_array2[4]

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

3 ns3 ns

slice_into_vec_with_bytes

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

671.9 ns671.9 ns

string_copy_with_bytes_counter

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

798.1 ns798.1 ns

count_chars_in_string

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

730.3 ns730.3 ns

vec_copy_with_bytes_counter

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

887.5 ns887.5 ns

uppercase_chars_with_counter

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

2.1 µs2.1 µs

simulated_processing_cycles

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

2 µs2 µs

hash_computation_cycles

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

541.7 ns541.7 ns

filter_items_with_counter

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

4.8 µs4.8 µs

process_items_with_counter

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

835.8 ns835.8 ns

iterative[20]

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

206.4 ns206.4 ns

iterative[30]

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

236.9 ns236.9 ns

process_with_multiple_counters

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

611.7 ns611.7 ns

recursive[0]

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

211.1 ns211.1 ns

recursive[30]

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

9.7 ms9.7 ms

recursive[20]

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

79.1 µs79.1 µs

add

crates/divan_compat/examples/benches/math.rs

91.4 ns91.4 ns

recursive[5]

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

291.1 ns291.1 ns

div

crates/divan_compat/examples/benches/math.rs

124.2 ns124.2 ns

iterative[10]

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

175.8 ns175.8 ns

recursive_memoized[BTreeMap<u64, u64>, 10]

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

3 µs3 µs

recursive_memoized[BTreeMap<u64, u64>, 5]

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

2.4 µs2.4 µs

iterative[0]

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

119.2 ns119.2 ns

iterative[5]

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

160.6 ns160.6 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

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

400.8 ns400.8 ns

recursive_memoized[HashMap<u64, u64>, 5]

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

3.7 µs3.7 µs

recursive_memoized[HashMap<u64, u64>, 0]

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

926.9 ns926.9 ns

recursive_memoized[BTreeMap<u64, u64>, 20]

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

6.7 µs6.7 µs

add_two_integers[(1024, -1024)]

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

241.1 ns241.1 ns

recursive_memoized[BTreeMap<u64, u64>, 30]

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

8.3 µs8.3 µs

add_two_integers[(255, 255)]

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

rem

crates/divan_compat/examples/benches/math.rs

124.4 ns124.4 ns

sort_unstable

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

404.7 µs404.7 µs

count_set_bits[0]

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

90 ns90 ns

add_two_integers[(0, 0)]

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

150.3 ns150.3 ns

add_two_integers[(42, 13)]

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

154.4 ns154.4 ns

sort

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

464.1 µs464.1 µs

mul

crates/divan_compat/examples/benches/math.rs

91.4 ns91.4 ns

count_set_bits[1024]

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

120.8 ns120.8 ns

generate_combinations[6]

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

9.6 µs9.6 µs

generate_combinations[5]

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

7.5 µs7.5 µs

count_set_bits[255]

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

128.6 ns128.6 ns

count_set_bits[42]

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

123.1 ns123.1 ns

find_highest_set_bit[255]

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

121.1 ns121.1 ns

generate_combinations[8]

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

15.7 µs15.7 µs

find_highest_set_bit[0]

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

90 ns90 ns

find_highest_set_bit[1024]

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

121.1 ns121.1 ns

generate_gray_code[5]

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

7.8 µs7.8 µs

generate_gray_code[3]

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

3.6 µs3.6 µs

count_set_bits[65535]

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

137.5 ns137.5 ns

generate_combinations[9]

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

21.6 µs21.6 µs

find_highest_set_bit[65535]

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

121.1 ns121.1 ns

graph_coloring[4]

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

5.5 µs5.5 µs

generate_gray_code[2]

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

3 µs3 µs

generate_gray_code[1]

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

2.6 µs2.6 µs

generate_gray_code[4]

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

5.1 µs5.1 µs

find_highest_set_bit[42]

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

121.1 ns121.1 ns

graph_coloring[5]

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

5.3 µs5.3 µs

system_time

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

305.3 ns305.3 ns

graph_coloring[6]

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

5.4 µs5.4 µs

knight_tour[5]

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

665.9 µs665.9 µs

knight_tour[7]

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

568.2 ms568.2 ms

instant

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

305.3 ns305.3 ns

string_processing_multi_counter

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

4.5 µs4.5 µs

permutations[4]

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

11.2 µs11.2 µs

sort

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

8.1 ms8.1 ms

generate_combinations[7]

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

289.5 µs289.5 µs

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

10.1 ms10.1 ms

permutations[7]

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

1.3 ms1.3 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

6.7 ms6.7 ms

n_queens_solver[8]

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

617.5 µs617.5 µs

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

knight_tour[7]

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

248 ms248.1 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

n_queens_solver[7]

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

160.4 µs160.4 µs

fib_in_thread_bench[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

generate_parentheses[6]

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

120.4 µs120.4 µs

sudoku

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

117.1 µs117.1 µs

recursive[30]

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

6.1 ms6.1 ms

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

1.1 ms1.1 ms

knight_tour[8]

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

291.3 ms291.5 ms

sort_unstable

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

130.6 µs130.7 µs

generate_parentheses[5]

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

45 µs45 µs

sort_unstable

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

3.3 ms3.3 ms

n_queens_solver[5]

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

20.5 µs20.6 µs

generate_parentheses[4]

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

17.8 µs17.8 µs

fib_30

crates/divan_compat/benches/fib_example.rs

5.6 ms5.6 ms

sort

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

118.6 µs118.9 µs

sort

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

4.9 ms4.9 ms

graph_coloring[5]

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

1.1 µs1.1 µs

subset_sum[10]

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

992 ns995 ns

generate_parentheses[3]

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

9.5 µs9.6 µs

knight_tour[5]

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

295.8 µs296.8 µs

hamiltonian_cycle[7]

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

7.2 µs7.2 µs

large_drop

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

808.5 µs*811.8 µs

iter_with_large_setup

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

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

from_elem_decimal[2048]

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

+5%

264 ns*252 ns

fibonacci_custom_measurement

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

+2%

421 ns*411 ns

from_elem[16384]

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

+2%

934 ns*914 ns

graph_coloring[6]

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

1.1 µs1.1 µs

Iterative[21]

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

22 ns*22 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

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

from_elem[1024]

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

83 ns*83 ns

Iterative

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

21 ns*21 ns

iter_batched_ref_large_input

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

36 ns*36 ns

iter_with_setup

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

36 ns*36 ns

Auto

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

3 ns*3 ns

sleep_10ms

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

10.1 ms*10.1 ms

sleep_1ms

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

1.1 ms*1.1 ms

sum_fold

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

304 ns*305 ns

iter_batched_ref_per_iteration

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

-10%

36 ns*40 ns

with_input[5]

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

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

from_elem[2048]

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

244 ns*244 ns

iter_batched_large_input

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

36 ns*36 ns

sleep_50ms

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

50.1 ms*50.1 ms

Flat

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

10.1 ms*10.1 ms

recursive_memoized[HashMap<u64, u64>, 30]

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

-1%

6.4 µs6.4 µs

build_vec

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

-2%

204 ns*208 ns

iter_with_setup

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

-10%

36 ns*40 ns

Recursive[21]

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

-13%

74.2 µs*85.1 µs

iter_with_large_drop

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::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_decimal[1024]

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

-2%

82 ns*84 ns

iter_batched_small_input

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

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

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

graph_coloring[3]

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

7 µs7.1 µs

n_queens_solver[7]

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

119.9 µs120.4 µs

n_queens_solver[5]

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

10.2 µs10.2 µs

n_queens_solver[4]

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

-1%

2.1 µs2.1 µs

recursive_memoized[HashMap<u64, u64>, 5]

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

-1%

629 ns633 ns

hamiltonian_cycle[4]

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

-1%

752 ns758 ns

generate_gray_code[1]

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

-1%

161 ns163 ns

hamiltonian_cycle[5]

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

-1%

914 ns926 ns

n_queens_solver[6]

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

-2%

20.9 µs21.2 µs

vec_copy_with_bytes_counter

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

-2%

60 ns61 ns

iterative[30]

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

-2%

50 ns51 ns

generate_gray_code[3]

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

-2%

567 ns581 ns

print_env_hello

crates/divan_compat/examples/benches/env.rs

-3%

5.1 µs5.2 µs

generate_combinations[8]

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

-3%

4.9 µs5 µs

string_processing_multi_counter

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

-7%

373 ns403 ns

generate_combinations[6]

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

-8%

1.9 µs2 µs

count_set_bits[0]

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

-13%

7 ns8 ns

Recursive

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

-13%

45.6 µs*52.5 µs

Recursive[20]

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

-13%

45.6 µs*52.5 µs

generate_combinations[7]

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

-15%

2.7 µs3.2 µs

graph_coloring[3]

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

-21%

1.6 µs2 µs

tsc (aarch64)

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

N/A

< 1 ns< 1 ns

hamiltonian_cycle[6]

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

-3%

941 ns968 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

tsc (x86)

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

N/A

< 1 ns< 1 ns

n_queens_solver[4]

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

8.5 µs8.5 µs

hamiltonian_cycle[6]

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

6.9 µs6.9 µs

hamiltonian_cycle[5]

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

6.6 µs6.6 µs

hamiltonian_cycle[4]

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

6.3 µs6.3 µs

tsc (x86)

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

N/A

< 1 ns< 1 ns

fib_10

crates/divan_compat/benches/fib_example.rs

+4%

859.7 ns830.6 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

+3%

982.5 ns953.3 ns

subset_sum[10]

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

+1%

2.4 µs2.4 µs

fib_20

crates/divan_compat/benches/fib_example.rs

70 µs70 µs

fib_30

crates/divan_compat/benches/fib_example.rs

8.6 ms8.6 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

9.8 ms9.8 ms

bench_array1[1]

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

90 ns90 ns

bench_array1[10]

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

225 ns225 ns

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

fibo_10

crates/divan_compat/benches/basic_example.rs

119.2 ns119.2 ns

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

9.7 ms9.7 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

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

fibo_50

crates/divan_compat/benches/basic_example.rs

90.3 ns90.3 ns

bench_large_input

crates/divan_compat/benches/drop_example.rs

1.6 ms1.6 ms

bench_large_input_local

crates/divan_compat/benches/drop_example.rs

1.5 ms1.5 ms

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

9.7 ms9.7 ms

bench_array2[10]

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

225 ns225 ns

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

bench_array2[1]

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

90 ns90 ns

sum_fold

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

254.7 ns254.7 ns

build_vec

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

2.8 µs2.8 µs

permutations[6]

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

184.8 µs184.8 µs

permutations[5]

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

33.7 µs33.8 µs

n_queens_solver[6]

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

31.9 µs32 µs

init_array[1000]

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

9.1 µs9.1 µs

from_elem[4096]

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

7.2 µs7.2 µs

from_elem[2048]

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

-1%

4 µs4.1 µs

rat_in_maze[8]

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

-1%

6.9 µs6.9 µs

rat_in_maze[7]

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

-1%

6.6 µs6.6 µs

rat_in_maze[6]

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

-1%

6.1 µs6.2 µs

rat_in_maze[5]

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

-1%

5.7 µs5.8 µs

init_array[4]

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

-16%

154.4 ns183.6 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

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

iter

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async 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

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_small_input

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

"*benchmark/" '

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

N/A

< 1 ns< 1 ns

from_elem_decimal[2048]

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

-1%

4 µs4 µs

iter_with_setup

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

N/A

< 1 ns< 1 ns

from_elem[16384]

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

19.6 µs19.6 µs

from_elem[8192]

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

11.3 µs11.4 µs

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

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

bench_explicit_measurement

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

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

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

with_input[5]

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

N/A

< 1 ns< 1 ns

fibo_recursive_cached

crates/codspeed/benches/native.rs

6.5 µs6.5 µs

Recursive[21]

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

130.7 µs130.6 µs

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

from_elem_decimal[1024]

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

1.8 µs1.8 µs

with_input[5]

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

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

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

Iterative

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

132.5 ns132.5 ns

Iterative[20]

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

132.5 ns132.5 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

from_elem[1024]

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

1.8 µs1.8 µs

large_drop

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

1 ms1 ms

iter_batched_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::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

iter_with_setup

crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::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_per_iteration

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

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

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

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_ref_per_iteration

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

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

N/A

< 1 ns< 1 ns

crates/bencher_compat/benches/bencher_example.rs

310.6 ns310.6 ns

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

310.3 ns310.3 ns

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

2.5 µs2.5 µs

crates/bencher_compat/benches/bencher_example.rs

2.3 µs2.3 µs

fibo_iterative

crates/codspeed/benches/native.rs

126.9 ns126.9 ns

fibo_recursive

crates/codspeed/benches/native.rs

916.9 ns916.9 ns

permutations[3]

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

6.2 µs6.3 µs

Ignored

rat_in_maze[7]

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

Ignored

+51%

1,391 ns920 ns

rat_in_maze[5]

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

Ignored

+56%

1,091 ns698 ns

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

×700

61,763 ns88 ns

rat_in_maze[8]

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

Ignored

1.5 µs1.5 µs

recursive[0]

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

Ignored

1 ns1 ns

recursive[10]

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

Ignored

903.3 ns903.3 ns

system_time

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

Ignored

346.7 ns346.7 ns

instant

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

Ignored

345.3 ns345.3 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

-2%

536.9 ns550.3 ns

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

Ignored

-2%

536.9 ns550.3 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

-2%

536.9 ns550.3 ns

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

-2%

536.9 ns550.3 ns

bench_array1[42]

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

Ignored

-3%

809.7 ns838.9 ns

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

-5%

566.1 ns595.3 ns

bench_array2[42]

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

Ignored

-3%

809.7 ns838.9 ns

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

-5%

566.1 ns595.3 ns

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

-5%

566.1 ns595.3 ns

init_array[42]

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

Ignored

-3%

809.7 ns838.9 ns

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

-5%

566.1 ns595.3 ns

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

Ignored

-5%

566.1 ns595.3 ns

Linear

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

Ignored

-14%

186.1 ns215.3 ns

Auto

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

Ignored

-14%

186.1 ns215.3 ns

Flat

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

Ignored

-5%

566.1 ns595.3 ns

sleep_100ms

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

Ignored

566.1 ns566.1 ns

sleep_1ms

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

Ignored

566.1 ns566.1 ns

sleep_50ms

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

Ignored

566.1 ns566.1 ns

sleep_10ms

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

Ignored

566.1 ns566.1 ns

Commits

Click on a commit to change the comparison range

Base

main

550d10f

-10%

fix(divan): use busy sleep in time scale examples For these times, using `thread::sleep` makes no sense as, at least on linux, the scheduler's timer resolution is orders of magnitude larger than nanoseconds.

e5436a5

5 days ago

by GuillaumeLagrange

Home Terms Privacy Docs