gnu.trove

Class TShortHash

Implemented Interfaces:
TShortHashingStrategy

public abstract class TShortHash
extends TPrimitiveHash
implements TShortHashingStrategy

An open addressed hashing implementation for short 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 TShortHashingStrategy
_hashingStrategy
strategy used to hash values in this collection
protected short[]
_set
the set of shorts

Constructor Summary

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

Method Summary

Object
clone()
int
computeHashCode(short val)
Default implementation of TShortHashingStrategy: delegates hashing to HashFunctions.hash(short).
boolean
contains(short val)
Searches the set for val
boolean
forEach(TShortProcedure procedure)
Executes procedure for each element in the set.
protected int
index(short val)
Locates the index of val.
protected int
insertionIndex(short 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 TShortHashingStrategy _hashingStrategy
strategy used to hash values in this collection

_set

protected short[] _set
the set of shorts

Constructor Details

TShortHash

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

TShortHash

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

TShortHash

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

TShortHash

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

TShortHash

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

TShortHash

public TShortHash(int initialCapacity,
                  float loadFactor,
                  TShortHashingStrategy strategy)
Creates a new TShortHash 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(short val)
Default implementation of TShortHashingStrategy: delegates hashing to HashFunctions.hash(short).
Parameters:
val - the value to hash
Returns:
the hashcode.

contains

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

forEach

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

insertionIndex

protected int insertionIndex(short 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 short 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-2007 Eric D. Friedman. All Rights Reserved.