1.HashMap源码分析
首先了解一下jdk1.8 HashMap的存储原理:链表+数组+红黑树,并且可自动扩容。
一张图加源码搞定HashMap源码
原理分析图:
//hashmap源码
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR; // 哈希表的负载因子,默认为0.75,可自己指定
}
//hashmap默认容量 static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
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; //tab为数组,p为数据节点
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length; //数组长度
if ((p = tab[i = (n - 1) & hash]) == null) //当数组中hash值不重复时,直接以数组形式存在
tab[i] = newNode(hash, key, value, null); //创建一个新节点放入数组中,节点node信息: hash、key、value、next:指向下一个节点得地址:node-->next node
else { //当数组中hash值重复时,将数据以链表形式存储
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); //上一个Node的next指向下一个节点
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) //threshold:计算扩容的阈值
resize();//resize(根据负载因子*默认容量=计算扩容的阈值 判断容量是否不足,尝试去自动扩容)
afterNodeInsertion(evict);
return null;
}
2.ConcurrentHashMap源码分析
个人看来: 只是再put操作时加入的锁和cas控制保证线程安全,基本数据结构不变。
final V putVal(K key, V value, boolean onlyIfAbsent) {
if (key == null || value == null) throw new NullPointerException();
int hash = spread(key.hashCode());
int binCount = 0;
for (Node<K,V>[] tab = table;;) {
Node<K,V> f; int n, i, fh;
if (tab == null || (n = tab.length) == 0)
tab = initTable();
else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {
if (casTabAt(tab, i, null, //cas compareAndset 利用java内部的原子性操作保证线程安全
new Node<K,V>(hash, key, value, null)))
break; // no lock when adding to empty bin
}
else if ((fh = f.hash) == MOVED)
tab = helpTransfer(tab, f);
else {
V oldVal = null;
synchronized (f) { //利用synchronized 锁机制保证线程安全
if (tabAt(tab, i) == f) {
if (fh >= 0) {
binCount = 1;
for (Node<K,V> e = f;; ++binCount) {
K ek;
if (e.hash == hash &&
((ek = e.key) == key ||
(ek != null && key.equals(ek)))) {
oldVal = e.val;
if (!onlyIfAbsent)
e.val = value;
break;
}
Node<K,V> pred = e;
if ((e = e.next) == null) {
pred.next = new Node<K,V>(hash, key,
value, null);
break;
}
}
}
else if (f instanceof TreeBin) {
Node<K,V> p;
binCount = 2;
if ((p = ((TreeBin<K,V>)f).putTreeVal(hash, key,
value)) != null) {
oldVal = p.val;
if (!onlyIfAbsent)
p.val = value;
}
}
}
}
if (binCount != 0) {
if (binCount >= TREEIFY_THRESHOLD)
treeifyBin(tab, i);
if (oldVal != null)
return oldVal;
break;
}
}
}
addCount(1L, binCount);
return null;
}
注意:以上代码都来自jdk源码。
上一篇:3.线程池的使用
[下一篇:敬请期待]