ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/jsr166y/RecursiveTask.java

Comparing jsr166/src/jsr166y/RecursiveTask.java (file contents):
Revision 1.1 by dl, Tue Jan 6 14:30:31 2009 UTC vs.
Revision 1.3 by jsr166, Mon Jul 20 22:26:04 2009 UTC

#	Line 13 | Line 13 | package jsr166y;
13		* <pre>
14		* class Fibonacci extends RecursiveTask&lt;Integer&gt; {
15		*   final int n;
16	<	*   Fibonnaci(int n) { this.n = n; }
16	>	*   Fibonacci(int n) { this.n = n; }
17		*   Integer compute() {
18		*     if (n &lt;= 1)
19		*        return n;
#	Line 31 | Line 31 | package jsr166y;
31		* subtasks are too small to be worthwhile splitting up. Instead, as
32		* is the case for nearly all fork/join applications, you'd pick some
33		* minimum granularity size (for example 10 here) for which you always
34	<	* sequentially solve rather than subdividing.
34	>	* sequentially solve rather than subdividing.
35		*
36		*/
37		public abstract class RecursiveTask<V> extends ForkJoinTask<V> {
38
39		/**
40	<	* Empty contructor for use by subclasses.
40	>	* Empty constructor for use by subclasses.
41		*/
42		protected RecursiveTask() {
43		}
#	Line 48 | Line 48 | public abstract class RecursiveTask<V> e
48		V result;
49
50		/**
51	<	* The main computation performed by this task.
51	>	* The main computation performed by this task.
52		*/
53		protected abstract V compute();
54

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines