| 7 |
|
package jsr166y; |
| 8 |
|
|
| 9 |
|
/** |
| 10 |
< |
* Recursive resultless ForkJoinTasks. This class establishes |
| 11 |
< |
* conventions to parameterize resultless actions as {@code Void} |
| 12 |
< |
* ForkJoinTasks. Because {@code null} is the only valid value of |
| 13 |
< |
* type {@code Void}, methods such as join always return {@code null} |
| 14 |
< |
* upon completion. |
| 10 |
> |
* A recursive resultless {@link ForkJoinTask}. This class |
| 11 |
> |
* establishes conventions to parameterize resultless actions as |
| 12 |
> |
* {@code Void} {@code ForkJoinTask}s. Because {@code null} is the |
| 13 |
> |
* only valid value of type {@code Void}, methods such as join always |
| 14 |
> |
* return {@code null} upon completion. |
| 15 |
|
* |
| 16 |
|
* <p><b>Sample Usages.</b> Here is a sketch of a ForkJoin sort that |
| 17 |
|
* sorts a given {@code long[]} array: |
| 64 |
|
* of each element of a double array, by subdividing out only the |
| 65 |
|
* right-hand-sides of repeated divisions by two, and keeping track of |
| 66 |
|
* them with a chain of {@code next} references. It uses a dynamic |
| 67 |
< |
* threshold based on method {@code surplus}, but counterbalances |
| 68 |
< |
* potential excess partitioning by directly performing leaf actions |
| 69 |
< |
* on unstolen tasks rather than further subdividing. |
| 67 |
> |
* threshold based on method {@code getEstimatedSurplusTaskCount}, but |
| 68 |
> |
* counterbalances potential excess partitioning by directly |
| 69 |
> |
* performing leaf actions on unstolen tasks rather than further |
| 70 |
> |
* subdividing. |
| 71 |
|
* |
| 72 |
|
* <pre> {@code |
| 73 |
|
* double sumOfSquares(ForkJoinPool pool, double[] array) { |
