put时为什么HashMap在并发环境下是不安全的？ConcurrentHashMap就安全么？

测试HashMap并发更新值被覆盖代码

import lombok.extern.slf4j.Slf4j;

import java.util.HashMap;
import java.util.Map;

/**
 * @Description:
 * @Author Be.insighted
 * @Date 2022/5/24 16:05
 */
@Slf4j
public class HashMapTest {
    private static final String TAG = "Integer";
    private static final Integer KEY[] = {1, 2, 3, 4};
    private Map<Integer, String> map = new HashMap<>();

    /**
     * 入口
     */
    public static void test() {
        for (int i = 0; i < 200; i++) {
            HashMapTest testHashMap4 = new HashMapTest();
            testHashMap4.once(i);
        }
    }

    private void once(int count) {
        log.info(TAG, "----------------------------" + count);
        newThread(KEY[0], KEY[0] + "");
        newThread(KEY[1], KEY[1] + "");
        newThread(KEY[2], KEY[2] + "");
        newThread(KEY[3], KEY[3] + "");
    }

    private void newThread(Integer k, String v) {
        new Thread(new Runnable() {
            @Override
            public void run() {
                dataOpt(k, v);
            }
        }).start();
    }

    private void dataOpt(Integer k, String v) {
        String name = Thread.currentThread().getName();
        System.out.println("put: T=" + name + "->" + "put key=" + k + ",value=" + v);
        map.put(k, v);

        String value = map.get(k);
        System.out.println("get: T=" + name + "->" + "get key=" + k + ",value=" + value);
    }

    public static void main(String[] args) {
        test();
    }

}

案发现场：

这种情况可能需要多次运行才会出现！！！

  public V put(K key, V value) {
      // 对key的hashCode()做hash
      return putVal(hash(key), key, value, false, true);
  }
  
  final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
                 boolean evict) {
      Node<K,V>[] tab; Node<K,V> p; int n, i;
      // 步骤①：table为空则创建，触发resize方法
     if ((tab = table) == null || (n = tab.length) == 0)
         n = (tab = resize()).length;
     // 步骤②：计算index，并对null做处理 
     if ((p = tab[i = (n - 1) & hash]) == null) 
         tab[i] = newNode(hash, key, value, null);
     else {
         Node<K,V> e; K k;
         // 步骤③：节点key存在，直接覆盖value
         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);  
                        //链表长度大于8转换为红黑树进行处理
                     if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st  
                         treeifyBin(tab, hash);
                     break;
                 }
                    // key已经存在直接覆盖value
                 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;
     // 步骤⑥：超过最大容量就扩容，门限原本是初始容量*0.75
     if (++size > threshold)
         resize(); //扩原来的2倍
     afterNodeInsertion(evict);
     return null;
 }

换成ConcurrentHashMap就不会出现这种问题了么？

ConcurrentHashMap并发不安全https://blog.csdn.net/Be_insighted/article/details/123714082?spm=1001.2014.3001.5502