|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.elasticsearch.util.gnu.trove.THash
org.elasticsearch.util.gnu.trove.TPrimitiveHash
org.elasticsearch.util.gnu.trove.TByteHash
org.elasticsearch.util.gnu.trove.TByteShortHashMap
public class TByteShortHashMap
An open addressed Map implementation for byte 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 org.elasticsearch.util.gnu.trove.TByteHash |
---|
_hashingStrategy, _set |
Fields inherited from class org.elasticsearch.util.gnu.trove.TPrimitiveHash |
---|
_states, FREE, FULL, REMOVED |
Fields inherited from class org.elasticsearch.util.gnu.trove.THash |
---|
_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR |
Constructor Summary | |
---|---|
TByteShortHashMap()
Creates a new TByteShortHashMap instance with the default
capacity and load factor. |
|
TByteShortHashMap(int initialCapacity)
Creates a new TByteShortHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
|
TByteShortHashMap(int initialCapacity,
float loadFactor)
Creates a new TByteShortHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
|
TByteShortHashMap(int initialCapacity,
float loadFactor,
TByteHashingStrategy strategy)
Creates a new TByteShortHashMap instance with a prime
value at or near the specified capacity and load factor. |
|
TByteShortHashMap(int initialCapacity,
TByteHashingStrategy strategy)
Creates a new TByteShortHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
|
TByteShortHashMap(TByteHashingStrategy strategy)
Creates a new TByteShortHashMap instance with the default
capacity and load factor. |
Method Summary | |
---|---|
short |
adjustOrPutValue(byte 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(byte key,
short amount)
Adjusts the primitive value mapped to key. |
void |
clear()
Empties the map. |
java.lang.Object |
clone()
|
boolean |
containsKey(byte 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(TByteShortProcedure procedure)
Executes procedure for each key/value entry in the map. |
boolean |
forEachKey(TByteProcedure procedure)
Executes procedure for each key in the map. |
boolean |
forEachValue(TShortProcedure procedure)
Executes procedure for each value in the map. |
short |
get(byte key)
retrieves the value for key |
short[] |
getValues()
Returns the values of the map. |
int |
hashCode()
|
boolean |
increment(byte key)
Increments the primitive value mapped to key by 1 |
TByteShortIterator |
iterator()
|
byte[] |
keys()
returns the keys of the map. |
byte[] |
keys(byte[] a)
returns the keys of the map. |
short |
put(byte key,
short value)
Inserts a key/value pair into the map. |
void |
putAll(TByteShortHashMap map)
Put all the entries from the given map into this map. |
short |
putIfAbsent(byte 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(byte key)
Deletes a key/value pair from the map. |
protected void |
removeAt(int index)
removes the mapping at index from the map. |
boolean |
retainEntries(TByteShortProcedure 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 org.elasticsearch.util.gnu.trove.TByteHash |
---|
computeHashCode, contains, forEach, index, insertionIndex |
Methods inherited from class org.elasticsearch.util.gnu.trove.TPrimitiveHash |
---|
capacity |
Methods inherited from class org.elasticsearch.util.gnu.trove.THash |
---|
calculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
protected transient short[] _values
Constructor Detail |
---|
public TByteShortHashMap()
TByteShortHashMap
instance with the default
capacity and load factor.
public TByteShortHashMap(int initialCapacity)
TByteShortHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity
- an int
valuepublic TByteShortHashMap(int initialCapacity, float loadFactor)
TByteShortHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
initialCapacity
- an int
valueloadFactor
- a float
valuepublic TByteShortHashMap(TByteHashingStrategy strategy)
TByteShortHashMap
instance with the default
capacity and load factor.
strategy
- used to compute hash codes and to compare keys.public TByteShortHashMap(int initialCapacity, TByteHashingStrategy strategy)
TByteShortHashMap
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 TByteShortHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)
TByteShortHashMap
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 TByteHash
public TByteShortIterator iterator()
protected int setUp(int initialCapacity)
setUp
in class TByteHash
initialCapacity
- an int
value
public short put(byte key, short value)
key
- an byte
valuevalue
- an short
value
public short putIfAbsent(byte key, short value)
key
- an byte
valuevalue
- an short
value
public void putAll(TByteShortHashMap map)
map
- The map from which entries will be obtained to put into this map.protected void rehash(int newCapacity)
rehash
in class THash
newCapacity
- an int
valuepublic short get(byte key)
key
- an byte
value
public void clear()
clear
in class THash
public short remove(byte key)
key
- an byte
value
short
value, or (byte)0 if no mapping for key existspublic boolean equals(java.lang.Object other)
equals
in class java.lang.Object
other
- an Object
value
boolean
valuepublic int hashCode()
hashCode
in class java.lang.Object
protected void removeAt(int index)
removeAt
in class TByteHash
index
- an int
valuepublic short[] getValues()
Collection
valuepublic byte[] keys()
Set
valuepublic byte[] keys(byte[] 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(short val)
val
- an short
value
boolean
valuepublic boolean containsKey(byte key)
key
- an byte
value
boolean
valuepublic boolean forEachKey(TByteProcedure procedure)
procedure
- a TByteProcedure
value
public boolean forEachValue(TShortProcedure procedure)
procedure
- a TShortProcedure
value
public boolean forEachEntry(TByteShortProcedure procedure)
procedure
- a TOByteShortProcedure
value
public boolean retainEntries(TByteShortProcedure procedure)
procedure
- determines which entries to keep
public void transformValues(TShortFunction function)
function
- a TShortFunction
valuepublic boolean increment(byte key)
key
- the key of the value to increment
public boolean adjustValue(byte key, short amount)
key
- the key of the value to incrementamount
- the amount to adjust the value by.
public short adjustOrPutValue(byte 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.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
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |