gnu.trove

Class TByteHash

Implemented Interfaces:
TByteHashingStrategy

public abstract class TByteHash
extends TPrimitiveHash
implements TByteHashingStrategy

An open addressed hashing implementation for byte primitives. Created: Sun Nov 4 08:56:06 2001
Version:
$Id: PHash.template,v 1.2 2007/06/29 22:39:46 robeden Exp $
Author:
Eric D. Friedman

Field Summary

protected TByteHashingStrategy
_hashingStrategy
strategy used to hash values in this collection
protected byte[]
_set
the set of bytes

Constructor Summary

TByteHash()
Creates a new TByteHash instance with the default capacity and load factor.
TByteHash(TByteHashingStrategy strategy)
Creates a new TByteHash instance with the default capacity and load factor.
TByteHash(int initialCapacity)
Creates a new TByteHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TByteHash(int initialCapacity, TByteHashingStrategy strategy)
Creates a new TByteHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TByteHash(int initialCapacity, float loadFactor)
Creates a new TByteHash instance with a prime value at or near the specified capacity and load factor.
TByteHash(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)
Creates a new TByteHash instance with a prime value at or near the specified capacity and load factor.

Method Summary

Object
clone()
int
computeHashCode(byte val)
Default implementation of TByteHashingStrategy: delegates hashing to HashFunctions.hash(byte).
boolean
contains(byte val)
Searches the set for val
boolean
forEach(TByteProcedure procedure)
Executes procedure for each element in the set.
protected int
index(byte val)
Locates the index of val.
protected int
insertionIndex(byte 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.

Field Details

_hashingStrategy

protected TByteHashingStrategy _hashingStrategy
strategy used to hash values in this collection

_set

protected byte[] _set
the set of bytes

Constructor Details

TByteHash

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

TByteHash

public TByteHash(TByteHashingStrategy strategy)
Creates a new TByteHash instance with the default capacity and load factor.
Parameters:
strategy - used to compute hash codes and to compare keys.

TByteHash

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

TByteHash

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

TByteHash

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

TByteHash

public TByteHash(int initialCapacity,
                 float loadFactor,
                 TByteHashingStrategy strategy)
Creates a new TByteHash 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 Details

clone

public Object clone()
Returns:
a deep clone of this collection

computeHashCode

public final int computeHashCode(byte val)
Default implementation of TByteHashingStrategy: delegates hashing to HashFunctions.hash(byte).
Parameters:
val - the value to hash
Returns:
the hashcode.

contains

public boolean contains(byte val)
Searches the set for val
Parameters:
val - an byte value
Returns:
a boolean value

forEach

public boolean forEach(TByteProcedure 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(byte val)
Locates the index of val.
Parameters:
val - an byte value
Returns:
the index of val or -1 if it isn't in the set.

insertionIndex

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

GNU Trove is copyright B) 2001-2008 Eric D. Friedman. All Rights Reserved.