51 |
|
} |
52 |
|
} |
53 |
|
|
54 |
< |
void checkNotDone(RecursiveTask a) { |
54 |
> |
void checkNotDone(RecursiveTask<?> a) { |
55 |
|
assertFalse(a.isDone()); |
56 |
|
assertFalse(a.isCompletedNormally()); |
57 |
|
assertFalse(a.isCompletedAbnormally()); |
122 |
|
checkCompletedNormally(a, r); |
123 |
|
} |
124 |
|
|
125 |
< |
void checkCancelled(RecursiveTask a) { |
125 |
> |
void checkCancelled(RecursiveTask<?> a) { |
126 |
|
assertTrue(a.isDone()); |
127 |
|
assertTrue(a.isCancelled()); |
128 |
|
assertFalse(a.isCompletedNormally()); |
149 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
150 |
|
} |
151 |
|
|
152 |
< |
void checkCompletedAbnormally(RecursiveTask a, Throwable t) { |
152 |
> |
void checkCompletedAbnormally(RecursiveTask<?> a, Throwable t) { |
153 |
|
assertTrue(a.isDone()); |
154 |
|
assertFalse(a.isCancelled()); |
155 |
|
assertFalse(a.isCompletedNormally()); |
748 |
|
FibTask f = new FibTask(8); |
749 |
|
FibTask g = new FibTask(9); |
750 |
|
FibTask h = new FibTask(7); |
751 |
< |
HashSet set = new HashSet(); |
751 |
> |
HashSet<ForkJoinTask<?>> set = new HashSet<ForkJoinTask<?>>(); |
752 |
|
set.add(f); |
753 |
|
set.add(g); |
754 |
|
set.add(h); |
848 |
|
FailingFibTask f = new FailingFibTask(8); |
849 |
|
FibTask g = new FibTask(9); |
850 |
|
FibTask h = new FibTask(7); |
851 |
< |
HashSet set = new HashSet(); |
851 |
> |
HashSet<ForkJoinTask<?>> set = new HashSet<ForkJoinTask<?>>(); |
852 |
|
set.add(f); |
853 |
|
set.add(g); |
854 |
|
set.add(h); |