---

yaml
---
r: 97658
b: refs/heads/snap-stage3
c: 8f6ffde
h: refs/heads/master
v: v3

Author: wycats

[refs]

@@ -1,7 +1,7 @@
 ---
 refs/heads/master: 0da105a8b7b6b1e0568e8ff20f6ff4b13cc7ecc2
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
-refs/heads/snap-stage3: b93a4dac2e52b67faf778957ba7a997e805d103b
+refs/heads/snap-stage3: 8f6ffdefc3328f011695bc0f6c3fd0d36b178dd1
 refs/heads/try: c274a6888410ce3e357e014568b43310ed787d36
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b

branches/snap-stage3/src/libextra/treemap.rs

@@ -549,6 +549,7 @@ impl<'a, T> Iterator<&'a T> for TreeSetRevIterator<'a, T> {
 /// A implementation of the `Set` trait on top of the `TreeMap` container. The
 /// only requirement is that the type of the elements contained ascribes to the
 /// `TotalOrd` trait.
+#[deriving(Clone)]
 pub struct TreeSet<T> {
     priv map: TreeMap<T, ()>
 }
@@ -1588,6 +1589,16 @@ mod test_set {
         }
     }
 
+    #[test]
+    fn test_clone_eq() {
+      let mut m = TreeSet::new();
+
+      m.insert(1);
+      m.insert(2);
+
+      assert!(m.clone() == m);
+    }
+
     fn check(a: &[int],
              b: &[int],
              expected: &[int],