From 3df183e7abd3c4d24b6b989474fd5d855bbf9c11 Mon Sep 17 00:00:00 2001
From: Daniel Micay <danielmicay@gmail.com>
Date: Tue, 15 Jan 2013 12:19:17 -0500
Subject: [PATCH] fix bug in union implementation (missing return)

---
 src/libstd/treemap.rs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/src/libstd/treemap.rs b/src/libstd/treemap.rs
index dca54abdfeec..6b0acaecaae2 100644
--- a/src/libstd/treemap.rs
+++ b/src/libstd/treemap.rs
@@ -346,6 +346,7 @@ impl <T: Ord> TreeSet<T> {
                         if !f(a1) { return }
                         a = x.next();
                     }
+                    return
                 }
 
                 let (a1, _) = a.unwrap();
@@ -963,6 +964,7 @@ mod test_set {
         assert a.insert(11);
         assert a.insert(16);
         assert a.insert(19);
+        assert a.insert(24);
 
         assert b.insert(-2);
         assert b.insert(1);
@@ -972,7 +974,7 @@ mod test_set {
         assert b.insert(19);
 
         let mut i = 0;
-        let expected = [-2, 1, 3, 5, 9, 11, 13, 16, 19];
+        let expected = [-2, 1, 3, 5, 9, 11, 13, 16, 19, 24];
         for a.union(&b) |x| {
             assert *x == expected[i];
             i += 1