64 |
|
assertNull(f.getNow(null)); |
65 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
66 |
|
try { |
67 |
< |
f.get(0L, SECONDS); |
67 |
> |
f.get(randomExpiredTimeout(), randomTimeUnit()); |
68 |
|
shouldThrow(); |
69 |
|
} |
70 |
|
catch (TimeoutException success) {} |
76 |
|
|
77 |
|
try { |
78 |
|
assertEquals(value, f.join()); |
79 |
– |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
80 |
– |
try { |
79 |
|
assertEquals(value, f.getNow(null)); |
82 |
– |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
83 |
– |
try { |
80 |
|
assertEquals(value, f.get()); |
81 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
82 |
|
assertTrue(f.isDone()); |
89 |
|
* Returns the "raw" internal exceptional completion of f, |
90 |
|
* without any additional wrapping with CompletionException. |
91 |
|
*/ |
92 |
< |
<U> Throwable exceptionalCompletion(CompletableFuture<U> f) { |
93 |
< |
// handle (and whenComplete) can distinguish between "direct" |
94 |
< |
// and "wrapped" exceptional completion |
95 |
< |
return f.handle((U u, Throwable t) -> t).join(); |
92 |
> |
Throwable exceptionalCompletion(CompletableFuture<?> f) { |
93 |
> |
// handle (and whenComplete and exceptionally) can distinguish |
94 |
> |
// between "direct" and "wrapped" exceptional completion |
95 |
> |
return f.handle((u, t) -> t).join(); |
96 |
|
} |
97 |
|
|
98 |
|
void checkCompletedExceptionally(CompletableFuture<?> f, |
143 |
|
|
144 |
|
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
145 |
|
checkCompletedExceptionally(f, true, |
146 |
< |
(t) -> assertTrue(t instanceof CFException)); |
146 |
> |
t -> assertTrue(t instanceof CFException)); |
147 |
|
} |
148 |
|
|
149 |
|
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
150 |
|
checkCompletedExceptionally(f, true, |
151 |
< |
(t) -> assertTrue(t instanceof CancellationException)); |
151 |
> |
t -> assertTrue(t instanceof CancellationException)); |
152 |
|
} |
153 |
|
|
154 |
|
void checkCompletedWithTimeoutException(CompletableFuture<?> f) { |
155 |
|
checkCompletedExceptionally(f, false, |
156 |
< |
(t) -> assertTrue(t instanceof TimeoutException)); |
156 |
> |
t -> assertTrue(t instanceof TimeoutException)); |
157 |
|
} |
158 |
|
|
159 |
|
void checkCompletedWithWrappedException(CompletableFuture<?> f, |
160 |
|
Throwable ex) { |
161 |
< |
checkCompletedExceptionally(f, true, (t) -> assertSame(t, ex)); |
161 |
> |
checkCompletedExceptionally(f, true, t -> assertSame(t, ex)); |
162 |
|
} |
163 |
|
|
164 |
|
void checkCompletedExceptionally(CompletableFuture<?> f, Throwable ex) { |
165 |
< |
checkCompletedExceptionally(f, false, (t) -> assertSame(t, ex)); |
165 |
> |
checkCompletedExceptionally(f, false, t -> assertSame(t, ex)); |
166 |
|
} |
167 |
|
|
168 |
|
void checkCancelled(CompletableFuture<?> f) { |
1238 |
|
r.assertInvoked(); |
1239 |
|
}} |
1240 |
|
|
1241 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1242 |
|
public void testRunAsync_rejectingExecutor() { |
1243 |
|
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1244 |
|
try { |
1285 |
|
r.assertInvoked(); |
1286 |
|
}} |
1287 |
|
|
1288 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1289 |
|
public void testSupplyAsync_rejectingExecutor() { |
1290 |
|
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1291 |
|
try { |
2560 |
|
|
2561 |
|
// unspecified behavior - both source completions available |
2562 |
|
try { |
2563 |
< |
assertEquals(null, h0.join()); |
2563 |
> |
assertNull(h0.join()); |
2564 |
|
rs[0].assertValue(v1); |
2565 |
|
} catch (CompletionException ok) { |
2566 |
|
checkCompletedWithWrappedException(h0, ex); |
2567 |
|
rs[0].assertNotInvoked(); |
2568 |
|
} |
2569 |
|
try { |
2570 |
< |
assertEquals(null, h1.join()); |
2570 |
> |
assertNull(h1.join()); |
2571 |
|
rs[1].assertValue(v1); |
2572 |
|
} catch (CompletionException ok) { |
2573 |
|
checkCompletedWithWrappedException(h1, ex); |
2574 |
|
rs[1].assertNotInvoked(); |
2575 |
|
} |
2576 |
|
try { |
2577 |
< |
assertEquals(null, h2.join()); |
2577 |
> |
assertNull(h2.join()); |
2578 |
|
rs[2].assertValue(v1); |
2579 |
|
} catch (CompletionException ok) { |
2580 |
|
checkCompletedWithWrappedException(h2, ex); |
2581 |
|
rs[2].assertNotInvoked(); |
2582 |
|
} |
2583 |
|
try { |
2584 |
< |
assertEquals(null, h3.join()); |
2584 |
> |
assertNull(h3.join()); |
2585 |
|
rs[3].assertValue(v1); |
2586 |
|
} catch (CompletionException ok) { |
2587 |
|
checkCompletedWithWrappedException(h3, ex); |
2820 |
|
|
2821 |
|
// unspecified behavior - both source completions available |
2822 |
|
try { |
2823 |
< |
assertEquals(null, h0.join()); |
2823 |
> |
assertNull(h0.join()); |
2824 |
|
rs[0].assertInvoked(); |
2825 |
|
} catch (CompletionException ok) { |
2826 |
|
checkCompletedWithWrappedException(h0, ex); |
2827 |
|
rs[0].assertNotInvoked(); |
2828 |
|
} |
2829 |
|
try { |
2830 |
< |
assertEquals(null, h1.join()); |
2830 |
> |
assertNull(h1.join()); |
2831 |
|
rs[1].assertInvoked(); |
2832 |
|
} catch (CompletionException ok) { |
2833 |
|
checkCompletedWithWrappedException(h1, ex); |
2834 |
|
rs[1].assertNotInvoked(); |
2835 |
|
} |
2836 |
|
try { |
2837 |
< |
assertEquals(null, h2.join()); |
2837 |
> |
assertNull(h2.join()); |
2838 |
|
rs[2].assertInvoked(); |
2839 |
|
} catch (CompletionException ok) { |
2840 |
|
checkCompletedWithWrappedException(h2, ex); |
2841 |
|
rs[2].assertNotInvoked(); |
2842 |
|
} |
2843 |
|
try { |
2844 |
< |
assertEquals(null, h3.join()); |
2844 |
> |
assertNull(h3.join()); |
2845 |
|
rs[3].assertInvoked(); |
2846 |
|
} catch (CompletionException ok) { |
2847 |
|
checkCompletedWithWrappedException(h3, ex); |
3236 |
|
/** |
3237 |
|
* Completion methods throw NullPointerException with null arguments |
3238 |
|
*/ |
3239 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
3240 |
|
public void testNPE() { |
3241 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3242 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3256 |
|
|
3257 |
|
() -> f.thenApply(null), |
3258 |
|
() -> f.thenApplyAsync(null), |
3259 |
< |
() -> f.thenApplyAsync((x) -> x, null), |
3259 |
> |
() -> f.thenApplyAsync(x -> x, null), |
3260 |
|
() -> f.thenApplyAsync(null, exec), |
3261 |
|
|
3262 |
|
() -> f.thenAccept(null), |
3263 |
|
() -> f.thenAcceptAsync(null), |
3264 |
< |
() -> f.thenAcceptAsync((x) -> {} , null), |
3264 |
> |
() -> f.thenAcceptAsync(x -> {} , null), |
3265 |
|
() -> f.thenAcceptAsync(null, exec), |
3266 |
|
|
3267 |
|
() -> f.thenRun(null), |
3296 |
|
() -> f.applyToEither(g, null), |
3297 |
|
() -> f.applyToEitherAsync(g, null), |
3298 |
|
() -> f.applyToEitherAsync(g, null, exec), |
3299 |
< |
() -> f.applyToEither(nullFuture, (x) -> x), |
3300 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x), |
3301 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x, exec), |
3302 |
< |
() -> f.applyToEitherAsync(g, (x) -> x, null), |
3299 |
> |
() -> f.applyToEither(nullFuture, x -> x), |
3300 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x), |
3301 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x, exec), |
3302 |
> |
() -> f.applyToEitherAsync(g, x -> x, null), |
3303 |
|
|
3304 |
|
() -> f.acceptEither(g, null), |
3305 |
|
() -> f.acceptEitherAsync(g, null), |
3306 |
|
() -> f.acceptEitherAsync(g, null, exec), |
3307 |
< |
() -> f.acceptEither(nullFuture, (x) -> {}), |
3308 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}), |
3309 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}, exec), |
3310 |
< |
() -> f.acceptEitherAsync(g, (x) -> {}, null), |
3307 |
> |
() -> f.acceptEither(nullFuture, x -> {}), |
3308 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}), |
3309 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}, exec), |
3310 |
> |
() -> f.acceptEitherAsync(g, x -> {}, null), |
3311 |
|
|
3312 |
|
() -> f.runAfterEither(g, null), |
3313 |
|
() -> f.runAfterEitherAsync(g, null), |
3373 |
|
for (CompletableFuture<Integer> src : srcs) { |
3374 |
|
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3375 |
|
fs.add(src.thenRunAsync(() -> {}, e)); |
3376 |
< |
fs.add(src.thenAcceptAsync((z) -> {}, e)); |
3377 |
< |
fs.add(src.thenApplyAsync((z) -> z, e)); |
3376 |
> |
fs.add(src.thenAcceptAsync(z -> {}, e)); |
3377 |
> |
fs.add(src.thenApplyAsync(z -> z, e)); |
3378 |
|
|
3379 |
|
fs.add(src.thenCombineAsync(src, (x, y) -> x, e)); |
3380 |
|
fs.add(src.thenAcceptBothAsync(src, (x, y) -> {}, e)); |
3381 |
|
fs.add(src.runAfterBothAsync(src, () -> {}, e)); |
3382 |
|
|
3383 |
< |
fs.add(src.applyToEitherAsync(src, (z) -> z, e)); |
3384 |
< |
fs.add(src.acceptEitherAsync(src, (z) -> {}, e)); |
3383 |
> |
fs.add(src.applyToEitherAsync(src, z -> z, e)); |
3384 |
> |
fs.add(src.acceptEitherAsync(src, z -> {}, e)); |
3385 |
|
fs.add(src.runAfterEitherAsync(src, () -> {}, e)); |
3386 |
|
|
3387 |
< |
fs.add(src.thenComposeAsync((z) -> null, e)); |
3387 |
> |
fs.add(src.thenComposeAsync(z -> null, e)); |
3388 |
|
fs.add(src.whenCompleteAsync((z, t) -> {}, e)); |
3389 |
|
fs.add(src.handleAsync((z, t) -> null, e)); |
3390 |
|
|
3417 |
|
{ |
3418 |
|
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3419 |
|
|
3420 |
< |
fs.add(complete.applyToEitherAsync(incomplete, (z) -> z, e)); |
3421 |
< |
fs.add(incomplete.applyToEitherAsync(complete, (z) -> z, e)); |
3420 |
> |
fs.add(complete.applyToEitherAsync(incomplete, z -> z, e)); |
3421 |
> |
fs.add(incomplete.applyToEitherAsync(complete, z -> z, e)); |
3422 |
|
|
3423 |
< |
fs.add(complete.acceptEitherAsync(incomplete, (z) -> {}, e)); |
3424 |
< |
fs.add(incomplete.acceptEitherAsync(complete, (z) -> {}, e)); |
3423 |
> |
fs.add(complete.acceptEitherAsync(incomplete, z -> {}, e)); |
3424 |
> |
fs.add(incomplete.acceptEitherAsync(complete, z -> {}, e)); |
3425 |
|
|
3426 |
|
fs.add(complete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3427 |
|
fs.add(incomplete.runAfterEitherAsync(complete, () -> {}, e)); |
3460 |
|
|
3461 |
|
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3462 |
|
fs.add(incomplete.thenRunAsync(() -> {}, e)); |
3463 |
< |
fs.add(incomplete.thenAcceptAsync((z) -> {}, e)); |
3464 |
< |
fs.add(incomplete.thenApplyAsync((z) -> z, e)); |
3463 |
> |
fs.add(incomplete.thenAcceptAsync(z -> {}, e)); |
3464 |
> |
fs.add(incomplete.thenApplyAsync(z -> z, e)); |
3465 |
|
|
3466 |
|
fs.add(incomplete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3467 |
|
fs.add(incomplete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3468 |
|
fs.add(incomplete.runAfterBothAsync(incomplete, () -> {}, e)); |
3469 |
|
|
3470 |
< |
fs.add(incomplete.applyToEitherAsync(incomplete, (z) -> z, e)); |
3471 |
< |
fs.add(incomplete.acceptEitherAsync(incomplete, (z) -> {}, e)); |
3470 |
> |
fs.add(incomplete.applyToEitherAsync(incomplete, z -> z, e)); |
3471 |
> |
fs.add(incomplete.acceptEitherAsync(incomplete, z -> {}, e)); |
3472 |
|
fs.add(incomplete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3473 |
|
|
3474 |
< |
fs.add(incomplete.thenComposeAsync((z) -> null, e)); |
3474 |
> |
fs.add(incomplete.thenComposeAsync(z -> null, e)); |
3475 |
|
fs.add(incomplete.whenCompleteAsync((z, t) -> {}, e)); |
3476 |
|
fs.add(incomplete.handleAsync((z, t) -> null, e)); |
3477 |
|
|
3531 |
|
*/ |
3532 |
|
public void testCompletedStage() { |
3533 |
|
AtomicInteger x = new AtomicInteger(0); |
3534 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3534 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3535 |
|
CompletionStage<Integer> f = CompletableFuture.completedStage(1); |
3536 |
|
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3537 |
|
assertEquals(x.get(), 1); |
3633 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3634 |
|
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3635 |
|
AtomicInteger x = new AtomicInteger(0); |
3636 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3636 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3637 |
|
checkIncomplete(f); |
3638 |
|
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3639 |
|
f.complete(1); |
3650 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3651 |
|
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3652 |
|
AtomicInteger x = new AtomicInteger(0); |
3653 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3653 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3654 |
|
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3655 |
|
checkIncomplete(f); |
3656 |
|
CFException ex = new CFException(); |
3668 |
|
CFException ex = new CFException(); |
3669 |
|
CompletionStage<Integer> f = CompletableFuture.failedStage(ex); |
3670 |
|
AtomicInteger x = new AtomicInteger(0); |
3671 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3671 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3672 |
|
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3673 |
|
assertEquals(x.get(), 0); |
3674 |
|
assertEquals(r.get(), ex); |
3692 |
|
public void testCompleteAsync2() { |
3693 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3694 |
|
CFException ex = new CFException(); |
3695 |
< |
f.completeAsync(() -> {if (true) throw ex; return 1;}); |
3695 |
> |
f.completeAsync(() -> { throw ex; }); |
3696 |
|
try { |
3697 |
|
f.join(); |
3698 |
|
shouldThrow(); |
3722 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3723 |
|
CFException ex = new CFException(); |
3724 |
|
ThreadExecutor executor = new ThreadExecutor(); |
3725 |
< |
f.completeAsync(() -> {if (true) throw ex; return 1;}, executor); |
3725 |
> |
f.completeAsync(() -> { throw ex; }, executor); |
3726 |
|
try { |
3727 |
|
f.join(); |
3728 |
|
shouldThrow(); |
3881 |
|
List<Function<CompletableFuture<Integer>, CompletableFuture<?>>> funs |
3882 |
|
= new ArrayList<>(); |
3883 |
|
|
3884 |
< |
funs.add((y) -> m.thenRun(y, noopRunnable)); |
3885 |
< |
funs.add((y) -> m.thenAccept(y, noopConsumer)); |
3886 |
< |
funs.add((y) -> m.thenApply(y, incFunction)); |
3887 |
< |
|
3888 |
< |
funs.add((y) -> m.runAfterEither(y, incomplete, noopRunnable)); |
3889 |
< |
funs.add((y) -> m.acceptEither(y, incomplete, noopConsumer)); |
3890 |
< |
funs.add((y) -> m.applyToEither(y, incomplete, incFunction)); |
3891 |
< |
|
3892 |
< |
funs.add((y) -> m.runAfterBoth(y, v42, noopRunnable)); |
3893 |
< |
funs.add((y) -> m.runAfterBoth(v42, y, noopRunnable)); |
3894 |
< |
funs.add((y) -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
3895 |
< |
funs.add((y) -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
3896 |
< |
funs.add((y) -> m.thenCombine(y, v42, new SubtractFunction(m))); |
3897 |
< |
funs.add((y) -> m.thenCombine(v42, y, new SubtractFunction(m))); |
3898 |
< |
|
3899 |
< |
funs.add((y) -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
3900 |
< |
|
3901 |
< |
funs.add((y) -> m.thenCompose(y, new CompletableFutureInc(m))); |
3902 |
< |
|
3903 |
< |
funs.add((y) -> CompletableFuture.allOf(y)); |
3904 |
< |
funs.add((y) -> CompletableFuture.allOf(y, v42)); |
3905 |
< |
funs.add((y) -> CompletableFuture.allOf(v42, y)); |
3906 |
< |
funs.add((y) -> CompletableFuture.anyOf(y)); |
3907 |
< |
funs.add((y) -> CompletableFuture.anyOf(y, incomplete)); |
3908 |
< |
funs.add((y) -> CompletableFuture.anyOf(incomplete, y)); |
3884 |
> |
funs.add(y -> m.thenRun(y, noopRunnable)); |
3885 |
> |
funs.add(y -> m.thenAccept(y, noopConsumer)); |
3886 |
> |
funs.add(y -> m.thenApply(y, incFunction)); |
3887 |
> |
|
3888 |
> |
funs.add(y -> m.runAfterEither(y, incomplete, noopRunnable)); |
3889 |
> |
funs.add(y -> m.acceptEither(y, incomplete, noopConsumer)); |
3890 |
> |
funs.add(y -> m.applyToEither(y, incomplete, incFunction)); |
3891 |
> |
|
3892 |
> |
funs.add(y -> m.runAfterBoth(y, v42, noopRunnable)); |
3893 |
> |
funs.add(y -> m.runAfterBoth(v42, y, noopRunnable)); |
3894 |
> |
funs.add(y -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
3895 |
> |
funs.add(y -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
3896 |
> |
funs.add(y -> m.thenCombine(y, v42, new SubtractFunction(m))); |
3897 |
> |
funs.add(y -> m.thenCombine(v42, y, new SubtractFunction(m))); |
3898 |
> |
|
3899 |
> |
funs.add(y -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
3900 |
> |
|
3901 |
> |
funs.add(y -> m.thenCompose(y, new CompletableFutureInc(m))); |
3902 |
> |
|
3903 |
> |
funs.add(y -> CompletableFuture.allOf(y)); |
3904 |
> |
funs.add(y -> CompletableFuture.allOf(y, v42)); |
3905 |
> |
funs.add(y -> CompletableFuture.allOf(v42, y)); |
3906 |
> |
funs.add(y -> CompletableFuture.anyOf(y)); |
3907 |
> |
funs.add(y -> CompletableFuture.anyOf(y, incomplete)); |
3908 |
> |
funs.add(y -> CompletableFuture.anyOf(incomplete, y)); |
3909 |
|
|
3910 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3911 |
|
fun : funs) { |
3962 |
|
public void testMinimalCompletionStage_minimality() { |
3963 |
|
if (!testImplementationDetails) return; |
3964 |
|
Function<Method, String> toSignature = |
3965 |
< |
(method) -> method.getName() + Arrays.toString(method.getParameterTypes()); |
3965 |
> |
method -> method.getName() + Arrays.toString(method.getParameterTypes()); |
3966 |
|
Predicate<Method> isNotStatic = |
3967 |
< |
(method) -> (method.getModifiers() & Modifier.STATIC) == 0; |
3967 |
> |
method -> (method.getModifiers() & Modifier.STATIC) == 0; |
3968 |
|
List<Method> minimalMethods = |
3969 |
|
Stream.of(Object.class, CompletionStage.class) |
3970 |
< |
.flatMap((klazz) -> Stream.of(klazz.getMethods())) |
3970 |
> |
.flatMap(klazz -> Stream.of(klazz.getMethods())) |
3971 |
|
.filter(isNotStatic) |
3972 |
|
.collect(Collectors.toList()); |
3973 |
|
// Methods from CompletableFuture permitted NOT to throw UOE |
3983 |
|
.collect(Collectors.toSet()); |
3984 |
|
List<Method> allMethods = Stream.of(CompletableFuture.class.getMethods()) |
3985 |
|
.filter(isNotStatic) |
3986 |
< |
.filter((method) -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
3986 |
> |
.filter(method -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
3987 |
|
.collect(Collectors.toList()); |
3988 |
|
|
3989 |
|
List<CompletionStage<Integer>> stages = new ArrayList<>(); |
4077 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4078 |
|
CompletionStage minimal = f.minimalCompletionStage(); |
4079 |
|
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4080 |
< |
g.complete(v1); |
4080 |
> |
assertTrue(g.complete(v1)); |
4081 |
|
checkCompletedNormally(g, v1); |
4082 |
|
checkIncomplete(f); |
4083 |
|
checkIncomplete(minimal.toCompletableFuture()); |
4143 |
|
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4144 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
4145 |
|
if (!createIncomplete) assertTrue(f.complete(v1)); |
4146 |
< |
minimal.thenAccept((x) -> g.complete(x)); |
4146 |
> |
minimal.thenAccept(x -> g.complete(x)); |
4147 |
|
if (createIncomplete) assertTrue(f.complete(v1)); |
4148 |
|
g.join(); |
4149 |
|
checkCompletedNormally(g, v1); |
4167 |
|
static <T,U,V> Function<T, CompletableFuture<V>> compose |
4168 |
|
(Function<T, CompletableFuture<U>> f, |
4169 |
|
Function<U, CompletableFuture<V>> g) { |
4170 |
< |
return (x) -> f.apply(x).thenCompose(g); |
4170 |
> |
return x -> f.apply(x).thenCompose(g); |
4171 |
|
} |
4172 |
|
|
4173 |
|
static void assertZero(CompletableFuture<?> f) { |
4247 |
|
|
4248 |
|
// Some mutually non-commutative functions |
4249 |
|
Function<Long, CompletableFuture<Long>> triple |
4250 |
< |
= (x) -> Monad.unit(3 * x); |
4250 |
> |
= x -> Monad.unit(3 * x); |
4251 |
|
Function<Long, CompletableFuture<Long>> inc |
4252 |
< |
= (x) -> Monad.unit(x + 1); |
4252 |
> |
= x -> Monad.unit(x + 1); |
4253 |
|
|
4254 |
|
// unit is a right identity: m >>= unit === m |
4255 |
|
Monad.assertFutureEquals(inc.apply(5L).thenCompose(unit), |
4261 |
|
// associativity: (m >>= f) >>= g === m >>= ( \x -> (f x >>= g) ) |
4262 |
|
Monad.assertFutureEquals( |
4263 |
|
unit.apply(5L).thenCompose(inc).thenCompose(triple), |
4264 |
< |
unit.apply(5L).thenCompose((x) -> inc.apply(x).thenCompose(triple))); |
4264 |
> |
unit.apply(5L).thenCompose(x -> inc.apply(x).thenCompose(triple))); |
4265 |
|
|
4266 |
|
// The case for CompletableFuture as an additive monad is weaker... |
4267 |
|
|
4271 |
|
// left zero: zero >>= f === zero |
4272 |
|
Monad.assertZero(zero.thenCompose(inc)); |
4273 |
|
// right zero: f >>= (\x -> zero) === zero |
4274 |
< |
Monad.assertZero(inc.apply(5L).thenCompose((x) -> zero)); |
4274 |
> |
Monad.assertZero(inc.apply(5L).thenCompose(x -> zero)); |
4275 |
|
|
4276 |
|
// f plus zero === f |
4277 |
|
Monad.assertFutureEquals(Monad.unit(5L), |
4298 |
|
} |
4299 |
|
|
4300 |
|
/** Test long recursive chains of CompletableFutures with cascading completions */ |
4301 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4302 |
|
public void testRecursiveChains() throws Throwable { |
4303 |
|
for (ExecutionMode m : ExecutionMode.values()) |
4304 |
|
for (boolean addDeadEnds : new boolean[] { true, false }) |
4323 |
|
* A single CompletableFuture with many dependents. |
4324 |
|
* A demo of scalability - runtime is O(n). |
4325 |
|
*/ |
4326 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4327 |
|
public void testManyDependents() throws Throwable { |
4328 |
|
final int n = expensiveTests ? 1_000_000 : 10; |
4329 |
|
final CompletableFuture<Void> head = new CompletableFuture<>(); |
4331 |
|
final AtomicInteger count = new AtomicInteger(0); |
4332 |
|
for (int i = 0; i < n; i++) { |
4333 |
|
head.thenRun(() -> count.getAndIncrement()); |
4334 |
< |
head.thenAccept((x) -> count.getAndIncrement()); |
4335 |
< |
head.thenApply((x) -> count.getAndIncrement()); |
4334 |
> |
head.thenAccept(x -> count.getAndIncrement()); |
4335 |
> |
head.thenApply(x -> count.getAndIncrement()); |
4336 |
|
|
4337 |
|
head.runAfterBoth(complete, () -> count.getAndIncrement()); |
4338 |
|
head.thenAcceptBoth(complete, (x, y) -> count.getAndIncrement()); |
4342 |
|
complete.thenCombine(head, (x, y) -> count.getAndIncrement()); |
4343 |
|
|
4344 |
|
head.runAfterEither(new CompletableFuture<Void>(), () -> count.getAndIncrement()); |
4345 |
< |
head.acceptEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
4346 |
< |
head.applyToEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
4345 |
> |
head.acceptEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4346 |
> |
head.applyToEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4347 |
|
new CompletableFuture<Void>().runAfterEither(head, () -> count.getAndIncrement()); |
4348 |
< |
new CompletableFuture<Void>().acceptEither(head, (x) -> count.getAndIncrement()); |
4349 |
< |
new CompletableFuture<Void>().applyToEither(head, (x) -> count.getAndIncrement()); |
4348 |
> |
new CompletableFuture<Void>().acceptEither(head, x -> count.getAndIncrement()); |
4349 |
> |
new CompletableFuture<Void>().applyToEither(head, x -> count.getAndIncrement()); |
4350 |
|
} |
4351 |
|
head.complete(null); |
4352 |
|
assertEquals(5 * 3 * n, count.get()); |
4353 |
|
} |
4354 |
|
|
4355 |
|
/** ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck */ |
4356 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4357 |
|
public void testCoCompletionGarbageRetention() throws Throwable { |
4358 |
|
final int n = expensiveTests ? 1_000_000 : 10; |
4359 |
|
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4364 |
|
f.complete(null); |
4365 |
|
|
4366 |
|
f = new CompletableFuture<>(); |
4367 |
< |
f.acceptEither(incomplete, (x) -> {}); |
4367 |
> |
f.acceptEither(incomplete, x -> {}); |
4368 |
|
f.complete(null); |
4369 |
|
|
4370 |
|
f = new CompletableFuture<>(); |
4371 |
< |
f.applyToEither(incomplete, (x) -> x); |
4371 |
> |
f.applyToEither(incomplete, x -> x); |
4372 |
|
f.complete(null); |
4373 |
|
|
4374 |
|
f = new CompletableFuture<>(); |
4382 |
|
f.complete(null); |
4383 |
|
|
4384 |
|
f = new CompletableFuture<>(); |
4385 |
< |
incomplete.acceptEither(f, (x) -> {}); |
4385 |
> |
incomplete.acceptEither(f, x -> {}); |
4386 |
|
f.complete(null); |
4387 |
|
|
4388 |
|
f = new CompletableFuture<>(); |
4389 |
< |
incomplete.applyToEither(f, (x) -> x); |
4389 |
> |
incomplete.applyToEither(f, x -> x); |
4390 |
|
f.complete(null); |
4391 |
|
|
4392 |
|
f = new CompletableFuture<>(); |
4444 |
|
assertTrue(neverCompleted.thenRun(() -> {}).cancel(true)); |
4445 |
|
} |
4446 |
|
|
4447 |
+ |
/** |
4448 |
+ |
* Checks for garbage retention when MinimalStage.toCompletableFuture() |
4449 |
+ |
* is invoked many times. |
4450 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4451 |
+ |
* |
4452 |
+ |
* As of 2016-07, fails with OOME: |
4453 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testToCompletableFutureGarbageRetention tck |
4454 |
+ |
*/ |
4455 |
+ |
public void testToCompletableFutureGarbageRetention() throws Throwable { |
4456 |
+ |
final int n = expensiveTests ? 900_000 : 10; |
4457 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4458 |
+ |
CompletionStage minimal = neverCompleted.minimalCompletionStage(); |
4459 |
+ |
for (int i = 0; i < n; i++) |
4460 |
+ |
assertTrue(minimal.toCompletableFuture().cancel(true)); |
4461 |
+ |
} |
4462 |
+ |
|
4463 |
|
// static <U> U join(CompletionStage<U> stage) { |
4464 |
|
// CompletableFuture<U> f = new CompletableFuture<>(); |
4465 |
|
// stage.whenComplete((v, ex) -> { |