public class TObjectLongHashMap<K> extends TObjectHash<K> implements Externalizable
| Modifier and Type | Field and Description |
|---|---|
protected long[] |
_values
the values of the map
|
_hashingStrategy, _set, FREE, REMOVED_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR| Constructor and Description |
|---|
TObjectLongHashMap()
Creates a new
TObjectLongHashMap instance with the default capacity and load
factor. |
TObjectLongHashMap(int initialCapacity)
Creates a new
TObjectLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the default load factor. |
TObjectLongHashMap(int initialCapacity,
float loadFactor)
Creates a new
TObjectLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the specified load factor. |
TObjectLongHashMap(int initialCapacity,
float loadFactor,
TObjectHashingStrategy<K> strategy)
Creates a new
TObjectLongHashMap instance with a prime value at or near the
specified capacity and load factor. |
TObjectLongHashMap(int initialCapacity,
TObjectHashingStrategy<K> strategy)
Creates a new
TObjectLongHashMap instance whose capacity is the next highest
prime above initialCapacity + 1 unless that value is already prime. |
TObjectLongHashMap(TObjectHashingStrategy<K> strategy)
Creates a new
TObjectLongHashMap instance with the default capacity and load
factor. |
| Modifier and Type | Method and Description |
|---|---|
long |
adjustOrPutValue(K 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(K key,
long amount)
Adjusts the primitive value mapped to key.
|
void |
clear()
Empties the map.
|
TObjectLongHashMap<K> |
clone() |
boolean |
containsKey(K 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(TObjectLongProcedure<K> procedure)
Executes procedure for each key/value entry in the map.
|
boolean |
forEachKey(TObjectProcedure<K> procedure)
Executes procedure for each key in the map.
|
boolean |
forEachValue(TLongProcedure procedure)
Executes procedure for each value in the map.
|
long |
get(K key)
retrieves the value for key
|
long[] |
getValues()
Returns the values of the map.
|
boolean |
increment(K key)
Increments the primitive value mapped to key by 1
|
TObjectLongIterator<K> |
iterator() |
Object[] |
keys()
returns the keys of the map.
|
K[] |
keys(K[] a)
returns the keys of the map.
|
long |
put(K key,
long value)
Inserts a key/value pair into the map.
|
long |
putIfAbsent(K 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(K key)
Deletes a key/value pair from the map.
|
protected void |
removeAt(int index)
removes the mapping at index from the map.
|
boolean |
retainEntries(TObjectLongProcedure<K> 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) |
capacity, computeHashCode, contains, equals, forEach, index, insertionIndex, throwObjectContractViolationcalculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSizepublic TObjectLongHashMap()
TObjectLongHashMap instance with the default capacity and load
factor.public TObjectLongHashMap(int initialCapacity)
TObjectLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the default load factor.initialCapacity - an int valuepublic TObjectLongHashMap(int initialCapacity,
float loadFactor)
TObjectLongHashMap instance with a prime capacity equal to or
greater than initialCapacity and with the specified load factor.initialCapacity - an int valueloadFactor - a float valuepublic TObjectLongHashMap(TObjectHashingStrategy<K> strategy)
TObjectLongHashMap instance with the default capacity and load
factor.strategy - used to compute hash codes and to compare keys.public TObjectLongHashMap(int initialCapacity,
TObjectHashingStrategy<K> strategy)
TObjectLongHashMap 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 TObjectLongHashMap(int initialCapacity,
float loadFactor,
TObjectHashingStrategy<K> strategy)
TObjectLongHashMap 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 TObjectLongIterator<K> iterator()
protected int setUp(int initialCapacity)
setUp in class TObjectHash<K>initialCapacity - an int valuepublic long put(K key, long value)
key - an Object valuevalue - an long valuepublic long putIfAbsent(K key, long value)
key - an Object valuevalue - an long valueprotected void rehash(int newCapacity)
public long get(K key)
key - an Object valuepublic long remove(K key)
key - an Object valuelong value or (long)0 if no such mapping exists.public boolean equals(Object other)
public TObjectLongHashMap<K> clone()
clone in class TObjectHash<K>protected void removeAt(int index)
removeAt in class TObjectHash<K>index - an int valuepublic long[] getValues()
Collection valuepublic Object[] keys()
Set valuepublic K[] keys(K[] 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 runtime type is allocated for this purpose.Set valuepublic boolean containsValue(long val)
val - an long valueboolean valuepublic boolean containsKey(K key)
key - an Object valueboolean valuepublic boolean forEachKey(TObjectProcedure<K> procedure)
procedure - a TObjectProcedure valuepublic boolean forEachValue(TLongProcedure procedure)
procedure - a TLongProcedure valuepublic boolean forEachEntry(TObjectLongProcedure<K> procedure)
procedure - a TOObjectLongProcedure valuepublic boolean retainEntries(TObjectLongProcedure<K> procedure)
procedure - determines which entries to keeppublic void transformValues(TLongFunction function)
function - a TLongFunction valuepublic boolean increment(K key)
key - the key of the value to incrementpublic boolean adjustValue(K key, long amount)
key - the key of the value to incrementamount - the amount to adjust the value by.public long adjustOrPutValue(K 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 TObjectHash<K>IOExceptionpublic void readExternal(ObjectInput in) throws IOException, ClassNotFoundException
readExternal in interface ExternalizablereadExternal in class TObjectHash<K>IOExceptionClassNotFoundExceptionCopyright © GigaSpaces.