gnu.trove
Class TIntHashSet
- Externalizable
public class TIntHashSet
extends TIntHash
implements Externalizable
An open addressed set implementation for int primitives.
TIntHashSet() - Creates a new
TIntHashSet instance with the default
capacity and load factor.
|
TIntHashSet(TIntHashingStrategy strategy) - Creates a new
TIntHash 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 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(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[] 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.
|
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 accomodate 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)
|
TIntHashSet
public TIntHashSet()
Creates a new TIntHashSet
instance with the default
capacity and load factor.
TIntHashSet
public TIntHashSet(TIntHashingStrategy strategy)
Creates a new TIntHash
instance with the default
capacity and load factor.
strategy
- used to compute hash codes and to compare keys.
TIntHashSet
public TIntHashSet(int initialCapacity)
Creates a new TIntHashSet
instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity
- an int
value
TIntHashSet
public 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.
initialCapacity
- an int
valuestrategy
- used to compute hash codes and to compare keys.
TIntHashSet
public 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.
initialCapacity
- an int
valueloadFactor
- a float
value
TIntHashSet
public 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.
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.
TIntHashSet
public TIntHashSet(int[] array)
Creates a new TIntHashSet
instance containing the
elements of array.
array
- an array of int
primitives
TIntHashSet
public TIntHashSet(int[] array,
TIntHashingStrategy strategy)
Creates a new TIntHashSet
instance containing the
elements of array.
array
- an array of int
primitivesstrategy
- used to compute hash codes and to compare keys.
add
public boolean add(int val)
Inserts a value into the set.
- true if the set was modified by the add operation
addAll
public boolean addAll(int[] array)
Adds all of the elements in array to the set.
array
- an array
of int primitives.
- true if the set was modified by the add all operation.
clear
public void clear()
Empties the set.
containsAll
public boolean containsAll(int[] array)
Tests the set to determine if all of the elements in
array are present.
array
- an array
of int primitives.
- true if all elements were present in the set.
equals
public boolean equals(Object other)
Compares this set with another set for equality of their stored
entries.
hashCode
public int hashCode()
iterator
public TIntIterator iterator()
- a TIntIterator with access to the values in this set
readExternal
public void readExternal(ObjectInput in)
throws IOException,
ClassNotFoundException
rehash
protected void rehash(int newCapacity)
Expands the set to accomodate new values.
newCapacity
- an int
value
remove
public boolean remove(int val)
Removes val from the set.
- true if the set was modified by the remove operation.
removeAll
public boolean removeAll(int[] array)
Removes all of the elements in array from the set.
array
- an array
of int primitives.
- true if the set was modified by the remove all operation.
retainAll
public boolean retainAll(int[] array)
Removes any values in the set which are not contained in
array.
array
- an array
of int primitives.
- true if the set was modified by the retain all operation
toArray
public int[] toArray()
Returns a new array containing the values in the set.
writeExternal
public void writeExternal(ObjectOutput out)
throws IOException
GNU Trove is copyright B) 2001-2007 Eric D. Friedman. All Rights Reserved.