put方法
public V put(K key, V value) {
return putVal(key, value, false);
}
/** Implementation for put and putIfAbsent */
final V putVal(K key, V value, boolean onlyIfAbsent) {
if (key == null || value == null) throw new NullPointerException();
//计算hash
int hash = spread(key.hashCode());
int binCount = 0;
for (Node<K,V>[] tab = table;;) {
Node<K,V> f; int n, i, fh;
//1.第一次put时初始化map,且只执行一次
if (tab == null || (n = tab.length) == 0)
tab = initTable();
//2.该位置为null则通过cas插入,
else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {
//2.1 通过cas插入如果失败则进入下次循环
if (casTabAt(tab, i, null,new Node<K,V>(hash, key, value, null)))
break; // no lock when adding to empty bin
}
//3. f.hash == MOVED 表示正在扩容,则协助其他线程扩容
else if ((fh = f.hash) == MOVED)
tab = helpTransfer(tab, f);
//4.有节点则用和hashmap一样的处理逻辑,只是包了synchronized块
else {
V oldVal = null;
synchronized (f) {
if (tabAt(tab, i) == f) {
if (fh >= 0) {
binCount = 1;
for