larseggert:remove-uuid-dependency - Branch - CodSpeedHQ/codspeed-rust

Remove `uuid` dependency

#148Merged

Comparing

larseggert:remove-uuid-dependency

(

d491963

) with

main

(

6c92e06

)

-52%

Improvements: 1

Regressions: 1
(
1
)

Untouched: 364

Ignored: 28

Benchmarks

Improved

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

×3.8

61.8 µs16.5 µs

Passed

with_input[5]

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

N/A

< 1 ns< 1 ns

recursive_memoized[HashMap<u64, u64>, 5]

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

+31%

827 ns630 ns

permutations[5]

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

+26%

14.9 µs11.9 µs

n_queens_solver[5]

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

+21%

9.9 µs8.2 µs

permutations[3]

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

+17%

1,007 ns863 ns

generate_gray_code[5]

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

+9%

2.6 µs2.4 µs

small_drop

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

+9%

51 ns47 ns

subset_sum[18]

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

+5%

4.3 µs4.1 µs

permutations[7]

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

+5%

828.7 µs788.3 µs

slice_into_vec_with_bytes

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

+5%

671.9 ns642.8 ns

fibonacci_custom_measurement

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

+3%

421 ns407 ns

graph_coloring[3]

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

+3%

2.2 µs2.1 µs

hamiltonian_cycle[5]

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

+3%

974 ns947 ns

graph_coloring[4]

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

+3%

1,007 ns980 ns

generate_gray_code[4]

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

+3%

1.1 µs1.1 µs

iterative[30]

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

+2%

51 ns50 ns

graph_coloring[5]

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

+2%

1.1 µs1.1 µs

knight_tour[5]

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

+2%

300.6 µs294.9 µs

generate_gray_code[1]

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

+2%

166 ns163 ns

rat_in_maze[6]

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

+1%

827 ns815 ns

permutations[6]

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

+1%

67.5 µs66.6 µs

subset_sum[16]

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

+1%

4 µs3.9 µs

from_elem[8192]

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

+1%

544 ns539 ns

subset_sum[14]

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

+1%

2 µs2 µs

generate_parentheses[6]

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

+1%

69.7 µs69.2 µs

hamiltonian_cycle[4]

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

+1%

845 ns839 ns

knight_tour[6]

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

+1%

8.6 ms8.6 ms

subset_sum[12]

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

+1%

1.9 µs1.9 µs

n_queens_solver[4]

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

+1%

2.1 µs2.1 µs

recursive_memoized[BTreeMap<u64, u64>, 10]

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

+1%

593 ns590 ns

knight_tour[7]

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

249 ms248 ms

recursive_memoized[HashMap<u64, u64>, 10]

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

1.8 µs1.8 µs

recursive_memoized[HashMap<u64, u64>, 20]

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

3.8 µs3.8 µs

subset_sum[10]

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

998 ns995 ns

fib_10

crates/divan_compat/benches/fib_example.rs

376 ns375 ns

graph_coloring[6]

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

1.1 µs1.1 µs

generate_combinations[8]

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

5.2 µs5.1 µs

sort_unstable

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

3.3 ms3.3 ms

recursive[20]

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

49.7 µs49.7 µs

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

6.8 ms6.7 ms

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread_bench[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

1.1 ms1.1 ms

recursive[30]

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

6.1 ms6.1 ms

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

6.8 ms6.8 ms

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

6.7 ms6.7 ms

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

10.1 ms10.1 ms

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

rem

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

iterative[10]

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

16 ns16 ns

add_two_integers[(255, 255)]

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

20 ns20 ns

system_time

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

38 ns38 ns

iterative[20]

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

39 ns39 ns

iterative[5]

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

7 ns7 ns

recursive[5]

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

34 ns34 ns

instant

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

38 ns38 ns

add_two_integers[(42, 13)]

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

20 ns20 ns

find_highest_set_bit[65535]

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

5 ns5 ns

tsc (aarch64)

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

3 ns3 ns

instant

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

10 ns10 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

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

14 ns14 ns

iterative[0]

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

1 ns1 ns

div

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

count_set_bits[0]

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

7 ns7 ns

find_highest_set_bit[0]

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

5 ns5 ns

count_set_bits[42]

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

7 ns7 ns

slice_into_vec_with_bytes

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

59 ns59 ns

system_time

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

13 ns13 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

add_two_integers[(0, 0)]

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

5 ns5 ns

add

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

mul

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

add_two_integers[(65535, -65535)]

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

75 ns75 ns

recursive_memoized[HashMap<u64, u64>, 0]

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

16 ns16 ns

recursive_memoized[BTreeMap<u64, u64>, 5]

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

209 ns209 ns

find_highest_set_bit[42]

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

5 ns5 ns

bench_array2[1]

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

1 ns1 ns

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

bench_array1[1]

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

1 ns1 ns

bench_array2[10]

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

9 ns9 ns

fibo_50

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

fibo_10

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

add_two_integers[(65535, -65535)]

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

257.8 ns257.8 ns

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

50.1 ms50.1 ms

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

bench_large_input_local

crates/divan_compat/benches/drop_example.rs

50.4 ms50.4 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

bench_large_input

crates/divan_compat/benches/drop_example.rs

50.5 ms50.5 ms

fib_30

crates/divan_compat/benches/fib_example.rs

5.6 ms5.6 ms

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

1.1 ms1.1 ms

sudoku

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

109.4 µs109.5 µs

sort_unstable

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

130.6 µs130.8 µs

n_queens_solver[8]

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

507.3 µs508.2 µs

sort

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

4.9 ms4.9 ms

recursive[10]

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

410 ns411 ns

n_queens_solver[6]

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

20.9 µs21 µs

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs

161.6 µs162.2 µs

generate_parentheses[5]

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

22.6 µs22.7 µs

sort

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

-1%

118.5 µs119.1 µs

generate_gray_code[3]

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

-1%

572 ns575 ns

recursive_memoized[HashMap<u64, u64>, 30]

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

-1%

6.4 µs6.5 µs

n_queens_solver[7]

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

-1%

119.9 µs121.3 µs

generate_combinations[7]

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

-1%

2.8 µs2.9 µs

vec_copy_with_bytes_counter

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

-2%

59 ns60 ns

bench_array2[42]

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

-2%

47 ns48 ns

bench_array1[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

generate_parentheses[3]

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

-2%

3.2 µs3.3 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

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

-2%

3.3 µs3.4 µs

init_array[1000]

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

-3%

2.1 µs2.1 µs

hamiltonian_cycle[7]

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

-3%

1 µs1.1 µs

generate_parentheses[4]

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

-4%

7.7 µs8 µs

process_with_multiple_counters

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

-4%

47 ns49 ns

hash_computation_cycles

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

-4%

46 ns48 ns

filter_items_with_counter

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

-5%

820 ns859 ns

generate_combinations[5]

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

-5%

1.2 µs1.2 µs

permutations[4]

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

-7%

3 µs3.2 µs

count_set_bits[255]

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

-13%

7 ns8 ns

count_set_bits[1024]

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

-13%

7 ns8 ns

count_set_bits[65535]

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

-13%

7 ns8 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

-13%

7 ns8 ns

string_processing_multi_counter

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

-13%

325 ns373 ns

tsc (aarch64)

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

N/A

< 1 ns< 1 ns

find_highest_set_bit[1024]

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

-2%

61 ns62 ns

count_chars_in_string

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

-3%

33 ns34 ns

generate_gray_code[2]

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

-4%

285 ns297 ns

process_items_with_counter

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

-5%

61 ns64 ns

build_vec

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

-5%

204 ns215 ns

iter_batched_small_input

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

N/A

< 1 ns< 1 ns

hamiltonian_cycle[6]

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

+2%

977 ns956 ns

knight_tour[8]

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

+1%

292.3 ms290.8 ms

sleep_100ms

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

100.1 ms100.1 ms

iter_batched_ref_large_input

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

36 ns36 ns

iter_with_setup

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

36 ns36 ns

iter_batched_per_iteration

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

36 ns36 ns

Iterative[20]

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

21 ns21 ns

iter_batched_ref_per_iteration

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

36 ns36 ns

small_setup

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

2 ns2 ns

Auto

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

3 ns3 ns

from_elem[1024]

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

83 ns83 ns

Iterative[21]

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

22 ns22 ns

Linear

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

3 ns3 ns

Iterative

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

21 ns21 ns

iter_batched_large_input

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

36 ns36 ns

from_elem_decimal[1024]

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

82 ns82 ns

Flat

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

10.1 ms10.1 ms

sleep_50ms

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

50.1 ms50.1 ms

sleep_10ms

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

10.1 ms10.1 ms

sleep_1ms

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

1.1 ms1.1 ms

from_elem[16384]

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

-1%

934 ns939 ns

sum_fold

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

-1%

304 ns306 ns

from_elem[4096]

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

-1%

350 ns354 ns

large_drop

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

-1%

808.5 µs819.6 µs

from_elem_decimal[2048]

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

-3%

264 ns272 ns

print_env_hello

crates/divan_compat/examples/benches/env.rs

-6%

4.9 µs5.2 µs

from_elem[2048]

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

-7%

244 ns262 ns

generate_combinations[6]

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

-9%

1.9 µs2.1 µs

iter_with_setup

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

-10%

36 ns40 ns

with_input[5]

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

N/A

< 1 ns< 1 ns

uppercase_chars_with_counter

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

-8%

353 ns385 ns

generate_combinations[9]

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

-11%

5.3 µs5.9 µs

Recursive[21]

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

-13%

74.2 µs85.2 µs

Recursive

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

-13%

45.6 µs52.7 µs

iter

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_ref_small_input

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

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::nested::bench

N/A

< 1 ns< 1 ns

Recursive[20]

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

-13%

45.6 µs52.5 µs

bench_explicit_measurement

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

N/A

< 1 ns< 1 ns

find_highest_set_bit[0]

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

+32%

119.2 ns90 ns

bench_array1[10]

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

+13%

254.2 ns225 ns

bench_array2[10]

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

+13%

254.2 ns225 ns

count_chars_in_string

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

+4%

730.3 ns701.1 ns

uppercase_chars_with_counter

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

+1%

2.1 µs2.1 µs

string_processing_multi_counter

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

+1%

4.5 µs4.5 µs

hamiltonian_cycle[7]

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

+1%

7.2 µs7.1 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

+1%

8.2 µs8.1 µs

hamiltonian_cycle[5]

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

6.6 µs6.6 µs

hamiltonian_cycle[6]

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

6.9 µs6.9 µs

bench_large_input_local

crates/divan_compat/benches/drop_example.rs

1.5 ms1.5 ms

bench_large_input

crates/divan_compat/benches/drop_example.rs

1.6 ms1.6 ms

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

9.7 ms9.7 ms

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

fib_in_thread_bench[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

knight_tour[6]

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

19 ms19 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

knight_tour[8]

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

661.1 ms661.1 ms

vec_copy_with_bytes_counter

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

887.5 ns887.5 ns

count_set_bits[1024]

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

120.8 ns120.8 ns

knight_tour[5]

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

665.9 µs665.9 µs

count_set_bits[255]

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

128.6 ns128.6 ns

string_copy_with_bytes_counter

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

798.1 ns798.1 ns

find_highest_set_bit[255]

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

121.1 ns121.1 ns

count_set_bits[42]

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

123.1 ns123.1 ns

knight_tour[7]

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

568.2 ms568.2 ms

count_set_bits[0]

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

90 ns90 ns

generate_gray_code[1]

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

2.6 µs2.6 µs

process_items_with_counter

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

835.8 ns835.8 ns

find_highest_set_bit[42]

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

121.1 ns121.1 ns

find_highest_set_bit[1024]

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

121.1 ns121.1 ns

count_set_bits[65535]

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

137.5 ns137.5 ns

find_highest_set_bit[65535]

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

121.1 ns121.1 ns

simulated_processing_cycles

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

2 µs2 µs

generate_gray_code[3]

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

3.6 µs3.6 µs

generate_gray_code[2]

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

3 µs3 µs

div

crates/divan_compat/examples/benches/math.rs

124.2 ns124.2 ns

generate_gray_code[4]

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

5.1 µs5.1 µs

iterative[30]

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

236.9 ns236.9 ns

generate_gray_code[5]

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

7.8 µs7.8 µs

iterative[5]

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

160.6 ns160.6 ns

iterative[0]

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

119.2 ns119.2 ns

iterative[20]

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

206.4 ns206.4 ns

n_queens_solver[8]

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

617.5 µs617.6 µs

permutations[6]

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

184.8 µs184.9 µs

n_queens_solver[7]

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

160.4 µs160.4 µs

n_queens_solver[6]

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

31.9 µs32 µs

n_queens_solver[5]

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

20.5 µs20.6 µs

permutations[4]

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

11.2 µs11.2 µs

n_queens_solver[4]

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

8.5 µs8.5 µs

filter_items_with_counter

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

-1%

4.8 µs4.8 µs

permutations[3]

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

-1%

6.2 µs6.3 µs

process_with_multiple_counters

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

-5%

611.7 ns640.8 ns

hash_computation_cycles

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

-5%

512.5 ns541.7 ns

tsc (x86)

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

N/A

< 1 ns< 1 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::now

N/A

< 1 ns< 1 ns

subset_sum[10]

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

+2%

2.4 µs2.4 µs

subset_sum[14]

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

+1%

4.4 µs4.4 µs

subset_sum[18]

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

+1%

8.2 µs8.2 µs

subset_sum[12]

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

+1%

4.1 µs4.1 µs

hamiltonian_cycle[4]

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

6.3 µs6.3 µs

subset_sum[16]

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

7.9 µs7.9 µs

sudoku

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

117.1 µs117.1 µs

sort

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

8.1 ms8.1 ms

sort

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

464.1 µs464.1 µs

recursive_memoized[BTreeMap<u64, u64>, 0]

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

400.8 ns400.8 ns

add

crates/divan_compat/examples/benches/math.rs

91.4 ns91.4 ns

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>, 5]

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

2.4 µs2.4 µs

sort_unstable

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

404.7 µs404.7 µs

recursive_memoized[BTreeMap<u64, u64>, 20]

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

6.7 µs6.7 µs

recursive_memoized[BTreeMap<u64, u64>, 10]

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

3 µs3 µs

mul

crates/divan_compat/examples/benches/math.rs

91.4 ns91.4 ns

add_two_integers[(42, 13)]

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

154.4 ns154.4 ns

graph_coloring[6]

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

5.3 µs5.3 µs

graph_coloring[5]

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

5.3 µs5.3 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

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

8.3 µs8.3 µs

rem

crates/divan_compat/examples/benches/math.rs

124.4 ns124.4 ns

iterative[10]

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

175.8 ns175.8 ns

generate_combinations[9]

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

21.6 µs21.6 µs

add_two_integers[(255, 255)]

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

154.4 ns154.4 ns

generate_combinations[7]

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

289.5 µs289.5 µs

graph_coloring[4]

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

5.5 µs5.5 µs

graph_coloring[3]

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

7 µs7 µs

fib_30

crates/divan_compat/benches/fib_example.rs

8.6 ms8.6 ms

bench_array1[4]

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

154.4 ns154.4 ns

bench_array1[1]

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

90 ns90 ns

fibo_50

crates/divan_compat/benches/basic_example.rs

90.3 ns90.3 ns

bench_array2[1]

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

90 ns90 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

982.5 ns982.5 ns

bench_array2[4]

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

154.4 ns154.4 ns

fibo_10

crates/divan_compat/benches/basic_example.rs

119.2 ns119.2 ns

fib_10

crates/divan_compat/benches/fib_example.rs

859.7 ns859.7 ns

init_array[4]

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

154.4 ns154.4 ns

fib_20

crates/divan_compat/benches/fib_example.rs

70 µs70 µs

init_array[1000]

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

9.1 µs9.1 µs

build_vec

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

2.8 µs2.8 µs

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

9.8 ms9.8 ms

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

15.8 ms15.8 ms

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

9.7 ms9.7 ms

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

generate_parentheses[6]

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

120.4 µs120.4 µs

generate_parentheses[5]

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

45 µs45 µs

generate_parentheses[4]

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

17.8 µs17.9 µs

recursive_memoized[HashMap<u64, u64>, 0]

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

-3%

926.9 ns956.1 ns

add_two_integers[(0, 0)]

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

-19%

121.1 ns150.3 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_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_per_iteration

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

N/A

< 1 ns< 1 ns

iter_batched_large_input

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

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

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/iter_with_setup.rs::benches::setup

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

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

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_drop

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_batched_ref_small_input

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

N/A

< 1 ns< 1 ns

fibo_recursive_cached

crates/codspeed/benches/native.rs

6.5 µs6.5 µs

sum_fold

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

254.7 ns254.7 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

Recursive[21]

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

130.7 µs130.6 µs

Iterative

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

132.5 ns132.5 ns

Recursive[20]

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

80.9 µs80.9 µs

from_elem[1024]

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

1.8 µs1.8 µs

fibonacci_custom_measurement

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

916.7 ns916.7 ns

crates/bencher_compat/benches/bencher_example.rs

310.6 ns310.6 ns

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

2.5 µs2.5 µs

from_elem[16384]

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

19.6 µs19.6 µ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

Recursive

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

80.9 µs80.9 µs

from_elem_decimal[1024]

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

1.8 µs1.8 µs

fibo_recursive

crates/codspeed/benches/native.rs

916.9 ns916.9 ns

recursive[30]

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

9.7 ms9.7 ms

sort_unstable

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

6.5 ms6.5 ms

permutations[7]

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

1.3 ms1.3 ms

recursive[20]

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

79.1 µs79.2 µs

recursive_memoized[HashMap<u64, u64>, 5]

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

3.7 µs3.7 µs

permutations[5]

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

33.7 µs33.8 µs

generate_combinations[8]

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

15.7 µs15.7 µs

generate_parentheses[3]

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

9.6 µs9.6 µs

generate_combinations[6]

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

9.6 µs9.6 µs

recursive_memoized[HashMap<u64, u64>, 20]

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

8.2 µs8.2 µs

generate_combinations[5]

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

7.5 µs7.5 µs

recursive_memoized[HashMap<u64, u64>, 30]

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

-1%

12.9 µs13 µs

recursive_memoized[HashMap<u64, u64>, 10]

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

-1%

5 µs5 µ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.5 µ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

system_time

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

-9%

305.3 ns334.4 ns

recursive[5]

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

-9%

291.1 ns320.3 ns

recursive[0]

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

-12%

211.1 ns240.3 ns

recursive_memoized[BTreeMap<u64, u64>, 20]

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

-14%

2 µs2.3 µs

large_setup

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

-24%

16 ns21 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

bench_array2[4]

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

-25%

3 ns4 ns

simulated_processing_cycles

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

-33%

887 ns1,322 ns

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

Regression

-52%

29.9 µs62.9 µs

iter_with_large_setup

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

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

from_elem[4096]

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

7.2 µs7.2 µs

"*benchmark/" '

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

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

Iterative[21]

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

134.2 ns134.2 ns

large_drop

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

1 ms1 ms

fibo_iterative

crates/codspeed/benches/native.rs

126.9 ns126.9 ns

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

310.3 ns310.3 ns

crates/bencher_compat/benches/bencher_example.rs

2.3 µs2.3 µs

from_elem[8192]

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

11.3 µs11.4 µs

from_elem_decimal[2048]

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

-1%

4 µs4 µs

iter_batched_small_input

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

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

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

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

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

Ignored

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

+1%

62 µs61.7 µs

rat_in_maze[8]

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

Ignored

+7%

1.6 µs1.5 µs

rat_in_maze[7]

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

Ignored

+55%

1,427 ns920 ns

recursive[0]

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

Ignored

×2

2 ns1 ns

rat_in_maze[5]

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

Ignored

+1%

716 ns707 ns

instant

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

Ignored

345.3 ns345.3 ns

system_time

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

Ignored

-8%

346.7 ns375.8 ns

sleep_1us

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

536.9 ns536.9 ns

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

Ignored

536.9 ns536.9 ns

recursive[10]

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

Ignored

-3%

903.3 ns932.5 ns

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

536.9 ns536.9 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

Ignored

536.9 ns536.9 ns

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

566.1 ns566.1 ns

bench_array1[42]

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

Ignored

809.7 ns809.7 ns

bench_array2[42]

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

Ignored

809.7 ns809.7 ns

init_array[42]

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

Ignored

809.7 ns809.7 ns

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

566.1 ns566.1 ns

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

566.1 ns566.1 ns

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

Ignored

566.1 ns566.1 ns

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

Ignored

566.1 ns566.1 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

Flat

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

Ignored

566.1 ns566.1 ns

Auto

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

Ignored

-14%

186.1 ns215.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

sleep_10ms

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

Commits

Click on a commit to change the comparison range

Base

main

6c92e06

-52.5%

Remove `uuid` dependency `uuid` pulls in a bunch of WASM dependencies, even when Codspeed is pulled in with `default-features = false`. For some projects, that means vetting a lot of extra code. This PR replaces the `uuid` dependency and uses `getrandom` to generate an UUIDv4-style string. (I'm not sure if anything depends on things being named with UUIDs; if not, this PR would be even simpler.)

d491963

6 days ago

by larseggert

Home Terms Privacy Docs