21ac985af4
As part of the collections reform RFC, this commit removes all collections traits in favor of inherent methods on collections themselves. All methods should continue to be available on all collections. This is a breaking change with all of the collections traits being removed and no longer being in the prelude. In order to update old code you should move the trait implementations to inherent implementations directly on the type itself. Note that some traits had default methods which will also need to be implemented to maintain backwards compatibility. [breaking-change] cc #18424
89 lines
2.1 KiB
Rust
89 lines
2.1 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 std::prelude::*;
|
|
use std::rand;
|
|
use std::rand::Rng;
|
|
use test::Bencher;
|
|
|
|
pub fn insert_rand_n<M>(n: uint, map: &mut M, b: &mut Bencher,
|
|
insert: |&mut M, uint|,
|
|
remove: |&mut M, uint|) {
|
|
// setup
|
|
let mut rng = rand::weak_rng();
|
|
|
|
for _ in range(0, n) {
|
|
insert(map, rng.gen::<uint>() % n);
|
|
}
|
|
|
|
// measure
|
|
b.iter(|| {
|
|
let k = rng.gen::<uint>() % n;
|
|
insert(map, k);
|
|
remove(map, k);
|
|
})
|
|
}
|
|
|
|
pub fn insert_seq_n<M>(n: uint, map: &mut M, b: &mut Bencher,
|
|
insert: |&mut M, uint|,
|
|
remove: |&mut M, uint|) {
|
|
// setup
|
|
for i in range(0u, n) {
|
|
insert(map, i * 2);
|
|
}
|
|
|
|
// measure
|
|
let mut i = 1;
|
|
b.iter(|| {
|
|
insert(map, i);
|
|
remove(map, i);
|
|
i = (i + 2) % n;
|
|
})
|
|
}
|
|
|
|
pub fn find_rand_n<M, T>(n: uint, map: &mut M, b: &mut Bencher,
|
|
insert: |&mut M, uint|,
|
|
find: |&M, uint| -> T) {
|
|
// setup
|
|
let mut rng = rand::weak_rng();
|
|
let mut keys = Vec::from_fn(n, |_| rng.gen::<uint>() % n);
|
|
|
|
for k in keys.iter() {
|
|
insert(map, *k);
|
|
}
|
|
|
|
rng.shuffle(keys.as_mut_slice());
|
|
|
|
// measure
|
|
let mut i = 0;
|
|
b.iter(|| {
|
|
let t = find(map, keys[i]);
|
|
i = (i + 1) % n;
|
|
t
|
|
})
|
|
}
|
|
|
|
pub fn find_seq_n<M, T>(n: uint, map: &mut M, b: &mut Bencher,
|
|
insert: |&mut M, uint|,
|
|
find: |&M, uint| -> T) {
|
|
// setup
|
|
for i in range(0u, n) {
|
|
insert(map, i);
|
|
}
|
|
|
|
// measure
|
|
let mut i = 0;
|
|
b.iter(|| {
|
|
let x = find(map, i);
|
|
i = (i + 1) % n;
|
|
x
|
|
})
|
|
}
|