Class IntAVLTreeSet
- All Implemented Interfaces:
it.unimi.dsi.fastutil.ints.IntBidirectionalIterable,it.unimi.dsi.fastutil.ints.IntCollection,it.unimi.dsi.fastutil.ints.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:
-
Field Summary
FieldsModifier and TypeFieldDescriptionprotected it.unimi.dsi.fastutil.ints.IntComparatorThis set's actual comparator; it may differ fromstoredComparatorbecause it is always a type-specific comparator, so it could be derived from the former by wrapping.protected intNumber of elements in this set.protected it.unimi.dsi.fastutil.ints.IntAVLTreeSet.EntryThe entry of the first element of this set.protected it.unimi.dsi.fastutil.ints.IntAVLTreeSet.EntryThe entry of the last element of this set.protected Comparator<? super Integer> This set's comparator, as provided in the constructor.protected it.unimi.dsi.fastutil.ints.IntAVLTreeSet.EntryA reference to the root entry. -
Constructor Summary
ConstructorsConstructorDescriptionCreates 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.IntAVLTreeSet(it.unimi.dsi.fastutil.ints.IntCollection c) Creates a new tree set copying a given type-specific collection.IntAVLTreeSet(it.unimi.dsi.fastutil.ints.IntIterator i) 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 TypeMethodDescriptionbooleanadd(int k) voidclear()clone()Returns a deep copy of this tree set.it.unimi.dsi.fastutil.ints.IntComparatorbooleancontains(int k) intfirstInt()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.booleanisEmpty()it.unimi.dsi.fastutil.ints.IntBidirectionalIteratoriterator()Returns a type-specific iterator on the elements of this set.it.unimi.dsi.fastutil.ints.IntBidirectionalIteratoriterator(int from) Returns a type-specificBidirectionalIteratoron the elements in this set, starting from a given element of the domain (optional operation).intlastInt()Returns the last (highest) element currently in this set.booleanremove(int k) Removes an element from this set.intsize()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, remMethods 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, toStringMethods inherited from class java.util.AbstractCollection
toArray, toArrayMethods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Collection
toArrayMethods inherited from interface it.unimi.dsi.fastutil.ints.IntCollection
addAll, containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toIntArray, toIntArrayMethods inherited from interface it.unimi.dsi.fastutil.ints.IntIterable
forEach, forEach, forEachMethods inherited from interface it.unimi.dsi.fastutil.ints.IntSortedSet
first, headSet, last, spliterator, subSet, tailSetMethods inherited from interface java.util.Set
add, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArrayMethods inherited from interface java.util.SortedSet
addFirst, addLast, getFirst, getLast, removeFirst, removeLast, reversed
-
Field Details
-
tree
protected transient it.unimi.dsi.fastutil.ints.IntAVLTreeSet.Entry treeA reference to the root entry. -
count
protected int countNumber of elements in this set. -
firstEntry
protected transient it.unimi.dsi.fastutil.ints.IntAVLTreeSet.Entry firstEntryThe entry of the first element of this set. -
lastEntry
protected transient it.unimi.dsi.fastutil.ints.IntAVLTreeSet.Entry lastEntryThe entry of the last element of this set. -
storedComparator
This set's comparator, as provided in the constructor. -
actualComparator
protected transient it.unimi.dsi.fastutil.ints.IntComparator actualComparatorThis set's actual comparator; it may differ fromstoredComparatorbecause it is always a type-specific comparator, so it could be derived from the former by wrapping.
-
-
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- aSortedSetto be copied into the new tree set.
-
IntAVLTreeSet
public IntAVLTreeSet(it.unimi.dsi.fastutil.ints.IntCollection 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.
-
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
public IntAVLTreeSet(it.unimi.dsi.fastutil.ints.IntIterator 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.
-
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) - Specified by:
addin interfaceit.unimi.dsi.fastutil.ints.IntCollection- Overrides:
addin classit.unimi.dsi.fastutil.ints.AbstractIntCollection
-
remove
public boolean remove(int k) Description copied from class:AbstractIntSetRemoves an element from this set. Delegates to the type-specificrem()method implemented by type-specific abstractCollectionsuperclass.- Specified by:
removein interfaceIntSet- Overrides:
removein classAbstractIntSet- See Also:
-
contains
public boolean contains(int k) - Specified by:
containsin interfaceit.unimi.dsi.fastutil.ints.IntCollection- Overrides:
containsin classit.unimi.dsi.fastutil.ints.AbstractIntCollection
-
clear
public void clear()- Specified by:
clearin interfaceCollection<Integer>- Specified by:
clearin interfaceSet<Integer>- Overrides:
clearin classAbstractCollection<Integer>
-
size
public int size()- Specified by:
sizein interfaceCollection<Integer>- Specified by:
sizein interfaceSet<Integer>- Specified by:
sizein classAbstractCollection<Integer>
-
isEmpty
public boolean isEmpty()- Specified by:
isEmptyin interfaceCollection<Integer>- Specified by:
isEmptyin interfaceSet<Integer>- Overrides:
isEmptyin classAbstractCollection<Integer>
-
firstInt
public int firstInt()Description copied from interface:IntSortedSetReturns the first (lowest) element currently in this set.- Specified by:
firstIntin interfaceIntSortedSet- See Also:
-
lastInt
public int lastInt()Description copied from interface:IntSortedSetReturns the last (highest) element currently in this set.- Specified by:
lastIntin interfaceIntSortedSet- See Also:
-
iterator
public it.unimi.dsi.fastutil.ints.IntBidirectionalIterator iterator()Description copied from interface:IntSetReturns a type-specific iterator on the elements of this set.- Specified by:
iteratorin interfaceCollection<Integer>- Specified by:
iteratorin interfaceit.unimi.dsi.fastutil.ints.IntBidirectionalIterable- Specified by:
iteratorin interfaceit.unimi.dsi.fastutil.ints.IntCollection- Specified by:
iteratorin interfaceit.unimi.dsi.fastutil.ints.IntIterable- Specified by:
iteratorin interfaceIntSet- Specified by:
iteratorin interfaceIntSortedSet- Specified by:
iteratorin interfaceIterable<Integer>- Specified by:
iteratorin interfaceSet<Integer>- Specified by:
iteratorin classAbstractIntSortedSet- Returns:
- a type-specific iterator on the elements of this set.
-
iterator
public it.unimi.dsi.fastutil.ints.IntBidirectionalIterator iterator(int from) Description copied from interface:IntSortedSetReturns 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 interfaceIntSortedSet- Parameters:
from- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
public it.unimi.dsi.fastutil.ints.IntComparator comparator()Description copied from interface:IntSortedSet- Specified by:
comparatorin interfaceIntSortedSet- Specified by:
comparatorin interfaceSortedSet<Integer>
-
headSet
Description copied from interface:IntSortedSetReturns a view of the portion of this sorted set whose elements are strictly less thantoElement.- Specified by:
headSetin interfaceIntSortedSet- See Also:
-
tailSet
Description copied from interface:IntSortedSetReturns a view of the portion of this sorted set whose elements are greater than or equal tofromElement.- Specified by:
tailSetin interfaceIntSortedSet- See Also:
-
subSet
Description copied from interface:IntSortedSetReturns a view of the portion of this sorted set whose elements range fromfromElement, inclusive, totoElement, exclusive.- Specified by:
subSetin 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.
-