Package net.sf.saxon.z
Class MonotonicIntSet
java.lang.Object
net.sf.saxon.z.IntSet
net.sf.saxon.z.MonotonicIntSet
Set of int values. This implementation requires that new entries are added in monotonically
increasing order; any attempt to add a value out of sequence, or to remove a value, results
is an UnsupportedOperationException
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(int value) Add an integer to the setvoidclear()Clear the contents of the IntSet (making it an empty set)booleancontains(int value) Determine whether a particular integer is present in the setcopy()Create a copy of this IntSet that leaves the original unchanged.booleanTest whether this set has exactly the same members as another setinthashCode()Construct a hash key that supports the equals() testbooleanisEmpty()Determine if the set is emptybooleanAsk whether the set permits in-situ modifications using add() and remove()iterator()Get an iterator over the valuesstatic MonotonicIntSetmake(int[] in, int size) Factory method to construct a set from an array of integersCreate a copy of this IntSet that contains the same set of integers.booleanremove(int value) Remove an integer from the setintsize()Get the number of integers in the settoString()Form a new set that is the union of this set with another set.Methods inherited from class net.sf.saxon.z.IntSet
containsAll, except, intersect
-
Constructor Details
-
MonotonicIntSet
public MonotonicIntSet()Create an empty set
-
-
Method Details
-
copy
Description copied from class:IntSetCreate a copy of this IntSet that leaves the original unchanged. -
mutableCopy
Description copied from class:IntSetCreate a copy of this IntSet that contains the same set of integers.- Specified by:
mutableCopyin classIntSet- Returns:
- an IntSet containing the same integers. The result will not necessarily be the same class as the original. It will always be a mutable object
-
isMutable
public boolean isMutable()Description copied from class:IntSetAsk whether the set permits in-situ modifications using add() and remove() -
clear
public void clear()Description copied from class:IntSetClear the contents of the IntSet (making it an empty set) -
size
public int size()Description copied from class:IntSetGet the number of integers in the set -
isEmpty
public boolean isEmpty()Description copied from class:IntSetDetermine if the set is empty -
contains
public boolean contains(int value) Description copied from class:IntSetDetermine whether a particular integer is present in the set -
remove
public boolean remove(int value) Description copied from class:IntSetRemove an integer from the set -
add
public boolean add(int value) Add an integer to the set- Specified by:
addin classIntSet- Parameters:
value- the integer to be added (which must be greater than or equal to the largest integer currently in the set)- Returns:
- true if the integer was added, false if it was already present
- Throws:
UnsupportedOperationException- if the set already contains an integer larger than the supplied value
-
iterator
Get an iterator over the values -
union
Form a new set that is the union of this set with another set. -
make
Factory method to construct a set from an array of integers- Parameters:
in- the array of integers, which must be in ascending ordersize- the number of elements in the array that are significant- Returns:
- the constructed set
-
toString
-
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
-