2021-06-13list map set 并发问题

public class ListTest {
    public static void main(String[] args) {
        //并发下List是不安全的
       //List<String> list = new ArrayList<>();  没有锁不安全
        //List<String> list = new Vector<>(); 第一种解决方案
        //List<String> list = Collections.synchronizedList(new ArrayList<>());第二种解决方案
        List<String> list = new CopyOnWriteArrayList<>();
      //CopyOnWriteArrayList 写入时服饰 COW 计算机程序设计领域的一种优化策略
        //写入时避免覆盖，造成数据问题
        //CopyOnWrite --- Vector 用synchronized 效率低下
        for (int i = 1; i <= 10; i++) {
            new Thread(()->{
                list.add(UUID.randomUUID().toString().substring(0,5));
                System.out.println(list);},String.valueOf(i)).start();
        }
    }
}

public class SetTest1 {


    public static void main(String[] args) {
        Set<String> set = new CopyOnWriteArraySet<>();
     //Hashet的底层是Hashmap
        for (int i = 1; i<= 10; i++) {
            new Thread(()->{
                set.add(UUID.randomUUID().toString().substring(0,5));
                System.out.println(set);},String.valueOf(i)).start();
        }
    }

}

public class MapTest002 {
    public static void main(String[] args) {
        //map 加载因子，初始化容量 工作中不用Hashmap  new HashMap<>(16,0.75)
        Map<String,String> map = new ConcurrentHashMap<>();

        for (int i = 1; i<= 10; i++) {
            new Thread(()->{
                map.put(Thread.currentThread().getName(),UUID.randomUUID().toString().substring(0,5));
                System.out.println(map);},String.valueOf(i)).start();
        }
    }
}