ArrayList
List<String> list = new ArrayList();
List<String> list = new CopyOnWriteArrayList<>(new ArrayList());
List<String> list = Collections.synchronizedList(new ArrayList());
List<String> list = new Vector<>();
/*
* 1.故障现象
* java.util.ConcurrentModificationException
*
* 2.导致原因
* 并发争抢修改导致
*
* 3.解决方案
* 3.1 new Vector()
* 3.2 Collections.synchronizedList(new ArrayList());
* 3.3 new CopyOnWriteArrayList<>(new ArrayList()); 写时复制
* */
/**
* 笔记
* 写时复制
* copyOnWrite容器即写时复制的容器。往一个容器添加元素的时候,不直接往当前容器Object[]添加,而是先将当前容器Object[]进行copy,复制出一个新的容器Object[] newElements,然后新的容器Object[] newElements里添加元素,添加完元素之后,再将原容器的引用指向新的容器 setArray(newElements);。
* 这样做的好处是可以对CopyOnWrite容器进行并发的读,而不需要加锁,因为当前容器不会添加任何元素。所以CopyOnWrite容器也是一种读写分离的思想,读和写不容的容器
*
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();
}
}
*/
HashMap
public class HashMapNotSafeDemo {
public static void main(String[] args){
//Map<String,String> map = new HashMap<>();
Map<String,String> map = new ConcurrentHashMap<>();
//Map<String,String> map = Collections.synchronizedMap(new HashMap<>());
//List<String> list = new Vector<>();
for (int i = 0; i < 30; i++) {
new Thread(()->{
map.put(Thread.currentThread().getName(),UUID.randomUUID().toString().substring(0,8));
System.out.println(map);
},String.valueOf(i)).start();
}
/**
* CopyOnWriteArraySet底层的实现其实就是CopyOnWriteArrayList
* public CopyOnWriteArraySet() {
al = new CopyOnWriteArrayList<E>();
* }
*
* HashSet的底层是HashMap,只不过是以key为map的key,value为一个Object常量
* private static final Object PRESENT = new Object();
* public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
*/
/*
* 1.故障现象
* java.util.ConcurrentModificationException
*
* 2.导致原因
* 并发争抢修改导致
*
* 3.解决方案
* 3.1 new Vector()
* 3.2 Collections.synchronizedList(new ArrayList());
* 3.3 new CopyOnWriteArrayList<>(new ArrayList()); 写时复制
* */
}
/**
* 笔记
* 写时复制
* copyOnWrite容器即写时复制的容器。往一个容器添加元素的时候,不直接往当前容器Object[]添加,而是先将当前容器Object[]进行copy,复制出一个新的容器Object[] newElements,然后新的容器Object[] newElements里添加元素,添加完元素之后,再将原容器的引用指向新的容器 setArray(newElements);。
* 这样做的好处是可以对CopyOnWrite容器进行并发的读,而不需要加锁,因为当前容器不会添加任何元素。所以CopyOnWrite容器也是一种读写分离的思想,读和写不容的容器
*
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();
}
}
*/
}
HashSet
Set<String> list = new HashSet<>();
Set<String> list = new CopyOnWriteArraySet<>();
Set<String> list = Collections.synchronizedSet(new HashSet<>());
for (int i = 0; i < 50; i++) {
new Thread(()->{
list.add(UUID.randomUUID().toString().substring(0,8));
System.out.println(list);
},String.valueOf(i)).start();
}
/**
* CopyOnWriteArraySet底层的实现其实就是CopyOnWriteArrayList
* public CopyOnWriteArraySet() {
al = new CopyOnWriteArrayList<E>();
* }
*
* HashSet的底层是HashMap,只不过是以key为map的key,value为一个Object常量
* private static final Object PRESENT = new Object();
* public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
*/
list.add("");