| 1 |
|
/* |
| 2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
|
* Expert Group and released to the public domain, as explained at |
| 4 |
< |
* http://creativecommons.org/licenses/publicdomain |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
import java.util.concurrent.*; |
| 38 |
|
return; |
| 39 |
|
} |
| 40 |
|
|
| 41 |
< |
ForkJoinPool g = procs == 0? new ForkJoinPool() : |
| 41 |
> |
ForkJoinPool g = (procs == 0) ? new ForkJoinPool() : |
| 42 |
|
new ForkJoinPool(procs); |
| 43 |
|
|
| 44 |
|
System.out.println("Integrating from " + start + " to " + end + " exponent: " + exp + " parallelism " + g.getParallelism()); |
| 66 |
|
classes declared as static within Integrate |
| 67 |
|
*/ |
| 68 |
|
|
| 69 |
< |
/** A function to be integrated **/ |
| 69 |
> |
/** A function to be integrated */ |
| 70 |
|
static interface Function { |
| 71 |
|
double compute(double x); |
| 72 |
|
} |
| 73 |
|
|
| 74 |
|
/** |
| 75 |
|
* Sample from filaments demo. |
| 76 |
< |
* Computes (2*n-1)*(x^(2*n-1)) for all odd values |
| 77 |
< |
**/ |
| 76 |
> |
* Computes (2*n-1)*(x^(2*n-1)) for all odd values. |
| 77 |
> |
*/ |
| 78 |
|
static class SampleFunction implements Function { |
| 79 |
|
final int n; |
| 80 |
|
SampleFunction(int n) { this.n = n; } |
| 81 |
|
|
| 82 |
< |
public double compute(double x) { |
| 82 |
> |
public double compute(double x) { |
| 83 |
|
double power = x; |
| 84 |
|
double xsq = x * x; |
| 85 |
|
double val = power; |
| 124 |
|
* and from the center point to the upper bound. If this |
| 125 |
|
* differs from the value from lower to upper by more than |
| 126 |
|
* the error tolerance, recurse on each half. |
| 127 |
< |
**/ |
| 127 |
> |
*/ |
| 128 |
|
final class Quad extends RecursiveAction { |
| 129 |
|
final double left; // lower bound |
| 130 |
|
final double right; // upper bound |
| 171 |
|
} |
| 172 |
|
|
| 173 |
|
} |
| 174 |
– |
|
| 175 |
– |
|
