Class DoubleAVLTreeSet
- All Implemented Interfaces:
DoubleBidirectionalIterable
,DoubleCollection
,DoubleIterable
,DoubleSet
,DoubleSortedSet
,Serializable
,Cloneable
,Iterable<Double>
,Collection<Double>
,SequencedCollection<Double>
,SequencedSet<Double>
,Set<Double>
,SortedSet<Double>
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.
- See Also:
-
Constructor Summary
ConstructorDescriptionCreates a new empty tree set.DoubleAVLTreeSet
(double[] a) Creates a new tree set copying the elements of an array.DoubleAVLTreeSet
(double[] a, int offset, int length) Creates a new tree set and fills it with the elements of a given array.DoubleAVLTreeSet
(double[] a, int offset, int length, Comparator<? super Double> c) Creates a new tree set and fills it with the elements of a given array using a givenComparator
.DoubleAVLTreeSet
(double[] a, Comparator<? super Double> c) Creates a new tree set copying the elements of an array using a givenComparator
.Creates a new tree set copying a given type-specific collection.Creates a new tree set using elements provided by a type-specific iterator.Creates a new tree set copying a given type-specific sorted set (and itsComparator
).DoubleAVLTreeSet
(Collection<? extends Double> c) Creates a new tree set copying a given set.DoubleAVLTreeSet
(Comparator<? super Double> c) Creates a new empty tree set with the given comparator.DoubleAVLTreeSet
(Iterator<?> i) Creates a new tree set using elements provided by an iterator.Creates a new tree set copying a given sorted set (and itsComparator
). -
Method Summary
Modifier and TypeMethodDescriptionboolean
add
(double k) Ensures that this collection contains the specified element (optional operation).void
clear()
clone()
Returns a deep copy of this tree set.boolean
contains
(double k) Returnstrue
if this collection contains the specified element.double
Returns the first (lowest) element currently in this set.headSet
(double to) Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.boolean
isEmpty()
iterator()
Returns a type-specific iterator on the elements of this collection.iterator
(double from) Returns a type-specificBidirectionalIterator
on the elements in this set, starting from a given element of the domain (optional operation).double
Returns the last (highest) element currently in this set.boolean
remove
(double k) Removes an element from this set.int
size()
subSet
(double from, double to) Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.tailSet
(double 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.doubles.AbstractDoubleSet
equals, hashCode, rem
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
add, addAll, addAll, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toArray, toDoubleArray, toDoubleArray, toString
Methods inherited from class java.util.AbstractCollection
toArray, toArray
Methods inherited from interface java.util.Collection
toArray
Methods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleCollection
addAll, containsAll, doubleIterator, doubleParallelStream, doubleSpliterator, doubleStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toDoubleArray, toDoubleArray
Methods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleIterable
forEach, forEach, forEach
Methods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleSortedSet
first, headSet, last, spliterator, 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
addFirst, addLast, getFirst, getLast, removeFirst, removeLast, reversed
-
Constructor Details
-
DoubleAVLTreeSet
public DoubleAVLTreeSet()Creates a new empty tree set. -
DoubleAVLTreeSet
Creates a new empty tree set with the given comparator.- Parameters:
c
- aComparator
(even better, a type-specific comparator).
-
DoubleAVLTreeSet
Creates a new tree set copying a given set.- Parameters:
c
- a collection to be copied into the new tree set.
-
DoubleAVLTreeSet
Creates a new tree set copying a given sorted set (and itsComparator
).- Parameters:
s
- aSortedSet
to be copied into the new tree set.
-
DoubleAVLTreeSet
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.
-
DoubleAVLTreeSet
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.
-
DoubleAVLTreeSet
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.
-
DoubleAVLTreeSet
Creates a new tree set using elements provided by an iterator.- Parameters:
i
- an iterator whose elements will fill the set.
-
DoubleAVLTreeSet
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).
-
DoubleAVLTreeSet
public DoubleAVLTreeSet(double[] 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.
-
DoubleAVLTreeSet
public DoubleAVLTreeSet(double[] a) Creates a new tree set copying the elements of an array.- Parameters:
a
- an array to be copied into the new tree set.
-
DoubleAVLTreeSet
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 Details
-
add
public boolean add(double k) Description copied from class:AbstractDoubleCollection
Ensures that this collection contains the specified element (optional operation).- Specified by:
add
in interfaceDoubleCollection
- Overrides:
add
in classAbstractDoubleCollection
- See Also:
-
remove
public boolean remove(double k) Description copied from class:AbstractDoubleSet
Removes an element from this set. Delegates to the type-specificrem()
method implemented by type-specific abstractCollection
superclass.- Specified by:
remove
in interfaceDoubleSet
- Overrides:
remove
in classAbstractDoubleSet
- See Also:
-
contains
public boolean contains(double k) Description copied from class:AbstractDoubleCollection
Returnstrue
if this collection contains the specified element.- Specified by:
contains
in interfaceDoubleCollection
- Overrides:
contains
in classAbstractDoubleCollection
- See Also:
-
clear
public void clear()- Specified by:
clear
in interfaceCollection<Double>
- Specified by:
clear
in interfaceSet<Double>
- Overrides:
clear
in classAbstractCollection<Double>
-
size
public int size()- Specified by:
size
in interfaceCollection<Double>
- Specified by:
size
in interfaceSet<Double>
- Specified by:
size
in classAbstractCollection<Double>
-
isEmpty
public boolean isEmpty()- Specified by:
isEmpty
in interfaceCollection<Double>
- Specified by:
isEmpty
in interfaceSet<Double>
- Overrides:
isEmpty
in classAbstractCollection<Double>
-
firstDouble
public double firstDouble()Description copied from interface:DoubleSortedSet
Returns the first (lowest) element currently in this set.- Specified by:
firstDouble
in interfaceDoubleSortedSet
- See Also:
-
lastDouble
public double lastDouble()Description copied from interface:DoubleSortedSet
Returns the last (highest) element currently in this set.- Specified by:
lastDouble
in interfaceDoubleSortedSet
- See Also:
-
iterator
Description copied from interface:DoubleCollection
Returns a type-specific iterator on the elements of this collection.- Specified by:
iterator
in interfaceCollection<Double>
- Specified by:
iterator
in interfaceDoubleBidirectionalIterable
- Specified by:
iterator
in interfaceDoubleCollection
- Specified by:
iterator
in interfaceDoubleIterable
- Specified by:
iterator
in interfaceDoubleSet
- Specified by:
iterator
in interfaceDoubleSortedSet
- Specified by:
iterator
in interfaceIterable<Double>
- Specified by:
iterator
in interfaceSet<Double>
- Specified by:
iterator
in classAbstractDoubleSortedSet
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
-
iterator
Description copied from interface:DoubleSortedSet
Returns a type-specificBidirectionalIterator
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 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:
iterator
in interfaceDoubleSortedSet
- Parameters:
from
- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
Description copied from interface:DoubleSortedSet
- Specified by:
comparator
in interfaceDoubleSortedSet
- Specified by:
comparator
in interfaceSortedSet<Double>
-
headSet
Description copied from interface:DoubleSortedSet
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.- Specified by:
headSet
in interfaceDoubleSortedSet
- See Also:
-
tailSet
Description copied from interface:DoubleSortedSet
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.- Specified by:
tailSet
in interfaceDoubleSortedSet
- See Also:
-
subSet
Description copied from interface:DoubleSortedSet
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.- Specified by:
subSet
in interfaceDoubleSortedSet
- See Also:
-
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.
-