|
|||||||||
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.TDoubleHash
org.elasticsearch.util.gnu.trove.TDoubleObjectHashMap<V>
public class TDoubleObjectHashMap<V>
An open addressed Map implementation for double keys and Object values.
Created: Sun Nov 4 08:52:45 2001
Field Summary | |
---|---|
protected V[] |
_values
the values of the map |
Fields inherited from class org.elasticsearch.util.gnu.trove.TDoubleHash |
---|
_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 | |
---|---|
TDoubleObjectHashMap()
Creates a new TDoubleObjectHashMap instance with the default
capacity and load factor. |
|
TDoubleObjectHashMap(int initialCapacity)
Creates a new TDoubleObjectHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
|
TDoubleObjectHashMap(int initialCapacity,
float loadFactor)
Creates a new TDoubleObjectHashMap instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
|
TDoubleObjectHashMap(int initialCapacity,
float loadFactor,
TDoubleHashingStrategy strategy)
Creates a new TDoubleObjectHashMap instance with a prime
value at or near the specified capacity and load factor. |
|
TDoubleObjectHashMap(int initialCapacity,
TDoubleHashingStrategy strategy)
Creates a new TDoubleObjectHashMap instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
|
TDoubleObjectHashMap(TDoubleHashingStrategy strategy)
Creates a new TDoubleObjectHashMap instance with the default
capacity and load factor. |
Method Summary | ||
---|---|---|
void |
clear()
Empties the map. |
|
TDoubleObjectHashMap<V> |
clone()
|
|
boolean |
containsKey(double key)
checks for the present of key in the keys of the map. |
|
boolean |
containsValue(V 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(TDoubleObjectProcedure<V> procedure)
Executes procedure for each key/value entry in the map. |
|
boolean |
forEachKey(TDoubleProcedure procedure)
Executes procedure for each key in the map. |
|
boolean |
forEachValue(TObjectProcedure<V> procedure)
Executes procedure for each value in the map. |
|
V |
get(double key)
retrieves the value for key |
|
java.lang.Object[] |
getValues()
Returns the values of the map. |
|
|
getValues(T[] a)
Return the values of the map; the runtime type of the returned array is that of the specified array. |
|
int |
hashCode()
|
|
TDoubleObjectIterator<V> |
iterator()
|
|
double[] |
keys()
returns the keys of the map. |
|
double[] |
keys(double[] a)
returns the keys of the map. |
|
V |
put(double key,
V value)
Inserts a key/value pair into the map. |
|
void |
putAll(TDoubleObjectHashMap<V> map)
Put all the entries from the given map into this map. |
|
V |
putIfAbsent(double key,
V 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. |
|
V |
remove(double key)
Deletes a key/value pair from the map. |
|
protected void |
removeAt(int index)
removes the mapping at index from the map. |
|
boolean |
retainEntries(TDoubleObjectProcedure<V> 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(TObjectFunction<V,V> function)
Transform the values in this map using function. |
|
void |
writeExternal(java.io.ObjectOutput out)
|
Methods inherited from class org.elasticsearch.util.gnu.trove.TDoubleHash |
---|
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 V[] _values
Constructor Detail |
---|
public TDoubleObjectHashMap()
TDoubleObjectHashMap
instance with the default
capacity and load factor.
public TDoubleObjectHashMap(int initialCapacity)
TDoubleObjectHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity
- an int
valuepublic TDoubleObjectHashMap(int initialCapacity, float loadFactor)
TDoubleObjectHashMap
instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
initialCapacity
- an int
valueloadFactor
- a float
valuepublic TDoubleObjectHashMap(TDoubleHashingStrategy strategy)
TDoubleObjectHashMap
instance with the default
capacity and load factor.
strategy
- used to compute hash codes and to compare keys.public TDoubleObjectHashMap(int initialCapacity, TDoubleHashingStrategy strategy)
TDoubleObjectHashMap
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 TDoubleObjectHashMap(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
TDoubleObjectHashMap
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 TDoubleObjectHashMap<V> clone()
clone
in class TDoubleHash
public TDoubleObjectIterator<V> iterator()
protected int setUp(int initialCapacity)
setUp
in class TDoubleHash
initialCapacity
- an int
value
public V put(double key, V value)
key
- an double
valuevalue
- an Object
value
null
if none was found.public V putIfAbsent(double key, V value)
key
- an double
valuevalue
- an Object
value
null
if none was found.public void putAll(TDoubleObjectHashMap<V> 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 V get(double key)
key
- an double
value
public void clear()
clear
in class THash
public V remove(double key)
key
- an double
value
Object
value or (double)0 if no such mapping exists.public 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 TDoubleHash
index
- an int
valuepublic java.lang.Object[] getValues()
Collection
valuegetValues(Object[])
public <T> T[] getValues(T[] a)
a
- the array into which the elements of this collection are to be
stored, if it is big enough; otherwise, a new array of the same
runtime type is allocated for this purpose.
java.lang.ArrayStoreException
- the runtime type of the specified array is
not a supertype of the runtime type of every element in this
collection.
java.lang.NullPointerException
- if the specified array is null.getValues()
public double[] keys()
Set
valuepublic double[] keys(double[] 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(V val)
val
- an Object
value
boolean
valuepublic boolean containsKey(double key)
key
- an double
value
boolean
valuepublic boolean forEachKey(TDoubleProcedure procedure)
procedure
- a TDoubleProcedure
value
public boolean forEachValue(TObjectProcedure<V> procedure)
procedure
- a TObjectProcedure
value
public boolean forEachEntry(TDoubleObjectProcedure<V> procedure)
procedure
- a TODoubleObjectProcedure
value
public boolean retainEntries(TDoubleObjectProcedure<V> procedure)
procedure
- determines which entries to keep
public void transformValues(TObjectFunction<V,V> function)
function
- a TObjectFunction
valuepublic 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 |