ForkJonin 分页查询

  public List<User> getUserList(int page,int pageSize) {
        List<User> users = null;
        try {
            ForkJoinPool pool = new ForkJoinPool(8);
            ForkJoinTask<List<User>> submit = pool.submit(new UserTask(1, 7, userDao));
            users = submit.get();
            System.err.println( users.size() );
            System.err.println( users.toString() );
        } catch (InterruptedException | ExecutionException e) {
            e.printStackTrace();
        }
        return users;
    }



    public class UserTask extends RecursiveTask<List<User>> {
        private int start;
        private int totalPage;
        private IUserDao userDao;

        public UserTask(int start, int totalPage, IUserDao userDao) {
            this.start = start;
            this.totalPage = totalPage;
            this.userDao = userDao;
        }

        @Override
        protected List<User> compute() {
            if (totalPage - start <= THRESHOLD) {
                List<User> allList = new ArrayList<>();
                for (int pageNo = start; pageNo <= totalPage; pageNo++) {
                    Map<String,Object> params = new HashMap<>();
                    params.put("page",(pageNo-1) * pageSize);
                    params.put("pageSize",pageSize);
                    List<User> userList = userDao.getUserList(params);
                    allList.addAll(userList);
                }
                return allList;
            }
            int middle = (start + totalPage) / 2;
            UserTask left = new UserTask(start, middle, userDao);
            UserTask right = new UserTask(middle+1, totalPage, userDao);
            invokeAll(left, right);
            List<User> allList = new ArrayList<>();
            List<User> leftResult = left.join();
            List<User> rightResult = right.join();
            allList.addAll(leftResult);
            allList.addAll(rightResult);
            return allList;
        }
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值