public class TShortLongHashMap extends TShortHash implements Externalizable
| Modifier and Type | Field and Description |
|---|---|
protected long[] |
_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 |
|---|
TShortLongHashMap()
Creates a new
TShortLongHashMap instance with the default capacity and load
factor. |
TShortLongHashMap(int initialCapacity)
Creates a new
TShortLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the default load factor. |
TShortLongHashMap(int initialCapacity,
float loadFactor)
Creates a new
TShortLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the specified load factor. |
TShortLongHashMap(int initialCapacity,
float loadFactor,
TShortHashingStrategy strategy)
Creates a new
TShortLongHashMap instance with a prime value at or near the
specified capacity and load factor. |
TShortLongHashMap(int initialCapacity,
TShortHashingStrategy strategy)
Creates a new
TShortLongHashMap instance whose capacity is the next highest
prime above initialCapacity + 1 unless that value is already prime. |
TShortLongHashMap(TShortHashingStrategy strategy)
Creates a new
TShortLongHashMap instance with the default capacity and load
factor. |
| Modifier and Type | Method and Description |
|---|---|
long |
adjustOrPutValue(short key,
long adjust_amount,
long put_amount)
Adjusts the primitive value mapped to the key if the key is present in the map.
|
boolean |
adjustValue(short key,
long amount)
Adjusts the primitive value mapped to key.
|
void |
clear()
Empties the map.
|
Object |
clone() |
boolean |
containsKey(short key)
checks for the present of key in the keys of the map.
|
boolean |
containsValue(long 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(TShortLongProcedure 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(TLongProcedure procedure)
Executes procedure for each value in the map.
|
long |
get(short key)
retrieves the value for key
|
long[] |
getValues()
Returns the values of the map.
|
int |
hashCode() |
boolean |
increment(short key)
Increments the primitive value mapped to key by 1
|
TShortLongIterator |
iterator() |
short[] |
keys()
returns the keys of the map.
|
short[] |
keys(short[] a)
returns the keys of the map.
|
long |
put(short key,
long value)
Inserts a key/value pair into the map.
|
long |
putIfAbsent(short key,
long value)
Inserts a key/value pair into the map if the specified key is not already associated with a
value.
|
void |
readExternal(ObjectInput in) |
protected void |
rehash(int newCapacity)
rehashes the map to the new capacity.
|
long |
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(TShortLongProcedure 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.
|
void |
transformValues(TLongFunction function)
Transform the values in this map using function.
|
void |
writeExternal(ObjectOutput out) |
computeHashCode, contains, forEach, index, insertionIndexcapacitycalculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSizepublic TShortLongHashMap()
TShortLongHashMap instance with the default capacity and load
factor.public TShortLongHashMap(int initialCapacity)
TShortLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the default load factor.initialCapacity - an int valuepublic TShortLongHashMap(int initialCapacity,
float loadFactor)
TShortLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the specified load factor.initialCapacity - an int valueloadFactor - a float valuepublic TShortLongHashMap(TShortHashingStrategy strategy)
TShortLongHashMap instance with the default capacity and load
factor.strategy - used to compute hash codes and to compare keys.public TShortLongHashMap(int initialCapacity,
TShortHashingStrategy strategy)
TShortLongHashMap 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 TShortLongHashMap(int initialCapacity,
float loadFactor,
TShortHashingStrategy strategy)
TShortLongHashMap 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()
clone in class TShortHashpublic TShortLongIterator iterator()
protected int setUp(int initialCapacity)
setUp in class TShortHashinitialCapacity - an int valuepublic long put(short key,
long value)
key - an short valuevalue - an long valuepublic long putIfAbsent(short key,
long value)
key - an short valuevalue - an long valueprotected void rehash(int newCapacity)
public long get(short key)
key - an short valuepublic long remove(short key)
key - an short valuelong value, or (short)0 if no mapping for key existspublic boolean equals(Object other)
protected void removeAt(int index)
removeAt in class TShortHashindex - an int valuepublic long[] 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(long val)
val - an long valueboolean valuepublic boolean containsKey(short key)
key - an short valueboolean valuepublic boolean forEachKey(TShortProcedure procedure)
procedure - a TShortProcedure valuepublic boolean forEachValue(TLongProcedure procedure)
procedure - a TLongProcedure valuepublic boolean forEachEntry(TShortLongProcedure procedure)
procedure - a TOShortLongProcedure valuepublic boolean retainEntries(TShortLongProcedure procedure)
procedure - determines which entries to keeppublic void transformValues(TLongFunction function)
function - a TLongFunction valuepublic boolean increment(short key)
key - the key of the value to incrementpublic boolean adjustValue(short key,
long amount)
key - the key of the value to incrementamount - the amount to adjust the value by.public long adjustOrPutValue(short key,
long adjust_amount,
long 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(ObjectOutput out) throws IOException
writeExternal in interface ExternalizablewriteExternal in class THashIOExceptionpublic void readExternal(ObjectInput in) throws IOException, ClassNotFoundException
readExternal in interface ExternalizablereadExternal in class THashIOExceptionClassNotFoundExceptionCopyright © GigaSpaces.