gnu.trove
Class TLongHash
- TLongHashingStrategy
public abstract class TLongHash
extends TPrimitiveHash
implements TLongHashingStrategy
An open addressed hashing implementation for long primitives.
Created: Sun Nov 4 08:56:06 2001
$Id: PHash.template,v 1.2 2007/06/29 22:39:46 robeden Exp $protected TLongHashingStrategy | _hashingStrategy- strategy used to hash values in this collection
|
protected long[] | _set- the set of longs
|
TLongHash()- Creates a new
TLongHash instance with the default
capacity and load factor.
|
TLongHash(TLongHashingStrategy strategy)- 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, 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)- Creates a new
TLongHash instance with a prime
value at or near the specified capacity and load factor.
|
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.
|
Object | clone()
|
int | computeHashCode(long val)- Default implementation of TLongHashingStrategy:
delegates hashing to HashFunctions.hash(long).
|
boolean | contains(long val)- Searches the set for val
|
boolean | forEach(TLongProcedure procedure)- Executes procedure for each element in the set.
|
protected int | index(long val)- Locates the index of val.
|
protected int | insertionIndex(long 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.
|
_hashingStrategy
protected TLongHashingStrategy _hashingStrategy
strategy used to hash values in this collection
_set
protected long[] _set
the set of longs
TLongHash
public TLongHash()
Creates a new TLongHash instance with the default
capacity and load factor.
TLongHash
public TLongHash(TLongHashingStrategy strategy)
Creates a new TLongHash instance with the default
capacity and load factor.
strategy - used to compute hash codes and to compare keys.
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.
initialCapacity - an int value
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.
initialCapacity - an int valuestrategy - used to compute hash codes and to compare keys.
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.
initialCapacity - used to find a prime capacity for the table.loadFactor - used to calculate the threshold over which
rehashing takes place.
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.
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.
clone
public Object clone()
- a deep clone of this collection
computeHashCode
public final int computeHashCode(long val)
Default implementation of TLongHashingStrategy:
delegates hashing to HashFunctions.hash(long).
contains
public boolean contains(long val)
Searches the set for val
forEach
public boolean forEach(TLongProcedure procedure)
Executes procedure for each element in the set.
procedure - a TObjectProcedure value
- 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.
- 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.
removeAt
protected void removeAt(int index)
Releases the element currently stored at index.
setUp
protected int setUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least
initialCapacity + 1.
initialCapacity - an int value
- the actual capacity chosen
GNU Trove is copyright B) 2001-2008 Eric D. Friedman. All Rights Reserved.