Home | History | Annotate | Download | only in collect

Lines Matching refs:values

43  * replaceValues} return collections that iterate through the values in the
45 * {@code values} iterate across the key-value mappings in the order they were
51 * iteration order. However, if you remove all values associated with a key and
58 * <p>Keys and values may be null. All optional multimap methods are supported,
93 * the specified numbers of keys and values without rehashing.
96 * @param expectedValuesPerKey the expected average number of values per key
143 * <p>Creates an empty {@code LinkedHashSet} for a collection of values for
146 * @return a new {@code LinkedHashSet} containing a collection of values for
159 * @param key key to associate with values in the collection
161 * values for one key
184 <E> Collection<Map.Entry<K, E>> createEntries(Collection<E> values) {
185 // converts a collection of values into a list of key/value map entries
187 = Lists.newArrayListWithExpectedSize(values.size());
188 for (E value : values) {
202 @Override public boolean addAll(Collection<? extends V> values) {
203 boolean changed = delegate.addAll(values);
246 @Override public boolean removeAll(Collection<?> values) {
247 boolean changed = delegate.removeAll(values);
249 linkedEntries.removeAll(createEntries(values));
254 @Override public boolean retainAll(Collection<?> values) {
256 * Calling linkedEntries.retainAll() would incorrectly remove values
263 if (!values.contains(value)) {
307 * <p>If {@code values} is not empty and the multimap already contains a
309 * However, the provided values always come last in the {@link #entries()} and
310 * {@link #values()} iteration orderings.
313 @Nullable K key, Iterable<? extends V> values) {
314 return super.replaceValues(key, values);
334 * Returns a collection of all values in the multimap. Changes to the returned
337 * <p>The iterator generated by the returned collection traverses the values
340 @Override public Collection<V> values() {
341 return super.values();
349 * the first key, the number of values for that key, and the key's values,
350 * followed by successive keys and values from the entries() ordering