什么时候HashMap会进行再散列?
//第一次添加数据,threshold=12;添加第13个数据时,进行重构散列表
if (++size > threshold)
resize();
/**
* 初始化返回默认容量16的Node<K,V>[]数组,并赋值table
* threshold=DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY,12
*
* 散列表保存数据过多,影响查找性能;扩容进行再散列
*/
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
//原集合容量即,table数组大小(0/16)
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;//初始化时为0;重构时12
int newCap, newThr = 0;
if (oldCap > 0) {
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
//新容量扩充为两倍32
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
newThr = oldThr << 1; //两倍
}
else if (oldThr > 0) // initial capacity was placed in threshold
newCap = oldThr;
else { // 第一次初始化table
newCap = DEFAULT_INITIAL_CAPACITY;//默认容量16
newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);//0.75*16=12
}
if (newThr == 0) {
float ft = (float)newCap * loadFactor;
newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
(int)ft : Integer.MAX_VALUE);
}
threshold = newThr;//12
@SuppressWarnings({"rawtypes","unchecked"})
//创建 Node<K,V>数组
Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
table = newTab;
//进行复制,重新分配散列表分布
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;//e.hash & (newCap - 1)计算索引
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;
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;//尾节点,下次添加next节点方便
}
} while ((e = next) != null);
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;//添加索引至j + oldCap
}
}
}
}
}
return newTab;
}
原数组集合会改变存储位置,但索引元素链不会拆分