Skip to content
Fetching contributors…
Cannot retrieve contributors at this time
175 lines (143 sloc) 3.94 KB
// Copyright 2013 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.
extern mod extra;
use extra::time;
use extra::treemap::TreeMap;
use std::hashmap::{HashMap, HashSet};
use std::io;
use std::os;
use std::rand::Rng;
use std::trie::TrieMap;
use std::uint;
use std::vec;
fn timed(label: &str, f: &fn()) {
let start = time::precise_time_s();
f();
let end = time::precise_time_s();
io::println(fmt!(" %s: %f", label, end - start));
}
fn ascending<M: Map<uint, uint>>(map: &mut M, n_keys: uint) {
io::println(" Ascending integers:");
do timed("insert") {
for uint::range(0, n_keys) |i| {
map.insert(i, i + 1);
}
}
do timed("search") {
for uint::range(0, n_keys) |i| {
assert_eq!(map.find(&i).unwrap(), &(i + 1));
}
}
do timed("remove") {
for uint::range(0, n_keys) |i| {
assert!(map.remove(&i));
}
}
}
fn descending<M: Map<uint, uint>>(map: &mut M, n_keys: uint) {
io::println(" Descending integers:");
do timed("insert") {
for uint::range_rev(n_keys, 0) |i| {
map.insert(i, i + 1);
}
}
do timed("search") {
for uint::range_rev(n_keys, 0) |i| {
assert_eq!(map.find(&i).unwrap(), &(i + 1));
}
}
do timed("remove") {
for uint::range_rev(n_keys, 0) |i| {
assert!(map.remove(&i));
}
}
}
fn vector<M: Map<uint, uint>>(map: &mut M, n_keys: uint, dist: &[uint]) {
do timed("insert") {
for uint::range(0, n_keys) |i| {
map.insert(dist[i], i + 1);
}
}
do timed("search") {
for uint::range(0, n_keys) |i| {
assert_eq!(map.find(&dist[i]).unwrap(), &(i + 1));
}
}
do timed("remove") {
for uint::range(0, n_keys) |i| {
assert!(map.remove(&dist[i]));
}
}
}
#[fixed_stack_segment]
fn main() {
let args = os::args();
let n_keys = {
if args.len() == 2 {
uint::from_str(args[1]).get()
} else {
1000000
}
};
let mut rand = vec::with_capacity(n_keys);
{
let mut rng = std::rand::IsaacRng::new_seeded([1, 1, 1, 1, 1, 1, 1]);
let mut set = HashSet::new();
while set.len() != n_keys {
let next = rng.next() as uint;
if set.insert(next) {
rand.push(next);
}
}
}
io::println(fmt!("%? keys", n_keys));
io::println("\nTreeMap:");
{
let mut map = TreeMap::new::<uint, uint>();
ascending(&mut map, n_keys);
}
{
let mut map = TreeMap::new::<uint, uint>();
descending(&mut map, n_keys);
}
{
io::println(" Random integers:");
let mut map = TreeMap::new::<uint, uint>();
vector(&mut map, n_keys, rand);
}
io::println("\nHashMap:");
{
let mut map = HashMap::new::<uint, uint>();
ascending(&mut map, n_keys);
}
{
let mut map = HashMap::new::<uint, uint>();
descending(&mut map, n_keys);
}
{
io::println(" Random integers:");
let mut map = HashMap::new::<uint, uint>();
vector(&mut map, n_keys, rand);
}
io::println("\nTrieMap:");
{
let mut map = TrieMap::new::<uint>();
ascending(&mut map, n_keys);
}
{
let mut map = TrieMap::new::<uint>();
descending(&mut map, n_keys);
}
{
io::println(" Random integers:");
let mut map = TrieMap::new::<uint>();
vector(&mut map, n_keys, rand);
}
}
Jump to Line
Something went wrong with that request. Please try again.