CodSpeedHQ
codspeed-rust
Blog
Docs
Changelog
Blog
Docs
Changelog
Overview
Branches
Benchmarks
Runs
feat: add readme to divan_compat
#75
Merged
Comparing
add-divan-todo
(
fd8f45d
) with
main
(
38f7270
)
CodSpeed Performance Gauge
-13%
Improvements
4
Regressions
3
Untouched
91
This report only contains results for the
Wall Time
instrument. To view results for the
CPU Simulation
instrument,
click here
.
Benchmarks
Failed
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-3%
769 µs
794.3 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-3%
1 µs
1.1 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Regression
CodSpeed Performance Gauge
-13%
872 ns
1,004 ns
Improved
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+10%
73.6 µs
66.9 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+7%
14.8 µs
13.9 µs
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
+4%
425.1 ns
408.6 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
+3%
13.3 ns
12.8 ns
Passed
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+3%
4.3 µs
4.2 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
1.7 µs
1.7 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
1.1 µs
1.1 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
+1%
449.1 ns
444.6 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
6.9 µs
6.8 µs
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
+1%
899 ns
893 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
+1%
2.4 µs
2.3 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
5.7 µs
5.6 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns
5.7 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
785 ns
782 ns
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
3.2 µs
3.2 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.5 µs
1.5 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
294.1 ms
293 ms
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
3.3 µs
3.3 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1 µs
1 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
513.6 ns
512.1 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
49.7 µs
49.6 µs
system_time
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.2 ns
38.1 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
39.2 ns
39.1 ns
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
633.6 ns
632.1 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns
5.7 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns
5.7 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns
5.7 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.7 ns
5.7 ns
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
250.1 ms
249.6 ms
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
791.1 ns
789.6 ns
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
297.2 µs
296.6 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
124.9 µs
124.8 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
20.6 µs
20.6 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
3.3 ms
3.3 ms
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
68.3 µs
68.3 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
CodSpeed Performance Gauge
0%
4.9 ms
4.9 ms
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
109.7 µs
109.7 µs
div
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns
3.5 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
2.2 ns
2.2 ns
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
695 ns
695 ns
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
2.2 ns
2.2 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
1.9 µs
1.9 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
2.3 µs
2.3 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns
13.6 ns
add
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.2 ns
2.2 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns
13.6 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
1.7 ns
1.7 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns
13.6 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1.9 µs
1.9 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4.1 µs
4.1 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
690.6 ns
690.6 ns
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
20.9 ns
20.9 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
4 µs
4 µs
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns
13.6 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
233.1 ns
233.1 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
573.6 ns
573.6 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
2.1 µs
2.1 µs
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
5.5 ns
5.5 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
14.5 ns
14.5 ns
instant
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
38.1 ns
38.1 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
7.9 ns
7.9 ns
rem
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
3.5 ns
3.5 ns
mul
crates/divan_compat/examples/benches/math.rs
CodSpeed Performance Gauge
0%
2.6 ns
2.6 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
66.8 ns
66.8 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
16.7 ns
16.7 ns
fibo_500
crates/divan_compat/benches/basic_example.rs
CodSpeed Performance Gauge
0%
446.1 ns
446.1 ns
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
75.4 ns
75.4 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
8.3 ns
8.3 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
CodSpeed Performance Gauge
0%
3.1 ns
3.1 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
13.6 ns
13.6 ns
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
806 ns
806 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
0%
20.9 ns
20.9 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
51.3 ns
51.3 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
15.8 ns
15.8 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
8.6 ms
8.6 ms
sort
crates/divan_compat/examples/benches/sort.rs::sorted
CodSpeed Performance Gauge
0%
137.2 µs
137.4 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
109.7 µs
109.9 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
533 µs
534 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
6.1 ms
6.1 ms
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
34.3 ns
34.4 ns
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
914 ns
917 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
2.9 µs
2.9 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
0%
180.3 ns
181 ns
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
0%
1.3 µs
1.3 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
593.1 ns
596.1 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
9.3 µs
9.3 µs
instant
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
-1%
10.1 ns
10.2 ns
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
572.1 ns
576.6 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
CodSpeed Performance Gauge
-1%
< 1 ns
< 1 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
2 µs
2 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
22.3 µs
22.5 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-1%
707.1 ns
716.1 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
CodSpeed Performance Gauge
-1%
130.4 ns
132.3 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
CodSpeed Performance Gauge
-2%
1.1 µs
1.1 µs
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
CodSpeed Performance Gauge
-2%
1.7 µs
1.7 µs
Commits
Click on a commit to change the comparison range
Base
main
38f7270
-13.15%
feat: add readme to divan_compat
fd8f45d
9 months ago
by GuillaumeLagrange
© 2025 CodSpeed Technology
Home
Terms
Privacy
Docs