108 |
|
static final class FibTask extends RecursiveTask<Integer> { |
109 |
|
final int number; |
110 |
|
FibTask(int n) { number = n; } |
111 |
< |
public Integer compute() { |
111 |
> |
protected Integer compute() { |
112 |
|
int n = number; |
113 |
|
if (n <= 1) |
114 |
|
return n; |
136 |
|
this.locker = locker; |
137 |
|
this.lock = lock; |
138 |
|
} |
139 |
< |
public Integer compute() { |
139 |
> |
protected Integer compute() { |
140 |
|
int n; |
141 |
|
LockingFibTask f1 = null; |
142 |
|
LockingFibTask f2 = null; |
419 |
|
ExecutorService e = new ForkJoinPool(1); |
420 |
|
try { |
421 |
|
final AtomicBoolean done = new AtomicBoolean(false); |
422 |
< |
CheckedRunnable task = new CheckedRunnable() { |
422 |
> |
Future<?> future = e.submit(new CheckedRunnable() { |
423 |
|
public void realRun() { |
424 |
|
done.set(true); |
425 |
< |
}}; |
426 |
< |
Future<?> future = e.submit(task); |
425 |
> |
}}); |
426 |
|
assertNull(future.get()); |
427 |
|
assertNull(future.get(0, MILLISECONDS)); |
428 |
|
assertTrue(done.get()); |