Package net.sf.saxon.z
Class IntHashMap<T>
java.lang.Object
net.sf.saxon.z.IntHashMap<T>
A hash table that maps int keys to Object values.
-
Constructor Summary
ConstructorsConstructorDescriptionInitializes a map with a capacity of 8 and a load factor of 0,25.IntHashMap
(int capacity) Initializes a map with the given capacity and a load factor of 0,25.IntHashMap
(int capacity, double factor) Constructs a new map with initial capacity, and load factor. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Clears the map.copy()
Create a copy of the IntHashMapget
(int key) Gets the value for this key.Get an iterator over the keyskeySet()
Get the set of integer keys present in this IntHashSetAdds a key-value pair to the map.boolean
remove
(int key) Removes a key from the map.int
size()
Gets the size of the map.Get an iterator over the valuesvalueSet()
Get the collection of values.
-
Constructor Details
-
IntHashMap
public IntHashMap()Initializes a map with a capacity of 8 and a load factor of 0,25. -
IntHashMap
public IntHashMap(int capacity) Initializes a map with the given capacity and a load factor of 0,25.- Parameters:
capacity
- the initial capacity.
-
IntHashMap
public IntHashMap(int capacity, double factor) Constructs a new map with initial capacity, and load factor.The capacity is the number of keys that can be mapped without resizing the arrays in which keys and values are stored. For efficiency, only a fraction of the elements in those arrays are used. That fraction is the specified load factor. The initial length of the arrays equals the smallest power of two not less than the ratio capacity/factor. The capacity of the map is increased, as necessary. The maximum number of keys that can be mapped is 2^30.
- Parameters:
capacity
- the initial capacity.factor
- the load factor.
-
-
Method Details
-
clear
public void clear()Clears the map. -
get
Gets the value for this key.- Parameters:
key
- Key- Returns:
- the value, null if not found.
-
size
public int size()Gets the size of the map.- Returns:
- the size (the number of entries in the map)
-
remove
public boolean remove(int key) Removes a key from the map.- Parameters:
key
- Key to remove- Returns:
- true if the value was removed
-
put
Adds a key-value pair to the map.- Parameters:
key
- Keyvalue
- Value- Returns:
- the value that was previously associated with the key, or null if there was no previous value
-
keyIterator
Get an iterator over the keys- Returns:
- an iterator over the integer keys in the map
-
valueIterator
Get an iterator over the values- Returns:
- an iterator over the values in the map
-
valueSet
Get the collection of values. (Despite the name, this is not a set: it may contain duplicates.)- Returns:
- the set of values as an iterable collection
-
copy
Create a copy of the IntHashMap- Returns:
- a copy of this map
-
keySet
Get the set of integer keys present in this IntHashSet- Returns:
- the set of integer keys present in this IntHashSet
-