---

yaml
---
r: 42456
b: refs/heads/try
c: cae273a
h: refs/heads/master
v: v3

Author: thestinger

[refs]

@@ -2,7 +2,7 @@
 refs/heads/master: 19dfec2aaf746535de1521f68421f9980dbf25de
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 2f46b763da2c098913884f101b6d71d69af41b49
-refs/heads/try: 1e5c553b7c98185adecf3564e618e70fcd136ce6
+refs/heads/try: cae273abc04fc606a73db5fb4b34a464f83d3488
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: a810c03263670238bccd64cabb12a23a46e3a278

branches/try/src/libstd/treemap.rs

@@ -42,9 +42,8 @@ pub struct TreeMap<K: Ord, V> {
 impl <K: Eq Ord, V: Eq> TreeMap<K, V>: Eq {
     pure fn eq(&self, other: &TreeMap<K, V>) -> bool {
         if self.len() != other.len() {
-            return false
-        }
-        unsafe { // purity workaround
+            false
+        } else unsafe { // unsafe used as a purity workaround
             let mut x = self.iter();
             let mut y = other.iter();
             for self.len().times {