该方法的第一道流程:
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);
++modCount;
afterNodeInsertion(evict);
return null;
}
HashMap的成员变量Node<k,v>[] table为null时:
进行了一次扩容操作:https://blog.csdn.net/
qq_43079667/article/details/117655889 第四道流程
并将HashMap的成员变量Node<k,v>[] table赋值给
Node<K,V>[] tab
当Node<K,V>[] tab指定索引位置上的Node元素是null时:
将新new的Node对象放在该位置上
modCount 加1
该方法的第二道流程:与第一道流程没有多大区别
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){table!=null n!=0 ,所以不执行这里}
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
++modCount;
if (++size > threshold){size <=threshold,所以不执行这里}
afterNodeInsertion(evict);
return null;
}
该方法的第三道流程:
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){table!=null n!=0 ,所以不执行这里}
if ((p = tab[i = (n - 1) & hash]) == null){
p != null,所以不执行这里
}else{
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
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){size <=threshold,所以不执行这里}
afterNodeInsertion(evict);
return null;
}
该方法的第四道流程:
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){table!=null n!=0 ,所以不执行这里}
if ((p = tab[i = (n - 1) & hash]) == null){
p != null,所以不执行这里
}else{
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k)))){
为false,所以不执行
} else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
if (e != null) { // e不可能为null
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold){size <=threshold,所以不执行这里}
afterNodeInsertion(evict);
return null;
}
该方法的第五道流程:
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){table!=null n!=0 ,所以不执行这里}
if ((p = tab[i = (n - 1) & hash]) == null){
p != null,所以不执行这里
}else{
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k)))){
为false,所以不执行
} else if (p instanceof TreeNode){
为false,所以不执行
}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;
}
p = e;
}
}
if (e != null) { // e不可能为null
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold){size <=threshold,所以不执行这里}
afterNodeInsertion(evict);
return null;
}
该方法的第六道流程:
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){table!=null n!=0 ,所以不执行这里}
if ((p = tab[i = (n - 1) & hash]) == null){
p != null,所以不执行这里
}else{
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k)))){
为false,所以不执行
} else if (p instanceof TreeNode){
为false,所以不执行
}else {
for (int binCount = 0; ; ++binCount) {
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // e不可能为null
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold){size <=threshold,所以不执行这里}
afterNodeInsertion(evict);
return null;
}
该方法的第七道流程:
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){table!=null n!=0 ,所以不执行这里}
{放置元素的一块代码}
++modCount;
if (++size > threshold){
resize():https://blog.csdn.net/
qq_43079667/article/details/117655889
}
afterNodeInsertion(evict);
return null;
}