1 final V putVal(int hash, K key, V value, boolean onlyIfAbsent, 2 boolean evict) { 3 Node <K, V> [] tab; Node <K, V> p; int n, i; 4 if ((tab = table) == null || (n = tab.length) == 0) 5 n = (tab = resize()).length; 6 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;https://www.laipuhuo.com/articlePage/e589e5ea-3881-42a0-9cf4-b6d3aaa14cf4.html
www.laipuhuo.com/articlePage… www.laipuhuo.com/articlePage… www.laipuhuo.com/articlePage… www.laipuhuo.com/articlePage… www.laipuhuo.com/01FAA7E8E45… www.laipuhuo.com/01FBA59F88E… www.laipuhuo.com/01FFCBE344D…
38 if (++size > threshold) resize(); afterNodeInsertion(evict); return null; }
