| /libcore/ojluni/src/main/java/java/util/ |
| H A D | Map.java | 45 * <p>The {@code Map} interface provides three <i>collection views</i>, which
64 * empty map, and a constructor with a single argument of type {@code Map},
76 * have no effect on the map. For example, invoking the {@link #putAll(Map)}
100 * <i>not</i> be construed to imply that invoking {@code Map.containsKey}
130 public interface Map<K, V> { interface
174 * implementations of the {@code Map} interface.
298 void putAll(Map<? extends K, ? extends V> m);
362 Set<Map.Entry<K, V>> entrySet();
365 * A map entry (key-value pair). The {@code Map.entrySet} method returns
368 * iterator of this collection-view. These {@code Map
[all...] |
| H A D | IdentityHashMap.java | 35 * This class implements the <tt>Map</tt> interface with a hash table, using
39 * <tt>(k1==k2)</tt>. (In normal <tt>Map</tt> implementations (like
43 * <p><b>This class is <i>not</i> a general-purpose <tt>Map</tt>
44 * implementation! While this class implements the <tt>Map</tt> interface, it
45 * intentionally violates <tt>Map's</tt> general contract, which mandates the
98 * Map m = Collections.synchronizedMap(new IdentityHashMap(...));</pre>
132 * @see Map
141 implements Map<K,V>, java.io.Serializable, Cloneable
276 public IdentityHashMap(Map<? extends K, ? extends V> m) {
503 public void putAll(Map<
1549 forEachRemaining(Consumer<? super Map.Entry<K, V>> action) argument
1573 tryAdvance(Consumer<? super Map.Entry<K,V>> action) argument
[all...] |
| H A D | WeakHashMap.java | 36 * Hash table based implementation of the <tt>Map</tt> interface, with
43 * so this class behaves somewhat differently from other <tt>Map</tt>
69 * required) <tt>Map</tt> invariants do not hold for this class. Because
137 implements Map<K,V> {
253 public WeakHashMap(Map<? extends K, ? extends V> m) {
522 public void putAll(Map<? extends K, ? extends V> m) {
547 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
599 if (!(o instanceof Map.Entry))
602 Map.Entry<?,?> entry = (Map
1246 forEachRemaining(Consumer<? super Map.Entry<K, V>> action) argument
1282 tryAdvance(Consumer<? super Map.Entry<K,V>> action) argument
[all...] |
| H A D | HashMap.java | 35 * Hash table based implementation of the <tt>Map</tt> interface. This
91 * Map m = Collections.synchronizedMap(new HashMap(...));</pre>
123 * @see Map
131 implements Map<K,V>, Cloneable, Serializable
245 * specified <tt>Map</tt>. The <tt>HashMap</tt> is created with
247 * hold the mappings in the specified <tt>Map</tt>.
252 public HashMap(Map<? extends K, ? extends V> m) {
470 * input Map is a sorted map whose ordering is inconsistent w/ equals.
484 private void putAllForCreate(Map<? extends K, ? extends V> m) {
485 for (Map
1094 forEachRemaining(Consumer<? super Map.Entry<K,V>> action) argument
1123 tryAdvance(Consumer<? super Map.Entry<K,V>> action) argument
1330 forEach(Consumer<? super Map.Entry<K,V>> action) argument
[all...] |
| H A D | TreeMap.java | 48 * {@code Map} interface. (See {@code Comparable} or {@code Comparator} for a
50 * the {@code Map} interface is defined in terms of the {@code equals}
56 * of the {@code Map} interface.
89 * <p>All {@code Map.Entry} pairs returned by methods in this class
103 * @see Map
184 public TreeMap(Map<? extends K, ? extends V> m) {
313 public void putAll(Map<? extends K, ? extends V> map) {
684 public Map.Entry<K,V> firstEntry() {
691 public Map.Entry<K,V> lastEntry() {
698 public Map
3006 forEachRemaining(Consumer<? super Map.Entry<K, V>> action) argument
3030 tryAdvance(Consumer<? super Map.Entry<K,V>> action) argument
[all...] |
| H A D | Collections.java | 79 * @see Map
1416 public static <K,V> Map<K,V> unmodifiableMap(Map<? extends K, ? extends V> m) {
1423 private static class UnmodifiableMap<K,V> implements Map<K,V>, Serializable {
1426 private final Map<? extends K, ? extends V> m;
1428 UnmodifiableMap(Map<? extends K, ? extends V> m) {
1446 public void putAll(Map<? extends K, ? extends V> m) {
1454 private transient Set<Map.Entry<K,V>> entrySet = null;
1463 public Set<Map.Entry<K,V>> entrySet() {
1479 // Override default methods in Map
3196 addAll(Collection<? extends Map.Entry<K, V>> coll) argument
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListMap.java | 19 import java.util.Map;
56 * <p>All {@code Map.Entry} pairs returned by methods in this class
75 * <em>optional</em> methods of the {@link Map} and {@link Iterator}
162 * here because it just so happens to mesh with the Map API
1019 private Map.Entry<K,V> doRemoveFirstEntry() {
1064 private Map.Entry<K,V> doRemoveLastEntry() {
1278 public ConcurrentSkipListMap(Map<? extends K, ? extends V> m) {
1343 Iterator<? extends Map.Entry<? extends K, ? extends V>> it =
1346 Map.Entry<? extends K, ? extends V> e = it.next();
1481 /* ------ Map AP
3494 forEachRemaining(Consumer<? super Map.Entry<K,V>> action) argument
3512 tryAdvance(Consumer<? super Map.Entry<K,V>> action) argument
[all...] |
| H A D | ConcurrentHashMap.java | 20 import java.util.Map;
116 * <em>optional</em> methods of the {@link Map} and {@link Iterator}
136 * {@link java.util.Map.Entry} objects do not support method {@code
590 * user-mutable Map.Entry (i.e., one supporting setValue; see
596 static class Node<K,V> implements Map.Entry<K,V> {
620 Object k, v, u; Map.Entry<?,?> e;
621 return ((o instanceof Map.Entry) &&
622 (k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
829 public ConcurrentHashMap(Map<? extends K, ? extends V> m) {
883 // Original (since JDK1.2) Map method
3634 forEachRemaining(Consumer<? super Map.Entry<K,V>> action) argument
3640 tryAdvance(Consumer<? super Map.Entry<K,V>> action) argument
4222 forEachEntry(long parallelismThreshold, Consumer<? super Map.Entry<K,V>> action) argument
4286 reduceEntries(long parallelismThreshold, BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) argument
4827 forEach(Consumer<? super Map.Entry<K,V>> action) argument
5459 ReduceEntriesTask(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t, ReduceEntriesTask<K,V> nextRight, BiFunction<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) argument
[all...] |