【HashMap添加元素及其扩容】

Java HashMap 添加元素源代码

final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
                   boolean evict) {
        Node<K,V>[] tab; Node<K,V> p; int n, i;
//如果table未初始化,则对table进行初始化
        if ((tab = table) == null || (n = tab.length) == 0)
            n = (tab = resize()).length;
//如果根据目标元素hash值与tab数组长度与位运算求出的目标位置为null
        if ((p = tab[i = (n - 1) & hash]) == null)
//将目标元素作为一个新的node节点插入,node.next=null
            tab[i] = newNode(hash, key, value, null);
        else {
            Node<K,V> e; K k;
//如果目标位置的p与插入元素的hash相等且key相等(唯一null),或者key不为空且相等,
//令e=p便于后续替换(value)
            if (p.hash == hash &&
                ((k = p.key) == key || (key != null && key.equals(k))))
                e = p;
            else if (p instanceof TreeNode)
                e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
            else {
//遍历目标位置链表,使用尾插法新增节点或者覆盖节点,当原来链表长度达到7,
//也就是插入后链表长度达到8,执行treeifyBin(tab,hash),对数组扩容或者链表转化为红黑树
                for (int binCount = 0; ; ++binCount) {
                    if ((e = p.next) == null) {
                        p.next = newNode(hash, key, value, null);
                        if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
                            treeifyBin(tab, hash);
                        break;
                    }
                    if (e.hash == hash &&
                        ((k = e.key) == key || (key != null && key.equals(k))))
                        break;
                    p = e;
                }
            }
//假如e不为空,即已存在对应的key,则进行value替换
            if (e != null) { // existing mapping for key
                V oldValue = e.value;
                if (!onlyIfAbsent || oldValue == null)
                    e.value = value;
//访问后回调,LinkedHashMap相关
                afterNodeAccess(e);
                return oldValue;
            }
        }
//修改次数+1
        ++modCount;
//假如新增后的键值对数量值达到了容量*负载进行扩容再散列操作
        if (++size > threshold)
            resize();
//访问后回调,LinkedHashMap相关
        afterNodeInsertion(evict);
        return null;
    }