|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.floats.AbstractFloatCollection
it.unimi.dsi.fastutil.floats.AbstractFloatSet
it.unimi.dsi.fastutil.floats.AbstractFloatSortedSet
it.unimi.dsi.fastutil.floats.FloatRBTreeSet
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 | |
FloatRBTreeSet()
Creates a new empty tree set. |
|
FloatRBTreeSet(Collection c)
Creates a new tree set copying a given collection. |
|
FloatRBTreeSet(Comparator c)
Creates a new empty tree set with the given comparator. |
|
FloatRBTreeSet(float[] a)
Creates a new tree set copying the elements of an array. |
|
FloatRBTreeSet(float[] a,
Comparator c)
Creates a new tree set copying the elements of an array using a given Comparator. |
|
FloatRBTreeSet(float[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array. |
|
FloatRBTreeSet(float[] 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. |
|
FloatRBTreeSet(FloatCollection c)
Creates a new tree set copying a given type-specific collection. |
|
FloatRBTreeSet(FloatIterator i)
Creates a new tree set using elements provided by a type-specific iterator. |
|
FloatRBTreeSet(FloatSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its Comparator). |
|
FloatRBTreeSet(Iterator i)
Creates a new tree set using elements provided by an iterator. |
|
FloatRBTreeSet(SortedSet s)
Creates a new tree set copying a given sorted set (and its Comparator). |
|
| Method Summary | |
boolean |
add(float k)
|
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree set. |
Comparator |
comparator()
|
boolean |
contains(float k)
|
float |
firstFloat()
|
FloatIterator |
floatIterator()
Returns a type-specific iterator on the collection. |
FloatSortedSet |
headSet(float to)
|
boolean |
isEmpty()
|
FloatBidirectionalIterator |
iterator(float from)
Returns a type-specific BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation).
|
float |
lastFloat()
|
boolean |
remove(float k)
Note that the corresponding method of the type-specific collection is rem().
|
int |
size()
|
FloatSortedSet |
subSet(float from,
float to)
|
FloatSortedSet |
tailSet(float from)
|
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatSortedSet |
first, headSet, last, subSet, tailSet |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatSet |
equals, hashCode, rem, remove |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatCollection |
add, addAll, addAll, contains, containsAll, containsAll, iterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toFloatArray, toFloatArray, 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.floats.FloatCollection |
addAll, containsAll, rem, removeAll, retainAll, toArray, toFloatArray, toFloatArray |
| Methods inherited from interface java.util.SortedSet |
first, headSet, last, subSet, tailSet |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public FloatRBTreeSet()
public FloatRBTreeSet(Comparator c)
c - a Comparator (even better, a type-specific comparator).public FloatRBTreeSet(Collection c)
c - a collection to be copied into the new tree set.public FloatRBTreeSet(SortedSet s)
Comparator).
s - a SortedSet to be copied into the new tree set.public FloatRBTreeSet(FloatCollection c)
c - a type-specific collection to be copied into the new tree set.public FloatRBTreeSet(FloatSortedSet s)
Comparator).
s - a type-specific sorted set to be copied into the new tree set.public FloatRBTreeSet(FloatIterator i)
i - a type-specific iterator whose elements will fill the set.public FloatRBTreeSet(Iterator i)
i - an iterator whose elements will fill the set.
public FloatRBTreeSet(float[] 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 FloatRBTreeSet(float[] 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 FloatRBTreeSet(float[] a)
a - an array to be copied into the new tree set.
public FloatRBTreeSet(float[] 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(float k)
add in interface FloatCollectionadd in class AbstractFloatCollectionpublic final boolean remove(float k)
FloatSetrem().
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List interface.
remove in interface FloatSetremove in class AbstractFloatSetpublic boolean contains(float k)
contains in interface FloatCollectionCollection.contains(Object)public void clear()
clear in interface Setclear in class AbstractFloatCollectionpublic int size()
size in interface Setpublic boolean isEmpty()
isEmpty in interface SetisEmpty in class AbstractFloatCollectionpublic float firstFloat()
firstFloat in interface FloatSortedSetSortedSet.first()public float lastFloat()
lastFloat in interface FloatSortedSetSortedSet.last()public FloatIterator floatIterator()
FloatCollectionThe iterator returned by the Collection.iterator() method and by this
method are identical; however, using this method you can save a type casting.
floatIterator in interface FloatCollectionCollection.iterator()public FloatBidirectionalIterator iterator(float from)
FloatSortedSetBidirectionalIterator 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 FloatSortedSetiterator in class AbstractFloatSetpublic Comparator comparator()
comparator in interface SortedSetpublic FloatSortedSet headSet(float to)
headSet in interface FloatSortedSetSortedSet.headSet(Object)public FloatSortedSet tailSet(float from)
tailSet in interface FloatSortedSetSortedSet.tailSet(Object)
public FloatSortedSet subSet(float from,
float to)
subSet in interface FloatSortedSetSortedSet.subSet(Object,Object)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 | |||||||||