forkjoin使用_forkjoin与线程池区别

大家好，又见面了，我是你们的朋友全栈君。如果您正在找激活码,请点击查看最新教程,关注关注公众号 “全栈程序员社区” 获取激活教程,可能之前旧版本教程已经失效.最新Idea2022.1教程亲测有效,一键激活。

Jetbrains全系列IDE使用 1年只要46元 售后保障 童叟无欺

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;
}
}