blob: 8143a934ca8c1c1138a1ef67cdd605e31024aaef (
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
package org.eclipse.jdt.internal.compiler.util;
/*
* (c) Copyright IBM Corp. 2000, 2001.
* All Rights Reserved.
*/
import org.eclipse.jdt.internal.compiler.*;
public final class HashtableOfObject {
// to avoid using Enumerations, walk the individual tables skipping nulls
public char[] keyTable[];
public Object valueTable[];
int elementSize; // number of elements in the table
int threshold;
public HashtableOfObject() {
this(13);
}
public HashtableOfObject(int size) {
this.elementSize = 0;
this.threshold = size; // size represents the expected number of elements
int extraRoom = (int) (size * 1.75f);
if (this.threshold == extraRoom)
extraRoom++;
this.keyTable = new char[extraRoom][];
this.valueTable = new Object[extraRoom];
}
public boolean containsKey(char[] key) {
int index = CharOperation.hashCode(key) % valueTable.length;
int keyLength = key.length;
char[] currentKey;
while ((currentKey = keyTable[index]) != null) {
if (currentKey.length == keyLength && CharOperation.prefixEquals(currentKey, key))
return true;
index = (index + 1) % keyTable.length;
}
return false;
}
public Object get(char[] key) {
int index = CharOperation.hashCode(key) % valueTable.length;
int keyLength = key.length;
char[] currentKey;
while ((currentKey = keyTable[index]) != null) {
if (currentKey.length == keyLength && CharOperation.prefixEquals(currentKey, key))
return valueTable[index];
index = (index + 1) % keyTable.length;
}
return null;
}
public Object put(char[] key, Object value) {
int index = CharOperation.hashCode(key) % valueTable.length;
int keyLength = key.length;
char[] currentKey;
while ((currentKey = keyTable[index]) != null) {
if (currentKey.length == keyLength && CharOperation.prefixEquals(currentKey, key))
return valueTable[index] = value;
index = (index + 1) % keyTable.length;
}
keyTable[index] = key;
valueTable[index] = value;
// assumes the threshold is never equal to the size of the table
if (++elementSize > threshold)
rehash();
return value;
}
private void rehash() {
HashtableOfObject newHashtable = new HashtableOfObject(elementSize * 2); // double the number of expected elements
char[] currentKey;
for (int i = keyTable.length; --i >= 0;)
if ((currentKey = keyTable[i]) != null)
newHashtable.put(currentKey, valueTable[i]);
this.keyTable = newHashtable.keyTable;
this.valueTable = newHashtable.valueTable;
this.threshold = newHashtable.threshold;
}
public int size() {
return elementSize;
}
public String toString() {
String s = ""/*nonNLS*/;
Object object;
for (int i = 0, length = valueTable.length; i < length; i++)
if ((object = valueTable[i]) != null)
s += new String(keyTable[i]) + " -> "/*nonNLS*/ + object.toString() + "\n"/*nonNLS*/;
return s;
}
}
|
