Class LinkedHashMultimap<K,V>
- java.lang.Object
-
- com.google.common.collect.LinkedHashMultimap<K,V>
-
- All Implemented Interfaces:
Multimap<K,V>
,SetMultimap<K,V>
,Serializable
@GwtCompatible(serializable=true, emulated=true) public final class LinkedHashMultimap<K,V> extends Object
Implementation ofMultimap
that does not allow duplicate key-value entries and that returns collections whose iterators follow the ordering in which the data was added to the multimap.The collections returned by
keySet
,keys
, andasMap
iterate through the keys in the order they were first added to the multimap. Similarly,get
,removeAll
, andreplaceValues
return collections that iterate through the values in the order they were added. The collections generated byentries
andvalues
iterate across the key-value mappings in the order they were added to the multimap.The iteration ordering of the collections generated by
keySet
,keys
, andasMap
has a few subtleties. As long as the set of keys remains unchanged, adding or removing mappings does not affect the key iteration order. However, if you remove all values associated with a key and then add the key back to the multimap, that key will come last in the key iteration order.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.
Keys and values may be null. 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.synchronizedSetMultimap(com.google.common.collect.SetMultimap<K, V>)
.See the Guava User Guide article on
Multimap
.- Since:
- 2.0
- Author:
- Jared Levy, Louis Wasserman
- See Also:
- Serialized Form
-
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description Map<K,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(@Nullable Object key, @Nullable Object value)
Returnstrue
if this multimap contains at least one key-value pair with the keykey
and the valuevalue
.boolean
containsKey(@Nullable Object key)
Returnstrue
if this multimap contains at least one key-value pair with the keykey
.boolean
containsValue(@Nullable Object value)
Returnstrue
if this multimap contains at least one key-value pair with the valuevalue
.static <K,V>
LinkedHashMultimap<K,V>create()
Creates a new, emptyLinkedHashMultimap
with the default initial capacities.static <K,V>
LinkedHashMultimap<K,V>create(int expectedKeys, int expectedValuesPerKey)
Constructs an emptyLinkedHashMultimap
with enough capacity to hold the specified numbers of keys and values without rehashing.static <K,V>
LinkedHashMultimap<K,V>create(Multimap<? extends K,? extends V> multimap)
Constructs aLinkedHashMultimap
with the same mappings as the specified multimap.Set<Map.Entry<K,V>>
entries()
Returns a set of all key-value pairs.boolean
equals(@Nullable Object object)
Compares the specified object to this multimap for equality.void
forEach(BiConsumer<? super K,? super V> action)
Performs the given action for all key-value pairs contained in this multimap.Set<V>
get(@Nullable 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.Set<K>
keySet()
Returns a view collection of all distinct keys contained in this multimap.boolean
put(@Nullable K key, @Nullable V value)
Stores a key-value pair in the multimap.boolean
putAll(@Nullable K key, Iterable<? extends V> values)
Stores a key-value pair in this multimap for each ofvalues
, all using the same key,key
.boolean
putAll(Multimap<? extends K,? extends V> multimap)
Stores all key-value pairs ofmultimap
in this multimap, in the order returned bymultimap.entries()
.boolean
remove(@Nullable Object key, @Nullable Object value)
Removes a single key-value pair with the keykey
and the valuevalue
from this multimap, if such exists.Set<V>
removeAll(@Nullable Object key)
Removes all values associated with the keykey
.Set<V>
replaceValues(@Nullable K key, 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.String
toString()
Returns a string representation of the multimap, generated by callingtoString
on the map returned byMultimap.asMap()
.Collection<V>
values()
Returns a collection of all values in the multimap.-
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface com.google.common.collect.Multimap
containsEntry, containsKey, containsValue, forEach, hashCode, isEmpty, keys, putAll, putAll, remove, size
-
-
-
-
Method Detail
-
create
public static <K,V> LinkedHashMultimap<K,V> create()
Creates a new, emptyLinkedHashMultimap
with the default initial capacities.
-
create
public static <K,V> LinkedHashMultimap<K,V> create(int expectedKeys, int expectedValuesPerKey)
Constructs an emptyLinkedHashMultimap
with enough capacity to hold the specified numbers of keys and values without rehashing.- Parameters:
expectedKeys
- the expected number of distinct keysexpectedValuesPerKey
- the expected average number of values per key- Throws:
IllegalArgumentException
- ifexpectedKeys
orexpectedValuesPerKey
is negative
-
create
public static <K,V> LinkedHashMultimap<K,V> create(Multimap<? extends K,? extends V> multimap)
Constructs aLinkedHashMultimap
with the same mappings as the specified multimap. If a key-value mapping appears multiple times in the input multimap, it only appears once in the constructed multimap. The new multimap has the sameMultimap.entries()
iteration order as the input multimap, except for excluding duplicate mappings.- Parameters:
multimap
- the multimap whose contents are copied to this multimap
-
replaceValues
@CanIgnoreReturnValue public Set<V> replaceValues(@Nullable K key, 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)
.The returned collection is immutable.
Because a
SetMultimap
has unique values for a given key, this method returns aSet
, instead of theCollection
specified in theMultimap
interface.Any duplicates in
values
will be stored in the multimap once.If
values
is not empty and the multimap already contains a mapping forkey
, thekeySet()
ordering is unchanged. However, the provided values always come last in theentries()
andvalues()
iteration orderings.- Specified by:
replaceValues
in interfaceMultimap<K,V>
- Specified by:
replaceValues
in interfaceSetMultimap<K,V>
- 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.
-
entries
public Set<Map.Entry<K,V>> entries()
Returns a set of all key-value pairs. Changes to the returned set will update the underlying multimap, and vice versa. The entries set does not support theadd
oraddAll
operations.The iterator generated by the returned set traverses the entries in the order they were added to the multimap.
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.
-
keySet
public 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.The iterator generated by the returned set traverses the keys in the order they were first added to the multimap.
Changes to the returned set will update the underlying multimap, and vice versa. However, adding to the returned set is not possible.
-
values
public 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 in the order they were added to the multimap.
-
clear
public void clear()
Description copied from interface:Multimap
Removes all key-value pairs from the multimap, leaving it empty.
-
get
public Set<V> get(@Nullable 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.
The returned collection is not serializable.
Because a
SetMultimap
has unique values for a given key, this method returns aSet
, instead of theCollection
specified in theMultimap
interface.- Specified by:
get
in interfaceMultimap<K,V>
- Specified by:
get
in interfaceSetMultimap<K,V>
-
removeAll
@CanIgnoreReturnValue public Set<V> removeAll(@Nullable 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 inMultimap.keySet()
,Multimap.asMap()
, or any other views.The returned collection is immutable.
Because a
SetMultimap
has unique values for a given key, this method returns aSet
, instead of theCollection
specified in theMultimap
interface.- Specified by:
removeAll
in interfaceMultimap<K,V>
- Specified by:
removeAll
in interfaceSetMultimap<K,V>
- Returns:
- the values that were removed (possibly empty). The returned collection may be modifiable, but updating it will have no effect on the multimap.
-
asMap
public Map<K,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
.Though the method signature doesn't say so explicitly, the returned map has
Set
values.- Specified by:
asMap
in interfaceMultimap<K,V>
- Specified by:
asMap
in interfaceSetMultimap<K,V>
-
put
@CanIgnoreReturnValue public boolean put(@Nullable K key, @Nullable V value)
Stores a key-value pair in the multimap.
-
equals
public boolean equals(@Nullable 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>
- Parameters:
object
- the reference object with which to compare.- Returns:
true
if this object is the same as the obj argument;false
otherwise.- See Also:
Object.hashCode()
,HashMap
-
size
public int size()
Description copied from interface:Multimap
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.
-
containsKey
public boolean containsKey(@Nullable Object key)
Description copied from interface:Multimap
Returnstrue
if this multimap contains at least one key-value pair with the keykey
.- Specified by:
containsKey
in interfaceMultimap<K,V>
-
forEach
public void forEach(BiConsumer<? super K,? super V> action)
Description copied from interface:Multimap
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 ofMultimap.entries()
. 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())
.
-
isEmpty
public boolean isEmpty()
Description copied from interface:Multimap
Returnstrue
if this multimap contains no key-value pairs. Equivalent tosize() == 0
, but can in some cases be more efficient.
-
containsValue
public boolean containsValue(@Nullable Object value)
Description copied from interface:Multimap
Returnstrue
if this multimap contains at least one key-value pair with the valuevalue
.- Specified by:
containsValue
in interfaceMultimap<K,V>
-
containsEntry
public boolean containsEntry(@Nullable Object key, @Nullable Object value)
Description copied from interface:Multimap
Returnstrue
if this multimap contains at least one key-value pair with the keykey
and the valuevalue
.- Specified by:
containsEntry
in interfaceMultimap<K,V>
-
remove
@CanIgnoreReturnValue public boolean remove(@Nullable Object key, @Nullable Object value)
Description copied from interface:Multimap
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.
-
putAll
@CanIgnoreReturnValue public boolean putAll(@Nullable K key, Iterable<? extends V> values)
Description copied from interface:Multimap
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.
-
putAll
@CanIgnoreReturnValue public boolean putAll(Multimap<? extends K,? extends V> multimap)
Description copied from interface:Multimap
Stores all key-value pairs ofmultimap
in this multimap, in the order returned bymultimap.entries()
.
-
keys
public Multiset<K> keys()
Description copied from interface:Multimap
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.
-
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()
.- Specified by:
hashCode
in interfaceMultimap<K,V>
- Overrides:
hashCode
in classObject
- Returns:
- a hash code value for this object.
- See Also:
Map.hashCode()
-
toString
public String toString()
Returns a string representation of the multimap, generated by callingtoString
on the map returned byMultimap.asMap()
.
-
-