1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2006-2009, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
// $Id$
package scala.collection.jcl;
import Predef._
object SortedSet {
trait Projection[A] extends Set.Projection[A] with SortedSet[A] {
override def projection = this
override def filter(p : A => Boolean) : Projection[A] = new Filter(p);
}
def apply[T](set : java.util.SortedSet[T]) = new SortedSetWrapper[T] {
val underlying = set
}
}
/** Analogous to a Java sorted set.
*
* @author Sean McDirmid
*/
trait SortedSet[A] extends scala.collection.SortedSet[A] with jcl.Set[A] with Sorted[A,A] {
final protected type SortedSelf = SortedSet[A];
override def keySet = this;
def compare(a0 : A, a1 : A) : Int;
override def firstKey : A = {
val i = elements;
if (i.hasNext) i.next;
else throw new NoSuchElementException;
}
override def subsetOf(that : scala.collection.Set[A]) = super[SortedSet].subsetOf(that);
override def hasAll(that : Iterable[A]) = super[Sorted].hasAll(that.elements);
override def lastKey : A = {
var last : A = null.asInstanceOf[A];
val i = elements;
while (i.hasNext) last = i.next;
if (last == null) throw new NoSuchElementException;
else last;
}
override def rangeImpl(from : Option[A], until : Option[A]) : SortedSet[A] = new Range(from, until);
override def projection : SortedSet.Projection[A] = new SortedSet.Projection[A] {
override def compare(a0 : A, a1 : A) = SortedSet.this.compare(a0, a1)
override def add(a: A): Boolean = SortedSet.this.add(a)
override def elements = SortedSet.this.elements
override def size = SortedSet.this.size
override def has(a : A) : Boolean = SortedSet.this.has(a)
}
protected class Filter(pp : A => Boolean) extends super.Filter(pp) with SortedSet.Projection[A] {
override def p(a : A) = pp(a)
def compare(a0 : A, a1 : A) : Int = SortedSet.this.compare(a0, a1);
override def filter(p0 : A => Boolean) = SortedSet.this.projection.filter(k => p(k) && p0(k));
}
protected class Range(from : Option[A], until : Option[A]) extends Filter(key => {
(from == None || (compare(from.get,key) <= 0)) &&
(until == None || (compare(key,until.get) < 0));
}) with SortedSet.Projection[A] {
if (from == None && until == None) throw new IllegalArgumentException;
if (from != None && until != None && !(SortedSet.this.compare(from.get, until.get) < 0))
throw new IllegalArgumentException;
//override def elements : MutableIterator[A] =
// new RangeIterator(SortedSet.this.elements.buffered0);
private def contains1(key : A) =
(from == None || (compare(from.get,key) <= 0)) &&
(until == None || (compare(key,until.get) < 0));
override def has(elem : A) = contains1(elem) && SortedSet.this.has(elem);
override def rangeImpl(from : Option[A], until : Option[A]) : SortedSet[A] = {
if (this.from != None && from == None) return rangeImpl(this.from, until);
if (this.until != None && until == None) return rangeImpl(from, this.until);
if (from != None && compare(this.from.get, from.get) > 0) return rangeImpl(this.from, until);
if (until != None && compare(this.until.get, until.get) < 0) return rangeImpl(from, this.until);
SortedSet.this.rangeImpl(from, until);
}
/*
class RangeIterator(underlying : MutableIterator[A]#Buffered) extends MutableIterator[A] {
if (from != None)
underlying.seekNext(a => compare(from.get, a) <= 0);
private def okNext(a : A) =
if (until == None) true;
else compare(a, until.get) < 0;
def hasNext = underlying.hasNext && okNext(underlying.peekNext);
def next = underlying.seekNext(okNext) match {
case Some(result) => underlying.next; result;
case None => throw new NoSuchElementException;
}
def remove = underlying.remove;
}*/
}
}
|
