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

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

Uses of Multiset in com.google.common.collect

Subinterfaces of Multiset in com.google.common.collect
`interface` `SortedMultiset<E>` A `Multiset` which maintains the ordering of its elements, according to either their natural order or an explicit `Comparator`.

Classes in com.google.common.collect that implement Multiset
`class` `ConcurrentHashMultiset<E>` A multiset that supports concurrent modifications and that provides atomic versions of most `Multiset` operations (exceptions where noted).
`class` `EnumMultiset<E extends Enum<E>>` Multiset implementation backed by an `EnumMap`.
`class` `ForwardingMultiset<E>` A multiset which forwards all its method calls to another multiset.
`class` `HashMultiset<E>` Multiset implementation backed by a `HashMap`.
`class` `ImmutableMultiset<E>` An immutable hash-based multiset.
`class` `ImmutableSortedMultiset<E>` An immutable `SortedMultiset` that stores its elements in a sorted array.
`class` `LinkedHashMultiset<E>` A `Multiset` implementation with predictable iteration order.
`class` `TreeMultiset<E>` A multiset which maintains the ordering of its elements, according to either their natural order or an explicit `Comparator`.

Methods in com.google.common.collect that return Multiset

`static

`<E> Multiset<E>`

`

`Constraints.constrainedMultiset(Multiset<E> multiset, Constraint<? super E> constraint)`
Returns a constrained view of the specified multiset, using the specified constraint.

`protected abstract Multiset<E>` `ForwardingMultiset.delegate()`

`static

`<E> Multiset<E>`

`

`Multisets.intersection(Multiset<E> multiset1, Multiset<?> multiset2)`
Returns an unmodifiable view of the intersection of two multisets.

`Multiset<K>` `LinkedListMultimap.keys()`
`Multiset<K>` `ForwardingMultimap.keys()`
`Multiset<K>` `Multimap.keys()` Returns a collection, which may contain duplicates, of all keys.

`static

`<E> Multiset<E>`

`

`Multisets.unmodifiableMultiset(ImmutableMultiset<E> multiset)`
Deprecated. no need to use this

`static

`<E> Multiset<E>`

`

`Multisets.unmodifiableMultiset(Multiset<? extends E> multiset)`
Returns an unmodifiable view of the specified multiset.

Methods in com.google.common.collect with parameters of type Multiset

`static

`<E> Multiset<E>`

`

`Constraints.constrainedMultiset(Multiset<E> multiset, Constraint<? super E> constraint)`
Returns a constrained view of the specified multiset, using the specified constraint.

`static boolean` `Multisets.containsOccurrences(Multiset<?> superMultiset, Multiset<?> subMultiset)` Returns `true` if `subMultiset.count(o) <= superMultiset.count(o)` for all `o`.
`static boolean` `Multisets.containsOccurrences(Multiset<?> superMultiset, Multiset<?> subMultiset)` Returns `true` if `subMultiset.count(o) <= superMultiset.count(o)` for all `o`.

`static

`<E> ImmutableMultiset<E>`

`

`Multisets.copyHighestCountFirst(Multiset<E> multiset)`
Returns a copy of `multiset` as an `ImmutableMultiset` whose iteration order is highest count first, with ties broken by the iteration order of the original multiset.

`static

`<E> Multiset<E>`

`

`Multisets.intersection(Multiset<E> multiset1, Multiset<?> multiset2)`
Returns an unmodifiable view of the intersection of two multisets.

`static

`<E> Multiset<E>`

`

`Multisets.intersection(Multiset<E> multiset1, Multiset<?> multiset2)`
Returns an unmodifiable view of the intersection of two multisets.

`static boolean` `Multisets.removeOccurrences(Multiset<?> multisetToModify, Multiset<?> occurrencesToRemove)` For each occurrence of an element `e` in `occurrencesToRemove`, removes one occurrence of `e` in `multisetToModify`.
`static boolean` `Multisets.removeOccurrences(Multiset<?> multisetToModify, Multiset<?> occurrencesToRemove)` For each occurrence of an element `e` in `occurrencesToRemove`, removes one occurrence of `e` in `multisetToModify`.
`static boolean` `Multisets.retainOccurrences(Multiset<?> multisetToModify, Multiset<?> multisetToRetain)` Modifies `multisetToModify` so that its count for an element `e` is at most `multisetToRetain.count(e)`.
`static boolean` `Multisets.retainOccurrences(Multiset<?> multisetToModify, Multiset<?> multisetToRetain)` Modifies `multisetToModify` so that its count for an element `e` is at most `multisetToRetain.count(e)`.

`static

`<E> Multiset<E>`

`

`Multisets.unmodifiableMultiset(Multiset<? extends E> multiset)`
Returns an unmodifiable view of the specified multiset.

Copyright © 2010-2012. All Rights Reserved.