1040 |
|
|
1041 |
|
checkCompletedWithWrappedException(g, ex1); |
1042 |
|
checkCompletedExceptionally(f, ex1); |
1043 |
+ |
if (testImplementationDetails) { |
1044 |
+ |
assertEquals(1, ex1.getSuppressed().length); |
1045 |
+ |
assertSame(ex2, ex1.getSuppressed()[0]); |
1046 |
+ |
} |
1047 |
|
assertEquals(1, a.get()); |
1048 |
|
}} |
1049 |
|
|
3295 |
|
() -> f.obtrudeException(null), |
3296 |
|
|
3297 |
|
() -> CompletableFuture.delayedExecutor(1L, SECONDS, null), |
3298 |
< |
() -> CompletableFuture.delayedExecutor(1L, null, new ThreadExecutor()), |
3298 |
> |
() -> CompletableFuture.delayedExecutor(1L, null, exec), |
3299 |
|
() -> CompletableFuture.delayedExecutor(1L, null), |
3300 |
|
|
3301 |
|
() -> f.orTimeout(1L, null), |
3525 |
|
long timeoutMillis = timeoutMillis(); |
3526 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3527 |
|
long startTime = System.nanoTime(); |
3528 |
< |
f.orTimeout(timeoutMillis, MILLISECONDS); |
3528 |
> |
assertSame(f, f.orTimeout(timeoutMillis, MILLISECONDS)); |
3529 |
|
checkCompletedWithTimeoutException(f); |
3530 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
3531 |
|
} |
3540 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3541 |
|
long startTime = System.nanoTime(); |
3542 |
|
f.complete(v1); |
3543 |
< |
f.orTimeout(LONG_DELAY_MS, MILLISECONDS); |
3544 |
< |
g.orTimeout(LONG_DELAY_MS, MILLISECONDS); |
3543 |
> |
assertSame(f, f.orTimeout(LONG_DELAY_MS, MILLISECONDS)); |
3544 |
> |
assertSame(g, g.orTimeout(LONG_DELAY_MS, MILLISECONDS)); |
3545 |
|
g.complete(v1); |
3546 |
|
checkCompletedNormally(f, v1); |
3547 |
|
checkCompletedNormally(g, v1); |
3556 |
|
() -> testCompleteOnTimeout_timesOut(null)); |
3557 |
|
} |
3558 |
|
|
3559 |
+ |
/** |
3560 |
+ |
* completeOnTimeout completes with given value if not complete |
3561 |
+ |
*/ |
3562 |
|
public void testCompleteOnTimeout_timesOut(Integer v) { |
3563 |
|
long timeoutMillis = timeoutMillis(); |
3564 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3565 |
|
long startTime = System.nanoTime(); |
3566 |
< |
f.completeOnTimeout(v, timeoutMillis, MILLISECONDS); |
3566 |
> |
assertSame(f, f.completeOnTimeout(v, timeoutMillis, MILLISECONDS)); |
3567 |
|
assertSame(v, f.join()); |
3568 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
3569 |
|
f.complete(99); // should have no effect |
3580 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3581 |
|
long startTime = System.nanoTime(); |
3582 |
|
f.complete(v1); |
3583 |
< |
f.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS); |
3584 |
< |
g.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS); |
3583 |
> |
assertSame(f, f.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS)); |
3584 |
> |
assertSame(g, g.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS)); |
3585 |
|
g.complete(v1); |
3586 |
|
checkCompletedNormally(f, v1); |
3587 |
|
checkCompletedNormally(g, v1); |
3833 |
|
AtomicReference<Throwable> firstFailure = new AtomicReference<>(null); |
3834 |
|
} |
3835 |
|
|
3836 |
< |
// Monadic "plus" |
3836 |
> |
/** Implements "monadic plus". */ |
3837 |
|
static <T> CompletableFuture<T> plus(CompletableFuture<? extends T> f, |
3838 |
|
CompletableFuture<? extends T> g) { |
3839 |
|
PlusFuture<T> plus = new PlusFuture<T>(); |
3840 |
|
BiConsumer<T, Throwable> action = (T result, Throwable ex) -> { |
3841 |
< |
if (ex == null) { |
3842 |
< |
if (plus.complete(result)) |
3843 |
< |
if (plus.firstFailure.get() != null) |
3841 |
> |
try { |
3842 |
> |
if (ex == null) { |
3843 |
> |
if (plus.complete(result)) |
3844 |
> |
if (plus.firstFailure.get() != null) |
3845 |
> |
plus.firstFailure.set(null); |
3846 |
> |
} |
3847 |
> |
else if (plus.firstFailure.compareAndSet(null, ex)) { |
3848 |
> |
if (plus.isDone()) |
3849 |
|
plus.firstFailure.set(null); |
3850 |
< |
} |
3851 |
< |
else if (plus.firstFailure.compareAndSet(null, ex)) { |
3852 |
< |
if (plus.isDone()) |
3853 |
< |
plus.firstFailure.set(null); |
3854 |
< |
} |
3855 |
< |
else { |
3856 |
< |
// first failure has precedence |
3857 |
< |
Throwable first = plus.firstFailure.getAndSet(null); |
3858 |
< |
|
3859 |
< |
// may fail with "Self-suppression not permitted" |
3860 |
< |
try { first.addSuppressed(ex); } |
3861 |
< |
catch (Exception ignored) {} |
3862 |
< |
|
3851 |
< |
plus.completeExceptionally(first); |
3850 |
> |
} |
3851 |
> |
else { |
3852 |
> |
// first failure has precedence |
3853 |
> |
Throwable first = plus.firstFailure.getAndSet(null); |
3854 |
> |
|
3855 |
> |
// may fail with "Self-suppression not permitted" |
3856 |
> |
try { first.addSuppressed(ex); } |
3857 |
> |
catch (Exception ignored) {} |
3858 |
> |
|
3859 |
> |
plus.completeExceptionally(first); |
3860 |
> |
} |
3861 |
> |
} catch (Throwable unexpected) { |
3862 |
> |
plus.completeExceptionally(unexpected); |
3863 |
|
} |
3864 |
|
}; |
3865 |
|
f.whenComplete(action); |
3928 |
|
Monad.plus(godot, Monad.unit(5L))); |
3929 |
|
} |
3930 |
|
|
3931 |
+ |
/** |
3932 |
+ |
* A single CompletableFuture with many dependents. |
3933 |
+ |
* A demo of scalability - runtime is O(n). |
3934 |
+ |
*/ |
3935 |
+ |
public void testManyDependents() throws Throwable { |
3936 |
+ |
final int n = 1_000; |
3937 |
+ |
final CompletableFuture<Void> head = new CompletableFuture<>(); |
3938 |
+ |
final CompletableFuture<Void> complete = CompletableFuture.completedFuture((Void)null); |
3939 |
+ |
final AtomicInteger count = new AtomicInteger(0); |
3940 |
+ |
for (int i = 0; i < n; i++) { |
3941 |
+ |
head.thenRun(() -> count.getAndIncrement()); |
3942 |
+ |
head.thenAccept((x) -> count.getAndIncrement()); |
3943 |
+ |
head.thenApply((x) -> count.getAndIncrement()); |
3944 |
+ |
|
3945 |
+ |
head.runAfterBoth(complete, () -> count.getAndIncrement()); |
3946 |
+ |
head.thenAcceptBoth(complete, (x, y) -> count.getAndIncrement()); |
3947 |
+ |
head.thenCombine(complete, (x, y) -> count.getAndIncrement()); |
3948 |
+ |
complete.runAfterBoth(head, () -> count.getAndIncrement()); |
3949 |
+ |
complete.thenAcceptBoth(head, (x, y) -> count.getAndIncrement()); |
3950 |
+ |
complete.thenCombine(head, (x, y) -> count.getAndIncrement()); |
3951 |
+ |
|
3952 |
+ |
head.runAfterEither(new CompletableFuture<Void>(), () -> count.getAndIncrement()); |
3953 |
+ |
head.acceptEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
3954 |
+ |
head.applyToEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
3955 |
+ |
new CompletableFuture<Void>().runAfterEither(head, () -> count.getAndIncrement()); |
3956 |
+ |
new CompletableFuture<Void>().acceptEither(head, (x) -> count.getAndIncrement()); |
3957 |
+ |
new CompletableFuture<Void>().applyToEither(head, (x) -> count.getAndIncrement()); |
3958 |
+ |
} |
3959 |
+ |
head.complete(null); |
3960 |
+ |
assertEquals(5 * 3 * n, count.get()); |
3961 |
+ |
} |
3962 |
+ |
|
3963 |
|
// static <U> U join(CompletionStage<U> stage) { |
3964 |
|
// CompletableFuture<U> f = new CompletableFuture<>(); |
3965 |
|
// stage.whenComplete((v, ex) -> { |