## Uses of Interface
com.google.common.collect.Multiset.Entry

Packages that use Multiset.Entry
com.google.common.collect: This package contains generic collection interfaces and implementations, and other utilities for working with collections.

Uses of Multiset.Entry in com.google.common.collect

Methods in com.google.common.collect that return Multiset.Entry
`Multiset.Entry<E>` `SortedMultiset.firstEntry()` Returns the entry of the first element in this multiset, or `null` if this multiset is empty.

`static

`<E> Multiset.Entry<E>`

`

`Multisets.immutableEntry(E e, int n)`
Returns an immutable multiset entry with the specified element and count.

`Multiset.Entry<E>` `SortedMultiset.lastEntry()` Returns the entry of the last element in this multiset, or `null` if this multiset is empty.
`Multiset.Entry<E>` `ImmutableSortedMultiset.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>` `SortedMultiset.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>` `ImmutableSortedMultiset.pollLastEntry()` Returns and removes the entry associated with the greatest element in this multiset, or returns `null` if this multiset is empty.
`Multiset.Entry<E>` `SortedMultiset.pollLastEntry()` Returns and removes the entry associated with the greatest element in this multiset, or returns `null` if this multiset is empty.

Methods in com.google.common.collect that return types with arguments of type Multiset.Entry
`Set<Multiset.Entry<E>>` `ForwardingMultiset.entrySet()`
`Set<Multiset.Entry<E>>` `ConcurrentHashMultiset.entrySet()`
`ImmutableSet<Multiset.Entry<E>>` `ImmutableMultiset.entrySet()`
`Set<Multiset.Entry<E>>` `Multiset.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.

Copyright © 2010-2012. All Rights Reserved.