squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

Fix whitespace

Browse source
This commit is contained in:
Tim Chevalier 2012-10-17 12:59:10 -07:00
parent fd6be2fa4e
commit bbc90b6bf6
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/libstd/treemap.rs
View file

@ -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. /// 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))) { f: fn((&K), (&V))) {
match copy *m { match copy *m {
None => (), 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 /// they contain same keys and values
pub fn equals<K: Copy Eq Ord, V: Copy Eq>(t1: &const TreeEdge<K, V>, 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 { -> bool {
let mut v1 = ~[]; let mut v1 = ~[];
let mut v2 = ~[]; let mut v2 = ~[];