public abstract class TIntHash extends TPrimitiveHash implements TIntHashingStrategy
| Modifier and Type | Field and Description |
|---|---|
protected TIntHashingStrategy |
_hashingStrategy
strategy used to hash values in this collection
|
protected int[] |
_set
the set of ints
|
_states, FREE, FULL, REMOVED_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR| Constructor and Description |
|---|
TIntHash()
Creates a new
TIntHash instance with the default
capacity and load factor. |
TIntHash(int initialCapacity)
Creates a new
TIntHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TIntHash(int initialCapacity,
float loadFactor)
Creates a new
TIntHash instance with a prime
value at or near the specified capacity and load factor. |
TIntHash(int initialCapacity,
float loadFactor,
TIntHashingStrategy strategy)
Creates a new
TIntHash instance with a prime
value at or near the specified capacity and load factor. |
TIntHash(int initialCapacity,
TIntHashingStrategy strategy)
Creates a new
TIntHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
TIntHash(TIntHashingStrategy strategy)
Creates a new
TIntHash instance with the default
capacity and load factor. |
| Modifier and Type | Method and Description |
|---|---|
java.lang.Object |
clone() |
int |
computeHashCode(int val)
Default implementation of TIntHashingStrategy:
delegates hashing to HashFunctions.hash(int).
|
boolean |
contains(int val)
Searches the set for val
|
boolean |
forEach(TIntProcedure procedure)
Executes procedure for each element in the set.
|
protected int |
index(int val)
Locates the index of val.
|
protected int |
insertionIndex(int 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.
|
capacitycalculateGrownCapacity, clear, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, readExternal, reenableAutoCompaction, rehash, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize, writeExternalprotected transient int[] _set
protected TIntHashingStrategy _hashingStrategy
public TIntHash()
TIntHash instance with the default
capacity and load factor.public TIntHash(int initialCapacity)
TIntHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime.initialCapacity - an int valuepublic TIntHash(int initialCapacity,
float loadFactor)
TIntHash 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 TIntHash(TIntHashingStrategy strategy)
TIntHash instance with the default
capacity and load factor.strategy - used to compute hash codes and to compare keys.public TIntHash(int initialCapacity,
TIntHashingStrategy strategy)
TIntHash 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 TIntHash(int initialCapacity,
float loadFactor,
TIntHashingStrategy strategy)
TIntHash 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(int val)
val - an int valueboolean valuepublic boolean forEach(TIntProcedure procedure)
procedure - a TObjectProcedure valueprotected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(int val)
val - an int valueprotected int insertionIndex(int val)
val - an int valueint valuepublic final int computeHashCode(int val)
computeHashCode in interface TIntHashingStrategyval - the value to hashGNU Trove is copyright © 2001-2009 Eric D. Friedman. All Rights Reserved.