author | darcy |
Wed, 16 Oct 2019 16:55:52 -0700 | |
changeset 58657 | 6252605fb005 |
parent 47216 | 71c04702a3d5 |
permissions | -rw-r--r-- |
4110 | 1 |
/* |
2 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
|
3 |
* |
|
4 |
* This code is free software; you can redistribute it and/or modify it |
|
5 |
* under the terms of the GNU General Public License version 2 only, as |
|
5506 | 6 |
* published by the Free Software Foundation. Oracle designates this |
4110 | 7 |
* particular file as subject to the "Classpath" exception as provided |
5506 | 8 |
* by Oracle in the LICENSE file that accompanied this code. |
4110 | 9 |
* |
10 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
11 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
12 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
13 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
14 |
* accompanied this code). |
|
15 |
* |
|
16 |
* You should have received a copy of the GNU General Public License version |
|
17 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
18 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
19 |
* |
|
5506 | 20 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
21 |
* or visit www.oracle.com if you need additional information or have any |
|
22 |
* questions. |
|
4110 | 23 |
*/ |
24 |
||
25 |
/* |
|
26 |
* This file is available under and governed by the GNU General Public |
|
27 |
* License version 2 only, as published by the Free Software Foundation. |
|
28 |
* However, the following notice accompanied the original version of this |
|
29 |
* file: |
|
30 |
* |
|
31 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
|
32 |
* Expert Group and released to the public domain, as explained at |
|
9242
ef138d47df58
7034657: Update Creative Commons license URL in legal notices
dl
parents:
5506
diff
changeset
|
33 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
4110 | 34 |
*/ |
35 |
||
36 |
package java.util.concurrent; |
|
37 |
||
38 |
/** |
|
39 |
* A recursive result-bearing {@link ForkJoinTask}. |
|
40 |
* |
|
41 |
* <p>For a classic example, here is a task computing Fibonacci numbers: |
|
42 |
* |
|
32991
b27c76b82713
8134853: Bulk integration of java.util.concurrent classes
dl
parents:
25859
diff
changeset
|
43 |
* <pre> {@code |
4110 | 44 |
* class Fibonacci extends RecursiveTask<Integer> { |
45 |
* final int n; |
|
46 |
* Fibonacci(int n) { this.n = n; } |
|
32991
b27c76b82713
8134853: Bulk integration of java.util.concurrent classes
dl
parents:
25859
diff
changeset
|
47 |
* protected Integer compute() { |
4110 | 48 |
* if (n <= 1) |
18790 | 49 |
* return n; |
4110 | 50 |
* Fibonacci f1 = new Fibonacci(n - 1); |
51 |
* f1.fork(); |
|
52 |
* Fibonacci f2 = new Fibonacci(n - 2); |
|
53 |
* return f2.compute() + f1.join(); |
|
54 |
* } |
|
55 |
* }}</pre> |
|
56 |
* |
|
57 |
* However, besides being a dumb way to compute Fibonacci functions |
|
58 |
* (there is a simple fast linear algorithm that you'd use in |
|
59 |
* practice), this is likely to perform poorly because the smallest |
|
60 |
* subtasks are too small to be worthwhile splitting up. Instead, as |
|
61 |
* is the case for nearly all fork/join applications, you'd pick some |
|
62 |
* minimum granularity size (for example 10 here) for which you always |
|
63 |
* sequentially solve rather than subdividing. |
|
64 |
* |
|
65 |
* @since 1.7 |
|
66 |
* @author Doug Lea |
|
67 |
*/ |
|
68 |
public abstract class RecursiveTask<V> extends ForkJoinTask<V> { |
|
69 |
private static final long serialVersionUID = 5232453952276485270L; |
|
70 |
||
71 |
/** |
|
72 |
* The result of the computation. |
|
73 |
*/ |
|
58657
6252605fb005
8232230: Suppress warnings on non-serializable non-transient instance fields in java.util.concurrent
darcy
parents:
47216
diff
changeset
|
74 |
@SuppressWarnings("serial") // Conditionally serializable |
4110 | 75 |
V result; |
76 |
||
77 |
/** |
|
78 |
* The main computation performed by this task. |
|
18790 | 79 |
* @return the result of the computation |
4110 | 80 |
*/ |
81 |
protected abstract V compute(); |
|
82 |
||
83 |
public final V getRawResult() { |
|
84 |
return result; |
|
85 |
} |
|
86 |
||
87 |
protected final void setRawResult(V value) { |
|
88 |
result = value; |
|
89 |
} |
|
90 |
||
91 |
/** |
|
92 |
* Implements execution conventions for RecursiveTask. |
|
93 |
*/ |
|
94 |
protected final boolean exec() { |
|
95 |
result = compute(); |
|
96 |
return true; |
|
97 |
} |
|
98 |
||
99 |
} |