Package net.sf.saxon.sort
Class IntHashSet
- java.lang.Object
-
- net.sf.saxon.sort.IntHashSet
-
- All Implemented Interfaces:
java.io.Serializable
,IntSet
public class IntHashSet extends java.lang.Object implements IntSet, java.io.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()
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description 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
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(int value)
Add an integer to the setvoid
clear()
Clear the contents of the IntSet (making it an empty set)boolean
contains(int value)
Determine whether a particular integer is present in the setboolean
containsAll(IntSet other)
Test if this set is a superset of another setboolean
containsSome(IntHashSet other)
Test if this set has overlapping membership with another setIntHashSet
copy()
Form a new set that is a copy of this set.void
diagnosticDump()
Diagnostic outputboolean
equals(java.lang.Object other)
Test whether this set has exactly the same members as another setIntHashSet
except(IntHashSet other)
Form a new set that is the difference of this set with another set.int
getFirst(int defaultValue)
int[]
getValues()
int
hashCode()
Construct a hash key that supports the equals() testIntHashSet
intersect(IntHashSet other)
Form a new set that is the intersection of this set with another set.boolean
isEmpty()
Determine if the set is emptyIntIterator
iterator()
Get an iterator over the valuesboolean
remove(int value)
Remove an integer from the setint
size()
Get the number of integers in the setIntHashSet
union(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.- See Also:
- Constant Field Values
-
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
-
clear
public void clear()
Description copied from interface:IntSet
Clear the contents of the IntSet (making it an empty set)
-
size
public int size()
Description copied from interface:IntSet
Get the number of integers in the set
-
isEmpty
public boolean isEmpty()
Description copied from interface:IntSet
Determine if the set is empty
-
getFirst
public int getFirst(int defaultValue)
-
getValues
public int[] getValues()
-
contains
public boolean contains(int value)
Description copied from interface:IntSet
Determine whether a particular integer is present in the set
-
remove
public boolean remove(int value)
Description copied from interface:IntSet
Remove an integer from the set
-
add
public boolean add(int value)
Description copied from interface:IntSet
Add an integer to the set
-
iterator
public IntIterator iterator()
Get an iterator over the values
-
copy
public IntHashSet copy()
Form a new set that is a copy of this set.
-
union
public IntHashSet union(IntHashSet other)
Form a new set that is the union of this set with another set.
-
intersect
public IntHashSet intersect(IntHashSet other)
Form a new set that is the intersection of this set with another set.
-
except
public IntHashSet except(IntHashSet other)
Form a new set that is the difference of this set with another set.
-
containsAll
public boolean containsAll(IntSet other)
Test if this set is a superset of another set- Specified by:
containsAll
in interfaceIntSet
-
containsSome
public boolean containsSome(IntHashSet other)
Test if this set has overlapping membership with another set
-
equals
public boolean equals(java.lang.Object other)
Test whether this set has exactly the same members as another set- Overrides:
equals
in classjava.lang.Object
-
hashCode
public int hashCode()
Construct a hash key that supports the equals() test- Overrides:
hashCode
in classjava.lang.Object
-
diagnosticDump
public void diagnosticDump()
Diagnostic output
-
-