net.sf.saxon.sort

Interface IntSet

public interface IntSet

A set of integers represented as int values
Method Summary
booleanadd(int value)
Add an integer to the set
voidclear()
Clear the contents of the IntSet (making it an empty set)
booleancontains(int value)
Determine whether a particular integer is present in the set
booleancontainsAll(IntSet other)
Test if this set is a superset of another set
booleanisEmpty()
Determine if the set is empty
IntIteratoriterator()
Get an iterator over the values
booleanremove(int value)
Remove an integer from the set
intsize()
Get the number of integers in the set

Method Detail

add

public boolean add(int value)
Add an integer to the set

Parameters: value the integer to be added

Returns: 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

Parameters: value the integer under test

Returns: 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

Returns: 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

Parameters: value the integer to be removed

Returns: 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

Returns: the size of the set