大家好,又见面了,我是你们的朋友全栈君。
ForkJoinPool infoForkJoinPool = new ForkJoinPool(Runtime.getRuntime().availableProcessors() * 2);
ForkJoinTask<Map<Long,InfoVO>> forkJoinTask = ThreadPoolManage.infoForkJoinPool.submit(new PriceTask(skuIds, 0, skuIds.size(),infoSoaService));
Map<Long,InfoVO> infoVOMap = forkJoinTask.join();
/** * 多任务查询 */
public class PriceTask extends RecursiveTask<Map<Long,InfoVO>> {
/** * sku集合 */
private Set<Long> skuIds;
/** * */
private InfoSoaService infoSoaService;
/** * 开始 */
private int start;
/** * 最大 */
private int end;
/** * 单次最多查询sku数量 */
static final int THRESHOLD = 20;
public PriceTask(Set<Long> skuIds, int start, int end,InfoSoaService infoSoaService) {
this.skuIds = skuIds;
this.start = start;
this.end = end;
thisinfoSoaService = infoSoaService;
}
@Override
protected Map<Long, InfoVO> compute() {
if (end - start <= THRESHOLD) {
List<Long> skuList = new ArrayList<>(skuIds);
Response<Map<Long, InfoVO>> bySkuIds = infoSoaService.getInfoBySkuIds(buildCaller(), new HashSet<>(skuList.subList(start, end)));
return new HashMap<>(bySkuIds.getData());
}
int middle = (end + start) / 2;
PriceTask left = new PriceTask(skuIds, start, middle, infoSoaService);
PriceTask right = new PriceTask(skuIds, middle, end, infoSoaService);
invokeAll(left, right);
Map<Long,InfoVO> resultMap = new HashMap<>();
Map<Long, InfoVO> infoVOLeftMap = left.join();
Map<Long, InfoVO> infoVORightMap = right.join();
resultMap.putAll(infoVOLeftMap);
resultMap.putAll(infoVORightMap);
return resultMap;
}
}
版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 举报,一经查实,本站将立刻删除。
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/191302.html原文链接:https://javaforall.cn