HashMap.putVal方法解析

HashMap.putVal方法解析

final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) {
		Node<K, V>[] tab;
		Node<K, V> p;
		int n, i;
		//初始化hashmap
		if ((tab = table) == null || (n = tab.length) == 0)  
			n = (tab = resize()).length;
			//hashmap当前位置为空，直接插入
		if ((p = tab[i = (n - 1) & hash]) == null)			
			tab[i] = newNode(hash, key, value, null);
		else {						//当前位置不为空
			Node<K, V> e;
			K k;
			//当前位置的node与要插入的node相同
			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 {	//要插入的node与当前node不同且不是hashmap红黑树状态
				循环记录链表大小
				for (int binCount = 0;; ++binCount) {											
					//若当前node.next为空则插入
					if ((e = p.next) == null) {													
						p.next = newNode(hash, key, value, null);
						if (binCount >= TREEIFY_THRESHOLD - 1) //链表长度是否大于等于8
							成立则转为树
							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;
	}