How to use

doubleCapacity

method

in

java.util.HashMap

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

tab = doubleCapacity();
index = hash & (tab.length - 1);

doubleCapacity();
return;

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

/**
 * Inserts all of the elements of map into this HashMap in a manner
 * suitable for use by constructors and pseudo-constructors (i.e., clone,
 * readObject). Also used by LinkedHashMap.
 */
final void constructorPutAll(Map<? extends K, ? extends V> map) {
  if (table == EMPTY_TABLE) {
    doubleCapacity(); // Don't do unchecked puts to a shared table.
  }
  for (Entry<? extends K, ? extends V> e : map.entrySet()) {
    constructorPut(e.getKey(), e.getValue());
  }
}

tab = doubleCapacity();
index = hash & (tab.length - 1);

tab = doubleCapacity();
index = hash & (tab.length - 1);

tab = doubleCapacity();
index = hash & (tab.length - 1);

doubleCapacity();
return;

doubleCapacity();
return;

doubleCapacity();
return;

tab = doubleCapacity();
index = hash & (tab.length - 1);

doubleCapacity();
return;

tab = doubleCapacity();
index = hash & (tab.length - 1);

doubleCapacity();
return;