Avatar for the CodSpeedHQ user
CodSpeedHQ
codspeed-rust
BlogDocsChangelog

Local runbyGuillaumeLagrange
Avatar for the GuillaumeLagrange user

Instrumentation
5 days ago

Compare

Base
Search a run
Head
Local run
5 days ago
byGuillaumeLagrange
Avatar for the GuillaumeLagrange user
Compare
Suggested base runs:

Benchmarks

add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(42, 13)]
154.4 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(0, 0)]
150.3 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[1]
3.1 µs
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(255, 255)]
154.4 ns
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(65535, -65535)]
257.8 ns
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[8]
17.4 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[9]
24.2 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[7]
284 µs
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[2]
3.4 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[3]
9.8 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(1024, -1024)]
241.1 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[0]
90.8 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[5]
25 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[8]
775.3 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[6]
126.7 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[3]
4.5 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[4]
8.8 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[4]
18.1 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[7]
201.4 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[5]
43.3 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[5]
9.3 µs
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[4]
6.1 µs
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[255]
90.8 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[42]
90.8 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[1024]
90.8 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[12]
4.1 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[0]
119.2 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[65535]
90.8 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[255]
128.6 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[42]
123.1 ns
tsc (x86)
crates/divan_compat/examples/benches/time.rs::duration_since::tsc (x86)
< 1 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[5]
320.3 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since::system_time
374.4 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[6]
39.1 µs
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[10]
932.5 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[65535]
137.5 ns
tsc (x86)
crates/divan_compat/examples/benches/time.rs::now::tsc (x86)
< 1 ns
system_time
crates/divan_compat/examples/benches/time.rs::now::system_time
335.8 ns
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[0]
240.3 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[10]
175.8 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[20]
79.2 µs
add
crates/divan_compat/examples/benches/math.rs::add
91.4 ns
instant
crates/divan_compat/examples/benches/time.rs::now::instant
335.8 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[30]
236.9 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[20]
206.4 ns
rem
crates/divan_compat/examples/benches/math.rs::rem
124.4 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since::instant
373.1 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[30]
9.7 ms
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 0]
371.7 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[10]
2.4 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 10]
2.9 µs
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[1024]
120.8 ns
div
crates/divan_compat/examples/benches/math.rs::div
124.2 ns
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::sudoku
118.7 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 5]
3.7 µs
mul
crates/divan_compat/examples/benches/math.rs::mul
91.4 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[5]
160.6 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[14]
4.4 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 0]
923.9 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[18]
8.2 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[0]
148.3 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[16]
7.9 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 5]
2.3 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 30]
13.4 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random::sort_unstable
6.5 ms
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted::sort_unstable
404.7 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[7]
7.1 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 10]
5 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 30]
8.3 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 20]
8 µs
sort
crates/divan_compat/examples/benches/sort.rs::random::sort
8 ms
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 20]
6.7 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted::sort
464.1 µs
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[7]
1.6 ms
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[6]
19 ms
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[7]
568.2 ms
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[3]
6.7 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[6]
6.6 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[8]
661.1 ms
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[8]
7.4 µs
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[5]
666.2 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[6]
222.3 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[5]
40.3 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[5]
6.8 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[6]
7.1 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[4]
12.6 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[5]
5.3 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[7]
7.4 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[5]
6 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[5]
8.1 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[4]
6.5 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[3]
7.9 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[6]
10.7 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[6]
5.4 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[4]
5.5 µs
© 2025 CodSpeed Technology
Home Terms PrivacyDocs