1 Clazz.load(["java.util.AbstractSet","$.SortedSet","$.TreeMap"],"java.util.TreeSet",["java.lang.IllegalArgumentException"],function(){
\r
2 c$=Clazz.decorateAsClass(function(){
\r
3 this.backingMap=null;
\r
4 Clazz.instantialize(this,arguments);
\r
5 },java.util,"TreeSet",java.util.AbstractSet,[java.util.SortedSet,Cloneable,java.io.Serializable]);
\r
6 Clazz.makeConstructor(c$,
\r
8 Clazz.superConstructor(this,java.util.TreeSet,[]);
\r
10 },$fz.isPrivate=true,$fz),"java.util.SortedMap");
\r
11 Clazz.makeConstructor(c$,
\r
13 Clazz.superConstructor(this,java.util.TreeSet,[]);
\r
14 this.backingMap=new java.util.TreeMap();
\r
16 Clazz.makeConstructor(c$,
\r
17 function(collection){
\r
19 this.addAll(collection);
\r
20 },"java.util.Collection");
\r
21 Clazz.makeConstructor(c$,
\r
22 function(comparator){
\r
23 Clazz.superConstructor(this,java.util.TreeSet,[]);
\r
24 this.backingMap=new java.util.TreeMap(comparator);
\r
25 },"java.util.Comparator");
\r
26 Clazz.makeConstructor(c$,
\r
28 this.construct(set.comparator());
\r
29 var it=set.iterator();
\r
30 while(it.hasNext()){
\r
31 this.add(it.next());
\r
33 },"java.util.SortedSet");
\r
34 Clazz.overrideMethod(c$,"add",
\r
36 return this.backingMap.put(object,object)==null;
\r
38 Clazz.overrideMethod(c$,"clear",
\r
40 this.backingMap.clear();
\r
42 Clazz.defineMethod(c$,"clone",
\r
45 var clone=Clazz.superCall(this,java.util.TreeSet,"clone",[]);
\r
46 if(Clazz.instanceOf(this.backingMap,java.util.TreeMap)){
\r
47 clone.backingMap=(this.backingMap).clone();
\r
49 clone.backingMap=new java.util.TreeMap(this.backingMap);
\r
52 if(Clazz.instanceOf(e,CloneNotSupportedException)){
\r
59 Clazz.defineMethod(c$,"comparator",
\r
61 return this.backingMap.comparator();
\r
63 Clazz.overrideMethod(c$,"contains",
\r
65 return this.backingMap.containsKey(object);
\r
67 Clazz.overrideMethod(c$,"first",
\r
69 return this.backingMap.firstKey();
\r
71 Clazz.overrideMethod(c$,"headSet",
\r
73 var c=this.backingMap.comparator();
\r
75 (end).compareTo(end);
\r
78 }return new java.util.TreeSet(this.backingMap.headMap(end));
\r
80 Clazz.overrideMethod(c$,"isEmpty",
\r
82 return this.backingMap.isEmpty();
\r
84 Clazz.defineMethod(c$,"iterator",
\r
86 return this.backingMap.keySet().iterator();
\r
88 Clazz.overrideMethod(c$,"last",
\r
90 return this.backingMap.lastKey();
\r
92 Clazz.overrideMethod(c$,"remove",
\r
94 return this.backingMap.remove(object)!=null;
\r
96 Clazz.overrideMethod(c$,"size",
\r
98 return this.backingMap.size();
\r
100 Clazz.overrideMethod(c$,"subSet",
\r
101 function(start,end){
\r
102 var c=this.backingMap.comparator();
\r
104 if((start).compareTo(end)<=0){
\r
105 return new java.util.TreeSet(this.backingMap.subMap(start,end));
\r
107 if(c.compare(start,end)<=0){
\r
108 return new java.util.TreeSet(this.backingMap.subMap(start,end));
\r
109 }}throw new IllegalArgumentException();
\r
111 Clazz.overrideMethod(c$,"tailSet",
\r
113 var c=this.backingMap.comparator();
\r
115 (start).compareTo(start);
\r
117 c.compare(start,start);
\r
118 }return new java.util.TreeSet(this.backingMap.tailMap(start));
\r