32 |
|
* minimum granularity size (for example 10 here) for which you always |
33 |
|
* sequentially solve rather than subdividing. |
34 |
|
* |
35 |
+ |
* @since 1.7 |
36 |
+ |
* @author Doug Lea |
37 |
|
*/ |
38 |
|
public abstract class RecursiveTask<V> extends ForkJoinTask<V> { |
39 |
|
|
40 |
|
/** |
39 |
– |
* Empty constructor for use by subclasses. |
40 |
– |
*/ |
41 |
– |
protected RecursiveTask() { |
42 |
– |
} |
43 |
– |
|
44 |
– |
/** |
41 |
|
* The result returned by compute method. |
42 |
|
*/ |
43 |
|
V result; |
56 |
|
} |
57 |
|
|
58 |
|
/** |
59 |
< |
* Implements execution conventions for RecursiveTask |
59 |
> |
* Implements execution conventions for RecursiveTask. |
60 |
|
*/ |
61 |
|
protected final boolean exec() { |
62 |
|
result = compute(); |