--- jsr166/src/jsr166y/CountedCompleter.java 2012/11/25 18:39:07 1.19 +++ jsr166/src/jsr166y/CountedCompleter.java 2012/11/25 19:25:06 1.22 @@ -126,14 +126,14 @@ package jsr166y; * op.apply(array[lo]); * tryComplete(); * } - * } } + * }} * * This design can be improved by noticing that in the recursive case, * the task has nothing to do after forking its right task, so can * directly invoke its left task before returning. (This is an analog * of tail recursion removal.) Also, because the task returns upon * executing its left task (rather than falling through to invoke - * tryComplete) the pending count is set to one: + * {@code tryComplete}) the pending count is set to one: * *
{@code * class ForEach+ * }} * * Here, method {@code onCompletion} takes a form common to many * completion designs that combine results. This callback-style method @@ -661,7 +661,7 @@ public abstract class CountedCompleter... @@ -291,7 +291,7 @@ package jsr166y; * return new MapReducer (null, array, mapper, reducer, * 0, array.length).invoke(); * } - * } }