javacurrentmap_Java ConcurrentHashMap.forEach方法代码示例

import java.util.concurrent.ConcurrentHashMap; //导入方法依赖的package包/类

public static void main(String[] args) {

ConcurrentHashMap> userHash = new ConcurrentHashMap<>();

HashFiller hashFiller = new HashFiller(userHash);

Thread[] threads = new Thread[10];

for (int i = 0; i < 10; i++) {

threads[i] = new Thread(hashFiller);

threads[i].start();

}

for (int i = 0; i < 10; i++) {

try {

threads[i].join();

} catch (InterruptedException e) {

e.printStackTrace();

}

}

System.out.printf("Size: %d\n", userHash.size());

userHash.forEach(10, (user, list) -> {

System.out.printf("%s: %s: %d\n", Thread.currentThread().getName(), user, list.size());

});

userHash.forEachEntry(10, entry -> {

System.out.printf("%s: %s: %d\n", Thread.currentThread().getName(), entry.getKey(),

entry.getValue().size());

});

Operation op = userHash.search(10, (user, list) -> {

for (Operation operation : list) {

if (operation.getOperation().endsWith("1")) {

return operation;

}

}

return null;

});

System.out.printf("The operation we have found is: %s, %s, %s,\n", op.getUser(), op.getOperation(),

op.getTime());

ConcurrentLinkedDeque operations = userHash.search(10, (user, list) -> {

if (list.size() > 10) {

return list;

}

return null;

});

System.out.printf("The user we have found is: %s: %d operations\n", operations.getFirst().getUser(),

operations.size());

int totalSize = userHash.reduce(10, (user, list) -> {

return list.size();

}, (n1, n2) -> {

return n1 + n2;

});

System.out.printf("The total size is: %d\n", totalSize);

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值