Package net.sf.saxon.sort
Class IntHashSet
java.lang.Object
net.sf.saxon.sort.IntHashSet
- All Implemented Interfaces:
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:
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionInitializes 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, double factor, int noDataValue) Constructs a new set with initial capacity, and load factor.IntHashSet
(int capacity, int noDataValue) Initializes a set with a load factor of 0,25. -
Method Summary
Modifier and TypeMethodDescriptionboolean
add
(int value) void
clear()
boolean
contains
(int value) boolean
containsAll
(IntHashSet other) Test if this set is a superset of another setboolean
containsSome
(IntHashSet other) Test if this set has overlapping membership with another setboolean
Test whether this set has exactly the same members as another setexcept
(IntHashSet other) Form a new set that is the difference of this set with another set.int
getFirst
(int defaultValue) int[]
int
hashCode()
Construct a hash key that supports the equals() testintersect
(IntHashSet other) Form a new set that is the intersection of this set with another set.boolean
isEmpty()
iterator()
Get an iterator over the valuesboolean
remove
(int value) int
size()
union
(IntHashSet other) Form a new set that is the union of this set with another set.
-
Field Details
-
MAX_SIZE
public static final int MAX_SIZEThe maximum number of elements this container can contain.- See Also:
-
ndv
public final int ndvThis set's NO-DATA-VALUE.
-
-
Constructor Details
-
IntHashSet
public IntHashSet()Initializes a set with a capacity of 8 and a load factor of 0,25.- See Also:
-
IntHashSet
public IntHashSet(int capacity) Initializes a set with the given capacity and a load factor of 0,25.- Parameters:
capacity
- the initial capacity.- See Also:
-
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.- See Also:
-
IntHashSet
public IntHashSet(int capacity, double factor, int noDataValue) Constructs a new set with initial capacity, and load factor. The capacity is the number of keys that can be mapped without resizing the arrays in which keys and values are stored. For efficiency, only a fraction of the elements in those arrays are used. That fraction is the specified load factor. The initial length of the arrays equals the smallest power of two not less than the ratio capacity/factor. The capacity of the set is increased, as necessary. The maximum number of keys that can be mapped is 2^30.- Parameters:
capacity
- the initial capacity.factor
- the load factor.noDataValue
- the value to use for non-values.
-
-
Method Details
-
clear
public void clear() -
size
public int size() -
isEmpty
public boolean isEmpty() -
getFirst
public int getFirst(int defaultValue) -
getValues
public int[] getValues() -
contains
public boolean contains(int value) -
remove
public boolean remove(int value) -
add
public boolean add(int value) -
iterator
Get an iterator over the values -
union
Form a new set that is the union of this set with another set. -
intersect
Form a new set that is the intersection of this set with another set. -
except
Form a new set that is the difference of this set with another set. -
containsAll
Test if this set is a superset of another set -
containsSome
Test if this set has overlapping membership with another set -
equals
Test whether this set has exactly the same members as another set -
hashCode
public int hashCode()Construct a hash key that supports the equals() test
-