Comparing
cod-1374-codspeed-rust-add-perf-v2-support
(c9b70bf
) withmain
(4be2e55
)-63%
- Improvement
- 10
- Regression
- 22
- Untouched
- 126
- New
- 14
- Ignored
- 5
Benchmarks
177 total
print_env_hello
crates/divan_compat/examples/benches/env.rs-63%
1.9 µs5.2 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-37%
3.1 µs4.9 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-35%
603 ns926 ns
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-30%
1.3 µs1.9 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-26%
701 ns953 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-26%
1.5 µs2.1 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-25%
774 ns1,028 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci-15%
2.9 µs3.4 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci-13%
1.5 µs1.8 µs
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench-13%
1.8 µs2 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci-11%
5.7 µs6.4 µs
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci-11%
383 ns428 ns
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci-10%
3.3 µs3.7 µs
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci-9%
31 ns34 ns
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-7%
983 ns1,061 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-7%
1.1 µs1.1 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-7%
917 ns983 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-7%
21.7 µs23.2 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci-5%
47.7 µs50.2 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci-5%
5.9 ms6.1 ms
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-4%
68 µs71.1 µs
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking-4%
20.1 µs20.9 µs
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs×3.1
61.4 µs20.1 µs
fibo_10
crates/divan_compat/benches/basic_example.rs×2
2 ns1 ns
sort
crates/divan_compat/examples/benches/sort.rs::sorted+17%
139.2 µs118.8 µs
Commits
Click on a commit to change the comparison rangeBase
main
4be2e55
-62.57%
feat(divan_compat): add recursive fib example
c9b70bf
5 months ago
by not-matthias