Class FloatRBTreeSet
- java.lang.Object
-
- java.util.AbstractCollection<Float>
-
- it.unimi.dsi.fastutil.floats.AbstractFloatCollection
-
- it.unimi.dsi.fastutil.floats.AbstractFloatSet
-
- it.unimi.dsi.fastutil.floats.AbstractFloatSortedSet
-
- it.unimi.dsi.fastutil.floats.FloatRBTreeSet
-
- All Implemented Interfaces:
FloatBidirectionalIterable,FloatCollection,FloatIterable,FloatSet,FloatSortedSet,Serializable,Cloneable,Iterable<Float>,Collection<Float>,Set<Float>,SortedSet<Float>
public class FloatRBTreeSet extends AbstractFloatSortedSet implements Serializable, Cloneable, FloatSortedSet
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 byiterator()can be safely cast to a type-specific list iterator.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description FloatRBTreeSet()Creates a new empty tree set.FloatRBTreeSet(float[] a)Creates a new tree set copying the elements of an array.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 givenComparator.FloatRBTreeSet(float[] a, Comparator<? super Float> c)Creates a new tree set copying the elements of an array using a givenComparator.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 itsComparator).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(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 itsComparator).
-
Method Summary
Modifier and Type Method Description booleanadd(float k)Ensures that this collection contains the specified element (optional operation).voidclear()Objectclone()Returns a deep copy of this tree set.FloatComparatorcomparator()booleancontains(float k)Returnstrueif this collection contains the specified element.floatfirstFloat()Returns the first (lowest) element currently in this set.FloatSortedSetheadSet(float to)Returns a view of the portion of this sorted set whose elements are strictly less thantoElement.booleanisEmpty()FloatBidirectionalIteratoriterator()Returns a type-specific iterator on the elements of this collection.FloatBidirectionalIteratoriterator(float from)Returns a type-specificBidirectionalIteratoron the elements in this set, starting from a given element of the domain (optional operation).floatlastFloat()Returns the last (highest) element currently in this set.booleanremove(float k)Removes an element from this set.intsize()FloatSortedSetsubSet(float from, float to)Returns a view of the portion of this sorted set whose elements range fromfromElement, inclusive, totoElement, exclusive.FloatSortedSettailSet(float from)Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement.-
Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatSet
equals, hashCode, rem
-
Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatCollection
add, addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toFloatArray, toFloatArray, toString
-
Methods inherited from class java.util.AbstractCollection
addAll, containsAll, removeAll, retainAll, toArray, toArray
-
Methods inherited from interface java.util.Collection
parallelStream, stream, toArray
-
Methods inherited from interface it.unimi.dsi.fastutil.floats.FloatCollection
addAll, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toFloatArray, toFloatArray
-
Methods inherited from interface it.unimi.dsi.fastutil.floats.FloatIterable
forEach, forEach
-
Methods inherited from interface it.unimi.dsi.fastutil.floats.FloatSortedSet
first, headSet, last, subSet, tailSet
-
Methods inherited from interface java.util.Set
add, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArray
-
Methods inherited from interface java.util.SortedSet
spliterator
-
-
-
-
Constructor Detail
-
FloatRBTreeSet
public FloatRBTreeSet()
Creates a new empty tree set.
-
FloatRBTreeSet
public FloatRBTreeSet(Comparator<? super Float> c)
Creates a new empty tree set with the given comparator.- Parameters:
c- aComparator(even better, a type-specific comparator).
-
FloatRBTreeSet
public FloatRBTreeSet(Collection<? extends Float> c)
Creates a new tree set copying a given collection.- Parameters:
c- a collection to be copied into the new tree set.
-
FloatRBTreeSet
public FloatRBTreeSet(SortedSet<Float> s)
Creates a new tree set copying a given sorted set (and itsComparator).- Parameters:
s- aSortedSetto be copied into the new tree set.
-
FloatRBTreeSet
public FloatRBTreeSet(FloatCollection c)
Creates a new tree set copying a given type-specific collection.- Parameters:
c- a type-specific collection to be copied into the new tree set.
-
FloatRBTreeSet
public FloatRBTreeSet(FloatSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and itsComparator).- Parameters:
s- a type-specific sorted set to be copied into the new tree set.
-
FloatRBTreeSet
public FloatRBTreeSet(FloatIterator i)
Creates a new tree set using elements provided by a type-specific iterator.- Parameters:
i- a type-specific iterator whose elements will fill the set.
-
FloatRBTreeSet
public FloatRBTreeSet(Iterator<?> i)
Creates a new tree set using elements provided by an iterator.- Parameters:
i- an iterator whose elements will fill the set.
-
FloatRBTreeSet
public 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 givenComparator.- Parameters:
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- aComparator(even better, a type-specific comparator).
-
FloatRBTreeSet
public FloatRBTreeSet(float[] a, int offset, int length)Creates a new tree set and fills it with the elements of a given array.- Parameters:
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.
-
FloatRBTreeSet
public FloatRBTreeSet(float[] a)
Creates a new tree set copying the elements of an array.- Parameters:
a- an array to be copied into the new tree set.
-
FloatRBTreeSet
public FloatRBTreeSet(float[] a, Comparator<? super Float> c)Creates a new tree set copying the elements of an array using a givenComparator.- Parameters:
a- an array to be copied into the new tree set.c- aComparator(even better, a type-specific comparator).
-
-
Method Detail
-
add
public boolean add(float k)
Description copied from class:AbstractFloatCollectionEnsures that this collection contains the specified element (optional operation).This implementation always throws an
UnsupportedOperationException.- Specified by:
addin interfaceFloatCollection- Overrides:
addin classAbstractFloatCollection- See Also:
Collection.add(Object)
-
remove
public boolean remove(float k)
Description copied from class:AbstractFloatSetRemoves an element from this set.Note 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 theListinterface. Delegates to the type-specificrem()method implemented by type-specific abstractCollectionsuperclass.- Specified by:
removein interfaceFloatSet- Overrides:
removein classAbstractFloatSet- See Also:
Collection.remove(Object)
-
contains
public boolean contains(float k)
Description copied from class:AbstractFloatCollectionReturnstrueif this collection contains the specified element.This implementation iterates over the elements in the collection, looking for the specified element.
- Specified by:
containsin interfaceFloatCollection- Overrides:
containsin classAbstractFloatCollection- See Also:
Collection.contains(Object)
-
clear
public void clear()
- Specified by:
clearin interfaceCollection<Float>- Specified by:
clearin interfaceSet<Float>- Overrides:
clearin classAbstractCollection<Float>
-
size
public int size()
- Specified by:
sizein interfaceCollection<Float>- Specified by:
sizein interfaceSet<Float>- Specified by:
sizein classAbstractCollection<Float>
-
isEmpty
public boolean isEmpty()
- Specified by:
isEmptyin interfaceCollection<Float>- Specified by:
isEmptyin interfaceSet<Float>- Overrides:
isEmptyin classAbstractCollection<Float>
-
firstFloat
public float firstFloat()
Description copied from interface:FloatSortedSetReturns the first (lowest) element currently in this set.- Specified by:
firstFloatin interfaceFloatSortedSet- See Also:
SortedSet.first()
-
lastFloat
public float lastFloat()
Description copied from interface:FloatSortedSetReturns the last (highest) element currently in this set.- Specified by:
lastFloatin interfaceFloatSortedSet- See Also:
SortedSet.last()
-
iterator
public FloatBidirectionalIterator iterator()
Description copied from interface:FloatCollectionReturns a type-specific iterator on the elements of this collection.Note 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 extendsCollection.- Specified by:
iteratorin interfaceCollection<Float>- Specified by:
iteratorin interfaceFloatBidirectionalIterable- Specified by:
iteratorin interfaceFloatCollection- Specified by:
iteratorin interfaceFloatIterable- Specified by:
iteratorin interfaceFloatSet- Specified by:
iteratorin interfaceFloatSortedSet- Specified by:
iteratorin interfaceIterable<Float>- Specified by:
iteratorin interfaceSet<Float>- Specified by:
iteratorin classAbstractFloatSortedSet- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
iterator
public FloatBidirectionalIterator iterator(float from)
Description copied from interface:FloatSortedSetReturns a type-specificBidirectionalIteratoron 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 returnfalse). 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 returnfalse).Note that passing the last element of the set as starting point and calling
previous()you can traverse the entire set in reverse order.- Specified by:
iteratorin interfaceFloatSortedSet- Parameters:
from- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
public FloatComparator comparator()
Description copied from interface:FloatSortedSetNote that this specification strengthens the one given in
SortedSet.comparator().- Specified by:
comparatorin interfaceFloatSortedSet- Specified by:
comparatorin interfaceSortedSet<Float>
-
headSet
public FloatSortedSet headSet(float to)
Description copied from interface:FloatSortedSetReturns a view of the portion of this sorted set whose elements are strictly less thantoElement.Note that this specification strengthens the one given in
SortedSet.headSet(Object).- Specified by:
headSetin interfaceFloatSortedSet- See Also:
SortedSet.headSet(Object)
-
tailSet
public FloatSortedSet tailSet(float from)
Description copied from interface:FloatSortedSetReturns a view of the portion of this sorted set whose elements are greater than or equal tofromElement.Note that this specification strengthens the one given in
SortedSet.headSet(Object).- Specified by:
tailSetin interfaceFloatSortedSet- See Also:
SortedSet.tailSet(Object)
-
subSet
public FloatSortedSet subSet(float from, float to)
Description copied from interface:FloatSortedSetReturns a view of the portion of this sorted set whose elements range fromfromElement, inclusive, totoElement, exclusive.Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).- Specified by:
subSetin interfaceFloatSortedSet- See Also:
SortedSet.subSet(Object,Object)
-
clone
public Object clone()
Returns a deep copy of this tree set.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.
- Returns:
- a deep copy of this tree set.
-
-