CharBidirectionalIterable, CharCollection, CharIterable, CharSet, CharSortedSet, java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<java.lang.Character>, java.util.Collection<java.lang.Character>, java.util.Set<java.lang.Character>, java.util.SortedSet<java.lang.Character>public class CharRBTreeSet extends AbstractCharSortedSet implements java.io.Serializable, java.lang.Cloneable, CharSortedSet
The iterators provided by this class are type-specific
bidirectional iterators.
Moreover, the iterator returned by iterator() can be safely cast to a
type-specific list iterator.
| Constructor | Description |
|---|---|
CharRBTreeSet() |
Creates a new empty tree set.
|
CharRBTreeSet(char[] a) |
Creates a new tree set copying the elements of an array.
|
CharRBTreeSet(char[] a,
int offset,
int length) |
Creates a new tree set and fills it with the elements of a given array.
|
CharRBTreeSet(char[] a,
int offset,
int length,
java.util.Comparator<? super java.lang.Character> c) |
Creates a new tree set and fills it with the elements of a given array using
a given
Comparator. |
CharRBTreeSet(char[] a,
java.util.Comparator<? super java.lang.Character> c) |
Creates a new tree set copying the elements of an array using a given
Comparator. |
CharRBTreeSet(CharCollection c) |
Creates a new tree set copying a given type-specific collection.
|
CharRBTreeSet(CharIterator i) |
Creates a new tree set using elements provided by a type-specific iterator.
|
CharRBTreeSet(CharSortedSet s) |
Creates a new tree set copying a given type-specific sorted set (and its
Comparator). |
CharRBTreeSet(java.util.Collection<? extends java.lang.Character> c) |
Creates a new tree set copying a given collection.
|
CharRBTreeSet(java.util.Comparator<? super java.lang.Character> c) |
Creates a new empty tree set with the given comparator.
|
CharRBTreeSet(java.util.Iterator<?> i) |
Creates a new tree set using elements provided by an iterator.
|
CharRBTreeSet(java.util.SortedSet<java.lang.Character> s) |
Creates a new tree set copying a given sorted set (and its
Comparator). |
| Modifier and Type | Method | Description |
|---|---|---|
boolean |
add(char k) |
Ensures that this collection contains the specified element (optional
operation).
|
void |
clear() |
|
java.lang.Object |
clone() |
Returns a deep copy of this tree set.
|
CharComparator |
comparator() |
|
boolean |
contains(char k) |
Returns
true if this collection contains the specified element. |
char |
firstChar() |
Returns the first (lowest) element currently in this set.
|
CharSortedSet |
headSet(char to) |
Returns a view of the portion of this sorted set whose elements are strictly
less than
toElement. |
boolean |
isEmpty() |
|
CharBidirectionalIterator |
iterator() |
Returns a type-specific iterator on the elements of this collection.
|
CharBidirectionalIterator |
iterator(char from) |
Returns a type-specific
BidirectionalIterator
on the elements in this set, starting from a given element of the domain
(optional operation). |
char |
lastChar() |
Returns the last (highest) element currently in this set.
|
boolean |
remove(char k) |
Removes an element from this set.
|
int |
size() |
|
CharSortedSet |
subSet(char from,
char to) |
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
CharSortedSet |
tailSet(char from) |
Returns a view of the portion of this sorted set whose elements are greater
than or equal to
fromElement. |
add, addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toCharArray, toCharArray, toStringequals, hashCode, remaddAll, containsAll, removeAll, retainAll, toArray, toArrayaddAll, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toCharArray, toCharArrayforEach, forEachfirst, headSet, last, subSet, tailSetpublic CharRBTreeSet()
public CharRBTreeSet(java.util.Comparator<? super java.lang.Character> c)
c - a Comparator (even better, a type-specific comparator).public CharRBTreeSet(java.util.Collection<? extends java.lang.Character> c)
c - a collection to be copied into the new tree set.public CharRBTreeSet(java.util.SortedSet<java.lang.Character> s)
Comparator).s - a SortedSet to be copied into the new tree set.public CharRBTreeSet(CharCollection c)
c - a type-specific collection to be copied into the new tree set.public CharRBTreeSet(CharSortedSet s)
Comparator).s - a type-specific sorted set to be copied into the new tree set.public CharRBTreeSet(CharIterator i)
i - a type-specific iterator whose elements will fill the set.public CharRBTreeSet(java.util.Iterator<?> i)
i - an iterator whose elements will fill the set.public CharRBTreeSet(char[] a,
int offset,
int length,
java.util.Comparator<? super java.lang.Character> c)
Comparator.a - an array whose elements will be used to fill the set.offset - the first element to use.length - the number of elements to use.c - a Comparator (even better, a type-specific comparator).public CharRBTreeSet(char[] a,
int offset,
int length)
a - an array whose elements will be used to fill the set.offset - the first element to use.length - the number of elements to use.public CharRBTreeSet(char[] a)
a - an array to be copied into the new tree set.public CharRBTreeSet(char[] a,
java.util.Comparator<? super java.lang.Character> c)
Comparator.a - an array to be copied into the new tree set.c - a Comparator (even better, a type-specific comparator).public boolean add(char k)
AbstractCharCollection
This implementation always throws an UnsupportedOperationException.
add in interface CharCollectionadd in class AbstractCharCollectionCollection.add(Object)public boolean remove(char k)
AbstractCharSet
Note that the corresponding method of a type-specific collection is
rem(). This unfortunate situation is caused by the clash with the
similarly named index-based method in the List interface. Delegates to the type-specific rem() method implemented
by type-specific abstract Collection superclass.
remove in interface CharSetremove in class AbstractCharSetCollection.remove(Object)public boolean contains(char k)
AbstractCharCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface CharCollectioncontains in class AbstractCharCollectionCollection.contains(Object)public void clear()
clear in interface java.util.Collection<java.lang.Character>clear in interface java.util.Set<java.lang.Character>clear in class java.util.AbstractCollection<java.lang.Character>public int size()
size in interface java.util.Collection<java.lang.Character>size in interface java.util.Set<java.lang.Character>size in class java.util.AbstractCollection<java.lang.Character>public boolean isEmpty()
isEmpty in interface java.util.Collection<java.lang.Character>isEmpty in interface java.util.Set<java.lang.Character>isEmpty in class java.util.AbstractCollection<java.lang.Character>public char firstChar()
CharSortedSetfirstChar in interface CharSortedSetSortedSet.first()public char lastChar()
CharSortedSetlastChar in interface CharSortedSetSortedSet.last()public CharBidirectionalIterator iterator()
CharCollection
Note that this specification strengthens the one given in
Iterable.iterator(), which was already strengthened in the
corresponding type-specific class, but was weakened by the fact that this
interface extends Collection.
iterator in interface CharBidirectionalIterableiterator in interface CharCollectioniterator in interface CharIterableiterator in interface CharSetiterator in interface CharSortedSetiterator in interface java.util.Collection<java.lang.Character>iterator in interface java.lang.Iterable<java.lang.Character>iterator in interface java.util.Set<java.lang.Character>iterator in class AbstractCharSortedSetIterable.iterator()public CharBidirectionalIterator iterator(char from)
CharSortedSetBidirectionalIterator
on the elements in this set, starting from a given element of the domain
(optional operation).
This method returns a type-specific bidirectional iterator with given
starting point. The starting point is any element comparable to the elements
of this set (even if it does not actually belong to the set). The next
element of the returned iterator is the least element of the set that is
greater than the starting point (if there are no elements greater than the
starting point, hasNext() will return false). The previous element of the returned
iterator is the greatest element of the set that is smaller than or equal to
the starting point (if there are no elements smaller than or equal to the
starting point,
hasPrevious() will return false).
Note that passing the last element of the set as starting point and calling
previous() you
can traverse the entire set in reverse order.
iterator in interface CharSortedSetfrom - an element to start from.public CharComparator comparator()
CharSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator().
comparator in interface CharSortedSetcomparator in interface java.util.SortedSet<java.lang.Character>public CharSortedSet headSet(char to)
CharSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface CharSortedSetSortedSet.headSet(Object)public CharSortedSet tailSet(char from)
CharSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
tailSet in interface CharSortedSetSortedSet.tailSet(Object)public CharSortedSet subSet(char from, char to)
CharSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface CharSortedSetSortedSet.subSet(Object,Object)public java.lang.Object clone()
This method performs a deep copy of this tree set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.