|
GNU Trove | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectgnu.trove.THash
gnu.trove.TObjectHash<K>
gnu.trove.TObjectShortHashMap<K>
public class TObjectShortHashMap<K>
An open addressed Map implementation for Object keys and short values. Created: Sun Nov 4 08:52:45 2001
| Field Summary | |
|---|---|
protected short[] |
_values
the values of the map |
| Fields inherited from class gnu.trove.TObjectHash |
|---|
_hashingStrategy, _set, FREE, REMOVED |
| Fields inherited from class gnu.trove.THash |
|---|
_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR |
| Constructor Summary | |
|---|---|
TObjectShortHashMap()
Creates a new TObjectShortHashMap instance with the default
capacity and load factor. |
|
TObjectShortHashMap(int initialCapacity)
Creates a new TObjectShortHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
|
TObjectShortHashMap(int initialCapacity,
float loadFactor)
Creates a new TObjectShortHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
|
TObjectShortHashMap(int initialCapacity,
float loadFactor,
TObjectHashingStrategy<K> strategy)
Creates a new TObjectShortHashMap instance with a prime
value at or near the specified capacity and load factor. |
|
TObjectShortHashMap(int initialCapacity,
TObjectHashingStrategy<K> strategy)
Creates a new TObjectShortHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
|
TObjectShortHashMap(TObjectHashingStrategy<K> strategy)
Creates a new TObjectShortHashMap instance with the default
capacity and load factor. |
|
| Method Summary | |
|---|---|
short |
adjustOrPutValue(K key,
short adjust_amount,
short put_amount)
Adjusts the primitive value mapped to the key if the key is present in the map. |
boolean |
adjustValue(K key,
short amount)
Adjusts the primitive value mapped to key. |
void |
clear()
Empties the map. |
TObjectShortHashMap<K> |
clone()
|
boolean |
containsKey(K key)
checks for the present of key in the keys of the map. |
boolean |
containsValue(short 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(TObjectShortProcedure<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(TShortProcedure procedure)
Executes procedure for each value in the map. |
short |
get(K key)
retrieves the value for key |
short[] |
getValues()
Returns the values of the map. |
boolean |
increment(K key)
Increments the primitive value mapped to key by 1 |
TObjectShortIterator<K> |
iterator()
|
java.lang.Object[] |
keys()
returns the keys of the map. |
K[] |
keys(K[] a)
returns the keys of the map. |
short |
put(K key,
short value)
Inserts a key/value pair into the map. |
void |
putAll(TObjectShortHashMap<K> map)
Put all the entries from the given map into this map. |
short |
putIfAbsent(K key,
short 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. |
short |
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(TObjectShortProcedure<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. |
java.lang.String |
toString()
|
void |
transformValues(TShortFunction function)
Transform the values in this map using function. |
void |
writeExternal(java.io.ObjectOutput out)
|
| Methods inherited from class gnu.trove.TObjectHash |
|---|
capacity, computeHashCode, contains, equals, forEach, index, insertionIndex, throwObjectContractViolation |
| Methods inherited from class gnu.trove.THash |
|---|
calculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize |
| Methods inherited from class java.lang.Object |
|---|
finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
protected transient short[] _values
| Constructor Detail |
|---|
public TObjectShortHashMap()
TObjectShortHashMap instance with the default
capacity and load factor.
public TObjectShortHashMap(int initialCapacity)
TObjectShortHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity - an int value
public TObjectShortHashMap(int initialCapacity,
float loadFactor)
TObjectShortHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
initialCapacity - an int valueloadFactor - a float valuepublic TObjectShortHashMap(TObjectHashingStrategy<K> strategy)
TObjectShortHashMap instance with the default
capacity and load factor.
strategy - used to compute hash codes and to compare keys.
public TObjectShortHashMap(int initialCapacity,
TObjectHashingStrategy<K> strategy)
TObjectShortHashMap 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 TObjectShortHashMap(int initialCapacity,
float loadFactor,
TObjectHashingStrategy<K> strategy)
TObjectShortHashMap 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.| Method Detail |
|---|
public TObjectShortIterator<K> iterator()
protected int setUp(int initialCapacity)
setUp in class TObjectHash<K>initialCapacity - an int value
public short put(K key,
short value)
key - an Object valuevalue - an short value
public short putIfAbsent(K key,
short value)
key - an Object valuevalue - an short value
public void putAll(TObjectShortHashMap<K> map)
map - The map from which entries will be obtained to put into this map.protected void rehash(int newCapacity)
rehash in class THashnewCapacity - an int valuepublic short get(K key)
key - an Object value
public void clear()
clear in class THashpublic short remove(K key)
key - an Object value
short value or (short)0 if no such mapping exists.public boolean equals(java.lang.Object other)
equals in class java.lang.Objectother - an Object value
boolean valuepublic TObjectShortHashMap<K> clone()
clone in class TObjectHash<K>protected void removeAt(int index)
removeAt in class TObjectHash<K>index - an int valuepublic short[] getValues()
Collection valuepublic java.lang.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(short val)
val - an short value
boolean valuepublic boolean containsKey(K key)
key - an Object value
boolean valuepublic boolean forEachKey(TObjectProcedure<K> procedure)
procedure - a TObjectProcedure value
public boolean forEachValue(TShortProcedure procedure)
procedure - a TShortProcedure value
public boolean forEachEntry(TObjectShortProcedure<K> procedure)
procedure - a TOObjectShortProcedure value
public boolean retainEntries(TObjectShortProcedure<K> procedure)
procedure - determines which entries to keep
public void transformValues(TShortFunction function)
function - a TShortFunction valuepublic boolean increment(K key)
key - the key of the value to increment
public boolean adjustValue(K key,
short amount)
key - the key of the value to incrementamount - the amount to adjust the value by.
public short adjustOrPutValue(K key,
short adjust_amount,
short 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 present
public void writeExternal(java.io.ObjectOutput out)
throws java.io.IOException
writeExternal in interface java.io.ExternalizablewriteExternal in class TObjectHash<K>java.io.IOException
public void readExternal(java.io.ObjectInput in)
throws java.io.IOException,
java.lang.ClassNotFoundException
readExternal in interface java.io.ExternalizablereadExternal in class TObjectHash<K>java.io.IOException
java.lang.ClassNotFoundExceptionpublic java.lang.String toString()
toString in class java.lang.Object
|
GNU Trove | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||