|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractCharCollection
it.unimi.dsi.fastutil.chars.AbstractCharSet
it.unimi.dsi.fastutil.chars.CharAVLTreeSet
A type-specific AVL tree set with a fast, small-footprint implementation.
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.
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
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 c)
Creates a new tree set copying the elements of an 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 c)
Creates a new tree set copying a given set. |
|
CharAVLTreeSet(Comparator 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 s)
Creates a new tree set copying a given sorted set (and its Comparator ). |
Method Summary | |
boolean |
add(char k)
|
CharIterator |
charIterator()
Returns a type-specific iterator on the collection. |
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree set. |
Comparator |
comparator()
|
boolean |
contains(char k)
|
Object |
first()
|
char |
firstChar()
|
CharSortedSet |
headSet(char to)
|
SortedSet |
headSet(Object oto)
|
boolean |
isEmpty()
|
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). |
Object |
last()
|
char |
lastChar()
|
boolean |
remove(char k)
|
int |
size()
|
CharSortedSet |
subSet(char from,
char to)
|
SortedSet |
subSet(Object ofrom,
Object oto)
|
CharSortedSet |
tailSet(char from)
|
SortedSet |
tailSet(Object ofrom)
|
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractCharSet |
equals, hashCode |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractCharCollection |
add, addAll, addAll, contains, containsAll, containsAll, iterator, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toCharArray, toCharArray, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Set |
add, addAll, contains, containsAll, equals, hashCode, iterator, remove, removeAll, retainAll, toArray, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.chars.CharCollection |
addAll, containsAll, removeAll, retainAll, toArray, toCharArray, toCharArray |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public CharAVLTreeSet()
public CharAVLTreeSet(Comparator c)
c
- a Comparator
(even better, a type-specific comparator).public CharAVLTreeSet(Collection c)
c
- a collection to be copied into the new tree set.public CharAVLTreeSet(SortedSet 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)
a
- an array to be copied into the new tree set.public CharAVLTreeSet(char[] a, Comparator c)
Comparator
.
a
- an array to be copied into the new tree set.c
- a Comparator
(even better, a type-specific comparator).Method Detail |
public final boolean add(char k)
add
in interface CharCollection
add
in class AbstractCharCollection
public final boolean remove(char k)
remove
in interface CharCollection
remove
in class AbstractCharCollection
public boolean contains(char k)
contains
in interface CharCollection
Collection.contains(Object)
public void clear()
clear
in interface Set
public int size()
size
in interface Set
public boolean isEmpty()
isEmpty
in interface Set
isEmpty
in class AbstractCharCollection
public char firstChar()
firstChar
in interface CharSortedSet
SortedSet.first()
public char lastChar()
lastChar
in interface CharSortedSet
SortedSet.last()
public Object first()
first
in interface SortedSet
public Object last()
last
in interface SortedSet
public CharIterator charIterator()
CharCollection
The iterator returned by the Collection.iterator()
method and by this
method are identical; however, using this method you can save a type casting.
charIterator
in interface CharCollection
Collection.iterator()
public CharBidirectionalIterator iterator(char from)
CharSortedSet
BidirectionalIterator
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 CharSortedSet
iterator
in class AbstractCharSet
public Comparator comparator()
comparator
in interface SortedSet
public CharSortedSet headSet(char to)
headSet
in interface CharSortedSet
SortedSet.headSet(Object)
public CharSortedSet tailSet(char from)
tailSet
in interface CharSortedSet
SortedSet.tailSet(Object)
public CharSortedSet subSet(char from, char to)
subSet
in interface CharSortedSet
SortedSet.subSet(Object,Object)
public SortedSet headSet(Object oto)
headSet
in interface SortedSet
public SortedSet tailSet(Object ofrom)
tailSet
in interface SortedSet
public SortedSet subSet(Object ofrom, Object oto)
subSet
in interface SortedSet
public 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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |