hashmap在new hashmap的时候,只初始化加载因子(loadfactor).
源码如下:
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR(0.75); // all other fields defaulted
}
put(k,v)的时候,初始化链表的大小,设置默认值为16,加载因子也是0.75.
源码如下:
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
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);
else {
Node<K,V> e; K k;
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);
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;
}
}
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)
resize();
afterNodeInsertion(evict);
return null;
}
因为创建对象时,只初始化了加载因子,所以会走resize方法。
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 {
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;
}
tableSizeFor源码如下:
static final int tableSizeFor(int cap) {
int n = cap - 1;
n |= n >>> 1;
n |= n >>> 2;
n |= n >>> 4;
n |= n >>> 8;
n |= n >>> 16;
return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
}
作用:大于输入参数且最近的2的整数次幂的数.
hashmap如何把一个元素放入到map里面。
1.放第一个元素的时候,先将tab数组初始化,默认大小为16.阀值(threshold)为16 * 0.75 = 12,求得key的hash值(hash值算法如下)。
//入参key是map的key对象
static final int hash(Object key) {
int h;
return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}
2.根据hash值得到桶,将key,value的节点放入到对应的桶里面。算法如下:
//因为是第一个数,所以直接放对应的node
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
第二种情况:桶里面的数组是一个单向链表。
条件:当tab数组的长度小于64,并且数组里面节点的数量小于8的时候。代码如下:
for (int binCount = 0; ; ++binCount) {
if ((e = p.next) == null) {
//新的节点会放到最后面。
p.next = newNode(hash, key, value, null);
//如果单向链表的节点数量大于等于8,那么走treeifyBin方法
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;
}
treeifyBin实现如下:
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
//1.由于tab的长度小于64
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
//2.扩容
resize();
else if ((e = tab[index = (n - 1) & hash]) != null) {
TreeNode<K,V> hd = null, tl = null;
do {
TreeNode<K,V> p = replacementTreeNode(e, null);
if (tl == null)
hd = p;
else {
p.prev = tl;
tl.next = p;
}
tl = p;
} while ((e = e.next) != null);
if ((tab[index] = hd) != null)
hd.treeify(tab);
}
}
resize逻辑步骤如下:
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;
int newCap, newThr = 0;
//1.旧的容量>0
if (oldCap > 0) {
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
//2.新的容量是旧的容量的2倍
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
//3.新的阀值是旧的阀值得2倍
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;
//4.给数组扩容到新的长度 @SuppressWarnings({"rawtypes","unchecked"})
Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
table = newTab;
//5.旧的tab不是null,走下面流程,目前不考虑红黑树,后面补充红黑树
if (oldTab != null) {
//6.遍历oldtab数组
for (int j = 0; j < oldCap; ++j) {
Node<K,V> e;
//一个节点对应的桶是:(n - 1) & hash,n是数组容量,节点的桶就是得二进制低n-1位数对应的值.假设节点hash值是101011,那么16个长度的数组,对应的桶就是011.
if ((e = oldTab[j]) != null) {
oldTab[j] = null;
if (e.next == null)
//7.1 假设旧数组的容量是2的n次幂,那么节点对应的旧的桶就是hash值的二进制数后n-1个数,新的数组的容量是2的n+1次幂个,因为桶里面只有一个节点,并且newcap是旧数组的2倍,所以结点的新桶是节点hash值得二进制的数的n个数,但是这种情况下,最低n位不变,所以对应新桶里面还是只有一个节点。比如:数组长度是16,节点的key的hash值对应二进制数是1011011,那么旧桶就是1011,扩容后新桶就是11011,但是肯定新旧桶还是一个节点。
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;
//下面的方法,用来将一个桶里面的节点链表,根据二进制倒数第n位是否为0重新生成俩个链表(0开头和1开头的链表)
do {
next = e.next;
//下面判断倒数第n位是否为0,oldcap的第n位是1,其他位都是0,所以&之后,如果结点二进制第n位是0,那么,结果肯定是0,比如:hash值是10101101,数组长度16,那么对应桶是1101,oldCap就是10000,与的算法就是101 0 1101 & 000 1 0000,倒数第n位就是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);
//n位为0的链表,放到旧的数组对应的桶里面就可以了
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
//n位为1的链表,放到新的桶里面
if (hiTail != null) {
hiTail.next = null;
//j就是旧的桶,oldcap是n个数,将他们转化成二进制,假设原来的值是100011011101旧桶是,n是4,那么旧桶也就是j就是101,j + n 就是,1000 + 1101就是新桶的值.
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
单向链表转红黑树流程:
代码如下:
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);
else {
Node<K,V> e; K k;
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);
//下面的代码就是单向链表转成红黑树的部分逻辑
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;
}
}
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)
resize();
afterNodeInsertion(evict);
return null;
}
treeifyBin(tab, hash);
代码如下:
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
resize();
//下面的逻辑转成红黑树的逻辑
else if ((e = tab[index = (n - 1) & hash]) != null) {
//hd表示头结点,tl表示当前结点的前一个结点
TreeNode<K,V> hd = null, tl = null;
//1.单向链表转化成一个双向链表
do {
//1.1获取一个结点,p表示当前节点
TreeNode<K,V> p = replacementTreeNode(e, null);
//设置头结点
if (tl == null)
hd = p;
//构建双向链表,将当前节点的prev指向上一个结点,上一个结点的next结点指向当前节点
else {
p.prev = tl;
tl.next = p;
}
tl = p;
} while ((e = e.next) != null);
//2将双向链表转化成红黑树
if ((tab[index] = hd) != null)
hd.treeify(tab);
}
}
treeify(构建红黑树)代码如下:
红黑树的特性如下:
- 根节点是黑色的(重点)
- 没有连续的红节点(重点)
- .每个叶子节点(NIL)是黑色。 [注意:这里叶子节点,是指为空(NIL或NULL)的叶子节点!(重点)
- 每个节点颜色不是黑色,就是红色
- 新增进来的节点一定是个红色节点(重点)
final void treeify(Node<K,V>[] tab) {
TreeNode<K,V> root = null;
//x表示双向链表的头结点
for (TreeNode<K,V> x = this, next; x != null; x = next) {
//next表示下一个结点
next = (TreeNode<K,V>)x.next;
//因为是红黑树,所以要将左右结点的引用设置为空
x.left = x.right = null;
//设置跟结点,红黑树的跟结点是黑色结点
if (root == null) {
x.parent = null;
x.red = false;
root = x;
}
//设置非跟结点
else {
K k = x.key;
int h = x.hash;
Class<?> kc = null;
//根据hash值找到对应的页子节点
for (TreeNode<K,V> p = root;;) {
int dir, ph;
K pk = p.key;
if ((ph = p.hash) > h)
dir = -1;
else if (ph < h)
dir = 1;
//暂时不清楚,因为大多数情况下都会写有hash值得
else if ((kc == null &&
(kc = comparableClassFor(k)) == null) ||
(dir = compareComparables(kc, k, pk)) == 0)
dir = tieBreakOrder(k, pk);
TreeNode<K,V> xp = p;
if ((p = (dir <= 0) ? p.left : p.right) == null) {
x.parent = xp;
if (dir <= 0)
xp.left = x;
else
xp.right = x;
//调整红黑树代码如下
root = balanceInsertion(root, x);
break;
}
}
}
}
moveRootToFront(tab, root);
}
balanceInsertion代码如下:
static <K,V> TreeNode<K,V> balanceInsertion(TreeNode<K,V> root,
TreeNode<K,V> x) {
//设置最新的插入的节点为红色节点
x.red = true;
//xp表示当前节点的父节点,xpp表示祖父节点,xppl表示祖父节点的左子树节点,xppr为祖父节点的又子树节点
for (TreeNode<K,V> xp, xpp, xppl, xppr;;) {
//如果是第一个节点,那么设置当前节点为黑色结点
if ((xp = x.parent) == null) {
x.red = false;
return x;
}
//如果父节点是黑色结点,那么不用做任何调整
else if (!xp.red || (xpp = xp.parent) == null)
return root;
//如果父节点是红色节点的,这种情况分为俩种情况,需要详细介绍
if (xp == (xppl = xpp.left)) {
if ((xppr = xpp.right) != null && xppr.red) {
xppr.red = false;
xp.red = false;
xpp.red = true;
x = xpp;
}
else {
if (x == xp.right) {
root = rotateLeft(root, x = xp);
xpp = (xp = x.parent) == null ? null : xp.parent;
}
if (xp != null) {
xp.red = false;
if (xpp != null) {
xpp.red = true;
root = rotateRight(root, xpp);
}
}
}
}
else {
if (xppl != null && xppl.red) {
xppl.red = false;
xp.red = false;
xpp.red = true;
x = xpp;
}
else {
if (x == xp.left) {
root = rotateRight(root, x = xp);
xpp = (xp = x.parent) == null ? null : xp.parent;
}
if (xp != null) {
xp.red = false;
if (xpp != null) {
xpp.red = true;
root = rotateLeft(root, xpp);
}
}
}
}
}
}
父节点为空色,情况如下。
1.叔叔节点为红色,结构图如下:
上图节点特点:
1.叔叔节点为红色,并且曾祖父节点为黑色.
调整原理:以当前节点和祖父节点作为一个生态树,然后想办法,把左子树和右子树的黑色结点个数调整的和之前的节点个数一样,并且俩个红色节点不能相连
红黑树调整的规则是:
1
1.1 祖父节点涂成红色,父亲节点变成黑色,叔叔节点变成黑色
分析:之前祖父节点有一个黑色结点,现在由于左右子树都多了一个黑色结点,祖父节点少了一个黑色结点,所以祖父节点到子叶节点的黑色结点个数仍然一样.
。如下图所示:
2.叔叔节点为红色,并且曾祖父节点为红色.
调整如下:
2.1、还是以祖父节点和当前节点为一个生态树调整。和情况1一样.
2.2由于俩个红色节点相连了,并且祖父节点的左节点为红色节点。如图:
和情况1一样涂色:如图:
当前节点会变成xpppp,xpppp涂成黑色(如果是跟结点,否则再调).
情况3:
还有一种调成的情况如下:
当前节点为xpp,xppp的左子树为黑色。这种情况。
解决:xppp涂成黑色,xppp涂成红色,然后左旋.
==左旋:父节点的左子树变成祖父节点的右子树,然后,让父节点的左引用指向祖父节点。如下图:
分析原因:
xpppp涂成红色之后,他的左子树黑色结点少了1,但是xppp结点到他的子叶节点黑点个数和之前相同,所以把xppp这个黑色结点弄过来,达到它的左子树的节点也加1,达到它的左子树的个数也和之前的一样。
还有左右旋的。右左旋的,此处不赘述。
图片有的地方文字不对,后续修改。