| 252 |
|
} |
| 253 |
|
void checkCompletes(Object rawResult) { |
| 254 |
|
checkIncomplete(); |
| 255 |
+ |
int pendingCount = getPendingCount(); |
| 256 |
|
complete(rawResult); |
| 257 |
+ |
assertEquals(pendingCount, getPendingCount()); |
| 258 |
|
assertEquals(0, computeN()); |
| 259 |
|
assertEquals(1, onCompletionN()); |
| 260 |
|
assertEquals(0, onExceptionalCompletionN()); |
| 285 |
|
|
| 286 |
|
/** |
| 287 |
|
* A newly constructed CountedCompleter is not completed; |
| 288 |
< |
* complete() causes completion. |
| 288 |
> |
* complete() causes completion. pendingCount is ignored. |
| 289 |
|
*/ |
| 290 |
|
public void testComplete() { |
| 291 |
|
for (Object x : new Object[] { Boolean.TRUE, null }) { |
| 292 |
< |
new NoopCC() |
| 293 |
< |
.checkCompletes(x); |
| 294 |
< |
new NoopCC(new NoopCC()) |
| 295 |
< |
.checkCompletes(x); |
| 292 |
> |
for (int pendingCount : new int[] { 0, 42 }) { |
| 293 |
> |
testComplete(new NoopCC(), x, pendingCount); |
| 294 |
> |
testComplete(new NoopCC(new NoopCC()), x, pendingCount); |
| 295 |
> |
} |
| 296 |
|
} |
| 297 |
|
} |
| 298 |
+ |
void testComplete(NoopCC cc, Object x, int pendingCount) { |
| 299 |
+ |
cc.setPendingCount(pendingCount); |
| 300 |
+ |
cc.checkCompletes(x); |
| 301 |
+ |
} |
| 302 |
|
|
| 303 |
|
/** |
| 304 |
|
* completeExceptionally completes exceptionally |
