98 |
|
* int l = lo; |
99 |
|
* int h = hi; |
100 |
|
* Applyer right = null; |
101 |
< |
* while (h - l > 1 && |
102 |
< |
* ForkJoinWorkerThread.getEstimatedSurplusTaskCount() <= 3) { |
101 |
> |
* while (h - l > 1 && getSurplusQueuedTaskCount() <= 3) { |
102 |
|
* int mid = (l + h) >>> 1; |
103 |
|
* right = new Applyer(array, mid, h, seqSize, right); |
104 |
|
* right.fork(); |
122 |
|
* @author Doug Lea |
123 |
|
*/ |
124 |
|
public abstract class RecursiveAction extends ForkJoinTask<Void> { |
125 |
+ |
private static final long serialVersionUID = 5232453952276485070L; |
126 |
|
|
127 |
|
/** |
128 |
|
* The main computation performed by this task. |