public class TShortHashSet extends TShortHashimplements Externalizable
_hashingStrategy, _set_states, FREE, FULL, REMOVED_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR| Constructor and Description |
|---|
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
Creates a new
TShortHash instance with a prime value at or near the specified capacity and load factor.
|
TShortHashSet(int initialCapacity, TShortHashingStrategy
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
Creates a new
TShortHashSet instance containing the elements of
array.
|
TShortHashSet(TShortHashingStrategy
Creates a new
TShortHash instance with the default capacity and load factor.
|
| Modifier and Type | Method and Description |
|---|---|
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(Object
Compares this set with another set for equality of their stored entries.
|
int |
hashCode()
|
TShortIterator |
iterator()
|
void |
readExternal(ObjectInput
|
protected void |
rehash(int newCapacity)
Expands the set to accommodate 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.
|
void |
writeExternal(ObjectOutput
|
clone, computeHashCode, contains, forEach, index, insertionIndex, removeAt, setUpcapacitycalculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSizepublic 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 value
public 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 value
loadFactor - a
float value
public TShortHashSet(short[] array)
TShortHashSet instance containing the elements of
array.
array - an array of
short primitives
public TShortHashSet(TShortHashingStrategystrategy)
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 value
strategy - 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 primitives
strategy - used to compute hash codes and to compare keys.
public TShortIteratoriterator()
public boolean add(short val)
val - an
short value
protected void rehash(int newCapacity)
public short[] toArray()
short[] value
public void clear()
public boolean equals(Objectother)
public 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.
public void writeExternal(ObjectOutputout) throws IOException
writeExternal in interface
Externalizable
writeExternal in class
THash
IOException
public void readExternal(ObjectInputin) throws IOException , ClassNotFoundException
readExternal in interface
Externalizable
readExternal in class
THash
IOException
ClassNotFoundException