//源码如下
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;
//如果是单元素的话直接rehash过去
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;
//判断是哪一个新链表
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;
}
初步的注释写完了。
注意链表的扩容机制:
一般情况下的hash函数是
hash = h&(length-1)
由于size是2的整数次幂,则对任意(length-1)都是一堆1组成的二进制数。
将其扩容后的hash函数即是h&(length*2-1),相当于首位对多了一个1进行与运算,也就相当于h&oldLength。
举个例子:
原生的hash值为xxxx,我们的容量为4(假设)
则相当于xxxx按位与11
扩容之后相当于xxxx按位与111
只有最高位才有区别,而且区别就两种,
那也就意味着等价于判断xxxx&100是否等于0
100恰好正是我们原来的容量4
总结与详细的写一下: