CodSpeedHQ
codspeed-rust
BlogDocsChangelog

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

#81Merged
Comparing
add-targets-to-moon-ci-rust-setup
(
8960fbf
) with
main
(
795aa74
)
CodSpeed Performance Gauge
-51%
Improvements
5
Regressions
3
Untouched
86
Ignored
4

Benchmarks

Failed

generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-5%
20.7 µs21.7 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-5%
69.6 µs73.2 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-4%
630.6 ns657.6 ns

Improved

add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
×3
20.2 ns6.7 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
×3
20.2 ns6.7 ns
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+19%
1,136 ns956 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+5%
1.1 µs1.1 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+3%
902 ns872 ns

Passed

permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+20%
17 µs14.1 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+6%
3.2 µs3 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+6%
9.5 µs9 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+5%
567.6 ns540.6 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
+3%
513.6 ns498.6 ns
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+2%
731.1 ns717.6 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
784.9 µs775.5 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
68.9 µs68.2 µs
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
+1%
5.7 ns5.7 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
6.9 µs6.8 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
2.3 µs2.3 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1.3 µs1.3 µs
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1.9 µs1.9 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1 µs1 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
2.1 µs2.1 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
250.1 ms249.5 ms
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
296.9 µs296.3 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
181 ns180.6 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
sort
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
137.4 µs137.3 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
293.9 ms293.6 ms
sort
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
4.9 ms4.9 ms
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
2.8 µs2.8 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
66.8 ns66.8 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4.1 µs4.1 µs
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
7.4 ns7.4 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
50.8 ns50.8 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.5 µs1.5 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
75.4 ns75.4 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
7.9 ns7.9 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
34.3 ns34.3 ns
mul
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.6 ns2.6 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
129.6 ns129.6 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
rem
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns3.5 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
1.9 µs1.9 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
3.3 µs3.3 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
15.8 ns15.8 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
16.7 ns16.7 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4 µs4 µs
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
5.6 µs5.6 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
14.5 ns14.5 ns
fibo_500
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
446.1 ns446.1 ns
add
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
div
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns3.5 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
573.6 ns573.6 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
3.1 ns3.1 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
779 ns779 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
109.7 µs109.7 µs
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
39.4 ns39.4 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
6.1 ms6.1 ms
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
533.4 µs534.1 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
3.3 ms3.3 ms
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
109.3 µs109.5 µs
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
0%
13.4 ns13.4 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.5 ns5.5 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
8.6 ms8.6 ms
instant
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.1 ns38.2 ns
system_time
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.1 ns38.2 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
49.6 µs49.8 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
447.6 ns449.1 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
893 ns896 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.7 ns1.7 ns
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
704 ns707 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
698 ns701 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
124.3 µs124.9 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
795.6 ns800.1 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
4.2 µs4.2 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
2 µs2 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
22.1 µs22.2 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
-1%
< 1 ns< 1 ns
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-1%
399.6 ns404.9 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-1%
1.7 µs1.7 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
2.3 µs2.3 µs
instant
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
-2%
10.2 ns10.4 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
1.6 µs1.6 µs
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-3%
232.4 ns238.4 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-9%
1 µs1.1 µs

Ignored

recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
Ignored
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
CodSpeed Performance Gauge
0%
803 ns806 ns
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
CodSpeed Performance Gauge
0%
929 ns926 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
CodSpeed Performance Gauge
+1%
582.6 ns579.6 ns

Commits

Click on a commit to change the comparison range
Base
main
795aa74
-50.7%
ci: add targets to moon-repo/setup in binary artifact build
8960fbf
9 months ago
by GuillaumeLagrange
© 2025 CodSpeed Technology
Home Terms Privacy Docs