gnu.trove

Class TIntHashSet

public class TIntHashSet extends TIntHash implements Serializable

An open addressed set implementation for int primitives. Created: Sat Nov 3 10:38:17 2001

Version: $Id: TIntHashSet.java,v 1.11 2003/03/19 04:17:04 ericdf Exp $

Author: Eric D. Friedman

Nested Class Summary
class	TIntHashSet.HashProcedure

Constructor Summary
	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 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[] array) Creates a new `TIntHashSet` instance containing the elements of `array`.
	TIntHashSet(TIntHashingStrategy strategy) Creates a new `TIntHash` instance with the default 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(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, TIntHashingStrategy strategy) Creates a new `TIntHashSet` instance containing the elements of `array`.

Method Summary
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	readObject(ObjectInputStream stream)
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	writeObject(ObjectOutputStream stream)

Constructor Detail

TIntHashSet

public TIntHashSet()

Creates a new TIntHashSet instance with the default capacity and load factor.

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.

Parameters: initialCapacity an int value

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.

Parameters: initialCapacity an int value loadFactor a float value

TIntHashSet

public TIntHashSet(int[] array)

Creates a new TIntHashSet instance containing the elements of array.

Parameters: array an array of int primitives

TIntHashSet

public TIntHashSet(TIntHashingStrategy strategy)

Creates a new TIntHash instance with the default capacity and load factor.

Parameters: strategy used to compute hash codes and to compare keys.

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.

Parameters: initialCapacity an int value strategy used to compute hash codes and to compare keys.

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.

Parameters: 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.