|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObjectCollection
it.unimi.dsi.fastutil.objects.AbstractObjectSet
it.unimi.dsi.fastutil.objects.AbstractObjectSortedSet
it.unimi.dsi.fastutil.objects.ObjectRBTreeSet
A type-specific red-black 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 | |
ObjectRBTreeSet()
Creates a new empty tree set. |
|
ObjectRBTreeSet(Collection c)
Creates a new tree set copying a given collection. |
|
ObjectRBTreeSet(Comparator c)
Creates a new empty tree set with the given comparator. |
|
ObjectRBTreeSet(Iterator i)
Creates a new tree set using elements provided by an iterator. |
|
ObjectRBTreeSet(Object[] a)
Creates a new tree set copying the elements of an array. |
|
ObjectRBTreeSet(Object[] a,
Comparator c)
Creates a new tree set copying the elements of an array using a given Comparator . |
|
ObjectRBTreeSet(Object[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array. |
|
ObjectRBTreeSet(Object[] a,
int offset,
int length,
Comparator c)
Creates a new tree set and fills it with the elements of a given array using a given Comparator . |
|
ObjectRBTreeSet(ObjectCollection c)
Creates a new tree set copying a given type-specific collection. |
|
ObjectRBTreeSet(ObjectIterator i)
Creates a new tree set using elements provided by a type-specific iterator. |
|
ObjectRBTreeSet(ObjectSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its Comparator ). |
|
ObjectRBTreeSet(SortedSet s)
Creates a new tree set copying a given sorted set (and its Comparator ). |
Method Summary | |
boolean |
add(Object k)
|
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree set. |
Comparator |
comparator()
|
boolean |
contains(Object k)
|
Object |
first()
Delegates to the corresponding type-specific method. |
SortedSet |
headSet(Object to)
Delegates to the corresponding type-specific method. |
boolean |
isEmpty()
|
ObjectBidirectionalIterator |
iterator(Object from)
Returns a type-specific BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation).
|
Object |
last()
Delegates to the corresponding type-specific method. |
ObjectIterator |
objectIterator()
Returns a type-specific iterator on the collection. |
boolean |
remove(Object k)
Note that the corresponding method of the type-specific collection is rem() .
|
int |
size()
|
SortedSet |
subSet(Object from,
Object to)
Delegates to the corresponding type-specific method. |
SortedSet |
tailSet(Object from)
Delegates to the corresponding type-specific method. |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectSet |
equals, hashCode, rem |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectCollection |
addAll, containsAll, iterator, removeAll, retainAll, toArray, toArray, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Set |
addAll, containsAll, equals, hashCode, iterator, removeAll, retainAll, toArray, toArray |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public ObjectRBTreeSet()
public ObjectRBTreeSet(Comparator c)
c
- a Comparator
(even better, a type-specific comparator).public ObjectRBTreeSet(Collection c)
c
- a collection to be copied into the new tree set.public ObjectRBTreeSet(SortedSet s)
Comparator
).
s
- a SortedSet
to be copied into the new tree set.public ObjectRBTreeSet(ObjectCollection c)
c
- a type-specific collection to be copied into the new tree set.public ObjectRBTreeSet(ObjectSortedSet s)
Comparator
).
s
- a type-specific sorted set to be copied into the new tree set.public ObjectRBTreeSet(ObjectIterator i)
i
- a type-specific iterator whose elements will fill the set.public ObjectRBTreeSet(Iterator i)
i
- an iterator whose elements will fill the set.public ObjectRBTreeSet(Object[] a, int offset, int length, Comparator 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 ObjectRBTreeSet(Object[] 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 ObjectRBTreeSet(Object[] a)
a
- an array to be copied into the new tree set.public ObjectRBTreeSet(Object[] 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 boolean add(Object k)
add
in interface Set
add
in class AbstractObjectCollection
public boolean remove(Object k)
ObjectSet
rem()
.
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List
interface.
remove
in interface ObjectSet
remove
in class AbstractObjectSet
public boolean contains(Object k)
contains
in interface Set
public void clear()
clear
in interface Set
clear
in class AbstractObjectCollection
public int size()
size
in interface Set
public boolean isEmpty()
isEmpty
in interface Set
isEmpty
in class AbstractObjectCollection
public Object first()
AbstractObjectSortedSet
first
in interface SortedSet
first
in class AbstractObjectSortedSet
public Object last()
AbstractObjectSortedSet
last
in interface SortedSet
last
in class AbstractObjectSortedSet
public ObjectIterator objectIterator()
ObjectCollection
The iterator returned by the Collection.iterator()
method and by this
method are identical; however, using this method you can save a type casting.
objectIterator
in interface ObjectCollection
Collection.iterator()
public ObjectBidirectionalIterator iterator(Object from)
ObjectSortedSet
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 ObjectSortedSet
iterator
in class AbstractObjectSet
public Comparator comparator()
comparator
in interface SortedSet
public SortedSet headSet(Object to)
AbstractObjectSortedSet
headSet
in interface SortedSet
headSet
in class AbstractObjectSortedSet
public SortedSet tailSet(Object from)
AbstractObjectSortedSet
tailSet
in interface SortedSet
tailSet
in class AbstractObjectSortedSet
public SortedSet subSet(Object from, Object to)
AbstractObjectSortedSet
subSet
in interface SortedSet
subSet
in class AbstractObjectSortedSet
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 |