---

yaml
---
r: 34787
b: refs/heads/master
c: bbc90b6
h: refs/heads/master
i:
  34785: b3d86c8
  34783: 00055ae
v: v3

Author: catamorphism

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: fd6be2fa4eac4638174a484529ef782007d0fec1
+refs/heads/master: bbc90b6bf6082f32cccef1011ac6b862a02957c4
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: eb8fd119c65c67f3b1b8268cc7341c22d39b7b61
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024

trunk/src/libstd/treemap.rs

@@ -67,7 +67,7 @@ pub fn find<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>, k: K)
 }
 
 /// Visit all pairs in the map in order.
-pub fn traverse<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>, 
+pub fn traverse<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>,
                                          f: fn((&K), (&V))) {
     match copy *m {
       None => (),
@@ -80,10 +80,10 @@ pub fn traverse<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>,
     }
 }
 
-/// Compare two treemaps and return true iff 
+/// Compare two treemaps and return true iff
 /// they contain same keys and values
 pub fn equals<K: Copy Eq Ord, V: Copy Eq>(t1: &const TreeEdge<K, V>,
-                                          t2: &const TreeEdge<K, V>) 
+                                          t2: &const TreeEdge<K, V>)
                                         -> bool {
     let mut v1 = ~[];
     let mut v2 = ~[];