Lines Matching defs:multimap
38 * which the data was added to the multimap.
42 * multimap. Similarly, {@code get}, {@code removeAll}, and {@code
46 * added to the multimap.
52 * then add the key back to the multimap, that key will come last in the key
55 * <p>The multimap does not store duplicate key-value pairs. Adding a new
58 * <p>Keys and values may be null. All optional multimap methods are supported,
62 * multimap. Concurrent read operations will work correctly. To allow concurrent
63 * update operations, wrap your multimap with a call to {@link
78 * key-value pairs were added to the multimap.
107 * specified multimap. If a key-value mapping appears multiple times in the
108 * input multimap, it only appears once in the constructed multimap. The new
109 * multimap has the same {@link Multimap#entries()} iteration order as the
110 * input multimap, except for excluding duplicate mappings.
112 * @param multimap the multimap whose contents are copied to this multimap
115 Multimap<? extends K, ? extends V> multimap) {
116 return new LinkedHashMultimap<K, V>(multimap);
132 private LinkedHashMultimap(Multimap<? extends K, ? extends V> multimap) {
134 Maps.capacity(multimap.keySet().size())));
136 = new LinkedHashSet<Map.Entry<K, V>>(Maps.capacity(multimap.size()));
137 putAll(multimap);
157 * order in which key-value pairs are added to the multimap.
277 * which the key-value pairs were added to the multimap.
307 * <p>If {@code values} is not empty and the multimap already contains a
319 * update the underlying multimap, and vice versa. The entries set does not
323 * order they were added to the multimap.
326 * multimap, taken at the time the entry is returned by a method call to the
334 * Returns a collection of all values in the multimap. Changes to the returned
335 * collection will update the underlying multimap, and vice versa.
338 * in the order they were added to the multimap.