34 |
|
* } |
35 |
|
* }}</pre> |
36 |
|
* |
37 |
< |
* You could then sort anArray by creating {@code new SortTask(anArray, 0, |
38 |
< |
* anArray.length-1) } and invoking it in a ForkJoinPool. |
39 |
< |
* As a more concrete simple example, the following task increments |
40 |
< |
* each element of an array: |
37 |
> |
* You could then sort {@code anArray} by creating {@code new |
38 |
> |
* SortTask(anArray, 0, anArray.length-1) } and invoking it in a |
39 |
> |
* ForkJoinPool. As a more concrete simple example, the following |
40 |
> |
* task increments each element of an array: |
41 |
|
* <pre> {@code |
42 |
|
* class IncrementTask extends RecursiveAction { |
43 |
|
* final long[] array; final int lo; final int hi; |
118 |
|
* result = sum; |
119 |
|
* } |
120 |
|
* }}</pre> |
121 |
+ |
* |
122 |
+ |
* @since 1.7 |
123 |
+ |
* @author Doug Lea |
124 |
|
*/ |
125 |
|
public abstract class RecursiveAction extends ForkJoinTask<Void> { |
126 |
|
|