public class TIntHashSet extends TIntHash implements Externalizable
_hashingStrategy, _set_states, FREE, FULL, REMOVED_autoCompactionFactor, _autoCompactRemovesRemaining, _free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR| Constructor and Description | 
|---|
TIntHashSet()
Creates a new  
TIntHashSet instance with the default capacity and load factor. | 
TIntHashSet(int initialCapacity)
Creates a new  
TIntHashSet instance with a prime capacity equal to or greater
 than initialCapacity and with the default load factor. | 
TIntHashSet(int[] array)
Creates a new  
TIntHashSet instance containing the elements of array. | 
TIntHashSet(int[] array,
           TIntHashingStrategy strategy)
Creates a new  
TIntHashSet instance containing the elements of array. | 
TIntHashSet(int initialCapacity,
           float loadFactor)
Creates a new  
TIntHashSet instance with a prime capacity equal to or greater
 than initialCapacity and with the specified load factor. | 
TIntHashSet(int initialCapacity,
           float loadFactor,
           TIntHashingStrategy strategy)
Creates a new  
TIntHash instance with a prime value at or near the specified
 capacity and load factor. | 
TIntHashSet(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. | 
TIntHashSet(TIntHashingStrategy strategy)
Creates a new  
TIntHash instance with the default capacity and load factor. | 
| Modifier and Type | Method and Description | 
|---|---|
boolean | 
add(int val)
Inserts a value into the set. 
 | 
boolean | 
addAll(int[] array)
Adds all of the elements in array to the set. 
 | 
void | 
clear()
Empties the set. 
 | 
boolean | 
containsAll(int[] array)
Tests the set to determine if all of the elements in array are present. 
 | 
boolean | 
equals(Object other)
Compares this set with another set for equality of their stored entries. 
 | 
int | 
hashCode()  | 
TIntIterator | 
iterator()  | 
void | 
readExternal(ObjectInput in)  | 
protected void | 
rehash(int newCapacity)
Expands the set to accommodate new values. 
 | 
boolean | 
remove(int val)
Removes val from the set. 
 | 
boolean | 
removeAll(int[] array)
Removes all of the elements in array from the set. 
 | 
boolean | 
retainAll(int[] array)
Removes any values in the set which are not contained in array. 
 | 
int[] | 
toArray()
Returns a new array containing the values in the set. 
 | 
void | 
writeExternal(ObjectOutput out)  | 
clone, computeHashCode, contains, forEach, index, insertionIndex, removeAt, setUpcapacitycalculateGrownCapacity, compact, ensureCapacity, getAutoCompactionFactor, isEmpty, postInsertHook, reenableAutoCompaction, setAutoCompactionFactor, size, tempDisableAutoCompaction, trimToSizepublic TIntHashSet()
TIntHashSet instance with the default capacity and load factor.public TIntHashSet(int initialCapacity)
TIntHashSet instance with a prime capacity equal to or greater
 than initialCapacity and with the default load factor.initialCapacity - an int valuepublic TIntHashSet(int initialCapacity,
                   float loadFactor)
TIntHashSet instance with a prime capacity equal to or greater
 than initialCapacity and with the specified load factor.initialCapacity - an int valueloadFactor - a float valuepublic TIntHashSet(int[] array)
TIntHashSet instance containing the elements of array.array - an array of int primitivespublic TIntHashSet(TIntHashingStrategy strategy)
TIntHash instance with the default capacity and load factor.strategy - used to compute hash codes and to compare keys.public TIntHashSet(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 TIntHashSet(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.public TIntHashSet(int[] array,
                   TIntHashingStrategy strategy)
TIntHashSet instance containing the elements of array.array - an array of int primitivesstrategy - used to compute hash codes and to compare keys.public TIntIterator iterator()
public boolean add(int val)
val - an int valueprotected void rehash(int newCapacity)
public int[] toArray()
int[] valuepublic boolean equals(Object other)
public boolean remove(int val)
val - an int valuepublic boolean containsAll(int[] array)
array - an array of int primitives.public boolean addAll(int[] array)
array - an array of int primitives.public boolean removeAll(int[] array)
array - an array of int primitives.public boolean retainAll(int[] array)
array - an array of int primitives.public void writeExternal(ObjectOutput out) throws IOException
writeExternal in interface ExternalizablewriteExternal in class THashIOExceptionpublic void readExternal(ObjectInput in) throws IOException, ClassNotFoundException
readExternal in interface ExternalizablereadExternal in class THashIOExceptionClassNotFoundExceptionCopyright © GigaSpaces.