102 lines
2.3 KiB
Rust
102 lines
2.3 KiB
Rust
|
// Copyright 2017 The Rust Project Developers. See the COPYRIGHT
|
||
|
// file at the top-level directory of this distribution and at
|
||
|
// http://rust-lang.org/COPYRIGHT.
|
||
|
//
|
||
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
||
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
||
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
||
|
// option. This file may not be copied, modified, or distributed
|
||
|
// except according to those terms.
|
||
|
|
||
|
use core::iter::*;
|
||
|
use test::{Bencher, black_box};
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_rposition(b: &mut Bencher) {
|
||
|
let it: Vec<usize> = (0..300).collect();
|
||
|
b.iter(|| {
|
||
|
it.iter().rposition(|&x| x <= 150);
|
||
|
});
|
||
|
}
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_skip_while(b: &mut Bencher) {
|
||
|
b.iter(|| {
|
||
|
let it = 0..100;
|
||
|
let mut sum = 0;
|
||
|
it.skip_while(|&x| { sum += x; sum < 4000 }).all(|_| true);
|
||
|
});
|
||
|
}
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_multiple_take(b: &mut Bencher) {
|
||
|
let mut it = (0..42).cycle();
|
||
|
b.iter(|| {
|
||
|
let n = it.next().unwrap();
|
||
|
for _ in 0..n {
|
||
|
it.clone().take(it.next().unwrap()).all(|_| true);
|
||
|
}
|
||
|
});
|
||
|
}
|
||
|
|
||
|
fn scatter(x: i32) -> i32 { (x * 31) % 127 }
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_max_by_key(b: &mut Bencher) {
|
||
|
b.iter(|| {
|
||
|
let it = 0..100;
|
||
|
it.max_by_key(|&x| scatter(x))
|
||
|
})
|
||
|
}
|
||
|
|
||
|
// http://www.reddit.com/r/rust/comments/31syce/using_iterators_to_find_the_index_of_the_min_or/
|
||
|
#[bench]
|
||
|
fn bench_max_by_key2(b: &mut Bencher) {
|
||
|
fn max_index_iter(array: &[i32]) -> usize {
|
||
|
array.iter().enumerate().max_by_key(|&(_, item)| item).unwrap().0
|
||
|
}
|
||
|
|
||
|
let mut data = vec![0; 1638];
|
||
|
data[514] = 9999;
|
||
|
|
||
|
b.iter(|| max_index_iter(&data));
|
||
|
}
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_max(b: &mut Bencher) {
|
||
|
b.iter(|| {
|
||
|
let it = 0..100;
|
||
|
it.map(scatter).max()
|
||
|
})
|
||
|
}
|
||
|
|
||
|
pub fn copy_zip(xs: &[u8], ys: &mut [u8]) {
|
||
|
for (a, b) in ys.iter_mut().zip(xs) {
|
||
|
*a = *b;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
pub fn add_zip(xs: &[f32], ys: &mut [f32]) {
|
||
|
for (a, b) in ys.iter_mut().zip(xs) {
|
||
|
*a += *b;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_zip_copy(b: &mut Bencher) {
|
||
|
let source = vec![0u8; 16 * 1024];
|
||
|
let mut dst = black_box(vec![0u8; 16 * 1024]);
|
||
|
b.iter(|| {
|
||
|
copy_zip(&source, &mut dst)
|
||
|
})
|
||
|
}
|
||
|
|
||
|
#[bench]
|
||
|
fn bench_zip_add(b: &mut Bencher) {
|
||
|
let source = vec![1.; 16 * 1024];
|
||
|
let mut dst = vec![0.; 16 * 1024];
|
||
|
b.iter(|| {
|
||
|
add_zip(&source, &mut dst)
|
||
|
});
|
||
|
}
|