带你用图解源码的形式，了解HashMap的扩容！！！

---

代码

为了，清楚的看到，我直接采用整数类型的key以便直接获得hashcode
测试代码：

public static void main(String[] args) {
        HashMap map=new HashMap(8);
        map.put(0,1);
        map.put(8,2);
        map.put(16,3);
        map.put(24,4);
        map.put(1,5);
        map.put(2,6);
        map.put(32,7);
        System.out.println(map);
}
        

---

扩容过程图解

当执行完map.put(32,7);触发扩容。阈值是6

执行resize方法

final Node<K,V>[] resize() {
        Node<K,V>[] oldTab = table;
        int oldCap = (oldTab == null) ? 0 : oldTab.length;//原数组容量，本例为8
        int oldThr = threshold;//原数组阈值，本例为6，8*0.75
        int newCap, newThr = 0;//新数组容量
        if (oldCap > 0) {
            if (oldCap >= MAXIMUM_CAPACITY) {//MAXIMUM_CAPACITY = 1 << 30
                threshold = Integer.MAX_VALUE;
                return oldTab;
            }
            //新数组容量为原有的两倍
            else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
                     oldCap >= DEFAULT_INITIAL_CAPACITY)
                newThr = oldThr << 1; // double threshold
        }
        else if (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;
            //新数组阈值为新数组容量*0.75
            newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
                      (int)ft : Integer.MAX_VALUE);
        }
        threshold = newThr;
        @SuppressWarnings({"rawtypes","unchecked"})
            Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
        table = newTab;
        if (oldTab != null) {
            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;
                            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;
    }

		if (loTail != null) {
             loTail.next = null;
             newTab[j] = loHead;
         }
         if (hiTail != null) {
             hiTail.next = null;
             newTab[j + oldCap] = hiHead;
         }

低位指针放原位置，高位指针变成加上旧容量的索引位置，执行完后如图

结果：也证明了我们的图解过程

{0=1, 16=3, 32=7, 1=5, 2=6, 8=2, 24=4}

总结

hashmap在1.7版本的扩容在多线程环境下采用可能会因为链表成环死锁。
在1.8版本里采用了这种高低位指针的方式进行了优化