HashMap1.7部分源码解析

HashMap1.7部分源码讲解

put

public V put(K key, V value) {
        if (table == EMPTY_TABLE) {
        	// 初始化数组
            inflateTable(threshold);
        }
        if (key == null)
            return putForNullKey(value);
        // 通过key 计算hash
        int hash = hash(key);
		// 计算数组下标
        int i = indexFor(hash, table.length);
		// 遍历指定下标的链表，如果相等的话，用新值替换旧值，并将旧值return
        for (Entry<K,V> e = table[i]; e != null; e = e.next) {
            Object k;
            if (e.hash == hash && ((k = e.key) == key || key.equals(k))) {
                V oldValue = e.value;
                e.value = value;
                e.recordAccess(this);
                return oldValue;
            }
        }
		
        modCount++;
        addEntry(hash, key, value, i);
        return null;
}


void addEntry(int hash, K key, V value, int bucketIndex) {
		//判断是否需要扩容
		//size>=预值（刚开始是16*0.75=12）并且指定下标的数据不为空才进行扩容
		//1.7是先扩容，再插入，jdk8是先插入，再扩容
        if ((size >= threshold) && (null != table[bucketIndex])) {
            resize(2 * table.length);
            hash = (null != key) ? hash(key) : 0;
            bucketIndex = indexFor(hash, table.length);
        }
        createEntry(hash, key, value, bucketIndex);
}


void createEntry(int hash, K key, V value, int bucketIndex) {
		// 获取指定下标的元素
        Entry<K,V> e = table[bucketIndex];
		// 在指定下标插入此次需要put的元素，并且让next指向之前已经存在的元素，头部插入从这里可以证明
		//头部插入的好处是不用遍历链表，jdk8改成了尾部插入
        table[bucketIndex] = new Entry<>(hash, key, value, e);
        size++;
}


void resize(int newCapacity) {
        Entry[] oldTable = table;
        int oldCapacity = oldTable.length;
        if (oldCapacity == MAXIMUM_CAPACITY) {
            threshold = Integer.MAX_VALUE;
            return;
        }

        Entry[] newTable = new Entry[newCapacity];
		// 将旧数组里边的元素移动到新数组
        transfer(newTable, initHashSeedAsNeeded(newCapacity));
        // 将扩容后的新数字赋值给table
        table = newTable;
        //计算新的扩容阈值
        threshold = (int)Math.min(newCapacity * loadFactor, MAXIMUM_CAPACITY + 1);
    }
	

	void transfer(Entry[] newTable, boolean rehash) {
        int newCapacity = newTable.length;
        for (Entry<K,V> e : table) {
            while(null != e) {
            	//这块代码，在并发场景下回产生环形链表
                Entry<K,V> next = e.next;
                if (rehash) {
                    e.hash = null == e.key ? 0 : hash(e.key);
                }
                int i = indexFor(e.hash, newCapacity);
                e.next = newTable[i];
                newTable[i] = e;
                e = next;
            }
        }
    }

transfer代码图解