protected abstract class ForwardingSortedMultiset.StandardDescendingMultiset extends ForwardingMultiset<E>
descendingMultiset() will not reflect any changes you make to the behavior of methods such as
ForwardingCollection.add(Object) or
pollFirstEntry(). This skeleton implementation correctly delegates each of its operations to the appropriate methods of this
ForwardingSortedMultiset. In many cases, you may wish to override
descendingMultiset() to return an instance of a subclass of
StandardDescendingMultiset.
ForwardingMultiset.StandardElementSet Multiset.Entry <E> | Constructor and Description |
|---|
StandardDescendingMultiset()
Constructor for use by subclasses.
|
| Modifier and Type | Method and Description |
|---|---|
Comparator |
comparator()
Returns the comparator that orders this multiset, or
Ordering if the natural ordering of the elements is used.
|
protected Multiset |
delegate()
Returns the backing delegate instance that methods are forwarded to.
|
SortedMultiset |
descendingMultiset()
Returns a descending view of this multiset.
|
NavigableSet |
elementSet()
Returns the set of distinct elements contained in this multiset.
|
Set |
entrySet()
Returns a view of the contents of this multiset, grouped into
Multiset.Entry instances, each providing an element of the multiset and the count of that element.
|
Multiset |
firstEntry()
Returns the entry of the first element in this multiset, or
null if this multiset is empty.
|
SortedMultiset |
headMultiset(E toElement, BoundType
Returns a view of this multiset restricted to the elements less than
upperBound, optionally including
upperBound itself.
|
Iterator |
iterator()
|
Multiset |
lastEntry()
Returns the entry of the last element in this multiset, or
null if this multiset is empty.
|
Multiset |
pollFirstEntry()
Returns and removes the entry associated with the lowest element in this multiset, or returns
null if this multiset is empty.
|
Multiset |
pollLastEntry()
Returns and removes the entry associated with the greatest element in this multiset, or returns
null if this multiset is empty.
|
SortedMultiset |
subMultiset(E fromElement, BoundType
Returns a view of this multiset restricted to the range between
lowerBound and
upperBound.
|
SortedMultiset |
tailMultiset(E fromElement, BoundType
Returns a view of this multiset restricted to the elements greater than
lowerBound, optionally including
lowerBound itself.
|
Object |
toArray()
|
<T> T[] |
toArray(T[] array)
|
String |
toString()
Returns the string representation generated by the delegate's
toString method.
|
add, count, equals, hashCode, remove, setCount, setCount, standardAdd, standardAddAll, standardClear, standardContains, standardCount, standardEquals, standardHashCode, standardIterator, standardRemove, standardRemoveAll, standardRetainAll, standardSetCount, standardSetCount, standardSize, standardToStringadd, addAll, clear, contains, containsAll, isEmpty, remove, removeAll, retainAll, size, standardContainsAll, standardIsEmpty, standardToArray, standardToArrayclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, add, contains, containsAll, count, equals, hashCode, remove, remove, removeAll, retainAll, setCount, setCountaddAll, clear, isEmpty, parallelStream, removeIf, size, spliterator, streampublic StandardDescendingMultiset()
public Comparator<? super E> comparator()
SortedMultiset
Ordering.natural() if the natural ordering of the elements is used.
public NavigableSet<E> elementSet()
Multiset
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().
elementSet in interface
Multiset<E>
elementSet in interface
SortedMultiset<E>
elementSet in class
ForwardingMultiset<E>
public Multiset.Entry <E> pollFirstEntry()
SortedMultiset
null if this multiset is empty.
public Multiset.Entry <E> pollLastEntry()
SortedMultiset
null if this multiset is empty.
public SortedMultiset<E> headMultiset(E toElement, BoundType boundType)
SortedMultiset
upperBound, 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.
public SortedMultiset<E> subMultiset(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType)
SortedMultiset
lowerBound 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).
public SortedMultiset<E> tailMultiset(E fromElement, BoundType boundType)
SortedMultiset
lowerBound, 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.
protected Multiset<E> delegate()
ForwardingObject
ForwardingSet.delegate() . Concrete subclasses override this method to supply the instance being decorated.
public SortedMultiset<E> descendingMultiset()
SortedMultiset
public Multiset.Entry <E> firstEntry()
SortedMultiset
null if this multiset is empty.
public Multiset.Entry <E> lastEntry()
SortedMultiset
null if this multiset is empty.
public Set<Multiset .Entry <E>> entrySet()
Multiset
Multiset.Entry instances, each providing an element of the multiset and the count of that element. This set contains exactly one entry for each distinct element in the multiset (thus it always has the same size as the
Multiset.elementSet() ). The order of the elements in the element set is unspecified.
The entry set is backed by the same data as the multiset, so any change to either is immediately reflected in the other. However, multiset changes may or may not be reflected in any Entry instances already retrieved from the entry set (this is implementation-dependent). Furthermore, implementations are not required to support modifications to the entry set at all, and the Entry instances themselves don't even have methods for modification. See the specific implementation class for more details on how its entry set handles modifications.
entrySet in interface
Multiset<E>
entrySet in interface
SortedMultiset<E>
entrySet in class
ForwardingMultiset<E>
public Iterator<E> iterator()
SortedMultiset
Elements that occur multiple times in the multiset will appear multiple times in this iterator, though not necessarily sequentially.
The iterator returns the elements in ascending order according to this multiset's comparator.
public Object[] toArray()
public <T> T[] toArray(T[] array)
public StringtoString()
ForwardingObject
toString method.