blob: bc7c8cf69d057ff4e1f3e9c725d453df223d514c (
plain) (
blame)
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
|
/* NSC -- new Scala compiler
* Copyright 2005-2009 LAMP/EPFL
* @author Martin Odersky
*/
// $Id$
package scala.tools.nsc.util
class HashSet[T >: Null <: AnyRef](initialCapacity: Int) extends Set[T] {
def this() = this(16)
private var capacity = initialCapacity
private var used = 0
private var table = new Array[AnyRef](capacity)
def size: Int = used
private def index(x: Int): Int = Math.abs(x % capacity)
def findEntry(x: T): T = {
var h = index(x.hashCode())
var entry = table(h)
while ((entry ne null) && entry != x) {
h = index(h + 1)
entry = table(h)
}
entry.asInstanceOf[T]
}
def addEntry(x: T) {
var h = index(x.hashCode())
var entry = table(h)
while (entry ne null) {
if (entry == x) return
h = index((h + 1))
entry = table(h)
}
table(h) = x
used += 1
if (used >= (capacity >> 2)) growTable()
}
def elements = new Iterator[T] {
private var i = 0
def hasNext: Boolean = {
while (i < capacity && (table(i) eq null)) i += 1
i < capacity
}
def next: T =
if (hasNext) { i += 1; table(i - 1).asInstanceOf[T] }
else null
}
private def growTable() {
val oldtable = table
capacity *= 2
table = new Array[AnyRef](capacity)
var i = 0
while (i < oldtable.length) {
val entry = oldtable(i)
if (entry ne null) addEntry(entry.asInstanceOf[T])
i += 1
}
}
}
|
