net.sf.saxon.sort
Interface IntSet
- IntArraySet, IntHashSet, IntRangeSet
A set of integers represented as int values
boolean | add(int value) - Add an integer to the set
|
void | 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 set
|
boolean | containsAll(IntSet other) - Test if this set is a superset of another set
|
boolean | isEmpty() - Determine if the set is empty
|
IntIterator | iterator() - Get an iterator over the values
|
boolean | remove(int value) - Remove an integer from the set
|
int | size() - Get the number of integers in the set
|
add
public boolean add(int value)
Add an integer to the set
value
- the integer to be added
- true if the integer was added, false if it was already present
clear
public void clear()
Clear the contents of the IntSet (making it an empty set)
contains
public boolean contains(int value)
Determine whether a particular integer is present in the set
value
- the integer under test
- true if value is present in the set, false if not
containsAll
public boolean containsAll(IntSet other)
Test if this set is a superset of another set
isEmpty
public boolean isEmpty()
Determine if the set is empty
- true if the set is empty, false if not
iterator
public IntIterator iterator()
Get an iterator over the values
remove
public boolean remove(int value)
Remove an integer from the set
value
- the integer to be removed
- true if the integer was present in the set, false if it was not present
size
public int size()
Get the number of integers in the set