- 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
Map, 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, the size() is 3, not 2,
and the values() collection is [1, 2, 3], not [[1, 2], [3]]. For those
times when the first style is more useful, use the multimap's asMap() view (or create a
Map<K, Collection<V>> in the first place).
Example
The following code:
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 and removeAll 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 subinterfaces ListMultimap and SetMultimap. These take their names from the fact that the collections
they return from get behave like (and, of course, implement) List and Set, respectively.
For example, the "presidents" code snippet above used a ListMultimap; if it had used a
SetMultimap instead, two presidents would have vanished, and last names might or might
not appear in chronological order.
Warning: instances of type Multimap may not implement Object.equals(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 same hashCode. 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. getnever 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
ImmutableListMultimapImmutableSetMultimap- Configure your own mutable multimap with
MultimapBuilder LinkedListMultimap(for one unusual kind of mutableMultimap)
ArrayListMultimap. In
new code, we recommend using MultimapBuilder instead: It provides better control of how
keys and values are stored.
Other Notes
As with Map, the behavior of a Multimap is not specified if key objects
already present in the multimap change in a manner that affects equals comparisons. Use
caution if mutable objects are used as keys in a Multimap.
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
Modifier and TypeMethodDescriptionMap<K, Collection<V>> asMap()Returns a view of this multimap as aMapfrom each distinct key to the nonempty collection of that key's associated values.voidclear()Removes all key-value pairs from the multimap, leaving it empty.booleancontainsEntry(@Nullable Object key, @Nullable Object value) Returnstrueif this multimap contains at least one key-value pair with the keykeyand the valuevalue.booleancontainsKey(@Nullable Object key) Returnstrueif this multimap contains at least one key-value pair with the keykey.booleancontainsValue(@Nullable Object value) Returnstrueif this multimap contains at least one key-value pair with the valuevalue.entries()Returns a view collection of all key-value pairs contained in this multimap, asMap.Entryinstances.booleanCompares the specified object with this multimap for equality.Returns a view collection of the values associated withkeyin this multimap, if any.inthashCode()Returns the hash code for this multimap.booleanisEmpty()Returnstrueif this multimap contains no key-value pairs.keys()Returns a view collection containing the key from each key-value pair in this multimap, without collapsing duplicates.keySet()Returns a view collection of all distinct keys contained in this multimap.booleanStores a key-value pair in this multimap.booleanStores all key-value pairs ofmultimapin this multimap, in the order returned bymultimap.entries().booleanStores a key-value pair in this multimap for each ofvalues, all using the same key,key.booleanRemoves a single key-value pair with the keykeyand the valuevaluefrom this multimap, if such exists.Removes all values associated with the keykey.replaceValues(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.intsize()Returns the number of key-value pairs in this multimap.values()Returns a view collection containing the value from each key-value pair contained in this multimap, without collapsing duplicates (sovalues().size() == size()).
-
Method Details
-
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 theMultimapclass documentation for clarification. -
isEmpty
boolean isEmpty()Returnstrueif this multimap contains no key-value pairs. Equivalent tosize() == 0, but can in some cases be more efficient. -
containsKey
Returnstrueif this multimap contains at least one key-value pair with the keykey. -
containsValue
Returnstrueif this multimap contains at least one key-value pair with the valuevalue. -
containsEntry
boolean containsEntry(@CompatibleWith("K") @Nullable Object key, @CompatibleWith("V") @Nullable Object value) Returnstrueif this multimap contains at least one key-value pair with the keykeyand the valuevalue. -
put
Stores a key-value pair in this multimap.Some multimap implementations allow duplicate key-value pairs, in which case
putalways 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:
trueif the method increased the size of the multimap, orfalseif the multimap already contained the key-value pair and doesn't allow duplicates
-
remove
@CanIgnoreReturnValue boolean remove(@CompatibleWith("K") @Nullable Object key, @CompatibleWith("V") @Nullable Object value) Removes a single key-value pair with the keykeyand the valuevaluefrom this multimap, if such exists. If multiple key-value pairs in the multimap fit this description, which one is removed is unspecified.- Returns:
trueif the multimap changed
-
putAll
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
valuesis empty.- Returns:
trueif the multimap changed
-
putAll
Stores all key-value pairs ofmultimapin this multimap, in the order returned bymultimap.entries().- Returns:
trueif the multimap changed
-
replaceValues
Stores a collection of values with the same key, replacing any existing values for that key.If
valuesis 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
Removes all values associated with the keykey.Once this method returns,
keywill 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.
-
clear
void clear()Removes all key-value pairs from the multimap, leaving it empty. -
get
Returns a view collection of the values associated withkeyin 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
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
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
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
Collection<Map.Entry<K,V>> entries()Returns a view collection of all key-value pairs contained in this multimap, asMap.Entryinstances.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.
-
asMap
Map<K, Collection<V>> asMap()Returns a view of this multimap as aMapfrom each distinct key to the nonempty collection of that key's associated values. Note thatthis.asMap().get(k)is equivalent tothis.get(k)only whenkis a key contained in the multimap; otherwise it returnsnullas 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
putorputAll, nor do its entries supportsetValue. -
equals
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
SetMultimapinstances with the same key-value mappings are equal, but equality of twoListMultimapinstances depends on the ordering of the values for each key.A non-empty
SetMultimapcannot 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. -
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
SetMultimapinstances with the same key-value mappings will have the samehashCode, but thehashCodeofListMultimapinstances depends on the ordering of the values for each key.
-