| 336 |
|
* while (h - l >= 2) { |
| 337 |
|
* int mid = (l + h) >>> 1; |
| 338 |
|
* addToPendingCount(1); |
| 339 |
< |
* (forks = new MapReducer(this, array, mapper, reducer, mid, h, forks)).fork; |
| 339 |
> |
* (forks = new MapReducer(this, array, mapper, reducer, mid, h, forks)).fork(); |
| 340 |
|
* h = mid; |
| 341 |
|
* } |
| 342 |
|
* if (h > l) |
| 624 |
|
/** |
| 625 |
|
* If this task does not have a completer, invokes {@link |
| 626 |
|
* ForkJoinTask#quietlyComplete} and returns {@code null}. Or, if |
| 627 |
< |
* this task's pending count is non-zero, decrements its pending |
| 628 |
< |
* count and returns {@code null}. Otherwise, returns the |
| 627 |
> |
* the completer's pending count is non-zero, decrements that |
| 628 |
> |
* pending count and returns {@code null}. Otherwise, returns the |
| 629 |
|
* completer. This method can be used as part of a completion |
| 630 |
|
* traversal loop for homogeneous task hierarchies: |
| 631 |
|
* |
