GitHub Actions run on branch main - CodSpeedHQ/codspeed-rust

GitHub Actions run

Wall Time

2 days ago d7a1b4b main

Compare

Base

Search a run

Head

main

d7a1b4b

2 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]

84.7 µs

iter_with_setup

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

40 ns

from_elem_decimal[2048]

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

256 ns

from_elem[4096]

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

333 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

rat_in_maze[8]

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

3.7 µs

generate_combinations[9]

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

4.3 µs

Flat

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

10.1 ms

recursive[20]

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

49.6 µs

iter_batched_ref_per_iteration

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

40 ns

recursive_memoized[HashMap<u64, u64>, 30]

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

5.6 µs

Linear

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

3 ns

from_elem[16384]

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

847 ns

bench_explicit_measurement

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

< 1 ns

iter_batched_small_input

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

< 1 ns

iter_with_setup

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

39 ns

with_input[5]

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

< 1 ns

Iterative[21]

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

22 ns

graph_coloring[3]

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

2.2 µs

subset_sum[10]

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

4 µs

iterative[10]

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

4.3 µs

from_elem[1024]

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

82 ns

find_highest_set_bit[1024]

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

5.8 µs

from_elem[2048]

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

231 ns

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

n_queens_solver[4]

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

1.6 µs

permutations[6]

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

66.1 µs

iter

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

< 1 ns

hamiltonian_cycle[4]

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

4.4 µs

with_input[5]

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

< 1 ns

instant

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

5.2 µs

iterative[5]

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

4.3 µs

large_drop

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

170.8 µs

subset_sum[12]

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

3.9 µs

tsc (aarch64)

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

1.1 µs

generate_gray_code[4]

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

3.6 µs

sort

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

137.3 µs

Iterative

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

21 ns

n_queens_solver[7]

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

125.1 µs

recursive_memoized[HashMap<u64, u64>, 10]

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

6.2 µs

iter_with_large_setup

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

< 1 ns

recursive[10]

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

6.5 µs

graph_coloring[4]

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

3.5 µs

init_array[1000]

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

4 µs

rat_in_maze[6]

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

5.6 µs

sort

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

4.9 ms

n_queens_solver[5]

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

9 µs

rat_in_maze[5]

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

4.6 µs

fibo_50

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

4.5 µs

sort_unstable

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

3.3 ms

recursive_memoized[HashMap<u64, u64>, 5]

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

4.6 µs

generate_gray_code[5]

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

1.9 µs

find_highest_set_bit[42]

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

5.8 µs

generate_gray_code[1]

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

2.1 µs

hamiltonian_cycle[7]

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

6.5 µs

hamiltonian_cycle[6]

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

5.8 µs

recursive_memoized[BTreeMap<u64, u64>, 0]

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

3.7 µs

subset_sum[18]

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

4.1 µs

count_set_bits[255]

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

3.5 µs

recursive_memoized[BTreeMap<u64, u64>, 20]

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

3.5 µs

add_two_integers[(65535, -65535)]

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

4.8 µs

permutations[5]

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

14 µs

recursive_memoized[HashMap<u64, u64>, 0]

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

4 µs

from_elem[8192]

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

503 ns

generate_combinations[8]

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

3 µs

generate_gray_code[2]

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

3.8 µs

count_set_bits[1024]

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

3.5 µs

rem

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

3.6 µs

iterative[20]

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

5 µs

knight_tour[8]

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

293.1 ms

knight_tour[7]

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

249.6 ms

generate_combinations[6]

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

1.3 µs

bench_array1[42]

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

6.5 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

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

2.9 µs

Recursive

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

52.3 µs

count_set_bits[42]

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

3.5 µs

recursive[30]

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

6.1 ms

subset_sum[16]

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

4 µs

rat_in_maze[7]

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

3.2 µs

generate_parentheses[4]

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

6.9 µs

permutations[4]

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

2.3 µs

add

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

4.5 µs

add_two_integers[(255, 255)]

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

5 µs

knight_tour[6]

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

8.6 ms

Auto

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

3 ns

find_highest_set_bit[65535]

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

5.8 µs

with_input[5]

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

< 1 ns

build_vec

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

212 ns

find_highest_set_bit[0]

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

5.8 µs

from_elem_decimal[1024]

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

82 ns

n_queens_solver[8]

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

532.9 µs

iter_with_large_drop

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

< 1 ns

sum_fold

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

304 ns

iter_batched_per_iteration

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

40 ns

system_time

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

4.9 µs

generate_gray_code[3]

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

3.6 µs

count_set_bits[65535]

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

3.5 µs

iterative[30]

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

6.6 µs

Iterative[20]

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

21 ns

knight_tour[5]

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

296.7 µs

permutations[3]

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

2.8 µs

generate_parentheses[6]

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

69.2 µs

sort_unstable

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

109.7 µs

Recursive[20]

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

52.3 µs

find_highest_set_bit[255]

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

5.8 µs

init_array[42]

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

6.5 µs

iter_batched_large_input

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

< 1 ns

fibonacci_custom_measurement

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

421 ns

n_queens_solver[6]

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

22.1 µs

hamiltonian_cycle[5]

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

5.2 µs

small_drop

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

< 1 ns

bench_array1[10]

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

4.9 µs

subset_sum[14]

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

4.1 µs

recursive_memoized[BTreeMap<u64, u64>, 5]

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

5.8 µs

small_setup

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

1 ns

bench_array2[1]

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

3.6 µs

bench_array2[4]

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

3.9 µs

mut_borrow

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

4 µs

"*benchmark/" '

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

< 1 ns

add_two_integers[(42, 13)]

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

5 µs

fibo_10

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

4.5 µs

large_setup

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

11 ns

bench_array2[42]

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

6.5 µs

add_two_integers[(1024, -1024)]

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

4.2 µs

graph_coloring[5]

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

3.8 µs

generate_combinations[5]

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

3.2 µs

bench_array1[1]

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

3.6 µs

recursive_memoized[BTreeMap<u64, u64>, 10]

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

4.1 µs

div

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

3.6 µs

instant

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

4.9 µs

recursive[0]

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

4.5 µs

graph_coloring[6]

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

4.2 µs

generate_parentheses[3]

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

2.4 µs

iterative[0]

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

3.4 µs

recursive[5]

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

4.4 µs

count_set_bits[0]

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

464 ns

sudoku

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

109.5 µs

add_two_integers[(0, 0)]

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

5.6 µs

permutations[7]

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

769.6 µs

tsc (aarch64)

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

3.1 µs

bench_array1[4]

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

3.9 µs

recursive_memoized[HashMap<u64, u64>, 20]

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

3.3 µs

init_array[4]

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

3.9 µs

system_time

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

6.7 µs

mul

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

5.4 µs

generate_parentheses[5]

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

22.1 µs

bench_array2[10]

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

4.9 µs

generate_combinations[7]

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

2 µs

Home Terms Privacy Docs