- All Implemented Interfaces:
- Multimap<K,,- V> - SetMultimap<K,,- V> - SortedSetMultimap<K,,- V> - Serializable
Multimap whose keys and values are ordered by their natural ordering or
 by supplied comparators. In all cases, this implementation uses Comparable.compareTo(T) or
 Comparator.compare(T, T) instead of Object.equals(java.lang.Object) to determine equivalence of
 instances.
 Warning: The comparators or comparables used must be consistent with equals as
 explained by the Comparable class specification. Otherwise, the resulting multiset will
 violate the general contract of SetMultimap, which is specified in terms of Object.equals(java.lang.Object).
 
The collections returned by keySet and asMap iterate through the keys
 according to the key comparator ordering or the natural ordering of the keys. Similarly, 
 get, removeAll, and replaceValues return collections that iterate through the
 values according to the value comparator ordering or the natural ordering of the values. The
 collections generated by entries, keys, and values iterate across the
 keys according to the above key ordering, and for each key they iterate across the values
 according to the value ordering.
 
The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an existing key-value pair has no effect.
Null keys and values are permitted (provided, of course, that the respective comparators support them). All optional multimap methods are supported, and all returned views are modifiable.
This class is not threadsafe when any concurrent operations update the multimap. Concurrent
 read operations will work correctly. To allow concurrent update operations, wrap your multimap
 with a call to Multimaps.synchronizedSortedSetMultimap(com.google.common.collect.SortedSetMultimap<K, V>).
 
See the Guava User Guide article on Multimap.
- Since:
- 2.0
- Author:
- Jared Levy, Louis Wasserman
- See Also:
- 
Method SummaryModifier and TypeMethodDescriptionNavigableMap<K, Collection<V>> asMap()Returns a map view that associates each key with the corresponding values in the multimap.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.static <K extends Comparable, V extends Comparable>
 TreeMultimap<K, V> create()Creates an emptyTreeMultimapordered by the natural ordering of its keys and values.static <K extends Comparable, V extends Comparable>
 TreeMultimap<K, V> Constructs aTreeMultimap, ordered by the natural ordering of its keys and values, with the same mappings as the specified multimap.static <K extends @Nullable Object, V extends @Nullable Object>
 TreeMultimap<K, V> create(Comparator<? super K> keyComparator, Comparator<? super V> valueComparator) Creates an emptyTreeMultimapinstance using explicit comparators.entries()Returns a view collection of all key-value pairs contained in this multimap, asMap.Entryinstances.booleanCompares the specified object to this multimap for equality.Returns a collection view of all values associated with a key.inthashCode()Returns the hash code for this multimap.booleanisEmpty()Returnstrueif this multimap contains no key-value pairs.Comparator<? super K> Deprecated.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 the 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 a given key.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.toString()Returns a string representation of the multimap, generated by callingtoStringon the map returned byMultimap.asMap().Comparator<? super V> Returns the comparator that orders the multimap values, withnullindicating that natural ordering is used.values()Returns a view collection containing the value from each key-value pair contained in this multimap, without collapsing duplicates (sovalues().size() == size()).Methods inherited from class java.lang.Objectclone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface com.google.common.collect.Multimapclear, containsEntry, containsKey, containsValue, hashCode, isEmpty, keys, put, putAll, putAll, remove, sizeMethods inherited from interface com.google.common.collect.SetMultimapentries, equals
- 
Method Details- 
createCreates an emptyTreeMultimapordered by the natural ordering of its keys and values.
- 
createpublic static <K extends @Nullable Object, V extends @Nullable Object> TreeMultimap<K,V> create(Comparator<? super K> keyComparator, Comparator<? super V> valueComparator) Creates an emptyTreeMultimapinstance using explicit comparators. Neither comparator may be null; useOrdering.natural()to specify natural order.- Parameters:
- keyComparator- the comparator that determines the key ordering
- valueComparator- the comparator that determines the value ordering
 
- 
createpublic static <K extends Comparable, V extends Comparable> TreeMultimap<K,V> create(Multimap<? extends K, ? extends V> multimap) Constructs aTreeMultimap, ordered by the natural ordering of its keys and values, with the same mappings as the specified multimap.- Parameters:
- multimap- the multimap whose contents are copied to this multimap
 
- 
keyComparatorDeprecated.Use((NavigableSet<K>) multimap.keySet()).comparator()instead.Returns the comparator that orders the multimap keys.
- 
valueComparatorDescription copied from interface:SortedSetMultimapReturns the comparator that orders the multimap values, withnullindicating that natural ordering is used.
- 
getReturns a collection view of all values associated with a key. If no mappings in the multimap have the provided key, an empty collection is returned.Changes to the returned collection will update the underlying multimap, and vice versa. Because a SortedSetMultimaphas unique sorted values for a given key, this method returns aSortedSet, instead of theCollectionspecified in theMultimapinterface.- Specified by:
- getin interface- Multimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- getin interface- SetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- getin interface- SortedSetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Since:
- 14.0 (present with return type SortedSetsince 2.0)
 
- 
keySetReturns 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. Because a TreeMultimaphas unique sorted keys, this method returns aNavigableSet, instead of theSetspecified in theMultimapinterface.
- 
asMapReturns a map view that associates each key with the corresponding values in the multimap. Changes to the returned map, such as element removal, will update the underlying multimap. The map does not supportsetValueon its entries,put, orputAll.When passed a key that is present in the map, asMap().get(Object)has the same behavior asSortedSetMultimap.get(K), returning a live collection. When passed a key that is not present, however,asMap().get(Object)returnsnullinstead of an empty collection.Though the method signature doesn't say so explicitly, the returned map has SortedSetvalues.Because a TreeMultimaphas unique sorted keys, this method returns aNavigableMap, instead of theMapspecified in theMultimapinterface.- Specified by:
- asMapin interface- Multimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- asMapin interface- SetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- asMapin interface- SortedSetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Since:
- 14.0 (present with return type SortedMapsince 2.0)
 
- 
removeAllRemoves all values associated with a given key. The returned collection is immutable.Because a SortedSetMultimaphas unique sorted values for a given key, this method returns aSortedSet, instead of theCollectionspecified in theMultimapinterface.- Specified by:
- removeAllin interface- Multimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- removeAllin interface- SetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- removeAllin interface- SortedSetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Returns:
- the values that were removed (possibly empty). The returned collection may be modifiable, but updating it will have no effect on the multimap.
 
- 
replaceValuesStores a collection of values with the same key, replacing any existing values for that key. The returned collection is immutable.Because a SortedSetMultimaphas unique sorted values for a given key, this method returns aSortedSet, instead of theCollectionspecified in theMultimapinterface.Any duplicates in valueswill be stored in the multimap once.- Specified by:
- replaceValuesin interface- Multimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- replaceValuesin interface- SetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- Specified by:
- replaceValuesin interface- SortedSetMultimap<K extends @Nullable Object, V extends @Nullable Object>
- 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.
 
- 
valuesReturns 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. The iterator generated by the returned collection traverses the values for one key, followed by the values of a second key, and so on. Consequently, the values do not follow their natural ordering or the ordering of the value comparator. 
- 
entriesReturns 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. The iterator generated by the returned collection traverses the values for one key, followed by the values of a second key, and so on. Each entry is an immutable snapshot of a key-value mapping in the multimap, taken at the time the entry is returned by a method call to the collection or its iterator. Because a SetMultimaphas unique values for a given key, this method returns aSet, instead of theCollectionspecified in theMultimapinterface.
- 
putStores a key-value pair in the multimap.- Specified by:
- putin interface- Multimap<K extends @Nullable Object, V extends @Nullable Object>
- Parameters:
- key- key to store in the multimap
- value- value to store in the multimap
- Returns:
- trueif the method increased the size of the multimap, or- falseif the multimap already contained the key-value pair
 
- 
equalsCompares the specified object to this multimap for equality.Two SetMultimapinstances are equal if, for each key, they contain the same values. Equality does not depend on the ordering of keys or values.
- 
sizepublic int size()Description copied from interface:MultimapReturns 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.
- 
containsKey
- 
clear
- 
isEmpty
- 
containsValue
- 
containsEntryDescription copied from interface:MultimapReturnstrueif this multimap contains at least one key-value pair with the keykeyand the valuevalue.
- 
removeDescription copied from interface:MultimapRemoves 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.
- 
putAllDescription copied from interface:MultimapStores 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.
- 
putAllDescription copied from interface:MultimapStores all key-value pairs ofmultimapin this multimap, in the order returned bymultimap.entries().
- 
keysDescription copied from interface:MultimapReturns 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. 
- 
hashCodepublic 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 Multimap.asMap().
- 
toStringReturns a string representation of the multimap, generated by callingtoStringon the map returned byMultimap.asMap().
 
- 
((NavigableSet<K>) multimap.keySet()).comparator()instead.