HashMap1.8的扩容的核心方法-resize()源码分析

最新推荐文章于 2024-05-13 20:05:41 发布

躺平的乐子人

最新推荐文章于 2024-05-13 20:05:41 发布

阅读量373

点赞数

分类专栏： JAVA 文章标签： java 开发语言

本文链接：https://blog.csdn.net/weixin_73368873/article/details/126833946

版权

JAVA 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

HashMap1.8以后的扩容机制为当Node数组占用超过0.75，就进行扩容，扩容大小为原长度*2

final Node<K,V>[] resize() {
        Node<K,V>[] oldTab = table;
		//判断是否为空，是返回默认初始值16
        int oldCap = (oldTab == null) ? 0 : oldTab.length;
		//默认值为8
        int oldThr = threshold;
		//阈值和新的数组初始化
        int newCap, newThr = 0;
        if (oldCap > 0) {
		//判断hashmap的大小是否超过最大的限度2<<30
            if (oldCap >= MAXIMUM_CAPACITY) {
                threshold = Integer.MAX_VALUE;
                return oldTab;
            }
			//扩容*2
            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
		//使用无参构造函数 ，按照预置的阈值（0.75f）进行扩容
            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<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;
    }