public class FloatAVLTreeSet 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.
| Constructor and Description |
|---|
FloatAVLTreeSet()
Creates a new empty tree set.
|
FloatAVLTreeSet(Collection<? extends Float> c)
Creates a new tree set copying a given set.
|
FloatAVLTreeSet(Comparator<? super Float> c)
Creates a new empty tree set with the given comparator.
|
FloatAVLTreeSet(float[] a)
Creates a new tree set copying the elements of an array.
|
FloatAVLTreeSet(float[] a,
Comparator<? super Float> c)
Creates a new tree set copying the elements of an array using a given
Comparator. |
FloatAVLTreeSet(float[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
FloatAVLTreeSet(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. |
FloatAVLTreeSet(FloatCollection c)
Creates a new tree set copying a given type-specific collection.
|
FloatAVLTreeSet(FloatIterator i)
Creates a new tree set using elements provided by a type-specific iterator.
|
FloatAVLTreeSet(FloatSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator). |
FloatAVLTreeSet(Iterator<? extends Float> i)
Creates a new tree set using elements provided by an iterator.
|
FloatAVLTreeSet(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) |
void |
clear() |
Object |
clone()
Returns a deep copy of this tree set.
|
FloatComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
boolean |
contains(float k) |
float |
firstFloat() |
FloatSortedSet |
headSet(float to) |
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() |
boolean |
remove(float k)
Removes an element from this set.
|
int |
size() |
FloatSortedSet |
subSet(float from,
float to) |
FloatSortedSet |
tailSet(float from) |
first, floatIterator, headSet, last, subSet, tailSetequals, hashCode, rem, removeadd, addAll, addAll, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toFloatArray, toFloatArray, toStringfloatIterator, headSet, subSet, tailSetaddAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toFloatArray, toFloatArraypublic FloatAVLTreeSet()
public FloatAVLTreeSet(Comparator<? super Float> c)
c - a Comparator (even better, a type-specific comparator).public FloatAVLTreeSet(Collection<? extends Float> c)
c - a collection to be copied into the new tree set.public FloatAVLTreeSet(SortedSet<Float> s)
Comparator).s - a SortedSet to be copied into the new tree set.public FloatAVLTreeSet(FloatCollection c)
c - a type-specific collection to be copied into the new tree set.public FloatAVLTreeSet(FloatSortedSet s)
Comparator).s - a type-specific sorted set to be copied into the new tree set.public FloatAVLTreeSet(FloatIterator i)
i - a type-specific iterator whose elements will fill the set.public FloatAVLTreeSet(Iterator<? extends Float> i)
i - an iterator whose elements will fill the set.public FloatAVLTreeSet(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 FloatAVLTreeSet(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 FloatAVLTreeSet(float[] a)
a - an array to be copied into the new tree set.public FloatAVLTreeSet(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)
add in interface FloatCollectionadd in class AbstractFloatCollectionCollection.add(Object)public boolean remove(float k)
FloatSetNote 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 FloatSetremove in class AbstractFloatSetCollection.remove(Object)public boolean contains(float k)
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 AbstractFloatCollectionpublic float firstFloat()
firstFloat in interface FloatSortedSetSortedSet.first()public float lastFloat()
lastFloat 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 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 AbstractFloatSortedSetpublic 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>SortedSet.comparator()public 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)