hashmap 分析

map的尺寸：transient int size;

map的修改次数：transient int modCount;

需要扩容时的大小：int threshold;

装载因子：final float loadFactor;

使用树而不是列表的bin计数阈值。当将一个元素添加到一个至少有多个节点的容器时，容器会被转换为树。这个值必须大于2并且应该至少是8来满足树里的假设

static final int TREEIFY_THRESHOLD = 8

//是否包含某key
public boolean containsKey(Object key) {
        return getNode(hash(key), key) != null;
    }
//根据key查找元素
public V get(Object key) {
        Node<K,V> e;
        return (e = getNode(hash(key), key)) == null ? null : e.value;
    }

final Node<K,V> getNode(int hash, Object key) {
        Node<K,V>[] tab; Node<K,V> first, e; int n; K k;
        if ((tab = table) != null && (n = tab.length) > 0 &&
            (first = tab[(n - 1) & hash]) != null) {   //tab不为空
            if (first.hash == hash && // always check first node
                ((k = first.key) == key || (key != null && key.equals(k))))
                return first;//如果是第一个元素，直接返回，hash相同且key相同，hash相同key不同返回null
            if ((e = first.next) != null) {            
                if (first instanceof TreeNode) //树
                    return ((TreeNode<K,V>)first).getTreeNode(hash, key);
                do {         //循环
                    if (e.hash == hash &&
                        ((k = e.key) == key || (key != null && key.equals(k))))
                        return e;
                } while ((e = e.next) != null);
            }
        }
        return null;
    }

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

/**
     * Implements Map.put and related methods
     *
     * @param hash hash for key
     * @param key the key
     * @param value the value to put
     * @param onlyIfAbsent if true, don't change existing value//onlyIfAbsent 如果是true，不改变存在的值
     * @param evict if false, the table is in creation mode.//evict 如果是false，就是咋构造新table
     * @return previous value, or null if none
     */
    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;//如果是第一次插入元素或者新构造，tab先扩容
        if ((p = tab[i = (n - 1) & hash]) == null)
            tab[i] = newNode(hash, key, value, null);//如果tab[0]是空，新建
        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)
                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) { // existing mapping for key
                V oldValue = e.value;
                if (!onlyIfAbsent || oldValue == null)
                    e.value = value;
                afterNodeAccess(e);
                return oldValue;
            }
        }
        ++modCount;
        if (++size > threshold)
            resize();
        afterNodeInsertion(evict);
        return null;
    }

扩容方法

final Node<K,V>[] resize() {
        Node<K,V>[] oldTab = table;
        int oldCap = (oldTab == null) ? 0 : oldTab.length;
        int oldThr = threshold;
        int newCap, newThr = 0;
        if (oldCap > 0) {//如果table不为空
            if (oldCap >= MAXIMUM_CAPACITY) {//如果大于等于最大值，直接返回，扩容阀值为最大值
                threshold = Integer.MAX_VALUE;
                return oldTab;
            }
            else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
                     oldCap >= DEFAULT_INITIAL_CAPACITY)//如果table长度的2倍小于数组最大长度
                newThr = oldThr << 1; // double threshold//新的阀值直接2倍
        }
        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;
            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) {//循环原始table
                Node<K,V> e;
                if ((e = oldTab[j]) != null) {
                    oldTab[j] = null;
                    if (e.next == null)//因为如果hashkey相同冲突的话会以链表的形式存储，e.next==null就是没冲突
                        newTab[e.hash & (newCap - 1)] = e;      //对e重新hash分配位置
                    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)//第一次进循环如果满足条件则loTail == null成立，所以头结点设为e，之后对尾节点赋值也是e，因为就这一个节点
                                    loHead = e;
                                else
                                    loTail.next = e;//第二次进的话尾节点的下一个节点指向新的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;
    }