|
GNU Trove | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectgnu.trove.THash
gnu.trove.TPrimitiveHash
gnu.trove.TByteHash
public abstract class TByteHash
An open addressed hashing implementation for byte primitives. Created: Sun Nov 4 08:56:06 2001
| Field Summary | |
|---|---|
protected TByteHashingStrategy |
_hashingStrategy
strategy used to hash values in this collection |
protected byte[] |
_set
the set of bytes |
| Fields inherited from class gnu.trove.TPrimitiveHash |
|---|
_states, FREE, FULL, REMOVED |
| Fields inherited from class gnu.trove.THash |
|---|
_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR |
| Constructor Summary | |
|---|---|
TByteHash()
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,
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. |
|
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(TByteHashingStrategy strategy)
Creates a new TByteHash instance with the default
capacity and load factor. |
|
| Method Summary | |
|---|---|
java.lang.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. |
| Methods inherited from class gnu.trove.TPrimitiveHash |
|---|
capacity |
| Methods inherited from class gnu.trove.THash |
|---|
calculateGrownCapacity, clear, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, readExternal, reenableAutoCompaction, rehash, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize, writeExternal |
| Methods inherited from class java.lang.Object |
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
protected transient byte[] _set
protected TByteHashingStrategy _hashingStrategy
| Constructor Detail |
|---|
public TByteHash()
TByteHash instance with the default
capacity and load factor.
public TByteHash(int initialCapacity)
TByteHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.
initialCapacity - an int value
public TByteHash(int initialCapacity,
float loadFactor)
TByteHash 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.public TByteHash(TByteHashingStrategy strategy)
TByteHash instance with the default
capacity and load factor.
strategy - used to compute hash codes and to compare keys.
public TByteHash(int initialCapacity,
TByteHashingStrategy strategy)
TByteHash 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.
public TByteHash(int initialCapacity,
float loadFactor,
TByteHashingStrategy strategy)
TByteHash 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.| Method Detail |
|---|
public java.lang.Object clone()
clone in class TPrimitiveHashprotected int setUp(int initialCapacity)
setUp in class TPrimitiveHashinitialCapacity - an int value
public boolean contains(byte val)
val - an byte value
boolean valuepublic boolean forEach(TByteProcedure procedure)
procedure - a TObjectProcedure value
protected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(byte val)
val - an byte value
protected int insertionIndex(byte val)
val - an byte value
int valuepublic final int computeHashCode(byte val)
computeHashCode in interface TByteHashingStrategyval - the value to hash
|
GNU Trove | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||