GitHub Actions run on branch dependabot/cargo/tokio-1.44.2 - CodSpeedHQ/codspeed-rust

GitHub Actions run

Wall Time

15 days ago 3b7cc0d dependabot/cargo/tokio-1.44.2 pull_request

Compare

Base

Search a run

Head

chore(deps): bump tokio from 1.44.1 to 1.44.2

#111

dependabot/cargo/tokio-1.44.2

15 days ago

Compare

Suggested base runs: •

Benchmarks

Recursive[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[21]

76 µs

iter_with_setup

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

37 ns

fibonacci_custom_measurement

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

407 ns

from_elem[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[1024]

81 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench::with_input[5]

< 1 ns

small_setup

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

1 ns

Linear

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

3 ns

large_drop

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

175.2 µs

from_elem[16384]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[16384]

826 ns

iter_batched_small_input

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

< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime::with_input[5]

< 1 ns

iter_batched_per_iteration

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

40 ns

from_elem_decimal[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[1024]

81 ns

iter_batched_large_input

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

< 1 ns

iter

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

< 1 ns

from_elem_decimal[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[2048]

256 ns

Iterative[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[20]

21 ns

sum_fold

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

304 ns

sleep_10ms

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

10.1 ms

build_vec

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

205 ns

"*benchmark/" '

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

< 1 ns

large_setup

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

12 ns

iter_with_large_drop

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

< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::nested::bench::with_input[5]

< 1 ns

sleep_50ms

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

50 ms

small_drop

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

< 1 ns

iter_batched_ref_small_input

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

< 1 ns

sleep_100ms

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

100.1 ms

Flat

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

10.1 ms

Auto

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

3 ns

Recursive

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

47 µs

iter_batched_ref_large_input

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

< 1 ns

Recursive[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[20]

47 µs

from_elem[8192]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[8192]

492 ns

from_elem[4096]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[4096]

319 ns

from_elem[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[2048]

248 ns

bench_explicit_measurement

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

< 1 ns

sleep_1ms

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

1.1 ms

Iterative

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

21 ns

iter_with_large_setup

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

< 1 ns

iter_batched_ref_per_iteration

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

39 ns

Iterative[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[21]

22 ns

iter_with_setup

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

40 ns

count_set_bits[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[42]

7 ns

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs::sleep_100ns

15.7 µs

rat_in_maze[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[7]

809 ns

recursive_memoized[HashMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 0]

16 ns

n_queens_solver[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[6]

20.4 µs

knight_tour[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[6]

8.5 ms

subset_sum[18]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[18]

4.2 µs

subset_sum[16]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[16]

4 µs

find_highest_set_bit[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[1024]

5 ns

count_set_bits[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[65535]

7 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 0]

14 ns

subset_sum[10]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[10]

1 µs

hamiltonian_cycle[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[4]

561 ns

sudoku

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

111.8 µs

knight_tour[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[5]

293.2 µs

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs::sleep_100us

157.6 µs

permutations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[5]

11.4 µs

permutations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[6]

74.2 µs

graph_coloring[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[6]

1.1 µs

n_queens_solver[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[8]

496.6 µs

recursive[20]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[20]

47.6 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs::print_env_hello

2 µs

count_set_bits[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[255]

7 ns

recursive[10]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[10]

384 ns

mul

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

2 ns

iterative[0]

crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[0]

1 ns

subset_sum[14]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[14]

2.1 µs

graph_coloring[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[4]

926 ns

system_time

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

12 ns

add_two_integers[(1024, -1024)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(1024, -1024)]

65 ns

knight_tour[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[8]

289.1 ms

hamiltonian_cycle[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[5]

635 ns

recursive[5]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[5]

31 ns

find_highest_set_bit[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[0]

5 ns

find_highest_set_bit[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[42]

5 ns

hamiltonian_cycle[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[7]

786 ns

n_queens_solver[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[4]

1.5 µs

tsc (aarch64)

crates/divan_compat/examples/benches/time.rs::duration_since::tsc (aarch64)

< 1 ns

sort

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

137.2 µs

generate_combinations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[5]

803 ns

generate_parentheses[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[5]

22 µs

generate_gray_code[1]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[1]

144 ns

add

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

2 ns

n_queens_solver[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[7]

118.6 µs

recursive_memoized[HashMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 20]

3.3 µs

find_highest_set_bit[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[255]

5 ns

recursive[0]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[0]

1 ns

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs::sleep_1ms

1.1 ms

recursive_memoized[HashMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 30]

5.7 µs

find_highest_set_bit[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[65535]

5 ns

rat_in_maze[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[6]

707 ns

recursive_memoized[BTreeMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 30]

2.9 µs

generate_parentheses[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[6]

68.9 µs

generate_gray_code[4]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[4]

1 µs

generate_combinations[9]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[9]

4.3 µs

permutations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[7]

780.8 µs

add_two_integers[(65535, -65535)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(65535, -65535)]

74 ns

recursive_memoized[BTreeMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 20]

1.8 µs

generate_combinations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[6]

1.3 µs

count_set_bits[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[1024]

7 ns

div

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

3 ns

generate_parentheses[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[4]

6.9 µs

iterative[30]

crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[30]

51 ns

knight_tour[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[7]

245.2 ms

recursive_memoized[BTreeMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 10]

555 ns

sort

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

4.9 ms

generate_gray_code[3]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[3]

515 ns

hamiltonian_cycle[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[6]

723 ns

n_queens_solver[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[5]

7.8 µs

recursive_memoized[HashMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 5]

575 ns

sort_unstable

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

3.3 ms

rem

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

3 ns

add_two_integers[(0, 0)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(0, 0)]

5 ns

add_two_integers[(255, 255)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(255, 255)]

6 ns

generate_combinations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[7]

2 µs

generate_combinations[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[8]

4.2 µs

iterative[10]

crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[10]

16 ns

system_time

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

38 ns

iterative[5]

crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[5]

7 ns

instant

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

38 ns

permutations[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[4]

2.5 µs

add_two_integers[(42, 13)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(42, 13)]

6 ns

permutations[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[3]

761 ns

generate_parentheses[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[3]

2.4 µs

recursive[30]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[30]

5.8 ms

tsc (aarch64)

crates/divan_compat/examples/benches/time.rs::now::tsc (aarch64)

3 ns

graph_coloring[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[3]

1.2 µs

subset_sum[12]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[12]

2 µs

recursive_memoized[HashMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 10]

1.5 µs

count_set_bits[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[0]

7 ns

recursive_memoized[BTreeMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 5]

198 ns

graph_coloring[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[5]

1.1 µs

sort_unstable

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

130.5 µs

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs::sleep_1ns

57.6 µs

rat_in_maze[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[8]

923 ns

rat_in_maze[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[5]

588 ns

generate_gray_code[5]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[5]

2.1 µs

generate_gray_code[2]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[2]

265 ns

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs::sleep_1us

11.9 µs

iterative[20]

crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[20]

40 ns

instant

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

10 ns

bench_array2[42]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[42]

51 ns

bench_array1[10]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[10]

10 ns

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs::sleep_100ms_with_custom_sample

100.1 ms

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs::sleep_100ms

100.1 ms

mut_borrow

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

7 ns

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs::sleep_10ms

10.1 ms

bench_array2[10]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[10]

10 ns

bench_array2[4]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[4]

3 ns

init_array[42]

crates/divan_compat/benches/basic_example.rs::const_bench::init_array[42]

51 ns

fibo_10

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

2 ns

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs::sleep_50ms

50 ms

bench_array1[4]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[4]

3 ns

init_array[4]

crates/divan_compat/benches/basic_example.rs::const_bench::init_array[4]

3 ns

bench_array1[1]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[1]

1 ns

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs::sleep_1ms

1.1 ms

fibo_50

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

2 ns

bench_array2[1]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[1]

1 ns

init_array[1000]

crates/divan_compat/benches/basic_example.rs::const_bench::init_array[1000]

1.8 µs

bench_array1[42]

crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[42]

51 ns

Home Terms Privacy Docs