---

yaml
---
r: 32471
b: refs/heads/dist-snap
c: a12e90b
h: refs/heads/master
i:
  32469: 7e5238c
  32467: f8f356f
  32463: 2e74c2a
v: v3

Author: killerswan

[refs]

@@ -7,6 +7,6 @@ refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: d0c6ce338884ee21843f4b40bf6bf18d222ce5df
 refs/heads/incoming: d9317a174e434d4c99fc1a37fd7dc0d2f5328d37
-refs/heads/dist-snap: 3bd1f32cd945fab63777b71ef76f23d758e2904c
+refs/heads/dist-snap: a12e90b65f4d1b2e3d49f93494e1bfcf5f5d05bf
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
 refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503

branches/dist-snap/src/test/bench/core-std.rs

@@ -66,7 +66,7 @@ fn read_line() {
 fn str_set() {
     let r = rand::Rng();
 
-    let s = map::hashmap(str::hash, str::eq);
+    let s = map::hashmap();
 
     for int::range(0, 1000) |_i| {
         map::set_add(s, r.gen_str(10));

branches/dist-snap/src/test/bench/graph500-bfs.rs

@@ -67,11 +67,9 @@ fn make_edges(scale: uint, edgefactor: uint) -> ~[(node_id, node_id)] {
     }
 }
 
-pure fn node_hash(n: &node_id) -> uint { *n as uint }
-
 fn make_graph(N: uint, edges: ~[(node_id, node_id)]) -> graph {
     let graph = do vec::from_fn(N) |_i| {
-        map::hashmap::<node_id, ()>(node_hash, sys::shape_eq)
+        map::hashmap::<node_id, ()>()
     };
 
     do vec::each(edges) |e| {
@@ -87,7 +85,7 @@ fn make_graph(N: uint, edges: ~[(node_id, node_id)]) -> graph {
 }
 
 fn gen_search_keys(graph: graph, n: uint) -> ~[node_id] {
-    let keys = map::hashmap::<node_id, ()>(node_hash, sys::shape_eq);
+    let keys = map::hashmap::<node_id, ()>();
     let r = rand::Rng();
 
     while keys.size() < n {

branches/dist-snap/src/test/bench/task-perf-word-count-generic.rs

@@ -39,13 +39,6 @@ trait hash_key {
     pure fn eq(&&k: self) -> bool;
 }
 
-fn mk_hash<K: Const hash_key, V: Copy>() -> map::hashmap<K, V> {
-    pure fn hashfn<K: Const hash_key>(k: &K) -> uint { k.hash() }
-    pure fn hasheq<K: Const hash_key>(k1: &K, k2: &K) -> bool { k1.eq(*k2) }
-
-    map::hashmap(hashfn, hasheq)
-}
-
 impl ~str: hash_key {
     pure fn hash() -> uint { str::hash(&self) }
     pure fn eq(&&x: ~str) -> bool { self == x }
@@ -175,11 +168,12 @@ mod map_reduce {
         input: K1)
     {
         // log(error, "map_task " + input);
-        let intermediates = mk_hash();
+        let intermediates = map::hashmap();
 
         do map(input) |key, val| {
             let mut c = None;
-            match intermediates.find(key) {
+            let found = intermediates.find(key);
+            match found {
               Some(_c) => { c = Some(_c); }
               None => {
                 do ctrl.swap |ctrl| {
@@ -251,7 +245,7 @@ mod map_reduce {
         // This task becomes the master control task. It task::_spawns
         // to do the rest.
 
-        let reducers = mk_hash();
+        let reducers = map::hashmap();
         let mut tasks = start_mappers(map, ctrl, inputs);
         let mut num_mappers = vec::len(inputs) as int;