64c915e3ad
This keeps the slice based iteration and updates the iterator state after each slice. It also uses a loop to reduce the amount of code. This uses unsafe code, so some thorough review would be appreciated.
54 lines
1 KiB
Rust
54 lines
1 KiB
Rust
use std::collections::VecDeque;
|
|
use test::{Bencher, black_box};
|
|
|
|
#[bench]
|
|
fn bench_new(b: &mut Bencher) {
|
|
b.iter(|| {
|
|
let ring: VecDeque<i32> = VecDeque::new();
|
|
black_box(ring);
|
|
})
|
|
}
|
|
|
|
#[bench]
|
|
fn bench_grow_1025(b: &mut Bencher) {
|
|
b.iter(|| {
|
|
let mut deq = VecDeque::new();
|
|
for i in 0..1025 {
|
|
deq.push_front(i);
|
|
}
|
|
black_box(deq);
|
|
})
|
|
}
|
|
|
|
#[bench]
|
|
fn bench_iter_1000(b: &mut Bencher) {
|
|
let ring: VecDeque<_> = (0..1000).collect();
|
|
|
|
b.iter(|| {
|
|
let mut sum = 0;
|
|
for &i in &ring {
|
|
sum += i;
|
|
}
|
|
black_box(sum);
|
|
})
|
|
}
|
|
|
|
#[bench]
|
|
fn bench_mut_iter_1000(b: &mut Bencher) {
|
|
let mut ring: VecDeque<_> = (0..1000).collect();
|
|
|
|
b.iter(|| {
|
|
let mut sum = 0;
|
|
for i in &mut ring {
|
|
sum += *i;
|
|
}
|
|
black_box(sum);
|
|
})
|
|
}
|
|
|
|
#[bench]
|
|
fn bench_try_fold(b: &mut Bencher) {
|
|
let ring: VecDeque<_> = (0..1000).collect();
|
|
|
|
b.iter(|| black_box(ring.iter().try_fold(0, |a, b| Some(a + b))))
|
|
}
|