Hashmap fix?

Author: alexcrichton

src/libcore/hashmap.rs

@@ -220,14 +220,17 @@ pub mod linear {
                 },
             };
 
+            /* re-inserting buckets may cause changes in size, so remember what
+               our new size is ahead of time before we start insertions */
+            let size = self.size - 1;
             idx = self.next_bucket(idx, len_buckets);
             while self.buckets[idx].is_some() {
                 let mut bucket = None;
                 bucket <-> self.buckets[idx];
                 self.insert_opt_bucket(bucket);
                 idx = self.next_bucket(idx, len_buckets);
             }
-            self.size -= 1;
+            self.size = size;
 
             value
         }
@@ -428,7 +431,6 @@ pub mod linear {
     impl <T: Hash IterBytes Eq> LinearSet<T>: Container {
         /// Return the number of elements in the set
         pure fn len(&self) -> uint { self.map.len() }
-
         /// Return true if the set contains no elements
         pure fn is_empty(&self) -> bool { self.map.is_empty() }
     }