--- jsr166/src/jsr166y/CountedCompleter.java 2012/11/25 18:45:48 1.20 +++ jsr166/src/jsr166y/CountedCompleter.java 2012/11/26 05:46:55 1.24 @@ -126,7 +126,7 @@ 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 @@ -277,12 +277,12 @@ package jsr166y; * } * public void onCompletion(CountedCompleter caller) { * if (caller != this) { - * MapReducer child = (MapReducer)caller; - * MapReducer sib = child.sibling; - * if (sib == null || sib.result == null) - * result = child.result; - * else - * result = reducer.apply(child.result, sib.result); + * MapReducer child = (MapReducer)caller; + * MapReducer sib = child.sibling; + * if (sib == null || sib.result == null) + * result = child.result; + * else + * result = reducer.apply(child.result, sib.result); * } * } * public E getRawResult() { return result; } @@ -291,7 +291,7 @@ package jsr166y; * return new MapReducer(null, array, mapper, reducer, * 0, array.length).invoke(); * } - * } } + * }} * * Here, method {@code onCompletion} takes a form common to many * completion designs that combine results. This callback-style method @@ -388,7 +388,7 @@ public abstract class CountedCompleter completer, @@ -401,7 +401,7 @@ public abstract class CountedCompleter completer) { this.completer = completer; @@ -422,7 +422,7 @@ public abstract class CountedCompleter caller) { return true; @@ -661,7 +661,7 @@ public abstract class CountedCompleter a = this, s = a; @@ -671,7 +671,7 @@ public abstract class CountedCompleter