首先,hashMap存储结构类似于位桶,总体结构是
位桶+链表+红黑树,
这与之前版本的实现有所改进。
常量域
默认容量16
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4;
最大容量2的30次方
static final int MAXIMUM_CAPACITY = 1 << 30;
默认加载因子
static final float DEFAULT_LOAD_FACTOR = 0.75f;
这是链表转换为红黑树的门槛值,即对于一个桶中的节点大于8时,就改为红黑树存储
static final int TREEIFY_THRESHOLD = 8;
和上面是逆过程,红黑树中节点少于6时,改为链表
static final int UNTREEIFY_THRESHOLD = 6;
table中最少要有64个节点才会转换为红黑树
static final int MIN_TREEIFY_CAPACITY = 64;
Hashmap的成员变量
Node<K,V>[] table;//保存key-value健值对的数组,在第一次插入时初始化
Set<Map.Entry<K,V>> entrySet
int size;//hashMap中key-value健值对的数量
int modCount;//修改次数,在有效的put和remove操作中会自增1,主要用在迭代器中
final Node<K,V> nextNode() {
Node<K,V>[] t;
Node<K,V> e = next;
if (modCount != expectedModCount)
throw new ConcurrentModificationException();
if (e == null)
throw new NoSuchElementException();
if ((next = (current = e).next) == null && (t = table) != null) {
do {} while (index < t.length && (next = t[index++]) == null);
}
return e;
}
即迭代过程中,如果执行了put或remove操作,导致modCount与开始迭代前expectedModCount的值不一样,会抛出异常
int threshold;//门槛值,大于这个值时将会进行resize操作
float loadFactor//加载因子,默认0.75
1.构造方法
HashMap共有4个构造方法
public HashMap()
public HashMap(int initialCapacity)
public HashMap(int initialCapacity, float loadFactor)
public HashMap(Map<? extends K, ? extends V> m)
这里说下第三个
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);
}
中的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;
}
对于参数cap,它将返回比cap大且最小的2的整数次方对,例如10,它返回16。
算法原理即是每次向右移动2的0次方、1次方。。。然后与n相或,这系列计算后会得到从n的二进制数从左到右不为0的位起,将后面的位全部变为1,即n=10 =00001010,会变为00001111=15,在返回时+1变为16
2.put的方法
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
转到 putVal方法,它是final的
//参数意义分别为
//hash key的hash值
//key 健值
//onlyIfAbsent 如果为true不改变已经存在的旧值
//evict
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
//第一次put的操作时初始化table
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
//hash计算方法是 (n - 1) & hash,如果为此处为null直接插入
//这里想到一个问题:不同的key为什么 (n - 1) & hash能相等? 对于n=10=1010,key=7=0111,
//和key=3=0011 它们的 (n - 1) & hash是相等的,可见对于任意的key, (n - 1) & hash<=10
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e; K k;
//如果当前节点即一个链表中的第一节点与要插入的值相同
//需要注意的是,hash值相等对象不一定相等,所以附带key一起比较
//这里比较过程是 p.hash == hash成立才会有可能执行 (key != null && key.equals(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 {
//因为前面已判断过一个节点,所以binCount 初始值应该是1的
for (int binCount = 0; ; ++binCount) {
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
因为前面已判断过一个节点,所以binCount 实际应该+1的
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;
}
}
//e != null说明插入的值已存在
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
//这方法是为 LinkedHashMap准备的
afterNodeAccess(e);
return oldValue;
}
}
//修改次数+1
++modCount;
//size>门槛值了,重新计算容量
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
再来看看treeifyBin方法
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) {
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);
}
}
这里面用到了MIN_TREEIFY_CAPACITY常量,也就是说如果健值对个数少于64它依然不会转化为红黑树,它会调用了resize方法就行扩容,扩容后健值对会分散,即达到一个链表中的健值对个数不大于8.
再看resize方法
这之前我们看看什么情况会进行reszie操作,即扩容操作
(1)前面所讲的红黑树转换时,扩容目的是为分散健值对,如何分散请看下面
(2)首次进行put的操作时,会进行初始操作,各个成员变量会赋默认值
(3)put方法中,当此时size>threshold(容量上限)时
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;//当前table门槛值,oldCap 为table的length
int newCap, newThr = 0;
//已经初始化过了
if (oldCap > 0) {
//如果已经是最大容量,table不变
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;
//扩容门槛值实际为加载因子与table长度乘积,即table
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) {
//将旧table内容转移到新table中
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;
//由于容量cap始终是2的幂次方,e.hash & oldCap只有e.hash>=oldCap时不会为0,
//其余皆为0,即在table中的位置不变
if ((e.hash & oldCap) == 0) {
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
//位置为原来index+oldCap
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;
}