目录
一、概念
HashMap基于哈希函数,使用Entry数组存储key-value对,每一个键值对组成一个Entry,key和value均可为空。在java1.8之前使用的是数组+链表的结构,java1.8及以后使用的是数组+链表+红黑树的结构。
以下基于java1.8进行分析:
二、源码梳理
1.核心属性
//默认初始容量,长度为16,必须是2的幂
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
//最大容量
static final int MAXIMUM_CAPACITY = 1 << 30;
//默认负载因子,数据超过数组大小75%时需要扩容
static final float DEFAULT_LOAD_FACTOR = 0.75f;
//链表转红黑树边界
static final int TREEIFY_THRESHOLD = 8;
//红黑树转为链表边界
static final int UNTREEIFY_THRESHOLD = 6;
//链表转为红黑树需满足节点数组长度大于等于64
static final int MIN_TREEIFY_CAPACITY = 64;
思考题:
1)为什么容量长度为2的n次幂?
2)为什么使用负载因子?
3)为什么是链表+红黑树的形式,只使用红黑树是否可行?
4)为什么内部是数组,使用list是否可行?
2.构造函数
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
}
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
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;
this.threshold = tableSizeFor(initialCapacity);
}
构造函数主要初始化了loadFactor和threshold
loadFactor:负载因子,默认0.75f
threshold:扩容阀值,容量超过这个数就需要扩容,默认为capacity * load factor
3.put方法
final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
//判断数组是否为空(null或者长度为0),为空则初始化数组
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
//通过(n - 1) & hash获取key对应的角标
//如果对应位置数值为null,则创建新节点存储k-v
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
//哈希冲突情况处理
Node<K,V> e; K k;
//哈希冲突节点key相同
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) {
//下一个节点为空,创建新节点存储k-v
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
//如果链表长度超过阀值,转化为红黑树
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
//遍历得到与key相同节点
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
//如果e不为null,则用新value替换旧值
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
//变更操作更新
++modCount;
//put后size大于发展,需要扩容
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
4.get方法
public V get(Object key) {
Node<K,V> e;
//获取节点拿到value
return (e = getNode(hash(key), key)) == null ? null : e.value;
}
final Node<K,V> getNode(int hash, Object key) {
Node<K,V>[] tab; Node<K,V> first, e; int n; K k;
//判断数组不为空 且(n - 1) & hash获取的角标对应节点不为空则继续
//否则直接返回null
if ((tab = table) != null && (n = tab.length) > 0 &&
(first = tab[(n - 1) & hash]) != null) {
//碰撞节点key相同,返回该节点
if (first.hash == hash && // always check first node
((k = first.key) == key || (key != null && key.equals(k))))
return first;
if ((e = first.next) != null) {
//判断该节点为红黑树
if (first instanceof TreeNode)
return ((TreeNode<K,V>)first).getTreeNode(hash, key);
//通过遍历获取key相同节点
do {
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
return e;
} while ((e = e.next) != null);
}
}
return null;
}
5.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;
}
//2倍容量进行扩容
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;
//该节点没有链表,直接放在新hash & (newCap - 1)数组中
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;
//拆分链表,e.hash & oldCap偶数为一队,奇数为一队
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;
}
//奇数放在新数组j+oldCap位置
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
resize过程大概分为3步:
1)初始化newCap, newThr这2个参数,如果原数组为空,则设置默认容量
2)根据参数创建新的节点数组
3)如果原数组不为空,迁移数据到新数组
思考题:
1)什么时候会调用resize(什么时候会扩容)?
2)扩容和JDK1.7有什么区别?