HashMap源码学习

jdk1.8

构造方法【4个】

无参构造方法

    public HashMap() {
        this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
    }

单个整型参数构造方法

    public HashMap(int initialCapacity) {
        this(initialCapacity, DEFAULT_LOAD_FACTOR);
    }

两个参数构造方法【int， float】

    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);
    }

一个Map参数的构造方法

    public HashMap(Map<? extends K, ? extends V> m) {
        this.loadFactor = DEFAULT_LOAD_FACTOR;
        putMapEntries(m, false);
    }

可以发现在不同的构造方法中loadFactor 都有出现.默认值如下：

    static final float DEFAULT_LOAD_FACTOR = 0.75f;

常用方法

设置K V键值对

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

	// 根据key计算出int型hash值
	// key等于null，直接返回0，换言之，hashmap支持null Key，并且都放在hash值为0的地方
    static final int hash(Object key) {
        int h;
        return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
    }
	
	//将上面方法拆开,hashCode方法不用多说
	// ^ 异或运算符，相同为0，相反为1  >>> 无符号右移，忽略符号位，补零
	// int 4字节 ，也就是32位，无符号右移16，也就是左边16位为0，右边16位为原来的左边16位
	// 异或运算结果： 左边16是原来h的左边16位，右边16位 是h的左边16位 和 h右边的16位异或的结果
	static final int hashValue(Object key) {
        int hashValue = 0;
        if(key != null) {
        	int h = key.hashCode();
        	hashValue = h ^ (h >>> 16);
        }
        return hashValue;
    }

    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;
    }

未完待续。。。