cod-1459-error-finding-libclang-in-github-actions-for-windows - Branch - CodSpeedHQ/codspeed-rust

Revert "fix(codspeed): always compile instrument-hooks (with stubs)"

#134Merged

Comparing

cod-1459-error-finding-libclang-in-github-actions-for-windows

(

9502f62

) with

main

(

112f30d

)

-48%

Improvements: 10

Regressions: 20

Untouched: 333

Ignored: 9

Benchmarks

Failed

large_setup

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

Regression

-23%

17 ns*22 ns

small_drop

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

Regression

-11%

54 ns*61 ns

iter_with_setup

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

Regression

-8%

48 ns*52 ns

subset_sum[18]

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

Regression

-4%

4.1 µs4.2 µs

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

Regression

-48%

32.6 µs62.6 µs

generate_combinations[7]

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

Regression

-7%

2.6 µs2.8 µs

rat_in_maze[7]

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

Regression

-36%

923 ns1,451 ns

graph_coloring[3]

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

Regression

-13%

1.6 µs1.8 µs

count_set_bits[65535]

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

Regression

-13%

7 ns8 ns

permutations[4]

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

Regression

-4%

3 µs3.2 µs

permutations[6]

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

Regression

-3%

66.8 µs69.1 µs

count_set_bits[0]

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

Regression

-13%

7 ns8 ns

hamiltonian_cycle[7]

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

Regression

-39%

1 µs1.7 µs

recursive[5]

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

Regression

-9%

291.1 ns320.3 ns

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs

Regression

-5%

536.9 ns566.1 ns

recursive[0]

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

Regression

-12%

211.1 ns240.3 ns

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

Regression

-5%

536.9 ns566.1 ns

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

Regression

-5%

536.9 ns566.1 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

Regression

-5%

536.9 ns566.1 ns

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

Regression

-5%

536.9 ns566.1 ns

Improved

sum_fold

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

+17%

355 ns*304 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

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

+9%

371.7 ns342.5 ns

from_elem_decimal[2048]

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

+7%

282 ns*263 ns

generate_combinations[6]

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

+7%

2.1 µs1.9 µs

from_elem[8192]

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

+6%

558 ns*527 ns

from_elem[4096]

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

+6%

366 ns*346 ns

from_elem[16384]

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

+6%

992 ns*938 ns

hamiltonian_cycle[5]

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

+4%

938 ns899 ns

generate_gray_code[2]

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

+3%

296 ns286 ns

generate_parentheses[3]

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

+3%

3.1 µs3 µs

Passed

"*benchmark/" '

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

N/A

< 1 ns*< 1 ns

generate_combinations[8]

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

+3%

5 µs4.9 µs

graph_coloring[6]

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

+2%

1.1 µs1.1 µs

permutations[3]

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

+1%

887 ns875 ns

recursive_memoized[HashMap<u64, u64>, 20]

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

+1%

3.8 µs3.8 µs

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

+1%

62.1 µs61.5 µs

generate_parentheses[5]

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

+1%

22.7 µs22.5 µs

subset_sum[16]

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

+1%

4 µs3.9 µs

subset_sum[12]

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

1.9 µs1.9 µs

sort

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

119.1 µs118.9 µs

sort_unstable

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

110.1 µs109.9 µs

Iterative[20]

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

21 ns*21 ns

iter_with_large_drop

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

N/A

< 1 ns*< 1 ns

from_elem_decimal[1024]

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

+3%

82 ns*80 ns

from_elem[1024]

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

+3%

82 ns*80 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

+1%

62.4 µs61.6 µs

knight_tour[5]

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

+1%

302.8 µs298.9 µs

recursive_memoized[HashMap<u64, u64>, 10]

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

+1%

1.8 µs1.8 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

+1%

5.1 µs5 µs

generate_parentheses[4]

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

+1%

7.6 µs7.6 µs

hamiltonian_cycle[4]

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

+1%

776 ns770 ns

rat_in_maze[6]

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

+1%

836 ns830 ns

recursive_memoized[HashMap<u64, u64>, 30]

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

+1%

6.5 µs6.4 µs

n_queens_solver[5]

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

9.9 µs9.9 µs

recursive_memoized[HashMap<u64, u64>, 5]

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

632 ns629 ns

recursive_memoized[BTreeMap<u64, u64>, 30]

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

3.3 µs3.3 µs

recursive_memoized[BTreeMap<u64, u64>, 10]

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

596 ns594 ns

sort

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

4.9 ms4.9 ms

n_queens_solver[7]

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

119.2 µs119.1 µs

generate_parentheses[6]

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

69.4 µs69.3 µs

fib_in_thread[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread_bench_local[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

1.1 ms1.1 ms

fib_in_thread_bench_local[30]

crates/divan_compat/benches/thread_example.rs

6.8 ms6.7 ms

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

50.1 ms50.1 ms

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

fib_in_thread_bench[31]

crates/divan_compat/benches/thread_example.rs

10.8 ms10.8 ms

fib_in_thread_bench[30]

crates/divan_compat/benches/thread_example.rs

6.8 ms6.8 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

sleep_1ms

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

1.1 ms*1.1 ms

sort_unstable

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

3.3 ms3.3 ms

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

17.4 ms17.4 ms

sleep_10ms

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

10.1 ms*10.1 ms

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

10.1 ms10.1 ms

sleep_50ms

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

50.1 ms*50.1 ms

iter_batched_ref_per_iteration

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

44 ns*44 ns

iter_batched_ref_large_input

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

44 ns*44 ns

fibonacci_custom_measurement

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

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

Recursive[21]

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

+1%

77.2 µs*76.3 µs

Recursive[20]

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

47.2 µs*47.2 µs

sleep_100ms

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

100.1 ms*100.1 ms

Iterative

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

21 ns*21 ns

Iterative[21]

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

22 ns*22 ns

Auto

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

3 ns*3 ns

iter_batched_per_iteration

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

44 ns*44 ns

iter_with_setup

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

44 ns*44 ns

iter_batched_large_input

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

44 ns*44 ns

Linear

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

3 ns*3 ns

find_highest_set_bit[42]

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

5 ns5 ns

graph_coloring[4]

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

962 ns962 ns

recursive_memoized[HashMap<u64, u64>, 0]

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

16 ns16 ns

generate_combinations[5]

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

1.1 µs1.1 µs

Recursive

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

47.4 µs*47.5 µs

large_drop

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

-2%

782.1 µs*798.9 µs

build_vec

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

-2%

209 ns*214 ns

with_input[5]

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

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

with_input[5]

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

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

2 ns*2 ns

Flat

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

10.1 ms*10.1 ms

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

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

N/A

< 1 ns*< 1 ns

find_highest_set_bit[65535]

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

5 ns5 ns

find_highest_set_bit[255]

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

5 ns5 ns

rat_in_maze[8]

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

1.2 µs1.2 µs

iterative[5]

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

8 ns8 ns

permutations[7]

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

-2%

822.9 µs835.9 µs

from_elem[2048]

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

-2%

246 ns*251 ns

tsc (aarch64)

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

N/A

< 1 ns< 1 ns

add_two_integers[(1024, -1024)]

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

+2%

67 ns66 ns

knight_tour[8]

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

290 ms289.7 ms

iterative[0]

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

1 ns1 ns

add_two_integers[(42, 13)]

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

20 ns20 ns

iterative[30]

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

51 ns51 ns

add

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

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

14 ns14 ns

recursive_memoized[BTreeMap<u64, u64>, 5]

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

219 ns219 ns

recursive[5]

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

34 ns34 ns

iterative[10]

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

16 ns16 ns

generate_gray_code[5]

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

2.4 µs2.4 µs

find_highest_set_bit[0]

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

5 ns5 ns

instant

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

10 ns10 ns

count_set_bits[42]

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

7 ns7 ns

add_two_integers[(255, 255)]

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

20 ns20 ns

rem

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

count_set_bits[1024]

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

7 ns7 ns

iterative[20]

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

38 ns38 ns

subset_sum[14]

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

2 µs2 µs

find_highest_set_bit[1024]

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

5 ns5 ns

div

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

tsc (aarch64)

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

3 ns3 ns

instant

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

38 ns38 ns

system_time

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

13 ns13 ns

add_two_integers[(0, 0)]

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

5 ns5 ns

count_set_bits[255]

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

7 ns7 ns

add_two_integers[(65535, -65535)]

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

75 ns75 ns

system_time

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

38 ns38 ns

recursive[0]

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

1 ns1 ns

mul

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

bench_array2[4]

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

3 ns3 ns

bench_array1[1]

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

1 ns1 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

mut_borrow

crates/divan_compat/benches/basic_example.rs

7 ns7 ns

init_array[42]

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

47 ns47 ns

bench_array2[42]

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

47 ns47 ns

bench_array1[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_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[10]

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

9 ns9 ns

bench_array2[1]

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

1 ns1 ns

init_array[4]

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

3 ns3 ns

build_vec

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

2.8 µs2.8 µs

sum_fold

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

254.7 ns254.7 ns

from_elem_decimal[1024]

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

1.8 µs1.8 µs

sleep_100ms

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

566.1 ns566.1 ns

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.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

bench_large_input

crates/divan_compat/benches/drop_example.rs

50.5 ms50.5 ms

sudoku

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

109.5 µs109.5 µs

fib_in_thread[30]

crates/divan_compat/benches/thread_example.rs

6.8 ms6.8 ms

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

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs

161.6 µs161.7 µs

recursive[20]

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

49.7 µs49.7 µs

knight_tour[7]

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

248.1 ms248.4 ms

fib_30

crates/divan_compat/benches/fib_example.rs

5.6 ms5.6 ms

knight_tour[6]

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

8.6 ms8.6 ms

n_queens_solver[8]

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

506 µs507.3 µs

fib_10

crates/divan_compat/benches/fib_example.rs

375 ns376 ns

generate_gray_code[4]

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

1.1 µs1.1 µs

subset_sum[10]

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

995 ns998 ns

hamiltonian_cycle[6]

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

968 ns971 ns

generate_combinations[9]

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

5.2 µs5.2 µs

generate_gray_code[3]

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

-1%

555 ns558 ns

n_queens_solver[4]

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

-1%

2.1 µs2.2 µs

generate_gray_code[1]

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

-1%

159 ns160 ns

init_array[1000]

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

-1%

1.8 µs1.8 µs

permutations[5]

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

-1%

11.6 µs11.7 µs

recursive[10]

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

-1%

417 ns422 ns

n_queens_solver[6]

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

-1%

20.6 µs20.9 µs

rat_in_maze[5]

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

-1%

875 ns887 ns

recursive_memoized[BTreeMap<u64, u64>, 20]

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

-2%

2.2 µs2.2 µs

graph_coloring[5]

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

-2%

1 µs1.1 µs

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

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

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

sleep_1ms

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

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

from_elem_decimal[2048]

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

-1%

4 µs4 µs

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

Recursive[21]

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

130.7 µs130.6 µs

Iterative[20]

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

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

Recursive

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

80.9 µs80.9 µs

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

sleep_50ms

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

566.1 ns566.1 ns

sleep_10ms

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

566.1 ns566.1 ns

fibonacci_custom_measurement

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

916.7 ns916.7 ns

with_input[5]

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

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

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_per_iteration

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

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

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_small_input

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

"*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/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

from_elem[1024]

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

1.8 µs1.8 µs

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

from_elem[16384]

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

19.6 µs19.6 µs

from_elem[2048]

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

-1%

4 µs4.1 µs

iter_with_setup

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

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

from_elem[8192]

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

11.3 µs11.4 µs

from_elem[4096]

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

7.2 µs7.2 µ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

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_batched_ref_small_input

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

N/A

< 1 ns< 1 ns

recursive_memoized[BTreeMap<u64, u64>, 10]

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

+1%

3 µs3 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

8.1 µs8.1 µs

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

fibo_recursive

crates/codspeed/benches/native.rs

916.9 ns916.9 ns

fibo_iterative

crates/codspeed/benches/native.rs

126.9 ns126.9 ns

fibo_recursive_cached

crates/codspeed/benches/native.rs

6.5 µs6.5 µs

knight_tour[7]

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

568.2 ms568.2 ms

count_set_bits[255]

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

99.4 ns99.4 ns

add_two_integers[(65535, -65535)]

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

257.8 ns257.8 ns

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

91.7 ns91.7 ns

count_set_bits[0]

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

90 ns90 ns

add

crates/divan_compat/examples/benches/math.rs

120.6 ns120.6 ns

div

crates/divan_compat/examples/benches/math.rs

95 ns95 ns

count_set_bits[42]

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

93.9 ns93.9 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

108.3 ns108.3 ns

find_highest_set_bit[0]

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

90 ns90 ns

iterative[0]

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

119.2 ns119.2 ns

iterative[10]

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

175.8 ns175.8 ns

iterative[5]

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

160.6 ns160.6 ns

find_highest_set_bit[255]

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

121.1 ns121.1 ns

iterative[30]

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

236.9 ns236.9 ns

find_highest_set_bit[42]

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

121.1 ns121.1 ns

iterative[20]

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

206.4 ns206.4 ns

find_highest_set_bit[65535]

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

121.1 ns121.1 ns

generate_gray_code[3]

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

3.6 µs3.6 µs

generate_gray_code[1]

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

2.6 µs2.6 µs

generate_gray_code[5]

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

7.8 µs7.8 µs

generate_gray_code[2]

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

3 µs3 µs

system_time

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

363.6 ns363.6 ns

recursive[30]

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

9.7 ms9.7 ms

generate_gray_code[4]

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

5.1 µs5.1 µs

instant

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

363.6 ns363.6 ns

n_queens_solver[7]

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

160.3 µs160.4 µs

permutations[5]

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

33.7 µs33.7 µs

n_queens_solver[6]

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

31.9 µs31.9 µs

n_queens_solver[5]

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

20.5 µs20.5 µs

n_queens_solver[4]

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

8.5 µs8.5 µs

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

-1%

2.5 µs2.5 µs

crates/bencher_compat/benches/bencher_example.rs

-1%

2.2 µs2.3 µs

tsc (x86)

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

N/A

< 1 ns< 1 ns

tsc (x86)

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

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.3 µs

subset_sum[18]

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

+1%

8.2 µs8.1 µs

subset_sum[12]

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

+1%

4.1 µs4.1 µs

graph_coloring[5]

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

+1%

5.2 µs5.2 µs

graph_coloring[6]

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

+1%

5.2 µs5.2 µs

graph_coloring[4]

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

+1%

5.4 µs5.4 µs

graph_coloring[3]

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

6.9 µs6.9 µs

hamiltonian_cycle[7]

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

7.1 µs7.1 µs

subset_sum[16]

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

7.9 µs7.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[30]

crates/divan_compat/benches/thread_example.rs

9.8 ms9.8 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

fib_in_thread_bench_local[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

fib_in_thread_bench[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 ms

sort

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

464 µs464 µs

sort_unstable

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

6.5 ms6.5 ms

recursive_memoized[BTreeMap<u64, u64>, 5]

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

2.4 µs2.4 µs

recursive_memoized[HashMap<u64, u64>, 0]

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

1 µs1 µs

recursive_memoized[BTreeMap<u64, u64>, 20]

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

6.6 µs6.6 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

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

8.3 µs8.3 µs

mul

crates/divan_compat/examples/benches/math.rs

120.6 ns120.6 ns

add_two_integers[(42, 13)]

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

154.4 ns154.4 ns

rem

crates/divan_compat/examples/benches/math.rs

95.3 ns95.3 ns

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

sort_unstable

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

404.7 µs404.7 µs

sudoku

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

117.1 µs117.1 µs

recursive_memoized[HashMap<u64, u64>, 5]

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

3.7 µs3.7 µs

generate_combinations[7]

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

289.5 µs289.5 µs

generate_combinations[9]

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

21.6 µs21.6 µs

add_two_integers[(0, 0)]

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

121.1 ns121.1 ns

hamiltonian_cycle[6]

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

6.8 µs6.8 µs

hamiltonian_cycle[5]

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

6.5 µs6.5 µs

hamiltonian_cycle[4]

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

6.3 µs6.3 µs

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

566.1 ns566.1 ns

fib_30

crates/divan_compat/benches/fib_example.rs

8.6 ms8.6 ms

fib_20

crates/divan_compat/benches/fib_example.rs

70 µs70 µs

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

566.1 ns566.1 ns

bench_array1[10]

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

254.2 ns254.2 ns

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

566.1 ns566.1 ns

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

566.1 ns566.1 ns

bench_array1[1]

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

90 ns90 ns

fib_10

crates/divan_compat/benches/fib_example.rs

859.7 ns859.7 ns

bench_array2[4]

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

154.4 ns154.4 ns

bench_array1[4]

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

154.4 ns154.4 ns

bench_array2[1]

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

90 ns90 ns

bench_array2[10]

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

254.2 ns254.2 ns

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

566.1 ns566.1 ns

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

fibo_50

crates/divan_compat/benches/basic_example.rs

90.3 ns90.3 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

953.3 ns953.3 ns

fib_in_thread[32]

crates/divan_compat/benches/thread_example.rs

25.5 ms25.5 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

sort

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

8.1 ms8.1 ms

permutations[7]

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

1.3 ms1.3 ms

n_queens_solver[8]

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

617.4 µs617.5 µs

permutations[6]

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

184.8 µs184.8 µs

recursive[20]

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

79.1 µs79.2 µs

generate_parentheses[6]

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

120.3 µs120.4 µs

generate_parentheses[5]

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

44.9 µs45 µs

generate_combinations[8]

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

15.6 µs15.7 µs

recursive_memoized[HashMap<u64, u64>, 30]

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

12.9 µs12.9 µs

permutations[4]

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

11.2 µs11.2 µs

generate_combinations[6]

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

9.5 µs9.5 µs

init_array[1000]

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

9.1 µs9.2 µs

generate_parentheses[4]

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

17.8 µs17.8 µs

generate_combinations[5]

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

7.4 µs7.5 µs

rat_in_maze[8]

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

6.8 µs6.9 µs

rat_in_maze[7]

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

6.5 µs6.5 µs

rat_in_maze[6]

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

6.1 µs6.1 µs

rat_in_maze[5]

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

-1%

5.7 µs5.7 µs

recursive_memoized[HashMap<u64, u64>, 20]

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

-1%

8.1 µs8.2 µs

generate_parentheses[3]

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

-1%

9.5 µs9.6 µs

permutations[3]

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

-1%

6.2 µs6.3 µs

recursive_memoized[HashMap<u64, u64>, 10]

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

-1%

4.9 µs5 µs

Ignored

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

Flat

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

Ignored

566.1 ns566.1 ns

recursive[10]

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

Ignored

932.5 ns932.5 ns

system_time

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

Ignored

-8%

346.7 ns375.8 ns

instant

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

Ignored

-8%

316.1 ns345.3 ns

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

bench_array2[42]

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

Ignored

809.7 ns809.7 ns

Commits

Click on a commit to change the comparison range

Base

main

112f30d

-47.55%

fix(ci): test codspeed on mac/windows without libclang

5f43abd

21 hours ago

by not-matthias

-2.45%

Revert "fix(codspeed): always compile instrument-hooks (with stubs)" CI runners that don't have LIBCLANG pre-installed would fail. We don't support Windows/MacOS for now, so we shouldn't do extra work with bindgen and cc. This reverts commit 8054636ee6e2e572a8f5fc9ec988474942de5d8f.

408ed5a

22 hours ago

by not-matthias

+2.13%

chore: bump instrument-hooks

9502f62

21 hours ago

by not-matthias

Home Terms Privacy Docs