put 操作:
/**
* Implements Map.put and related methods
*
* @param hash hash for key
* @param key the key
* @param value the value to put
* @param onlyIfAbsent if true, don't change existing value
* @param evict if false, the table is in creation mode.
* @return previous value, or null if none
*
* 没有给定大小就会给一个 16 位的大小
*/
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;
//判断数据是否有元数 n 数组的大小,默认是 16 (n - 1) & hash 和 n-1 % hash 是一样的 与操作是加二进制加的过程
if ((p = tab[i = (n - 1) & hash]) == null)
//没有元数直接设置值!
tab[i] = newNode(hash, key, value, null);
else {
//计算出来下标位置不为空往下走
Node<K,V> e; K k;
//hash 值计算相等,对比 key 值相等并且不为空 那么对比 equals 值如果相等覆盖
//1.key 相同,把 oldValue 替换即可
//2.形成链表
//3.按照红黑树存储!
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);
//链表转红黑树的条件 TREEIFY_THRESHOLD = 8 大于 7 也是8 以后转红黑树
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;
}
}
//替换并 return
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
//threshold初始化给的数组的给定(可以看初始化代码) size默认是 0 每次加入元数都加加, 大于了初始化扩容
//负载因子开始起作用了
if (++size > threshold)
resize(); //这个方法的作用 :一个是初始化,一个是扩容 (threshold = 容量 * 0.75 大于他就扩容)
afterNodeInsertion(evict);
return null;
}
扩容
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;
int newCap, newThr = 0;
if (oldCap > 0) {
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
newThr = oldThr << 1; // double threshold
}
else if (oldThr > 0) // initial capacity was placed in threshold
newCap = oldThr;
else { // zero initial threshold signifies using defaults
newCap = DEFAULT_INITIAL_CAPACITY;
newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
}
if (newThr == 0) {
float ft = (float)newCap * loadFactor;
newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
(int)ft : Integer.MAX_VALUE);
}
threshold = newThr;
@SuppressWarnings({"rawtypes","unchecked"})
Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
table = newTab;
//扩容后数据移动 三种情况,空的没有必要移动
//遍历方式,先数组 后链表 or 最后红黑树
//1.一个
//2. 链接
//3。红黑树
if (oldTab != null) {
//表里数组
for (int j = 0; j < oldCap; ++j) {
Node<K,V> e;
//不空才操作
if ((e = oldTab[j]) != null) {
oldTab[j] = null;
if (e.next == null)
//计算新位置
newTab[e.hash & (newCap - 1)] = e;
else if (e instanceof TreeNode) //红黑树
((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
else { // preserve order
//链表遍历位子移动
Node<K,V> loHead = null, loTail = null;
Node<K,V> hiHead = null, hiTail = null;
Node<K,V> next;
do {
next = e.next;
//与运算倒数第五位为 0 才可能为 0 意思就新的位子和旧的位置一样
if ((e.hash & oldCap) == 0) {
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
else {
if (hiTail == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
}
} while ((e = next) != null);
//原理位置一样 放在原理位置
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
// oldCapl + 原来容量的位置
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
1.8 HashMap.put 源码解读
最新推荐文章于 2022-11-23 00:04:22 发布