为什么会有CopyOnWriteArrayList?
咱们晓得ArrayList和LinkedList实现的List都是非线程平安的,于是就有了Vector,它是基于ArrayList的线程平安汇合,但Vector无论是add办法还是get办法都加上了synchronized润饰,当多线程读写List必须排队执行,很显然这样效率比拟是低下的,那有没有一种方法让效率晋升,让当读List的时候线程是异步的,当写List是同步的呢?答案是CopyOnWriteArrayList,他是读写拆散的,益处是进步线程拜访效率,上面咱们比照下CopyOnWriteArrayList和Vector执行效率。
import java.util.Vector;import java.util.concurrent.CopyOnWriteArrayList;import java.util.concurrent.CountDownLatch;/** * @author :jiaolian * @date :Created in 2021-01-18 15:28 * @description:平安list性能比照 * @modified By: * 公众号:叫练 */public class SafeListTest { private static Vector<String> safeList = new Vector<>(); //private static CopyOnWriteArrayList<String> safeList = new CopyOnWriteArrayList<>(); private static CountDownLatch countDownLatch = new CountDownLatch(2); public static void main(String[] args) throws InterruptedException { //初始化 safeList.add("叫练"); MySerive fishSerive = new MySerive(); long start = System.currentTimeMillis(); new Thread(()->{ fishSerive.read(); countDownLatch.countDown(); },"叫练读线程").start(); new Thread(()->{ fishSerive.write(); countDownLatch.countDown(); },"叫练写线程").start(); countDownLatch.await(); System.out.println("破费:"+(System.currentTimeMillis()-start)); } private static class MySerive { //读 public void read() { for (int i=0 ;i<1000000; i++) { safeList.get(0); } } //写 public void write() { for (int i=0 ;i<100000; i++) { safeList.add("叫练"); } } }}
如上代码:当平安汇合用Vector时,执行时长是100毫秒,当平安汇合用CopyOnWriteArrayList时,执行时长是5000毫秒,神码?你不是说CopyOnWriteArrayList的效率要高么?但执行状况CopyOnWriteArrayList执行的时长居然是Vector的50倍!通过翻看源码,咱们发现当CopyOnWriteArrayList写元素时是通过备份数组的形式实现的,当多线程同步强烈,数据量较大时会不停的复制数组,内存节约重大。这就是时过长的起因!然而咱们还是认可读写拆散思维!
什么是弱一致性
import java.util.Iterator;import java.util.Vector;import java.util.concurrent.CopyOnWriteArrayList;/** * @author :jiaolian * @date :Created in 2021-01-18 16:40 * @description:CopyOnWriteArrayList弱一致性 * @modified By: * 公众号:叫练 */public class WeekCopyOnWriteArrayListTest { private static CopyOnWriteArrayList<String> safeList = new CopyOnWriteArrayList<>(); //private static Vector<String> safeList = new Vector<>(); public static void main(String[] args) throws InterruptedException { safeList.add("叫"); safeList.add("练"); Iterator<String> iterator = safeList.iterator(); Thread thread = new Thread(()->{ //删除下标为0的元素 safeList.remove(0); }); thread.start(); //主线程期待thread执行实现; thread.join(); while (iterator.hasNext()) { System.out.println(iterator.next()); } }}
如上代码:主线程期待thread子线程执行结束,循环打印safeList元素,最终执行后果如下图所示
你可能会有疑难,thread不是曾经删除“叫”吗?控制台不是应该只打印一个“练”字吗?为什么还会打出“叫练”两个字,起因是main线程在执行Iterator<String> iterator = safeList.iterator();保留了元素快照,所以能看到这样的执行后果,当thread线程执行结束后,此时JVM内存状态如下图所示!
fail-safe个性
提到fail-safe,会先提到fail-fast,字面上翻译疾速失败,它是汇合疾速检测失败机制,避免汇合不正确操作!个别状况下,如果线程通过iterator形式循环汇合时,另外一个线程也批改了这个汇合,咱们测试下,如上述测试弱一致性的代码,将private static CopyOnWriteArrayList<String> safeList = new CopyOnWriteArrayList<>();换成private static Vector<String> safeList = new Vector<>();会产生什么状况呢?
如上图,java.util.ConcurrentModificationException,汇合并发批改谬误,但换成CopyOnWriteArrayList执行失常,起因是CopyOnWriteArrayList删除数据时会有汇合快照。
所以他是fail-safe,而Vector是fail-fast!
总结
总结下吧,咱们用代码简述阐明了CopyOnWriteArrayList的读写拆散,弱一致性,fail-safe,fail-safe等概念,并简述了实现原理。喜爱的请点赞加关注哦。我是叫练【公众号】,边叫边练。