public class TIntIntHashMap extends TIntHash implements Serializable
| Modifier and Type | Field and Description |
|---|---|
protected int[] |
_values
the values of the map
|
_states, FREE, FULL, REMOVED_free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR| Constructor and Description |
|---|
TIntIntHashMap()
Creates a new
TIntIntHashMap instance with the default
capacity and load factor. |
TIntIntHashMap(int initialCapacity)
Creates a new
TIntIntHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
TIntIntHashMap(int initialCapacity,
float loadFactor)
Creates a new
TIntIntHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
TIntIntHashMap(int initialCapacity,
float loadFactor,
TIntHashingStrategy strategy)
Creates a new
TIntIntHashMap instance with a prime
value at or near the specified capacity and load factor. |
TIntIntHashMap(int initialCapacity,
TIntHashingStrategy strategy)
Creates a new
TIntIntHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TIntIntHashMap(TIntHashingStrategy strategy)
Creates a new
TIntIntHashMap instance with the default
capacity and load factor. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
adjustValue(int key,
int amount)
Adjusts the primitive value mapped to key.
|
void |
clear()
Empties the map.
|
Object |
clone() |
boolean |
containsKey(int key)
checks for the present of key in the keys of the map.
|
boolean |
containsValue(int val)
checks for the presence of val in the values of the map.
|
boolean |
equals(Object other)
Compares this map with another map for equality of their stored
entries.
|
boolean |
forEachEntry(TIntIntProcedure procedure)
Executes procedure for each key/value entry in the
map.
|
boolean |
forEachKey(TIntProcedure procedure)
Executes procedure for each key in the map.
|
boolean |
forEachValue(TIntProcedure procedure)
Executes procedure for each value in the map.
|
int |
get(int key)
retrieves the value for key
|
int[] |
getValues()
Returns the values of the map.
|
boolean |
increment(int key)
Increments the primitive value mapped to key by 1
|
TIntIntIterator |
iterator() |
int[] |
keys()
returns the keys of the map.
|
int |
put(int key,
int value)
Inserts a key/value pair into the map.
|
protected void |
rehash(int newCapacity)
rehashes the map to the new capacity.
|
int |
remove(int key)
Deletes a key/value pair from the map.
|
protected void |
removeAt(int index)
removes the mapping at index from the map.
|
boolean |
retainEntries(TIntIntProcedure procedure)
Retains only those entries in the map for which the procedure
returns a true value.
|
void |
setDefaultValue(int defaultValue)
Sets the default values returned by get() when a key is not in this map.
|
protected int |
setUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least
initialCapacity + 1.
|
void |
transformValues(TIntFunction function)
Transform the values in this map using function.
|
computeHashCode, contains, forEach, index, insertionIndexcapacitycompact, ensureCapacity, isEmpty, postInsertHook, size, trimToSizepublic TIntIntHashMap()
TIntIntHashMap instance with the default
capacity and load factor.public TIntIntHashMap(int initialCapacity)
TIntIntHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.initialCapacity - an int valuepublic TIntIntHashMap(int initialCapacity,
float loadFactor)
TIntIntHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.initialCapacity - an int valueloadFactor - a float valuepublic TIntIntHashMap(TIntHashingStrategy strategy)
TIntIntHashMap instance with the default
capacity and load factor.strategy - used to compute hash codes and to compare keys.public TIntIntHashMap(int initialCapacity,
TIntHashingStrategy strategy)
TIntIntHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.initialCapacity - an int valuestrategy - used to compute hash codes and to compare keys.public TIntIntHashMap(int initialCapacity,
float loadFactor,
TIntHashingStrategy strategy)
TIntIntHashMap instance with a prime
value at or near the specified capacity and load factor.initialCapacity - used to find a prime capacity for the table.loadFactor - used to calculate the threshold over which
rehashing takes place.strategy - used to compute hash codes and to compare keys.public Object clone()
public void setDefaultValue(int defaultValue)
public TIntIntIterator iterator()
protected int setUp(int initialCapacity)
public int put(int key,
int value)
key - an int valuevalue - an int valueprotected void rehash(int newCapacity)
public int get(int key)
key - an int valuepublic int remove(int key)
key - an int valueint valuepublic boolean equals(Object other)
protected void removeAt(int index)
public int[] getValues()
Collection valuepublic int[] keys()
Set valuepublic boolean containsValue(int val)
val - an int valueboolean valuepublic boolean containsKey(int key)
key - an int valueboolean valuepublic boolean forEachKey(TIntProcedure procedure)
procedure - a TIntProcedure valuepublic boolean forEachValue(TIntProcedure procedure)
procedure - a TIntProcedure valuepublic boolean forEachEntry(TIntIntProcedure procedure)
procedure - a TOIntIntProcedure valuepublic boolean retainEntries(TIntIntProcedure procedure)
procedure - determines which entries to keeppublic void transformValues(TIntFunction function)
function - a TIntFunction valuepublic boolean increment(int key)
key - the key of the value to incrementpublic boolean adjustValue(int key,
int amount)
key - the key of the value to incrementamount - the amount to adjust the value by.Copyright © 2019 JULIE Lab, Germany. All rights reserved.