public abstract class TDoubleHash extends TPrimitiveHash implements java.io.Serializable, TDoubleHashingStrategy
| Modifier and Type | Field and Description |
|---|---|
protected TDoubleHashingStrategy |
_hashingStrategy
strategy used to hash values in this collection
|
protected double[] |
_set
the set of doubles
|
_states, FREE, FULL, REMOVED_free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR| Constructor and Description |
|---|
TDoubleHash()
Creates a new
TDoubleHash instance with the default
capacity and load factor. |
TDoubleHash(int initialCapacity)
Creates a new
TDoubleHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TDoubleHash(int initialCapacity,
float loadFactor)
Creates a new
TDoubleHash instance with a prime
value at or near the specified capacity and load factor. |
TDoubleHash(int initialCapacity,
float loadFactor,
TDoubleHashingStrategy strategy)
Creates a new
TDoubleHash instance with a prime
value at or near the specified capacity and load factor. |
TDoubleHash(int initialCapacity,
TDoubleHashingStrategy strategy)
Creates a new
TDoubleHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TDoubleHash(TDoubleHashingStrategy strategy)
Creates a new
TDoubleHash instance with the default
capacity and load factor. |
| Modifier and Type | Method and Description |
|---|---|
java.lang.Object |
clone() |
int |
computeHashCode(double val)
Default implementation of TDoubleHashingStrategy:
delegates hashing to HashFunctions.hash(double).
|
boolean |
contains(double val)
Searches the set for val
|
boolean |
forEach(TDoubleProcedure procedure)
Executes procedure for each element in the set.
|
protected int |
index(double val)
Locates the index of val.
|
protected int |
insertionIndex(double val)
Locates the index at which val can be inserted.
|
protected void |
removeAt(int index)
Releases the element currently stored at index.
|
protected int |
setUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least
initialCapacity + 1.
|
capacityclear, compact, ensureCapacity, isEmpty, postInsertHook, rehash, size, trimToSizeprotected transient double[] _set
protected TDoubleHashingStrategy _hashingStrategy
public TDoubleHash()
TDoubleHash instance with the default
capacity and load factor.public TDoubleHash(int initialCapacity)
TDoubleHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.initialCapacity - an int valuepublic TDoubleHash(int initialCapacity,
float loadFactor)
TDoubleHash 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.public TDoubleHash(TDoubleHashingStrategy strategy)
TDoubleHash instance with the default
capacity and load factor.strategy - used to compute hash codes and to compare keys.public TDoubleHash(int initialCapacity,
TDoubleHashingStrategy strategy)
TDoubleHash 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 TDoubleHash(int initialCapacity,
float loadFactor,
TDoubleHashingStrategy strategy)
TDoubleHash 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 java.lang.Object clone()
clone in class TPrimitiveHashprotected int setUp(int initialCapacity)
setUp in class TPrimitiveHashinitialCapacity - an int valuepublic boolean contains(double val)
val - an double valueboolean valuepublic boolean forEach(TDoubleProcedure procedure)
procedure - a TObjectProcedure valueprotected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(double val)
val - an double valueprotected int insertionIndex(double val)
val - an double valueint valuepublic final int computeHashCode(double val)
computeHashCode in interface TDoubleHashingStrategythe - value to hash