142 |
|
* |
143 |
|
* As a further improvement, notice that the left task need not even |
144 |
|
* exist. Instead of creating a new one, we can iterate using the |
145 |
< |
* original task, and add a pending count for each fork: |
145 |
> |
* original task, and add a pending count for each fork. |
146 |
|
* |
147 |
|
* <pre> {@code |
148 |
|
* class ForEach<E> ... |
378 |
|
} |
379 |
|
|
380 |
|
/** |
381 |
+ |
* Returns the root of the current computation; i.e., this |
382 |
+ |
* task if it has no completer, else its completer's root. |
383 |
+ |
* |
384 |
+ |
* @return the root of the current computation |
385 |
+ |
*/ |
386 |
+ |
public final CountedCompleter<?> getRoot() { |
387 |
+ |
CountedCompleter<?> a = this, p; |
388 |
+ |
while ((p = a.completer) != null) |
389 |
+ |
a = p; |
390 |
+ |
return a; |
391 |
+ |
} |
392 |
+ |
|
393 |
+ |
/** |
394 |
|
* If the pending count is nonzero, decrements the count; |
395 |
|
* otherwise invokes {@link #onCompletion} and then similarly |
396 |
|
* tries to complete this task's completer, if one exists, |
478 |
|
} |
479 |
|
} |
480 |
|
|
468 |
– |
|
481 |
|
/** |
482 |
|
* Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package. |
483 |
|
* Replace with a simple call to Unsafe.getUnsafe when integrating |
505 |
|
} |
506 |
|
} |
507 |
|
} |
496 |
– |
|
508 |
|
} |