abstract class AbstractSortedMultiset<E> extends AbstractMultiset<E> implements SortedMultiset<E>
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.
AbstractMultiset.ElementSet, AbstractMultiset.EntrySetMultiset.Entry<E>| Modifier and Type | Field and Description |
|---|---|
(package private) java.util.Comparator<? super E> |
comparator |
private SortedMultiset<E> |
descendingMultiset |
| Constructor and Description |
|---|
AbstractSortedMultiset() |
AbstractSortedMultiset(java.util.Comparator<? super E> comparator) |
| Modifier and Type | Method and Description |
|---|---|
java.util.Comparator<? super E> |
comparator()
Returns the comparator that orders this multiset, or
Ordering.natural() if the natural
ordering of the elements is used. |
(package private) SortedMultiset<E> |
createDescendingMultiset() |
(package private) java.util.NavigableSet<E> |
createElementSet()
Creates a new instance of this multiset's element set, which will be returned by
AbstractMultiset.elementSet(). |
(package private) abstract java.util.Iterator<Multiset.Entry<E>> |
descendingEntryIterator() |
(package private) java.util.Iterator<E> |
descendingIterator() |
SortedMultiset<E> |
descendingMultiset()
Returns a descending view of this multiset.
|
java.util.NavigableSet<E> |
elementSet()
Returns the set of distinct elements contained in this multiset.
|
Multiset.Entry<E> |
firstEntry()
Returns the entry of the first element in this multiset, or
null if this multiset is
empty. |
Multiset.Entry<E> |
lastEntry()
Returns the entry of the last element in this multiset, or
null if this multiset is
empty. |
Multiset.Entry<E> |
pollFirstEntry()
Returns and removes the entry associated with the lowest element in this multiset, or returns
null if this multiset is empty. |
Multiset.Entry<E> |
pollLastEntry()
Returns and removes the entry associated with the greatest element in this multiset, or returns
null if this multiset is empty. |
SortedMultiset<E> |
subMultiset(E fromElement,
BoundType fromBoundType,
E toElement,
BoundType toBoundType)
Returns a view of this multiset restricted to the range between
lowerBound and upperBound. |
add, add, addAll, clear, contains, createEntrySet, distinctElements, elementIterator, entryIterator, entrySet, equals, hashCode, isEmpty, remove, remove, removeAll, retainAll, setCount, setCount, toStringcontainsAll, iterator, size, toArray, toArrayclone, finalize, getClass, notify, notifyAll, wait, wait, waitentrySet, headMultiset, iterator, tailMultiset@GwtTransient final java.util.Comparator<? super E> comparator
@CheckForNull private transient SortedMultiset<E> descendingMultiset
AbstractSortedMultiset()
AbstractSortedMultiset(java.util.Comparator<? super E> comparator)
public java.util.NavigableSet<E> elementSet()
MultisetIf 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().
elementSet in interface Multiset<E>elementSet in interface SortedMultiset<E>elementSet in interface SortedMultisetBridge<E>elementSet in class AbstractMultiset<E>java.util.NavigableSet<E> createElementSet()
AbstractMultisetAbstractMultiset.elementSet().createElementSet in class AbstractMultiset<E>public java.util.Comparator<? super E> comparator()
SortedMultisetOrdering.natural() if the natural
ordering of the elements is used.comparator in interface SortedIterable<E>comparator in interface SortedMultiset<E>@CheckForNull public Multiset.Entry<E> firstEntry()
SortedMultisetnull if this multiset is
empty.firstEntry in interface SortedMultiset<E>@CheckForNull public Multiset.Entry<E> lastEntry()
SortedMultisetnull if this multiset is
empty.lastEntry in interface SortedMultiset<E>@CheckForNull public Multiset.Entry<E> pollFirstEntry()
SortedMultisetnull if this multiset is empty.pollFirstEntry in interface SortedMultiset<E>@CheckForNull public Multiset.Entry<E> pollLastEntry()
SortedMultisetnull if this multiset is empty.pollLastEntry in interface SortedMultiset<E>public SortedMultiset<E> subMultiset(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType)
SortedMultisetlowerBound and upperBound. 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 IllegalArgumentException on attempts to add
elements outside its range.
This method is equivalent to tailMultiset(lowerBound,
lowerBoundType).headMultiset(upperBound, upperBoundType).
subMultiset in interface SortedMultiset<E>abstract java.util.Iterator<Multiset.Entry<E>> descendingEntryIterator()
java.util.Iterator<E> descendingIterator()
public SortedMultiset<E> descendingMultiset()
SortedMultisetdescendingMultiset in interface SortedMultiset<E>SortedMultiset<E> createDescendingMultiset()