final class SimpleHashtable
extends java.lang.Object
implements java.util.Enumeration
java.util.Hashtable
except that: The overall result is that it's less expensive to use these in
performance-critical locations, in terms both of CPU and memory,
than java.util.Hashtable
instances. In this package
it makes a significant difference when normalizing attributes,
which is done for each start-element construct.
Modifier and Type | Class and Description |
---|---|
private static class |
SimpleHashtable.Entry
Hashtable collision list.
|
Modifier and Type | Field and Description |
---|---|
private int |
count |
private SimpleHashtable.Entry |
current |
private int |
currentBucket |
private static float |
loadFactor |
private SimpleHashtable.Entry[] |
table |
private int |
threshold |
Constructor and Description |
---|
SimpleHashtable()
Constructs a new, empty hashtable with a default capacity.
|
SimpleHashtable(int initialCapacity)
Constructs a new, empty hashtable with the specified initial
capacity.
|
Modifier and Type | Method and Description |
---|---|
void |
clear() |
java.lang.Object |
get(java.lang.String key)
Returns the value to which the specified key is mapped in this hashtable.
|
java.lang.Object |
getNonInterned(java.lang.String key)
Returns the value to which the specified key is mapped in this
hashtable ...
|
boolean |
hasMoreElements()
Used to view this as an enumeration; returns true if there
are more keys to be enumerated.
|
java.util.Enumeration |
keys()
Returns an enumeration of the keys in this hashtable.
|
java.lang.Object |
nextElement()
Used to view this as an enumeration; returns the next key
in the enumeration.
|
java.lang.Object |
put(java.lang.Object key,
java.lang.Object value)
Maps the specified
key to the specified
value in this hashtable. |
private void |
rehash()
Increases the capacity of and internally reorganizes this
hashtable, in order to accommodate and access its entries more
efficiently.
|
int |
size()
Returns the number of keys in this hashtable.
|
private SimpleHashtable.Entry[] table
private SimpleHashtable.Entry current
private int currentBucket
private int count
private int threshold
private static final float loadFactor
public SimpleHashtable(int initialCapacity)
initialCapacity
- the initial capacity of the hashtable.public SimpleHashtable()
public void clear()
public int size()
public java.util.Enumeration keys()
Enumeration
public boolean hasMoreElements()
hasMoreElements
in interface java.util.Enumeration
public java.lang.Object nextElement()
nextElement
in interface java.util.Enumeration
public java.lang.Object get(java.lang.String key)
public java.lang.Object getNonInterned(java.lang.String key)
private void rehash()
public java.lang.Object put(java.lang.Object key, java.lang.Object value)
key
to the specified
value
in this hashtable. Neither the key nor the
value can be null
.
The value can be retrieved by calling the get
method
with a key that is equal to the original key.