合理判斷參數(shù)，就結(jié)束構(gòu)造
 	public HashMap(int initialCapacity, float loadFactor) {
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal initial capacity: " +
                                               initialCapacity);
        if (initialCapacity > MAXIMUM_CAPACITY)
            initialCapacity = MAXIMUM_CAPACITY;
        if (loadFactor <= 0 || Float.isNaN(loadFactor))
            throw new IllegalArgumentException("Illegal load factor: " +
                                               loadFactor);
        this.loadFactor = loadFactor;
        this.threshold = tableSizeFor(initialCapacity);
    }

 	 合理判斷空間大小參數(shù)，使用默認(rèn)負(fù)載參數(shù)就結(jié)束構(gòu)造
    public HashMap(int initialCapacity) {
        this(initialCapacity, DEFAULT_LOAD_FACTOR);
    }

 	 /使用默認(rèn)參數(shù)就結(jié)束構(gòu)造
    public HashMap() {
        this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
    }

	構(gòu)造一個(gè)具有相同的映射關(guān)系與指定Map一個(gè)新的HashMap。 HashMap中與默認(rèn)負(fù)載因數(shù)（0.75）和初始容量足以容納在指定的地圖的映射創(chuàng)建
    public HashMap(Map<? extends K, ? extends V> m) {
        this.loadFactor = DEFAULT_LOAD_FACTOR;
        putMapEntries(m, false);
    }

	
	//Map.Entry<K,V>是一個(gè)接口
	//Node
    static class Node<K,V> implements Map.Entry<K,V> {
        final int hash;//哈希值
        final K key;//鍵值
        V value;
        Node<K,V> next;//下一節(jié)點(diǎn)；因?yàn)槭擎湹刂贩?

        Node(int hash, K key, V value, Node<K,V> next) {
            this.hash = hash;
            this.key = key;
            this.value = value;
            this.next = next;
        }
        //other
        }

	/*單位計(jì)算key.hashCode（）和差（異或）的散列以降低的較高位。
	 因?yàn)楸硎褂霉β实膬裳诒危咨⒘械?，只有在?dāng)前的掩模將總是碰撞上述位變化。 
	 （其中著名的例子是一組浮動(dòng)鍵的小桌子控股連續(xù)整數(shù)）。
	 所以我們施加向下變換利差較高位的影響。 
	 有速度，實(shí)用，和位傳播質(zhì)量之間的權(quán)衡。 
	 由于哈希許多共同的集已合理分配（所以不要蔓延受益），因?yàn)槲覀冇脴鋪?lái)處理大型成套碰撞的垃圾箱，
	 我們只是XOR一些最便宜的方式轉(zhuǎn)移位降低系統(tǒng)lossage，
	 以及納入，否則將永遠(yuǎn)不會(huì)因?yàn)楸斫绲闹笖?shù)計(jì)算中使用的最高位的影響。
	 */

	 static final int hash(Object key) {
        int h;
        return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
    }
    
    public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);
    }
 	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
     * @param evict if false, the table is in creation mode.
     * @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;
        if ((p = tab[i = (n - 1) & hash]) == null)
            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)
                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 void treeifyBin(Node<K,V>[] tab, int hash) {
        int n, index; Node<K,V> e;
        if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
            resize();
        else if ((e = tab[index = (n - 1) & hash]) != null) {
            TreeNode<K,V> hd = null, tl = null;
            do {
                TreeNode<K,V> p = replacementTreeNode(e, null);
                if (tl == null)
                    hd = p;
                else {
                    p.prev = tl;
                    tl.next = p;
                }
                tl = p;
            } while ((e = e.next) != null);
            if ((tab[index] = hd) != null)
                hd.treeify(tab);
        }
    }

//紅黑樹構(gòu)造類
static final class TreeNode<K,V> extends LinkedHashMap.Entry<K,V> {
        TreeNode<K,V> parent;  // red-black tree links
        TreeNode<K,V> left;
        TreeNode<K,V> right;
        TreeNode<K,V> prev;    // needed to unlink next upon deletion
        boolean red;//是紅節(jié)點(diǎn)嗎
        TreeNode(int hash, K key, V val, Node<K,V> next) {
            super(hash, key, val, next);
        }
        }