111 lines
2.7 KiB
Rust
111 lines
2.7 KiB
Rust
// Copyright 2013-2014 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 prelude::*;
|
|
use std::rand;
|
|
use std::rand::Rng;
|
|
use test::{Bencher, black_box};
|
|
|
|
pub fn insert_rand_n<M, I, R>(n: usize,
|
|
map: &mut M,
|
|
b: &mut Bencher,
|
|
mut insert: I,
|
|
mut remove: R) where
|
|
I: FnMut(&mut M, usize),
|
|
R: FnMut(&mut M, usize),
|
|
{
|
|
// setup
|
|
let mut rng = rand::weak_rng();
|
|
|
|
for _ in 0..n {
|
|
insert(map, rng.gen::<usize>() % n);
|
|
}
|
|
|
|
// measure
|
|
b.iter(|| {
|
|
let k = rng.gen::<usize>() % n;
|
|
insert(map, k);
|
|
remove(map, k);
|
|
});
|
|
black_box(map);
|
|
}
|
|
|
|
pub fn insert_seq_n<M, I, R>(n: usize,
|
|
map: &mut M,
|
|
b: &mut Bencher,
|
|
mut insert: I,
|
|
mut remove: R) where
|
|
I: FnMut(&mut M, usize),
|
|
R: FnMut(&mut M, usize),
|
|
{
|
|
// setup
|
|
for i in 0..n {
|
|
insert(map, i * 2);
|
|
}
|
|
|
|
// measure
|
|
let mut i = 1;
|
|
b.iter(|| {
|
|
insert(map, i);
|
|
remove(map, i);
|
|
i = (i + 2) % n;
|
|
});
|
|
black_box(map);
|
|
}
|
|
|
|
pub fn find_rand_n<M, T, I, F>(n: usize,
|
|
map: &mut M,
|
|
b: &mut Bencher,
|
|
mut insert: I,
|
|
mut find: F) where
|
|
I: FnMut(&mut M, usize),
|
|
F: FnMut(&M, usize) -> T,
|
|
{
|
|
// setup
|
|
let mut rng = rand::weak_rng();
|
|
let mut keys: Vec<_> = (0..n).map(|_| rng.gen::<usize>() % n).collect();
|
|
|
|
for k in &keys {
|
|
insert(map, *k);
|
|
}
|
|
|
|
rng.shuffle(&mut keys);
|
|
|
|
// measure
|
|
let mut i = 0;
|
|
b.iter(|| {
|
|
let t = find(map, keys[i]);
|
|
i = (i + 1) % n;
|
|
black_box(t);
|
|
})
|
|
}
|
|
|
|
pub fn find_seq_n<M, T, I, F>(n: usize,
|
|
map: &mut M,
|
|
b: &mut Bencher,
|
|
mut insert: I,
|
|
mut find: F) where
|
|
I: FnMut(&mut M, usize),
|
|
F: FnMut(&M, usize) -> T,
|
|
{
|
|
// setup
|
|
for i in 0..n {
|
|
insert(map, i);
|
|
}
|
|
|
|
// measure
|
|
let mut i = 0;
|
|
b.iter(|| {
|
|
let x = find(map, i);
|
|
i = (i + 1) % n;
|
|
black_box(x);
|
|
})
|
|
}
|