From bbc90b6bf6082f32cccef1011ac6b862a02957c4 Mon Sep 17 00:00:00 2001
From: Tim Chevalier <chevalier@alum.wellesley.edu>
Date: Wed, 17 Oct 2012 12:59:10 -0700
Subject: Fix whitespace

---
 src/libstd/treemap.rs | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'src/libstd')

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 = ~[];
-- 
cgit 1.4.1-3-g733a5