gnu.trove

Class TLongHash

public abstract class TLongHash extends TPrimitiveHash implements Serializable, TLongHashingStrategy

An open addressed hashing implementation for long primitives. Created: Sun Nov 4 08:56:06 2001

Version: $Id: TLongHash.java,v 1.13 2003/03/19 04:17:04 ericdf Exp $

Author: Eric D. Friedman

Field Summary
protected TLongHashingStrategy_hashingStrategy
strategy used to hash values in this collection
protected long[]_set
the set of longs
Constructor Summary
TLongHash()
Creates a new TLongHash instance with the default capacity and load factor.
TLongHash(int initialCapacity)
Creates a new TLongHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TLongHash(int initialCapacity, float loadFactor)
Creates a new TLongHash instance with a prime value at or near the specified capacity and load factor.
TLongHash(TLongHashingStrategy strategy)
Creates a new TLongHash instance with the default capacity and load factor.
TLongHash(int initialCapacity, TLongHashingStrategy strategy)
Creates a new TLongHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TLongHash(int initialCapacity, float loadFactor, TLongHashingStrategy strategy)
Creates a new TLongHash instance with a prime value at or near the specified capacity and load factor.
Method Summary
Objectclone()
intcomputeHashCode(long val)
Default implementation of TLongHashingStrategy: delegates hashing to HashFunctions.hash(long).
booleancontains(long val)
Searches the set for val
booleanforEach(TLongProcedure procedure)
Executes procedure for each element in the set.
protected intindex(long val)
Locates the index of val.
protected intinsertionIndex(long 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 voidremoveAt(int index)
Releases the element currently stored at index.
protected intsetUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least initialCapacity + 1.

Field Detail

_hashingStrategy

protected TLongHashingStrategy _hashingStrategy
strategy used to hash values in this collection

_set

protected transient long[] _set
the set of longs

Constructor Detail

TLongHash

public TLongHash()
Creates a new TLongHash instance with the default capacity and load factor.

TLongHash

public TLongHash(int initialCapacity)
Creates a new TLongHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.

Parameters: initialCapacity an int value

TLongHash

public TLongHash(int initialCapacity, float loadFactor)
Creates a new TLongHash 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.

TLongHash

public TLongHash(TLongHashingStrategy strategy)
Creates a new TLongHash instance with the default capacity and load factor.

Parameters: strategy used to compute hash codes and to compare keys.

TLongHash

public TLongHash(int initialCapacity, TLongHashingStrategy strategy)
Creates a new TLongHash 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.

TLongHash

public TLongHash(int initialCapacity, float loadFactor, TLongHashingStrategy strategy)
Creates a new TLongHash 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.

Method Detail

clone

public Object clone()

Returns: a deep clone of this collection

computeHashCode

public final int computeHashCode(long val)
Default implementation of TLongHashingStrategy: delegates hashing to HashFunctions.hash(long).

Parameters: the value to hash

Returns: the hashcode.

contains

public boolean contains(long val)
Searches the set for val

Parameters: val an long value

Returns: a boolean value

forEach

public boolean forEach(TLongProcedure procedure)
Executes procedure for each element in the set.

Parameters: procedure a TObjectProcedure value

Returns: false if the loop over the set terminated because the procedure returned false for some value.

index

protected int index(long val)
Locates the index of val.

Parameters: val an long value

Returns: the index of val or -1 if it isn't in the set.

insertionIndex

protected int insertionIndex(long 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.

Parameters: val an long value

Returns: an int value

removeAt

protected void removeAt(int index)
Releases the element currently stored at index.

Parameters: index an int value

setUp

protected int setUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least initialCapacity + 1.

Parameters: initialCapacity an int value

Returns: the actual capacity chosen