public class TShortIntHashMap extends TShortHash implements java.io.Externalizable
Modifier and Type | Field and Description |
---|---|
protected int[] |
_values
the values of the map
|
_hashingStrategy, _set
_states, FREE, FULL, REMOVED
_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR
Constructor and Description |
---|
TShortIntHashMap()
Creates a new
TShortIntHashMap instance with the default
capacity and load factor. |
TShortIntHashMap(int initialCapacity)
Creates a new
TShortIntHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
TShortIntHashMap(int initialCapacity,
float loadFactor)
Creates a new
TShortIntHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
TShortIntHashMap(int initialCapacity,
float loadFactor,
TShortHashingStrategy strategy)
Creates a new
TShortIntHashMap instance with a prime
value at or near the specified capacity and load factor. |
TShortIntHashMap(int initialCapacity,
TShortHashingStrategy strategy)
Creates a new
TShortIntHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TShortIntHashMap(TShortHashingStrategy strategy)
Creates a new
TShortIntHashMap instance with the default
capacity and load factor. |
Modifier and Type | Method and Description |
---|---|
int |
adjustOrPutValue(short key,
int adjust_amount,
int put_amount)
Adjusts the primitive value mapped to the key if the key is present in the map.
|
boolean |
adjustValue(short key,
int amount)
Adjusts the primitive value mapped to key.
|
void |
clear()
Empties the map.
|
java.lang.Object |
clone() |
boolean |
containsKey(short 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(java.lang.Object other)
Compares this map with another map for equality of their stored
entries.
|
boolean |
forEachEntry(TShortIntProcedure procedure)
Executes procedure for each key/value entry in the
map.
|
boolean |
forEachKey(TShortProcedure procedure)
Executes procedure for each key in the map.
|
boolean |
forEachValue(TIntProcedure procedure)
Executes procedure for each value in the map.
|
int |
get(short key)
retrieves the value for key
|
int[] |
getValues()
Returns the values of the map.
|
int |
hashCode() |
boolean |
increment(short key)
Increments the primitive value mapped to key by 1
|
TShortIntIterator |
iterator() |
short[] |
keys()
returns the keys of the map.
|
short[] |
keys(short[] a)
returns the keys of the map.
|
int |
put(short key,
int value)
Inserts a key/value pair into the map.
|
void |
putAll(TShortIntHashMap map)
Put all the entries from the given map into this map.
|
int |
putIfAbsent(short key,
int value)
Inserts a key/value pair into the map if the specified key is not already
associated with a value.
|
void |
readExternal(java.io.ObjectInput in) |
protected void |
rehash(int newCapacity)
rehashes the map to the new capacity.
|
int |
remove(short key)
Deletes a key/value pair from the map.
|
protected void |
removeAt(int index)
removes the mapping at index from the map.
|
boolean |
retainEntries(TShortIntProcedure procedure)
Retains only those entries in the map for which the procedure
returns a true value.
|
protected int |
setUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least
initialCapacity + 1.
|
java.lang.String |
toString() |
void |
transformValues(TIntFunction function)
Transform the values in this map using function.
|
void |
writeExternal(java.io.ObjectOutput out) |
computeHashCode, contains, forEach, index, insertionIndex
capacity
calculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize
public TShortIntHashMap()
TShortIntHashMap
instance with the default
capacity and load factor.public TShortIntHashMap(int initialCapacity)
TShortIntHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.initialCapacity
- an int
valuepublic TShortIntHashMap(int initialCapacity, float loadFactor)
TShortIntHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.initialCapacity
- an int
valueloadFactor
- a float
valuepublic TShortIntHashMap(TShortHashingStrategy strategy)
TShortIntHashMap
instance with the default
capacity and load factor.strategy
- used to compute hash codes and to compare keys.public TShortIntHashMap(int initialCapacity, TShortHashingStrategy strategy)
TShortIntHashMap
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 TShortIntHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)
TShortIntHashMap
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 java.lang.Object clone()
clone
in class TShortHash
public TShortIntIterator iterator()
protected int setUp(int initialCapacity)
setUp
in class TShortHash
initialCapacity
- an int
valuepublic int put(short key, int value)
key
- an short
valuevalue
- an int
valuepublic int putIfAbsent(short key, int value)
key
- an short
valuevalue
- an int
valuepublic void putAll(TShortIntHashMap map)
map
- The map from which entries will be obtained to put into this map.protected void rehash(int newCapacity)
public int get(short key)
key
- an short
valuepublic int remove(short key)
key
- an short
valueint
value, or (short)0 if no mapping for key existspublic boolean equals(java.lang.Object other)
equals
in class java.lang.Object
other
- an Object
valueboolean
valuepublic int hashCode()
hashCode
in class java.lang.Object
protected void removeAt(int index)
removeAt
in class TShortHash
index
- an int
valuepublic int[] getValues()
Collection
valuepublic short[] keys()
Set
valuepublic short[] keys(short[] a)
a
- the array into which the elements of the list are to
be stored, if it is big enough; otherwise, a new array of the
same type is allocated for this purpose.Set
valuepublic boolean containsValue(int val)
val
- an int
valueboolean
valuepublic boolean containsKey(short key)
key
- an short
valueboolean
valuepublic boolean forEachKey(TShortProcedure procedure)
procedure
- a TShortProcedure
valuepublic boolean forEachValue(TIntProcedure procedure)
procedure
- a TIntProcedure
valuepublic boolean forEachEntry(TShortIntProcedure procedure)
procedure
- a TOShortIntProcedure
valuepublic boolean retainEntries(TShortIntProcedure procedure)
procedure
- determines which entries to keeppublic void transformValues(TIntFunction function)
function
- a TIntFunction
valuepublic boolean increment(short key)
key
- the key of the value to incrementpublic boolean adjustValue(short key, int amount)
key
- the key of the value to incrementamount
- the amount to adjust the value by.public int adjustOrPutValue(short key, int adjust_amount, int put_amount)
key
- the key of the value to incrementadjust_amount
- the amount to adjust the value byput_amount
- the value put into the map if the key is not initial presentpublic void writeExternal(java.io.ObjectOutput out) throws java.io.IOException
writeExternal
in interface java.io.Externalizable
writeExternal
in class THash
java.io.IOException
public void readExternal(java.io.ObjectInput in) throws java.io.IOException, java.lang.ClassNotFoundException
readExternal
in interface java.io.Externalizable
readExternal
in class THash
java.io.IOException
java.lang.ClassNotFoundException
public java.lang.String toString()
toString
in class java.lang.Object
GNU Trove is copyright ? 2001-2009 Eric D. Friedman. All Rights Reserved.