2013-03-21 14:21:06 -05:00
|
|
|
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
|
2012-12-10 19:32:48 -06:00
|
|
|
// 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.
|
|
|
|
|
2014-02-14 12:10:06 -06:00
|
|
|
extern crate collections;
|
2014-03-01 18:33:24 -06:00
|
|
|
extern crate rand;
|
2014-02-19 21:08:12 -06:00
|
|
|
extern crate time;
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2014-02-19 21:29:58 -06:00
|
|
|
use collections::{TrieMap, TreeMap, HashMap, HashSet};
|
2013-05-24 21:35:29 -05:00
|
|
|
use std::os;
|
2014-03-01 18:33:24 -06:00
|
|
|
use rand::{Rng, IsaacRng, SeedableRng};
|
2013-05-24 21:35:29 -05:00
|
|
|
use std::uint;
|
2014-03-08 17:11:52 -06:00
|
|
|
use std::slice;
|
2013-03-21 14:21:06 -05:00
|
|
|
|
2013-11-19 18:34:19 -06:00
|
|
|
fn timed(label: &str, f: ||) {
|
2013-03-21 14:21:06 -05:00
|
|
|
let start = time::precise_time_s();
|
|
|
|
f();
|
|
|
|
let end = time::precise_time_s();
|
2013-09-25 00:16:43 -05:00
|
|
|
println!(" {}: {}", label, end - start);
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
|
|
|
|
2013-07-13 22:30:05 -05:00
|
|
|
fn ascending<M: MutableMap<uint, uint>>(map: &mut M, n_keys: uint) {
|
2014-01-09 04:06:55 -06:00
|
|
|
println!(" Ascending integers:");
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("insert", || {
|
2013-08-03 11:45:23 -05:00
|
|
|
for i in range(0u, n_keys) {
|
2013-03-21 14:21:06 -05:00
|
|
|
map.insert(i, i + 1);
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("search", || {
|
2013-08-03 11:45:23 -05:00
|
|
|
for i in range(0u, n_keys) {
|
2013-05-18 21:02:45 -05:00
|
|
|
assert_eq!(map.find(&i).unwrap(), &(i + 1));
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("remove", || {
|
2013-08-03 11:45:23 -05:00
|
|
|
for i in range(0, n_keys) {
|
2013-03-28 20:39:09 -05:00
|
|
|
assert!(map.remove(&i));
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
|
|
|
|
2013-07-13 22:30:05 -05:00
|
|
|
fn descending<M: MutableMap<uint, uint>>(map: &mut M, n_keys: uint) {
|
2014-01-09 04:06:55 -06:00
|
|
|
println!(" Descending integers:");
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("insert", || {
|
2014-01-23 13:41:57 -06:00
|
|
|
for i in range(0, n_keys).rev() {
|
2013-03-21 14:21:06 -05:00
|
|
|
map.insert(i, i + 1);
|
2013-08-07 00:34:22 -05:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("search", || {
|
2014-01-23 13:41:57 -06:00
|
|
|
for i in range(0, n_keys).rev() {
|
2013-05-18 21:02:45 -05:00
|
|
|
assert_eq!(map.find(&i).unwrap(), &(i + 1));
|
2013-08-07 00:34:22 -05:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("remove", || {
|
2013-08-07 00:34:22 -05:00
|
|
|
for i in range(0, n_keys) {
|
2013-03-28 20:39:09 -05:00
|
|
|
assert!(map.remove(&i));
|
2013-08-07 00:34:22 -05:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
|
|
|
|
2013-07-13 22:30:05 -05:00
|
|
|
fn vector<M: MutableMap<uint, uint>>(map: &mut M, n_keys: uint, dist: &[uint]) {
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("insert", || {
|
2013-08-03 11:45:23 -05:00
|
|
|
for i in range(0u, n_keys) {
|
2013-03-21 14:21:06 -05:00
|
|
|
map.insert(dist[i], i + 1);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2013-01-23 18:51:49 -06:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("search", || {
|
2013-08-03 11:45:23 -05:00
|
|
|
for i in range(0u, n_keys) {
|
2013-05-18 21:02:45 -05:00
|
|
|
assert_eq!(map.find(&dist[i]).unwrap(), &(i + 1));
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2013-01-23 18:51:49 -06:00
|
|
|
|
2013-11-21 21:20:48 -06:00
|
|
|
timed("remove", || {
|
2013-08-03 11:45:23 -05:00
|
|
|
for i in range(0u, n_keys) {
|
2013-03-28 20:39:09 -05:00
|
|
|
assert!(map.remove(&dist[i]));
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
2013-11-21 21:20:48 -06:00
|
|
|
});
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
|
2013-03-21 14:21:06 -05:00
|
|
|
fn main() {
|
|
|
|
let args = os::args();
|
|
|
|
let n_keys = {
|
|
|
|
if args.len() == 2 {
|
2013-09-15 00:27:32 -05:00
|
|
|
from_str::<uint>(args[1]).unwrap()
|
2013-03-21 14:21:06 -05:00
|
|
|
} else {
|
|
|
|
1000000
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
2013-03-21 14:21:06 -05:00
|
|
|
};
|
2013-01-23 18:51:49 -06:00
|
|
|
|
2014-03-08 17:11:52 -06:00
|
|
|
let mut rand = slice::with_capacity(n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
|
|
|
|
{
|
2013-09-29 10:29:28 -05:00
|
|
|
let mut rng: IsaacRng = SeedableRng::from_seed(&[1, 1, 1, 1, 1, 1, 1]);
|
2013-04-03 08:28:36 -05:00
|
|
|
let mut set = HashSet::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
while set.len() != n_keys {
|
2013-09-21 07:06:50 -05:00
|
|
|
let next = rng.gen();
|
2013-03-21 14:21:06 -05:00
|
|
|
if set.insert(next) {
|
|
|
|
rand.push(next);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-25 00:16:43 -05:00
|
|
|
println!("{} keys", n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
|
2014-01-09 04:06:55 -06:00
|
|
|
// FIXME: #9970
|
|
|
|
println!("{}", "\nTreeMap:");
|
2013-01-23 18:51:49 -06:00
|
|
|
|
|
|
|
{
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: TreeMap<uint,uint> = TreeMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
ascending(&mut map, n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: TreeMap<uint,uint> = TreeMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
descending(&mut map, n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2014-01-09 04:06:55 -06:00
|
|
|
println!(" Random integers:");
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: TreeMap<uint,uint> = TreeMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
vector(&mut map, n_keys, rand);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
|
2014-01-09 04:06:55 -06:00
|
|
|
// FIXME: #9970
|
|
|
|
println!("{}", "\nHashMap:");
|
2013-03-21 14:21:06 -05:00
|
|
|
|
2013-01-23 18:51:49 -06:00
|
|
|
{
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: HashMap<uint,uint> = HashMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
ascending(&mut map, n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: HashMap<uint,uint> = HashMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
descending(&mut map, n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
2012-08-21 17:55:17 -05:00
|
|
|
|
2013-03-21 14:21:06 -05:00
|
|
|
{
|
2014-01-09 04:06:55 -06:00
|
|
|
println!(" Random integers:");
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: HashMap<uint,uint> = HashMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
vector(&mut map, n_keys, rand);
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
|
|
|
|
2014-01-09 04:06:55 -06:00
|
|
|
// FIXME: #9970
|
|
|
|
println!("{}", "\nTrieMap:");
|
2012-08-21 17:55:17 -05:00
|
|
|
|
|
|
|
{
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: TrieMap<uint> = TrieMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
ascending(&mut map, n_keys);
|
2013-01-23 18:51:49 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: TrieMap<uint> = TrieMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
descending(&mut map, n_keys);
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2014-01-09 04:06:55 -06:00
|
|
|
println!(" Random integers:");
|
2013-08-27 20:45:13 -05:00
|
|
|
let mut map: TrieMap<uint> = TrieMap::new();
|
2013-03-21 14:21:06 -05:00
|
|
|
vector(&mut map, n_keys, rand);
|
2012-08-21 17:55:17 -05:00
|
|
|
}
|
2012-12-28 21:57:18 -06:00
|
|
|
}
|