---

yaml
---
r: 35469
b: refs/heads/master
c: 3657d56
h: refs/heads/master
i:
  35467: 5e6d4ee
v: v3

Author: erickt

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 645bd98b602500ef910685eeeb899df298221e35
+refs/heads/master: 3657d5606d7ea5607a0670341a57c3ef20202ea0
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: eb8fd119c65c67f3b1b8268cc7341c22d39b7b61
 refs/heads/try: d324a424d8f84b1eb049b12cf34182bda91b0024

trunk/src/libcore/send_map.rs

@@ -428,6 +428,25 @@ pub mod linear {
             option::unwrap(move value)
         }
     }
+
+    impl<K:Hash IterBytes Eq, V: Eq> LinearMap<K, V>: cmp::Eq {
+        pure fn eq(&self, other: &LinearMap<K, V>) -> bool {
+            if self.len() != other.len() { return false; }
+
+            for self.each |key, value| {
+                match other.find_ref(key) {
+                    None => return false,
+                    Some(v) => if value != v { return false },
+                }
+            }
+
+            return true;
+        }
+
+        pure fn ne(&self, other: &LinearMap<K, V>) -> bool {
+            !self.eq(other)
+        }
+    }
 }
 
 #[test]
@@ -538,4 +557,22 @@ pub mod test {
             Some(v) => assert *v == 2
         }
     }
+
+    #[test]
+    pub fn test_eq() {
+        let mut m1 = ~LinearMap();
+        m1.insert(1, 2);
+        m1.insert(2, 3);
+        m1.insert(3, 4);
+
+        let mut m2 = ~LinearMap();
+        m2.insert(1, 2);
+        m2.insert(2, 3);
+
+        assert m1 != m2;
+
+        m2.insert(3, 4);
+
+        assert m1 == m2;
+    }
 }