---

yaml
---
r: 20797
b: refs/heads/snap-stage3
c: 6fdd1ef
h: refs/heads/master
i:
  20795: 332db94
v: v3

Author: bblum

[refs]

@@ -1,7 +1,7 @@
 ---
 refs/heads/master: e430a699f2c60890d9b86069fd0c68a70ece7120
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
-refs/heads/snap-stage3: 0c3158b3a57129e8fb2a71ae0d0fceb985fc2098
+refs/heads/snap-stage3: 6fdd1ef9b18039eb29d8c8ba322883a565e94e43
 refs/heads/try: ffbe0e0e00374358b789b0037bcb3a577cd218be
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b

branches/snap-stage3/src/libcore/send_map.rs

@@ -229,6 +229,7 @@ mod linear {
                 self.insert_bucket(bucket);
                 idx = self.next_bucket(idx, len_buckets);
             }
+            self.size -= 1;
             ret true;
         }
     }
@@ -240,10 +241,14 @@ mod linear {
     }
 
     impl public_methods<K,V> for &const linear_map<K,V> {
-        fn size() -> uint {
+        fn len() -> uint {
             self.size
         }
 
+        fn is_empty() -> bool {
+            self.len() == 0
+        }
+
         fn contains_key(k: &K) -> bool {
             alt self.bucket_for_key(self.buckets, k) {
               found_entry(_) => {true}
@@ -377,6 +382,15 @@ mod test {
         assert m.get(&5) == 3;
     }
 
+    #[test]
+    fn empty() {
+        let mut m = ~linear::linear_map_with_capacity(uint_hash, uint_eq, 4);
+        assert m.insert(1, 2);
+        assert !m.is_empty();
+        assert m.remove(&1);
+        assert m.is_empty();
+    }
+
     #[test]
     fn iterate() {
         let mut m = linear::linear_map_with_capacity(uint_hash, uint_eq, 4);