Java HashMap什么时候进行扩容呢？

下文笔者讲述HashMap什么时间进行扩容的简介说明，如下所示:

HashMap进行扩容的时间点:   1.put元素时,会触发resize方法在内部进行扩容,将把原来的数据rehash放进扩容后的桶中，   2.数组的容量必须达到树化的容量的最小值默认64,才会进行树化，      当当前数组的容量小于64则会触发扩容条件，从而调用resize方法然后又对已有的数据rehash迁移。   3.添加完元素之后会判断当前容量是否达到了扩容阈值达到后还需要执行resize方法

final Node[] resize() { Node[] oldTab = table; int oldCap = (oldTab == null) ? 0 : oldTab.length; int oldThr = threshold; int newCap, newThr = 0; if (oldCap > 0) {     if (oldCap >= MAXIMUM_CAPACITY) {  threshold = Integer.MAX_VALUE;  return oldTab;     }     else if ((newCap = oldCap << 1) = DEFAULT_INITIAL_CAPACITY)  newThr = oldThr < 0) // initial capacity was placed in threshold     newCap = oldThr; else { // zero initial threshold signifies using defaults     newCap = DEFAULT_INITIAL_CAPACITY;     newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY); } if (newThr == 0) {     float ft = (float)newCap * loadFactor;     newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ? (int)ft : Integer.MAX_VALUE); } threshold = newThr; @SuppressWarnings({"rawtypes","unchecked"}) Node[] newTab = (Node[])new Node[newCap]; table = newTab; if (oldTab != null) {     for (int j = 0; j < oldCap; ++j) {  Node e;  if ((e = oldTab[j]) != null) {      oldTab[j] = null;      if (e.next == null)   newTab[e.hash & (newCap - 1)] = e;      else if (e instanceof TreeNode)   ((TreeNode)e).split(this, newTab, j, oldCap);      else { // preserve order   Node loHead = null, loTail = null;   Node hiHead = null, hiTail = null;   Node next;   do {next = e.next;if ((e.hash & oldCap) == 0) {    if (loTail == null) loHead = e;    else loTail.next = e;    loTail = e;}else {    if (hiTail == null) hiHead = e;    else hiTail.next = e;    hiTail = e;}   } while ((e = next) != null);   if (loTail != null) {loTail.next = null;newTab[j] = loHead;   }   if (hiTail != null) {hiTail.next = null;newTab[j + oldCap] = hiHead;   }      }  }     } } return newTab;    }