net.sf.saxon.sort

Class IntHashSet

public class IntHashSet extends Object implements IntSet, Serializable

Set of int values. This class is modelled on the java.net.Set interface, but it does not implement this interface, because the set members are int's rather than Objects.

Not thread safe.

Author: Dominique Devienne Michael Kay: retrofitted to JDK 1.4, added iterator()

Field Summary
static intMAX_SIZE
The maximum number of elements this container can contain.
intndv
This set's NO-DATA-VALUE.
Constructor Summary
IntHashSet()
Initializes a set with a capacity of 8 and a load factor of 0,25.
IntHashSet(int capacity)
Initializes a set with the given capacity and a load factor of 0,25.
IntHashSet(int capacity, int noDataValue)
Initializes a set with a load factor of 0,25.
Method Summary
booleanadd(int value)
voidclear()
booleancontains(int value)
booleancontainsAll(IntSet other)
Test if this set is a superset of another set
booleancontainsSome(IntHashSet other)
Test if this set has overlapping membership with another set
IntHashSetcopy()
Form a new set that is a copy of this set.
voiddiagnosticDump()
Diagnostic output
booleanequals(Object other)
Test whether this set has exactly the same members as another set
IntHashSetexcept(IntHashSet other)
Form a new set that is the difference of this set with another set.
intgetFirst(int defaultValue)
int[]getValues()
inthashCode()
Construct a hash key that supports the equals() test
IntHashSetintersect(IntHashSet other)
Form a new set that is the intersection of this set with another set.
booleanisEmpty()
IntIteratoriterator()
Get an iterator over the values
booleanremove(int value)
intsize()
IntHashSetunion(IntHashSet other)
Form a new set that is the union of this set with another set.

Field Detail

MAX_SIZE

public static final int MAX_SIZE
The maximum number of elements this container can contain.

ndv

public final int ndv
This set's NO-DATA-VALUE.

Constructor Detail

IntHashSet

public IntHashSet()
Initializes a set with a capacity of 8 and a load factor of 0,25.

IntHashSet

public IntHashSet(int capacity)
Initializes a set with the given capacity and a load factor of 0,25.

Parameters: capacity the initial capacity.

IntHashSet

public IntHashSet(int capacity, int noDataValue)
Initializes a set with a load factor of 0,25.

Parameters: capacity the initial capacity. noDataValue the value to use for non-values.

Method Detail

add

public boolean add(int value)

clear

public void clear()

contains

public boolean contains(int value)

containsAll

public boolean containsAll(IntSet other)
Test if this set is a superset of another set

containsSome

public boolean containsSome(IntHashSet other)
Test if this set has overlapping membership with another set

copy

public IntHashSet copy()
Form a new set that is a copy of this set.

diagnosticDump

public void diagnosticDump()
Diagnostic output

equals

public boolean equals(Object other)
Test whether this set has exactly the same members as another set

except

public IntHashSet except(IntHashSet other)
Form a new set that is the difference of this set with another set.

getFirst

public int getFirst(int defaultValue)

getValues

public int[] getValues()

hashCode

public int hashCode()
Construct a hash key that supports the equals() test

intersect

public IntHashSet intersect(IntHashSet other)
Form a new set that is the intersection of this set with another set.

isEmpty

public boolean isEmpty()

iterator

public IntIterator iterator()
Get an iterator over the values

remove

public boolean remove(int value)

size

public int size()

union

public IntHashSet union(IntHashSet other)
Form a new set that is the union of this set with another set.