public class FloatRBTreeSet extends AbstractFloatSortedSet implements Serializable, Cloneable, FloatSortedSet
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.
| Modifier and Type | Field and Description |
|---|---|
protected FloatComparator |
actualComparator
This set's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of elements in this set.
|
protected it.unimi.dsi.fastutil.floats.FloatRBTreeSet.Entry |
firstEntry
The entry of the first element of this set.
|
protected it.unimi.dsi.fastutil.floats.FloatRBTreeSet.Entry |
lastEntry
The entry of the last element of this set.
|
protected Comparator<? super Float> |
storedComparator
This set's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.floats.FloatRBTreeSet.Entry |
tree
A reference to the root entry.
|
| Constructor and Description |
|---|
FloatRBTreeSet()
Creates a new empty tree set.
|
FloatRBTreeSet(Collection<? extends Float> c)
Creates a new tree set copying a given collection.
|
FloatRBTreeSet(Comparator<? super Float> 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<? super Float> 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<? super Float> 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<Float> s)
Creates a new tree set copying a given sorted set (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(float k)
Ensures that this collection contains the specified element (optional operation).
|
void |
clear() |
Object |
clone()
Returns a deep copy of this tree set.
|
FloatComparator |
comparator() |
boolean |
contains(float k)
Returns
true if this collection contains the specified element. |
float |
firstFloat()
Returns the first (lowest) element currently in this set.
|
FloatSortedSet |
headSet(float to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
boolean |
isEmpty() |
FloatBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
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()
Returns the last (highest) element currently in this set.
|
boolean |
remove(float k)
Removes an element from this set.
|
int |
size() |
FloatSortedSet |
subSet(float from,
float to)
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
FloatSortedSet |
tailSet(float from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
equals, hashCode, remadd, addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toFloatArray, toFloatArray, toStringaddAll, containsAll, removeAll, retainAll, toArray, toArrayfinalize, getClass, notify, notifyAll, wait, wait, waitfirst, headSet, last, subSet, tailSetaddAll, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toFloatArray, toFloatArrayforEach, forEachspliteratoraddAll, containsAll, equals, hashCode, removeAll, retainAll, toArray, toArrayparallelStream, streamprotected transient it.unimi.dsi.fastutil.floats.FloatRBTreeSet.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.floats.FloatRBTreeSet.Entry firstEntry
protected transient it.unimi.dsi.fastutil.floats.FloatRBTreeSet.Entry lastEntry
protected Comparator<? super Float> storedComparator
protected transient FloatComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public FloatRBTreeSet()
public FloatRBTreeSet(Comparator<? super Float> c)
c - a Comparator (even better, a type-specific comparator).public FloatRBTreeSet(Collection<? extends Float> c)
c - a collection to be copied into the new tree set.public FloatRBTreeSet(SortedSet<Float> 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<? super Float> 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<? super Float> 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(float k)
AbstractFloatCollectionThis implementation always throws an UnsupportedOperationException.
add in interface FloatCollectionadd in class AbstractFloatCollectionCollection.add(Object)public boolean remove(float k)
AbstractFloatSetNote 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 FloatSetremove in class AbstractFloatSetCollection.remove(Object)public boolean contains(float k)
AbstractFloatCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface FloatCollectioncontains in class AbstractFloatCollectionCollection.contains(Object)public void clear()
clear in interface Collection<Float>clear in interface Set<Float>clear in class AbstractCollection<Float>public int size()
size in interface Collection<Float>size in interface Set<Float>size in class AbstractCollection<Float>public boolean isEmpty()
isEmpty in interface Collection<Float>isEmpty in interface Set<Float>isEmpty in class AbstractCollection<Float>public float firstFloat()
FloatSortedSetfirstFloat in interface FloatSortedSetSortedSet.first()public float lastFloat()
FloatSortedSetlastFloat in interface FloatSortedSetSortedSet.last()public FloatBidirectionalIterator iterator()
FloatCollectionNote 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 FloatBidirectionalIterableiterator in interface FloatCollectioniterator in interface FloatIterableiterator in interface FloatSetiterator in interface FloatSortedSetiterator in interface Iterable<Float>iterator in interface Collection<Float>iterator in interface Set<Float>iterator in class AbstractFloatSortedSetIterable.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 FloatSortedSetfrom - an element to start from.public FloatComparator comparator()
FloatSortedSetNote that this specification strengthens the one given in SortedSet.comparator().
comparator in interface FloatSortedSetcomparator in interface SortedSet<Float>public FloatSortedSet headSet(float to)
FloatSortedSettoElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
headSet in interface FloatSortedSetSortedSet.headSet(Object)public FloatSortedSet tailSet(float from)
FloatSortedSetfromElement.
Note that this specification strengthens the one given in SortedSet.headSet(Object).
tailSet in interface FloatSortedSetSortedSet.tailSet(Object)public FloatSortedSet subSet(float from, float to)
FloatSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object).
subSet in interface FloatSortedSetSortedSet.subSet(Object,Object)Copyright © 2020. All rights reserved.