|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--gnu.trove.THash | +--gnu.trove.TPrimitiveHash | +--gnu.trove.TDoubleHash
An open addressed hashing implementation for double primitives. Created: Sun Nov 4 08:56:06 2001
Field Summary | |
protected TDoubleHashingStrategy |
_hashingStrategy
strategy used to hash values in this collection |
protected double[] |
_set
the set of doubles |
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 | |
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. |
Method Summary | |
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. |
Methods inherited from class gnu.trove.TPrimitiveHash |
capacity |
Methods inherited from class gnu.trove.THash |
clear, compact, ensureCapacity, isEmpty, postInsertHook, rehash, size, trimToSize |
Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
protected transient double[] _set
protected TDoubleHashingStrategy _hashingStrategy
Constructor Detail |
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.Method Detail |
public java.lang.Object clone()
clone
in class TPrimitiveHash
protected int setUp(int initialCapacity)
setUp
in class TPrimitiveHash
initialCapacity
- an int
value
public boolean contains(double val)
val
- an double
value
boolean
valuepublic boolean forEach(TDoubleProcedure procedure)
procedure
- a TObjectProcedure
value
protected void removeAt(int index)
removeAt
in class TPrimitiveHash
index
- an int
valueprotected int index(double val)
val
- an double
value
protected int insertionIndex(double val)
val
- an double
value
int
valuepublic final int computeHashCode(double val)
computeHashCode
in interface TDoubleHashingStrategy
|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |