Class AbstractSortedMultiset<E>
- All Implemented Interfaces:
Multiset<E>,SortedIterable<E>,SortedMultiset<E>,SortedMultisetBridge<E>,Iterable<E>,Collection<E>
- Direct Known Subclasses:
TreeMultiset
SortedMultiset interface.
The Multiset.count(java.lang.Object) and AbstractCollection.size() implementations all iterate across the set returned by
Multiset.entrySet(), as do many methods acting on the set returned by elementSet(). Override those methods for better performance.
-
Nested Class Summary
Nested classes/interfaces inherited from class com.google.common.collect.AbstractMultiset
AbstractMultiset.ElementSet, AbstractMultiset.EntrySetNested classes/interfaces inherited from interface com.google.common.collect.Multiset
Multiset.Entry<E> -
Field Summary
FieldsModifier and TypeFieldDescription(package private) final Comparator<? super E> private SortedMultiset<E> -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionComparator<? super E> Returns the comparator that orders this multiset, orOrdering.natural()if the natural ordering of the elements is used.(package private) SortedMultiset<E> (package private) NavigableSet<E> Creates a new instance of this multiset's element set, which will be returned byAbstractMultiset.elementSet().(package private) abstract Iterator<Multiset.Entry<E>> Returns a descending view of this multiset.Returns the set of distinct elements contained in this multiset.Returns the entry of the first element in this multiset, ornullif this multiset is empty.Returns the entry of the last element in this multiset, ornullif this multiset is empty.Returns and removes the entry associated with the lowest element in this multiset, or returnsnullif this multiset is empty.Returns and removes the entry associated with the greatest element in this multiset, or returnsnullif this multiset is empty.subMultiset(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType) Returns a view of this multiset restricted to the range betweenlowerBoundandupperBound.Methods inherited from class com.google.common.collect.AbstractMultiset
add, add, addAll, clear, contains, createEntrySet, distinctElements, elementIterator, entryIterator, entrySet, equals, hashCode, isEmpty, remove, remove, removeAll, retainAll, setCount, setCount, toStringMethods inherited from class java.util.AbstractCollection
containsAll, iterator, size, toArray, toArrayMethods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Collection
addAll, clear, isEmpty, parallelStream, removeIf, stream, toArray, toArray, toArrayMethods inherited from interface com.google.common.collect.Multiset
add, add, contains, containsAll, count, equals, forEach, forEachEntry, hashCode, remove, remove, removeAll, retainAll, setCount, setCount, size, spliterator, toStringMethods inherited from interface com.google.common.collect.SortedMultiset
entrySet, headMultiset, iterator, tailMultiset
-
Field Details
-
comparator
-
descendingMultiset
-
-
Constructor Details
-
AbstractSortedMultiset
AbstractSortedMultiset() -
AbstractSortedMultiset
AbstractSortedMultiset(Comparator<? super E> comparator)
-
-
Method Details
-
elementSet
Description copied from interface:MultisetReturns the set of distinct elements contained in this multiset. The element set is backed by the same data as the multiset, so any change to either is immediately reflected in the other. The order of the elements in the element set is unspecified.If the element set supports any removal operations, these necessarily cause all occurrences of the removed element(s) to be removed from the multiset. Implementations are not expected to support the add operations, although this is possible.
A common use for the element set is to find the number of distinct elements in the multiset:
elementSet().size().- Specified by:
elementSetin interfaceMultiset<E>- Specified by:
elementSetin interfaceSortedMultiset<E>- Specified by:
elementSetin interfaceSortedMultisetBridge<E>- Overrides:
elementSetin classAbstractMultiset<E>- Returns:
- a view of the set of distinct elements in this multiset
-
createElementSet
NavigableSet<E> createElementSet()Description copied from class:AbstractMultisetCreates a new instance of this multiset's element set, which will be returned byAbstractMultiset.elementSet().- Overrides:
createElementSetin classAbstractMultiset<E>
-
comparator
Description copied from interface:SortedMultisetReturns the comparator that orders this multiset, orOrdering.natural()if the natural ordering of the elements is used.- Specified by:
comparatorin interfaceSortedIterable<E>- Specified by:
comparatorin interfaceSortedMultiset<E>
-
firstEntry
Description copied from interface:SortedMultisetReturns the entry of the first element in this multiset, ornullif this multiset is empty.- Specified by:
firstEntryin interfaceSortedMultiset<E>
-
lastEntry
Description copied from interface:SortedMultisetReturns the entry of the last element in this multiset, ornullif this multiset is empty.- Specified by:
lastEntryin interfaceSortedMultiset<E>
-
pollFirstEntry
Description copied from interface:SortedMultisetReturns and removes the entry associated with the lowest element in this multiset, or returnsnullif this multiset is empty.- Specified by:
pollFirstEntryin interfaceSortedMultiset<E>
-
pollLastEntry
Description copied from interface:SortedMultisetReturns and removes the entry associated with the greatest element in this multiset, or returnsnullif this multiset is empty.- Specified by:
pollLastEntryin interfaceSortedMultiset<E>
-
subMultiset
public SortedMultiset<E> subMultiset(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType) Description copied from interface:SortedMultisetReturns a view of this multiset restricted to the range betweenlowerBoundandupperBound. The returned multiset is a view of this multiset, so changes to one will be reflected in the other. The returned multiset supports all operations that this multiset supports.The returned multiset will throw an
IllegalArgumentExceptionon attempts to add elements outside its range.This method is equivalent to
tailMultiset(lowerBound, lowerBoundType).headMultiset(upperBound, upperBoundType).- Specified by:
subMultisetin interfaceSortedMultiset<E>
-
descendingEntryIterator
-
descendingIterator
-
descendingMultiset
Description copied from interface:SortedMultisetReturns a descending view of this multiset. Modifications made to either map will be reflected in the other.- Specified by:
descendingMultisetin interfaceSortedMultiset<E>
-
createDescendingMultiset
SortedMultiset<E> createDescendingMultiset()
-