Class TreeMultimap<K,V>
- java.lang.Object
-
- org.glassfish.jersey.internal.guava.TreeMultimap<K,V>
-
- All Implemented Interfaces:
Serializable,Multimap<K,V>,SetMultimap<K,V>,SortedSetMultimap<K,V>
public class TreeMultimap<K,V> extends Object
Implementation ofMultimapwhose 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
Comparableclass 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
keySetandasMapiterate through the keys according to the key comparator ordering or the natural ordering of the keys. Similarly,get,removeAll, andreplaceValuesreturn collections that iterate through the values according to the value comparator ordering or the natural ordering of the values. The collections generated byentries,keys, andvaluesiterate 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.See the Guava User Guide article on
Multimap.- Since:
- 2.0 (imported from Google Collections Library)
- Author:
- Jared Levy, Louis Wasserman
- See Also:
- Serialized Form
-
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description NavigableMap<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(Object key, Object value)Returnstrueif this multimap contains at least one key-value pair with the keykeyand the valuevalue.booleancontainsKey(Object key)Returnstrueif this multimap contains at least one key-value pair with the keykey.booleancontainsValue(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.Set<Map.Entry<K,V>>entries()Returns a view collection of all key-value pairs contained in this multimap, asMap.Entryinstances.booleanequals(Object object)Compares the specified object to this multimap for equality.NavigableSet<V>get(K key)Returns a collection view of all values associated with a key.inthashCode()Returns the hash code for this multimap.NavigableSet<K>keySet()Returns a view collection of all distinct keys contained in this multimap.booleanput(K key, V value)Stores a key-value pair in the multimap.booleanputAll(K key, Iterable<? extends V> values)Stores a key-value pair in this multimap for each ofvalues, all using the same key,key.booleanremove(Object key, Object value)Removes a single key-value pair with the keykeyand the valuevaluefrom this multimap, if such exists.SortedSet<V>removeAll(Object key)Removes all values associated with a given key.intsize()Returns the number of key-value pairs in this multimap.StringtoString()Returns a string representation of the multimap, generated by callingtoStringon the map returned byMultimap.asMap().Comparator<? super V>valueComparator()Returns the comparator that orders the multimap values, withnullindicating that natural ordering is used.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()).-
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.glassfish.jersey.internal.guava.Multimap
clear, containsEntry, containsKey, containsValue, hashCode, put, putAll, remove, size
-
Methods inherited from interface org.glassfish.jersey.internal.guava.SetMultimap
entries, equals
-
-
-
-
Method Detail
-
create
public static <K extends Comparable,V extends Comparable> TreeMultimap<K,V> create()
Creates an emptyTreeMultimapordered by the natural ordering of its keys and values.
-
valueComparator
public Comparator<? super V> valueComparator()
Description copied from interface:SortedSetMultimapReturns the comparator that orders the multimap values, withnullindicating that natural ordering is used.
-
get
public NavigableSet<V> get(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
SortedSetMultimaphas unique sorted values for a given key, this method returns aSortedSet, instead of theCollectionspecified in theMultimapinterface.
-
keySet
public NavigableSet<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.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.
-
asMap
public NavigableMap<K,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 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.
-
removeAll
public SortedSet<V> removeAll(Object key)
Removes 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 interfaceMultimap<K,V>- Specified by:
removeAllin interfaceSetMultimap<K,V>- Specified by:
removeAllin interfaceSortedSetMultimap<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.
-
values
public 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.
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 Set<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.
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.
-
equals
public boolean equals(Object object)
Compares 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.
-
size
public 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
public boolean containsKey(Object key)
Description copied from interface:MultimapReturnstrueif this multimap contains at least one key-value pair with the keykey.- Specified by:
containsKeyin interfaceMultimap<K,V>
-
clear
public void clear()
Description copied from interface:MultimapRemoves all key-value pairs from the multimap, leaving it empty.
-
containsValue
public boolean containsValue(Object value)
Description copied from interface:MultimapReturnstrueif this multimap contains at least one key-value pair with the valuevalue.- Specified by:
containsValuein interfaceMultimap<K,V>
-
containsEntry
public boolean containsEntry(Object key, Object value)
Description copied from interface:MultimapReturnstrueif this multimap contains at least one key-value pair with the keykeyand the valuevalue.- Specified by:
containsEntryin interfaceMultimap<K,V>
-
remove
public boolean remove(Object key, Object value)
Description 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.
-
putAll
public boolean putAll(K key, Iterable<? extends V> values)
Description 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):<p> for (V value : values) { put(key, value); }In particular, this is a no-op if
valuesis empty.
-
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 String toString()
Returns a string representation of the multimap, generated by callingtoStringon the map returned byMultimap.asMap().
-
-