首先是一些对 Fork/Join的个人理解
1)最主要的目的还是将相同的行为的拆成N份,同时异步执行
2)实际作用不是很大,要不是应用够简单,就是做统计;要不就是服务器够强大。
3)所有不讨论基数的多线程都是耍流氓
话不多说,直接上代码
public class ForkJoinTest {
/*获取随机数数组方法*/
private static class MakeIntArray {
public static int[] MaryArray(int arrayLentth) {
if (arrayLentth < 0) {
throw new IllegalArgumentException();
}
int[] result = new int[arrayLentth];
Random random = new Random();
for (int t = 0; t < arrayLentth; t++) {
result[t] = random.nextInt(100);
}
return result;
}
}
private static class SumTast extends RecursiveTask<Integer> {
//需要让FORKJOIN拆分的数值
private int FORKJOINNUM;
//实际统计的数组
private int[] real;
//开始统计的下标
private int startIndex;
//结束统计的下标
private int endIndex;
//需要被拆成每份都小于某值
private int splitNum;
public SumTast(int[] real, int startIndex, int endIndex, int splitNum) {
this.real = real;
this.FORKJOINNUM = real.length / splitNum;
this.startIndex = startIndex;
this.endIndex = endIndex;
this.splitNum = splitNum;
}
@Override
protected Integer compute() {
if (endIndex - startIndex < FORKJOINNUM) {
int count = 0;
//这里有个点 当判断条件是radNum < endIndex 时 endIndex可以传入最大值是数组的真实个数,如int[100] 最大传100 因为不会取第endIndex个
// 当判断条件是radNum <= endIndex 时 endIndex最大只能时数组最大下标 如int[100] 最大传99
for (int radNum = startIndex; radNum < endIndex; radNum++) {
System.out.println(Thread.currentThread().getName() + " 排序为" + radNum + "的数字相加。");
count = count + real[radNum];
}
return count;
} else {
//取中间值 这里左右比例可以按实际调节
int mid = (startIndex + endIndex) / 2;
SumTast left = new SumTast(real, startIndex, mid, splitNum);
SumTast right = new SumTast(real, mid, endIndex, splitNum);
//左右汇总 ForkJoinTask 父类的父类的方法
invokeAll(left, right);
return left.join() + right.join();
}
}
}
public static void main(String[] args) {
ForkJoinPool joinPool = new ForkJoinPool();
SumTast sumTast = new SumTast(MakeIntArray.MaryArray(100), 0, 100, 10);
joinPool.invoke(sumTast);
System.out.println(sumTast.join());
}
}