|
||||||||||
| 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.TLongDoubleHash
public abstract class TLongDoubleHash
An open addressed hashing implementation for long/double primitive entries. Created: Sun Nov 4 08:56:06 2001
| Field Summary | |
|---|---|
long[] |
_set
the set of longs |
protected long |
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 double |
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 | |
|---|---|
TLongDoubleHash()
Creates a new T#E#Hash instance with the default
capacity and load factor. |
|
TLongDoubleHash(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. |
|
TLongDoubleHash(int initialCapacity,
float loadFactor)
Creates a new TLongDoubleHash instance with a prime
value at or near the specified capacity and load factor. |
|
TLongDoubleHash(int initialCapacity,
float loadFactor,
long no_entry_key,
double no_entry_value)
Creates a new TLongDoubleHash instance with a prime
value at or near the specified capacity and load factor. |
|
| Method Summary | |
|---|---|
boolean |
contains(long val)
Searches the set for val |
boolean |
forEach(TLongProcedure procedure)
Executes procedure for each key in the map. |
long |
getNoEntryKey()
Returns the value that is used to represent null as a key. |
double |
getNoEntryValue()
Returns the value that is used to represent null. |
protected int |
index(long key)
Locates the index of val. |
protected int |
insertionIndex(long 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 long[] _set
protected long no_entry_key
protected double no_entry_value
| Constructor Detail |
|---|
public TLongDoubleHash()
T#E#Hash instance with the default
capacity and load factor.
public TLongDoubleHash(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 TLongDoubleHash(int initialCapacity,
float loadFactor)
TLongDoubleHash 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 TLongDoubleHash(int initialCapacity,
float loadFactor,
long no_entry_key,
double no_entry_value)
TLongDoubleHash 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 long getNoEntryKey()
public double getNoEntryValue()
protected 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 TLongProcedure value
protected void removeAt(int index)
removeAt in class TPrimitiveHashindex - an int valueprotected int index(long key)
key - an long value
protected int insertionIndex(long key)
key - an long value
int value
public void writeExternal(java.io.ObjectOutput out)
throws java.io.IOException
writeExternal in interface java.io.ExternalizablewriteExternal in class THashjava.io.IOException
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.ClassNotFoundException
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||