(1) 初始化变量
默认初始化容量 2的幂次方
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
最大容量 int 32位 去除一位符号位 左移30位 即最大
static final int MAXIMUM_CAPACITY = 1 << 30;
现有容器已用数量与容器大小之比达到0.75,扩容
static final float DEFAULT_LOAD_FACTOR = 0.75f;
单个节点链表转化数 最小值
static final int TREEIFY_THRESHOLD = 8;
扩容时所在key链表小于6 树转化成链表
static final int UNTREEIFY_THRESHOLD = 6;
单链表大于8时,需先判断容量(这里的容量不是指hashMap中元素量 指的是hashMap.node的数量)是否大于等于64,否则会rehash().
static final int MIN_TREEIFY_CAPACITY = 64;
hashMap本质是一个Node数组
transient Node<K,V>[] table;
hashMap中元素总量 通过每次操作的++ --计算
transient int size;
元素操作递增,迭代获取时校验,校验不等则抛出ConcurrentModificationException;
transient int modCount;
扩容临界值
int threshold;
比手写的迭代多了多线程校验
*.iterator
(2)主要的一个构造函数
public HashMap(int initialCapacity, float loadFactor) {
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;
//初始化容量 第一次putVal()会重新计算 只是提前计算了一个基础值
this.threshold = tableSizeFor(initialCapacity);
}
计算最接近cap的2的幂次方的值
找到第一位不为1的数 一直向后复制 最后加一 获得结果
static final int tableSizeFor(int cap) {
容量-1是为了防止2的幂次方求取
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;
}
(3) 添加数据
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
//首次添加 table 为空 resize()
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;
//比较hash以及equals()方法,满足则直接修改value
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) {
//链表长度大于8转换
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;
//达到临界值resize()
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
(4)扩容
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;
int newCap, newThr = 0;
//旧容量大于0 则容量和resize临界值翻倍
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
}
//初始化时 oldThr的值赋值给容器cap
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);
}
//指定初始化容量oldThr有值的情况
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)
//如果节点是单个值 直接hash定位元素
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;
//扩容后相当于原来的二进制多了一位最高位1, 只需要与最高位进行与运算就可以知道元素位置是否变化
//如果为0hash定位与原来一样
if ((e.hash & oldCap) == 0) {
//首先将第一个元素放在头部,尾部存放next元素
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;
}
hashMap添加过程: 1 table是否为空 ,为空进行resize() 2 cap-1与运算求下标,没有值直接创建 3存在则equals比较,相等替换。4 不相等 则判断当前节点是否是树 5如果为红黑树 ,红黑树相关操作
6 遍历链表 如果next为空 创建新元素 ,链表长度大于8转红黑树 , next不为空则判断hash与equals()方法 7 modcount ++ 8 判断resize阈值
resize()调用地方: 1table为空 2红黑树转化发现 node数量小于64 3达到阈值