CodSpeedHQ
codspeed-rust
BlogDocsChangelog

chore(divan_compat): fix readme typo

#77Merged
Comparing
fix-readme-typo
(
dbf688b
) with
main
(
cb639f1
)
CodSpeed Performance Gauge
-50%
Improvements
4
Regressions
4
Untouched
90

Benchmarks

Failed

recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
Regression
CodSpeed Performance Gauge
-4%
408.6 ns426.6 ns
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
Regression
CodSpeed Performance Gauge
-67%
6.7 ns20.2 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
Regression
CodSpeed Performance Gauge
-4%
2.8 µs2.9 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-4%
1.3 µs1.4 µs

Improved

graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+16%
1,112 ns956 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
+6%
13.7 ns13 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
+5%
< 1 ns< 1 ns
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+5%
14.7 µs14 µs

Passed

graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+3%
1.1 µs1.1 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
23 µs22.8 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
1.6 µs1.6 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
125.1 µs124.3 µs
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
797.5 µs793.4 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
66.3 µs66 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
21.9 µs21.7 µ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
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 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
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.5 µs1.5 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
806 ns803 ns
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.6 µ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
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
109.9 µs109.6 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
250.1 ms249.5 ms
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns5.7 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
8.6 ms8.6 ms
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
6.1 ms6.1 ms
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
296.2 µs296.1 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
3.3 ms3.3 ms
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
39.4 ns39.4 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4 µs4 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
878 ns878 ns
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
system_time
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.1 ns38.1 ns
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
7.4 ns7.4 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1.1 µs1.1 µs
add
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.2 ns2.2 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
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
3.1 ns3.1 ns
mul
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.6 ns2.6 ns
fibo_500
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
446.1 ns446.1 ns
instant
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.1 ns38.1 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4.1 µs4.1 µs
mut_borrow
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
7.9 ns7.9 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
15.8 ns15.8 ns
rem
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns3.5 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
34.3 ns34.3 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
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
66.8 ns66.8 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
2.2 ns2.2 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
573.6 ns573.6 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[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
16.7 ns16.7 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
6.9 µs6.9 µs
div
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns3.5 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns13.6 ns
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
2.3 µs2.3 µs
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
20.2 ns20.2 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
50.8 ns50.8 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.7 µs1.7 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
109.7 µs109.7 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
137.4 µs137.4 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
789.6 ns791.1 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
696.6 ns698.1 ns
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
546.6 ns548.1 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
293.7 ms294.7 ms
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.7 ns1.7 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
533.2 µs535.1 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
3.3 µs3.3 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
68 µs68.3 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
5.6 µs5.7 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
639.6 ns642.6 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-1%
129.6 ns130.4 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-1%
513.6 ns516.6 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
1.9 µs1.9 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-1%
180.3 ns181.4 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-1%
1.8 µs1.9 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
923 ns929 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-1%
893 ns899 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
779 ns785 ns
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
714.6 ns720.6 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
4.2 µs4.3 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
698 ns704 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
581.1 ns587.1 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
2 µs2 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
3 µs3 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-1%
447.6 ns453.6 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
-1%
10.2 ns10.4 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
2.3 µs2.3 µs
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-2%
234.6 ns238.4 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
8.8 µs8.9 µs

Commits

Click on a commit to change the comparison range
Base
main
cb639f1
-50%
chore(divan_compat): fix readme typo
dbf688b
9 months ago
by GuillaumeLagrange
© 2025 CodSpeed Technology
Home Terms Privacy Docs