15 |
|
* BinaryAsyncActions are simpler to use and have less overhead in |
16 |
|
* typical uasges but are restricted to binary computation trees. |
17 |
|
* |
18 |
< |
* <p> Upon construction, an BinaryAsyncAction does not bear any |
18 |
> |
* <p>Upon construction, an BinaryAsyncAction does not bear any |
19 |
|
* linkages. For non-root tasks, links must be established using |
20 |
|
* method <tt>linkSubtasks</tt> before use. |
21 |
|
* |
22 |
< |
* <p> <b>Sample Usage.</b> A version of Fibonacci: |
22 |
> |
* <p><b>Sample Usage.</b> A version of Fibonacci: |
23 |
|
* <pre> |
24 |
|
* class Fib extends BinaryAsyncAction { |
25 |
|
* final int n; |