---

yaml
---
r: 41806
b: refs/heads/master
c: 3fe6faa
h: refs/heads/master
v: v3

Author: thestinger

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 4f92d8fb52ba335abae39bdd38e72ff42cd37bb2
+refs/heads/master: 3fe6faace83c3f07c11b92f463ab93aad8f5dd41
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 2f46b763da2c098913884f101b6d71d69af41b49
 refs/heads/try: 3d5418789064fdb463e872a4e651af1c628a3650

trunk/src/libstd/treemap.rs

@@ -259,13 +259,35 @@ impl <T: Ord> TreeSet<T> {
 
     /// Check of the set is a subset of another
     pure fn is_subset(&self, other: &TreeSet<T>) -> bool {
-        // FIXME: this is a naive O(n*log(m)) implementation, could be O(n + m)
-        !iter::any(self, |x| !other.contains(x))
+        other.is_superset(self)
     }
 
     /// Check of the set is a superset of another
     pure fn is_superset(&self, other: &TreeSet<T>) -> bool {
-        other.is_subset(self)
+        let mut x = self.iter();
+        let mut y = other.iter();
+        unsafe { // purity workaround
+            let mut a = x.next();
+            let mut b = y.next();
+            while b.is_some() {
+                if a.is_none() {
+                    return false
+                }
+
+                let a1 = a.unwrap();
+                let b1 = b.unwrap();
+
+                if b1 < a1 {
+                    return false
+                }
+
+                if !(a1 < b1) {
+                    b = y.next();
+                }
+                a = x.next();
+            }
+        }
+        true
     }
 
     /// Visit the values (in-order) representing the difference