@GwtCompatible(emulated=true) final class UnmodifiableSortedMultiset<E> extends Multisets.UnmodifiableMultiset<E> implements SortedMultiset<E>
Multisets.unmodifiableSortedMultiset(SortedMultiset),
split out into its own file so it can be GWT emulated (to deal with the differing
elementSet() types in GWT and non-GWT).ForwardingMultiset.StandardElementSetMultiset.Entry<E>| Modifier and Type | Field and Description |
|---|---|
private UnmodifiableSortedMultiset<E> |
descendingMultiset |
private static long |
serialVersionUID |
delegate, elementSet, entrySet| Constructor and Description |
|---|
UnmodifiableSortedMultiset(SortedMultiset<E> delegate) |
| 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) java.util.NavigableSet<E> |
createElementSet() |
protected SortedMultiset<E> |
delegate()
Returns the backing delegate instance that methods are forwarded to.
|
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. |
SortedMultiset<E> |
headMultiset(E upperBound,
BoundType boundType)
Returns a view of this multiset restricted to the elements less than
upperBound, optionally including upperBound itself. |
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 lowerBound,
BoundType lowerBoundType,
E upperBound,
BoundType upperBoundType)
Returns a view of this multiset restricted to the range between
lowerBound and upperBound. |
SortedMultiset<E> |
tailMultiset(E lowerBound,
BoundType boundType)
Returns a view of this multiset restricted to the elements greater than
lowerBound, optionally including lowerBound itself. |
add, add, addAll, clear, entrySet, iterator, remove, remove, removeAll, retainAll, setCount, setCountcount, equals, hashCode, standardAdd, standardAddAll, standardClear, standardContains, standardCount, standardEquals, standardHashCode, standardIterator, standardRemove, standardRemoveAll, standardRetainAll, standardSetCount, standardSetCount, standardSize, standardToStringcontains, containsAll, isEmpty, size, standardContainsAll, standardIsEmpty, standardToArray, standardToArray, toArray, toArraytoStringclone, finalize, getClass, notify, notifyAll, toString, wait, wait, waitentrySet, iteratoradd, add, contains, containsAll, count, equals, hashCode, remove, remove, removeAll, retainAll, setCount, setCount, toStringprivate transient UnmodifiableSortedMultiset<E> descendingMultiset
private static final long serialVersionUID
UnmodifiableSortedMultiset(SortedMultiset<E> delegate)
protected SortedMultiset<E> delegate()
ForwardingObjectForwardingSet.delegate(). Concrete subclasses override this method to supply
the instance being decorated.delegate in class Multisets.UnmodifiableMultiset<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>java.util.NavigableSet<E> createElementSet()
createElementSet in class Multisets.UnmodifiableMultiset<E>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 Multisets.UnmodifiableMultiset<E>public SortedMultiset<E> descendingMultiset()
SortedMultisetdescendingMultiset in interface SortedMultiset<E>public Multiset.Entry<E> firstEntry()
SortedMultisetnull if
this multiset is empty.firstEntry in interface SortedMultiset<E>public Multiset.Entry<E> lastEntry()
SortedMultisetnull if
this multiset is empty.lastEntry in interface SortedMultiset<E>public Multiset.Entry<E> pollFirstEntry()
SortedMultisetnull if this multiset is empty.pollFirstEntry in interface SortedMultiset<E>public Multiset.Entry<E> pollLastEntry()
SortedMultisetnull if this multiset is empty.pollLastEntry in interface SortedMultiset<E>public SortedMultiset<E> headMultiset(E upperBound, BoundType boundType)
SortedMultisetupperBound, optionally including upperBound itself. 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.
headMultiset in interface SortedMultiset<E>public SortedMultiset<E> subMultiset(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType)
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>public SortedMultiset<E> tailMultiset(E lowerBound, BoundType boundType)
SortedMultisetlowerBound, optionally including lowerBound itself. 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.
tailMultiset in interface SortedMultiset<E>