ConcurrentHashMap 测试

package com.huang.test.concurrent;

import java.util.*;
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

/**
 * ConcurrentHashMap"添加移除线程安全
 * 1.获取size用mappingCount方法(返回long,不是准确的)。
 * 2.遍历时可同时修改。
 */
public class ConcurrentHashMapTest
{
    int len = 100;
    private ConcurrentHashMap<Integer, String> map = new ConcurrentHashMap<>();
    public static void main(String[] args) {
        ConcurrentHashMapTest cht = new ConcurrentHashMapTest();
        cht.test();
    }

    private void test() {
        ExecutorService exec = Executors.newFixedThreadPool(len);
        ArrayList<Callable<Void>> tasks = new ArrayList<>();
        for(int i = 0;i < len;i++)
        {
            tasks.add(new MyCallable(map, i));
        }
        try {
            exec.invokeAll(tasks);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        printMap(map);
        exec.shutdown();
    }

    private void printMap(ConcurrentHashMap<Integer, String> map)
    {
        Set<Map.Entry<Integer, String>> ks = map.entrySet();
        TreeMap<Integer, String> treeMap = new TreeMap<>();
        for(Map.Entry<Integer, String> item:ks)
        {
            int key = item.getKey();
            String value = item.getValue();
            treeMap.put(key, value);
        }

        Set<Map.Entry<Integer, String>> es = treeMap.entrySet();
        System.out.println("size:" + map.mappingCount());
        for(Map.Entry<Integer, String> item:es)
        {
            System.out.println(item.getKey() + " " + item.getValue());
        }
    }

    class MyCallable implements Callable<Void>{
        private int sec;
        private ConcurrentHashMap<Integer, String> map;

        public MyCallable(ConcurrentHashMap<Integer, String> map, int sec)
        {
            this.map = map;
            this.sec = sec;
        }

        @Override
        public Void call() {
            map.put(sec, "value" + sec);
            return null;
        }
    }
}

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值