|
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.TLongHash
public abstract class TLongHash
An open addressed hashing implementation for long primitives. Created: Sun Nov 4 08:56:06 2001
| Field Summary | |
|---|---|
protected TLongHashingStrategy |
_hashingStrategy
strategy used to hash values in this collection |
protected long[] |
_set
the set of longs |
| 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 | |
|---|---|
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. |
|
| Method Summary | |
|---|---|
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. |
| 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 long[] _set
protected TLongHashingStrategy _hashingStrategy
| Constructor Detail |
|---|
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 value
public 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.| 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(long val)
val - an long value
boolean valuepublic boolean forEach(TLongProcedure procedure)
procedure - a TObjectProcedure value
protected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(long val)
val - an long value
protected int insertionIndex(long val)
val - an long value
int valuepublic final int computeHashCode(long val)
computeHashCode in interface TLongHashingStrategyval - the value to hash
|
GNU Trove | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||