Methods Summary |
---|
int | get(java.lang.Object key)
int index = hashCode(key);
while (keyTable[index] != null) {
if (keyTable[index].equals(key)) {
return valueTable[index];
}
index = (index + 1) % keyTable.length;
}
return -1;
|
int | hashCode(java.lang.Object key)
return (key.hashCode() & 0x7FFFFFFF) % keyTable.length;
|
int | put(java.lang.Object key, int value)
int index = hashCode(key);
while (keyTable[index] != null) {
if (keyTable[index].equals(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()
ProxyObjectCache newHashtable = new ProxyObjectCache(
keyTable.length * 2);
for (int i = keyTable.length; --i >= 0;) {
if (keyTable[i] != null) {
newHashtable.put(keyTable[i], valueTable[i]);
}
}
this.keyTable = newHashtable.keyTable;
this.valueTable = newHashtable.valueTable;
this.threshold = newHashtable.threshold;
|
int | size()
return elementSize;
|
public java.lang.String | toString()
int max = size();
StringBuilder buf = new StringBuilder();
buf.append("{"); //$NON-NLS-1$
for (int i = 0; i < max; ++i) {
if (keyTable[i] != null) {
buf.append(keyTable[i]).append("->").append(valueTable[i]); //$NON-NLS-1$
}
if (i < max) {
buf.append(", "); //$NON-NLS-1$
}
}
buf.append("}"); //$NON-NLS-1$
return buf.toString();
|