Class TreeMultimap<K,V>
- java.lang.Object
-
- com.google.common.collect.TreeMultimap<K,V>
-
- All Implemented Interfaces:
Multimap<K,V>
,SetMultimap<K,V>
,SortedSetMultimap<K,V>
,java.io.Serializable
@GwtCompatible(serializable=true, emulated=true) public class TreeMultimap<K,V> extends java.lang.Object
Implementation ofMultimap
whose keys and values are ordered by their natural ordering or by supplied comparators. In all cases, this implementation usesComparable.compareTo(T)
orComparator.compare(T, T)
instead ofObject.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 ofSetMultimap
, which it is specified in terms ofObject.equals(java.lang.Object)
.The collections returned by
keySet
andasMap
iterate through the keys according to the key comparator ordering or the natural ordering of the keys. Similarly,get
,removeAll
, andreplaceValues
return collections that iterate through the values according to the value comparator ordering or the natural ordering of the values. The collections generated byentries
,keys
, andvalues
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 (imported from Google Collections Library)
- See Also:
- Serialized Form
-
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.NavigableMap<K,java.util.Collection<V>>
asMap()
Returns a map view that associates each key with the corresponding values in the multimap.void
clear()
Removes all key-value pairs from the multimap.boolean
containsEntry(java.lang.Object key, java.lang.Object value)
Returnstrue
if the multimap contains the specified key-value pair.boolean
containsKey(java.lang.Object key)
Returnstrue
if the multimap contains any values for the specified key.boolean
containsValue(java.lang.Object value)
Returnstrue
if the multimap contains the specified value for any key.static <K extends java.lang.Comparable,V extends java.lang.Comparable>
TreeMultimap<K,V>create()
Creates an emptyTreeMultimap
ordered by the natural ordering of its keys and values.static <K extends java.lang.Comparable,V extends java.lang.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.static <K,V>
TreeMultimap<K,V>create(java.util.Comparator<? super K> keyComparator, java.util.Comparator<? super V> valueComparator)
Creates an emptyTreeMultimap
instance using explicit comparators.java.util.Set<java.util.Map.Entry<K,V>>
entries()
Returns a collection of all key-value pairs.boolean
equals(java.lang.Object object)
Compares the specified object to this multimap for equality.java.util.NavigableSet<V>
get(K key)
Returns a collection view of all values associated with a key.int
hashCode()
Returns the hash code for this multimap.boolean
isEmpty()
Returnstrue
if the multimap contains no key-value pairs.java.util.Comparator<? super K>
keyComparator()
Returns the comparator that orders the multimap keys.Multiset<K>
keys()
Returns a collection, which may contain duplicates, of all keys.java.util.NavigableSet<K>
keySet()
Returns the set of all keys, each appearing once in the returned set.boolean
put(K key, V value)
Stores a key-value pair in the multimap.boolean
putAll(Multimap<? extends K,? extends V> multimap)
Copies all of another multimap's key-value pairs into this multimap.boolean
putAll(K key, java.lang.Iterable<? extends V> values)
Stores key-value pairs in this multimap with one key and multiple values.boolean
remove(java.lang.Object key, java.lang.Object value)
Removes a single key-value pair from the multimap.java.util.SortedSet<V>
removeAll(java.lang.Object key)
Removes all values associated with a given key.java.util.SortedSet<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 the multimap.java.lang.String
toString()
Returns a string representation of the multimap, generated by callingtoString
on the map returned byMultimap.asMap()
.java.util.Comparator<? super V>
valueComparator()
Returns the comparator that orders the multimap values, withnull
indicating that natural ordering is used.java.util.Collection<V>
values()
Returns a collection of all values in the multimap.-
Methods inherited from interface com.google.common.collect.Multimap
clear, containsEntry, containsKey, containsValue, hashCode, isEmpty, keys, put, putAll, putAll, remove, size
-
Methods inherited from interface com.google.common.collect.SetMultimap
entries, equals
-
-
-
-
Method Detail
-
create
public static <K extends java.lang.Comparable,V extends java.lang.Comparable> TreeMultimap<K,V> create()
Creates an emptyTreeMultimap
ordered by the natural ordering of its keys and values.
-
create
public static <K,V> TreeMultimap<K,V> create(java.util.Comparator<? super K> keyComparator, java.util.Comparator<? super V> valueComparator)
Creates an emptyTreeMultimap
instance using explicit comparators. Neither comparator may be null; useOrdering.natural()
to specify natural order.- Parameters:
keyComparator
- the comparator that determines the key orderingvalueComparator
- the comparator that determines the value ordering
-
create
public static <K extends java.lang.Comparable,V extends java.lang.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
-
keyComparator
public java.util.Comparator<? super K> keyComparator()
Returns the comparator that orders the multimap keys.
-
valueComparator
public java.util.Comparator<? super V> valueComparator()
Description copied from interface:SortedSetMultimap
Returns the comparator that orders the multimap values, withnull
indicating that natural ordering is used.
-
get
@GwtIncompatible("NavigableSet") public java.util.NavigableSet<V> get(@Nullable K key)
Returns 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
SortedSetMultimap
has unique sorted values for a given key, this method returns aSortedSet
, instead of theCollection
specified in theMultimap
interface.- Specified by:
get
in interfaceMultimap<K,V>
- Specified by:
get
in interfaceSetMultimap<K,V>
- Specified by:
get
in interfaceSortedSetMultimap<K,V>
- Parameters:
key
- key to search for in multimap- Returns:
- a view collection containing the zero or more values that the key maps to
- Since:
- 14.0 (present with return type
SortedSet
since 2.0)
-
keySet
@GwtIncompatible("NavigableSet") public java.util.NavigableSet<K> keySet()
Returns the set of all keys, each appearing once in the returned set. Changes to the returned set will update the underlying multimap, and vice versa.Note that the key set contains a key if and only if this multimap maps that key to at least one value.
Because a
TreeMultimap
has unique sorted keys, this method returns aNavigableSet
, instead of theSet
specified in theMultimap
interface.
-
asMap
@GwtIncompatible("NavigableMap") public java.util.NavigableMap<K,java.util.Collection<V>> asMap()
Returns 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 supportsetValue
on 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)
returnsnull
instead of an empty collection.Though the method signature doesn't say so explicitly, the returned map has
SortedSet
values.Because a
TreeMultimap
has unique sorted keys, this method returns aNavigableMap
, instead of theMap
specified in theMultimap
interface.
-
removeAll
public java.util.SortedSet<V> removeAll(@Nullable java.lang.Object key)
Removes all values associated with a given key. The returned collection is immutable.Because a
SortedSetMultimap
has unique sorted values for a given key, this method returns aSortedSet
, instead of theCollection
specified in theMultimap
interface.- Specified by:
removeAll
in interfaceMultimap<K,V>
- Specified by:
removeAll
in interfaceSetMultimap<K,V>
- Specified by:
removeAll
in interfaceSortedSetMultimap<K,V>
- Parameters:
key
- key of entries to remove from the multimap- Returns:
- the collection of removed values, or an empty collection if no values were associated with the provided key. The collection may be modifiable, but updating it will have no effect on the multimap.
-
replaceValues
public java.util.SortedSet<V> replaceValues(@Nullable K key, java.lang.Iterable<? extends V> values)
Stores a collection of values with the same key, replacing any existing values for that key. The returned collection is immutable.Because a
SortedSetMultimap
has unique sorted values for a given key, this method returns aSortedSet
, instead of theCollection
specified in theMultimap
interface.Any duplicates in
values
will be stored in the multimap once.- Specified by:
replaceValues
in interfaceMultimap<K,V>
- Specified by:
replaceValues
in interfaceSetMultimap<K,V>
- Specified by:
replaceValues
in interfaceSortedSetMultimap<K,V>
- Parameters:
key
- key to store in the multimapvalues
- values to store in the multimap- 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.
-
values
public java.util.Collection<V> values()
Returns a collection of all values in the multimap. Changes to the returned collection will update the underlying multimap, and vice versa.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.
-
entries
public java.util.Set<java.util.Map.Entry<K,V>> entries()
Returns a collection of all key-value pairs. Changes to the returned collection will update the underlying multimap, and vice versa. The entries collection does not support theadd
oraddAll
operations.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
SetMultimap
has unique values for a given key, this method returns aSet
, instead of theCollection
specified in theMultimap
interface.- Specified by:
entries
in interfaceMultimap<K,V>
- Specified by:
entries
in interfaceSetMultimap<K,V>
- Returns:
- collection of map entries consisting of key-value pairs
-
put
public boolean put(@Nullable K key, @Nullable V value)
Stores a key-value pair in the multimap.
-
equals
public boolean equals(@Nullable java.lang.Object object)
Compares the specified object to this multimap for equality.Two
SetMultimap
instances are equal if, for each key, they contain the same values. Equality does not depend on the ordering of keys or values.- Specified by:
equals
in interfaceMultimap<K,V>
- Specified by:
equals
in interfaceSetMultimap<K,V>
-
size
public int size()
Description copied from interface:Multimap
Returns the number of key-value pairs in the multimap.
-
containsKey
public boolean containsKey(@Nullable java.lang.Object key)
Description copied from interface:Multimap
Returnstrue
if the multimap contains any values for the specified key.- Specified by:
containsKey
in interfaceMultimap<K,V>
- Parameters:
key
- key to search for in multimap
-
clear
public void clear()
Description copied from interface:Multimap
Removes all key-value pairs from the multimap.
-
isEmpty
public boolean isEmpty()
Description copied from interface:Multimap
Returnstrue
if the multimap contains no key-value pairs.
-
containsValue
public boolean containsValue(@Nullable java.lang.Object value)
Description copied from interface:Multimap
Returnstrue
if the multimap contains the specified value for any key.- Specified by:
containsValue
in interfaceMultimap<K,V>
- Parameters:
value
- value to search for in multimap
-
containsEntry
public boolean containsEntry(@Nullable java.lang.Object key, @Nullable java.lang.Object value)
Description copied from interface:Multimap
Returnstrue
if the multimap contains the specified key-value pair.- Specified by:
containsEntry
in interfaceMultimap<K,V>
- Parameters:
key
- key to search for in multimapvalue
- value to search for in multimap
-
remove
public boolean remove(@Nullable java.lang.Object key, @Nullable java.lang.Object value)
Description copied from interface:Multimap
Removes a single key-value pair from the multimap.
-
putAll
public boolean putAll(@Nullable K key, java.lang.Iterable<? extends V> values)
Description copied from interface:Multimap
Stores key-value pairs in this multimap with one key and multiple values.This is equivalent to
for (V value : values) { put(key, value); }
In particular, this is a no-op if
values
is empty.
-
putAll
public boolean putAll(Multimap<? extends K,? extends V> multimap)
Description copied from interface:Multimap
Copies all of another multimap's key-value pairs into this multimap. The order in which the mappings are added is determined bymultimap.entries()
.
-
keys
public Multiset<K> keys()
Description copied from interface:Multimap
Returns a collection, which may contain duplicates, of all keys. The number of times of key appears in the returned multiset equals the number of mappings the key has in the multimap. Changes to the returned multiset will update the underlying multimap, and vice versa.
-
hashCode
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
Multimap.asMap()
.
-
toString
public java.lang.String toString()
Returns a string representation of the multimap, generated by callingtoString
on the map returned byMultimap.asMap()
.- Overrides:
toString
in classjava.lang.Object
- Returns:
- a string representation of the multimap
-
-