TLongHashingStrategy, java.io.SerializableTLongByteHashMap, TLongDoubleHashMap, TLongFloatHashMap, TLongHashSet, TLongIntHashMap, TLongLongHashMap, TLongObjectHashMap, TLongShortHashMappublic abstract class TLongHash extends TPrimitiveHash implements TLongHashingStrategy
| Modifier and Type | Field | Description |
|---|---|---|
protected TLongHashingStrategy |
_hashingStrategy |
strategy used to hash values in this collection
|
protected long[] |
_set |
the set of longs
|
_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR_states, FREE, FULL, REMOVED| Constructor | Description |
|---|---|
TLongHash() |
Creates a new
TLongHash instance with the default
capacity and load factor. |
TLongHash(int initialCapacity) |
Creates a new
TLongHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TLongHash(int initialCapacity,
float loadFactor) |
Creates a new
TLongHash instance with a prime
value at or near the specified capacity and load factor. |
TLongHash(int initialCapacity,
float loadFactor,
TLongHashingStrategy strategy) |
Creates a new
TLongHash instance with a prime
value at or near the specified capacity and load factor. |
TLongHash(int initialCapacity,
TLongHashingStrategy strategy) |
Creates a new
TLongHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TLongHash(TLongHashingStrategy strategy) |
Creates a new
TLongHash instance with the default
capacity and load factor. |
| Modifier and Type | Method | Description |
|---|---|---|
java.lang.Object |
clone() |
|
int |
computeHashCode(long val) |
Default implementation of TLongHashingStrategy:
delegates hashing to HashFunctions.hash(long).
|
boolean |
contains(long val) |
Searches the set for val
|
boolean |
forEach(TLongProcedure procedure) |
Executes procedure for each element in the set.
|
protected int |
index(long val) |
Locates the index of val.
|
protected int |
insertionIndex(long 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 long[] _set
protected TLongHashingStrategy _hashingStrategy
public TLongHash()
TLongHash instance with the default
capacity and load factor.public TLongHash(int initialCapacity)
TLongHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.initialCapacity - an int valuepublic TLongHash(int initialCapacity,
float loadFactor)
TLongHash 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 TLongHash(TLongHashingStrategy strategy)
TLongHash instance with the default
capacity and load factor.strategy - used to compute hash codes and to compare keys.public TLongHash(int initialCapacity,
TLongHashingStrategy strategy)
TLongHash 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 TLongHash(int initialCapacity,
float loadFactor,
TLongHashingStrategy strategy)
TLongHash 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(long val)
val - an long valueboolean valuepublic boolean forEach(TLongProcedure procedure)
procedure - a TObjectProcedure valueprotected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(long val)
val - an long valueprotected int insertionIndex(long val)
val - an long valueint valuepublic final int computeHashCode(long val)
computeHashCode in interface TLongHashingStrategyval - the value to hashGNU Trove is copyright ? 2001-2009 Eric D. Friedman. All Rights Reserved.