--- jsr166/src/test/loops/LinkedAsyncAction.java 2012/10/21 06:14:12 1.5 +++ jsr166/src/test/loops/LinkedAsyncAction.java 2012/11/18 18:03:11 1.6 @@ -11,7 +11,7 @@ import java.util.concurrent.atomic.*; /** * AsyncActions that may be linked in parent-child relationships. * - *

Upon construction, an LinkedAsyncAction may register as a + *

Upon construction, an LinkedAsyncAction may register as a * subtask of a given parent task. In this case, completion of this * task will propagate to its parent. If the parent's pending subtask * completion count becomes zero, it too will complete. @@ -24,12 +24,12 @@ import java.util.concurrent.atomic.*; * complete of the subtask will trigger complete of the * parent without the parent explicitly doing so. * - *

In addition to supporting these different computation styles + *

In addition to supporting these different computation styles * compared to Recursive tasks, LinkedAsyncActions may have smaller * stack space footprints while executing, but may have greater * per-task overhead. * - *

Sample Usage. Here is a sketch of an LinkedAsyncAction + *

Sample Usage. Here is a sketch of an LinkedAsyncAction * that visits all of the nodes of a graph. The details of the graph's * Node and Edge classes are omitted, but we assume each node contains * an AtomicBoolean mark that starts out false. To execute