TByteHashingStrategy, java.io.SerializableTByteByteHashMap, TByteDoubleHashMap, TByteFloatHashMap, TByteHashSet, TByteIntHashMap, TByteLongHashMap, TByteObjectHashMap, TByteShortHashMappublic abstract class TByteHash extends TPrimitiveHash implements TByteHashingStrategy
| Modifier and Type | Field | Description |
|---|---|---|
protected TByteHashingStrategy |
_hashingStrategy |
strategy used to hash values in this collection
|
protected byte[] |
_set |
the set of bytes
|
_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR_states, FREE, FULL, REMOVED| Constructor | Description |
|---|---|
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. |
| Modifier and Type | Method | Description |
|---|---|---|
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.
|
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitcalculateGrownCapacity, clear, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, readExternal, reenableAutoCompaction, rehash, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize, writeExternalcapacityprotected transient byte[] _set
protected TByteHashingStrategy _hashingStrategy
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 valuepublic 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.public java.lang.Object clone()
clone in class TPrimitiveHashprotected int setUp(int initialCapacity)
setUp in class TPrimitiveHashinitialCapacity - an int valuepublic boolean contains(byte val)
val - an byte valueboolean valuepublic boolean forEach(TByteProcedure procedure)
procedure - a TObjectProcedure valueprotected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(byte val)
val - an byte valueprotected int insertionIndex(byte val)
val - an byte valueint valuepublic final int computeHashCode(byte val)
computeHashCode in interface TByteHashingStrategyval - the value to hashGNU Trove is copyright ? 2001-2009 Eric D. Friedman. All Rights Reserved.