Package gnu.trove
Class TLongHash
java.lang.Object
gnu.trove.THash
gnu.trove.TPrimitiveHash
gnu.trove.TLongHash
- All Implemented Interfaces:
TLongHashingStrategy
,Externalizable
,Serializable
,Cloneable
- Direct Known Subclasses:
TLongByteHashMap
,TLongDoubleHashMap
,TLongFloatHashMap
,TLongHashSet
,TLongIntHashMap
,TLongLongHashMap
,TLongObjectHashMap
,TLongShortHashMap
An open addressed hashing implementation for long primitives.
Created: Sun Nov 4 08:56:06 2001
- Version:
- $Id: PHash.template,v 1.2 2007/06/29 22:39:46 robeden Exp $
- Author:
- Eric D. Friedman
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionprotected TLongHashingStrategy
strategy used to hash values in this collectionprotected long[]
the set of longsFields 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
ConstructorsConstructorDescriptionCreates a newTLongHash
instance with the default capacity and load factor.TLongHash
(int initialCapacity) Creates a newTLongHash
instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.TLongHash
(int initialCapacity, float loadFactor) Creates a newTLongHash
instance with a prime value at or near the specified capacity and load factor.TLongHash
(int initialCapacity, float loadFactor, TLongHashingStrategy strategy) Creates a newTLongHash
instance with a prime value at or near the specified capacity and load factor.TLongHash
(int initialCapacity, TLongHashingStrategy strategy) Creates a newTLongHash
instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.TLongHash
(TLongHashingStrategy strategy) Creates a newTLongHash
instance with the default capacity and load factor. -
Method Summary
Modifier and TypeMethodDescriptionclone()
final int
computeHashCode
(long val) Default implementation of TLongHashingStrategy: delegates hashing to HashFunctions.hash(long).boolean
contains
(long val) Searches the set for valboolean
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
-
Field Details
-
_set
protected transient long[] _setthe set of longs -
_hashingStrategy
strategy used to hash values in this collection
-
-
Constructor Details
-
TLongHash
public TLongHash()Creates a newTLongHash
instance with the default capacity and load factor. -
TLongHash
public TLongHash(int initialCapacity) Creates a newTLongHash
instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.- Parameters:
initialCapacity
- anint
value
-
TLongHash
public TLongHash(int initialCapacity, float loadFactor) Creates a newTLongHash
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.
-
TLongHash
Creates a newTLongHash
instance with the default capacity and load factor.- Parameters:
strategy
- used to compute hash codes and to compare keys.
-
TLongHash
Creates a newTLongHash
instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.- Parameters:
initialCapacity
- anint
valuestrategy
- used to compute hash codes and to compare keys.
-
TLongHash
Creates a newTLongHash
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.strategy
- used to compute hash codes and to compare keys.
-
-
Method Details
-
clone
- Overrides:
clone
in classTPrimitiveHash
- Returns:
- a deep clone of this collection
-
setUp
protected int setUp(int initialCapacity) initializes the hashtable to a prime capacity which is at least initialCapacity + 1.- Overrides:
setUp
in classTPrimitiveHash
- Parameters:
initialCapacity
- anint
value- Returns:
- the actual capacity chosen
-
contains
public boolean contains(long val) Searches the set for val- Parameters:
val
- anlong
value- Returns:
- a
boolean
value
-
forEach
Executes procedure for each element in the set.- Parameters:
procedure
- aTObjectProcedure
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 classTPrimitiveHash
- Parameters:
index
- anint
value
-
index
protected int index(long val) Locates the index of val.- Parameters:
val
- anlong
value- Returns:
- the index of val or -1 if it isn't in the set.
-
insertionIndex
protected int insertionIndex(long 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
- anlong
value- Returns:
- an
int
value
-
computeHashCode
public final int computeHashCode(long val) Default implementation of TLongHashingStrategy: delegates hashing to HashFunctions.hash(long).- Specified by:
computeHashCode
in interfaceTLongHashingStrategy
- Parameters:
val
- the value to hash- Returns:
- the hashcode.
-