|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--gnu.trove.THash | +--gnu.trove.TPrimitiveHash | +--gnu.trove.TIntHash
An open addressed hashing implementation for int primitives. Created: Sun Nov 4 08:56:06 2001
Field Summary | |
protected TIntHashingStrategy |
_hashingStrategy
strategy used to hash values in this collection |
protected int[] |
_set
the set of ints |
Fields inherited from class gnu.trove.TPrimitiveHash |
_states, FREE, FULL, REMOVED |
Fields inherited from class gnu.trove.THash |
_free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR |
Constructor Summary | |
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. |
Method Summary | |
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. |
Methods inherited from class gnu.trove.TPrimitiveHash |
capacity |
Methods inherited from class gnu.trove.THash |
clear, compact, ensureCapacity, isEmpty, postInsertHook, rehash, size, trimToSize |
Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
protected transient int[] _set
protected TIntHashingStrategy _hashingStrategy
Constructor Detail |
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.Method Detail |
public java.lang.Object clone()
clone
in class TPrimitiveHash
protected int setUp(int initialCapacity)
setUp
in class TPrimitiveHash
initialCapacity
- an int
value
public boolean contains(int val)
val
- an int
value
boolean
valuepublic boolean forEach(TIntProcedure procedure)
procedure
- a TObjectProcedure
value
protected void removeAt(int index)
removeAt
in class TPrimitiveHash
index
- an int
valueprotected int index(int val)
val
- an int
value
protected int insertionIndex(int val)
val
- an int
value
int
valuepublic final int computeHashCode(int val)
computeHashCode
in interface TIntHashingStrategy
|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |