Class IntHashtable
- All Implemented Interfaces:
Cloneable
A hash map that uses primitive ints for the key rather than objects.
Note that this class is for internal optimization purposes only, and may not be supported in future releases of Jakarta Commons Lang. Utilities of this sort may be included in future releases of Jakarta Commons Collections.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) static class
Innerclass that acts as a datastructure to create a new entry in the table.private static class
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate int
The total number of entries in the hash table.private final float
The load factor for the hashtable.private IntHashtable.Entry[]
The hash table data.private int
The table is rehashed when its size exceeds this threshold. -
Constructor Summary
ConstructorsModifierConstructorDescriptionConstructs a new, empty hashtable with a default capacity and load factor, which is20
and0.75
respectively.IntHashtable
(int initialCapacity) Constructs a new, empty hashtable with the specified initial capacity and default load factor, which is0.75
.private
IntHashtable
(int initialCapacity, float loadFactor) Constructs a new, empty hashtable with the specified initial capacity and the specified load factor. -
Method Summary
Modifier and TypeMethodDescription(package private) void
clear()
Clears this hashtable so that it contains no keys.clone()
(package private) boolean
containsKey
(int key) Tests if the specified int is a key in this hashtable.(package private) int
get
(int key) Returns the value to which the specified key is mapped in this map.int[]
getKeys()
int
boolean
isEmpty()
Tests if this hashtable maps no keys to values.(package private) int
put
(int key, int value) Maps the specifiedkey
to the specifiedvalue
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.(package private) int
remove
(int key) Removes the key (and its corresponding value) from this hashtable.(package private) int
size()
Returns the number of keys in this hashtable.(package private) int[]
-
Field Details
-
table
The hash table data. -
count
private transient int countThe total number of entries in the hash table. -
threshold
private int thresholdThe table is rehashed when its size exceeds this threshold. (The value of this field is (int)(capacity * loadFactor).) -
loadFactor
private final float loadFactorThe load factor for the hashtable.
-
-
Constructor Details
-
IntHashtable
public IntHashtable()Constructs a new, empty hashtable with a default capacity and load factor, which is
20
and0.75
respectively. -
IntHashtable
public IntHashtable(int initialCapacity) Constructs a new, empty hashtable with the specified initial capacity and default load factor, which is
0.75
.- Parameters:
initialCapacity
- the initial capacity of the hashtable.- Throws:
IllegalArgumentException
- if the initial capacity is less than zero.
-
IntHashtable
private IntHashtable(int initialCapacity, float loadFactor) Constructs a new, empty hashtable with the specified initial capacity and the specified load factor.
- Parameters:
initialCapacity
- the initial capacity of the hashtable.loadFactor
- the load factor of the hashtable.- Throws:
IllegalArgumentException
- if the initial capacity is less than zero, or if the load factor is nonpositive.
-
-
Method Details
-
size
int size()Returns the number of keys in this hashtable.
- Returns:
- the number of keys in this hashtable.
-
isEmpty
public boolean isEmpty()Tests if this hashtable maps no keys to values.
- Returns:
true
if this hashtable maps no keys to values;false
otherwise.
-
containsKey
boolean containsKey(int key) Tests if the specified int is a key in this hashtable.
- Parameters:
key
- possible key.- Returns:
true
if and only if the specified int is a key in this hashtable, as determined by the equals method;false
otherwise.- See Also:
-
get
int get(int key) Returns the value to which the specified key is mapped in this map.
- Parameters:
key
- a key in the hashtable.- Returns:
- the value to which the key is mapped in this hashtable;
null
if the key is not mapped to any value in this hashtable. - See Also:
-
rehash
private void rehash()Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently.
This method is called automatically when the number of keys in the hashtable exceeds this hashtable's capacity and load factor.
-
put
int put(int key, int value) Maps the specified
key
to the specifiedvalue
in this hashtable. The key cannot benull
.The value can be retrieved by calling the
get
method with a key that is equal to the original key.- Parameters:
key
- the hashtable key.value
- the value.- Returns:
- the previous value of the specified key in this hashtable,
or
null
if it did not have one. - Throws:
NullPointerException
- if the key isnull
.- See Also:
-
remove
int remove(int key) Removes the key (and its corresponding value) from this hashtable.
This method does nothing if the key is not present in the hashtable.
- Parameters:
key
- the key that needs to be removed.- Returns:
- the value to which the key had been mapped in this hashtable,
or
null
if the key did not have a mapping.
-
clear
void clear()Clears this hashtable so that it contains no keys.
-
getEntryIterator
-
toOrderedKeys
int[] toOrderedKeys() -
getKeys
public int[] getKeys() -
getOneKey
public int getOneKey() -
clone
-