Lines Matching defs:HashMap
41 * <tt>null</tt> values and the <tt>null</tt> key. (The <tt>HashMap</tt>
51 * <tt>HashMap</tt> instance (the number of buckets) plus its size (the number
56 * <p>An instance of <tt>HashMap</tt> has two parameters that affect its
70 * the operations of the <tt>HashMap</tt> class, including
78 * <p>If many mappings are to be stored in a <tt>HashMap</tt>
100 * Map m = Collections.synchronizedMap(new HashMap(...));</pre>
137 public class HashMap<K,V> extends AbstractMap<K,V>
409 * The number of times this HashMap has been structurally modified
411 * the HashMap or otherwise modify its internal structure (e.g.,
413 * the HashMap fail-fast. (See ConcurrentModificationException).
438 * Constructs an empty <tt>HashMap</tt> with the specified initial
446 public HashMap(int initialCapacity, float loadFactor) {
460 * Constructs an empty <tt>HashMap</tt> with the specified initial
466 public HashMap(int initialCapacity) {
471 * Constructs an empty <tt>HashMap</tt> with the default initial capacity
474 public HashMap() {
479 * Constructs a new <tt>HashMap</tt> with the same mappings as the
480 * specified <tt>Map</tt>. The <tt>HashMap</tt> is created with
487 public HashMap(Map<? extends K, ? extends V> m) {
915 public final void clear() { HashMap.this.clear(); }
922 return new KeySpliterator<>(HashMap.this, 0, -1, 0, 0);
967 public final void clear() { HashMap.this.clear(); }
971 return new ValueSpliterator<>(HashMap.this, 0, -1, 0, 0);
1013 public final void clear() { HashMap.this.clear(); }
1035 return new EntrySpliterator<>(HashMap.this, 0, -1, 0, 0);
1320 * Returns a shallow copy of this <tt>HashMap</tt> instance: the keys and
1328 HashMap<K,V> result;
1330 result = (HashMap<K,V>)super.clone();
1349 * Save the state of the <tt>HashMap</tt> instance to a stream (i.e.,
1352 * @serialData The <i>capacity</i> of the HashMap (the length of the
1370 * Reconstitute the {@code HashMap} instance from a stream (i.e.,
1403 // Read the keys and values, and put the mappings in the HashMap
1482 final HashMap<K,V> map;
1489 HashMapSpliterator(HashMap<K,V> m, int origin,
1502 HashMap<K,V> m = map;
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est,
1536 HashMap<K,V> m = map;
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est,
1608 HashMap<K,V> m = map;
1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est,
1679 HashMap<K,V> m = map;
1955 final Node<K,V> untreeify(HashMap<K,V> map) {
1971 final TreeNode<K,V> putTreeVal(HashMap<K,V> map, Node<K,V>[] tab,
2027 final void removeTreeNode(HashMap<K,V> map, Node<K,V>[] tab,
2132 final void split(HashMap<K,V> map, Node<K,V>[] tab, int index, int bit) {
