GitHub Actions run on branch add-targets-to-moon-ci-rust-setup - CodSpeedHQ/codspeed-rust

GitHub Actions
run

Instrumentation

4 days ago d6a9b34 add-targets-to-moon-ci-rust-setup

Compare

Base

Search a run

Head

ci: add targets to moon-repo/setup in binary artifact build

#81

add-targets-to-moon-ci-rust-setup

4 days ago

Compare

Suggested base runs: •

Benchmarks

recursive[0]

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

211.1 ns

recursive[10]

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

932.5 ns

build_vec

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

2.8 µs

recursive[30]

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

9.7 ms

recursive[20]

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

79.1 µs

with_input[5]

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

0 s

iter_batched_ref_per_iteration

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_ref_per_iteration

0 s

recursive[5]

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

291.1 ns

add_two_integers[(0, 0)]

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

150.3 ns

fibo_500

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

286.9 ns

iterative[0]

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

119.2 ns

with_input[5]

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

0 s

iterative[5]

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

160.6 ns

mut_borrow

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

866.7 ns

sum_fold

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

254.4 ns

iterative[20]

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

206.4 ns

bench_without_explicit_measurement

crates/criterion_compat/benches/test_benches.rs::only_codspeed::bench_using_group_without_explicit_measurement::group::bench_without_explicit_measurement

0 s

fibo_10

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

90 ns

add_two_integers[(42, 13)]

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

154.4 ns

iterative[10]

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

175.8 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

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

400.8 ns

generate_gray_code[3]

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

4.5 µs

add_two_integers[(65535, -65535)]

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

257.8 ns

add_two_integers[(1024, -1024)]

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

241.1 ns

generate_gray_code[2]

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

3.5 µs

rem

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

124.4 ns

generate_gray_code[4]

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

6 µs

iterative[30]

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

236.9 ns

add_two_integers[(255, 255)]

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

154.4 ns

find_highest_set_bit[255]

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

90.8 ns

fibo_iterative

crates/codspeed/benches/native.rs::fibo_iterative

126.7 ns

with_input[5]

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

0 s

find_highest_set_bit[42]

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

90.8 ns

sort

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

464 µs

fibo_recursive

crates/codspeed/benches/native.rs::fibo_recursive

916.7 ns

div

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

124.2 ns

find_highest_set_bit[0]

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

90.8 ns

recursive_memoized[BTreeMap<u64, u64>, 10]

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

2.9 µs

fibo_recursive_cached

crates/codspeed/benches/native.rs::fibo_recursive_cached

6.3 µs

generate_gray_code[5]

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

9.2 µs

bench_explicit_measurement

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

0 s

find_highest_set_bit[1024]

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

90.8 ns

count_set_bits[255]

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

99.4 ns

recursive_memoized[BTreeMap<u64, u64>, 5]

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

2.3 µs

count_set_bits[0]

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

90 ns

mul

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

91.4 ns

recursive_memoized[HashMap<u64, u64>, 5]

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

3.6 µs

count_set_bits[42]

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

93.9 ns

generate_gray_code[1]

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

3.2 µs

subset_sum[10]

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

2.4 µs

subset_sum[12]

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

4.1 µs

recursive_memoized[HashMap<u64, u64>, 20]

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

8 µs

add

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

91.4 ns

rat_in_maze[6]

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

6.6 µs

count_set_bits[65535]

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

108.3 ns

find_highest_set_bit[65535]

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

90.8 ns

sudoku

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

118.6 µs

recursive_memoized[HashMap<u64, u64>, 0]

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

834.7 ns

subset_sum[16]

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

7.9 µs

subset_sum[14]

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

4.4 µs

sort_unstable

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

6.5 ms

recursive_memoized[HashMap<u64, u64>, 10]

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

4.9 µs

rat_in_maze[7]

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

7 µs

permutations[5]

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

39.9 µs

recursive_memoized[BTreeMap<u64, u64>, 30]

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

8.4 µs

rat_in_maze[8]

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

7.3 µs

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

254.7 ns

permutations[6]

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

219.6 µs

sort_unstable

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

404.7 µs

rat_in_maze[5]

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

6.1 µs

knight_tour[7]

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

568.2 ms

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

254.7 ns

hamiltonian_cycle[6]

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

7.1 µs

subset_sum[18]

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

8.2 µs

hamiltonian_cycle[5]

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

6.8 µs

permutations[3]

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

6.8 µs

permutations[7]

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

1.6 ms

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

2.8 µs

permutations[4]

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

12.6 µs

hamiltonian_cycle[4]

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

6.5 µs

sort

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

8 ms

knight_tour[6]

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

19 ms

hamiltonian_cycle[7]

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

7.4 µs

recursive_memoized[BTreeMap<u64, u64>, 20]

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

6.7 µs

system_time

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

374.4 ns

recursive_memoized[HashMap<u64, u64>, 30]

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

13.2 µs

generate_parentheses[4]

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

17.8 µs

generate_parentheses[6]

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

124.1 µs

generate_parentheses[5]

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

42.4 µs

tsc (x86)

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

0 s

n_queens_solver[8]

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

773.4 µs

instant

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

363.6 ns

n_queens_solver[4]

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

8.8 µs

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

3.4 µs

n_queens_solver[7]

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

200.6 µs

instant

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

373.1 ns

graph_coloring[6]

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

5.5 µs

graph_coloring[3]

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

7.8 µs

generate_combinations[5]

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

8.1 µs

n_queens_solver[5]

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

24.8 µs

knight_tour[8]

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

661.1 ms

system_time

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

363.6 ns

graph_coloring[4]

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

5.6 µs

count_set_bits[1024]

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

91.7 ns

n_queens_solver[6]

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

38.9 µs

generate_combinations[7]

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

291.2 µs

small_drop

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

0 s

Iterative[20]

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

103.6 ns

generate_combinations[6]

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

10.6 µs

generate_parentheses[3]

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

9.7 µs

large_drop

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

1 ms

from_elem[1024]

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

1.8 µs

generate_combinations[8]

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

17.2 µs

Linear

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

186.1 ns

tsc (x86)

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

0 s

Iterative

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

103.6 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_with_setup

0 s

generate_combinations[9]

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

24 µs

Recursive

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

80.9 µs

Recursive[21]

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

130.6 µs

Flat

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

536.9 ns

from_elem[2048]

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

3.8 µs

graph_coloring[5]

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

5.3 µs

from_elem_decimal[2048]

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

3.4 µs

iter

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter

0 s

iter_with_setup

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

0 s

from_elem[4096]

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

6.6 µs

iter_with_large_drop

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

0 s

Iterative[21]

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

105.3 ns

small_setup

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

0 s

iter_with_large_setup

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_with_large_setup

0 s

iter_with_setup

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

0 s

from_elem[8192]

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

10.7 µs

iter_batched_per_iteration

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

0 s

large_setup

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

0 s

"*benchmark/" '

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

0 s

fibonacci_custom_measurement

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

916.7 ns

iter

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

0 s

iter_batched_small_input

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

0 s

iter_with_large_setup

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

0 s

from_elem[16384]

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

19 µs

iter_batched_ref_large_input

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

0 s

from_elem_decimal[1024]

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

1.8 µs

iter_batched_ref_small_input

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_ref_small_input

0 s

Auto

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

186.1 ns

iter_batched_ref_large_input

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_ref_large_input

0 s

iter_batched_ref_small_input

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

0 s

iter_with_large_drop

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_with_large_drop

0 s

iter_batched_per_iteration

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_per_iteration

0 s

iter_batched_ref_per_iteration

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

0 s

knight_tour[5]

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

666.3 µs

iter_batched_small_input

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_small_input

0 s

iter_batched_large_input

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

0 s

Recursive[20]

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

80.9 µs

iter_batched_large_input

crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead::iter_batched_large_input

0 s

Home Terms Privacy Docs