32 |
|
import java.util.concurrent.ForkJoinTask; |
33 |
|
import java.util.concurrent.RejectedExecutionException; |
34 |
|
import java.util.concurrent.TimeoutException; |
35 |
– |
import java.util.concurrent.TimeUnit; |
35 |
|
import java.util.concurrent.atomic.AtomicInteger; |
36 |
|
import java.util.concurrent.atomic.AtomicReference; |
37 |
|
import java.util.function.BiConsumer; |
41 |
|
import java.util.function.Predicate; |
42 |
|
import java.util.function.Supplier; |
43 |
|
|
45 |
– |
import junit.framework.AssertionFailedError; |
44 |
|
import junit.framework.Test; |
45 |
|
import junit.framework.TestSuite; |
46 |
|
|
58 |
|
void checkIncomplete(CompletableFuture<?> f) { |
59 |
|
assertFalse(f.isDone()); |
60 |
|
assertFalse(f.isCancelled()); |
61 |
< |
assertTrue(f.toString().contains("Not completed")); |
61 |
> |
assertTrue(f.toString().matches(".*\\[.*Not completed.*\\]")); |
62 |
|
try { |
63 |
|
assertNull(f.getNow(null)); |
64 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
65 |
|
try { |
66 |
< |
f.get(0L, SECONDS); |
66 |
> |
f.get(randomExpiredTimeout(), randomTimeUnit()); |
67 |
|
shouldThrow(); |
68 |
|
} |
69 |
|
catch (TimeoutException success) {} |
75 |
|
|
76 |
|
try { |
77 |
|
assertEquals(value, f.join()); |
80 |
– |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
81 |
– |
try { |
78 |
|
assertEquals(value, f.getNow(null)); |
83 |
– |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
84 |
– |
try { |
79 |
|
assertEquals(value, f.get()); |
80 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
81 |
|
assertTrue(f.isDone()); |
82 |
|
assertFalse(f.isCancelled()); |
83 |
|
assertFalse(f.isCompletedExceptionally()); |
84 |
< |
assertTrue(f.toString().contains("[Completed normally]")); |
84 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed normally.*\\]")); |
85 |
|
} |
86 |
|
|
87 |
|
/** |
88 |
|
* Returns the "raw" internal exceptional completion of f, |
89 |
|
* without any additional wrapping with CompletionException. |
90 |
|
*/ |
91 |
< |
<U> Throwable exceptionalCompletion(CompletableFuture<U> f) { |
92 |
< |
// handle (and whenComplete) can distinguish between "direct" |
93 |
< |
// and "wrapped" exceptional completion |
94 |
< |
return f.handle((U u, Throwable t) -> t).join(); |
91 |
> |
Throwable exceptionalCompletion(CompletableFuture<?> f) { |
92 |
> |
// handle (and whenComplete and exceptionally) can distinguish |
93 |
> |
// between "direct" and "wrapped" exceptional completion |
94 |
> |
return f.handle((u, t) -> t).join(); |
95 |
|
} |
96 |
|
|
97 |
|
void checkCompletedExceptionally(CompletableFuture<?> f, |
137 |
|
assertFalse(f.isCancelled()); |
138 |
|
assertTrue(f.isDone()); |
139 |
|
assertTrue(f.isCompletedExceptionally()); |
140 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
140 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
141 |
|
} |
142 |
|
|
143 |
|
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
144 |
|
checkCompletedExceptionally(f, true, |
145 |
< |
(t) -> assertTrue(t instanceof CFException)); |
145 |
> |
t -> assertTrue(t instanceof CFException)); |
146 |
|
} |
147 |
|
|
148 |
|
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
149 |
|
checkCompletedExceptionally(f, true, |
150 |
< |
(t) -> assertTrue(t instanceof CancellationException)); |
150 |
> |
t -> assertTrue(t instanceof CancellationException)); |
151 |
|
} |
152 |
|
|
153 |
|
void checkCompletedWithTimeoutException(CompletableFuture<?> f) { |
154 |
|
checkCompletedExceptionally(f, false, |
155 |
< |
(t) -> assertTrue(t instanceof TimeoutException)); |
155 |
> |
t -> assertTrue(t instanceof TimeoutException)); |
156 |
|
} |
157 |
|
|
158 |
|
void checkCompletedWithWrappedException(CompletableFuture<?> f, |
159 |
|
Throwable ex) { |
160 |
< |
checkCompletedExceptionally(f, true, (t) -> assertSame(t, ex)); |
160 |
> |
checkCompletedExceptionally(f, true, t -> assertSame(t, ex)); |
161 |
|
} |
162 |
|
|
163 |
|
void checkCompletedExceptionally(CompletableFuture<?> f, Throwable ex) { |
164 |
< |
checkCompletedExceptionally(f, false, (t) -> assertSame(t, ex)); |
164 |
> |
checkCompletedExceptionally(f, false, t -> assertSame(t, ex)); |
165 |
|
} |
166 |
|
|
167 |
|
void checkCancelled(CompletableFuture<?> f) { |
192 |
|
assertTrue(f.isDone()); |
193 |
|
assertTrue(f.isCompletedExceptionally()); |
194 |
|
assertTrue(f.isCancelled()); |
195 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
195 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
196 |
|
} |
197 |
|
|
198 |
|
/** |
291 |
|
} |
292 |
|
|
293 |
|
f = new CompletableFuture<>(); |
294 |
< |
f.completeExceptionally(ex = new CFException()); |
294 |
> |
f.completeExceptionally(new CFException()); |
295 |
|
f.obtrudeValue(v1); |
296 |
|
checkCompletedNormally(f, v1); |
297 |
|
f.obtrudeException(ex = new CFException()); |
328 |
|
/** |
329 |
|
* toString indicates current completion state |
330 |
|
*/ |
331 |
< |
public void testToString() { |
332 |
< |
CompletableFuture<String> f; |
333 |
< |
|
334 |
< |
f = new CompletableFuture<String>(); |
335 |
< |
assertTrue(f.toString().contains("[Not completed]")); |
331 |
> |
public void testToString_incomplete() { |
332 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
333 |
> |
assertTrue(f.toString().matches(".*\\[.*Not completed.*\\]")); |
334 |
> |
if (testImplementationDetails) |
335 |
> |
assertEquals(identityString(f) + "[Not completed]", |
336 |
> |
f.toString()); |
337 |
> |
} |
338 |
|
|
339 |
+ |
public void testToString_normal() { |
340 |
+ |
CompletableFuture<String> f = new CompletableFuture<>(); |
341 |
|
assertTrue(f.complete("foo")); |
342 |
< |
assertTrue(f.toString().contains("[Completed normally]")); |
342 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed normally.*\\]")); |
343 |
> |
if (testImplementationDetails) |
344 |
> |
assertEquals(identityString(f) + "[Completed normally]", |
345 |
> |
f.toString()); |
346 |
> |
} |
347 |
|
|
348 |
< |
f = new CompletableFuture<String>(); |
348 |
> |
public void testToString_exception() { |
349 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
350 |
|
assertTrue(f.completeExceptionally(new IndexOutOfBoundsException())); |
351 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
351 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
352 |
> |
if (testImplementationDetails) |
353 |
> |
assertTrue(f.toString().startsWith( |
354 |
> |
identityString(f) + "[Completed exceptionally: ")); |
355 |
> |
} |
356 |
|
|
357 |
+ |
public void testToString_cancelled() { |
358 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) { |
359 |
< |
f = new CompletableFuture<String>(); |
359 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
360 |
|
assertTrue(f.cancel(mayInterruptIfRunning)); |
361 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
361 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
362 |
> |
if (testImplementationDetails) |
363 |
> |
assertTrue(f.toString().startsWith( |
364 |
> |
identityString(f) + "[Completed exceptionally: ")); |
365 |
|
} |
366 |
|
} |
367 |
|
|
373 |
|
checkCompletedNormally(f, "test"); |
374 |
|
} |
375 |
|
|
376 |
< |
abstract class CheckedAction { |
376 |
> |
abstract static class CheckedAction { |
377 |
|
int invocationCount = 0; |
378 |
|
final ExecutionMode m; |
379 |
|
CheckedAction(ExecutionMode m) { this.m = m; } |
385 |
|
void assertInvoked() { assertEquals(1, invocationCount); } |
386 |
|
} |
387 |
|
|
388 |
< |
abstract class CheckedIntegerAction extends CheckedAction { |
388 |
> |
abstract static class CheckedIntegerAction extends CheckedAction { |
389 |
|
Integer value; |
390 |
|
CheckedIntegerAction(ExecutionMode m) { super(m); } |
391 |
|
void assertValue(Integer expected) { |
394 |
|
} |
395 |
|
} |
396 |
|
|
397 |
< |
class IntegerSupplier extends CheckedAction |
397 |
> |
static class IntegerSupplier extends CheckedAction |
398 |
|
implements Supplier<Integer> |
399 |
|
{ |
400 |
|
final Integer value; |
413 |
|
return (x == null) ? null : x + 1; |
414 |
|
} |
415 |
|
|
416 |
< |
class NoopConsumer extends CheckedIntegerAction |
416 |
> |
static class NoopConsumer extends CheckedIntegerAction |
417 |
|
implements Consumer<Integer> |
418 |
|
{ |
419 |
|
NoopConsumer(ExecutionMode m) { super(m); } |
423 |
|
} |
424 |
|
} |
425 |
|
|
426 |
< |
class IncFunction extends CheckedIntegerAction |
426 |
> |
static class IncFunction extends CheckedIntegerAction |
427 |
|
implements Function<Integer,Integer> |
428 |
|
{ |
429 |
|
IncFunction(ExecutionMode m) { super(m); } |
441 |
|
- ((y == null) ? 99 : y.intValue()); |
442 |
|
} |
443 |
|
|
444 |
< |
class SubtractAction extends CheckedIntegerAction |
444 |
> |
static class SubtractAction extends CheckedIntegerAction |
445 |
|
implements BiConsumer<Integer, Integer> |
446 |
|
{ |
447 |
|
SubtractAction(ExecutionMode m) { super(m); } |
451 |
|
} |
452 |
|
} |
453 |
|
|
454 |
< |
class SubtractFunction extends CheckedIntegerAction |
454 |
> |
static class SubtractFunction extends CheckedIntegerAction |
455 |
|
implements BiFunction<Integer, Integer, Integer> |
456 |
|
{ |
457 |
|
SubtractFunction(ExecutionMode m) { super(m); } |
461 |
|
} |
462 |
|
} |
463 |
|
|
464 |
< |
class Noop extends CheckedAction implements Runnable { |
464 |
> |
static class Noop extends CheckedAction implements Runnable { |
465 |
|
Noop(ExecutionMode m) { super(m); } |
466 |
|
public void run() { |
467 |
|
invoked(); |
468 |
|
} |
469 |
|
} |
470 |
|
|
471 |
< |
class FailingSupplier extends CheckedAction |
471 |
> |
static class FailingSupplier extends CheckedAction |
472 |
|
implements Supplier<Integer> |
473 |
|
{ |
474 |
|
final CFException ex; |
479 |
|
} |
480 |
|
} |
481 |
|
|
482 |
< |
class FailingConsumer extends CheckedIntegerAction |
482 |
> |
static class FailingConsumer extends CheckedIntegerAction |
483 |
|
implements Consumer<Integer> |
484 |
|
{ |
485 |
|
final CFException ex; |
491 |
|
} |
492 |
|
} |
493 |
|
|
494 |
< |
class FailingBiConsumer extends CheckedIntegerAction |
494 |
> |
static class FailingBiConsumer extends CheckedIntegerAction |
495 |
|
implements BiConsumer<Integer, Integer> |
496 |
|
{ |
497 |
|
final CFException ex; |
503 |
|
} |
504 |
|
} |
505 |
|
|
506 |
< |
class FailingFunction extends CheckedIntegerAction |
506 |
> |
static class FailingFunction extends CheckedIntegerAction |
507 |
|
implements Function<Integer, Integer> |
508 |
|
{ |
509 |
|
final CFException ex; |
515 |
|
} |
516 |
|
} |
517 |
|
|
518 |
< |
class FailingBiFunction extends CheckedIntegerAction |
518 |
> |
static class FailingBiFunction extends CheckedIntegerAction |
519 |
|
implements BiFunction<Integer, Integer, Integer> |
520 |
|
{ |
521 |
|
final CFException ex; |
527 |
|
} |
528 |
|
} |
529 |
|
|
530 |
< |
class FailingRunnable extends CheckedAction implements Runnable { |
530 |
> |
static class FailingRunnable extends CheckedAction implements Runnable { |
531 |
|
final CFException ex; |
532 |
|
FailingRunnable(ExecutionMode m) { super(m); ex = new CFException(); } |
533 |
|
public void run() { |
536 |
|
} |
537 |
|
} |
538 |
|
|
539 |
< |
class CompletableFutureInc extends CheckedIntegerAction |
539 |
> |
static class CompletableFutureInc extends CheckedIntegerAction |
540 |
|
implements Function<Integer, CompletableFuture<Integer>> |
541 |
|
{ |
542 |
|
CompletableFutureInc(ExecutionMode m) { super(m); } |
549 |
|
} |
550 |
|
} |
551 |
|
|
552 |
< |
class FailingCompletableFutureFunction extends CheckedIntegerAction |
552 |
> |
static class FailingCompletableFutureFunction extends CheckedIntegerAction |
553 |
|
implements Function<Integer, CompletableFuture<Integer>> |
554 |
|
{ |
555 |
|
final CFException ex; |
561 |
|
} |
562 |
|
} |
563 |
|
|
564 |
+ |
static class CountingRejectingExecutor implements Executor { |
565 |
+ |
final RejectedExecutionException ex = new RejectedExecutionException(); |
566 |
+ |
final AtomicInteger count = new AtomicInteger(0); |
567 |
+ |
public void execute(Runnable r) { |
568 |
+ |
count.getAndIncrement(); |
569 |
+ |
throw ex; |
570 |
+ |
} |
571 |
+ |
} |
572 |
+ |
|
573 |
|
// Used for explicit executor tests |
574 |
|
static final class ThreadExecutor implements Executor { |
575 |
|
final AtomicInteger count = new AtomicInteger(0); |
1254 |
|
r.assertInvoked(); |
1255 |
|
}} |
1256 |
|
|
1257 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1258 |
+ |
public void testRunAsync_rejectingExecutor() { |
1259 |
+ |
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1260 |
+ |
try { |
1261 |
+ |
CompletableFuture.runAsync(() -> {}, e); |
1262 |
+ |
shouldThrow(); |
1263 |
+ |
} catch (Throwable t) { |
1264 |
+ |
assertSame(e.ex, t); |
1265 |
+ |
} |
1266 |
+ |
|
1267 |
+ |
assertEquals(1, e.count.get()); |
1268 |
+ |
} |
1269 |
+ |
|
1270 |
|
/** |
1271 |
|
* supplyAsync completes with result of supplier |
1272 |
|
*/ |
1301 |
|
r.assertInvoked(); |
1302 |
|
}} |
1303 |
|
|
1304 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1305 |
+ |
public void testSupplyAsync_rejectingExecutor() { |
1306 |
+ |
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1307 |
+ |
try { |
1308 |
+ |
CompletableFuture.supplyAsync(() -> null, e); |
1309 |
+ |
shouldThrow(); |
1310 |
+ |
} catch (Throwable t) { |
1311 |
+ |
assertSame(e.ex, t); |
1312 |
+ |
} |
1313 |
+ |
|
1314 |
+ |
assertEquals(1, e.count.get()); |
1315 |
+ |
} |
1316 |
+ |
|
1317 |
|
// seq completion methods |
1318 |
|
|
1319 |
|
/** |
2576 |
|
|
2577 |
|
// unspecified behavior - both source completions available |
2578 |
|
try { |
2579 |
< |
assertEquals(null, h0.join()); |
2579 |
> |
assertNull(h0.join()); |
2580 |
|
rs[0].assertValue(v1); |
2581 |
|
} catch (CompletionException ok) { |
2582 |
|
checkCompletedWithWrappedException(h0, ex); |
2583 |
|
rs[0].assertNotInvoked(); |
2584 |
|
} |
2585 |
|
try { |
2586 |
< |
assertEquals(null, h1.join()); |
2586 |
> |
assertNull(h1.join()); |
2587 |
|
rs[1].assertValue(v1); |
2588 |
|
} catch (CompletionException ok) { |
2589 |
|
checkCompletedWithWrappedException(h1, ex); |
2590 |
|
rs[1].assertNotInvoked(); |
2591 |
|
} |
2592 |
|
try { |
2593 |
< |
assertEquals(null, h2.join()); |
2593 |
> |
assertNull(h2.join()); |
2594 |
|
rs[2].assertValue(v1); |
2595 |
|
} catch (CompletionException ok) { |
2596 |
|
checkCompletedWithWrappedException(h2, ex); |
2597 |
|
rs[2].assertNotInvoked(); |
2598 |
|
} |
2599 |
|
try { |
2600 |
< |
assertEquals(null, h3.join()); |
2600 |
> |
assertNull(h3.join()); |
2601 |
|
rs[3].assertValue(v1); |
2602 |
|
} catch (CompletionException ok) { |
2603 |
|
checkCompletedWithWrappedException(h3, ex); |
2713 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2714 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2715 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2716 |
+ |
for (boolean pushNop : new boolean[] { true, false }) |
2717 |
|
{ |
2718 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2719 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2726 |
|
checkIncomplete(h1); |
2727 |
|
rs[0].assertNotInvoked(); |
2728 |
|
rs[1].assertNotInvoked(); |
2729 |
+ |
if (pushNop) { // ad hoc test of intra-completion interference |
2730 |
+ |
m.thenRun(f, () -> {}); |
2731 |
+ |
m.thenRun(g, () -> {}); |
2732 |
+ |
} |
2733 |
|
f.complete(v1); |
2734 |
|
checkCompletedNormally(h0, null); |
2735 |
|
checkCompletedNormally(h1, null); |
2836 |
|
|
2837 |
|
// unspecified behavior - both source completions available |
2838 |
|
try { |
2839 |
< |
assertEquals(null, h0.join()); |
2839 |
> |
assertNull(h0.join()); |
2840 |
|
rs[0].assertInvoked(); |
2841 |
|
} catch (CompletionException ok) { |
2842 |
|
checkCompletedWithWrappedException(h0, ex); |
2843 |
|
rs[0].assertNotInvoked(); |
2844 |
|
} |
2845 |
|
try { |
2846 |
< |
assertEquals(null, h1.join()); |
2846 |
> |
assertNull(h1.join()); |
2847 |
|
rs[1].assertInvoked(); |
2848 |
|
} catch (CompletionException ok) { |
2849 |
|
checkCompletedWithWrappedException(h1, ex); |
2850 |
|
rs[1].assertNotInvoked(); |
2851 |
|
} |
2852 |
|
try { |
2853 |
< |
assertEquals(null, h2.join()); |
2853 |
> |
assertNull(h2.join()); |
2854 |
|
rs[2].assertInvoked(); |
2855 |
|
} catch (CompletionException ok) { |
2856 |
|
checkCompletedWithWrappedException(h2, ex); |
2857 |
|
rs[2].assertNotInvoked(); |
2858 |
|
} |
2859 |
|
try { |
2860 |
< |
assertEquals(null, h3.join()); |
2860 |
> |
assertNull(h3.join()); |
2861 |
|
rs[3].assertInvoked(); |
2862 |
|
} catch (CompletionException ok) { |
2863 |
|
checkCompletedWithWrappedException(h3, ex); |
3252 |
|
/** |
3253 |
|
* Completion methods throw NullPointerException with null arguments |
3254 |
|
*/ |
3255 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
3256 |
|
public void testNPE() { |
3257 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3258 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3272 |
|
|
3273 |
|
() -> f.thenApply(null), |
3274 |
|
() -> f.thenApplyAsync(null), |
3275 |
< |
() -> f.thenApplyAsync((x) -> x, null), |
3275 |
> |
() -> f.thenApplyAsync(x -> x, null), |
3276 |
|
() -> f.thenApplyAsync(null, exec), |
3277 |
|
|
3278 |
|
() -> f.thenAccept(null), |
3279 |
|
() -> f.thenAcceptAsync(null), |
3280 |
< |
() -> f.thenAcceptAsync((x) -> {} , null), |
3280 |
> |
() -> f.thenAcceptAsync(x -> {} , null), |
3281 |
|
() -> f.thenAcceptAsync(null, exec), |
3282 |
|
|
3283 |
|
() -> f.thenRun(null), |
3312 |
|
() -> f.applyToEither(g, null), |
3313 |
|
() -> f.applyToEitherAsync(g, null), |
3314 |
|
() -> f.applyToEitherAsync(g, null, exec), |
3315 |
< |
() -> f.applyToEither(nullFuture, (x) -> x), |
3316 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x), |
3317 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x, exec), |
3318 |
< |
() -> f.applyToEitherAsync(g, (x) -> x, null), |
3315 |
> |
() -> f.applyToEither(nullFuture, x -> x), |
3316 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x), |
3317 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x, exec), |
3318 |
> |
() -> f.applyToEitherAsync(g, x -> x, null), |
3319 |
|
|
3320 |
|
() -> f.acceptEither(g, null), |
3321 |
|
() -> f.acceptEitherAsync(g, null), |
3322 |
|
() -> f.acceptEitherAsync(g, null, exec), |
3323 |
< |
() -> f.acceptEither(nullFuture, (x) -> {}), |
3324 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}), |
3325 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}, exec), |
3326 |
< |
() -> f.acceptEitherAsync(g, (x) -> {}, null), |
3323 |
> |
() -> f.acceptEither(nullFuture, x -> {}), |
3324 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}), |
3325 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}, exec), |
3326 |
> |
() -> f.acceptEitherAsync(g, x -> {}, null), |
3327 |
|
|
3328 |
|
() -> f.runAfterEither(g, null), |
3329 |
|
() -> f.runAfterEitherAsync(g, null), |
3369 |
|
assertEquals(0, exec.count.get()); |
3370 |
|
} |
3371 |
|
|
3320 |
– |
static class CountingRejectingExecutor implements Executor { |
3321 |
– |
final RejectedExecutionException ex = new RejectedExecutionException(); |
3322 |
– |
final AtomicInteger count = new AtomicInteger(0); |
3323 |
– |
public void execute(Runnable r) { |
3324 |
– |
count.getAndIncrement(); |
3325 |
– |
throw ex; |
3326 |
– |
} |
3327 |
– |
} |
3328 |
– |
|
3372 |
|
/** |
3373 |
|
* Test submissions to an executor that rejects all tasks. |
3374 |
|
*/ |
3375 |
|
public void testRejectingExecutor() { |
3376 |
< |
for (Integer v : new Integer[] { 1, null }) { |
3377 |
< |
|
3376 |
> |
for (Integer v : new Integer[] { 1, null }) |
3377 |
> |
{ |
3378 |
|
final CountingRejectingExecutor e = new CountingRejectingExecutor(); |
3379 |
|
|
3380 |
|
final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v); |
3389 |
|
for (CompletableFuture<Integer> src : srcs) { |
3390 |
|
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3391 |
|
fs.add(src.thenRunAsync(() -> {}, e)); |
3392 |
< |
fs.add(src.thenAcceptAsync((z) -> {}, e)); |
3393 |
< |
fs.add(src.thenApplyAsync((z) -> z, e)); |
3392 |
> |
fs.add(src.thenAcceptAsync(z -> {}, e)); |
3393 |
> |
fs.add(src.thenApplyAsync(z -> z, e)); |
3394 |
|
|
3395 |
|
fs.add(src.thenCombineAsync(src, (x, y) -> x, e)); |
3396 |
|
fs.add(src.thenAcceptBothAsync(src, (x, y) -> {}, e)); |
3397 |
|
fs.add(src.runAfterBothAsync(src, () -> {}, e)); |
3398 |
|
|
3399 |
< |
fs.add(src.applyToEitherAsync(src, (z) -> z, e)); |
3400 |
< |
fs.add(src.acceptEitherAsync(src, (z) -> {}, e)); |
3399 |
> |
fs.add(src.applyToEitherAsync(src, z -> z, e)); |
3400 |
> |
fs.add(src.acceptEitherAsync(src, z -> {}, e)); |
3401 |
|
fs.add(src.runAfterEitherAsync(src, () -> {}, e)); |
3402 |
|
|
3403 |
< |
fs.add(src.thenComposeAsync((z) -> null, e)); |
3403 |
> |
fs.add(src.thenComposeAsync(z -> null, e)); |
3404 |
|
fs.add(src.whenCompleteAsync((z, t) -> {}, e)); |
3405 |
|
fs.add(src.handleAsync((z, t) -> null, e)); |
3406 |
|
|
3433 |
|
{ |
3434 |
|
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3435 |
|
|
3436 |
< |
fs.add(complete.applyToEitherAsync(incomplete, (z) -> z, e)); |
3437 |
< |
fs.add(incomplete.applyToEitherAsync(complete, (z) -> z, e)); |
3436 |
> |
fs.add(complete.applyToEitherAsync(incomplete, z -> z, e)); |
3437 |
> |
fs.add(incomplete.applyToEitherAsync(complete, z -> z, e)); |
3438 |
|
|
3439 |
< |
fs.add(complete.acceptEitherAsync(incomplete, (z) -> {}, e)); |
3440 |
< |
fs.add(incomplete.acceptEitherAsync(complete, (z) -> {}, e)); |
3439 |
> |
fs.add(complete.acceptEitherAsync(incomplete, z -> {}, e)); |
3440 |
> |
fs.add(incomplete.acceptEitherAsync(complete, z -> {}, e)); |
3441 |
|
|
3442 |
|
fs.add(complete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3443 |
|
fs.add(incomplete.runAfterEitherAsync(complete, () -> {}, e)); |
3453 |
|
checkCompletedWithWrappedException(future, e.ex); |
3454 |
|
|
3455 |
|
assertEquals(futures.size(), e.count.get()); |
3456 |
< |
|
3414 |
< |
} |
3415 |
< |
} |
3456 |
> |
}} |
3457 |
|
|
3458 |
|
/** |
3459 |
|
* Test submissions to an executor that rejects all tasks, but |
3461 |
|
* explicitly completed. |
3462 |
|
*/ |
3463 |
|
public void testRejectingExecutorNeverInvoked() { |
3464 |
+ |
for (Integer v : new Integer[] { 1, null }) |
3465 |
+ |
{ |
3466 |
|
final CountingRejectingExecutor e = new CountingRejectingExecutor(); |
3467 |
|
|
3425 |
– |
for (Integer v : new Integer[] { 1, null }) { |
3426 |
– |
|
3468 |
|
final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v); |
3469 |
|
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3470 |
|
|
3476 |
|
|
3477 |
|
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3478 |
|
fs.add(incomplete.thenRunAsync(() -> {}, e)); |
3479 |
< |
fs.add(incomplete.thenAcceptAsync((z) -> {}, e)); |
3480 |
< |
fs.add(incomplete.thenApplyAsync((z) -> z, e)); |
3479 |
> |
fs.add(incomplete.thenAcceptAsync(z -> {}, e)); |
3480 |
> |
fs.add(incomplete.thenApplyAsync(z -> z, e)); |
3481 |
|
|
3482 |
|
fs.add(incomplete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3483 |
|
fs.add(incomplete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3484 |
|
fs.add(incomplete.runAfterBothAsync(incomplete, () -> {}, e)); |
3485 |
|
|
3486 |
< |
fs.add(incomplete.applyToEitherAsync(incomplete, (z) -> z, e)); |
3487 |
< |
fs.add(incomplete.acceptEitherAsync(incomplete, (z) -> {}, e)); |
3486 |
> |
fs.add(incomplete.applyToEitherAsync(incomplete, z -> z, e)); |
3487 |
> |
fs.add(incomplete.acceptEitherAsync(incomplete, z -> {}, e)); |
3488 |
|
fs.add(incomplete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3489 |
|
|
3490 |
< |
fs.add(incomplete.thenComposeAsync((z) -> null, e)); |
3490 |
> |
fs.add(incomplete.thenComposeAsync(z -> null, e)); |
3491 |
|
fs.add(incomplete.whenCompleteAsync((z, t) -> {}, e)); |
3492 |
|
fs.add(incomplete.handleAsync((z, t) -> null, e)); |
3493 |
|
|
3512 |
|
checkCompletedNormally(future, null); |
3513 |
|
|
3514 |
|
assertEquals(0, e.count.get()); |
3515 |
< |
|
3475 |
< |
} |
3476 |
< |
} |
3515 |
> |
}} |
3516 |
|
|
3517 |
|
/** |
3518 |
|
* toCompletableFuture returns this CompletableFuture. |
3547 |
|
*/ |
3548 |
|
public void testCompletedStage() { |
3549 |
|
AtomicInteger x = new AtomicInteger(0); |
3550 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3550 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3551 |
|
CompletionStage<Integer> f = CompletableFuture.completedStage(1); |
3552 |
|
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3553 |
|
assertEquals(x.get(), 1); |
3592 |
|
* copy returns a CompletableFuture that is completed normally, |
3593 |
|
* with the same value, when source is. |
3594 |
|
*/ |
3595 |
< |
public void testCopy() { |
3595 |
> |
public void testCopy_normalCompletion() { |
3596 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3597 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
3598 |
> |
{ |
3599 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3600 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3601 |
|
CompletableFuture<Integer> g = f.copy(); |
3602 |
< |
checkIncomplete(f); |
3603 |
< |
checkIncomplete(g); |
3604 |
< |
f.complete(1); |
3605 |
< |
checkCompletedNormally(f, 1); |
3606 |
< |
checkCompletedNormally(g, 1); |
3607 |
< |
} |
3602 |
> |
if (createIncomplete) { |
3603 |
> |
checkIncomplete(f); |
3604 |
> |
checkIncomplete(g); |
3605 |
> |
assertTrue(f.complete(v1)); |
3606 |
> |
} |
3607 |
> |
checkCompletedNormally(f, v1); |
3608 |
> |
checkCompletedNormally(g, v1); |
3609 |
> |
}} |
3610 |
|
|
3611 |
|
/** |
3612 |
|
* copy returns a CompletableFuture that is completed exceptionally |
3613 |
|
* when source is. |
3614 |
|
*/ |
3615 |
< |
public void testCopy2() { |
3615 |
> |
public void testCopy_exceptionalCompletion() { |
3616 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3617 |
> |
{ |
3618 |
> |
CFException ex = new CFException(); |
3619 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3620 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
3621 |
|
CompletableFuture<Integer> g = f.copy(); |
3622 |
< |
checkIncomplete(f); |
3623 |
< |
checkIncomplete(g); |
3624 |
< |
CFException ex = new CFException(); |
3625 |
< |
f.completeExceptionally(ex); |
3622 |
> |
if (createIncomplete) { |
3623 |
> |
checkIncomplete(f); |
3624 |
> |
checkIncomplete(g); |
3625 |
> |
f.completeExceptionally(ex); |
3626 |
> |
} |
3627 |
|
checkCompletedExceptionally(f, ex); |
3628 |
|
checkCompletedWithWrappedException(g, ex); |
3629 |
+ |
}} |
3630 |
+ |
|
3631 |
+ |
/** |
3632 |
+ |
* Completion of a copy does not complete its source. |
3633 |
+ |
*/ |
3634 |
+ |
public void testCopy_oneWayPropagation() { |
3635 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3636 |
+ |
assertTrue(f.copy().complete(1)); |
3637 |
+ |
assertTrue(f.copy().complete(null)); |
3638 |
+ |
assertTrue(f.copy().cancel(true)); |
3639 |
+ |
assertTrue(f.copy().cancel(false)); |
3640 |
+ |
assertTrue(f.copy().completeExceptionally(new CFException())); |
3641 |
+ |
checkIncomplete(f); |
3642 |
|
} |
3643 |
|
|
3644 |
|
/** |
3649 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3650 |
|
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3651 |
|
AtomicInteger x = new AtomicInteger(0); |
3652 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3652 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3653 |
|
checkIncomplete(f); |
3654 |
|
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3655 |
|
f.complete(1); |
3666 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3667 |
|
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3668 |
|
AtomicInteger x = new AtomicInteger(0); |
3669 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3669 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3670 |
|
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3671 |
|
checkIncomplete(f); |
3672 |
|
CFException ex = new CFException(); |
3684 |
|
CFException ex = new CFException(); |
3685 |
|
CompletionStage<Integer> f = CompletableFuture.failedStage(ex); |
3686 |
|
AtomicInteger x = new AtomicInteger(0); |
3687 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3687 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3688 |
|
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3689 |
|
assertEquals(x.get(), 0); |
3690 |
|
assertEquals(r.get(), ex); |
3708 |
|
public void testCompleteAsync2() { |
3709 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3710 |
|
CFException ex = new CFException(); |
3711 |
< |
f.completeAsync(() -> {if (true) throw ex; return 1;}); |
3711 |
> |
f.completeAsync(() -> { throw ex; }); |
3712 |
|
try { |
3713 |
|
f.join(); |
3714 |
|
shouldThrow(); |
3738 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3739 |
|
CFException ex = new CFException(); |
3740 |
|
ThreadExecutor executor = new ThreadExecutor(); |
3741 |
< |
f.completeAsync(() -> {if (true) throw ex; return 1;}, executor); |
3741 |
> |
f.completeAsync(() -> { throw ex; }, executor); |
3742 |
|
try { |
3743 |
|
f.join(); |
3744 |
|
shouldThrow(); |
3890 |
|
final CompletableFuture<Integer> v42 = CompletableFuture.completedFuture(42); |
3891 |
|
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3892 |
|
|
3893 |
+ |
final Runnable noopRunnable = new Noop(m); |
3894 |
+ |
final Consumer<Integer> noopConsumer = new NoopConsumer(m); |
3895 |
+ |
final Function<Integer, Integer> incFunction = new IncFunction(m); |
3896 |
+ |
|
3897 |
|
List<Function<CompletableFuture<Integer>, CompletableFuture<?>>> funs |
3898 |
|
= new ArrayList<>(); |
3899 |
|
|
3900 |
< |
funs.add((y) -> m.thenRun(y, new Noop(m))); |
3901 |
< |
funs.add((y) -> m.thenAccept(y, new NoopConsumer(m))); |
3902 |
< |
funs.add((y) -> m.thenApply(y, new IncFunction(m))); |
3903 |
< |
|
3904 |
< |
funs.add((y) -> m.runAfterEither(y, incomplete, new Noop(m))); |
3905 |
< |
funs.add((y) -> m.acceptEither(y, incomplete, new NoopConsumer(m))); |
3906 |
< |
funs.add((y) -> m.applyToEither(y, incomplete, new IncFunction(m))); |
3907 |
< |
|
3908 |
< |
funs.add((y) -> m.runAfterBoth(y, v42, new Noop(m))); |
3909 |
< |
funs.add((y) -> m.runAfterBoth(v42, y, new Noop(m))); |
3910 |
< |
funs.add((y) -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
3911 |
< |
funs.add((y) -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
3912 |
< |
funs.add((y) -> m.thenCombine(y, v42, new SubtractFunction(m))); |
3913 |
< |
funs.add((y) -> m.thenCombine(v42, y, new SubtractFunction(m))); |
3914 |
< |
|
3915 |
< |
funs.add((y) -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
3916 |
< |
|
3917 |
< |
funs.add((y) -> m.thenCompose(y, new CompletableFutureInc(m))); |
3918 |
< |
|
3919 |
< |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y})); |
3920 |
< |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y, v42})); |
3921 |
< |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {v42, y})); |
3922 |
< |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y})); |
3923 |
< |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y, incomplete})); |
3924 |
< |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {incomplete, y})); |
3900 |
> |
funs.add(y -> m.thenRun(y, noopRunnable)); |
3901 |
> |
funs.add(y -> m.thenAccept(y, noopConsumer)); |
3902 |
> |
funs.add(y -> m.thenApply(y, incFunction)); |
3903 |
> |
|
3904 |
> |
funs.add(y -> m.runAfterEither(y, incomplete, noopRunnable)); |
3905 |
> |
funs.add(y -> m.acceptEither(y, incomplete, noopConsumer)); |
3906 |
> |
funs.add(y -> m.applyToEither(y, incomplete, incFunction)); |
3907 |
> |
|
3908 |
> |
funs.add(y -> m.runAfterBoth(y, v42, noopRunnable)); |
3909 |
> |
funs.add(y -> m.runAfterBoth(v42, y, noopRunnable)); |
3910 |
> |
funs.add(y -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
3911 |
> |
funs.add(y -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
3912 |
> |
funs.add(y -> m.thenCombine(y, v42, new SubtractFunction(m))); |
3913 |
> |
funs.add(y -> m.thenCombine(v42, y, new SubtractFunction(m))); |
3914 |
> |
|
3915 |
> |
funs.add(y -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
3916 |
> |
|
3917 |
> |
funs.add(y -> m.thenCompose(y, new CompletableFutureInc(m))); |
3918 |
> |
|
3919 |
> |
funs.add(y -> CompletableFuture.allOf(y)); |
3920 |
> |
funs.add(y -> CompletableFuture.allOf(y, v42)); |
3921 |
> |
funs.add(y -> CompletableFuture.allOf(v42, y)); |
3922 |
> |
funs.add(y -> CompletableFuture.anyOf(y)); |
3923 |
> |
funs.add(y -> CompletableFuture.anyOf(y, incomplete)); |
3924 |
> |
funs.add(y -> CompletableFuture.anyOf(incomplete, y)); |
3925 |
|
|
3926 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3927 |
|
fun : funs) { |
3928 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3929 |
|
f.completeExceptionally(ex); |
3930 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3930 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
3931 |
|
checkCompletedWithWrappedException(src, ex); |
3932 |
|
CompletableFuture<?> dep = fun.apply(src); |
3933 |
|
checkCompletedWithWrappedException(dep, ex); |
3937 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3938 |
|
fun : funs) { |
3939 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3940 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3940 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
3941 |
|
CompletableFuture<?> dep = fun.apply(src); |
3942 |
|
f.completeExceptionally(ex); |
3943 |
|
checkCompletedWithWrappedException(src, ex); |
3951 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3952 |
|
f.cancel(mayInterruptIfRunning); |
3953 |
|
checkCancelled(f); |
3954 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3954 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
3955 |
|
checkCompletedWithWrappedCancellationException(src); |
3956 |
|
CompletableFuture<?> dep = fun.apply(src); |
3957 |
|
checkCompletedWithWrappedCancellationException(dep); |
3962 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3963 |
|
fun : funs) { |
3964 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3965 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3965 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
3966 |
|
CompletableFuture<?> dep = fun.apply(src); |
3967 |
|
f.cancel(mayInterruptIfRunning); |
3968 |
|
checkCancelled(f); |
3973 |
|
}} |
3974 |
|
|
3975 |
|
/** |
3976 |
< |
* Minimal completion stages throw UOE for all non-CompletionStage methods |
3976 |
> |
* Minimal completion stages throw UOE for most non-CompletionStage methods |
3977 |
|
*/ |
3978 |
|
public void testMinimalCompletionStage_minimality() { |
3979 |
|
if (!testImplementationDetails) return; |
3980 |
|
Function<Method, String> toSignature = |
3981 |
< |
(method) -> method.getName() + Arrays.toString(method.getParameterTypes()); |
3981 |
> |
method -> method.getName() + Arrays.toString(method.getParameterTypes()); |
3982 |
|
Predicate<Method> isNotStatic = |
3983 |
< |
(method) -> (method.getModifiers() & Modifier.STATIC) == 0; |
3983 |
> |
method -> (method.getModifiers() & Modifier.STATIC) == 0; |
3984 |
|
List<Method> minimalMethods = |
3985 |
|
Stream.of(Object.class, CompletionStage.class) |
3986 |
< |
.flatMap((klazz) -> Stream.of(klazz.getMethods())) |
3986 |
> |
.flatMap(klazz -> Stream.of(klazz.getMethods())) |
3987 |
|
.filter(isNotStatic) |
3988 |
|
.collect(Collectors.toList()); |
3989 |
|
// Methods from CompletableFuture permitted NOT to throw UOE |
3999 |
|
.collect(Collectors.toSet()); |
4000 |
|
List<Method> allMethods = Stream.of(CompletableFuture.class.getMethods()) |
4001 |
|
.filter(isNotStatic) |
4002 |
< |
.filter((method) -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
4002 |
> |
.filter(method -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
4003 |
|
.collect(Collectors.toList()); |
4004 |
|
|
4005 |
< |
CompletionStage<Integer> minimalStage = |
4005 |
> |
List<CompletionStage<Integer>> stages = new ArrayList<>(); |
4006 |
> |
CompletionStage<Integer> min = |
4007 |
|
new CompletableFuture<Integer>().minimalCompletionStage(); |
4008 |
+ |
stages.add(min); |
4009 |
+ |
stages.add(min.thenApply(x -> x)); |
4010 |
+ |
stages.add(CompletableFuture.completedStage(1)); |
4011 |
+ |
stages.add(CompletableFuture.failedStage(new CFException())); |
4012 |
|
|
4013 |
|
List<Method> bugs = new ArrayList<>(); |
4014 |
|
for (Method method : allMethods) { |
4024 |
|
else if (parameterTypes[i] == long.class) |
4025 |
|
args[i] = 0L; |
4026 |
|
} |
4027 |
< |
try { |
4028 |
< |
method.invoke(minimalStage, args); |
4029 |
< |
bugs.add(method); |
3958 |
< |
} |
3959 |
< |
catch (java.lang.reflect.InvocationTargetException expected) { |
3960 |
< |
if (! (expected.getCause() instanceof UnsupportedOperationException)) { |
4027 |
> |
for (CompletionStage<Integer> stage : stages) { |
4028 |
> |
try { |
4029 |
> |
method.invoke(stage, args); |
4030 |
|
bugs.add(method); |
3962 |
– |
// expected.getCause().printStackTrace(); |
4031 |
|
} |
4032 |
+ |
catch (java.lang.reflect.InvocationTargetException expected) { |
4033 |
+ |
if (! (expected.getCause() instanceof UnsupportedOperationException)) { |
4034 |
+ |
bugs.add(method); |
4035 |
+ |
// expected.getCause().printStackTrace(); |
4036 |
+ |
} |
4037 |
+ |
} |
4038 |
+ |
catch (ReflectiveOperationException bad) { throw new Error(bad); } |
4039 |
|
} |
3965 |
– |
catch (ReflectiveOperationException bad) { throw new Error(bad); } |
4040 |
|
} |
4041 |
|
if (!bugs.isEmpty()) |
4042 |
< |
throw new Error("Methods did not throw UOE: " + bugs.toString()); |
4042 |
> |
throw new Error("Methods did not throw UOE: " + bugs); |
4043 |
|
} |
4044 |
|
|
4045 |
+ |
/** |
4046 |
+ |
* minimalStage.toCompletableFuture() returns a CompletableFuture that |
4047 |
+ |
* is completed normally, with the same value, when source is. |
4048 |
+ |
*/ |
4049 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_normalCompletion() { |
4050 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4051 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4052 |
+ |
{ |
4053 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4054 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4055 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4056 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4057 |
+ |
if (createIncomplete) { |
4058 |
+ |
checkIncomplete(f); |
4059 |
+ |
checkIncomplete(g); |
4060 |
+ |
assertTrue(f.complete(v1)); |
4061 |
+ |
} |
4062 |
+ |
checkCompletedNormally(f, v1); |
4063 |
+ |
checkCompletedNormally(g, v1); |
4064 |
+ |
}} |
4065 |
+ |
|
4066 |
+ |
/** |
4067 |
+ |
* minimalStage.toCompletableFuture() returns a CompletableFuture that |
4068 |
+ |
* is completed exceptionally when source is. |
4069 |
+ |
*/ |
4070 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_exceptionalCompletion() { |
4071 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4072 |
+ |
{ |
4073 |
+ |
CFException ex = new CFException(); |
4074 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4075 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4076 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
4077 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4078 |
+ |
if (createIncomplete) { |
4079 |
+ |
checkIncomplete(f); |
4080 |
+ |
checkIncomplete(g); |
4081 |
+ |
f.completeExceptionally(ex); |
4082 |
+ |
} |
4083 |
+ |
checkCompletedExceptionally(f, ex); |
4084 |
+ |
checkCompletedWithWrappedException(g, ex); |
4085 |
+ |
}} |
4086 |
+ |
|
4087 |
+ |
/** |
4088 |
+ |
* minimalStage.toCompletableFuture() gives mutable CompletableFuture |
4089 |
+ |
*/ |
4090 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_mutable() { |
4091 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4092 |
+ |
{ |
4093 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4094 |
+ |
CompletionStage minimal = f.minimalCompletionStage(); |
4095 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4096 |
+ |
assertTrue(g.complete(v1)); |
4097 |
+ |
checkCompletedNormally(g, v1); |
4098 |
+ |
checkIncomplete(f); |
4099 |
+ |
checkIncomplete(minimal.toCompletableFuture()); |
4100 |
+ |
}} |
4101 |
+ |
|
4102 |
+ |
/** |
4103 |
+ |
* minimalStage.toCompletableFuture().join() awaits completion |
4104 |
+ |
*/ |
4105 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_join() throws Exception { |
4106 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4107 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4108 |
+ |
{ |
4109 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4110 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4111 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4112 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4113 |
+ |
assertEquals(v1, minimal.toCompletableFuture().join()); |
4114 |
+ |
assertEquals(v1, minimal.toCompletableFuture().get()); |
4115 |
+ |
checkCompletedNormally(minimal.toCompletableFuture(), v1); |
4116 |
+ |
}} |
4117 |
+ |
|
4118 |
+ |
/** |
4119 |
+ |
* Completion of a toCompletableFuture copy of a minimal stage |
4120 |
+ |
* does not complete its source. |
4121 |
+ |
*/ |
4122 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_oneWayPropagation() { |
4123 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4124 |
+ |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
4125 |
+ |
assertTrue(g.toCompletableFuture().complete(1)); |
4126 |
+ |
assertTrue(g.toCompletableFuture().complete(null)); |
4127 |
+ |
assertTrue(g.toCompletableFuture().cancel(true)); |
4128 |
+ |
assertTrue(g.toCompletableFuture().cancel(false)); |
4129 |
+ |
assertTrue(g.toCompletableFuture().completeExceptionally(new CFException())); |
4130 |
+ |
checkIncomplete(g.toCompletableFuture()); |
4131 |
+ |
f.complete(1); |
4132 |
+ |
checkCompletedNormally(g.toCompletableFuture(), 1); |
4133 |
+ |
} |
4134 |
+ |
|
4135 |
+ |
/** Demo utility method for external reliable toCompletableFuture */ |
4136 |
+ |
static <T> CompletableFuture<T> toCompletableFuture(CompletionStage<T> stage) { |
4137 |
+ |
CompletableFuture<T> f = new CompletableFuture<>(); |
4138 |
+ |
stage.handle((T t, Throwable ex) -> { |
4139 |
+ |
if (ex != null) f.completeExceptionally(ex); |
4140 |
+ |
else f.complete(t); |
4141 |
+ |
return null; |
4142 |
+ |
}); |
4143 |
+ |
return f; |
4144 |
+ |
} |
4145 |
+ |
|
4146 |
+ |
/** Demo utility method to join a CompletionStage */ |
4147 |
+ |
static <T> T join(CompletionStage<T> stage) { |
4148 |
+ |
return toCompletableFuture(stage).join(); |
4149 |
+ |
} |
4150 |
+ |
|
4151 |
+ |
/** |
4152 |
+ |
* Joining a minimal stage "by hand" works |
4153 |
+ |
*/ |
4154 |
+ |
public void testMinimalCompletionStage_join_by_hand() { |
4155 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4156 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4157 |
+ |
{ |
4158 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4159 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4160 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
4161 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4162 |
+ |
minimal.thenAccept(x -> g.complete(x)); |
4163 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4164 |
+ |
g.join(); |
4165 |
+ |
checkCompletedNormally(g, v1); |
4166 |
+ |
checkCompletedNormally(f, v1); |
4167 |
+ |
assertEquals(v1, join(minimal)); |
4168 |
+ |
}} |
4169 |
+ |
|
4170 |
|
static class Monad { |
4171 |
|
static class ZeroException extends RuntimeException { |
4172 |
|
public ZeroException() { super("monadic zero"); } |
4183 |
|
static <T,U,V> Function<T, CompletableFuture<V>> compose |
4184 |
|
(Function<T, CompletableFuture<U>> f, |
4185 |
|
Function<U, CompletableFuture<V>> g) { |
4186 |
< |
return (x) -> f.apply(x).thenCompose(g); |
4186 |
> |
return x -> f.apply(x).thenCompose(g); |
4187 |
|
} |
4188 |
|
|
4189 |
|
static void assertZero(CompletableFuture<?> f) { |
4190 |
|
try { |
4191 |
|
f.getNow(null); |
4192 |
< |
throw new AssertionFailedError("should throw"); |
4192 |
> |
throw new AssertionError("should throw"); |
4193 |
|
} catch (CompletionException success) { |
4194 |
|
assertTrue(success.getCause() instanceof ZeroException); |
4195 |
|
} |
4263 |
|
|
4264 |
|
// Some mutually non-commutative functions |
4265 |
|
Function<Long, CompletableFuture<Long>> triple |
4266 |
< |
= (x) -> Monad.unit(3 * x); |
4266 |
> |
= x -> Monad.unit(3 * x); |
4267 |
|
Function<Long, CompletableFuture<Long>> inc |
4268 |
< |
= (x) -> Monad.unit(x + 1); |
4268 |
> |
= x -> Monad.unit(x + 1); |
4269 |
|
|
4270 |
|
// unit is a right identity: m >>= unit === m |
4271 |
|
Monad.assertFutureEquals(inc.apply(5L).thenCompose(unit), |
4277 |
|
// associativity: (m >>= f) >>= g === m >>= ( \x -> (f x >>= g) ) |
4278 |
|
Monad.assertFutureEquals( |
4279 |
|
unit.apply(5L).thenCompose(inc).thenCompose(triple), |
4280 |
< |
unit.apply(5L).thenCompose((x) -> inc.apply(x).thenCompose(triple))); |
4280 |
> |
unit.apply(5L).thenCompose(x -> inc.apply(x).thenCompose(triple))); |
4281 |
|
|
4282 |
|
// The case for CompletableFuture as an additive monad is weaker... |
4283 |
|
|
4287 |
|
// left zero: zero >>= f === zero |
4288 |
|
Monad.assertZero(zero.thenCompose(inc)); |
4289 |
|
// right zero: f >>= (\x -> zero) === zero |
4290 |
< |
Monad.assertZero(inc.apply(5L).thenCompose((x) -> zero)); |
4290 |
> |
Monad.assertZero(inc.apply(5L).thenCompose(x -> zero)); |
4291 |
|
|
4292 |
|
// f plus zero === f |
4293 |
|
Monad.assertFutureEquals(Monad.unit(5L), |
4313 |
|
Monad.plus(godot, Monad.unit(5L))); |
4314 |
|
} |
4315 |
|
|
4316 |
+ |
/** Test long recursive chains of CompletableFutures with cascading completions */ |
4317 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4318 |
+ |
public void testRecursiveChains() throws Throwable { |
4319 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
4320 |
+ |
for (boolean addDeadEnds : new boolean[] { true, false }) |
4321 |
+ |
{ |
4322 |
+ |
final int val = 42; |
4323 |
+ |
final int n = expensiveTests ? 1_000 : 2; |
4324 |
+ |
CompletableFuture<Integer> head = new CompletableFuture<>(); |
4325 |
+ |
CompletableFuture<Integer> tail = head; |
4326 |
+ |
for (int i = 0; i < n; i++) { |
4327 |
+ |
if (addDeadEnds) m.thenApply(tail, v -> v + 1); |
4328 |
+ |
tail = m.thenApply(tail, v -> v + 1); |
4329 |
+ |
if (addDeadEnds) m.applyToEither(tail, tail, v -> v + 1); |
4330 |
+ |
tail = m.applyToEither(tail, tail, v -> v + 1); |
4331 |
+ |
if (addDeadEnds) m.thenCombine(tail, tail, (v, w) -> v + 1); |
4332 |
+ |
tail = m.thenCombine(tail, tail, (v, w) -> v + 1); |
4333 |
+ |
} |
4334 |
+ |
head.complete(val); |
4335 |
+ |
assertEquals(val + 3 * n, (int) tail.join()); |
4336 |
+ |
}} |
4337 |
+ |
|
4338 |
|
/** |
4339 |
|
* A single CompletableFuture with many dependents. |
4340 |
|
* A demo of scalability - runtime is O(n). |
4341 |
|
*/ |
4342 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4343 |
|
public void testManyDependents() throws Throwable { |
4344 |
< |
final int n = 1_000; |
4344 |
> |
final int n = expensiveTests ? 1_000_000 : 10; |
4345 |
|
final CompletableFuture<Void> head = new CompletableFuture<>(); |
4346 |
|
final CompletableFuture<Void> complete = CompletableFuture.completedFuture((Void)null); |
4347 |
|
final AtomicInteger count = new AtomicInteger(0); |
4348 |
|
for (int i = 0; i < n; i++) { |
4349 |
|
head.thenRun(() -> count.getAndIncrement()); |
4350 |
< |
head.thenAccept((x) -> count.getAndIncrement()); |
4351 |
< |
head.thenApply((x) -> count.getAndIncrement()); |
4350 |
> |
head.thenAccept(x -> count.getAndIncrement()); |
4351 |
> |
head.thenApply(x -> count.getAndIncrement()); |
4352 |
|
|
4353 |
|
head.runAfterBoth(complete, () -> count.getAndIncrement()); |
4354 |
|
head.thenAcceptBoth(complete, (x, y) -> count.getAndIncrement()); |
4358 |
|
complete.thenCombine(head, (x, y) -> count.getAndIncrement()); |
4359 |
|
|
4360 |
|
head.runAfterEither(new CompletableFuture<Void>(), () -> count.getAndIncrement()); |
4361 |
< |
head.acceptEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
4362 |
< |
head.applyToEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
4361 |
> |
head.acceptEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4362 |
> |
head.applyToEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4363 |
|
new CompletableFuture<Void>().runAfterEither(head, () -> count.getAndIncrement()); |
4364 |
< |
new CompletableFuture<Void>().acceptEither(head, (x) -> count.getAndIncrement()); |
4365 |
< |
new CompletableFuture<Void>().applyToEither(head, (x) -> count.getAndIncrement()); |
4364 |
> |
new CompletableFuture<Void>().acceptEither(head, x -> count.getAndIncrement()); |
4365 |
> |
new CompletableFuture<Void>().applyToEither(head, x -> count.getAndIncrement()); |
4366 |
|
} |
4367 |
|
head.complete(null); |
4368 |
|
assertEquals(5 * 3 * n, count.get()); |
4369 |
|
} |
4370 |
|
|
4371 |
+ |
/** ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck */ |
4372 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4373 |
+ |
public void testCoCompletionGarbageRetention() throws Throwable { |
4374 |
+ |
final int n = expensiveTests ? 1_000_000 : 10; |
4375 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4376 |
+ |
CompletableFuture<Integer> f; |
4377 |
+ |
for (int i = 0; i < n; i++) { |
4378 |
+ |
f = new CompletableFuture<>(); |
4379 |
+ |
f.runAfterEither(incomplete, () -> {}); |
4380 |
+ |
f.complete(null); |
4381 |
+ |
|
4382 |
+ |
f = new CompletableFuture<>(); |
4383 |
+ |
f.acceptEither(incomplete, x -> {}); |
4384 |
+ |
f.complete(null); |
4385 |
+ |
|
4386 |
+ |
f = new CompletableFuture<>(); |
4387 |
+ |
f.applyToEither(incomplete, x -> x); |
4388 |
+ |
f.complete(null); |
4389 |
+ |
|
4390 |
+ |
f = new CompletableFuture<>(); |
4391 |
+ |
CompletableFuture.anyOf(new CompletableFuture<?>[] { f, incomplete }); |
4392 |
+ |
f.complete(null); |
4393 |
+ |
} |
4394 |
+ |
|
4395 |
+ |
for (int i = 0; i < n; i++) { |
4396 |
+ |
f = new CompletableFuture<>(); |
4397 |
+ |
incomplete.runAfterEither(f, () -> {}); |
4398 |
+ |
f.complete(null); |
4399 |
+ |
|
4400 |
+ |
f = new CompletableFuture<>(); |
4401 |
+ |
incomplete.acceptEither(f, x -> {}); |
4402 |
+ |
f.complete(null); |
4403 |
+ |
|
4404 |
+ |
f = new CompletableFuture<>(); |
4405 |
+ |
incomplete.applyToEither(f, x -> x); |
4406 |
+ |
f.complete(null); |
4407 |
+ |
|
4408 |
+ |
f = new CompletableFuture<>(); |
4409 |
+ |
CompletableFuture.anyOf(new CompletableFuture<?>[] { incomplete, f }); |
4410 |
+ |
f.complete(null); |
4411 |
+ |
} |
4412 |
+ |
} |
4413 |
+ |
|
4414 |
+ |
/** |
4415 |
+ |
* Reproduction recipe for: |
4416 |
+ |
* 8160402: Garbage retention with CompletableFuture.anyOf |
4417 |
+ |
* cvs update -D '2016-05-01' ./src/main/java/util/concurrent/CompletableFuture.java && ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testAnyOfGarbageRetention tck; cvs update -A |
4418 |
+ |
*/ |
4419 |
+ |
public void testAnyOfGarbageRetention() throws Throwable { |
4420 |
+ |
for (Integer v : new Integer[] { 1, null }) |
4421 |
+ |
{ |
4422 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4423 |
+ |
CompletableFuture<Integer>[] fs |
4424 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4425 |
+ |
for (int i = 0; i < fs.length; i++) |
4426 |
+ |
fs[i] = new CompletableFuture<>(); |
4427 |
+ |
fs[fs.length - 1].complete(v); |
4428 |
+ |
for (int i = 0; i < n; i++) |
4429 |
+ |
checkCompletedNormally(CompletableFuture.anyOf(fs), v); |
4430 |
+ |
}} |
4431 |
+ |
|
4432 |
+ |
/** |
4433 |
+ |
* Checks for garbage retention with allOf. |
4434 |
+ |
* |
4435 |
+ |
* As of 2016-07, fails with OOME: |
4436 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testCancelledAllOfGarbageRetention tck |
4437 |
+ |
*/ |
4438 |
+ |
public void testCancelledAllOfGarbageRetention() throws Throwable { |
4439 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4440 |
+ |
CompletableFuture<Integer>[] fs |
4441 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4442 |
+ |
for (int i = 0; i < fs.length; i++) |
4443 |
+ |
fs[i] = new CompletableFuture<>(); |
4444 |
+ |
for (int i = 0; i < n; i++) |
4445 |
+ |
assertTrue(CompletableFuture.allOf(fs).cancel(false)); |
4446 |
+ |
} |
4447 |
+ |
|
4448 |
+ |
/** |
4449 |
+ |
* Checks for garbage retention when a dependent future is |
4450 |
+ |
* cancelled and garbage-collected. |
4451 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4452 |
+ |
* |
4453 |
+ |
* As of 2016-07, fails with OOME: |
4454 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testCancelledGarbageRetention tck |
4455 |
+ |
*/ |
4456 |
+ |
public void testCancelledGarbageRetention() throws Throwable { |
4457 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4458 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4459 |
+ |
for (int i = 0; i < n; i++) |
4460 |
+ |
assertTrue(neverCompleted.thenRun(() -> {}).cancel(true)); |
4461 |
+ |
} |
4462 |
+ |
|
4463 |
+ |
/** |
4464 |
+ |
* Checks for garbage retention when MinimalStage.toCompletableFuture() |
4465 |
+ |
* is invoked many times. |
4466 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4467 |
+ |
* |
4468 |
+ |
* As of 2016-07, fails with OOME: |
4469 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testToCompletableFutureGarbageRetention tck |
4470 |
+ |
*/ |
4471 |
+ |
public void testToCompletableFutureGarbageRetention() throws Throwable { |
4472 |
+ |
final int n = expensiveTests ? 900_000 : 10; |
4473 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4474 |
+ |
CompletionStage minimal = neverCompleted.minimalCompletionStage(); |
4475 |
+ |
for (int i = 0; i < n; i++) |
4476 |
+ |
assertTrue(minimal.toCompletableFuture().cancel(true)); |
4477 |
+ |
} |
4478 |
+ |
|
4479 |
|
// static <U> U join(CompletionStage<U> stage) { |
4480 |
|
// CompletableFuture<U> f = new CompletableFuture<>(); |
4481 |
|
// stage.whenComplete((v, ex) -> { |