Hashmap源码简单讲解

和ConcurrentHashMap很相似，但是明显不如ConcurrentHashMap复杂，建议结合ConcurrentHashMap源码一起看，这里讲的更详细

HashMap

一、基本参数

 static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16

	//最大容量
    static final int MAXIMUM_CAPACITY = 1 << 30;

    static final float DEFAULT_LOAD_FACTOR = 0.75f;
	
    static final int TREEIFY_THRESHOLD = 8; //链表->红黑树阈值

    static final int UNTREEIFY_THRESHOLD = 6; //红黑树退化阈值

	//最小容量，链表个数>8也不一定会变成树，还要检查map总元素是不是>64，如果<64说明碰撞太多（总元素少，某个槽单链表个数却>8，不能忍!!!），优先扩容。
	static final int MIN_TREEIFY_CAPACITY = 64; // 

Put

public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);
}

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)  // 初始化table
            n = (tab = resize()).length;
        if ((p = tab[i = (n - 1) & hash]) == null)   //判断是否碰撞，table那个槽是空的则直接插入
            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))))  //如果第一个就命中 map经典三比较 hashcode==hashcode key==key  key.euqals(key)
                e = p;
            else if (p instanceof TreeNode)   //如果是红黑树
                e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
            else {    //如果是链表
                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;
                }
            }
            if (e != null) { // put(key,value)中的key在hashmap中找到 直接返回value
                V oldValue = e.value;
                if (!onlyIfAbsent || oldValue == null)
                    e.value = value;
                afterNodeAccess(e);
                return oldValue;
            }
        }
        ++modCount;
        if (++size > threshold)  //扩容
            resize();
        afterNodeInsertion(evict);
        return null;
    }

remove

 final Node<K,V> removeNode(int hash, Object key, Object value,
                               boolean matchValue, boolean movable) {
        Node<K,V>[] tab; Node<K,V> p; int n, index;
        if ((tab = table) != null && (n = tab.length) > 0 &&
            (p = tab[index = (n - 1) & hash]) != null) { //确定table部位null  table找到的那个下标不为null
            Node<K,V> node = null, e; K k; V v;
            if (p.hash == hash &&
                ((k = p.key) == key || (key != null && key.equals(k))))   //第一个节点直接命中则直接返回
                node = p;
            else if ((e = p.next) != null) {   //这一步是找到节点
                if (p instanceof TreeNode) //如果是红黑树
                    node = ((TreeNode<K,V>)p).getTreeNode(hash, key);
                else {       如果是链表
                    do {
                        if (e.hash == hash &&
                            ((k = e.key) == key ||
                             (key != null && key.equals(k)))) {
                            node = e;
                            break;
                        }
                        p = e;
                    } while ((e = e.next) != null);
                }
            }
            if (node != null && (!matchValue || (v = node.value) == value ||
                                 (value != null && value.equals(v)))) {   //这一步是删除节点
                if (node instanceof TreeNode)
                    ((TreeNode<K,V>)node).removeTreeNode(this, tab, movable);
                else if (node == p)
                    tab[index] = node.next;
                else
                    p.next = node.next;
                ++modCount;
                --size;
                afterNodeRemoval(node);
                return node;
            }
        }
        return null;
    }

主要过程：找到table的下标，如果第一个节点命中，之后就移除。如果没有命中则判断是链表还是红黑树，找到对应节点，之后移除