1.ConcurrentHashMap:
上面ConcurrentHashMap的特点写得不对。
1.1 JDK1.7与JDK1.8的区别:
1.2 JDK1.8 ConcurrentHashMap源码:
put方法:
public V put(K key, V value) {
return putVal(key, value, false);
}
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数组不存在,直接创建放在第一个
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,
new Node<K,V>(hash, key, value, null)))
break;
}
else if ((fh = f.hash) == MOVED) //扩容,参与扩容
tab = helpTransfer(tab, f);
else {
V oldVal = null;
synchronized (f) { //判断到node数组不为空,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;
}
get()方法:
public V get(Object key) {
Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek;
int h = spread(key.hashCode()); //获取hashCode值
if ((tab = table) != null && (n = tab.length) > 0 &&
(e = tabAt(tab, (n - 1) & h)) != null) {
if ((eh = e.hash) == h) {
if ((ek = e.key) == key || (ek != null && key.equals(ek)))
return e.val;
}
else if (eh < 0)
return (p = e.find(h, key)) != null ? p.val : null;
while ((e = e.next) != null) {
if (e.hash == h &&
((ek = e.key) == key || (ek != null && key.equals(ek))))
return e.val;
}
}
return null;
}
1.3 注意:
注:1.JDK1.8的HashMap引入红黑树,当链表的长度大于8时,转换为红黑树的结构。
2.JDK1.8 ConcurrentHashMap与HashMap很相似,除了锁之外。
3. JDK1.8 ConcurrentHashMap用Synchronized替代ReentrantLock说明:自从Synchronized引入偏向锁,轻量级锁之后性能大大提升。
2. CopyOnWriteArrayList:
2.1CopyOnWriteArrayList源码:
add()写操作:
//写操作-------在新的容器写
public boolean add(E e) {
final ReentrantLock lock = this.lock;
lock.lock();
try {
Object[] elements = getArray();
int len = elements.length;
Object[] newElements = Arrays.copyOf(elements, len + 1); //将容器的数据复制到新容器,在新的容器里做写的操作
newElements[len] = e;
setArray(newElements); //写完再将引用指向新的容器
return true;
} finally {
lock.unlock();
}
}
final void setArray(Object[] a) {
array = a;
}
get()读操作:
//读操作---在旧的容器读
public E get(int index) {
return get(getArray(), index);
}
理论上的读写分离,但并不是线程安全的。读的时候有可能在写,所以会读到旧的数据。