| 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 getEstimatedSurplusTaskCount}, but |
| 67 |
> |
* threshold based on method {@code getSurplusQueuedTaskCount}, but |
| 68 |
|
* counterbalances potential excess partitioning by directly |
| 69 |
|
* performing leaf actions on unstolen tasks rather than further |
| 70 |
|
* subdividing. |
