ConcurrentHashMap的特殊之处 (遍历的同时修改)

  • HashMap、arralist、linkedlist、vector不允许通过Iterator遍历的同时修改,而ConcurrentHashMap允许该行为,并且该更新对后续的遍历可见
  • public class Qiao {
        public static class T1 extends Thread
        {
            private List<Integer> list;
    
            public T1(List<Integer> list)
            {
                this.list = list;
            }
    
            public void run()
            {
                for (Integer i : list)
                {
                }
            }
        }
    
        public static class T2 extends Thread
        {
            private List<Integer> list;
    
            public T2(List<Integer> list)
            {
                this.list = list;
            }
    
            public void run()
            {
                for (int i = 0; i < list.size(); i++)
                {
                    list.remove(i);
                }
            }
        }
        public static void main(String[] args)
        {
            List<Integer> list = new Vector<Integer>();
    
            for (int i = 0; i < 10000; i++)
            {
                list.add(i);
            }
    
            T1 t1 = new T1(list);
            T2 t2 = new T2(list);
            t1.start();
            t2.start();
        }
    }
    
    结果:
    Exception in thread "Thread-0" java.util.ConcurrentModificationException
    at java.util.Vector$Itr.checkForComodification(Vector.java:1184)
    at java.util.Vector$Itr.next(Vector.java:1137)
    at cn.quantgroup.pinjamancepat.controller.Qiao$T1.run(Qiao.java:19)


    Process finished with exit code 0

      

public class Qiao2 {
    public static class T1 extends Thread {
        private Map map;

        public T1(Map map) {
            this.map = map;
        }

        public void run() {
            for (Object a : map.entrySet()) {
            }
        }
    }

    public static class T2 extends Thread {
        private Map map;

        public T2(Map map) {
            this.map = map;
        }

        public void run() {
            for (Object a : map.keySet()) {
                map.remove(a);
            }
        }
    }

    public static void main(String[] args) {
        Map map = new ConcurrentHashMap();

        for (int i = 0; i < 10000; i++) {
            map.put(i, i + 1);
        }

        T1 t1 = new T1(map);
        T2 t2 = new T2(map);
        t1.start();
        t2.start();
    }
}
结果:Process finished with exit code 0
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值