| |
|
| bak.pcj.set.AbstractIntSet bak.pcj.set.IntRangeSet
IntRangeSet | public class IntRangeSet extends AbstractIntSet implements IntSortedSet,Cloneable,Serializable(Code) | | This class represents range based sets of int values.
The implementation is optimized for cases where most set elements
fall into ranges of consecutive int values.
Implementation of
IntSortedSet is supported from PCJ 1.2. Prior to 1.2, only IntSet
was implemented.
See Also: IntRange author: Søren Bak version: 1.3 20-08-2003 22:24 since: 1.0 |
Constructor Summary | |
public | IntRangeSet() Creates a new empty range set. | public | IntRangeSet(int[] a) Creates a new empty range set containing specified values. | public | IntRangeSet(IntCollection c) Creates a new range set with the same elements as a specified
collection. |
Method Summary | |
public boolean | add(int v) | public boolean | addAll(IntRangeSet c) Adds all the elements of a specified range set to
this set.
Parameters: c - the set whose elements to add to thisset. | public boolean | addAll(IntRange range) Adds a specified range to this set.
Parameters: range - the range to add to this set. | public boolean | addAll(int first, int last) Adds a specified range to this set.
Parameters: first - the first value of the range to add to this set. Parameters: last - the last value of the range to add to this set. | public boolean | addAll(int[] a) Adds an array of int values to this set. | public void | clear() | public Object | clone() Returns a clone of this range set. | public boolean | contains(int v) | public boolean | containsAll(IntRange range) Indicates whether all elements of a specified
range is contained in this set.
Parameters: range - the range whose elements to test forcontainment. | public int | first() | public int | hashCode() | public IntSortedSet | headSet(int to) | public boolean | isEmpty() | public IntIterator | iterator() | public int | last() | public IntRange[] | ranges() Returns the ranges of this set. | public boolean | remove(int v) | public int | size() | public IntSortedSet | subSet(int from, int to) | public IntSortedSet | tailSet(int from) | public int[] | toArray(int[] a) | public String | toString() | public void | trimToSize() |
IntRangeSet | public IntRangeSet()(Code) | | Creates a new empty range set.
|
IntRangeSet | public IntRangeSet(int[] a)(Code) | | Creates a new empty range set containing specified values.
Parameters: a - the values that the new set should contain. throws: NullPointerException - if a is null. |
IntRangeSet | public IntRangeSet(IntCollection c)(Code) | | Creates a new range set with the same elements as a specified
collection.
Parameters: c - the collection whose elements to add to the newset. throws: NullPointerException - if c is null. |
add | public boolean add(int v)(Code) | | |
addAll | public boolean addAll(int first, int last)(Code) | | Adds a specified range to this set.
Parameters: first - the first value of the range to add to this set. Parameters: last - the last value of the range to add to this set. true if this set was modifiedas a result of adding the values firstto last; returns falseotherwise. throws: IllegalArgumentException - if first > last. |
clear | public void clear()(Code) | | |
clone | public Object clone()(Code) | | Returns a clone of this range set.
a clone of this range set. since: 1.1 |
contains | public boolean contains(int v)(Code) | | |
containsAll | public boolean containsAll(IntRange range)(Code) | | Indicates whether all elements of a specified
range is contained in this set.
Parameters: range - the range whose elements to test forcontainment. true if all the elements of rangeare contained in this collection; returnsfalse otherwise. throws: NullPointerException - if range is null. See Also: IntRangeSet.containsAll(IntCollection) |
first | public int first()(Code) | | since: 1.2 |
hashCode | public int hashCode()(Code) | | |
isEmpty | public boolean isEmpty()(Code) | | |
last | public int last()(Code) | | since: 1.2 |
ranges | public IntRange[] ranges()(Code) | | Returns the ranges of this set. None of the ranges returned
will overlap or be adjacent.
the ranges of this set. The returned array isa fresh copy that can be modified withoutmodifying this set. |
remove | public boolean remove(int v)(Code) | | |
toArray | public int[] toArray(int[] a)(Code) | | |
trimToSize | public void trimToSize()(Code) | | |
|
|
|