diff options
| author | Tim Chevalier <chevalier@alum.wellesley.edu> | 2012-10-17 12:59:10 -0700 |
|---|---|---|
| committer | Tim Chevalier <chevalier@alum.wellesley.edu> | 2012-10-17 12:59:30 -0700 |
| commit | bbc90b6bf6082f32cccef1011ac6b862a02957c4 (patch) | |
| tree | 32ef49fe9925482559eeb8570725a920c534bfa7 /src/libstd | |
| parent | fd6be2fa4eac4638174a484529ef782007d0fec1 (diff) | |
Fix whitespace
Diffstat (limited to 'src/libstd')
| -rw-r--r-- | src/libstd/treemap.rs | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/libstd/treemap.rs b/src/libstd/treemap.rs index f332c06d0bc..e4b6c9b5b9a 100644 --- a/src/libstd/treemap.rs +++ b/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 = ~[]; |
