---

catamorphism · catamorphism · commit dbf3f0ed7159 · 2012-10-17T12:59:30.000-07:00
yaml --- r: 35980 b: refs/heads/try2 c: bbc90b6 h: refs/heads/master v: v3
diff --git a/[refs] b/[refs]
@@ -5,7 +5,7 @@ refs/heads/snap-stage3: eb8fd119c65c67f3b1b8268cc7341c22d39b7b61
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
-refs/heads/try2: fd6be2fa4eac4638174a484529ef782007d0fec1
+refs/heads/try2: bbc90b6bf6082f32cccef1011ac6b862a02957c4
 refs/heads/incoming: d9317a174e434d4c99fc1a37fd7dc0d2f5328d37
 refs/heads/dist-snap: 22efa39382d41b084fde1719df7ae8ce5697d8c9
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
diff --git a/branches/try2/src/libstd/treemap.rs b/branches/try2/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 = ~[];

Original file line number	Diff line number	Diff line change
`@@ -67,7 +67,7 @@ pub fn find<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>, k: K)`
`67`	`67`	`}`
`68`	`68`
`69`	`69`	`/// Visit all pairs in the map in order.`
`70`		`-pub fn traverse<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>,`
	`70`	`+pub fn traverse<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>,`
`71`	`71`	`f: fn((&K), (&V))) {`
`72`	`72`	`match copy *m {`
`73`	`73`	`None => (),`
`@@ -80,10 +80,10 @@ pub fn traverse<K: Copy Eq Ord, V: Copy>(m: &const TreeEdge<K, V>,`
`80`	`80`	`}`
`81`	`81`	`}`
`82`	`82`
`83`		`-/// Compare two treemaps and return true iff`
	`83`	`+/// Compare two treemaps and return true iff`
`84`	`84`	`/// they contain same keys and values`
`85`	`85`	`pub fn equals<K: Copy Eq Ord, V: Copy Eq>(t1: &const TreeEdge<K, V>,`
`86`		`- t2: &const TreeEdge<K, V>)`
	`86`	`+ t2: &const TreeEdge<K, V>)`
`87`	`87`	`-> bool {`
`88`	`88`	`let mut v1 = ~[];`
`89`	`89`	`let mut v2 = ~[];`