线程安全的Map的小Demo

public class TempUser {

    private final ConcurrentHashMap<String, Future<String>> cache = new ConcurrentHashMap<>();
    private final ConcurrentHashMap<String, FutureTask<String>> taskCache = new ConcurrentHashMap<>();


    public String setUser(String name, String content) {

        while (true) {
            Future<String> f = cache.get(name);
            if (f == null) {

                Callable<String> callable = new Callable<String>() {
                    @Override
                    public String call() throws Exception {
                        return content;
                    }
                };

                FutureTask<String> ft = new FutureTask<String>(callable);

                Future<String> stringFuture = cache.putIfAbsent(name, ft);

                //如果放入成功 返回null
                if(stringFuture==null){
                    f = ft;
                    ft.run();
                }

                try {
                    return f.get();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                } catch (ExecutionException e) {
                    e.printStackTrace();
                }


            }


        }


    }

    public int getSize(){

       return cache.size();
    }


    public String setUser02(String name, String content) {

        while (true) {
            FutureTask<String> ft = taskCache.get(name);
            if (ft == null) {

                Callable<String> callable = new Callable<String>() {
                    @Override
                    public String call() throws Exception {
                        return content;
                    }
                };
                FutureTask<String> ft2 = new FutureTask<String>(callable);

                Future<String> stringFuture = cache.putIfAbsent(name, ft2);

                //如果放入成功 返回null
                if(stringFuture==null){
                    ft = ft2;
                    ft2.run();
                }

                try {
                    return ft.get();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                } catch (ExecutionException e) {
                    e.printStackTrace();
                }


            }


        }


    }



}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值