Class IntAVLTreeSet
- All Implemented Interfaces:
IntBidirectionalIterable
,IntCollection
,IntIterable
,IntSet
,IntSortedSet
,Serializable
,Cloneable
,Iterable<Integer>
,Collection<Integer>
,SequencedCollection<Integer>
,SequencedSet<Integer>
,Set<Integer>
,SortedSet<Integer>
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.IntAVLTreeSet
(int[] a) Creates a new tree set copying the elements of an array.IntAVLTreeSet
(int[] a, int offset, int length) Creates a new tree set and fills it with the elements of a given array.IntAVLTreeSet
(int[] a, int offset, int length, Comparator<? super Integer> c) Creates a new tree set and fills it with the elements of a given array using a givenComparator
.IntAVLTreeSet
(int[] a, Comparator<? super Integer> 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
).IntAVLTreeSet
(Collection<? extends Integer> c) Creates a new tree set copying a given set.IntAVLTreeSet
(Comparator<? super Integer> c) Creates a new empty tree set with the given comparator.IntAVLTreeSet
(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
(int k) Ensures that this collection contains the specified element (optional operation).void
clear()
clone()
Returns a deep copy of this tree set.boolean
contains
(int k) Returnstrue
if this collection contains the specified element.int
firstInt()
Returns the first (lowest) element currently in this set.headSet
(int 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
(int from) Returns a type-specificBidirectionalIterator
on the elements in this set, starting from a given element of the domain (optional operation).int
lastInt()
Returns the last (highest) element currently in this set.boolean
remove
(int k) Removes an element from this set.int
size()
subSet
(int from, int to) Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.tailSet
(int 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.ints.AbstractIntSet
equals, hashCode, rem
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntCollection
add, addAll, addAll, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toArray, toIntArray, toIntArray, 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.ints.IntCollection
addAll, containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toIntArray, toIntArray
Methods inherited from interface it.unimi.dsi.fastutil.ints.IntIterable
forEach, forEach, forEach
Methods inherited from interface it.unimi.dsi.fastutil.ints.IntSortedSet
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
-
IntAVLTreeSet
public IntAVLTreeSet()Creates a new empty tree set. -
IntAVLTreeSet
Creates a new empty tree set with the given comparator.- Parameters:
c
- aComparator
(even better, a type-specific comparator).
-
IntAVLTreeSet
Creates a new tree set copying a given set.- Parameters:
c
- a collection to be copied into the new tree set.
-
IntAVLTreeSet
Creates a new tree set copying a given sorted set (and itsComparator
).- Parameters:
s
- aSortedSet
to be copied into the new tree set.
-
IntAVLTreeSet
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.
-
IntAVLTreeSet
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.
-
IntAVLTreeSet
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.
-
IntAVLTreeSet
Creates a new tree set using elements provided by an iterator.- Parameters:
i
- an iterator whose elements will fill the set.
-
IntAVLTreeSet
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).
-
IntAVLTreeSet
public IntAVLTreeSet(int[] 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.
-
IntAVLTreeSet
public IntAVLTreeSet(int[] a) Creates a new tree set copying the elements of an array.- Parameters:
a
- an array to be copied into the new tree set.
-
IntAVLTreeSet
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(int k) Description copied from class:AbstractIntCollection
Ensures that this collection contains the specified element (optional operation).- Specified by:
add
in interfaceIntCollection
- Overrides:
add
in classAbstractIntCollection
- See Also:
-
remove
public boolean remove(int k) Description copied from class:AbstractIntSet
Removes an element from this set. Delegates to the type-specificrem()
method implemented by type-specific abstractCollection
superclass.- Specified by:
remove
in interfaceIntSet
- Overrides:
remove
in classAbstractIntSet
- See Also:
-
contains
public boolean contains(int k) Description copied from class:AbstractIntCollection
Returnstrue
if this collection contains the specified element.- Specified by:
contains
in interfaceIntCollection
- Overrides:
contains
in classAbstractIntCollection
- See Also:
-
clear
public void clear()- Specified by:
clear
in interfaceCollection<Integer>
- Specified by:
clear
in interfaceSet<Integer>
- Overrides:
clear
in classAbstractCollection<Integer>
-
size
public int size()- Specified by:
size
in interfaceCollection<Integer>
- Specified by:
size
in interfaceSet<Integer>
- Specified by:
size
in classAbstractCollection<Integer>
-
isEmpty
public boolean isEmpty()- Specified by:
isEmpty
in interfaceCollection<Integer>
- Specified by:
isEmpty
in interfaceSet<Integer>
- Overrides:
isEmpty
in classAbstractCollection<Integer>
-
firstInt
public int firstInt()Description copied from interface:IntSortedSet
Returns the first (lowest) element currently in this set.- Specified by:
firstInt
in interfaceIntSortedSet
- See Also:
-
lastInt
public int lastInt()Description copied from interface:IntSortedSet
Returns the last (highest) element currently in this set.- Specified by:
lastInt
in interfaceIntSortedSet
- See Also:
-
iterator
Description copied from interface:IntCollection
Returns a type-specific iterator on the elements of this collection.- Specified by:
iterator
in interfaceCollection<Integer>
- Specified by:
iterator
in interfaceIntBidirectionalIterable
- Specified by:
iterator
in interfaceIntCollection
- Specified by:
iterator
in interfaceIntIterable
- Specified by:
iterator
in interfaceIntSet
- Specified by:
iterator
in interfaceIntSortedSet
- Specified by:
iterator
in interfaceIterable<Integer>
- Specified by:
iterator
in interfaceSet<Integer>
- Specified by:
iterator
in classAbstractIntSortedSet
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
-
iterator
Description copied from interface:IntSortedSet
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 interfaceIntSortedSet
- 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:IntSortedSet
- Specified by:
comparator
in interfaceIntSortedSet
- Specified by:
comparator
in interfaceSortedSet<Integer>
-
headSet
Description copied from interface:IntSortedSet
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.- Specified by:
headSet
in interfaceIntSortedSet
- See Also:
-
tailSet
Description copied from interface:IntSortedSet
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.- Specified by:
tailSet
in interfaceIntSortedSet
- See Also:
-
subSet
Description copied from interface:IntSortedSet
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.- Specified by:
subSet
in interfaceIntSortedSet
- 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.
-