---

yaml
---
r: 52344
b: refs/heads/dist-snap
c: 1aaeda1
h: refs/heads/master
v: v3

Author: thestinger

[refs]

@@ -7,7 +7,7 @@ refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: 147ecfdd8221e4a4d4e090486829a06da1e0ca3c
 refs/heads/incoming: 44d4d6de762f3f9aae1fedcf454c66b79b3ad58d
-refs/heads/dist-snap: 90b111f4bf1f63f6dbb0fc048f334cfe02cab0d9
+refs/heads/dist-snap: 1aaeda1e1eda1ff5a78f92a5e60e93319174528e
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
 refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503
 refs/heads/try3: 9387340aab40a73e8424c48fd42f0c521a4875c0

branches/dist-snap/src/libstd/treemap.rs

@@ -229,13 +229,13 @@ impl <T: Ord> TreeSet<T> {
     /// Return true if the set has no elements in common with `other`.
     /// This is equivalent to checking for an empty intersection.
     pure fn is_disjoint(&self, other: &TreeSet<T>) -> bool {
-        // FIXME: this is a naive O(n*log(m)) implementation, could be O(n)
+        // FIXME: this is a naive O(n*log(m)) implementation, could be O(n + m)
         !iter::any(self, |x| other.contains(x))
     }
 
     /// 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)
+        // FIXME: this is a naive O(n*log(m)) implementation, could be O(n + m)
         !iter::any(self, |x| !other.contains(x))
     }
 
@@ -278,14 +278,21 @@ impl <T: Ord> TreeSet<T> {
     }
 
     /// Visit the values (in-order) representing the symmetric difference
-    pure fn symmetric_difference(&self, _other: &TreeSet<T>,
+    pure fn symmetric_difference(&self, other: &TreeSet<T>,
                                  _f: fn(&T) -> bool) {
+        unsafe { // purity workaround
+            let mut x = self.map.iter();
+            let mut y = other.map.iter();
+
+            let mut a = x.next();
+            let mut b = y.next();
+        }
         fail ~"not yet implemented"
     }
 
     /// Visit the values (in-order) representing the intersection
     pure fn intersection(&self, other: &TreeSet<T>, f: fn(&T) -> bool) {
-        // FIXME: this is a naive O(n*log(m)) implementation, could be O(n)
+        // FIXME: this is a naive O(n*log(m)) implementation, could be O(n + m)
         for self.each |x| {
             if other.contains(x) {
                 if !f(x) { break }
@@ -294,7 +301,14 @@ impl <T: Ord> TreeSet<T> {
     }
 
     /// Visit the values (in-order) representing the union
-    pure fn union(&self, _other: &TreeSet<T>, _f: fn(&T) -> bool) {
+    pure fn union(&self, other: &TreeSet<T>, _f: fn(&T) -> bool) {
+        unsafe { // purity workaround
+            let mut x = self.map.iter();
+            let mut y = other.map.iter();
+
+            let mut a = x.next();
+            let mut b = y.next();
+        }
         fail ~"not yet implemented"
     }
 }