1 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
14 use extra::treemap::TreeMap;
15 use std::hashmap::{HashMap, HashSet};
19 use std::trie::TrieMap;
23 fn timed(label: &str, f: &fn()) {
24 let start = time::precise_time_s();
26 let end = time::precise_time_s();
27 printfln!(" %s: %f", label, end - start);
30 fn ascending<M: MutableMap<uint, uint>>(map: &mut M, n_keys: uint) {
31 io::println(" Ascending integers:");
34 for i in range(0u, n_keys) {
40 for i in range(0u, n_keys) {
41 assert_eq!(map.find(&i).unwrap(), &(i + 1));
46 for i in range(0, n_keys) {
47 assert!(map.remove(&i));
52 fn descending<M: MutableMap<uint, uint>>(map: &mut M, n_keys: uint) {
53 io::println(" Descending integers:");
56 do uint::range_rev(n_keys, 0) |i| {
63 do uint::range_rev(n_keys, 0) |i| {
64 assert_eq!(map.find(&i).unwrap(), &(i + 1));
70 do uint::range_rev(n_keys, 0) |i| {
71 assert!(map.remove(&i));
77 fn vector<M: MutableMap<uint, uint>>(map: &mut M, n_keys: uint, dist: &[uint]) {
80 for i in range(0u, n_keys) {
81 map.insert(dist[i], i + 1);
86 for i in range(0u, n_keys) {
87 assert_eq!(map.find(&dist[i]).unwrap(), &(i + 1));
92 for i in range(0u, n_keys) {
93 assert!(map.remove(&dist[i]));
98 #[fixed_stack_segment]
100 let args = os::args();
103 uint::from_str(args[1]).unwrap()
109 let mut rand = vec::with_capacity(n_keys);
112 let mut rng = std::rand::IsaacRng::new_seeded([1, 1, 1, 1, 1, 1, 1]);
113 let mut set = HashSet::new();
114 while set.len() != n_keys {
115 let next = rng.next() as uint;
116 if set.insert(next) {
122 printfln!("%? keys", n_keys);
124 io::println("\nTreeMap:");
127 let mut map = TreeMap::new::<uint, uint>();
128 ascending(&mut map, n_keys);
132 let mut map = TreeMap::new::<uint, uint>();
133 descending(&mut map, n_keys);
137 io::println(" Random integers:");
138 let mut map = TreeMap::new::<uint, uint>();
139 vector(&mut map, n_keys, rand);
142 io::println("\nHashMap:");
145 let mut map = HashMap::new::<uint, uint>();
146 ascending(&mut map, n_keys);
150 let mut map = HashMap::new::<uint, uint>();
151 descending(&mut map, n_keys);
155 io::println(" Random integers:");
156 let mut map = HashMap::new::<uint, uint>();
157 vector(&mut map, n_keys, rand);
160 io::println("\nTrieMap:");
163 let mut map = TrieMap::new::<uint>();
164 ascending(&mut map, n_keys);
168 let mut map = TrieMap::new::<uint>();
169 descending(&mut map, n_keys);
173 io::println(" Random integers:");
174 let mut map = TrieMap::new::<uint>();
175 vector(&mut map, n_keys, rand);