|
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.TPrimitiveHash
gnu.trove.TShortHash
gnu.trove.TShortByteHashMap
An open addressed Map implementation for short keys and byte values. Created: Sun Nov 4 08:52:45 2001
Field Summary | |
protected byte[] |
_values
the values of the map |
Fields inherited from class gnu.trove.TShortHash |
_hashingStrategy, _set |
Fields inherited from class gnu.trove.TPrimitiveHash |
_states, FREE, FULL, REMOVED |
Fields inherited from class gnu.trove.THash |
_free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR |
Constructor Summary | |
TShortByteHashMap()
Creates a new TShortByteHashMap instance with the default
capacity and load factor. |
|
TShortByteHashMap(int initialCapacity)
Creates a new TShortByteHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
|
TShortByteHashMap(int initialCapacity,
float loadFactor)
Creates a new TShortByteHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
|
TShortByteHashMap(int initialCapacity,
float loadFactor,
TShortHashingStrategy strategy)
Creates a new TShortByteHashMap instance with a prime
value at or near the specified capacity and load factor. |
|
TShortByteHashMap(int initialCapacity,
TShortHashingStrategy strategy)
Creates a new TShortByteHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
|
TShortByteHashMap(TShortHashingStrategy strategy)
Creates a new TShortByteHashMap instance with the default
capacity and load factor. |
Method Summary | |
boolean |
adjustValue(short key,
byte 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(byte 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(TShortByteProcedure 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(TByteProcedure procedure)
Executes procedure for each value in the map. |
byte |
get(short key)
retrieves the value for key |
byte[] |
getValues()
Returns the values of the map. |
int |
hashCode()
|
boolean |
increment(short key)
Increments the primitive value mapped to key by 1 |
TShortByteIterator |
iterator()
|
short[] |
keys()
returns the keys of the map. |
byte |
put(short key,
byte value)
Inserts a key/value pair into the map. |
protected void |
rehash(int newCapacity)
rehashes the map to the new capacity. |
byte |
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(TShortByteProcedure 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(TByteFunction function)
Transform the values in this map using function. |
Methods inherited from class gnu.trove.TShortHash |
computeHashCode, contains, forEach, index, insertionIndex |
Methods inherited from class gnu.trove.TPrimitiveHash |
capacity |
Methods inherited from class gnu.trove.THash |
compact, ensureCapacity, isEmpty, postInsertHook, size, trimToSize |
Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
protected transient byte[] _values
Constructor Detail |
public TShortByteHashMap()
TShortByteHashMap
instance with the default
capacity and load factor.
public TShortByteHashMap(int initialCapacity)
TShortByteHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity
- an int
valuepublic TShortByteHashMap(int initialCapacity, float loadFactor)
TShortByteHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
initialCapacity
- an int
valueloadFactor
- a float
valuepublic TShortByteHashMap(TShortHashingStrategy strategy)
TShortByteHashMap
instance with the default
capacity and load factor.
strategy
- used to compute hash codes and to compare keys.public TShortByteHashMap(int initialCapacity, TShortHashingStrategy strategy)
TShortByteHashMap
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 TShortByteHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)
TShortByteHashMap
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 java.lang.Object clone()
clone
in class TShortHash
public TShortByteIterator iterator()
protected int setUp(int initialCapacity)
setUp
in class TShortHash
initialCapacity
- an int
value
public byte put(short key, byte value)
key
- an short
valuevalue
- an byte
value
protected void rehash(int newCapacity)
rehash
in class THash
newCapacity
- an int
valuepublic byte get(short key)
key
- an short
value
public void clear()
clear
in class THash
public byte remove(short key)
key
- an short
value
byte
value, or (byte)0 if no mapping for key existspublic boolean equals(java.lang.Object other)
other
- an Object
value
boolean
valuepublic int hashCode()
protected void removeAt(int index)
removeAt
in class TShortHash
index
- an int
valuepublic byte[] getValues()
Collection
valuepublic short[] keys()
Set
valuepublic boolean containsValue(byte val)
val
- an byte
value
boolean
valuepublic boolean containsKey(short key)
key
- an short
value
boolean
valuepublic boolean forEachKey(TShortProcedure procedure)
procedure
- a TShortProcedure
value
public boolean forEachValue(TByteProcedure procedure)
procedure
- a TByteProcedure
value
public boolean forEachEntry(TShortByteProcedure procedure)
procedure
- a TOShortByteProcedure
value
public boolean retainEntries(TShortByteProcedure procedure)
procedure
- determines which entries to keep
public void transformValues(TByteFunction function)
function
- a TByteFunction
valuepublic boolean increment(short key)
key
- the key of the value to increment
public boolean adjustValue(short key, byte amount)
key
- the key of the value to incrementamount
- the amount to adjust the value by.
|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |