gnu.trove
public abstract class TDoubleHash extends TPrimitiveHash implements Serializable, TDoubleHashingStrategy
Version: $Id: TDoubleHash.java,v 1.13 2003/03/19 04:17:03 ericdf Exp $
Field Summary | |
---|---|
protected TDoubleHashingStrategy | _hashingStrategy strategy used to hash values in this collection |
protected double[] | _set the set of doubles |
Constructor Summary | |
---|---|
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(TDoubleHashingStrategy strategy)
Creates a new TDoubleHash instance with the default
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(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
Creates a new TDoubleHash instance with a prime
value at or near the specified capacity and load factor.
|
Method Summary | |
---|---|
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. if
there is already a value equal()ing val in the set,
returns that value as a negative integer.
|
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.
|
TDoubleHash
instance with the default
capacity and load factor.TDoubleHash
instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.
Parameters: initialCapacity an int
value
TDoubleHash
instance with a prime
value at or near the specified capacity and load factor.
Parameters: initialCapacity used to find a prime capacity for the table. loadFactor used to calculate the threshold over which rehashing takes place.
TDoubleHash
instance with the default
capacity and load factor.Parameters: strategy used to compute hash codes and to compare keys.
TDoubleHash
instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.
Parameters: initialCapacity an int
value strategy used to compute hash codes and to compare keys.
TDoubleHash
instance with a prime
value at or near the specified capacity and load factor.
Parameters: 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.
Returns: a deep clone of this collection
Parameters: the value to hash
Returns: the hashcode.
Parameters: val an double
value
Returns: a boolean
value
Parameters: procedure a TObjectProcedure
value
Returns: false if the loop over the set terminated because the procedure returned false for some value.
Parameters: val an double
value
Returns: the index of val or -1 if it isn't in the set.
Parameters: val an double
value
Returns: an int
value
Parameters: index an int
value
Parameters: initialCapacity an int
value
Returns: the actual capacity chosen