gnu.trove
public abstract class TIntHash extends TPrimitiveHash implements Serializable, TIntHashingStrategy
Version: $Id: TIntHash.java,v 1.13 2003/03/19 04:17:04 ericdf Exp $
Field Summary | |
---|---|
protected TIntHashingStrategy | _hashingStrategy strategy used to hash values in this collection |
protected int[] | _set the set of ints |
Constructor Summary | |
---|---|
TIntHash()
Creates a new TIntHash instance with the default
capacity and load factor. | |
TIntHash(int initialCapacity)
Creates a new TIntHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.
| |
TIntHash(int initialCapacity, float loadFactor)
Creates a new TIntHash instance with a prime
value at or near the specified capacity and load factor.
| |
TIntHash(TIntHashingStrategy strategy)
Creates a new TIntHash instance with the default
capacity and load factor. | |
TIntHash(int initialCapacity, TIntHashingStrategy strategy)
Creates a new TIntHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.
| |
TIntHash(int initialCapacity, float loadFactor, TIntHashingStrategy strategy)
Creates a new TIntHash instance with a prime
value at or near the specified capacity and load factor.
|
Method Summary | |
---|---|
Object | clone() |
int | computeHashCode(int val)
Default implementation of TIntHashingStrategy:
delegates hashing to HashFunctions.hash(int).
|
boolean | contains(int val)
Searches the set for val
|
boolean | forEach(TIntProcedure procedure)
Executes procedure for each element in the set.
|
protected int | index(int val)
Locates the index of val.
|
protected int | insertionIndex(int 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.
|
TIntHash
instance with the default
capacity and load factor.TIntHash
instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.
Parameters: initialCapacity an int
value
TIntHash
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.
TIntHash
instance with the default
capacity and load factor.Parameters: strategy used to compute hash codes and to compare keys.
TIntHash
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.
TIntHash
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 int
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 int
value
Returns: the index of val or -1 if it isn't in the set.
Parameters: val an int
value
Returns: an int
value
Parameters: index an int
value
Parameters: initialCapacity an int
value
Returns: the actual capacity chosen