HashMap存取图解

hashMap.pus()源码:

final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) {
        Node<K,V>[] tab; Node<K,V> p; int n, i;
        if ((tab = table) == null || (n = tab.length) == 0)
            n = (tab = resize()).length;
        if ((p = tab[i = (n - 1) & hash]) == null) 
            // tab[i = (n - 1) & hash链地址法哈希碰撞获取下标,下标为空则创建一个新结点
            tab[i] = newNode(hash, key, value, null);
        else { 
            // 下标有值
            Node<K,V> e; K k;
            if (p.hash == hash &&
                ((k = p.key) == key || (key != null && key.equals(k)))) 
                // 哈希码一致值也相同
                e = p;
            else if (p instanceof TreeNode)
                //