5 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
6 |
|
*/ |
7 |
|
|
8 |
< |
import junit.framework.*; |
8 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
9 |
> |
import static java.util.concurrent.TimeUnit.SECONDS; |
10 |
> |
import static java.util.concurrent.CompletableFuture.completedFuture; |
11 |
> |
import static java.util.concurrent.CompletableFuture.failedFuture; |
12 |
> |
|
13 |
> |
import java.lang.reflect.Method; |
14 |
> |
import java.lang.reflect.Modifier; |
15 |
> |
|
16 |
> |
import java.util.stream.Collectors; |
17 |
> |
import java.util.stream.Stream; |
18 |
> |
|
19 |
> |
import java.util.ArrayList; |
20 |
> |
import java.util.Arrays; |
21 |
> |
import java.util.List; |
22 |
> |
import java.util.Objects; |
23 |
> |
import java.util.Set; |
24 |
|
import java.util.concurrent.Callable; |
10 |
– |
import java.util.concurrent.Executor; |
11 |
– |
import java.util.concurrent.ExecutorService; |
12 |
– |
import java.util.concurrent.Executors; |
25 |
|
import java.util.concurrent.CancellationException; |
14 |
– |
import java.util.concurrent.CountDownLatch; |
15 |
– |
import java.util.concurrent.ExecutionException; |
16 |
– |
import java.util.concurrent.Future; |
26 |
|
import java.util.concurrent.CompletableFuture; |
27 |
|
import java.util.concurrent.CompletionException; |
28 |
|
import java.util.concurrent.CompletionStage; |
29 |
+ |
import java.util.concurrent.ExecutionException; |
30 |
+ |
import java.util.concurrent.Executor; |
31 |
|
import java.util.concurrent.ForkJoinPool; |
32 |
|
import java.util.concurrent.ForkJoinTask; |
33 |
|
import java.util.concurrent.TimeoutException; |
34 |
+ |
import java.util.concurrent.TimeUnit; |
35 |
|
import java.util.concurrent.atomic.AtomicInteger; |
36 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
25 |
< |
import static java.util.concurrent.TimeUnit.SECONDS; |
26 |
< |
import java.util.*; |
27 |
< |
import java.util.function.Supplier; |
28 |
< |
import java.util.function.Consumer; |
36 |
> |
import java.util.concurrent.atomic.AtomicReference; |
37 |
|
import java.util.function.BiConsumer; |
30 |
– |
import java.util.function.Function; |
38 |
|
import java.util.function.BiFunction; |
39 |
+ |
import java.util.function.Consumer; |
40 |
+ |
import java.util.function.Function; |
41 |
+ |
import java.util.function.Predicate; |
42 |
+ |
import java.util.function.Supplier; |
43 |
+ |
|
44 |
+ |
import junit.framework.AssertionFailedError; |
45 |
+ |
import junit.framework.Test; |
46 |
+ |
import junit.framework.TestSuite; |
47 |
|
|
48 |
|
public class CompletableFutureTest extends JSR166TestCase { |
49 |
|
|
50 |
|
public static void main(String[] args) { |
51 |
< |
junit.textui.TestRunner.run(suite()); |
51 |
> |
main(suite(), args); |
52 |
|
} |
53 |
|
public static Test suite() { |
54 |
|
return new TestSuite(CompletableFutureTest.class); |
59 |
|
void checkIncomplete(CompletableFuture<?> f) { |
60 |
|
assertFalse(f.isDone()); |
61 |
|
assertFalse(f.isCancelled()); |
62 |
< |
assertTrue(f.toString().contains("[Not completed]")); |
62 |
> |
assertTrue(f.toString().contains("Not completed")); |
63 |
|
try { |
64 |
|
assertNull(f.getNow(null)); |
65 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
72 |
|
} |
73 |
|
|
74 |
|
<T> void checkCompletedNormally(CompletableFuture<T> f, T value) { |
75 |
< |
try { |
76 |
< |
assertEquals(value, f.get(LONG_DELAY_MS, MILLISECONDS)); |
62 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
75 |
> |
checkTimedGet(f, value); |
76 |
> |
|
77 |
|
try { |
78 |
|
assertEquals(value, f.join()); |
79 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
89 |
|
assertTrue(f.toString().contains("[Completed normally]")); |
90 |
|
} |
91 |
|
|
92 |
< |
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
93 |
< |
try { |
94 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
95 |
< |
shouldThrow(); |
96 |
< |
} catch (ExecutionException success) { |
97 |
< |
assertTrue(success.getCause() instanceof CFException); |
98 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
99 |
< |
try { |
100 |
< |
f.join(); |
101 |
< |
shouldThrow(); |
102 |
< |
} catch (CompletionException success) { |
103 |
< |
assertTrue(success.getCause() instanceof CFException); |
104 |
< |
} |
105 |
< |
try { |
106 |
< |
f.getNow(null); |
107 |
< |
shouldThrow(); |
108 |
< |
} catch (CompletionException success) { |
95 |
< |
assertTrue(success.getCause() instanceof CFException); |
92 |
> |
/** |
93 |
> |
* Returns the "raw" internal exceptional completion of f, |
94 |
> |
* without any additional wrapping with CompletionException. |
95 |
> |
*/ |
96 |
> |
<U> Throwable exceptionalCompletion(CompletableFuture<U> f) { |
97 |
> |
// handle (and whenComplete) can distinguish between "direct" |
98 |
> |
// and "wrapped" exceptional completion |
99 |
> |
return f.handle((U u, Throwable t) -> t).join(); |
100 |
> |
} |
101 |
> |
|
102 |
> |
void checkCompletedExceptionally(CompletableFuture<?> f, |
103 |
> |
boolean wrapped, |
104 |
> |
Consumer<Throwable> checker) { |
105 |
> |
Throwable cause = exceptionalCompletion(f); |
106 |
> |
if (wrapped) { |
107 |
> |
assertTrue(cause instanceof CompletionException); |
108 |
> |
cause = cause.getCause(); |
109 |
|
} |
110 |
< |
try { |
98 |
< |
f.get(); |
99 |
< |
shouldThrow(); |
100 |
< |
} catch (ExecutionException success) { |
101 |
< |
assertTrue(success.getCause() instanceof CFException); |
102 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
103 |
< |
assertTrue(f.isDone()); |
104 |
< |
assertFalse(f.isCancelled()); |
105 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
106 |
< |
} |
110 |
> |
checker.accept(cause); |
111 |
|
|
112 |
< |
<U> void checkCompletedExceptionallyWithRootCause(CompletableFuture<U> f, |
109 |
< |
Throwable ex) { |
112 |
> |
long startTime = System.nanoTime(); |
113 |
|
try { |
114 |
|
f.get(LONG_DELAY_MS, MILLISECONDS); |
115 |
|
shouldThrow(); |
116 |
|
} catch (ExecutionException success) { |
117 |
< |
assertSame(ex, success.getCause()); |
117 |
> |
assertSame(cause, success.getCause()); |
118 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
119 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
120 |
+ |
|
121 |
|
try { |
122 |
|
f.join(); |
123 |
|
shouldThrow(); |
124 |
|
} catch (CompletionException success) { |
125 |
< |
assertSame(ex, success.getCause()); |
126 |
< |
} |
125 |
> |
assertSame(cause, success.getCause()); |
126 |
> |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
127 |
> |
|
128 |
|
try { |
129 |
|
f.getNow(null); |
130 |
|
shouldThrow(); |
131 |
|
} catch (CompletionException success) { |
132 |
< |
assertSame(ex, success.getCause()); |
133 |
< |
} |
132 |
> |
assertSame(cause, success.getCause()); |
133 |
> |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
134 |
> |
|
135 |
|
try { |
136 |
|
f.get(); |
137 |
|
shouldThrow(); |
138 |
|
} catch (ExecutionException success) { |
139 |
< |
assertSame(ex, success.getCause()); |
139 |
> |
assertSame(cause, success.getCause()); |
140 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
141 |
|
|
135 |
– |
assertTrue(f.isDone()); |
142 |
|
assertFalse(f.isCancelled()); |
143 |
+ |
assertTrue(f.isDone()); |
144 |
+ |
assertTrue(f.isCompletedExceptionally()); |
145 |
|
assertTrue(f.toString().contains("[Completed exceptionally]")); |
146 |
|
} |
147 |
|
|
148 |
< |
<U> void checkCompletedWithWrappedException(CompletableFuture<U> f, |
149 |
< |
Throwable ex) { |
150 |
< |
checkCompletedExceptionallyWithRootCause(f, ex); |
143 |
< |
try { |
144 |
< |
CompletableFuture<Throwable> spy = f.handle |
145 |
< |
((U u, Throwable t) -> t); |
146 |
< |
assertTrue(spy.join() instanceof CompletionException); |
147 |
< |
assertSame(ex, spy.join().getCause()); |
148 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
148 |
> |
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
149 |
> |
checkCompletedExceptionally(f, true, |
150 |
> |
(t) -> assertTrue(t instanceof CFException)); |
151 |
|
} |
152 |
|
|
153 |
< |
<U> void checkCompletedExceptionally(CompletableFuture<U> f, Throwable ex) { |
154 |
< |
checkCompletedExceptionallyWithRootCause(f, ex); |
155 |
< |
try { |
156 |
< |
CompletableFuture<Throwable> spy = f.handle |
157 |
< |
((U u, Throwable t) -> t); |
158 |
< |
assertSame(ex, spy.join()); |
159 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
153 |
> |
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
154 |
> |
checkCompletedExceptionally(f, true, |
155 |
> |
(t) -> assertTrue(t instanceof CancellationException)); |
156 |
> |
} |
157 |
> |
|
158 |
> |
void checkCompletedWithTimeoutException(CompletableFuture<?> f) { |
159 |
> |
checkCompletedExceptionally(f, false, |
160 |
> |
(t) -> assertTrue(t instanceof TimeoutException)); |
161 |
> |
} |
162 |
> |
|
163 |
> |
void checkCompletedWithWrappedException(CompletableFuture<?> f, |
164 |
> |
Throwable ex) { |
165 |
> |
checkCompletedExceptionally(f, true, (t) -> assertSame(t, ex)); |
166 |
> |
} |
167 |
> |
|
168 |
> |
void checkCompletedExceptionally(CompletableFuture<?> f, Throwable ex) { |
169 |
> |
checkCompletedExceptionally(f, false, (t) -> assertSame(t, ex)); |
170 |
|
} |
171 |
|
|
172 |
|
void checkCancelled(CompletableFuture<?> f) { |
173 |
+ |
long startTime = System.nanoTime(); |
174 |
|
try { |
175 |
|
f.get(LONG_DELAY_MS, MILLISECONDS); |
176 |
|
shouldThrow(); |
177 |
|
} catch (CancellationException success) { |
178 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
179 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
180 |
+ |
|
181 |
|
try { |
182 |
|
f.join(); |
183 |
|
shouldThrow(); |
191 |
|
shouldThrow(); |
192 |
|
} catch (CancellationException success) { |
193 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
179 |
– |
assertTrue(f.isDone()); |
180 |
– |
assertTrue(f.isCompletedExceptionally()); |
181 |
– |
assertTrue(f.isCancelled()); |
182 |
– |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
183 |
– |
} |
194 |
|
|
195 |
< |
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
196 |
< |
try { |
187 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
188 |
< |
shouldThrow(); |
189 |
< |
} catch (ExecutionException success) { |
190 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
191 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
192 |
< |
try { |
193 |
< |
f.join(); |
194 |
< |
shouldThrow(); |
195 |
< |
} catch (CompletionException success) { |
196 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
197 |
< |
} |
198 |
< |
try { |
199 |
< |
f.getNow(null); |
200 |
< |
shouldThrow(); |
201 |
< |
} catch (CompletionException success) { |
202 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
203 |
< |
} |
204 |
< |
try { |
205 |
< |
f.get(); |
206 |
< |
shouldThrow(); |
207 |
< |
} catch (ExecutionException success) { |
208 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
209 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
195 |
> |
assertTrue(exceptionalCompletion(f) instanceof CancellationException); |
196 |
> |
|
197 |
|
assertTrue(f.isDone()); |
211 |
– |
assertFalse(f.isCancelled()); |
198 |
|
assertTrue(f.isCompletedExceptionally()); |
199 |
+ |
assertTrue(f.isCancelled()); |
200 |
|
assertTrue(f.toString().contains("[Completed exceptionally]")); |
201 |
|
} |
202 |
|
|
244 |
|
{ |
245 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
246 |
|
checkIncomplete(f); |
247 |
< |
assertTrue(f.cancel(true)); |
248 |
< |
assertTrue(f.cancel(true)); |
247 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
248 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
249 |
> |
assertTrue(f.cancel(!mayInterruptIfRunning)); |
250 |
|
checkCancelled(f); |
251 |
|
}} |
252 |
|
|
518 |
|
} |
519 |
|
} |
520 |
|
|
533 |
– |
|
521 |
|
class CompletableFutureInc extends CheckedIntegerAction |
522 |
|
implements Function<Integer, CompletableFuture<Integer>> |
523 |
|
{ |
556 |
|
} |
557 |
|
} |
558 |
|
|
559 |
+ |
static final boolean defaultExecutorIsCommonPool |
560 |
+ |
= ForkJoinPool.getCommonPoolParallelism() > 1; |
561 |
+ |
|
562 |
|
/** |
563 |
|
* Permits the testing of parallel code for the 3 different |
564 |
|
* execution modes without copy/pasting all the test methods. |
565 |
|
*/ |
566 |
|
enum ExecutionMode { |
567 |
< |
DEFAULT { |
567 |
> |
SYNC { |
568 |
|
public void checkExecutionMode() { |
569 |
|
assertFalse(ThreadExecutor.startedCurrentThread()); |
570 |
|
assertNull(ForkJoinTask.getPool()); |
640 |
|
|
641 |
|
ASYNC { |
642 |
|
public void checkExecutionMode() { |
643 |
< |
assertSame(ForkJoinPool.commonPool(), |
644 |
< |
ForkJoinTask.getPool()); |
643 |
> |
assertEquals(defaultExecutorIsCommonPool, |
644 |
> |
(ForkJoinPool.commonPool() == ForkJoinTask.getPool())); |
645 |
|
} |
646 |
|
public CompletableFuture<Void> runAsync(Runnable a) { |
647 |
|
return CompletableFuture.runAsync(a); |
840 |
|
if (!createIncomplete) assertTrue(f.complete(v1)); |
841 |
|
final CompletableFuture<Integer> g = f.exceptionally |
842 |
|
((Throwable t) -> { |
853 |
– |
// Should not be called |
843 |
|
a.getAndIncrement(); |
844 |
< |
throw new AssertionError(); |
844 |
> |
threadFail("should not be called"); |
845 |
> |
return null; // unreached |
846 |
|
}); |
847 |
|
if (createIncomplete) assertTrue(f.complete(v1)); |
848 |
|
|
865 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
866 |
|
final CompletableFuture<Integer> g = f.exceptionally |
867 |
|
((Throwable t) -> { |
868 |
< |
ExecutionMode.DEFAULT.checkExecutionMode(); |
868 |
> |
ExecutionMode.SYNC.checkExecutionMode(); |
869 |
|
threadAssertSame(t, ex); |
870 |
|
a.getAndIncrement(); |
871 |
|
return v1; |
878 |
|
|
879 |
|
public void testExceptionally_exceptionalCompletionActionFailed() { |
880 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
891 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
881 |
|
{ |
882 |
|
final AtomicInteger a = new AtomicInteger(0); |
883 |
|
final CFException ex1 = new CFException(); |
886 |
|
if (!createIncomplete) f.completeExceptionally(ex1); |
887 |
|
final CompletableFuture<Integer> g = f.exceptionally |
888 |
|
((Throwable t) -> { |
889 |
< |
ExecutionMode.DEFAULT.checkExecutionMode(); |
889 |
> |
ExecutionMode.SYNC.checkExecutionMode(); |
890 |
|
threadAssertSame(t, ex1); |
891 |
|
a.getAndIncrement(); |
892 |
|
throw ex2; |
901 |
|
* whenComplete action executes on normal completion, propagating |
902 |
|
* source result. |
903 |
|
*/ |
904 |
< |
public void testWhenComplete_normalCompletion1() { |
904 |
> |
public void testWhenComplete_normalCompletion() { |
905 |
|
for (ExecutionMode m : ExecutionMode.values()) |
906 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
907 |
|
for (Integer v1 : new Integer[] { 1, null }) |
931 |
|
public void testWhenComplete_exceptionalCompletion() { |
932 |
|
for (ExecutionMode m : ExecutionMode.values()) |
933 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
945 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
934 |
|
{ |
935 |
|
final AtomicInteger a = new AtomicInteger(0); |
936 |
|
final CFException ex = new CFException(); |
1015 |
|
public void testWhenComplete_actionFailedSourceFailed() { |
1016 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
1017 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1030 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
1018 |
|
{ |
1019 |
|
final AtomicInteger a = new AtomicInteger(0); |
1020 |
|
final CFException ex1 = new CFException(); |
1251 |
|
*/ |
1252 |
|
public void testThenRun_normalCompletion() { |
1253 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1267 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1254 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1255 |
|
{ |
1256 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1257 |
< |
final Noop r = new Noop(m); |
1258 |
< |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1273 |
< |
final CompletableFuture<Void> g = m.thenRun(f, r); |
1274 |
< |
if (createIncomplete) { |
1275 |
< |
checkIncomplete(g); |
1276 |
< |
assertTrue(f.complete(v1)); |
1277 |
< |
} |
1257 |
> |
final Noop[] rs = new Noop[6]; |
1258 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1259 |
|
|
1260 |
< |
checkCompletedNormally(g, null); |
1260 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1261 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1262 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1263 |
> |
checkIncomplete(h0); |
1264 |
> |
checkIncomplete(h1); |
1265 |
> |
checkIncomplete(h2); |
1266 |
> |
assertTrue(f.complete(v1)); |
1267 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1268 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1269 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1270 |
> |
|
1271 |
> |
checkCompletedNormally(h0, null); |
1272 |
> |
checkCompletedNormally(h1, null); |
1273 |
> |
checkCompletedNormally(h2, null); |
1274 |
> |
checkCompletedNormally(h3, null); |
1275 |
> |
checkCompletedNormally(h4, null); |
1276 |
> |
checkCompletedNormally(h5, null); |
1277 |
|
checkCompletedNormally(f, v1); |
1278 |
< |
r.assertInvoked(); |
1278 |
> |
for (Noop r : rs) r.assertInvoked(); |
1279 |
|
}} |
1280 |
|
|
1281 |
|
/** |
1284 |
|
*/ |
1285 |
|
public void testThenRun_exceptionalCompletion() { |
1286 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1290 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1287 |
|
{ |
1288 |
|
final CFException ex = new CFException(); |
1289 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1290 |
< |
final Noop r = new Noop(m); |
1291 |
< |
if (!createIncomplete) f.completeExceptionally(ex); |
1296 |
< |
final CompletableFuture<Void> g = m.thenRun(f, r); |
1297 |
< |
if (createIncomplete) { |
1298 |
< |
checkIncomplete(g); |
1299 |
< |
f.completeExceptionally(ex); |
1300 |
< |
} |
1290 |
> |
final Noop[] rs = new Noop[6]; |
1291 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1292 |
|
|
1293 |
< |
checkCompletedWithWrappedException(g, ex); |
1293 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1294 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1295 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1296 |
> |
checkIncomplete(h0); |
1297 |
> |
checkIncomplete(h1); |
1298 |
> |
checkIncomplete(h2); |
1299 |
> |
assertTrue(f.completeExceptionally(ex)); |
1300 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1301 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1302 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1303 |
> |
|
1304 |
> |
checkCompletedWithWrappedException(h0, ex); |
1305 |
> |
checkCompletedWithWrappedException(h1, ex); |
1306 |
> |
checkCompletedWithWrappedException(h2, ex); |
1307 |
> |
checkCompletedWithWrappedException(h3, ex); |
1308 |
> |
checkCompletedWithWrappedException(h4, ex); |
1309 |
> |
checkCompletedWithWrappedException(h5, ex); |
1310 |
|
checkCompletedExceptionally(f, ex); |
1311 |
< |
r.assertNotInvoked(); |
1311 |
> |
for (Noop r : rs) r.assertNotInvoked(); |
1312 |
|
}} |
1313 |
|
|
1314 |
|
/** |
1316 |
|
*/ |
1317 |
|
public void testThenRun_sourceCancelled() { |
1318 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1312 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1319 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1320 |
|
{ |
1321 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1322 |
< |
final Noop r = new Noop(m); |
1323 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1318 |
< |
final CompletableFuture<Void> g = m.thenRun(f, r); |
1319 |
< |
if (createIncomplete) { |
1320 |
< |
checkIncomplete(g); |
1321 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1322 |
< |
} |
1322 |
> |
final Noop[] rs = new Noop[6]; |
1323 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1324 |
|
|
1325 |
< |
checkCompletedWithWrappedCancellationException(g); |
1325 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1326 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1327 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1328 |
> |
checkIncomplete(h0); |
1329 |
> |
checkIncomplete(h1); |
1330 |
> |
checkIncomplete(h2); |
1331 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1332 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1333 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1334 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1335 |
> |
|
1336 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1337 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1338 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1339 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1340 |
> |
checkCompletedWithWrappedCancellationException(h4); |
1341 |
> |
checkCompletedWithWrappedCancellationException(h5); |
1342 |
|
checkCancelled(f); |
1343 |
< |
r.assertNotInvoked(); |
1343 |
> |
for (Noop r : rs) r.assertNotInvoked(); |
1344 |
|
}} |
1345 |
|
|
1346 |
|
/** |
1348 |
|
*/ |
1349 |
|
public void testThenRun_actionFailed() { |
1350 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1334 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1351 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1352 |
|
{ |
1353 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1354 |
< |
final FailingRunnable r = new FailingRunnable(m); |
1355 |
< |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1340 |
< |
final CompletableFuture<Void> g = m.thenRun(f, r); |
1341 |
< |
if (createIncomplete) { |
1342 |
< |
checkIncomplete(g); |
1343 |
< |
assertTrue(f.complete(v1)); |
1344 |
< |
} |
1354 |
> |
final FailingRunnable[] rs = new FailingRunnable[6]; |
1355 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingRunnable(m); |
1356 |
|
|
1357 |
< |
checkCompletedWithWrappedCFException(g); |
1357 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1358 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1359 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1360 |
> |
assertTrue(f.complete(v1)); |
1361 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1362 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1363 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1364 |
> |
|
1365 |
> |
checkCompletedWithWrappedCFException(h0); |
1366 |
> |
checkCompletedWithWrappedCFException(h1); |
1367 |
> |
checkCompletedWithWrappedCFException(h2); |
1368 |
> |
checkCompletedWithWrappedCFException(h3); |
1369 |
> |
checkCompletedWithWrappedCFException(h4); |
1370 |
> |
checkCompletedWithWrappedCFException(h5); |
1371 |
|
checkCompletedNormally(f, v1); |
1372 |
|
}} |
1373 |
|
|
1376 |
|
*/ |
1377 |
|
public void testThenApply_normalCompletion() { |
1378 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1355 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1379 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1380 |
|
{ |
1381 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1382 |
< |
final IncFunction r = new IncFunction(m); |
1383 |
< |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1361 |
< |
final CompletableFuture<Integer> g = m.thenApply(f, r); |
1362 |
< |
if (createIncomplete) { |
1363 |
< |
checkIncomplete(g); |
1364 |
< |
assertTrue(f.complete(v1)); |
1365 |
< |
} |
1382 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1383 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1384 |
|
|
1385 |
< |
checkCompletedNormally(g, inc(v1)); |
1385 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1386 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1387 |
> |
checkIncomplete(h0); |
1388 |
> |
checkIncomplete(h1); |
1389 |
> |
assertTrue(f.complete(v1)); |
1390 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1391 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1392 |
> |
|
1393 |
> |
checkCompletedNormally(h0, inc(v1)); |
1394 |
> |
checkCompletedNormally(h1, inc(v1)); |
1395 |
> |
checkCompletedNormally(h2, inc(v1)); |
1396 |
> |
checkCompletedNormally(h3, inc(v1)); |
1397 |
|
checkCompletedNormally(f, v1); |
1398 |
< |
r.assertValue(inc(v1)); |
1398 |
> |
for (IncFunction r : rs) r.assertValue(inc(v1)); |
1399 |
|
}} |
1400 |
|
|
1401 |
|
/** |
1404 |
|
*/ |
1405 |
|
public void testThenApply_exceptionalCompletion() { |
1406 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1378 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1407 |
|
{ |
1408 |
|
final CFException ex = new CFException(); |
1409 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1410 |
< |
final IncFunction r = new IncFunction(m); |
1411 |
< |
if (!createIncomplete) f.completeExceptionally(ex); |
1384 |
< |
final CompletableFuture<Integer> g = m.thenApply(f, r); |
1385 |
< |
if (createIncomplete) { |
1386 |
< |
checkIncomplete(g); |
1387 |
< |
f.completeExceptionally(ex); |
1388 |
< |
} |
1410 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1411 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1412 |
|
|
1413 |
< |
checkCompletedWithWrappedException(g, ex); |
1413 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1414 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1415 |
> |
assertTrue(f.completeExceptionally(ex)); |
1416 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1417 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1418 |
> |
|
1419 |
> |
checkCompletedWithWrappedException(h0, ex); |
1420 |
> |
checkCompletedWithWrappedException(h1, ex); |
1421 |
> |
checkCompletedWithWrappedException(h2, ex); |
1422 |
> |
checkCompletedWithWrappedException(h3, ex); |
1423 |
|
checkCompletedExceptionally(f, ex); |
1424 |
< |
r.assertNotInvoked(); |
1424 |
> |
for (IncFunction r : rs) r.assertNotInvoked(); |
1425 |
|
}} |
1426 |
|
|
1427 |
|
/** |
1429 |
|
*/ |
1430 |
|
public void testThenApply_sourceCancelled() { |
1431 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1400 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1432 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1433 |
|
{ |
1434 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1435 |
< |
final IncFunction r = new IncFunction(m); |
1436 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1406 |
< |
final CompletableFuture<Integer> g = m.thenApply(f, r); |
1407 |
< |
if (createIncomplete) { |
1408 |
< |
checkIncomplete(g); |
1409 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1410 |
< |
} |
1435 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1436 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1437 |
|
|
1438 |
< |
checkCompletedWithWrappedCancellationException(g); |
1438 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1439 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1440 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1441 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1442 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1443 |
> |
|
1444 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1445 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1446 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1447 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1448 |
|
checkCancelled(f); |
1449 |
< |
r.assertNotInvoked(); |
1449 |
> |
for (IncFunction r : rs) r.assertNotInvoked(); |
1450 |
|
}} |
1451 |
|
|
1452 |
|
/** |
1454 |
|
*/ |
1455 |
|
public void testThenApply_actionFailed() { |
1456 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1422 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1457 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1458 |
|
{ |
1459 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1460 |
< |
final FailingFunction r = new FailingFunction(m); |
1461 |
< |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1428 |
< |
final CompletableFuture<Integer> g = m.thenApply(f, r); |
1429 |
< |
if (createIncomplete) { |
1430 |
< |
checkIncomplete(g); |
1431 |
< |
assertTrue(f.complete(v1)); |
1432 |
< |
} |
1460 |
> |
final FailingFunction[] rs = new FailingFunction[4]; |
1461 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingFunction(m); |
1462 |
|
|
1463 |
< |
checkCompletedWithWrappedCFException(g); |
1463 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1464 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1465 |
> |
assertTrue(f.complete(v1)); |
1466 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1467 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1468 |
> |
|
1469 |
> |
checkCompletedWithWrappedCFException(h0); |
1470 |
> |
checkCompletedWithWrappedCFException(h1); |
1471 |
> |
checkCompletedWithWrappedCFException(h2); |
1472 |
> |
checkCompletedWithWrappedCFException(h3); |
1473 |
|
checkCompletedNormally(f, v1); |
1474 |
|
}} |
1475 |
|
|
1478 |
|
*/ |
1479 |
|
public void testThenAccept_normalCompletion() { |
1480 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1443 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1481 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1482 |
|
{ |
1483 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1484 |
< |
final NoopConsumer r = new NoopConsumer(m); |
1485 |
< |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1449 |
< |
final CompletableFuture<Void> g = m.thenAccept(f, r); |
1450 |
< |
if (createIncomplete) { |
1451 |
< |
checkIncomplete(g); |
1452 |
< |
assertTrue(f.complete(v1)); |
1453 |
< |
} |
1484 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1485 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1486 |
|
|
1487 |
< |
checkCompletedNormally(g, null); |
1488 |
< |
r.assertValue(v1); |
1487 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1488 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1489 |
> |
checkIncomplete(h0); |
1490 |
> |
checkIncomplete(h1); |
1491 |
> |
assertTrue(f.complete(v1)); |
1492 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1493 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1494 |
> |
|
1495 |
> |
checkCompletedNormally(h0, null); |
1496 |
> |
checkCompletedNormally(h1, null); |
1497 |
> |
checkCompletedNormally(h2, null); |
1498 |
> |
checkCompletedNormally(h3, null); |
1499 |
|
checkCompletedNormally(f, v1); |
1500 |
+ |
for (NoopConsumer r : rs) r.assertValue(v1); |
1501 |
|
}} |
1502 |
|
|
1503 |
|
/** |
1506 |
|
*/ |
1507 |
|
public void testThenAccept_exceptionalCompletion() { |
1508 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1466 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1509 |
|
{ |
1510 |
|
final CFException ex = new CFException(); |
1511 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1512 |
< |
final NoopConsumer r = new NoopConsumer(m); |
1513 |
< |
if (!createIncomplete) f.completeExceptionally(ex); |
1472 |
< |
final CompletableFuture<Void> g = m.thenAccept(f, r); |
1473 |
< |
if (createIncomplete) { |
1474 |
< |
checkIncomplete(g); |
1475 |
< |
f.completeExceptionally(ex); |
1476 |
< |
} |
1512 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1513 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1514 |
|
|
1515 |
< |
checkCompletedWithWrappedException(g, ex); |
1515 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1516 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1517 |
> |
assertTrue(f.completeExceptionally(ex)); |
1518 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1519 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1520 |
> |
|
1521 |
> |
checkCompletedWithWrappedException(h0, ex); |
1522 |
> |
checkCompletedWithWrappedException(h1, ex); |
1523 |
> |
checkCompletedWithWrappedException(h2, ex); |
1524 |
> |
checkCompletedWithWrappedException(h3, ex); |
1525 |
|
checkCompletedExceptionally(f, ex); |
1526 |
< |
r.assertNotInvoked(); |
1526 |
> |
for (NoopConsumer r : rs) r.assertNotInvoked(); |
1527 |
|
}} |
1528 |
|
|
1529 |
|
/** |
1531 |
|
*/ |
1532 |
|
public void testThenAccept_sourceCancelled() { |
1533 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1488 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1534 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1535 |
|
{ |
1536 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1537 |
< |
final NoopConsumer r = new NoopConsumer(m); |
1538 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1494 |
< |
final CompletableFuture<Void> g = m.thenAccept(f, r); |
1495 |
< |
if (createIncomplete) { |
1496 |
< |
checkIncomplete(g); |
1497 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1498 |
< |
} |
1537 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1538 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1539 |
|
|
1540 |
< |
checkCompletedWithWrappedCancellationException(g); |
1540 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1541 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1542 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1543 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1544 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1545 |
> |
|
1546 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1547 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1548 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1549 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1550 |
|
checkCancelled(f); |
1551 |
< |
r.assertNotInvoked(); |
1551 |
> |
for (NoopConsumer r : rs) r.assertNotInvoked(); |
1552 |
|
}} |
1553 |
|
|
1554 |
|
/** |
1556 |
|
*/ |
1557 |
|
public void testThenAccept_actionFailed() { |
1558 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1510 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1559 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1560 |
|
{ |
1561 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1562 |
< |
final FailingConsumer r = new FailingConsumer(m); |
1563 |
< |
if (!createIncomplete) f.complete(v1); |
1516 |
< |
final CompletableFuture<Void> g = m.thenAccept(f, r); |
1517 |
< |
if (createIncomplete) { |
1518 |
< |
checkIncomplete(g); |
1519 |
< |
f.complete(v1); |
1520 |
< |
} |
1562 |
> |
final FailingConsumer[] rs = new FailingConsumer[4]; |
1563 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingConsumer(m); |
1564 |
|
|
1565 |
< |
checkCompletedWithWrappedCFException(g); |
1565 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1566 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1567 |
> |
assertTrue(f.complete(v1)); |
1568 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1569 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1570 |
> |
|
1571 |
> |
checkCompletedWithWrappedCFException(h0); |
1572 |
> |
checkCompletedWithWrappedCFException(h1); |
1573 |
> |
checkCompletedWithWrappedCFException(h2); |
1574 |
> |
checkCompletedWithWrappedCFException(h3); |
1575 |
|
checkCompletedNormally(f, v1); |
1576 |
|
}} |
1577 |
|
|
1587 |
|
{ |
1588 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1589 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1590 |
< |
final SubtractFunction r1 = new SubtractFunction(m); |
1591 |
< |
final SubtractFunction r2 = new SubtractFunction(m); |
1540 |
< |
final SubtractFunction r3 = new SubtractFunction(m); |
1590 |
> |
final SubtractFunction[] rs = new SubtractFunction[6]; |
1591 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new SubtractFunction(m); |
1592 |
|
|
1593 |
|
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1594 |
|
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1595 |
|
final Integer w1 = fFirst ? v1 : v2; |
1596 |
|
final Integer w2 = !fFirst ? v1 : v2; |
1597 |
|
|
1598 |
< |
final CompletableFuture<Integer> h1 = m.thenCombine(f, g, r1); |
1598 |
> |
final CompletableFuture<Integer> h0 = m.thenCombine(f, g, rs[0]); |
1599 |
> |
final CompletableFuture<Integer> h1 = m.thenCombine(fst, fst, rs[1]); |
1600 |
|
assertTrue(fst.complete(w1)); |
1601 |
< |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, r2); |
1602 |
< |
checkIncomplete(h1); |
1603 |
< |
checkIncomplete(h2); |
1604 |
< |
r1.assertNotInvoked(); |
1605 |
< |
r2.assertNotInvoked(); |
1601 |
> |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, rs[2]); |
1602 |
> |
final CompletableFuture<Integer> h3 = m.thenCombine(fst, fst, rs[3]); |
1603 |
> |
checkIncomplete(h0); rs[0].assertNotInvoked(); |
1604 |
> |
checkIncomplete(h2); rs[2].assertNotInvoked(); |
1605 |
> |
checkCompletedNormally(h1, subtract(w1, w1)); |
1606 |
> |
checkCompletedNormally(h3, subtract(w1, w1)); |
1607 |
> |
rs[1].assertValue(subtract(w1, w1)); |
1608 |
> |
rs[3].assertValue(subtract(w1, w1)); |
1609 |
|
assertTrue(snd.complete(w2)); |
1610 |
< |
final CompletableFuture<Integer> h3 = m.thenCombine(f, g, r3); |
1610 |
> |
final CompletableFuture<Integer> h4 = m.thenCombine(f, g, rs[4]); |
1611 |
|
|
1612 |
< |
checkCompletedNormally(h1, subtract(v1, v2)); |
1612 |
> |
checkCompletedNormally(h0, subtract(v1, v2)); |
1613 |
|
checkCompletedNormally(h2, subtract(v1, v2)); |
1614 |
< |
checkCompletedNormally(h3, subtract(v1, v2)); |
1615 |
< |
r1.assertValue(subtract(v1, v2)); |
1616 |
< |
r2.assertValue(subtract(v1, v2)); |
1617 |
< |
r3.assertValue(subtract(v1, v2)); |
1614 |
> |
checkCompletedNormally(h4, subtract(v1, v2)); |
1615 |
> |
rs[0].assertValue(subtract(v1, v2)); |
1616 |
> |
rs[2].assertValue(subtract(v1, v2)); |
1617 |
> |
rs[4].assertValue(subtract(v1, v2)); |
1618 |
> |
|
1619 |
|
checkCompletedNormally(f, v1); |
1620 |
|
checkCompletedNormally(g, v2); |
1621 |
|
}} |
2962 |
|
checkCancelled(f); |
2963 |
|
}} |
2964 |
|
|
2965 |
+ |
/** |
2966 |
+ |
* thenCompose result completes exceptionally if the result of the action does |
2967 |
+ |
*/ |
2968 |
+ |
public void testThenCompose_actionReturnsFailingFuture() { |
2969 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
2970 |
+ |
for (int order = 0; order < 6; order++) |
2971 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
2972 |
+ |
{ |
2973 |
+ |
final CFException ex = new CFException(); |
2974 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2975 |
+ |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2976 |
+ |
final CompletableFuture<Integer> h; |
2977 |
+ |
// Test all permutations of orders |
2978 |
+ |
switch (order) { |
2979 |
+ |
case 0: |
2980 |
+ |
assertTrue(f.complete(v1)); |
2981 |
+ |
assertTrue(g.completeExceptionally(ex)); |
2982 |
+ |
h = m.thenCompose(f, (x -> g)); |
2983 |
+ |
break; |
2984 |
+ |
case 1: |
2985 |
+ |
assertTrue(f.complete(v1)); |
2986 |
+ |
h = m.thenCompose(f, (x -> g)); |
2987 |
+ |
assertTrue(g.completeExceptionally(ex)); |
2988 |
+ |
break; |
2989 |
+ |
case 2: |
2990 |
+ |
assertTrue(g.completeExceptionally(ex)); |
2991 |
+ |
assertTrue(f.complete(v1)); |
2992 |
+ |
h = m.thenCompose(f, (x -> g)); |
2993 |
+ |
break; |
2994 |
+ |
case 3: |
2995 |
+ |
assertTrue(g.completeExceptionally(ex)); |
2996 |
+ |
h = m.thenCompose(f, (x -> g)); |
2997 |
+ |
assertTrue(f.complete(v1)); |
2998 |
+ |
break; |
2999 |
+ |
case 4: |
3000 |
+ |
h = m.thenCompose(f, (x -> g)); |
3001 |
+ |
assertTrue(f.complete(v1)); |
3002 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3003 |
+ |
break; |
3004 |
+ |
case 5: |
3005 |
+ |
h = m.thenCompose(f, (x -> g)); |
3006 |
+ |
assertTrue(f.complete(v1)); |
3007 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3008 |
+ |
break; |
3009 |
+ |
default: throw new AssertionError(); |
3010 |
+ |
} |
3011 |
+ |
|
3012 |
+ |
checkCompletedExceptionally(g, ex); |
3013 |
+ |
checkCompletedWithWrappedException(h, ex); |
3014 |
+ |
checkCompletedNormally(f, v1); |
3015 |
+ |
}} |
3016 |
+ |
|
3017 |
|
// other static methods |
3018 |
|
|
3019 |
|
/** |
3074 |
|
for (int i = 0; i < k; i++) { |
3075 |
|
checkIncomplete(f); |
3076 |
|
checkIncomplete(CompletableFuture.allOf(fs)); |
3077 |
< |
if (i != k/2) { |
3077 |
> |
if (i != k / 2) { |
3078 |
|
fs[i].complete(i); |
3079 |
|
checkCompletedNormally(fs[i], i); |
3080 |
|
} else { |
3181 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3182 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3183 |
|
CompletableFuture<Integer> nullFuture = (CompletableFuture<Integer>)null; |
3076 |
– |
CompletableFuture<?> h; |
3184 |
|
ThreadExecutor exec = new ThreadExecutor(); |
3185 |
|
|
3186 |
|
Runnable[] throwingActions = { |
3187 |
|
() -> CompletableFuture.supplyAsync(null), |
3188 |
|
() -> CompletableFuture.supplyAsync(null, exec), |
3189 |
< |
() -> CompletableFuture.supplyAsync(new IntegerSupplier(ExecutionMode.DEFAULT, 42), null), |
3189 |
> |
() -> CompletableFuture.supplyAsync(new IntegerSupplier(ExecutionMode.SYNC, 42), null), |
3190 |
|
|
3191 |
|
() -> CompletableFuture.runAsync(null), |
3192 |
|
() -> CompletableFuture.runAsync(null, exec), |
3277 |
|
() -> CompletableFuture.anyOf(null, f), |
3278 |
|
|
3279 |
|
() -> f.obtrudeException(null), |
3280 |
+ |
|
3281 |
+ |
() -> CompletableFuture.delayedExecutor(1L, SECONDS, null), |
3282 |
+ |
() -> CompletableFuture.delayedExecutor(1L, null, new ThreadExecutor()), |
3283 |
+ |
() -> CompletableFuture.delayedExecutor(1L, null), |
3284 |
+ |
|
3285 |
+ |
() -> f.orTimeout(1L, null), |
3286 |
+ |
() -> f.completeOnTimeout(42, 1L, null), |
3287 |
+ |
|
3288 |
+ |
() -> CompletableFuture.failedFuture(null), |
3289 |
+ |
() -> CompletableFuture.failedStage(null), |
3290 |
|
}; |
3291 |
|
|
3292 |
|
assertThrows(NullPointerException.class, throwingActions); |
3301 |
|
assertSame(f, f.toCompletableFuture()); |
3302 |
|
} |
3303 |
|
|
3304 |
+ |
// jdk9 |
3305 |
+ |
|
3306 |
+ |
/** |
3307 |
+ |
* newIncompleteFuture returns an incomplete CompletableFuture |
3308 |
+ |
*/ |
3309 |
+ |
public void testNewIncompleteFuture() { |
3310 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3311 |
+ |
{ |
3312 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3313 |
+ |
CompletableFuture<Integer> g = f.newIncompleteFuture(); |
3314 |
+ |
checkIncomplete(f); |
3315 |
+ |
checkIncomplete(g); |
3316 |
+ |
f.complete(v1); |
3317 |
+ |
checkCompletedNormally(f, v1); |
3318 |
+ |
checkIncomplete(g); |
3319 |
+ |
g.complete(v1); |
3320 |
+ |
checkCompletedNormally(g, v1); |
3321 |
+ |
assertSame(g.getClass(), CompletableFuture.class); |
3322 |
+ |
}} |
3323 |
+ |
|
3324 |
+ |
/** |
3325 |
+ |
* completedStage returns a completed CompletionStage |
3326 |
+ |
*/ |
3327 |
+ |
public void testCompletedStage() { |
3328 |
+ |
AtomicInteger x = new AtomicInteger(0); |
3329 |
+ |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3330 |
+ |
CompletionStage<Integer> f = CompletableFuture.completedStage(1); |
3331 |
+ |
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3332 |
+ |
assertEquals(x.get(), 1); |
3333 |
+ |
assertNull(r.get()); |
3334 |
+ |
} |
3335 |
+ |
|
3336 |
+ |
/** |
3337 |
+ |
* defaultExecutor by default returns the commonPool if |
3338 |
+ |
* it supports more than one thread. |
3339 |
+ |
*/ |
3340 |
+ |
public void testDefaultExecutor() { |
3341 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3342 |
+ |
Executor e = f.defaultExecutor(); |
3343 |
+ |
Executor c = ForkJoinPool.commonPool(); |
3344 |
+ |
if (ForkJoinPool.getCommonPoolParallelism() > 1) |
3345 |
+ |
assertSame(e, c); |
3346 |
+ |
else |
3347 |
+ |
assertNotSame(e, c); |
3348 |
+ |
} |
3349 |
+ |
|
3350 |
+ |
/** |
3351 |
+ |
* failedFuture returns a CompletableFuture completed |
3352 |
+ |
* exceptionally with the given Exception |
3353 |
+ |
*/ |
3354 |
+ |
public void testFailedFuture() { |
3355 |
+ |
CFException ex = new CFException(); |
3356 |
+ |
CompletableFuture<Integer> f = CompletableFuture.failedFuture(ex); |
3357 |
+ |
checkCompletedExceptionally(f, ex); |
3358 |
+ |
} |
3359 |
+ |
|
3360 |
+ |
/** |
3361 |
+ |
* failedFuture(null) throws NPE |
3362 |
+ |
*/ |
3363 |
+ |
public void testFailedFuture_null() { |
3364 |
+ |
try { |
3365 |
+ |
CompletableFuture<Integer> f = CompletableFuture.failedFuture(null); |
3366 |
+ |
shouldThrow(); |
3367 |
+ |
} catch (NullPointerException success) {} |
3368 |
+ |
} |
3369 |
+ |
|
3370 |
+ |
/** |
3371 |
+ |
* copy returns a CompletableFuture that is completed normally, |
3372 |
+ |
* with the same value, when source is. |
3373 |
+ |
*/ |
3374 |
+ |
public void testCopy() { |
3375 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3376 |
+ |
CompletableFuture<Integer> g = f.copy(); |
3377 |
+ |
checkIncomplete(f); |
3378 |
+ |
checkIncomplete(g); |
3379 |
+ |
f.complete(1); |
3380 |
+ |
checkCompletedNormally(f, 1); |
3381 |
+ |
checkCompletedNormally(g, 1); |
3382 |
+ |
} |
3383 |
+ |
|
3384 |
+ |
/** |
3385 |
+ |
* copy returns a CompletableFuture that is completed exceptionally |
3386 |
+ |
* when source is. |
3387 |
+ |
*/ |
3388 |
+ |
public void testCopy2() { |
3389 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3390 |
+ |
CompletableFuture<Integer> g = f.copy(); |
3391 |
+ |
checkIncomplete(f); |
3392 |
+ |
checkIncomplete(g); |
3393 |
+ |
CFException ex = new CFException(); |
3394 |
+ |
f.completeExceptionally(ex); |
3395 |
+ |
checkCompletedExceptionally(f, ex); |
3396 |
+ |
checkCompletedWithWrappedException(g, ex); |
3397 |
+ |
} |
3398 |
+ |
|
3399 |
+ |
/** |
3400 |
+ |
* minimalCompletionStage returns a CompletableFuture that is |
3401 |
+ |
* completed normally, with the same value, when source is. |
3402 |
+ |
*/ |
3403 |
+ |
public void testMinimalCompletionStage() { |
3404 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3405 |
+ |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3406 |
+ |
AtomicInteger x = new AtomicInteger(0); |
3407 |
+ |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3408 |
+ |
checkIncomplete(f); |
3409 |
+ |
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3410 |
+ |
f.complete(1); |
3411 |
+ |
checkCompletedNormally(f, 1); |
3412 |
+ |
assertEquals(x.get(), 1); |
3413 |
+ |
assertNull(r.get()); |
3414 |
+ |
} |
3415 |
+ |
|
3416 |
+ |
/** |
3417 |
+ |
* minimalCompletionStage returns a CompletableFuture that is |
3418 |
+ |
* completed exceptionally when source is. |
3419 |
+ |
*/ |
3420 |
+ |
public void testMinimalCompletionStage2() { |
3421 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3422 |
+ |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3423 |
+ |
AtomicInteger x = new AtomicInteger(0); |
3424 |
+ |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3425 |
+ |
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3426 |
+ |
checkIncomplete(f); |
3427 |
+ |
CFException ex = new CFException(); |
3428 |
+ |
f.completeExceptionally(ex); |
3429 |
+ |
checkCompletedExceptionally(f, ex); |
3430 |
+ |
assertEquals(x.get(), 0); |
3431 |
+ |
assertEquals(r.get().getCause(), ex); |
3432 |
+ |
} |
3433 |
+ |
|
3434 |
+ |
/** |
3435 |
+ |
* failedStage returns a CompletionStage completed |
3436 |
+ |
* exceptionally with the given Exception |
3437 |
+ |
*/ |
3438 |
+ |
public void testFailedStage() { |
3439 |
+ |
CFException ex = new CFException(); |
3440 |
+ |
CompletionStage<Integer> f = CompletableFuture.failedStage(ex); |
3441 |
+ |
AtomicInteger x = new AtomicInteger(0); |
3442 |
+ |
AtomicReference<Throwable> r = new AtomicReference<Throwable>(); |
3443 |
+ |
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3444 |
+ |
assertEquals(x.get(), 0); |
3445 |
+ |
assertEquals(r.get(), ex); |
3446 |
+ |
} |
3447 |
+ |
|
3448 |
+ |
/** |
3449 |
+ |
* completeAsync completes with value of given supplier |
3450 |
+ |
*/ |
3451 |
+ |
public void testCompleteAsync() { |
3452 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3453 |
+ |
{ |
3454 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3455 |
+ |
f.completeAsync(() -> v1); |
3456 |
+ |
f.join(); |
3457 |
+ |
checkCompletedNormally(f, v1); |
3458 |
+ |
}} |
3459 |
+ |
|
3460 |
+ |
/** |
3461 |
+ |
* completeAsync completes exceptionally if given supplier throws |
3462 |
+ |
*/ |
3463 |
+ |
public void testCompleteAsync2() { |
3464 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3465 |
+ |
CFException ex = new CFException(); |
3466 |
+ |
f.completeAsync(() -> {if (true) throw ex; return 1;}); |
3467 |
+ |
try { |
3468 |
+ |
f.join(); |
3469 |
+ |
shouldThrow(); |
3470 |
+ |
} catch (CompletionException success) {} |
3471 |
+ |
checkCompletedWithWrappedException(f, ex); |
3472 |
+ |
} |
3473 |
+ |
|
3474 |
+ |
/** |
3475 |
+ |
* completeAsync with given executor completes with value of given supplier |
3476 |
+ |
*/ |
3477 |
+ |
public void testCompleteAsync3() { |
3478 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3479 |
+ |
{ |
3480 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3481 |
+ |
ThreadExecutor executor = new ThreadExecutor(); |
3482 |
+ |
f.completeAsync(() -> v1, executor); |
3483 |
+ |
assertSame(v1, f.join()); |
3484 |
+ |
checkCompletedNormally(f, v1); |
3485 |
+ |
assertEquals(1, executor.count.get()); |
3486 |
+ |
}} |
3487 |
+ |
|
3488 |
+ |
/** |
3489 |
+ |
* completeAsync with given executor completes exceptionally if |
3490 |
+ |
* given supplier throws |
3491 |
+ |
*/ |
3492 |
+ |
public void testCompleteAsync4() { |
3493 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3494 |
+ |
CFException ex = new CFException(); |
3495 |
+ |
ThreadExecutor executor = new ThreadExecutor(); |
3496 |
+ |
f.completeAsync(() -> {if (true) throw ex; return 1;}, executor); |
3497 |
+ |
try { |
3498 |
+ |
f.join(); |
3499 |
+ |
shouldThrow(); |
3500 |
+ |
} catch (CompletionException success) {} |
3501 |
+ |
checkCompletedWithWrappedException(f, ex); |
3502 |
+ |
assertEquals(1, executor.count.get()); |
3503 |
+ |
} |
3504 |
+ |
|
3505 |
+ |
/** |
3506 |
+ |
* orTimeout completes with TimeoutException if not complete |
3507 |
+ |
*/ |
3508 |
+ |
public void testOrTimeout_timesOut() { |
3509 |
+ |
long timeoutMillis = timeoutMillis(); |
3510 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3511 |
+ |
long startTime = System.nanoTime(); |
3512 |
+ |
f.orTimeout(timeoutMillis, MILLISECONDS); |
3513 |
+ |
checkCompletedWithTimeoutException(f); |
3514 |
+ |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
3515 |
+ |
} |
3516 |
+ |
|
3517 |
+ |
/** |
3518 |
+ |
* orTimeout completes normally if completed before timeout |
3519 |
+ |
*/ |
3520 |
+ |
public void testOrTimeout_completed() { |
3521 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3522 |
+ |
{ |
3523 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3524 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3525 |
+ |
long startTime = System.nanoTime(); |
3526 |
+ |
f.complete(v1); |
3527 |
+ |
f.orTimeout(LONG_DELAY_MS, MILLISECONDS); |
3528 |
+ |
g.orTimeout(LONG_DELAY_MS, MILLISECONDS); |
3529 |
+ |
g.complete(v1); |
3530 |
+ |
checkCompletedNormally(f, v1); |
3531 |
+ |
checkCompletedNormally(g, v1); |
3532 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
3533 |
+ |
}} |
3534 |
+ |
|
3535 |
+ |
/** |
3536 |
+ |
* completeOnTimeout completes with given value if not complete |
3537 |
+ |
*/ |
3538 |
+ |
public void testCompleteOnTimeout_timesOut() { |
3539 |
+ |
testInParallel(() -> testCompleteOnTimeout_timesOut(42), |
3540 |
+ |
() -> testCompleteOnTimeout_timesOut(null)); |
3541 |
+ |
} |
3542 |
+ |
|
3543 |
+ |
public void testCompleteOnTimeout_timesOut(Integer v) { |
3544 |
+ |
long timeoutMillis = timeoutMillis(); |
3545 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3546 |
+ |
long startTime = System.nanoTime(); |
3547 |
+ |
f.completeOnTimeout(v, timeoutMillis, MILLISECONDS); |
3548 |
+ |
assertSame(v, f.join()); |
3549 |
+ |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
3550 |
+ |
f.complete(99); // should have no effect |
3551 |
+ |
checkCompletedNormally(f, v); |
3552 |
+ |
} |
3553 |
+ |
|
3554 |
+ |
/** |
3555 |
+ |
* completeOnTimeout has no effect if completed within timeout |
3556 |
+ |
*/ |
3557 |
+ |
public void testCompleteOnTimeout_completed() { |
3558 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3559 |
+ |
{ |
3560 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3561 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3562 |
+ |
long startTime = System.nanoTime(); |
3563 |
+ |
f.complete(v1); |
3564 |
+ |
f.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS); |
3565 |
+ |
g.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS); |
3566 |
+ |
g.complete(v1); |
3567 |
+ |
checkCompletedNormally(f, v1); |
3568 |
+ |
checkCompletedNormally(g, v1); |
3569 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
3570 |
+ |
}} |
3571 |
+ |
|
3572 |
+ |
/** |
3573 |
+ |
* delayedExecutor returns an executor that delays submission |
3574 |
+ |
*/ |
3575 |
+ |
public void testDelayedExecutor() { |
3576 |
+ |
testInParallel(() -> testDelayedExecutor(null, null), |
3577 |
+ |
() -> testDelayedExecutor(null, 1), |
3578 |
+ |
() -> testDelayedExecutor(new ThreadExecutor(), 1), |
3579 |
+ |
() -> testDelayedExecutor(new ThreadExecutor(), 1)); |
3580 |
+ |
} |
3581 |
+ |
|
3582 |
+ |
public void testDelayedExecutor(Executor executor, Integer v) throws Exception { |
3583 |
+ |
long timeoutMillis = timeoutMillis(); |
3584 |
+ |
// Use an "unreasonably long" long timeout to catch lingering threads |
3585 |
+ |
long longTimeoutMillis = 1000 * 60 * 60 * 24; |
3586 |
+ |
final Executor delayer, longDelayer; |
3587 |
+ |
if (executor == null) { |
3588 |
+ |
delayer = CompletableFuture.delayedExecutor(timeoutMillis, MILLISECONDS); |
3589 |
+ |
longDelayer = CompletableFuture.delayedExecutor(longTimeoutMillis, MILLISECONDS); |
3590 |
+ |
} else { |
3591 |
+ |
delayer = CompletableFuture.delayedExecutor(timeoutMillis, MILLISECONDS, executor); |
3592 |
+ |
longDelayer = CompletableFuture.delayedExecutor(longTimeoutMillis, MILLISECONDS, executor); |
3593 |
+ |
} |
3594 |
+ |
long startTime = System.nanoTime(); |
3595 |
+ |
CompletableFuture<Integer> f = |
3596 |
+ |
CompletableFuture.supplyAsync(() -> v, delayer); |
3597 |
+ |
CompletableFuture<Integer> g = |
3598 |
+ |
CompletableFuture.supplyAsync(() -> v, longDelayer); |
3599 |
+ |
|
3600 |
+ |
assertNull(g.getNow(null)); |
3601 |
+ |
|
3602 |
+ |
assertSame(v, f.get(LONG_DELAY_MS, MILLISECONDS)); |
3603 |
+ |
long millisElapsed = millisElapsedSince(startTime); |
3604 |
+ |
assertTrue(millisElapsed >= timeoutMillis); |
3605 |
+ |
assertTrue(millisElapsed < LONG_DELAY_MS / 2); |
3606 |
+ |
|
3607 |
+ |
checkCompletedNormally(f, v); |
3608 |
+ |
|
3609 |
+ |
checkIncomplete(g); |
3610 |
+ |
assertTrue(g.cancel(true)); |
3611 |
+ |
} |
3612 |
+ |
|
3613 |
|
//--- tests of implementation details; not part of official tck --- |
3614 |
|
|
3615 |
|
Object resultOf(CompletableFuture<?> f) { |
3700 |
|
} |
3701 |
|
}} |
3702 |
|
|
3703 |
+ |
/** |
3704 |
+ |
* Minimal completion stages throw UOE for all non-CompletionStage methods |
3705 |
+ |
*/ |
3706 |
+ |
public void testMinimalCompletionStage_minimality() { |
3707 |
+ |
if (!testImplementationDetails) return; |
3708 |
+ |
Function<Method, String> toSignature = |
3709 |
+ |
(method) -> method.getName() + Arrays.toString(method.getParameterTypes()); |
3710 |
+ |
Predicate<Method> isNotStatic = |
3711 |
+ |
(method) -> (method.getModifiers() & Modifier.STATIC) == 0; |
3712 |
+ |
List<Method> minimalMethods = |
3713 |
+ |
Stream.of(Object.class, CompletionStage.class) |
3714 |
+ |
.flatMap((klazz) -> Stream.of(klazz.getMethods())) |
3715 |
+ |
.filter(isNotStatic) |
3716 |
+ |
.collect(Collectors.toList()); |
3717 |
+ |
// Methods from CompletableFuture permitted NOT to throw UOE |
3718 |
+ |
String[] signatureWhitelist = { |
3719 |
+ |
"newIncompleteFuture[]", |
3720 |
+ |
"defaultExecutor[]", |
3721 |
+ |
"minimalCompletionStage[]", |
3722 |
+ |
"copy[]", |
3723 |
+ |
}; |
3724 |
+ |
Set<String> permittedMethodSignatures = |
3725 |
+ |
Stream.concat(minimalMethods.stream().map(toSignature), |
3726 |
+ |
Stream.of(signatureWhitelist)) |
3727 |
+ |
.collect(Collectors.toSet()); |
3728 |
+ |
List<Method> allMethods = Stream.of(CompletableFuture.class.getMethods()) |
3729 |
+ |
.filter(isNotStatic) |
3730 |
+ |
.filter((method) -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
3731 |
+ |
.collect(Collectors.toList()); |
3732 |
+ |
|
3733 |
+ |
CompletionStage<Integer> minimalStage = |
3734 |
+ |
new CompletableFuture<Integer>().minimalCompletionStage(); |
3735 |
+ |
|
3736 |
+ |
List<Method> bugs = new ArrayList<>(); |
3737 |
+ |
for (Method method : allMethods) { |
3738 |
+ |
Class<?>[] parameterTypes = method.getParameterTypes(); |
3739 |
+ |
Object[] args = new Object[parameterTypes.length]; |
3740 |
+ |
// Manufacture boxed primitives for primitive params |
3741 |
+ |
for (int i = 0; i < args.length; i++) { |
3742 |
+ |
Class<?> type = parameterTypes[i]; |
3743 |
+ |
if (parameterTypes[i] == boolean.class) |
3744 |
+ |
args[i] = false; |
3745 |
+ |
else if (parameterTypes[i] == int.class) |
3746 |
+ |
args[i] = 0; |
3747 |
+ |
else if (parameterTypes[i] == long.class) |
3748 |
+ |
args[i] = 0L; |
3749 |
+ |
} |
3750 |
+ |
try { |
3751 |
+ |
method.invoke(minimalStage, args); |
3752 |
+ |
bugs.add(method); |
3753 |
+ |
} |
3754 |
+ |
catch (java.lang.reflect.InvocationTargetException expected) { |
3755 |
+ |
if (! (expected.getCause() instanceof UnsupportedOperationException)) { |
3756 |
+ |
bugs.add(method); |
3757 |
+ |
// expected.getCause().printStackTrace(); |
3758 |
+ |
} |
3759 |
+ |
} |
3760 |
+ |
catch (ReflectiveOperationException bad) { throw new Error(bad); } |
3761 |
+ |
} |
3762 |
+ |
if (!bugs.isEmpty()) |
3763 |
+ |
throw new Error("Methods did not throw UOE: " + bugs.toString()); |
3764 |
+ |
} |
3765 |
+ |
|
3766 |
+ |
static class Monad { |
3767 |
+ |
static class MonadError extends Error { |
3768 |
+ |
public MonadError() { super("monadic zero"); } |
3769 |
+ |
} |
3770 |
+ |
// "return", "unit" |
3771 |
+ |
static <T> CompletableFuture<T> unit(T value) { |
3772 |
+ |
return completedFuture(value); |
3773 |
+ |
} |
3774 |
+ |
// monadic zero ? |
3775 |
+ |
static <T> CompletableFuture<T> zero() { |
3776 |
+ |
return failedFuture(new MonadError()); |
3777 |
+ |
} |
3778 |
+ |
// >=> |
3779 |
+ |
static <T,U,V> Function<T, CompletableFuture<V>> compose |
3780 |
+ |
(Function<T, CompletableFuture<U>> f, |
3781 |
+ |
Function<U, CompletableFuture<V>> g) { |
3782 |
+ |
return (x) -> f.apply(x).thenCompose(g); |
3783 |
+ |
} |
3784 |
+ |
|
3785 |
+ |
static void assertZero(CompletableFuture<?> f) { |
3786 |
+ |
try { |
3787 |
+ |
f.getNow(null); |
3788 |
+ |
throw new AssertionFailedError("should throw"); |
3789 |
+ |
} catch (CompletionException success) { |
3790 |
+ |
assertTrue(success.getCause() instanceof MonadError); |
3791 |
+ |
} |
3792 |
+ |
} |
3793 |
+ |
|
3794 |
+ |
static <T> void assertFutureEquals(CompletableFuture<T> f, |
3795 |
+ |
CompletableFuture<T> g) { |
3796 |
+ |
T fval = null, gval = null; |
3797 |
+ |
Throwable fex = null, gex = null; |
3798 |
+ |
|
3799 |
+ |
try { fval = f.get(); } |
3800 |
+ |
catch (ExecutionException ex) { fex = ex.getCause(); } |
3801 |
+ |
catch (Throwable ex) { fex = ex; } |
3802 |
+ |
|
3803 |
+ |
try { gval = g.get(); } |
3804 |
+ |
catch (ExecutionException ex) { gex = ex.getCause(); } |
3805 |
+ |
catch (Throwable ex) { gex = ex; } |
3806 |
+ |
|
3807 |
+ |
if (fex != null || gex != null) |
3808 |
+ |
assertSame(fex.getClass(), gex.getClass()); |
3809 |
+ |
else |
3810 |
+ |
assertEquals(fval, gval); |
3811 |
+ |
} |
3812 |
+ |
|
3813 |
+ |
static class PlusFuture<T> extends CompletableFuture<T> { |
3814 |
+ |
AtomicReference<Throwable> firstFailure = new AtomicReference<>(null); |
3815 |
+ |
} |
3816 |
+ |
|
3817 |
+ |
// Monadic "plus" |
3818 |
+ |
static <T> CompletableFuture<T> plus(CompletableFuture<? extends T> f, |
3819 |
+ |
CompletableFuture<? extends T> g) { |
3820 |
+ |
PlusFuture<T> plus = new PlusFuture<T>(); |
3821 |
+ |
BiConsumer<T, Throwable> action = (T result, Throwable ex) -> { |
3822 |
+ |
if (ex == null) { |
3823 |
+ |
if (plus.complete(result)) |
3824 |
+ |
if (plus.firstFailure.get() != null) |
3825 |
+ |
plus.firstFailure.set(null); |
3826 |
+ |
} |
3827 |
+ |
else if (plus.firstFailure.compareAndSet(null, ex)) { |
3828 |
+ |
if (plus.isDone()) |
3829 |
+ |
plus.firstFailure.set(null); |
3830 |
+ |
} else { |
3831 |
+ |
// prefer failing with first failure |
3832 |
+ |
plus.completeExceptionally(plus.firstFailure.getAndSet(null)); |
3833 |
+ |
} |
3834 |
+ |
}; |
3835 |
+ |
f.whenComplete(action); |
3836 |
+ |
g.whenComplete(action); |
3837 |
+ |
return plus; |
3838 |
+ |
} |
3839 |
+ |
} |
3840 |
+ |
|
3841 |
+ |
/** |
3842 |
+ |
* CompletableFuture is an additive monad - sort of. |
3843 |
+ |
* https://en.wikipedia.org/wiki/Monad_(functional_programming)#Additive_monads |
3844 |
+ |
*/ |
3845 |
+ |
public void testAdditiveMonad() throws Throwable { |
3846 |
+ |
Function<Long, CompletableFuture<Long>> unit = Monad::unit; |
3847 |
+ |
CompletableFuture<Long> zero = Monad.zero(); |
3848 |
+ |
|
3849 |
+ |
// Some mutually non-commutative functions |
3850 |
+ |
Function<Long, CompletableFuture<Long>> triple |
3851 |
+ |
= (x) -> Monad.unit(3 * x); |
3852 |
+ |
Function<Long, CompletableFuture<Long>> inc |
3853 |
+ |
= (x) -> Monad.unit(x + 1); |
3854 |
+ |
|
3855 |
+ |
// unit is a right identity: m >>= unit === m |
3856 |
+ |
Monad.assertFutureEquals(inc.apply(5L).thenCompose(unit), |
3857 |
+ |
inc.apply(5L)); |
3858 |
+ |
// unit is a left identity: (unit x) >>= f === f x |
3859 |
+ |
Monad.assertFutureEquals(unit.apply(5L).thenCompose(inc), |
3860 |
+ |
inc.apply(5L)); |
3861 |
+ |
|
3862 |
+ |
// associativity: (m >>= f) >>= g === m >>= ( \x -> (f x >>= g) ) |
3863 |
+ |
Monad.assertFutureEquals( |
3864 |
+ |
unit.apply(5L).thenCompose(inc).thenCompose(triple), |
3865 |
+ |
unit.apply(5L).thenCompose((x) -> inc.apply(x).thenCompose(triple))); |
3866 |
+ |
|
3867 |
+ |
// The case for CompletableFuture as an additive monad is weaker... |
3868 |
+ |
|
3869 |
+ |
// zero is a monadic zero |
3870 |
+ |
Monad.assertZero(zero); |
3871 |
+ |
|
3872 |
+ |
// left zero: zero >>= f === zero |
3873 |
+ |
Monad.assertZero(zero.thenCompose(inc)); |
3874 |
+ |
// right zero: f >>= (\x -> zero) === zero |
3875 |
+ |
Monad.assertZero(inc.apply(5L).thenCompose((x) -> zero)); |
3876 |
+ |
|
3877 |
+ |
// f plus zero === f |
3878 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
3879 |
+ |
Monad.plus(Monad.unit(5L), zero)); |
3880 |
+ |
// zero plus f === f |
3881 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
3882 |
+ |
Monad.plus(zero, Monad.unit(5L))); |
3883 |
+ |
// zero plus zero === zero |
3884 |
+ |
Monad.assertZero(Monad.plus(zero, zero)); |
3885 |
+ |
{ |
3886 |
+ |
CompletableFuture<Long> f = Monad.plus(Monad.unit(5L), |
3887 |
+ |
Monad.unit(8L)); |
3888 |
+ |
// non-determinism |
3889 |
+ |
assertTrue(f.get() == 5L || f.get() == 8L); |
3890 |
+ |
} |
3891 |
+ |
|
3892 |
+ |
CompletableFuture<Long> godot = new CompletableFuture<>(); |
3893 |
+ |
// f plus godot === f (doesn't wait for godot) |
3894 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
3895 |
+ |
Monad.plus(Monad.unit(5L), godot)); |
3896 |
+ |
// godot plus f === f (doesn't wait for godot) |
3897 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
3898 |
+ |
Monad.plus(godot, Monad.unit(5L))); |
3899 |
+ |
} |
3900 |
+ |
|
3901 |
+ |
// static <U> U join(CompletionStage<U> stage) { |
3902 |
+ |
// CompletableFuture<U> f = new CompletableFuture<>(); |
3903 |
+ |
// stage.whenComplete((v, ex) -> { |
3904 |
+ |
// if (ex != null) f.completeExceptionally(ex); else f.complete(v); |
3905 |
+ |
// }); |
3906 |
+ |
// return f.join(); |
3907 |
+ |
// } |
3908 |
+ |
|
3909 |
+ |
// static <U> boolean isDone(CompletionStage<U> stage) { |
3910 |
+ |
// CompletableFuture<U> f = new CompletableFuture<>(); |
3911 |
+ |
// stage.whenComplete((v, ex) -> { |
3912 |
+ |
// if (ex != null) f.completeExceptionally(ex); else f.complete(v); |
3913 |
+ |
// }); |
3914 |
+ |
// return f.isDone(); |
3915 |
+ |
// } |
3916 |
+ |
|
3917 |
+ |
// static <U> U join2(CompletionStage<U> stage) { |
3918 |
+ |
// return stage.toCompletableFuture().copy().join(); |
3919 |
+ |
// } |
3920 |
+ |
|
3921 |
+ |
// static <U> boolean isDone2(CompletionStage<U> stage) { |
3922 |
+ |
// return stage.toCompletableFuture().copy().isDone(); |
3923 |
+ |
// } |
3924 |
+ |
|
3925 |
|
} |