30 |
|
import java.util.concurrent.Executor; |
31 |
|
import java.util.concurrent.ForkJoinPool; |
32 |
|
import java.util.concurrent.ForkJoinTask; |
33 |
+ |
import java.util.concurrent.RejectedExecutionException; |
34 |
|
import java.util.concurrent.TimeoutException; |
34 |
– |
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 |
|
|
44 |
– |
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 |
> |
|
63 |
> |
Object result = null; |
64 |
|
try { |
65 |
< |
assertNull(f.getNow(null)); |
65 |
> |
result = f.getNow(null); |
66 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
67 |
+ |
assertNull(result); |
68 |
+ |
|
69 |
|
try { |
70 |
< |
f.get(0L, SECONDS); |
70 |
> |
f.get(randomExpiredTimeout(), randomTimeUnit()); |
71 |
|
shouldThrow(); |
72 |
|
} |
73 |
|
catch (TimeoutException success) {} |
74 |
|
catch (Throwable fail) { threadUnexpectedException(fail); } |
75 |
|
} |
76 |
|
|
77 |
< |
<T> void checkCompletedNormally(CompletableFuture<T> f, T value) { |
78 |
< |
checkTimedGet(f, value); |
77 |
> |
<T> void checkCompletedNormally(CompletableFuture<T> f, T expectedValue) { |
78 |
> |
checkTimedGet(f, expectedValue); |
79 |
|
|
80 |
+ |
assertEquals(expectedValue, f.join()); |
81 |
+ |
assertEquals(expectedValue, f.getNow(null)); |
82 |
+ |
|
83 |
+ |
T result = null; |
84 |
|
try { |
85 |
< |
assertEquals(value, f.join()); |
79 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
80 |
< |
try { |
81 |
< |
assertEquals(value, f.getNow(null)); |
82 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
83 |
< |
try { |
84 |
< |
assertEquals(value, f.get()); |
85 |
> |
result = f.get(); |
86 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
87 |
+ |
assertEquals(expectedValue, result); |
88 |
+ |
|
89 |
|
assertTrue(f.isDone()); |
90 |
|
assertFalse(f.isCancelled()); |
91 |
|
assertFalse(f.isCompletedExceptionally()); |
92 |
< |
assertTrue(f.toString().contains("[Completed normally]")); |
92 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed normally.*\\]")); |
93 |
|
} |
94 |
|
|
95 |
|
/** |
96 |
|
* Returns the "raw" internal exceptional completion of f, |
97 |
|
* without any additional wrapping with CompletionException. |
98 |
|
*/ |
99 |
< |
<U> Throwable exceptionalCompletion(CompletableFuture<U> f) { |
100 |
< |
// handle (and whenComplete) can distinguish between "direct" |
101 |
< |
// and "wrapped" exceptional completion |
102 |
< |
return f.handle((U u, Throwable t) -> t).join(); |
99 |
> |
Throwable exceptionalCompletion(CompletableFuture<?> f) { |
100 |
> |
// handle (and whenComplete and exceptionally) can distinguish |
101 |
> |
// between "direct" and "wrapped" exceptional completion |
102 |
> |
return f.handle((u, t) -> t).join(); |
103 |
|
} |
104 |
|
|
105 |
|
void checkCompletedExceptionally(CompletableFuture<?> f, |
145 |
|
assertFalse(f.isCancelled()); |
146 |
|
assertTrue(f.isDone()); |
147 |
|
assertTrue(f.isCompletedExceptionally()); |
148 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
148 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
149 |
|
} |
150 |
|
|
151 |
|
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
152 |
|
checkCompletedExceptionally(f, true, |
153 |
< |
(t) -> assertTrue(t instanceof CFException)); |
153 |
> |
t -> assertTrue(t instanceof CFException)); |
154 |
|
} |
155 |
|
|
156 |
|
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
157 |
|
checkCompletedExceptionally(f, true, |
158 |
< |
(t) -> assertTrue(t instanceof CancellationException)); |
158 |
> |
t -> assertTrue(t instanceof CancellationException)); |
159 |
|
} |
160 |
|
|
161 |
|
void checkCompletedWithTimeoutException(CompletableFuture<?> f) { |
162 |
|
checkCompletedExceptionally(f, false, |
163 |
< |
(t) -> assertTrue(t instanceof TimeoutException)); |
163 |
> |
t -> assertTrue(t instanceof TimeoutException)); |
164 |
|
} |
165 |
|
|
166 |
|
void checkCompletedWithWrappedException(CompletableFuture<?> f, |
167 |
|
Throwable ex) { |
168 |
< |
checkCompletedExceptionally(f, true, (t) -> assertSame(t, ex)); |
168 |
> |
checkCompletedExceptionally(f, true, t -> assertSame(t, ex)); |
169 |
|
} |
170 |
|
|
171 |
|
void checkCompletedExceptionally(CompletableFuture<?> f, Throwable ex) { |
172 |
< |
checkCompletedExceptionally(f, false, (t) -> assertSame(t, ex)); |
172 |
> |
checkCompletedExceptionally(f, false, t -> assertSame(t, ex)); |
173 |
|
} |
174 |
|
|
175 |
|
void checkCancelled(CompletableFuture<?> f) { |
200 |
|
assertTrue(f.isDone()); |
201 |
|
assertTrue(f.isCompletedExceptionally()); |
202 |
|
assertTrue(f.isCancelled()); |
203 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
203 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
204 |
|
} |
205 |
|
|
206 |
|
/** |
299 |
|
} |
300 |
|
|
301 |
|
f = new CompletableFuture<>(); |
302 |
< |
f.completeExceptionally(ex = new CFException()); |
302 |
> |
f.completeExceptionally(new CFException()); |
303 |
|
f.obtrudeValue(v1); |
304 |
|
checkCompletedNormally(f, v1); |
305 |
|
f.obtrudeException(ex = new CFException()); |
336 |
|
/** |
337 |
|
* toString indicates current completion state |
338 |
|
*/ |
339 |
< |
public void testToString() { |
340 |
< |
CompletableFuture<String> f; |
341 |
< |
|
342 |
< |
f = new CompletableFuture<String>(); |
343 |
< |
assertTrue(f.toString().contains("[Not completed]")); |
339 |
> |
public void testToString_incomplete() { |
340 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
341 |
> |
assertTrue(f.toString().matches(".*\\[.*Not completed.*\\]")); |
342 |
> |
if (testImplementationDetails) |
343 |
> |
assertEquals(identityString(f) + "[Not completed]", |
344 |
> |
f.toString()); |
345 |
> |
} |
346 |
|
|
347 |
+ |
public void testToString_normal() { |
348 |
+ |
CompletableFuture<String> f = new CompletableFuture<>(); |
349 |
|
assertTrue(f.complete("foo")); |
350 |
< |
assertTrue(f.toString().contains("[Completed normally]")); |
350 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed normally.*\\]")); |
351 |
> |
if (testImplementationDetails) |
352 |
> |
assertEquals(identityString(f) + "[Completed normally]", |
353 |
> |
f.toString()); |
354 |
> |
} |
355 |
|
|
356 |
< |
f = new CompletableFuture<String>(); |
356 |
> |
public void testToString_exception() { |
357 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
358 |
|
assertTrue(f.completeExceptionally(new IndexOutOfBoundsException())); |
359 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
359 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
360 |
> |
if (testImplementationDetails) |
361 |
> |
assertTrue(f.toString().startsWith( |
362 |
> |
identityString(f) + "[Completed exceptionally: ")); |
363 |
> |
} |
364 |
|
|
365 |
+ |
public void testToString_cancelled() { |
366 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) { |
367 |
< |
f = new CompletableFuture<String>(); |
367 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
368 |
|
assertTrue(f.cancel(mayInterruptIfRunning)); |
369 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
369 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
370 |
> |
if (testImplementationDetails) |
371 |
> |
assertTrue(f.toString().startsWith( |
372 |
> |
identityString(f) + "[Completed exceptionally: ")); |
373 |
|
} |
374 |
|
} |
375 |
|
|
381 |
|
checkCompletedNormally(f, "test"); |
382 |
|
} |
383 |
|
|
384 |
< |
abstract class CheckedAction { |
384 |
> |
abstract static class CheckedAction { |
385 |
|
int invocationCount = 0; |
386 |
|
final ExecutionMode m; |
387 |
|
CheckedAction(ExecutionMode m) { this.m = m; } |
393 |
|
void assertInvoked() { assertEquals(1, invocationCount); } |
394 |
|
} |
395 |
|
|
396 |
< |
abstract class CheckedIntegerAction extends CheckedAction { |
396 |
> |
abstract static class CheckedIntegerAction extends CheckedAction { |
397 |
|
Integer value; |
398 |
|
CheckedIntegerAction(ExecutionMode m) { super(m); } |
399 |
|
void assertValue(Integer expected) { |
402 |
|
} |
403 |
|
} |
404 |
|
|
405 |
< |
class IntegerSupplier extends CheckedAction |
405 |
> |
static class IntegerSupplier extends CheckedAction |
406 |
|
implements Supplier<Integer> |
407 |
|
{ |
408 |
|
final Integer value; |
421 |
|
return (x == null) ? null : x + 1; |
422 |
|
} |
423 |
|
|
424 |
< |
class NoopConsumer extends CheckedIntegerAction |
424 |
> |
static class NoopConsumer extends CheckedIntegerAction |
425 |
|
implements Consumer<Integer> |
426 |
|
{ |
427 |
|
NoopConsumer(ExecutionMode m) { super(m); } |
431 |
|
} |
432 |
|
} |
433 |
|
|
434 |
< |
class IncFunction extends CheckedIntegerAction |
434 |
> |
static class IncFunction extends CheckedIntegerAction |
435 |
|
implements Function<Integer,Integer> |
436 |
|
{ |
437 |
|
IncFunction(ExecutionMode m) { super(m); } |
449 |
|
- ((y == null) ? 99 : y.intValue()); |
450 |
|
} |
451 |
|
|
452 |
< |
class SubtractAction extends CheckedIntegerAction |
452 |
> |
static class SubtractAction extends CheckedIntegerAction |
453 |
|
implements BiConsumer<Integer, Integer> |
454 |
|
{ |
455 |
|
SubtractAction(ExecutionMode m) { super(m); } |
459 |
|
} |
460 |
|
} |
461 |
|
|
462 |
< |
class SubtractFunction extends CheckedIntegerAction |
462 |
> |
static class SubtractFunction extends CheckedIntegerAction |
463 |
|
implements BiFunction<Integer, Integer, Integer> |
464 |
|
{ |
465 |
|
SubtractFunction(ExecutionMode m) { super(m); } |
469 |
|
} |
470 |
|
} |
471 |
|
|
472 |
< |
class Noop extends CheckedAction implements Runnable { |
472 |
> |
static class Noop extends CheckedAction implements Runnable { |
473 |
|
Noop(ExecutionMode m) { super(m); } |
474 |
|
public void run() { |
475 |
|
invoked(); |
476 |
|
} |
477 |
|
} |
478 |
|
|
479 |
< |
class FailingSupplier extends CheckedAction |
479 |
> |
static class FailingSupplier extends CheckedAction |
480 |
|
implements Supplier<Integer> |
481 |
|
{ |
482 |
|
final CFException ex; |
487 |
|
} |
488 |
|
} |
489 |
|
|
490 |
< |
class FailingConsumer extends CheckedIntegerAction |
490 |
> |
static class FailingConsumer extends CheckedIntegerAction |
491 |
|
implements Consumer<Integer> |
492 |
|
{ |
493 |
|
final CFException ex; |
499 |
|
} |
500 |
|
} |
501 |
|
|
502 |
< |
class FailingBiConsumer extends CheckedIntegerAction |
502 |
> |
static class FailingBiConsumer extends CheckedIntegerAction |
503 |
|
implements BiConsumer<Integer, Integer> |
504 |
|
{ |
505 |
|
final CFException ex; |
511 |
|
} |
512 |
|
} |
513 |
|
|
514 |
< |
class FailingFunction extends CheckedIntegerAction |
514 |
> |
static class FailingFunction extends CheckedIntegerAction |
515 |
|
implements Function<Integer, Integer> |
516 |
|
{ |
517 |
|
final CFException ex; |
523 |
|
} |
524 |
|
} |
525 |
|
|
526 |
< |
class FailingBiFunction extends CheckedIntegerAction |
526 |
> |
static class FailingBiFunction extends CheckedIntegerAction |
527 |
|
implements BiFunction<Integer, Integer, Integer> |
528 |
|
{ |
529 |
|
final CFException ex; |
535 |
|
} |
536 |
|
} |
537 |
|
|
538 |
< |
class FailingRunnable extends CheckedAction implements Runnable { |
538 |
> |
static class FailingRunnable extends CheckedAction implements Runnable { |
539 |
|
final CFException ex; |
540 |
|
FailingRunnable(ExecutionMode m) { super(m); ex = new CFException(); } |
541 |
|
public void run() { |
544 |
|
} |
545 |
|
} |
546 |
|
|
547 |
< |
class CompletableFutureInc extends CheckedIntegerAction |
547 |
> |
static class CompletableFutureInc extends CheckedIntegerAction |
548 |
|
implements Function<Integer, CompletableFuture<Integer>> |
549 |
|
{ |
550 |
|
CompletableFutureInc(ExecutionMode m) { super(m); } |
557 |
|
} |
558 |
|
} |
559 |
|
|
560 |
< |
class FailingCompletableFutureFunction extends CheckedIntegerAction |
560 |
> |
static class FailingExceptionalCompletableFutureFunction extends CheckedAction |
561 |
> |
implements Function<Throwable, CompletableFuture<Integer>> |
562 |
> |
{ |
563 |
> |
final CFException ex; |
564 |
> |
FailingExceptionalCompletableFutureFunction(ExecutionMode m) { super(m); ex = new CFException(); } |
565 |
> |
public CompletableFuture<Integer> apply(Throwable x) { |
566 |
> |
invoked(); |
567 |
> |
throw ex; |
568 |
> |
} |
569 |
> |
} |
570 |
> |
|
571 |
> |
static class ExceptionalCompletableFutureFunction extends CheckedAction |
572 |
> |
implements Function<Throwable, CompletionStage<Integer>> { |
573 |
> |
final Integer value = 3; |
574 |
> |
ExceptionalCompletableFutureFunction(ExecutionMode m) { super(m); } |
575 |
> |
public CompletionStage<Integer> apply(Throwable x) { |
576 |
> |
invoked(); |
577 |
> |
CompletableFuture<Integer> d = new CompletableFuture<Integer>(); |
578 |
> |
d.complete(value); |
579 |
> |
return d; |
580 |
> |
} |
581 |
> |
} |
582 |
> |
|
583 |
> |
static class FailingCompletableFutureFunction extends CheckedIntegerAction |
584 |
|
implements Function<Integer, CompletableFuture<Integer>> |
585 |
|
{ |
586 |
|
final CFException ex; |
592 |
|
} |
593 |
|
} |
594 |
|
|
595 |
+ |
static class CountingRejectingExecutor implements Executor { |
596 |
+ |
final RejectedExecutionException ex = new RejectedExecutionException(); |
597 |
+ |
final AtomicInteger count = new AtomicInteger(0); |
598 |
+ |
public void execute(Runnable r) { |
599 |
+ |
count.getAndIncrement(); |
600 |
+ |
throw ex; |
601 |
+ |
} |
602 |
+ |
} |
603 |
+ |
|
604 |
|
// Used for explicit executor tests |
605 |
|
static final class ThreadExecutor implements Executor { |
606 |
|
final AtomicInteger count = new AtomicInteger(0); |
695 |
|
Function<? super T,U> a) { |
696 |
|
return f.applyToEither(g, a); |
697 |
|
} |
698 |
+ |
public <T> CompletableFuture<T> exceptionally |
699 |
+ |
(CompletableFuture<T> f, |
700 |
+ |
Function<Throwable, ? extends T> fn) { |
701 |
+ |
return f.exceptionally(fn); |
702 |
+ |
} |
703 |
+ |
public <T> CompletableFuture<T> exceptionallyCompose |
704 |
+ |
(CompletableFuture<T> f, Function<Throwable, ? extends CompletionStage<T>> fn) { |
705 |
+ |
return f.exceptionallyCompose(fn); |
706 |
+ |
} |
707 |
|
}, |
647 |
– |
|
708 |
|
ASYNC { |
709 |
|
public void checkExecutionMode() { |
710 |
|
assertEquals(defaultExecutorIsCommonPool, |
777 |
|
Function<? super T,U> a) { |
778 |
|
return f.applyToEitherAsync(g, a); |
779 |
|
} |
780 |
+ |
public <T> CompletableFuture<T> exceptionally |
781 |
+ |
(CompletableFuture<T> f, |
782 |
+ |
Function<Throwable, ? extends T> fn) { |
783 |
+ |
return f.exceptionallyAsync(fn); |
784 |
+ |
} |
785 |
+ |
|
786 |
+ |
public <T> CompletableFuture<T> exceptionallyCompose |
787 |
+ |
(CompletableFuture<T> f, Function<Throwable, ? extends CompletionStage<T>> fn) { |
788 |
+ |
return f.exceptionallyComposeAsync(fn); |
789 |
+ |
} |
790 |
+ |
|
791 |
|
}, |
792 |
|
|
793 |
|
EXECUTOR { |
861 |
|
Function<? super T,U> a) { |
862 |
|
return f.applyToEitherAsync(g, a, new ThreadExecutor()); |
863 |
|
} |
864 |
+ |
public <T> CompletableFuture<T> exceptionally |
865 |
+ |
(CompletableFuture<T> f, |
866 |
+ |
Function<Throwable, ? extends T> fn) { |
867 |
+ |
return f.exceptionallyAsync(fn, new ThreadExecutor()); |
868 |
+ |
} |
869 |
+ |
public <T> CompletableFuture<T> exceptionallyCompose |
870 |
+ |
(CompletableFuture<T> f, Function<Throwable, ? extends CompletionStage<T>> fn) { |
871 |
+ |
return f.exceptionallyComposeAsync(fn, new ThreadExecutor()); |
872 |
+ |
} |
873 |
+ |
|
874 |
|
}; |
875 |
|
|
876 |
|
public abstract void checkExecutionMode(); |
913 |
|
(CompletableFuture<T> f, |
914 |
|
CompletionStage<? extends T> g, |
915 |
|
Function<? super T,U> a); |
916 |
+ |
public abstract <T> CompletableFuture<T> exceptionally |
917 |
+ |
(CompletableFuture<T> f, |
918 |
+ |
Function<Throwable, ? extends T> fn); |
919 |
+ |
public abstract <T> CompletableFuture<T> exceptionallyCompose |
920 |
+ |
(CompletableFuture<T> f, |
921 |
+ |
Function<Throwable, ? extends CompletionStage<T>> fn); |
922 |
|
} |
923 |
|
|
924 |
|
/** |
926 |
|
* normally, and source result is propagated |
927 |
|
*/ |
928 |
|
public void testExceptionally_normalCompletion() { |
929 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
930 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
931 |
|
for (Integer v1 : new Integer[] { 1, null }) |
932 |
|
{ |
933 |
|
final AtomicInteger a = new AtomicInteger(0); |
934 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
935 |
|
if (!createIncomplete) assertTrue(f.complete(v1)); |
936 |
< |
final CompletableFuture<Integer> g = f.exceptionally |
937 |
< |
((Throwable t) -> { |
936 |
> |
final CompletableFuture<Integer> g = m.exceptionally |
937 |
> |
(f, (Throwable t) -> { |
938 |
|
a.getAndIncrement(); |
939 |
|
threadFail("should not be called"); |
940 |
|
return null; // unreached |
951 |
|
* exception |
952 |
|
*/ |
953 |
|
public void testExceptionally_exceptionalCompletion() { |
954 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
955 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
956 |
|
for (Integer v1 : new Integer[] { 1, null }) |
957 |
|
{ |
959 |
|
final CFException ex = new CFException(); |
960 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
961 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
962 |
< |
final CompletableFuture<Integer> g = f.exceptionally |
963 |
< |
((Throwable t) -> { |
964 |
< |
ExecutionMode.SYNC.checkExecutionMode(); |
962 |
> |
final CompletableFuture<Integer> g = m.exceptionally |
963 |
> |
(f, (Throwable t) -> { |
964 |
> |
m.checkExecutionMode(); |
965 |
|
threadAssertSame(t, ex); |
966 |
|
a.getAndIncrement(); |
967 |
|
return v1; |
977 |
|
* exceptionally with that exception |
978 |
|
*/ |
979 |
|
public void testExceptionally_exceptionalCompletionActionFailed() { |
980 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
981 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
982 |
|
{ |
983 |
|
final AtomicInteger a = new AtomicInteger(0); |
985 |
|
final CFException ex2 = new CFException(); |
986 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
987 |
|
if (!createIncomplete) f.completeExceptionally(ex1); |
988 |
< |
final CompletableFuture<Integer> g = f.exceptionally |
989 |
< |
((Throwable t) -> { |
990 |
< |
ExecutionMode.SYNC.checkExecutionMode(); |
988 |
> |
final CompletableFuture<Integer> g = m.exceptionally |
989 |
> |
(f, (Throwable t) -> { |
990 |
> |
m.checkExecutionMode(); |
991 |
|
threadAssertSame(t, ex1); |
992 |
|
a.getAndIncrement(); |
993 |
|
throw ex2; |
1323 |
|
r.assertInvoked(); |
1324 |
|
}} |
1325 |
|
|
1326 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1327 |
+ |
public void testRunAsync_rejectingExecutor() { |
1328 |
+ |
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1329 |
+ |
try { |
1330 |
+ |
CompletableFuture.runAsync(() -> {}, e); |
1331 |
+ |
shouldThrow(); |
1332 |
+ |
} catch (Throwable t) { |
1333 |
+ |
assertSame(e.ex, t); |
1334 |
+ |
} |
1335 |
+ |
|
1336 |
+ |
assertEquals(1, e.count.get()); |
1337 |
+ |
} |
1338 |
+ |
|
1339 |
|
/** |
1340 |
|
* supplyAsync completes with result of supplier |
1341 |
|
*/ |
1370 |
|
r.assertInvoked(); |
1371 |
|
}} |
1372 |
|
|
1373 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1374 |
+ |
public void testSupplyAsync_rejectingExecutor() { |
1375 |
+ |
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1376 |
+ |
try { |
1377 |
+ |
CompletableFuture.supplyAsync(() -> null, e); |
1378 |
+ |
shouldThrow(); |
1379 |
+ |
} catch (Throwable t) { |
1380 |
+ |
assertSame(e.ex, t); |
1381 |
+ |
} |
1382 |
+ |
|
1383 |
+ |
assertEquals(1, e.count.get()); |
1384 |
+ |
} |
1385 |
+ |
|
1386 |
|
// seq completion methods |
1387 |
|
|
1388 |
|
/** |
2645 |
|
|
2646 |
|
// unspecified behavior - both source completions available |
2647 |
|
try { |
2648 |
< |
assertEquals(null, h0.join()); |
2648 |
> |
assertNull(h0.join()); |
2649 |
|
rs[0].assertValue(v1); |
2650 |
|
} catch (CompletionException ok) { |
2651 |
|
checkCompletedWithWrappedException(h0, ex); |
2652 |
|
rs[0].assertNotInvoked(); |
2653 |
|
} |
2654 |
|
try { |
2655 |
< |
assertEquals(null, h1.join()); |
2655 |
> |
assertNull(h1.join()); |
2656 |
|
rs[1].assertValue(v1); |
2657 |
|
} catch (CompletionException ok) { |
2658 |
|
checkCompletedWithWrappedException(h1, ex); |
2659 |
|
rs[1].assertNotInvoked(); |
2660 |
|
} |
2661 |
|
try { |
2662 |
< |
assertEquals(null, h2.join()); |
2662 |
> |
assertNull(h2.join()); |
2663 |
|
rs[2].assertValue(v1); |
2664 |
|
} catch (CompletionException ok) { |
2665 |
|
checkCompletedWithWrappedException(h2, ex); |
2666 |
|
rs[2].assertNotInvoked(); |
2667 |
|
} |
2668 |
|
try { |
2669 |
< |
assertEquals(null, h3.join()); |
2669 |
> |
assertNull(h3.join()); |
2670 |
|
rs[3].assertValue(v1); |
2671 |
|
} catch (CompletionException ok) { |
2672 |
|
checkCompletedWithWrappedException(h3, ex); |
2782 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2783 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2784 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2785 |
+ |
for (boolean pushNop : new boolean[] { true, false }) |
2786 |
|
{ |
2787 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2788 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2795 |
|
checkIncomplete(h1); |
2796 |
|
rs[0].assertNotInvoked(); |
2797 |
|
rs[1].assertNotInvoked(); |
2798 |
+ |
if (pushNop) { // ad hoc test of intra-completion interference |
2799 |
+ |
m.thenRun(f, () -> {}); |
2800 |
+ |
m.thenRun(g, () -> {}); |
2801 |
+ |
} |
2802 |
|
f.complete(v1); |
2803 |
|
checkCompletedNormally(h0, null); |
2804 |
|
checkCompletedNormally(h1, null); |
2905 |
|
|
2906 |
|
// unspecified behavior - both source completions available |
2907 |
|
try { |
2908 |
< |
assertEquals(null, h0.join()); |
2908 |
> |
assertNull(h0.join()); |
2909 |
|
rs[0].assertInvoked(); |
2910 |
|
} catch (CompletionException ok) { |
2911 |
|
checkCompletedWithWrappedException(h0, ex); |
2912 |
|
rs[0].assertNotInvoked(); |
2913 |
|
} |
2914 |
|
try { |
2915 |
< |
assertEquals(null, h1.join()); |
2915 |
> |
assertNull(h1.join()); |
2916 |
|
rs[1].assertInvoked(); |
2917 |
|
} catch (CompletionException ok) { |
2918 |
|
checkCompletedWithWrappedException(h1, ex); |
2919 |
|
rs[1].assertNotInvoked(); |
2920 |
|
} |
2921 |
|
try { |
2922 |
< |
assertEquals(null, h2.join()); |
2922 |
> |
assertNull(h2.join()); |
2923 |
|
rs[2].assertInvoked(); |
2924 |
|
} catch (CompletionException ok) { |
2925 |
|
checkCompletedWithWrappedException(h2, ex); |
2926 |
|
rs[2].assertNotInvoked(); |
2927 |
|
} |
2928 |
|
try { |
2929 |
< |
assertEquals(null, h3.join()); |
2929 |
> |
assertNull(h3.join()); |
2930 |
|
rs[3].assertInvoked(); |
2931 |
|
} catch (CompletionException ok) { |
2932 |
|
checkCompletedWithWrappedException(h3, ex); |
3158 |
|
checkCompletedNormally(f, v1); |
3159 |
|
}} |
3160 |
|
|
3161 |
+ |
/** |
3162 |
+ |
* exceptionallyCompose result completes normally after normal |
3163 |
+ |
* completion of source |
3164 |
+ |
*/ |
3165 |
+ |
public void testExceptionallyCompose_normalCompletion() { |
3166 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
3167 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
3168 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3169 |
+ |
{ |
3170 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3171 |
+ |
final ExceptionalCompletableFutureFunction r = |
3172 |
+ |
new ExceptionalCompletableFutureFunction(m); |
3173 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3174 |
+ |
final CompletableFuture<Integer> g = m.exceptionallyCompose(f, r); |
3175 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
3176 |
+ |
|
3177 |
+ |
checkCompletedNormally(f, v1); |
3178 |
+ |
checkCompletedNormally(g, v1); |
3179 |
+ |
r.assertNotInvoked(); |
3180 |
+ |
}} |
3181 |
+ |
|
3182 |
+ |
/** |
3183 |
+ |
* exceptionallyCompose result completes normally after exceptional |
3184 |
+ |
* completion of source |
3185 |
+ |
*/ |
3186 |
+ |
public void testExceptionallyCompose_exceptionalCompletion() { |
3187 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
3188 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
3189 |
+ |
{ |
3190 |
+ |
final CFException ex = new CFException(); |
3191 |
+ |
final ExceptionalCompletableFutureFunction r = |
3192 |
+ |
new ExceptionalCompletableFutureFunction(m); |
3193 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3194 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
3195 |
+ |
final CompletableFuture<Integer> g = m.exceptionallyCompose(f, r); |
3196 |
+ |
if (createIncomplete) f.completeExceptionally(ex); |
3197 |
+ |
|
3198 |
+ |
checkCompletedExceptionally(f, ex); |
3199 |
+ |
checkCompletedNormally(g, r.value); |
3200 |
+ |
r.assertInvoked(); |
3201 |
+ |
}} |
3202 |
+ |
|
3203 |
+ |
/** |
3204 |
+ |
* exceptionallyCompose completes exceptionally on exception if action does |
3205 |
+ |
*/ |
3206 |
+ |
public void testExceptionallyCompose_actionFailed() { |
3207 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
3208 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
3209 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3210 |
+ |
{ |
3211 |
+ |
final CFException ex = new CFException(); |
3212 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3213 |
+ |
final FailingExceptionalCompletableFutureFunction r |
3214 |
+ |
= new FailingExceptionalCompletableFutureFunction(m); |
3215 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
3216 |
+ |
final CompletableFuture<Integer> g = m.exceptionallyCompose(f, r); |
3217 |
+ |
if (createIncomplete) f.completeExceptionally(ex); |
3218 |
+ |
|
3219 |
+ |
checkCompletedExceptionally(f, ex); |
3220 |
+ |
checkCompletedWithWrappedException(g, r.ex); |
3221 |
+ |
r.assertInvoked(); |
3222 |
+ |
}} |
3223 |
+ |
|
3224 |
+ |
|
3225 |
|
// other static methods |
3226 |
|
|
3227 |
|
/** |
3385 |
|
/** |
3386 |
|
* Completion methods throw NullPointerException with null arguments |
3387 |
|
*/ |
3388 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
3389 |
|
public void testNPE() { |
3390 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3391 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3405 |
|
|
3406 |
|
() -> f.thenApply(null), |
3407 |
|
() -> f.thenApplyAsync(null), |
3408 |
< |
() -> f.thenApplyAsync((x) -> x, null), |
3408 |
> |
() -> f.thenApplyAsync(x -> x, null), |
3409 |
|
() -> f.thenApplyAsync(null, exec), |
3410 |
|
|
3411 |
|
() -> f.thenAccept(null), |
3412 |
|
() -> f.thenAcceptAsync(null), |
3413 |
< |
() -> f.thenAcceptAsync((x) -> {} , null), |
3413 |
> |
() -> f.thenAcceptAsync(x -> {} , null), |
3414 |
|
() -> f.thenAcceptAsync(null, exec), |
3415 |
|
|
3416 |
|
() -> f.thenRun(null), |
3445 |
|
() -> f.applyToEither(g, null), |
3446 |
|
() -> f.applyToEitherAsync(g, null), |
3447 |
|
() -> f.applyToEitherAsync(g, null, exec), |
3448 |
< |
() -> f.applyToEither(nullFuture, (x) -> x), |
3449 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x), |
3450 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x, exec), |
3451 |
< |
() -> f.applyToEitherAsync(g, (x) -> x, null), |
3448 |
> |
() -> f.applyToEither(nullFuture, x -> x), |
3449 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x), |
3450 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x, exec), |
3451 |
> |
() -> f.applyToEitherAsync(g, x -> x, null), |
3452 |
|
|
3453 |
|
() -> f.acceptEither(g, null), |
3454 |
|
() -> f.acceptEitherAsync(g, null), |
3455 |
|
() -> f.acceptEitherAsync(g, null, exec), |
3456 |
< |
() -> f.acceptEither(nullFuture, (x) -> {}), |
3457 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}), |
3458 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}, exec), |
3459 |
< |
() -> f.acceptEitherAsync(g, (x) -> {}, null), |
3456 |
> |
() -> f.acceptEither(nullFuture, x -> {}), |
3457 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}), |
3458 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}, exec), |
3459 |
> |
() -> f.acceptEitherAsync(g, x -> {}, null), |
3460 |
|
|
3461 |
|
() -> f.runAfterEither(g, null), |
3462 |
|
() -> f.runAfterEitherAsync(g, null), |
3503 |
|
} |
3504 |
|
|
3505 |
|
/** |
3506 |
+ |
* Test submissions to an executor that rejects all tasks. |
3507 |
+ |
*/ |
3508 |
+ |
public void testRejectingExecutor() { |
3509 |
+ |
for (Integer v : new Integer[] { 1, null }) |
3510 |
+ |
{ |
3511 |
+ |
final CountingRejectingExecutor e = new CountingRejectingExecutor(); |
3512 |
+ |
|
3513 |
+ |
final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v); |
3514 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3515 |
+ |
|
3516 |
+ |
List<CompletableFuture<?>> futures = new ArrayList<>(); |
3517 |
+ |
|
3518 |
+ |
List<CompletableFuture<Integer>> srcs = new ArrayList<>(); |
3519 |
+ |
srcs.add(complete); |
3520 |
+ |
srcs.add(incomplete); |
3521 |
+ |
|
3522 |
+ |
for (CompletableFuture<Integer> src : srcs) { |
3523 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3524 |
+ |
fs.add(src.thenRunAsync(() -> {}, e)); |
3525 |
+ |
fs.add(src.thenAcceptAsync(z -> {}, e)); |
3526 |
+ |
fs.add(src.thenApplyAsync(z -> z, e)); |
3527 |
+ |
|
3528 |
+ |
fs.add(src.thenCombineAsync(src, (x, y) -> x, e)); |
3529 |
+ |
fs.add(src.thenAcceptBothAsync(src, (x, y) -> {}, e)); |
3530 |
+ |
fs.add(src.runAfterBothAsync(src, () -> {}, e)); |
3531 |
+ |
|
3532 |
+ |
fs.add(src.applyToEitherAsync(src, z -> z, e)); |
3533 |
+ |
fs.add(src.acceptEitherAsync(src, z -> {}, e)); |
3534 |
+ |
fs.add(src.runAfterEitherAsync(src, () -> {}, e)); |
3535 |
+ |
|
3536 |
+ |
fs.add(src.thenComposeAsync(z -> null, e)); |
3537 |
+ |
fs.add(src.whenCompleteAsync((z, t) -> {}, e)); |
3538 |
+ |
fs.add(src.handleAsync((z, t) -> null, e)); |
3539 |
+ |
|
3540 |
+ |
for (CompletableFuture<?> future : fs) { |
3541 |
+ |
if (src.isDone()) |
3542 |
+ |
checkCompletedWithWrappedException(future, e.ex); |
3543 |
+ |
else |
3544 |
+ |
checkIncomplete(future); |
3545 |
+ |
} |
3546 |
+ |
futures.addAll(fs); |
3547 |
+ |
} |
3548 |
+ |
|
3549 |
+ |
{ |
3550 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3551 |
+ |
|
3552 |
+ |
fs.add(complete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3553 |
+ |
fs.add(incomplete.thenCombineAsync(complete, (x, y) -> x, e)); |
3554 |
+ |
|
3555 |
+ |
fs.add(complete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3556 |
+ |
fs.add(incomplete.thenAcceptBothAsync(complete, (x, y) -> {}, e)); |
3557 |
+ |
|
3558 |
+ |
fs.add(complete.runAfterBothAsync(incomplete, () -> {}, e)); |
3559 |
+ |
fs.add(incomplete.runAfterBothAsync(complete, () -> {}, e)); |
3560 |
+ |
|
3561 |
+ |
for (CompletableFuture<?> future : fs) |
3562 |
+ |
checkIncomplete(future); |
3563 |
+ |
futures.addAll(fs); |
3564 |
+ |
} |
3565 |
+ |
|
3566 |
+ |
{ |
3567 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3568 |
+ |
|
3569 |
+ |
fs.add(complete.applyToEitherAsync(incomplete, z -> z, e)); |
3570 |
+ |
fs.add(incomplete.applyToEitherAsync(complete, z -> z, e)); |
3571 |
+ |
|
3572 |
+ |
fs.add(complete.acceptEitherAsync(incomplete, z -> {}, e)); |
3573 |
+ |
fs.add(incomplete.acceptEitherAsync(complete, z -> {}, e)); |
3574 |
+ |
|
3575 |
+ |
fs.add(complete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3576 |
+ |
fs.add(incomplete.runAfterEitherAsync(complete, () -> {}, e)); |
3577 |
+ |
|
3578 |
+ |
for (CompletableFuture<?> future : fs) |
3579 |
+ |
checkCompletedWithWrappedException(future, e.ex); |
3580 |
+ |
futures.addAll(fs); |
3581 |
+ |
} |
3582 |
+ |
|
3583 |
+ |
incomplete.complete(v); |
3584 |
+ |
|
3585 |
+ |
for (CompletableFuture<?> future : futures) |
3586 |
+ |
checkCompletedWithWrappedException(future, e.ex); |
3587 |
+ |
|
3588 |
+ |
assertEquals(futures.size(), e.count.get()); |
3589 |
+ |
}} |
3590 |
+ |
|
3591 |
+ |
/** |
3592 |
+ |
* Test submissions to an executor that rejects all tasks, but |
3593 |
+ |
* should never be invoked because the dependent future is |
3594 |
+ |
* explicitly completed. |
3595 |
+ |
*/ |
3596 |
+ |
public void testRejectingExecutorNeverInvoked() { |
3597 |
+ |
for (Integer v : new Integer[] { 1, null }) |
3598 |
+ |
{ |
3599 |
+ |
final CountingRejectingExecutor e = new CountingRejectingExecutor(); |
3600 |
+ |
|
3601 |
+ |
final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v); |
3602 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3603 |
+ |
|
3604 |
+ |
List<CompletableFuture<?>> futures = new ArrayList<>(); |
3605 |
+ |
|
3606 |
+ |
List<CompletableFuture<Integer>> srcs = new ArrayList<>(); |
3607 |
+ |
srcs.add(complete); |
3608 |
+ |
srcs.add(incomplete); |
3609 |
+ |
|
3610 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3611 |
+ |
fs.add(incomplete.thenRunAsync(() -> {}, e)); |
3612 |
+ |
fs.add(incomplete.thenAcceptAsync(z -> {}, e)); |
3613 |
+ |
fs.add(incomplete.thenApplyAsync(z -> z, e)); |
3614 |
+ |
|
3615 |
+ |
fs.add(incomplete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3616 |
+ |
fs.add(incomplete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3617 |
+ |
fs.add(incomplete.runAfterBothAsync(incomplete, () -> {}, e)); |
3618 |
+ |
|
3619 |
+ |
fs.add(incomplete.applyToEitherAsync(incomplete, z -> z, e)); |
3620 |
+ |
fs.add(incomplete.acceptEitherAsync(incomplete, z -> {}, e)); |
3621 |
+ |
fs.add(incomplete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3622 |
+ |
|
3623 |
+ |
fs.add(incomplete.thenComposeAsync(z -> null, e)); |
3624 |
+ |
fs.add(incomplete.whenCompleteAsync((z, t) -> {}, e)); |
3625 |
+ |
fs.add(incomplete.handleAsync((z, t) -> null, e)); |
3626 |
+ |
|
3627 |
+ |
fs.add(complete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3628 |
+ |
fs.add(incomplete.thenCombineAsync(complete, (x, y) -> x, e)); |
3629 |
+ |
|
3630 |
+ |
fs.add(complete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3631 |
+ |
fs.add(incomplete.thenAcceptBothAsync(complete, (x, y) -> {}, e)); |
3632 |
+ |
|
3633 |
+ |
fs.add(complete.runAfterBothAsync(incomplete, () -> {}, e)); |
3634 |
+ |
fs.add(incomplete.runAfterBothAsync(complete, () -> {}, e)); |
3635 |
+ |
|
3636 |
+ |
for (CompletableFuture<?> future : fs) |
3637 |
+ |
checkIncomplete(future); |
3638 |
+ |
|
3639 |
+ |
for (CompletableFuture<?> future : fs) |
3640 |
+ |
future.complete(null); |
3641 |
+ |
|
3642 |
+ |
incomplete.complete(v); |
3643 |
+ |
|
3644 |
+ |
for (CompletableFuture<?> future : fs) |
3645 |
+ |
checkCompletedNormally(future, null); |
3646 |
+ |
|
3647 |
+ |
assertEquals(0, e.count.get()); |
3648 |
+ |
}} |
3649 |
+ |
|
3650 |
+ |
/** |
3651 |
|
* toCompletableFuture returns this CompletableFuture. |
3652 |
|
*/ |
3653 |
|
public void testToCompletableFuture() { |
3680 |
|
*/ |
3681 |
|
public void testCompletedStage() { |
3682 |
|
AtomicInteger x = new AtomicInteger(0); |
3683 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3683 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3684 |
|
CompletionStage<Integer> f = CompletableFuture.completedStage(1); |
3685 |
|
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3686 |
|
assertEquals(x.get(), 1); |
3725 |
|
* copy returns a CompletableFuture that is completed normally, |
3726 |
|
* with the same value, when source is. |
3727 |
|
*/ |
3728 |
< |
public void testCopy() { |
3728 |
> |
public void testCopy_normalCompletion() { |
3729 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3730 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
3731 |
> |
{ |
3732 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3733 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3734 |
|
CompletableFuture<Integer> g = f.copy(); |
3735 |
< |
checkIncomplete(f); |
3736 |
< |
checkIncomplete(g); |
3737 |
< |
f.complete(1); |
3738 |
< |
checkCompletedNormally(f, 1); |
3739 |
< |
checkCompletedNormally(g, 1); |
3740 |
< |
} |
3735 |
> |
if (createIncomplete) { |
3736 |
> |
checkIncomplete(f); |
3737 |
> |
checkIncomplete(g); |
3738 |
> |
assertTrue(f.complete(v1)); |
3739 |
> |
} |
3740 |
> |
checkCompletedNormally(f, v1); |
3741 |
> |
checkCompletedNormally(g, v1); |
3742 |
> |
}} |
3743 |
|
|
3744 |
|
/** |
3745 |
|
* copy returns a CompletableFuture that is completed exceptionally |
3746 |
|
* when source is. |
3747 |
|
*/ |
3748 |
< |
public void testCopy2() { |
3748 |
> |
public void testCopy_exceptionalCompletion() { |
3749 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3750 |
> |
{ |
3751 |
> |
CFException ex = new CFException(); |
3752 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3753 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
3754 |
|
CompletableFuture<Integer> g = f.copy(); |
3755 |
< |
checkIncomplete(f); |
3756 |
< |
checkIncomplete(g); |
3757 |
< |
CFException ex = new CFException(); |
3758 |
< |
f.completeExceptionally(ex); |
3755 |
> |
if (createIncomplete) { |
3756 |
> |
checkIncomplete(f); |
3757 |
> |
checkIncomplete(g); |
3758 |
> |
f.completeExceptionally(ex); |
3759 |
> |
} |
3760 |
|
checkCompletedExceptionally(f, ex); |
3761 |
|
checkCompletedWithWrappedException(g, ex); |
3762 |
+ |
}} |
3763 |
+ |
|
3764 |
+ |
/** |
3765 |
+ |
* Completion of a copy does not complete its source. |
3766 |
+ |
*/ |
3767 |
+ |
public void testCopy_oneWayPropagation() { |
3768 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3769 |
+ |
assertTrue(f.copy().complete(1)); |
3770 |
+ |
assertTrue(f.copy().complete(null)); |
3771 |
+ |
assertTrue(f.copy().cancel(true)); |
3772 |
+ |
assertTrue(f.copy().cancel(false)); |
3773 |
+ |
assertTrue(f.copy().completeExceptionally(new CFException())); |
3774 |
+ |
checkIncomplete(f); |
3775 |
|
} |
3776 |
|
|
3777 |
|
/** |
3782 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3783 |
|
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3784 |
|
AtomicInteger x = new AtomicInteger(0); |
3785 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3785 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3786 |
|
checkIncomplete(f); |
3787 |
|
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3788 |
|
f.complete(1); |
3799 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3800 |
|
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3801 |
|
AtomicInteger x = new AtomicInteger(0); |
3802 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3802 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3803 |
|
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3804 |
|
checkIncomplete(f); |
3805 |
|
CFException ex = new CFException(); |
3817 |
|
CFException ex = new CFException(); |
3818 |
|
CompletionStage<Integer> f = CompletableFuture.failedStage(ex); |
3819 |
|
AtomicInteger x = new AtomicInteger(0); |
3820 |
< |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3820 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3821 |
|
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3822 |
|
assertEquals(x.get(), 0); |
3823 |
|
assertEquals(r.get(), ex); |
3841 |
|
public void testCompleteAsync2() { |
3842 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3843 |
|
CFException ex = new CFException(); |
3844 |
< |
f.completeAsync(() -> {if (true) throw ex; return 1;}); |
3844 |
> |
f.completeAsync(() -> { throw ex; }); |
3845 |
|
try { |
3846 |
|
f.join(); |
3847 |
|
shouldThrow(); |
3871 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3872 |
|
CFException ex = new CFException(); |
3873 |
|
ThreadExecutor executor = new ThreadExecutor(); |
3874 |
< |
f.completeAsync(() -> {if (true) throw ex; return 1;}, executor); |
3874 |
> |
f.completeAsync(() -> { throw ex; }, executor); |
3875 |
|
try { |
3876 |
|
f.join(); |
3877 |
|
shouldThrow(); |
4023 |
|
final CompletableFuture<Integer> v42 = CompletableFuture.completedFuture(42); |
4024 |
|
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4025 |
|
|
4026 |
+ |
final Runnable noopRunnable = new Noop(m); |
4027 |
+ |
final Consumer<Integer> noopConsumer = new NoopConsumer(m); |
4028 |
+ |
final Function<Integer, Integer> incFunction = new IncFunction(m); |
4029 |
+ |
|
4030 |
|
List<Function<CompletableFuture<Integer>, CompletableFuture<?>>> funs |
4031 |
|
= new ArrayList<>(); |
4032 |
|
|
4033 |
< |
funs.add((y) -> m.thenRun(y, new Noop(m))); |
4034 |
< |
funs.add((y) -> m.thenAccept(y, new NoopConsumer(m))); |
4035 |
< |
funs.add((y) -> m.thenApply(y, new IncFunction(m))); |
4036 |
< |
|
4037 |
< |
funs.add((y) -> m.runAfterEither(y, incomplete, new Noop(m))); |
4038 |
< |
funs.add((y) -> m.acceptEither(y, incomplete, new NoopConsumer(m))); |
4039 |
< |
funs.add((y) -> m.applyToEither(y, incomplete, new IncFunction(m))); |
4040 |
< |
|
4041 |
< |
funs.add((y) -> m.runAfterBoth(y, v42, new Noop(m))); |
4042 |
< |
funs.add((y) -> m.runAfterBoth(v42, y, new Noop(m))); |
4043 |
< |
funs.add((y) -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
4044 |
< |
funs.add((y) -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
4045 |
< |
funs.add((y) -> m.thenCombine(y, v42, new SubtractFunction(m))); |
4046 |
< |
funs.add((y) -> m.thenCombine(v42, y, new SubtractFunction(m))); |
4047 |
< |
|
4048 |
< |
funs.add((y) -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
4049 |
< |
|
4050 |
< |
funs.add((y) -> m.thenCompose(y, new CompletableFutureInc(m))); |
4051 |
< |
|
4052 |
< |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y})); |
4053 |
< |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y, v42})); |
4054 |
< |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {v42, y})); |
4055 |
< |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y})); |
4056 |
< |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y, incomplete})); |
4057 |
< |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {incomplete, y})); |
4033 |
> |
funs.add(y -> m.thenRun(y, noopRunnable)); |
4034 |
> |
funs.add(y -> m.thenAccept(y, noopConsumer)); |
4035 |
> |
funs.add(y -> m.thenApply(y, incFunction)); |
4036 |
> |
|
4037 |
> |
funs.add(y -> m.runAfterEither(y, incomplete, noopRunnable)); |
4038 |
> |
funs.add(y -> m.acceptEither(y, incomplete, noopConsumer)); |
4039 |
> |
funs.add(y -> m.applyToEither(y, incomplete, incFunction)); |
4040 |
> |
|
4041 |
> |
funs.add(y -> m.runAfterBoth(y, v42, noopRunnable)); |
4042 |
> |
funs.add(y -> m.runAfterBoth(v42, y, noopRunnable)); |
4043 |
> |
funs.add(y -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
4044 |
> |
funs.add(y -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
4045 |
> |
funs.add(y -> m.thenCombine(y, v42, new SubtractFunction(m))); |
4046 |
> |
funs.add(y -> m.thenCombine(v42, y, new SubtractFunction(m))); |
4047 |
> |
|
4048 |
> |
funs.add(y -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
4049 |
> |
|
4050 |
> |
funs.add(y -> m.thenCompose(y, new CompletableFutureInc(m))); |
4051 |
> |
|
4052 |
> |
funs.add(y -> CompletableFuture.allOf(y)); |
4053 |
> |
funs.add(y -> CompletableFuture.allOf(y, v42)); |
4054 |
> |
funs.add(y -> CompletableFuture.allOf(v42, y)); |
4055 |
> |
funs.add(y -> CompletableFuture.anyOf(y)); |
4056 |
> |
funs.add(y -> CompletableFuture.anyOf(y, incomplete)); |
4057 |
> |
funs.add(y -> CompletableFuture.anyOf(incomplete, y)); |
4058 |
|
|
4059 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4060 |
|
fun : funs) { |
4061 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4062 |
|
f.completeExceptionally(ex); |
4063 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
4063 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4064 |
|
checkCompletedWithWrappedException(src, ex); |
4065 |
|
CompletableFuture<?> dep = fun.apply(src); |
4066 |
|
checkCompletedWithWrappedException(dep, ex); |
4070 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4071 |
|
fun : funs) { |
4072 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4073 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
4073 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4074 |
|
CompletableFuture<?> dep = fun.apply(src); |
4075 |
|
f.completeExceptionally(ex); |
4076 |
|
checkCompletedWithWrappedException(src, ex); |
4084 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4085 |
|
f.cancel(mayInterruptIfRunning); |
4086 |
|
checkCancelled(f); |
4087 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
4087 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4088 |
|
checkCompletedWithWrappedCancellationException(src); |
4089 |
|
CompletableFuture<?> dep = fun.apply(src); |
4090 |
|
checkCompletedWithWrappedCancellationException(dep); |
4095 |
|
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4096 |
|
fun : funs) { |
4097 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4098 |
< |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
4098 |
> |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4099 |
|
CompletableFuture<?> dep = fun.apply(src); |
4100 |
|
f.cancel(mayInterruptIfRunning); |
4101 |
|
checkCancelled(f); |
4106 |
|
}} |
4107 |
|
|
4108 |
|
/** |
4109 |
< |
* Minimal completion stages throw UOE for all non-CompletionStage methods |
4109 |
> |
* Minimal completion stages throw UOE for most non-CompletionStage methods |
4110 |
|
*/ |
4111 |
|
public void testMinimalCompletionStage_minimality() { |
4112 |
|
if (!testImplementationDetails) return; |
4113 |
|
Function<Method, String> toSignature = |
4114 |
< |
(method) -> method.getName() + Arrays.toString(method.getParameterTypes()); |
4114 |
> |
method -> method.getName() + Arrays.toString(method.getParameterTypes()); |
4115 |
|
Predicate<Method> isNotStatic = |
4116 |
< |
(method) -> (method.getModifiers() & Modifier.STATIC) == 0; |
4116 |
> |
method -> (method.getModifiers() & Modifier.STATIC) == 0; |
4117 |
|
List<Method> minimalMethods = |
4118 |
|
Stream.of(Object.class, CompletionStage.class) |
4119 |
< |
.flatMap((klazz) -> Stream.of(klazz.getMethods())) |
4119 |
> |
.flatMap(klazz -> Stream.of(klazz.getMethods())) |
4120 |
|
.filter(isNotStatic) |
4121 |
|
.collect(Collectors.toList()); |
4122 |
|
// Methods from CompletableFuture permitted NOT to throw UOE |
4132 |
|
.collect(Collectors.toSet()); |
4133 |
|
List<Method> allMethods = Stream.of(CompletableFuture.class.getMethods()) |
4134 |
|
.filter(isNotStatic) |
4135 |
< |
.filter((method) -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
4135 |
> |
.filter(method -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
4136 |
|
.collect(Collectors.toList()); |
4137 |
|
|
4138 |
< |
CompletionStage<Integer> minimalStage = |
4138 |
> |
List<CompletionStage<Integer>> stages = new ArrayList<>(); |
4139 |
> |
CompletionStage<Integer> min = |
4140 |
|
new CompletableFuture<Integer>().minimalCompletionStage(); |
4141 |
+ |
stages.add(min); |
4142 |
+ |
stages.add(min.thenApply(x -> x)); |
4143 |
+ |
stages.add(CompletableFuture.completedStage(1)); |
4144 |
+ |
stages.add(CompletableFuture.failedStage(new CFException())); |
4145 |
|
|
4146 |
|
List<Method> bugs = new ArrayList<>(); |
4147 |
|
for (Method method : allMethods) { |
4157 |
|
else if (parameterTypes[i] == long.class) |
4158 |
|
args[i] = 0L; |
4159 |
|
} |
4160 |
< |
try { |
4161 |
< |
method.invoke(minimalStage, args); |
4162 |
< |
bugs.add(method); |
3799 |
< |
} |
3800 |
< |
catch (java.lang.reflect.InvocationTargetException expected) { |
3801 |
< |
if (! (expected.getCause() instanceof UnsupportedOperationException)) { |
4160 |
> |
for (CompletionStage<Integer> stage : stages) { |
4161 |
> |
try { |
4162 |
> |
method.invoke(stage, args); |
4163 |
|
bugs.add(method); |
3803 |
– |
// expected.getCause().printStackTrace(); |
4164 |
|
} |
4165 |
+ |
catch (java.lang.reflect.InvocationTargetException expected) { |
4166 |
+ |
if (! (expected.getCause() instanceof UnsupportedOperationException)) { |
4167 |
+ |
bugs.add(method); |
4168 |
+ |
// expected.getCause().printStackTrace(); |
4169 |
+ |
} |
4170 |
+ |
} |
4171 |
+ |
catch (ReflectiveOperationException bad) { throw new Error(bad); } |
4172 |
|
} |
3806 |
– |
catch (ReflectiveOperationException bad) { throw new Error(bad); } |
4173 |
|
} |
4174 |
|
if (!bugs.isEmpty()) |
4175 |
< |
throw new Error("Methods did not throw UOE: " + bugs.toString()); |
4175 |
> |
throw new Error("Methods did not throw UOE: " + bugs); |
4176 |
|
} |
4177 |
|
|
4178 |
+ |
/** |
4179 |
+ |
* minimalStage.toCompletableFuture() returns a CompletableFuture that |
4180 |
+ |
* is completed normally, with the same value, when source is. |
4181 |
+ |
*/ |
4182 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_normalCompletion() { |
4183 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4184 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4185 |
+ |
{ |
4186 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4187 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4188 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4189 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4190 |
+ |
if (createIncomplete) { |
4191 |
+ |
checkIncomplete(f); |
4192 |
+ |
checkIncomplete(g); |
4193 |
+ |
assertTrue(f.complete(v1)); |
4194 |
+ |
} |
4195 |
+ |
checkCompletedNormally(f, v1); |
4196 |
+ |
checkCompletedNormally(g, v1); |
4197 |
+ |
}} |
4198 |
+ |
|
4199 |
+ |
/** |
4200 |
+ |
* minimalStage.toCompletableFuture() returns a CompletableFuture that |
4201 |
+ |
* is completed exceptionally when source is. |
4202 |
+ |
*/ |
4203 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_exceptionalCompletion() { |
4204 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4205 |
+ |
{ |
4206 |
+ |
CFException ex = new CFException(); |
4207 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4208 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4209 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
4210 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4211 |
+ |
if (createIncomplete) { |
4212 |
+ |
checkIncomplete(f); |
4213 |
+ |
checkIncomplete(g); |
4214 |
+ |
f.completeExceptionally(ex); |
4215 |
+ |
} |
4216 |
+ |
checkCompletedExceptionally(f, ex); |
4217 |
+ |
checkCompletedWithWrappedException(g, ex); |
4218 |
+ |
}} |
4219 |
+ |
|
4220 |
+ |
/** |
4221 |
+ |
* minimalStage.toCompletableFuture() gives mutable CompletableFuture |
4222 |
+ |
*/ |
4223 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_mutable() { |
4224 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4225 |
+ |
{ |
4226 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4227 |
+ |
CompletionStage minimal = f.minimalCompletionStage(); |
4228 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4229 |
+ |
assertTrue(g.complete(v1)); |
4230 |
+ |
checkCompletedNormally(g, v1); |
4231 |
+ |
checkIncomplete(f); |
4232 |
+ |
checkIncomplete(minimal.toCompletableFuture()); |
4233 |
+ |
}} |
4234 |
+ |
|
4235 |
+ |
/** |
4236 |
+ |
* minimalStage.toCompletableFuture().join() awaits completion |
4237 |
+ |
*/ |
4238 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_join() throws Exception { |
4239 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4240 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4241 |
+ |
{ |
4242 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4243 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4244 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4245 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4246 |
+ |
assertEquals(v1, minimal.toCompletableFuture().join()); |
4247 |
+ |
assertEquals(v1, minimal.toCompletableFuture().get()); |
4248 |
+ |
checkCompletedNormally(minimal.toCompletableFuture(), v1); |
4249 |
+ |
}} |
4250 |
+ |
|
4251 |
+ |
/** |
4252 |
+ |
* Completion of a toCompletableFuture copy of a minimal stage |
4253 |
+ |
* does not complete its source. |
4254 |
+ |
*/ |
4255 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_oneWayPropagation() { |
4256 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4257 |
+ |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
4258 |
+ |
assertTrue(g.toCompletableFuture().complete(1)); |
4259 |
+ |
assertTrue(g.toCompletableFuture().complete(null)); |
4260 |
+ |
assertTrue(g.toCompletableFuture().cancel(true)); |
4261 |
+ |
assertTrue(g.toCompletableFuture().cancel(false)); |
4262 |
+ |
assertTrue(g.toCompletableFuture().completeExceptionally(new CFException())); |
4263 |
+ |
checkIncomplete(g.toCompletableFuture()); |
4264 |
+ |
f.complete(1); |
4265 |
+ |
checkCompletedNormally(g.toCompletableFuture(), 1); |
4266 |
+ |
} |
4267 |
+ |
|
4268 |
+ |
/** Demo utility method for external reliable toCompletableFuture */ |
4269 |
+ |
static <T> CompletableFuture<T> toCompletableFuture(CompletionStage<T> stage) { |
4270 |
+ |
CompletableFuture<T> f = new CompletableFuture<>(); |
4271 |
+ |
stage.handle((T t, Throwable ex) -> { |
4272 |
+ |
if (ex != null) f.completeExceptionally(ex); |
4273 |
+ |
else f.complete(t); |
4274 |
+ |
return null; |
4275 |
+ |
}); |
4276 |
+ |
return f; |
4277 |
+ |
} |
4278 |
+ |
|
4279 |
+ |
/** Demo utility method to join a CompletionStage */ |
4280 |
+ |
static <T> T join(CompletionStage<T> stage) { |
4281 |
+ |
return toCompletableFuture(stage).join(); |
4282 |
+ |
} |
4283 |
+ |
|
4284 |
+ |
/** |
4285 |
+ |
* Joining a minimal stage "by hand" works |
4286 |
+ |
*/ |
4287 |
+ |
public void testMinimalCompletionStage_join_by_hand() { |
4288 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4289 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4290 |
+ |
{ |
4291 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4292 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4293 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
4294 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4295 |
+ |
minimal.thenAccept(x -> g.complete(x)); |
4296 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4297 |
+ |
g.join(); |
4298 |
+ |
checkCompletedNormally(g, v1); |
4299 |
+ |
checkCompletedNormally(f, v1); |
4300 |
+ |
assertEquals(v1, join(minimal)); |
4301 |
+ |
}} |
4302 |
+ |
|
4303 |
|
static class Monad { |
4304 |
|
static class ZeroException extends RuntimeException { |
4305 |
|
public ZeroException() { super("monadic zero"); } |
4316 |
|
static <T,U,V> Function<T, CompletableFuture<V>> compose |
4317 |
|
(Function<T, CompletableFuture<U>> f, |
4318 |
|
Function<U, CompletableFuture<V>> g) { |
4319 |
< |
return (x) -> f.apply(x).thenCompose(g); |
4319 |
> |
return x -> f.apply(x).thenCompose(g); |
4320 |
|
} |
4321 |
|
|
4322 |
|
static void assertZero(CompletableFuture<?> f) { |
4323 |
|
try { |
4324 |
|
f.getNow(null); |
4325 |
< |
throw new AssertionFailedError("should throw"); |
4325 |
> |
throw new AssertionError("should throw"); |
4326 |
|
} catch (CompletionException success) { |
4327 |
|
assertTrue(success.getCause() instanceof ZeroException); |
4328 |
|
} |
4396 |
|
|
4397 |
|
// Some mutually non-commutative functions |
4398 |
|
Function<Long, CompletableFuture<Long>> triple |
4399 |
< |
= (x) -> Monad.unit(3 * x); |
4399 |
> |
= x -> Monad.unit(3 * x); |
4400 |
|
Function<Long, CompletableFuture<Long>> inc |
4401 |
< |
= (x) -> Monad.unit(x + 1); |
4401 |
> |
= x -> Monad.unit(x + 1); |
4402 |
|
|
4403 |
|
// unit is a right identity: m >>= unit === m |
4404 |
|
Monad.assertFutureEquals(inc.apply(5L).thenCompose(unit), |
4410 |
|
// associativity: (m >>= f) >>= g === m >>= ( \x -> (f x >>= g) ) |
4411 |
|
Monad.assertFutureEquals( |
4412 |
|
unit.apply(5L).thenCompose(inc).thenCompose(triple), |
4413 |
< |
unit.apply(5L).thenCompose((x) -> inc.apply(x).thenCompose(triple))); |
4413 |
> |
unit.apply(5L).thenCompose(x -> inc.apply(x).thenCompose(triple))); |
4414 |
|
|
4415 |
|
// The case for CompletableFuture as an additive monad is weaker... |
4416 |
|
|
4420 |
|
// left zero: zero >>= f === zero |
4421 |
|
Monad.assertZero(zero.thenCompose(inc)); |
4422 |
|
// right zero: f >>= (\x -> zero) === zero |
4423 |
< |
Monad.assertZero(inc.apply(5L).thenCompose((x) -> zero)); |
4423 |
> |
Monad.assertZero(inc.apply(5L).thenCompose(x -> zero)); |
4424 |
|
|
4425 |
|
// f plus zero === f |
4426 |
|
Monad.assertFutureEquals(Monad.unit(5L), |
4446 |
|
Monad.plus(godot, Monad.unit(5L))); |
4447 |
|
} |
4448 |
|
|
4449 |
+ |
/** Test long recursive chains of CompletableFutures with cascading completions */ |
4450 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4451 |
+ |
public void testRecursiveChains() throws Throwable { |
4452 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
4453 |
+ |
for (boolean addDeadEnds : new boolean[] { true, false }) |
4454 |
+ |
{ |
4455 |
+ |
final int val = 42; |
4456 |
+ |
final int n = expensiveTests ? 1_000 : 2; |
4457 |
+ |
CompletableFuture<Integer> head = new CompletableFuture<>(); |
4458 |
+ |
CompletableFuture<Integer> tail = head; |
4459 |
+ |
for (int i = 0; i < n; i++) { |
4460 |
+ |
if (addDeadEnds) m.thenApply(tail, v -> v + 1); |
4461 |
+ |
tail = m.thenApply(tail, v -> v + 1); |
4462 |
+ |
if (addDeadEnds) m.applyToEither(tail, tail, v -> v + 1); |
4463 |
+ |
tail = m.applyToEither(tail, tail, v -> v + 1); |
4464 |
+ |
if (addDeadEnds) m.thenCombine(tail, tail, (v, w) -> v + 1); |
4465 |
+ |
tail = m.thenCombine(tail, tail, (v, w) -> v + 1); |
4466 |
+ |
} |
4467 |
+ |
head.complete(val); |
4468 |
+ |
assertEquals(val + 3 * n, (int) tail.join()); |
4469 |
+ |
}} |
4470 |
+ |
|
4471 |
|
/** |
4472 |
|
* A single CompletableFuture with many dependents. |
4473 |
|
* A demo of scalability - runtime is O(n). |
4474 |
|
*/ |
4475 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4476 |
|
public void testManyDependents() throws Throwable { |
4477 |
< |
final int n = 1_000; |
4477 |
> |
final int n = expensiveTests ? 1_000_000 : 10; |
4478 |
|
final CompletableFuture<Void> head = new CompletableFuture<>(); |
4479 |
|
final CompletableFuture<Void> complete = CompletableFuture.completedFuture((Void)null); |
4480 |
|
final AtomicInteger count = new AtomicInteger(0); |
4481 |
|
for (int i = 0; i < n; i++) { |
4482 |
|
head.thenRun(() -> count.getAndIncrement()); |
4483 |
< |
head.thenAccept((x) -> count.getAndIncrement()); |
4484 |
< |
head.thenApply((x) -> count.getAndIncrement()); |
4483 |
> |
head.thenAccept(x -> count.getAndIncrement()); |
4484 |
> |
head.thenApply(x -> count.getAndIncrement()); |
4485 |
|
|
4486 |
|
head.runAfterBoth(complete, () -> count.getAndIncrement()); |
4487 |
|
head.thenAcceptBoth(complete, (x, y) -> count.getAndIncrement()); |
4491 |
|
complete.thenCombine(head, (x, y) -> count.getAndIncrement()); |
4492 |
|
|
4493 |
|
head.runAfterEither(new CompletableFuture<Void>(), () -> count.getAndIncrement()); |
4494 |
< |
head.acceptEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
4495 |
< |
head.applyToEither(new CompletableFuture<Void>(), (x) -> count.getAndIncrement()); |
4494 |
> |
head.acceptEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4495 |
> |
head.applyToEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4496 |
|
new CompletableFuture<Void>().runAfterEither(head, () -> count.getAndIncrement()); |
4497 |
< |
new CompletableFuture<Void>().acceptEither(head, (x) -> count.getAndIncrement()); |
4498 |
< |
new CompletableFuture<Void>().applyToEither(head, (x) -> count.getAndIncrement()); |
4497 |
> |
new CompletableFuture<Void>().acceptEither(head, x -> count.getAndIncrement()); |
4498 |
> |
new CompletableFuture<Void>().applyToEither(head, x -> count.getAndIncrement()); |
4499 |
|
} |
4500 |
|
head.complete(null); |
4501 |
|
assertEquals(5 * 3 * n, count.get()); |
4502 |
|
} |
4503 |
|
|
4504 |
+ |
/** ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck */ |
4505 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4506 |
+ |
public void testCoCompletionGarbageRetention() throws Throwable { |
4507 |
+ |
final int n = expensiveTests ? 1_000_000 : 10; |
4508 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4509 |
+ |
CompletableFuture<Integer> f; |
4510 |
+ |
for (int i = 0; i < n; i++) { |
4511 |
+ |
f = new CompletableFuture<>(); |
4512 |
+ |
f.runAfterEither(incomplete, () -> {}); |
4513 |
+ |
f.complete(null); |
4514 |
+ |
|
4515 |
+ |
f = new CompletableFuture<>(); |
4516 |
+ |
f.acceptEither(incomplete, x -> {}); |
4517 |
+ |
f.complete(null); |
4518 |
+ |
|
4519 |
+ |
f = new CompletableFuture<>(); |
4520 |
+ |
f.applyToEither(incomplete, x -> x); |
4521 |
+ |
f.complete(null); |
4522 |
+ |
|
4523 |
+ |
f = new CompletableFuture<>(); |
4524 |
+ |
CompletableFuture.anyOf(f, incomplete); |
4525 |
+ |
f.complete(null); |
4526 |
+ |
} |
4527 |
+ |
|
4528 |
+ |
for (int i = 0; i < n; i++) { |
4529 |
+ |
f = new CompletableFuture<>(); |
4530 |
+ |
incomplete.runAfterEither(f, () -> {}); |
4531 |
+ |
f.complete(null); |
4532 |
+ |
|
4533 |
+ |
f = new CompletableFuture<>(); |
4534 |
+ |
incomplete.acceptEither(f, x -> {}); |
4535 |
+ |
f.complete(null); |
4536 |
+ |
|
4537 |
+ |
f = new CompletableFuture<>(); |
4538 |
+ |
incomplete.applyToEither(f, x -> x); |
4539 |
+ |
f.complete(null); |
4540 |
+ |
|
4541 |
+ |
f = new CompletableFuture<>(); |
4542 |
+ |
CompletableFuture.anyOf(incomplete, f); |
4543 |
+ |
f.complete(null); |
4544 |
+ |
} |
4545 |
+ |
} |
4546 |
+ |
|
4547 |
+ |
/** |
4548 |
+ |
* Reproduction recipe for: |
4549 |
+ |
* 8160402: Garbage retention with CompletableFuture.anyOf |
4550 |
+ |
* 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 |
4551 |
+ |
*/ |
4552 |
+ |
public void testAnyOfGarbageRetention() throws Throwable { |
4553 |
+ |
for (Integer v : new Integer[] { 1, null }) |
4554 |
+ |
{ |
4555 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4556 |
+ |
CompletableFuture<Integer>[] fs |
4557 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4558 |
+ |
for (int i = 0; i < fs.length; i++) |
4559 |
+ |
fs[i] = new CompletableFuture<>(); |
4560 |
+ |
fs[fs.length - 1].complete(v); |
4561 |
+ |
for (int i = 0; i < n; i++) |
4562 |
+ |
checkCompletedNormally(CompletableFuture.anyOf(fs), v); |
4563 |
+ |
}} |
4564 |
+ |
|
4565 |
+ |
/** |
4566 |
+ |
* Checks for garbage retention with allOf. |
4567 |
+ |
* |
4568 |
+ |
* As of 2016-07, fails with OOME: |
4569 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testCancelledAllOfGarbageRetention tck |
4570 |
+ |
*/ |
4571 |
+ |
public void testCancelledAllOfGarbageRetention() throws Throwable { |
4572 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4573 |
+ |
CompletableFuture<Integer>[] fs |
4574 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4575 |
+ |
for (int i = 0; i < fs.length; i++) |
4576 |
+ |
fs[i] = new CompletableFuture<>(); |
4577 |
+ |
for (int i = 0; i < n; i++) |
4578 |
+ |
assertTrue(CompletableFuture.allOf(fs).cancel(false)); |
4579 |
+ |
} |
4580 |
+ |
|
4581 |
+ |
/** |
4582 |
+ |
* Checks for garbage retention when a dependent future is |
4583 |
+ |
* cancelled and garbage-collected. |
4584 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4585 |
+ |
* |
4586 |
+ |
* As of 2016-07, fails with OOME: |
4587 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testCancelledGarbageRetention tck |
4588 |
+ |
*/ |
4589 |
+ |
public void testCancelledGarbageRetention() throws Throwable { |
4590 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4591 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4592 |
+ |
for (int i = 0; i < n; i++) |
4593 |
+ |
assertTrue(neverCompleted.thenRun(() -> {}).cancel(true)); |
4594 |
+ |
} |
4595 |
+ |
|
4596 |
+ |
/** |
4597 |
+ |
* Checks for garbage retention when MinimalStage.toCompletableFuture() |
4598 |
+ |
* is invoked many times. |
4599 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4600 |
+ |
* |
4601 |
+ |
* As of 2016-07, fails with OOME: |
4602 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testToCompletableFutureGarbageRetention tck |
4603 |
+ |
*/ |
4604 |
+ |
public void testToCompletableFutureGarbageRetention() throws Throwable { |
4605 |
+ |
final int n = expensiveTests ? 900_000 : 10; |
4606 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4607 |
+ |
CompletionStage minimal = neverCompleted.minimalCompletionStage(); |
4608 |
+ |
for (int i = 0; i < n; i++) |
4609 |
+ |
assertTrue(minimal.toCompletableFuture().cancel(true)); |
4610 |
+ |
} |
4611 |
+ |
|
4612 |
|
// static <U> U join(CompletionStage<U> stage) { |
4613 |
|
// CompletableFuture<U> f = new CompletableFuture<>(); |
4614 |
|
// stage.whenComplete((v, ex) -> { |