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:
Important Note
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).
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);
}
... produces output such as:
Zachary: [Taylor]
John: [Adams, Adams, Tyler, Kennedy] // Remember, Quincy!
George: [Washington, Bush, Bush]
Grover: [Cleveland, Cleveland] // Two, non-consecutive terms, rep'ing NJ!
...
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 above
keys, keySet, values, entries, which are similar to the
corresponding view collections of Map
get(key) is an active view of
the values corresponding to key
The collections returned by the replaceValues and removeAll methods, which contain values that have just been removed from the multimap, are
naturally not views.
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 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.
Multimaps are commonly used in places where a Map<K, Collection<V>> would otherwise
have appeared. The differences include:
put.
get never returns null, only an empty collection.
size.
Collections.min(multimap.values()) finds the smallest value across all keys.
ImmutableListMultimap
ImmutableSetMultimap
MultimapBuilder
LinkedListMultimap (for one unusual kind of mutable Multimap)
ArrayListMultimap. In
new code, we recommend using MultimapBuilder instead: It provides better control of how
keys and values are stored.
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.
| Modifier and Type | Method and Description |
|---|---|
| public Map | asMap()
Returns a view of this multimap as a |
| public void | |
| public boolean | containsEntry(Object key, Object value)
Returns |
| public boolean | containsKey(Object key)
Returns |
| public boolean | containsValue(Object value)
Returns |
| public Collection | |
| public boolean | |
| public default void | forEach(BiConsumer<? super K, ? super V> action)
Performs the given action for all key-value pairs contained in this multimap. |
| public Collection | |
| public int | |
| public boolean | |
| public Multiset | keys()
Returns a view collection containing the key from each key-value pair in this multimap, without collapsing duplicates. |
| public Set | |
| public boolean | Returns: true if the method increased the size of the multimap, or false if the
multimap already contained the key-value pair and doesn't allow duplicatesStores a key-value pair in this multimap. |
| public boolean | |
| public boolean | |
| public boolean | |
| public Collection | |
| public Collection | 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.Stores a collection of values with the same key, replacing any existing values for that key. |
| public int | |
| public Collection | values()
Returns a view collection containing the value from each key-value pair contained in
this multimap, without collapsing duplicates (so |
| asMap | back to summary |
|---|---|
| public Map Returns a view of this multimap as a 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 | |
| clear | back to summary |
|---|---|
| public void clear() Removes all key-value pairs from the multimap, leaving it empty. | |
| containsEntry | back to summary |
|---|---|
| public boolean containsEntry(Object key, Object value) Returns | |
| containsKey | back to summary |
|---|---|
| public boolean containsKey(Object key) Returns | |
| containsValue | back to summary |
|---|---|
| public boolean containsValue(Object value) Returns | |
| entries | back to summary |
|---|---|
| public Collection Returns a view collection of all key-value pairs contained in this multimap, as 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. | |
| equals | back to summary |
|---|---|
| public boolean equals(Object obj) Compares the specified object with this multimap for equality. Two multimaps are equal when
their map views, as returned by In general, two multimaps with identical key-value mappings may or may not be equal,
depending on the implementation. For example, two A non-empty
| |
| forEach | back to summary |
|---|---|
| public default void forEach(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 the To loop over all keys and their associated value collections, write
| |
| get | back to summary |
|---|---|
| public Collection Returns a view collection of the values associated with Changes to the returned collection will update the underlying multimap, and vice versa. | |
| hashCode | back to summary |
|---|---|
| public 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
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
| |
| isEmpty | back to summary |
|---|---|
| public boolean isEmpty() Returns | |
| keys | back to summary |
|---|---|
| public Multiset 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, and
Changes to the returned multiset will update the underlying multimap, and vice versa. However, adding to the returned collection is not possible. | |
| keySet | back to summary |
|---|---|
| public Set 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. | |
| put | back to summary |
|---|---|
| public 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
| |
| putAll | back to summary |
|---|---|
| public boolean putAll(K key, Iterable<? extends V> values) Stores a key-value pair in this multimap for each of
In particular, this is a no-op if
| |
| putAll | back to summary |
|---|---|
| public boolean putAll(Multimap<? extends K, ? extends V> multimap) Stores all key-value pairs of
| |
| remove | back to summary |
|---|---|
| public boolean remove(Object key, Object value) Removes a single key-value pair with the key
| |
| removeAll | back to summary |
|---|---|
| public Collection Removes all values associated with the key Once this method returns,
| |
| replaceValues | back to summary |
|---|---|
| public Collection Stores a collection of values with the same key, replacing any existing values for that key. If
| |
| size | back to summary |
|---|---|
| public 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 | |
| values | back to summary |
|---|---|
| public Collection Returns a view collection containing the value from each key-value pair contained in
this multimap, without collapsing duplicates (so Changes to the returned collection will update the underlying multimap, and vice versa. However, adding to the returned collection is not possible. | |