CodSpeedHQ
codspeed-rust
BlogDocsChangelog

Add divan_compat msrv check in CI

#74Merged
Comparing
cod-541-add-msrv-check-in-ci
(
38f7270
) with
main
(
a0b46d4
)
CodSpeed Performance Gauge
-10%
Improvements
1
Regressions
5
Untouched
92

Benchmarks

Failed

graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-3%
1 µs1.1 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-3%
716.1 ns741.6 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
Regression
CodSpeed Performance Gauge
-5%
13 ns13.6 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-7%
1.1 µs1.2 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-10%
66 µs73.2 µs

Improved

graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+11%
968 ns872 ns

Passed

recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
+3%
426.6 ns414.6 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
+3%
588.6 ns573.6 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+2%
794.3 µs779.1 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
22.5 µs22.2 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
4.3 µs4.3 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
2.3 µs2.3 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
791 ns785 ns
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
926 ns920 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
+1%
1.6 µs1.5 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
69.3 µs69 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
554.1 ns551.1 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
695 ns692 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
5.7 µs5.6 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
800 ns797 ns
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
3.3 µs3.3 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.7 ns1.7 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
239.1 ns238.4 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
2.1 µs2.1 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
518.1 ns516.6 ns
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
297.2 µs296.5 µs
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
109.9 µs109.8 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
137.4 µs137.2 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
4.9 ms4.9 ms
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
49.8 µs49.8 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
6.1 ms6.1 ms
instant
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.1 ns38.1 ns
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
20.9 ns20.9 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4.1 µs4.1 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
66.8 ns66.8 ns
div
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns3.5 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
16.7 ns16.7 ns
add
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
109.7 µs109.7 µs
fibo_500
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
446.1 ns446.1 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1 µs1 µs
system_time
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.2 ns38.2 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
896 ns896 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
14.5 ns14.5 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
20.9 ns20.9 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4 µs4 µs
rem
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns3.5 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
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
3 µs3 µs
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
2.2 ns2.2 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
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[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
75.4 ns75.4 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
1.9 µs1.9 µs
fibo_10
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
2 µs2 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
3.1 ns3.1 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1.9 µs1.9 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
701 ns701 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
39.2 ns39.2 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
15.8 ns15.8 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
51.3 ns51.3 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
8.3 ns8.3 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 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
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
14.5 µs14.5 µs
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
mul
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.6 ns2.6 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
533 µs533 µs
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
8.6 ms8.6 ms
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
249.7 ms249.9 ms
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
3.3 ms3.3 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>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
181.4 ns181.8 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
instant
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
0%
10.3 ns10.3 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
124.4 µs124.8 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
449.1 ns450.6 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
293.5 ms294.5 ms
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
21.9 µs21.9 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
2.3 µs2.3 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
578.1 ns581.1 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
6.9 µs7 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
1.3 µs1.3 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
-1%
< 1 ns< 1 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-1%
1.7 µs1.8 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-1%
130.8 ns132.3 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-1%
2.8 µs2.9 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
798.6 ns809.1 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
1.1 µs1.1 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
8.7 µs8.9 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
1.6 µs1.6 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
648.6 ns665.1 ns

Commits

Click on a commit to change the comparison range
Base
main
a0b46d4
-9.93%
feat: add msrv check in CI
38f7270
9 months ago
by GuillaumeLagrange
© 2025 CodSpeed Technology
Home Terms Privacy Docs