Comparing
cod-711-file-name-missing-in-codspeed-rust-flamegraph
(d7a1b4b
) withmain
(250ad31
)-19%
- Improvement
- 3
- Untouched
- 153
- New
- 1
- Dropped
- 1
- Ignored
- 9
Benchmarks
167 total
fibo_500
crates/divan_compat/benches/basic_example.rsMissing
N/A
257.8 nsN/A
fibo_10
crates/divan_compat/benches/basic_example.rs+32%
119.2 ns90 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench+32%
119.2 ns90 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench+32%
119.2 ns90 ns
fibo_50
crates/divan_compat/benches/basic_example.rsN/A
N/A90.3 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
8.1 µs8.1 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
10.7 µs10.6 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
17.3 µs17.2 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
24.1 µs24 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
291.2 µs291.2 µs
mut_borrow
crates/divan_compat/benches/basic_example.rs0%
895.8 ns895.8 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
6 µs6 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
9.2 µs9.2 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
90.8 ns90.8 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
90.8 ns90.8 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci0%
8.4 µs8.4 µs
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
90.8 ns90.8 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
90.8 ns90.8 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench0%
125.3 ns125.3 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci0%
863.9 ns863.9 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking0%
4.1 µs4.1 µs
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench0%
154.4 ns154.4 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci0%
6.7 µs6.7 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation0%
90.8 ns90.8 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci0%
4.9 µs4.9 µs
Commits
Click on a commit to change the comparison rangeBase
main
250ad31
-53.23%
fix(divan): fix bench overflowing
d7a1b4b
11 months ago
by GuillaumeLagrange