gnu.trove

Class TFloatHashSet

public class TFloatHashSet extends TFloatHash implements Serializable

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

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

Author: Eric D. Friedman

Nested Class Summary
class	TFloatHashSet.HashProcedure

Constructor Summary
	TFloatHashSet() Creates a new `TFloatHashSet` instance with the default capacity and load factor.
	TFloatHashSet(int initialCapacity) Creates a new `TFloatHashSet` instance with a prime capacity equal to or greater than `initialCapacity` and with the default load factor.
	TFloatHashSet(int initialCapacity, float loadFactor) Creates a new `TFloatHashSet` instance with a prime capacity equal to or greater than `initialCapacity` and with the specified load factor.
	TFloatHashSet(float[] array) Creates a new `TFloatHashSet` instance containing the elements of `array`.
	TFloatHashSet(TFloatHashingStrategy strategy) Creates a new `TFloatHash` instance with the default capacity and load factor.
	TFloatHashSet(int initialCapacity, TFloatHashingStrategy strategy) Creates a new `TFloatHash` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
	TFloatHashSet(int initialCapacity, float loadFactor, TFloatHashingStrategy strategy) Creates a new `TFloatHash` instance with a prime value at or near the specified capacity and load factor.
	TFloatHashSet(float[] array, TFloatHashingStrategy strategy) Creates a new `TFloatHashSet` instance containing the elements of `array`.

Method Summary
boolean	add(float val) Inserts a value into the set.
boolean	addAll(float[] array) Adds all of the elements in `array` to the set.
void	clear() Empties the set.
boolean	containsAll(float[] 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()
TFloatIterator	iterator()
void	readObject(ObjectInputStream stream)
protected void	rehash(int newCapacity) Expands the set to accomodate new values.
boolean	remove(float val) Removes `val` from the set.
boolean	removeAll(float[] array) Removes all of the elements in `array` from the set.
boolean	retainAll(float[] array) Removes any values in the set which are not contained in `array`.
float[]	toArray() Returns a new array containing the values in the set.
void	writeObject(ObjectOutputStream stream)

Constructor Detail

TFloatHashSet

public TFloatHashSet()

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

TFloatHashSet

public TFloatHashSet(int initialCapacity)

Creates a new TFloatHashSet instance with a prime capacity equal to or greater than initialCapacity and with the default load factor.

Parameters: initialCapacity an int value

TFloatHashSet

public TFloatHashSet(int initialCapacity, float loadFactor)

Creates a new TFloatHashSet 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

TFloatHashSet

public TFloatHashSet(float[] array)

Creates a new TFloatHashSet instance containing the elements of array.

Parameters: array an array of float primitives

TFloatHashSet

public TFloatHashSet(TFloatHashingStrategy strategy)

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

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

TFloatHashSet

public TFloatHashSet(int initialCapacity, TFloatHashingStrategy strategy)

Creates a new TFloatHash 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.

TFloatHashSet

public TFloatHashSet(int initialCapacity, float loadFactor, TFloatHashingStrategy strategy)

Creates a new TFloatHash 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.