2019.4.32

最新推荐文章于 2023-12-14 16:26:55 发布

swy_swy_swy

最新推荐文章于 2023-12-14 16:26:55 发布

阅读量1k

点赞数

分类专栏：琉璃神社

本文链接：https://blog.csdn.net/swy_swy_swy/article/details/107092140

版权

琉璃神社专栏收录该内容

907 篇文章 874 订阅

订阅专栏

2019.4.32

class Counter extends RecursiveTask<Integer>{
            public static final int THRESHOLD = 1000;
            private double[] values;
            private int from;
            private int to;
            private DoublePredicate filter;

            public Counter(double[] values, int from, int to, DoublePredicate filter){
                this.values = values;
                this.from = from;
                this.to = to;
                this.filter = filter;
            }

            protected Integer compute(){
                if(to - from < THRESHOLD){
                    int count = 0;
                    for(int i=from; i<to;i++){
                        if(filter.test(values[i]))
                            count++;
                    }
                    return count;
                }
                else{
                    int mid = (from + to) / 2;
                    var first = new Counter(values, from, mid, filter);
                    var second = new Counter(values, mid, to, filter);
                    invokeAll(first, second);
                    return first.join() + second.join();
                }
            }
        }