ConcurrentHashMap

public class KeywordCount {

    public static Map<String,AtomicLong> KeywordMap=new ConcurrentHashMap<String, AtomicLong>();
     static CountDownLatch countdown=new CountDownLatch(4);
    public static void main(String[] args) throws InterruptedException {

        String keyword[]=new String[]{"倔强","顽固","纯真","温柔"}; 

        for (int i = 0; i < keyword.length; i++) {
            new Thread(new Runnable() {

                @Override
                public void run() {
                    put(keyword);
                    countdown.countDown();
                }
            }).start();

        }
        countdown.await();

        System.out.println(KeywordMap);
    }

    private static void put(String[] keyword) {
        AtomicLong count;
        for (String key : keyword) {

            count = KeywordMap.get(key);
            if(count==null){
                AtomicLong newCount=new AtomicLong(0);
                count=KeywordMap.putIfAbsent(key, newCount);
                if(count==null){
                    count=newCount;
                }
            }

            count.incrementAndGet();

        }

    }


}
public class KeywordCount2 {

    public static Map<String,Long> KeywordMap=new ConcurrentHashMap<String, Long>();
     static CountDownLatch countdown=new CountDownLatch(4);
    public static void main(String[] args) throws InterruptedException {
        String keyword[]=new String[]{"倔强","顽固","纯真","温柔"}; 
        for (int i = 0; i < keyword.length; i++) {
            new Thread(new Runnable() {

                @Override
                public void run() {
                    System.out.println(Thread.currentThread().getName());
                    put(keyword);

                    countdown.countDown();
                }
            }).start();

        }
        countdown.await();


        System.out.println(KeywordMap);
    }

    private static void put(String[] keyword) {
        Long oldValue ,newValue;
        for (String key : keyword) {
            while(true){
                 oldValue = KeywordMap.get(key);
                if(oldValue==null){

                    newValue=1L;
                    if(KeywordMap.putIfAbsent(key, newValue)==null){
                        break;
                    }

                }else{

                    newValue=oldValue+1;
                    if(KeywordMap.replace(key, oldValue, newValue)){
                        break;
                    }


                }



            }
        }

    }


}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值