|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgnu.trove.THash
gnu.trove.TPrimitiveHash
gnu.trove.TShortHash
gnu.trove.TShortHashSet
An open addressed set implementation for short primitives. Created: Sat Nov 3 10:38:17 2001
Field Summary |
Fields inherited from class gnu.trove.TShortHash |
_hashingStrategy, _set |
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 | |
TShortHashSet()
Creates a new TShortHashSet instance with the default
capacity and load factor. |
|
TShortHashSet(int initialCapacity)
Creates a new TShortHashSet instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor. |
|
TShortHashSet(int initialCapacity,
float loadFactor)
Creates a new TShortHashSet instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor. |
|
TShortHashSet(int initialCapacity,
float loadFactor,
TShortHashingStrategy strategy)
Creates a new TShortHash instance with a prime
value at or near the specified capacity and load factor. |
|
TShortHashSet(int initialCapacity,
TShortHashingStrategy strategy)
Creates a new TShortHash instance whose capacity
is the next highest prime above initialCapacity + 1
unless that value is already prime. |
|
TShortHashSet(short[] array)
Creates a new TShortHashSet instance containing the
elements of array. |
|
TShortHashSet(short[] array,
TShortHashingStrategy strategy)
Creates a new TShortHashSet instance containing the
elements of array. |
|
TShortHashSet(TShortHashingStrategy strategy)
Creates a new TShortHash instance with the default
capacity and load factor. |
Method Summary | |
boolean |
add(short val)
Inserts a value into the set. |
boolean |
addAll(short[] array)
Adds all of the elements in array to the set. |
void |
clear()
Empties the set. |
boolean |
containsAll(short[] array)
Tests the set to determine if all of the elements in array are present. |
boolean |
equals(java.lang.Object other)
Compares this set with another set for equality of their stored entries. |
int |
hashCode()
|
TShortIterator |
iterator()
|
protected void |
rehash(int newCapacity)
Expands the set to accomodate new values. |
boolean |
remove(short val)
Removes val from the set. |
boolean |
removeAll(short[] array)
Removes all of the elements in array from the set. |
boolean |
retainAll(short[] array)
Removes any values in the set which are not contained in array. |
short[] |
toArray()
Returns a new array containing the values in the set. |
Methods inherited from class gnu.trove.TShortHash |
clone, computeHashCode, contains, forEach, index, insertionIndex, removeAt, setUp |
Methods inherited from class gnu.trove.TPrimitiveHash |
capacity |
Methods inherited from class gnu.trove.THash |
compact, ensureCapacity, isEmpty, postInsertHook, size, trimToSize |
Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public TShortHashSet()
TShortHashSet
instance with the default
capacity and load factor.
public TShortHashSet(int initialCapacity)
TShortHashSet
instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity
- an int
valuepublic TShortHashSet(int initialCapacity, float loadFactor)
TShortHashSet
instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
initialCapacity
- an int
valueloadFactor
- a float
valuepublic TShortHashSet(short[] array)
TShortHashSet
instance containing the
elements of array.
array
- an array of short
primitivespublic TShortHashSet(TShortHashingStrategy strategy)
TShortHash
instance with the default
capacity and load factor.
strategy
- used to compute hash codes and to compare keys.public TShortHashSet(int initialCapacity, TShortHashingStrategy strategy)
TShortHash
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 TShortHashSet(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)
TShortHash
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 TShortHashSet(short[] array, TShortHashingStrategy strategy)
TShortHashSet
instance containing the
elements of array.
array
- an array of short
primitivesstrategy
- used to compute hash codes and to compare keys.Method Detail |
public TShortIterator iterator()
public boolean add(short val)
val
- an short
value
protected void rehash(int newCapacity)
rehash
in class THash
newCapacity
- an int
valuepublic short[] toArray()
short[]
valuepublic void clear()
clear
in class THash
public boolean equals(java.lang.Object other)
other
- an Object
value
boolean
valuepublic int hashCode()
public boolean remove(short val)
val
- an short
value
public boolean containsAll(short[] array)
array
- an array
of short primitives.
public boolean addAll(short[] array)
array
- an array
of short primitives.
public boolean removeAll(short[] array)
array
- an array
of short primitives.
public boolean retainAll(short[] array)
array
- an array
of short primitives.
|
GNU Trove | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |