| java.lang.Object
 net.sf.saxon.sort.IntHashSet
| IntHashSet | | public class IntHashSet implements Serializable(Code) | | Set of int values.
Not thread safe.
author:
Dominique Devienne
author:
Michael Kay: retrofitted to JDK 1.4, added iterator() |
| Field Summary | |
| final public static int | MAX_SIZE
The maximum number of elements this container can contain. | | final public int | ndv
This set's NO-DATA-VALUE. |
| Constructor Summary | |
| public | IntHashSet()
Initializes a set with a capacity of 8 and a load factor of 0,25. | | public | IntHashSet(int capacity)
Initializes a set with the given capacity and a load factor of 0,25. | | public | IntHashSet(int capacity, int noDataValue)
Initializes a set with a load factor of 0,25. | | 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. |
| MAX_SIZE | | final public static int MAX_SIZE(Code) | | The maximum number of elements this container can contain.
|
| ndv | | final public int ndv(Code) | | This set's NO-DATA-VALUE.
|
| IntHashSet | | public IntHashSet(int capacity, int noDataValue)(Code) | | Initializes a set with a load factor of 0,25.
Parameters:
capacity - the initial capacity.
Parameters:
noDataValue - the value to use for non-values.
See Also: IntHashSet.IntHashSet(int,double,int) |
| IntHashSet | | public IntHashSet(int capacity, double factor, int noDataValue)(Code) | | 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.
Parameters:
factor - the load factor.
Parameters:
noDataValue - the value to use for non-values. |
| add | | public boolean add(int value)(Code) | | |
| clear | | public void clear()(Code) | | |
| contains | | public boolean contains(int value)(Code) | | |
| containsAll | | public boolean containsAll(IntHashSet other)(Code) | | Test if this set is a superset of another set
|
| containsSome | | public boolean containsSome(IntHashSet other)(Code) | | Test if this set has overlapping membership with another set
|
| equals | | public boolean equals(Object other)(Code) | | Test whether this set has exactly the same members as another set
|
| getValues | | public int[] getValues()(Code) | | |
| hashCode | | public int hashCode()(Code) | | Construct a hash key that supports the equals() test
|
| intersect | | public IntHashSet intersect(IntHashSet other)(Code) | | Form a new set that is the intersection of this set with another set.
|
| isEmpty | | public boolean isEmpty()(Code) | | |
| peek | | public int peek(int defaultValue)(Code) | | |
| remove | | public boolean remove(int value)(Code) | | |
|
|