final Node<K,V>[] resize() {
    Node<K,V>[] oldTab = table;
    int oldCap = (oldTab == null) ? 0 : oldTab.length;
    int oldThr = threshold;
    int newCap, newThr = 0;
    //擴(kuò)容之前數(shù)組不為空
    if (oldCap > 0) {
        //容量超過最大值
        if (oldCap >= MAXIMUM_CAPACITY) {
            threshold = Integer.MAX_VALUE;
            return oldTab;
        }
        //double之后的新容量小于2的30次方且old容量大于等于16
        else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
                 oldCap >= DEFAULT_INITIAL_CAPACITY)
            // 新的threshold double
            newThr = oldThr << 1; 
    }
    //如果old thereshold 大于 0
    else if (oldThr > 0) 
        //舊的threshold 賦給 新的容量
        newCap = oldThr;
    else {//進(jìn)行初始化容量和閾值賦值               
        newCap = DEFAULT_INITIAL_CAPACITY;
        newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
    }
    if (newThr == 0) {//如果old容量為0，
        //新的閾值計(jì)算公式
        float ft = (float)newCap * loadFactor;
        //賦值
        newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
                  (int)ft : Integer.MAX_VALUE);
    }
    //新的閾值復(fù)制到當(dāng)前hashMap實(shí)例中
    threshold = newThr;
    @SuppressWarnings({"rawtypes","unchecked"})
    Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
    table = newTab;
    if (oldTab != null) {
        //遍歷old數(shù)組
        for (int j = 0; j < oldCap; ++j) {
            Node<K,V> 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<K,V>)e).split(this, newTab, j, oldCap);
                else { // preserve order
                    Node<K,V> loHead = null, loTail = null;
                    Node<K,V> hiHead = null, hiTail = null;
                    Node<K,V> next;
                    do {
                        next = e.next;
                        /**
                        設(shè)計(jì)很巧妙，整個(gè)擴(kuò)容之后的數(shù)組分為兩部分：
                                 低位      高位
                        newCap = oldCap+擴(kuò)容之后的Cap
                        **/
                        //判斷hash命中低位分布或者高位部分
                        if ((e.hash & oldCap) == 0) {//命中低位部分
                            if (loTail == null)
                                //第一次遍歷對(duì)低位部分頭節(jié)點(diǎn)進(jìn)行賦值
                                loHead = e;
                            else
                                //當(dāng)前節(jié)點(diǎn)放在鏈表最后
                                loTail.next = e;
                            //尾節(jié)點(diǎn)指針后移    
                            loTail = e;
                        }
                        //命中高位部分
                        else {
                            if (hiTail == null)
                                //第一次遍歷對(duì)低位部分頭節(jié)點(diǎn)進(jìn)行賦值
                                hiHead = e;
                            else
                                //當(dāng)前節(jié)點(diǎn)放在鏈表最后
                                hiTail.next = e;
                            hiTail = e;
                        }
                    } while ((e = next) != null);
                    if (loTail != null) {
                        loTail.next = null;
                        //將低位部分鏈表頭節(jié)點(diǎn)賦值在newTab[j]
                        newTab[j] = loHead;
                    }
                    if (hiTail != null) {
                        hiTail.next = null;
                        //將高位部分鏈表頭節(jié)點(diǎn)賦值在newTab[j+oldCap]
                        newTab[j + oldCap] = hiHead;
                    }
                }
            }
        }
    }
    return newTab;
}