--- jsr166/src/jsr166y/RecursiveTask.java 2009/01/06 14:30:31 1.1 +++ jsr166/src/jsr166y/RecursiveTask.java 2009/07/20 21:45:06 1.2 @@ -31,7 +31,7 @@ package jsr166y; * subtasks are too small to be worthwhile splitting up. Instead, as * is the case for nearly all fork/join applications, you'd pick some * minimum granularity size (for example 10 here) for which you always - * sequentially solve rather than subdividing. + * sequentially solve rather than subdividing. * */ public abstract class RecursiveTask extends ForkJoinTask { @@ -48,7 +48,7 @@ public abstract class RecursiveTask e V result; /** - * The main computation performed by this task. + * The main computation performed by this task. */ protected abstract V compute();