Interface Multimap<K extends @Nullable java.lang.Object,V extends @Nullable java.lang.Object>
-
- All Known Subinterfaces:
ListMultimap<K,V>
,SetMultimap<K,V>
,SortedSetMultimap<K,V>
- All Known Implementing Classes:
ArrayListMultimap
,ForwardingListMultimap
,ForwardingMultimap
,ForwardingSetMultimap
,ForwardingSortedSetMultimap
,HashMultimap
,ImmutableListMultimap
,ImmutableMultimap
,ImmutableSetMultimap
,LinkedHashMultimap
,LinkedListMultimap
,TreeMultimap
@DoNotMock("Use ImmutableMultimap, HashMultimap, or another implementation") @GwtCompatible public interface Multimap<K extends @Nullable java.lang.Object,V extends @Nullable java.lang.Object>
A collection that maps keys to values, similar toMap
, but in which each key may be associated with multiple values. You can visualize the contents of a multimap either as a map from keys to nonempty collections of values:- a → 1, 2
- b → 3
- a → 1
- a → 2
- b → 3
Important: although the first interpretation resembles how most multimaps are implemented, the design of the
Multimap
API is based on the second form. So, using the multimap shown above as an example, thesize()
is3
, not2
, and thevalues()
collection is[1, 2, 3]
, not[[1, 2], [3]]
. For those times when the first style is more useful, use the multimap'sasMap()
view (or create aMap<K, Collection<V>>
in the first place).Example
The following code:
... produces output such as:ListMultimap<String, String> multimap = ArrayListMultimap.create(); for (President pres : US_PRESIDENTS_IN_ORDER) { multimap.put(pres.firstName(), pres.lastName()); } for (String firstName : multimap.keySet()) { List<String> lastNames = multimap.get(firstName); out.println(firstName + ": " + lastNames); }
Zachary: [Taylor] John: [Adams, Adams, Tyler, Kennedy] // Remember, Quincy! George: [Washington, Bush, Bush] Grover: [Cleveland, Cleveland] // Two, non-consecutive terms, rep'ing NJ! ...
Views
Much of the power of the multimap API comes from the view collections it provides. These always reflect the latest state of the multimap itself. When they support modification, the changes are write-through (they automatically update the backing multimap). These view collections are:
asMap()
, mentioned abovekeys()
,keySet()
,values()
,entries()
, which are similar to the corresponding view collections ofMap
- and, notably, even the collection returned by
get(key)
is an active view of the values corresponding tokey
The collections returned by the
replaceValues
andremoveAll
methods, which contain values that have just been removed from the multimap, are naturally not views.Subinterfaces
Instead of using the
Multimap
interface directly, prefer the subinterfacesListMultimap
andSetMultimap
. These take their names from the fact that the collections they return fromget
behave like (and, of course, implement)List
andSet
, respectively.For example, the "presidents" code snippet above used a
ListMultimap
; if it had used aSetMultimap
instead, two presidents would have vanished, and last names might or might not appear in chronological order.Warning: instances of type
Multimap
may not implementObject.equals(java.lang.Object)
in the way you expect. Multimaps containing the same key-value pairs, even in the same order, may or may not be equal and may or may not have the samehashCode
. The recommended subinterfaces provide much stronger guarantees.Comparison to a map of collections
Multimaps are commonly used in places where a
Map<K, Collection<V>>
would otherwise have appeared. The differences include:- There is no need to populate an empty collection before adding an entry with
put
. get
never returnsnull
, only an empty collection.- A key is contained in the multimap if and only if it maps to at least one value. Any operation that causes a key to have zero associated values has the effect of removing that key from the multimap.
- The total entry count is available as
size()
. - Many complex operations become easier; for example,
Collections.min(multimap.values())
finds the smallest value across all keys.
Implementations
As always, prefer the immutable implementations,
ImmutableListMultimap
andImmutableSetMultimap
. General-purpose mutable implementations are listed above under "All Known Implementing Classes". You can also create a custom multimap, backed by anyMap
andCollection
types, using theMultimaps.newMultimap
family of methods. Finally, another popular way to obtain a multimap is usingMultimaps.index
. See theMultimaps
class for these and other static utilities related to multimaps.Other Notes
As with
Map
, the behavior of aMultimap
is not specified if key objects already present in the multimap change in a manner that affectsequals
comparisons. Use caution if mutable objects are used as keys in aMultimap
.All methods that modify the multimap are optional. The view collections returned by the multimap may or may not be modifiable. Any modification method that is not supported will throw
UnsupportedOperationException
.See the Guava User Guide article on
Multimap
.- Since:
- 2.0
- Author:
- Jared Levy
-
-
Method Summary
All Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description java.util.Map<K,java.util.Collection<V>>
asMap()
Returns a view of this multimap as aMap
from each distinct key to the nonempty collection of that key's associated values.void
clear()
Removes all key-value pairs from the multimap, leaving it empty.boolean
containsEntry(java.lang.Object key, java.lang.Object value)
Returnstrue
if this multimap contains at least one key-value pair with the keykey
and the valuevalue
.boolean
containsKey(java.lang.Object key)
Returnstrue
if this multimap contains at least one key-value pair with the keykey
.boolean
containsValue(java.lang.Object value)
Returnstrue
if this multimap contains at least one key-value pair with the valuevalue
.java.util.Collection<java.util.Map.Entry<K,V>>
entries()
Returns a view collection of all key-value pairs contained in this multimap, asMap.Entry
instances.boolean
equals(java.lang.Object obj)
Compares the specified object with this multimap for equality.default void
forEach(java.util.function.BiConsumer<? super K,? super V> action)
Performs the given action for all key-value pairs contained in this multimap.java.util.Collection<V>
get(K key)
Returns a view collection of the values associated withkey
in this multimap, if any.int
hashCode()
Returns the hash code for this multimap.boolean
isEmpty()
Returnstrue
if this multimap contains no key-value pairs.Multiset<K>
keys()
Returns a view collection containing the key from each key-value pair in this multimap, without collapsing duplicates.java.util.Set<K>
keySet()
Returns a view collection of all distinct keys contained in this multimap.boolean
put(K key, V value)
Stores a key-value pair in this multimap.boolean
putAll(Multimap<? extends K,? extends V> multimap)
Stores all key-value pairs ofmultimap
in this multimap, in the order returned bymultimap.entries()
.boolean
putAll(K key, java.lang.Iterable<? extends V> values)
Stores a key-value pair in this multimap for each ofvalues
, all using the same key,key
.boolean
remove(java.lang.Object key, java.lang.Object value)
Removes a single key-value pair with the keykey
and the valuevalue
from this multimap, if such exists.java.util.Collection<V>
removeAll(java.lang.Object key)
Removes all values associated with the keykey
.java.util.Collection<V>
replaceValues(K key, java.lang.Iterable<? extends V> values)
Stores a collection of values with the same key, replacing any existing values for that key.int
size()
Returns the number of key-value pairs in this multimap.java.util.Collection<V>
values()
Returns a view collection containing the value from each key-value pair contained in this multimap, without collapsing duplicates (sovalues().size() == size()
).
-
-
-
Method Detail
-
size
int size()
Returns the number of key-value pairs in this multimap.Note: this method does not return the number of distinct keys in the multimap, which is given by
keySet().size()
orasMap().size()
. See the opening section of theMultimap
class documentation for clarification.
-
isEmpty
boolean isEmpty()
Returnstrue
if this multimap contains no key-value pairs. Equivalent tosize() == 0
, but can in some cases be more efficient.
-
containsKey
boolean containsKey(@CompatibleWith("K") @CheckForNull java.lang.Object key)
Returnstrue
if this multimap contains at least one key-value pair with the keykey
.
-
containsValue
boolean containsValue(@CompatibleWith("V") @CheckForNull java.lang.Object value)
Returnstrue
if this multimap contains at least one key-value pair with the valuevalue
.
-
containsEntry
boolean containsEntry(@CompatibleWith("K") @CheckForNull java.lang.Object key, @CompatibleWith("V") @CheckForNull java.lang.Object value)
Returnstrue
if this multimap contains at least one key-value pair with the keykey
and the valuevalue
.
-
put
@CanIgnoreReturnValue boolean put(K key, V value)
Stores a key-value pair in this multimap.Some multimap implementations allow duplicate key-value pairs, in which case
put
always adds a new key-value pair and increases the multimap size by 1. Other implementations prohibit duplicates, and storing a key-value pair that's already in the multimap has no effect.- Returns:
true
if the method increased the size of the multimap, orfalse
if the multimap already contained the key-value pair and doesn't allow duplicates
-
remove
@CanIgnoreReturnValue boolean remove(@CompatibleWith("K") @CheckForNull java.lang.Object key, @CompatibleWith("V") @CheckForNull java.lang.Object value)
Removes a single key-value pair with the keykey
and the valuevalue
from this multimap, if such exists. If multiple key-value pairs in the multimap fit this description, which one is removed is unspecified.- Returns:
true
if the multimap changed
-
putAll
@CanIgnoreReturnValue boolean putAll(K key, java.lang.Iterable<? extends V> values)
Stores a key-value pair in this multimap for each ofvalues
, all using the same key,key
. Equivalent to (but expected to be more efficient than):for (V value : values) { put(key, value); }
In particular, this is a no-op if
values
is empty.- Returns:
true
if the multimap changed
-
putAll
@CanIgnoreReturnValue boolean putAll(Multimap<? extends K,? extends V> multimap)
Stores all key-value pairs ofmultimap
in this multimap, in the order returned bymultimap.entries()
.- Returns:
true
if the multimap changed
-
replaceValues
@CanIgnoreReturnValue java.util.Collection<V> replaceValues(K key, java.lang.Iterable<? extends V> values)
Stores a collection of values with the same key, replacing any existing values for that key.If
values
is empty, this is equivalent toremoveAll(key)
.- Returns:
- the collection of replaced values, or an empty collection if no values were previously associated with the key. The collection may be modifiable, but updating it will have no effect on the multimap.
-
removeAll
@CanIgnoreReturnValue java.util.Collection<V> removeAll(@CompatibleWith("K") @CheckForNull java.lang.Object key)
Removes all values associated with the keykey
.Once this method returns,
key
will not be mapped to any values, so it will not appear inkeySet()
,asMap()
, or any other views.- Returns:
- the values that were removed (possibly empty). The returned collection may be modifiable, but updating it will have no effect on the multimap.
-
get
java.util.Collection<V> get(K key)
Returns a view collection of the values associated withkey
in this multimap, if any. Note that whencontainsKey(key)
is false, this returns an empty collection, notnull
.Changes to the returned collection will update the underlying multimap, and vice versa.
-
keySet
java.util.Set<K> keySet()
Returns a view collection of all distinct keys contained in this multimap. Note that the key set contains a key if and only if this multimap maps that key to at least one value.Changes to the returned set will update the underlying multimap, and vice versa. However, adding to the returned set is not possible.
-
keys
Multiset<K> keys()
Returns a view collection containing the key from each key-value pair in this multimap, without collapsing duplicates. This collection has the same size as this multimap, andkeys().count(k) == get(k).size()
for allk
.Changes to the returned multiset will update the underlying multimap, and vice versa. However, adding to the returned collection is not possible.
-
values
java.util.Collection<V> values()
Returns a view collection containing the value from each key-value pair contained in this multimap, without collapsing duplicates (sovalues().size() == size()
).Changes to the returned collection will update the underlying multimap, and vice versa. However, adding to the returned collection is not possible.
-
entries
java.util.Collection<java.util.Map.Entry<K,V>> entries()
Returns a view collection of all key-value pairs contained in this multimap, asMap.Entry
instances.Changes to the returned collection or the entries it contains will update the underlying multimap, and vice versa. However, adding to the returned collection is not possible.
-
forEach
default void forEach(java.util.function.BiConsumer<? super K,? super V> action)
Performs the given action for all key-value pairs contained in this multimap. If an ordering is specified by theMultimap
implementation, actions will be performed in the order of iteration ofentries()
. Exceptions thrown by the action are relayed to the caller.To loop over all keys and their associated value collections, write
Multimaps.asMap(multimap).forEach((key, valueCollection) -> action())
.- Since:
- 21.0
-
asMap
java.util.Map<K,java.util.Collection<V>> asMap()
Returns a view of this multimap as aMap
from each distinct key to the nonempty collection of that key's associated values. Note thatthis.asMap().get(k)
is equivalent tothis.get(k)
only whenk
is a key contained in the multimap; otherwise it returnsnull
as opposed to an empty collection.Changes to the returned map or the collections that serve as its values will update the underlying multimap, and vice versa. The map does not support
put
orputAll
, nor do its entries supportsetValue
.
-
equals
boolean equals(@CheckForNull java.lang.Object obj)
Compares the specified object with this multimap for equality. Two multimaps are equal when their map views, as returned byasMap()
, are also equal.In general, two multimaps with identical key-value mappings may or may not be equal, depending on the implementation. For example, two
SetMultimap
instances with the same key-value mappings are equal, but equality of twoListMultimap
instances depends on the ordering of the values for each key.A non-empty
SetMultimap
cannot be equal to a non-emptyListMultimap
, since theirasMap()
views contain unequal collections as values. However, any two empty multimaps are equal, because they both have emptyasMap()
views.- Overrides:
equals
in classjava.lang.Object
-
hashCode
int hashCode()
Returns the hash code for this multimap.The hash code of a multimap is defined as the hash code of the map view, as returned by
asMap()
.In general, two multimaps with identical key-value mappings may or may not have the same hash codes, depending on the implementation. For example, two
SetMultimap
instances with the same key-value mappings will have the samehashCode
, but thehashCode
ofListMultimap
instances depends on the ordering of the values for each key.- Overrides:
hashCode
in classjava.lang.Object
-
-