|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectgnu.trove.impl.hash.THash
gnu.trove.impl.hash.TPrimitiveHash
gnu.trove.impl.hash.TIntLongHash
public abstract class TIntLongHash
An open addressed hashing implementation for int/long primitive entries. Created: Sun Nov 4 08:56:06 2001
| Field Summary | |
|---|---|
int[] |
_set
the set of ints |
protected int |
no_entry_key
key that represents null NOTE: should not be modified after the Hash is created, but is not final because of Externalization |
protected long |
no_entry_value
value that represents null NOTE: should not be modified after the Hash is created, but is not final because of Externalization |
| Fields inherited from class gnu.trove.impl.hash.TPrimitiveHash |
|---|
_states, FREE, FULL, REMOVED |
| Fields inherited from class gnu.trove.impl.hash.THash |
|---|
_autoCompactionFactor, _autoCompactRemovesRemaining, _autoCompactTemporaryDisable, _free, _loadFactor, _maxSize, _size, DEFAULT_CAPACITY, DEFAULT_LOAD_FACTOR |
| Constructor Summary | |
|---|---|
TIntLongHash()
Creates a new T#E#Hash instance with the default capacity and
load factor. |
|
TIntLongHash(int initialCapacity)
Creates a new T#E#Hash instance whose capacity is the next
highest prime above initialCapacity + 1 unless that value is
already prime. |
|
TIntLongHash(int initialCapacity,
float loadFactor)
Creates a new TIntLongHash instance with a prime value at or
near the specified capacity and load factor. |
|
TIntLongHash(int initialCapacity,
float loadFactor,
int no_entry_key,
long no_entry_value)
Creates a new TIntLongHash instance with a prime value at or
near the specified capacity and load factor. |
|
| Method Summary | |
|---|---|
boolean |
contains(int val)
Searches the set for val |
boolean |
forEach(TIntProcedure procedure)
Executes procedure for each key in the map. |
int |
getNoEntryKey()
Returns the value that is used to represent null as a key. |
long |
getNoEntryValue()
Returns the value that is used to represent null. |
protected int |
index(int key)
Locates the index of val. |
protected int |
insertionIndex(int key)
Locates the index at which val can be inserted. |
void |
readExternal(java.io.ObjectInput in)
|
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. |
void |
writeExternal(java.io.ObjectOutput out)
|
| Methods inherited from class gnu.trove.impl.hash.TPrimitiveHash |
|---|
capacity |
| Methods inherited from class gnu.trove.impl.hash.THash |
|---|
calculateGrownCapacity, clear, compact, computeMaxSize, computeNextAutoCompactionAmount, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, rehash, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSize |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public transient int[] _set
protected int no_entry_key
protected long no_entry_value
| Constructor Detail |
|---|
public TIntLongHash()
T#E#Hash instance with the default capacity and
load factor.
public TIntLongHash(int initialCapacity)
T#E#Hash instance whose capacity is the next
highest prime above initialCapacity + 1 unless that value is
already prime.
initialCapacity - an int value
public TIntLongHash(int initialCapacity,
float loadFactor)
TIntLongHash 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 TIntLongHash(int initialCapacity,
float loadFactor,
int no_entry_key,
long no_entry_value)
TIntLongHash 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.no_entry_value - value that represents null| Method Detail |
|---|
public boolean contains(int val)
val - an int value
boolean valuepublic boolean forEach(TIntProcedure procedure)
procedure - a TIntProcedure value
public int getNoEntryKey()
public long getNoEntryValue()
protected int index(int key)
key - an int value
protected int insertionIndex(int key)
key - an int value
int value
public void readExternal(java.io.ObjectInput in)
throws java.io.IOException,
java.lang.ClassNotFoundException
readExternal in interface java.io.ExternalizablereadExternal in class THashjava.io.IOException
java.lang.ClassNotFoundExceptionprotected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int setUp(int initialCapacity)
setUp in class TPrimitiveHashinitialCapacity - an int value
public void writeExternal(java.io.ObjectOutput out)
throws java.io.IOException
writeExternal in interface java.io.ExternalizablewriteExternal in class THashjava.io.IOException
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||