public class CharAVLTreeSet extends AbstractCharSortedSet implements Serializable, 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 and Description |
|---|
CharAVLTreeSet()
Creates a new empty tree set.
|
CharAVLTreeSet(char[] a)
Creates a new tree set copying the elements of an array.
|
CharAVLTreeSet(char[] a,
Comparator<? super Character> c)
Creates a new tree set copying the elements of an array using a given
Comparator. |
CharAVLTreeSet(char[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
CharAVLTreeSet(char[] a,
int offset,
int length,
Comparator<? super Character> c)
Creates a new tree set and fills it with the elements of a given array using a given
Comparator. |
CharAVLTreeSet(CharCollection c)
Creates a new tree set copying a given type-specific collection.
|
CharAVLTreeSet(CharIterator i)
Creates a new tree set using elements provided by a type-specific iterator.
|
CharAVLTreeSet(CharSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator). |
CharAVLTreeSet(Collection<? extends Character> c)
Creates a new tree set copying a given set.
|
CharAVLTreeSet(Comparator<? super Character> c)
Creates a new empty tree set with the given comparator.
|
CharAVLTreeSet(Iterator<?> i)
Creates a new tree set using elements provided by an iterator.
|
CharAVLTreeSet(SortedSet<Character> s)
Creates a new tree set copying a given sorted set (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(char k) |
void |
clear() |
Object |
clone()
Returns a deep copy of this tree set.
|
CharComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
boolean |
contains(char k) |
char |
firstChar() |
CharSortedSet |
headSet(char to) |
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() |
boolean |
remove(char k)
Removes an element from this set.
|
int |
size() |
CharSortedSet |
subSet(char from,
char to) |
CharSortedSet |
tailSet(char from) |
charIterator, first, headSet, last, subSet, tailSetequals, hashCode, rem, removeadd, addAll, addAll, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toCharArray, toCharArray, toStringcharIterator, headSet, subSet, tailSetaddAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toCharArray, toCharArrayfirst, last, spliteratoradd, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArrayparallelStream, removeIf, streampublic CharAVLTreeSet()
public CharAVLTreeSet(Comparator<? super Character> c)
c - a Comparator (even better, a type-specific comparator).public CharAVLTreeSet(Collection<? extends Character> c)
c - a collection to be copied into the new tree set.public CharAVLTreeSet(SortedSet<Character> s)
Comparator).s - a SortedSet to be copied into the new tree set.public CharAVLTreeSet(CharCollection c)
c - a type-specific collection to be copied into the new tree set.public CharAVLTreeSet(CharSortedSet s)
Comparator).s - a type-specific sorted set to be copied into the new tree set.public CharAVLTreeSet(CharIterator i)
i - a type-specific iterator whose elements will fill the set.public CharAVLTreeSet(Iterator<?> i)
i - an iterator whose elements will fill the set.public CharAVLTreeSet(char[] a,
int offset,
int length,
Comparator<? super 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 CharAVLTreeSet(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 CharAVLTreeSet(char[] a)
a - an array to be copied into the new tree set.public CharAVLTreeSet(char[] a,
Comparator<? super 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)
add in interface CharCollectionadd in class AbstractCharCollectionCollection.add(Object)public boolean remove(char k)
CharSetNote that the corresponding method of the type-specific collection is rem(). This unfortunate situation is caused by the clash with the similarly named index-based method in the
List interface.
remove in interface CharSetremove in class AbstractCharSetCollection.remove(Object)public boolean contains(char k)
contains in interface CharCollectioncontains in class AbstractCharCollectionCollection.contains(Object)public void clear()
clear in interface Collection<Character>clear in interface Set<Character>clear in class AbstractCollection<Character>public int size()
size in interface Collection<Character>size in interface Set<Character>size in class AbstractCollection<Character>public boolean isEmpty()
isEmpty in interface Collection<Character>isEmpty in interface Set<Character>isEmpty in class AbstractCharCollectionpublic char firstChar()
firstChar in interface CharSortedSetSortedSet.first()public char lastChar()
lastChar in interface CharSortedSetSortedSet.last()public CharBidirectionalIterator iterator()
CharCollectionNote 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 CharCollectioniterator in interface CharIterableiterator in interface CharSetiterator in interface CharSortedSetiterator in interface Iterable<Character>iterator in interface Collection<Character>iterator in interface Set<Character>iterator in class AbstractCharSortedSetpublic 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()
CharSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
comparator in interface CharSortedSetcomparator in interface SortedSet<Character>SortedSet.comparator()public CharSortedSet headSet(char to)
headSet in interface CharSortedSetSortedSet.headSet(Object)public CharSortedSet tailSet(char from)
tailSet in interface CharSortedSetSortedSet.tailSet(Object)public CharSortedSet subSet(char from, char to)
subSet in interface CharSortedSetSortedSet.subSet(Object,Object)