|
1 |
| -use codspeed_criterion_compat::{criterion_group, BenchmarkId, Criterion}; |
| 1 | +use codspeed_criterion_compat::{black_box, criterion_group, BenchmarkId, Criterion}; |
2 | 2 |
|
3 | 3 | fn fibonacci_slow(n: u64) -> u64 {
|
4 | 4 | match n {
|
@@ -27,14 +27,16 @@ fn fibonacci_fast(n: u64) -> u64 {
|
27 | 27 | fn compare_fibonaccis(c: &mut Criterion) {
|
28 | 28 | let mut group = c.benchmark_group("Fibonacci");
|
29 | 29 |
|
30 |
| - group.bench_with_input("Recursive", &20, |b, i| b.iter(|| fibonacci_slow(*i))); |
| 30 | + group.bench_with_input("Recursive", &20, |b, i| { |
| 31 | + b.iter(|| fibonacci_slow(black_box(*i))) |
| 32 | + }); |
31 | 33 | group.bench_with_input("Iterative", &20, |b, i| b.iter(|| fibonacci_fast(*i)));
|
32 | 34 | }
|
33 | 35 | fn compare_fibonaccis_group(c: &mut Criterion) {
|
34 | 36 | let mut group = c.benchmark_group("Fibonacci3");
|
35 | 37 | for i in 20..=21 {
|
36 | 38 | group.bench_with_input(BenchmarkId::new("Recursive", i), &i, |b, i| {
|
37 |
| - b.iter(|| fibonacci_slow(*i)) |
| 39 | + b.iter(|| fibonacci_slow(black_box(*i))) |
38 | 40 | });
|
39 | 41 | group.bench_with_input(BenchmarkId::new("Iterative", i), &i, |b, i| {
|
40 | 42 | b.iter(|| fibonacci_fast(*i))
|
|
0 commit comments