JDK1.7的HashMap在put元素时,如果key不存在,将会创建新的Entry,将其添加
addEntry
void addEntry(int hash, K key, V value, int bucketIndex) {
if ((size >= threshold) && (null != table[bucketIndex])) {
// 集合大小超过阈值且当前下标对应位置已存在数据,进行扩容,默认扩2倍
resize(2 * table.length);
hash = (null != key) ? hash(key) : 0;
bucketIndex = indexFor(hash, table.length);
}
createEntry(hash, key, value, bucketIndex);
}
resize
void resize(int newCapacity) {
Entry[] oldTable = table;
int oldCapacity = oldTable.length;
// 判断容量是否超过上限
if (oldCapacity == MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return;
}
Entry[] newTable = new Entry[newCapacity];
// 数据迁移的过程,此次会出现死循环
transfer(newTable, initHashSeedAsNeeded(newCapacity));
table = newTable;
threshold = (int)Math.min(newCapacity * loadFactor, MAXIMUM_CAPACITY + 1);
}
transfer
void transfer(Entry[] newTable, boolean rehash) {
int newCapacity = newTable.length;
for (Entry<K,V> e : table) {
while(null != e) {
// 获取entry在原链表(未扩容前)的next
Entry<K,V> next = e.next;
if (rehash) {
e.hash = null == e.key ? 0 : hash(e.key);
}
int i = indexFor(e.hash, newCapacity);
// 将当前entrydenetx指向新数组对应index的值,即头插法(新来的在最上面)
e.next = newTable[i];
// 将新数组对应位置占据
newTable[i] = e;
// 进入下一个节点的循环
e = next;
}
}
}
此处就会有很大问题:
假设有T1,T2两个线程同时对一个HashMap进行put操作,刚好,HashMap达到了扩容的条件,
这是两个线程都会去对这个HashMap进行扩容。
链表A-->B,假设A B扩容后,计算的index依然相同,那么他们还会存放在同一链表中
假设当T1线程进入到transfer时,先会拿到A,Entry<K,V> next = e.next拿到B,这时T1线程被挂起。
T2线程进入transfer时,先会拿到A,Entry<K,V> next = e.next拿到B,然后向下执行,将A放入index,
之后循环至B,B继续执行时,就会将B.next->A, 特别注意,新数组属于线程专属的,但AB这种Enrty是
从原数组拿到的,所以它们属于全局的,T2修改了B的next,将其指向A.
T2线程执行完之后,T1继续执行,将A放入index,循环至B, 此时B的next指向A(T2做了全局的修改),
B执行完后。循环发现B.next!=null,将其取出继续循环,即A又执行了一次,根据头插法,A的next又指向B.
当使用get获取元素时,发现A.next=B,B.next=A;形成环状,导致查询出现了死循环。
JDK1.8的尾插法
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;
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 {
// 尾插法,直接在末尾插入对应元素,不会变化原Node的next关系,所以不会出现死循环
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;
}
} while ((e = next) != null);
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
欢迎大家和帝都的雁积极互动,头脑交流会比个人埋头苦学更有效!共勉!
公众号:帝都的雁