fixed sorted-set-by with no items, and added test coverage

Signed-off-by: Timothy Pratley <timothypratley@gmail.com>
Signed-off-by: Rich Hickey <richhickey@gmail.com>

1 files changed, 0 insertions, 17 deletions

diff --git a/src/jvm/clojure/lang/PersistentTreeSet.java b/src/jvm/clojure/lang/PersistentTreeSet.java
index e7e625de..bba51276 100644
--- a/src/jvm/clojure/lang/PersistentTreeSet.java
+++ b/src/jvm/clojure/lang/PersistentTreeSet.java
@@ -18,23 +18,6 @@ import java.util.Comparator;
 public class PersistentTreeSet extends APersistentSet implements Reversible, Sorted{
 static public final PersistentTreeSet EMPTY = new PersistentTreeSet(null, PersistentTreeMap.EMPTY);
 
-public static PersistentTreeSet create(Object... init){
-	PersistentTreeSet ret = EMPTY;
-	for(int i = 0; i < init.length; i++)
-		{
-		ret = (PersistentTreeSet) ret.cons(init[i]);
-		}
-	return ret;
-}
-
-public static PersistentTreeSet create(Comparator comp, Object... init){
-	PersistentTreeSet ret = new PersistentTreeSet(null, new PersistentTreeMap(null, comp));
-	for(int i = 0; i < init.length; i++)
-		{
-		ret = (PersistentTreeSet) ret.cons(init[i]);
-		}
-	return ret;
-}
 
 public static PersistentTreeSet create(List init){
 	PersistentTreeSet ret = EMPTY;