gnu.trove.impl.hash

Class TShortHash

java.lang.Object

gnu.trove.impl.hash.THash

gnu.trove.impl.hash.TPrimitiveHash

gnu.trove.impl.hash.TShortHash

All Implemented Interfaces:

java.io.Externalizable, java.io.Serializable

Direct Known Subclasses:

TShortHashSet, TShortObjectHashMap

public abstract class TShortHash
extends TPrimitiveHash

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

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
short[]	_set the set of shorts
protected boolean	consumeFreeSlot
protected short	no_entry_value value that represents null NOTE: should not be modified after the Hash is created, but is not final because of Externalization

Fields inherited from class gnu.trove.impl.hash.TPrimitiveHash

_states, FREE, FULL, REMOVED

Fields inherited from class gnu.trove.impl.hash.THash

_autoCompactionFactor, _autoCompactRemovesRemaining, _autoCompactTemporaryDisable, _free, _loadFactor, _maxSize, _size, DEFAULT_CAPACITY, DEFAULT_LOAD_FACTOR

Constructor Summary

Constructors

Constructor and Description
TShortHash() 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, 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, short no_entry_value) Creates a new TShortHash instance with a prime value at or near the specified capacity and load factor.

Method Summary

Modifier and Type	Method and Description
boolean	contains(short val) Searches the set for val
boolean	forEach(TShortProcedure procedure) Executes procedure for each element in the set.
short	getNoEntryValue() Returns the value that is used to represent null.
protected int	index(short val) Locates the index of val.
protected int	insertKey(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.

Methods inherited from class gnu.trove.impl.hash.TPrimitiveHash

capacity

Methods inherited from class gnu.trove.impl.hash.THash

calculateGrownCapacity, clear, compact, computeMaxSize, computeNextAutoCompactionAmount, ensureCapacity, fastCeil, getAutoCompactionFactor, isEmpty, postInsertHook, readExternal, reenableAutoCompaction, rehash, saturatedCast, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize, writeExternal

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

_set

public transient short[] _set

the set of shorts

no_entry_value

protected short no_entry_value

value that represents null NOTE: should not be modified after the Hash is created, but is not final because of Externalization

consumeFreeSlot

protected boolean consumeFreeSlot

Constructor Detail

TShortHash

public TShortHash()

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

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,
                  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,
                  short no_entry_value)

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.

no_entry_value - value that represents null

Method Detail

getNoEntryValue

public short getNoEntryValue()

Returns the value that is used to represent null. The default value is generally zero, but can be changed during construction of the collection.

Returns:

the value that represents null

setUp

protected int setUp(int initialCapacity)

initializes the hashtable to a prime capacity which is at least initialCapacity + 1.

Overrides:

setUp in class TPrimitiveHash

Parameters:

initialCapacity - an int value

Returns:

the actual capacity chosen

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.

removeAt

protected void removeAt(int index)

Releases the element currently stored at index.

Overrides:

removeAt in class TPrimitiveHash

Parameters:

index - an int 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.

insertKey

protected int insertKey(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