HashMap源码解析-jdk1.8之put和resize
1.成员变量
//默认初始化容量16
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4;
//最大容量2的30次方
static final int MAXIMUM_CAPACITY = 1 << 30;
//加载因子0.75
static final float DEFAULT_LOAD_FACTOR = 0.75f;
//链表节点>8时,且数组容量>64时,该桶存储结构由链表变为红黑树
static final int TREEIFY_THRESHOLD = 8;
static final int MIN_TREEIFY_CAPACITY = 64;
//节点数为6时,该桶结构由红黑树变为链表
static final int UNTREEIFY_THRESHOLD = 6;
transient Node<K,V>[] table;
transient Set<Map.Entry<K,V>> entrySet;
//元素个数
transient int size;
//修改次数
transient int modCount;
//扩容边界值:threshold=capacity * loadfactor size>threshold扩容
int threshold;
//加载因子
final float loadFactor;
2.hashmap初始化
//方式1
HashMap map = new HashMap();
//方式2 指定容量
HashMap map = new HashMap(32);
//方式3 指定容量和加载因子
HashMap map = new HashMap(32,0.78f);
点进源码查看
//方式1 调用
public HashMap() {
//只是将加载因子loadFactor初始化
//并未初始化数组等数据
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
}
//方式2 实际调用方式3 加载因子使用默认0.75
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
//方式3
public HashMap(int initialCapacity, float loadFactor) {
//initialCapacity不符合条件抛出错误
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal initial capacity: " + initialCapacity);
//初始化容量超过最大容量,指定为最大容量
if (initialCapacity > MAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
//加载因子不符合条件抛出错误
if (loadFactor <= 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: " +
loadFactor);
this.loadFactor = loadFactor;
//将initialCapacity转化为二的整数次幂,注意值被赋给threshold,
//而不是this.threshold = tableSizeFor(initialCapacity) * this.loadFactor
//原因在resize方法中会对threshold重新计算
this.threshold = tableSizeFor(initialCapacity);
}
put 方法
hashmap 中链表Node定义 (内部类)
static class Node<K,V> implements Map.Entry<K,V> {
final int hash;
final K key;
V value;
Node<K,V> next;
Node(int hash, K key, V value, Node<K,V> next) {
this.hash = hash;
this.key = key;
this.value = value;
this.next = next;
}
put源码
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) {
//数组tab
Node<K,V>[] tab;
Node<K,V> p;
int n, i;
//表为空或者长度为0时,调用resize初始化并扩容并赋值给tab
//注意hashmap此时才涉及数组初始化
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
//根据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的引用地址值或者值相等时 e=p
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
//如果插入位置p是已经红黑树,则进行红黑树处理(暂不详细解析)
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
else {
//for循环处理 binCount同时作为计数
for (int binCount = 0; ; ++binCount) {
//循环直到链表下一个为空,插入
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
//判断如果链表深度达到8,进行红黑树判断(红黑树里面还会判断数据长度才会进行转换)
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
//判断是否有相同的数据,有直接结束 注意上面有相同判断,所以不必放在上一个if前
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
//e不等于空时,表示存在重复的值(e=p或者e=p.next()时)
if (e != null) { // existing mapping for key
V oldValue = e.value;
//替换为新值
if (!onlyIfAbsent || oldValue == null)
e.value = value;
//空方法,保留给LinkedHashMap服务的
afterNodeAccess(e);
return oldValue;
}
}
修改次数增加
++modCount;
//size 大于扩容边界值时扩容
if (++size > threshold)
resize();
//空方法,保留给LinkedHashMap服务的
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) {
// 当容量超过MAXIMUM_CAPACITY 不再进行扩容 只是将threshold等于Integer.MAX_VALUE,防止再次调用该方法,浪费cpu
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
//扩容为原来的容量的两倍 如果newCap扩容大于等于MAXIMUM_CAPACITY或者 oldCap<DEFAULT_INITIAL_CAPACITY时newThr暂不扩容,否则扩容为oldThr的两倍
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
newThr = oldThr << 1; // double threshold
}
//初始化数组容量
//接有参构造函数代码(this.threshold = tableSizeFor(initialCapacity))方式2,方式3
//实际newCap = tableSizeFor(initialCapacity) 数组容量为2的倍数
else if (oldThr > 0) // initial capacity was placed in threshold(初始容量设置为阈值)
newCap = oldThr;
// 使用默认值初始化容量和扩容临界值,对应方式1初始化
else { // zero initial threshold signifies using defaults(零初始阈值表示使用默认值)
newCap = DEFAULT_INITIAL_CAPACITY;
newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
}
//扩容临界值newThr初始化 对应方式2,3
//扩容临界值最终还是Cap * loadFactor
//解决掉this.threshold = tableSizeFor(initialCapacity)赋值问题
if (newThr == 0) {
float ft = (float)newCap * loadFactor;
//判断是否需要将扩容临界值扩容至Integer.MAX_VALUE
newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
(int)ft : Integer.MAX_VALUE);
}
//重新计算的threshold
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
//创建了两个头结点,两个尾结点
//原因 e.hash & (newCap - 1) 是用来计算数组位置参数
//扩容后根据该算法原数组上位置j的数据,移植到新数组上
//重新计算后的位置可能会是j也可能是j+原数组容量,所以需要两组结点
Node<K,V> loHead = null, loTail = null;
Node<K,V> hiHead = null, hiTail = null;
Node<K,V> next;
//遍历赋值
do {
next = e.next;
// (e.hash & oldCap) == 0 算法成立表示该结点在原位置
if ((e.hash & oldCap) == 0) {
//尾结点为空时,此时头结点没有值 头结点赋值,否则尾结点赋值
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
//j+原数组容量位置赋值
else {
if (hiTail == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
}
} while ((e = next) != null);
//尾结点不为空,则loTail.next = null,同时将链表头结点放到新数组上
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}