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 |
> |
|
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.List; |
13 |
> |
import java.util.Objects; |
14 |
|
import java.util.concurrent.Callable; |
10 |
– |
import java.util.concurrent.Executor; |
11 |
– |
import java.util.concurrent.ExecutorService; |
12 |
– |
import java.util.concurrent.Executors; |
15 |
|
import java.util.concurrent.CancellationException; |
14 |
– |
import java.util.concurrent.CountDownLatch; |
15 |
– |
import java.util.concurrent.ExecutionException; |
16 |
– |
import java.util.concurrent.Future; |
16 |
|
import java.util.concurrent.CompletableFuture; |
17 |
|
import java.util.concurrent.CompletionException; |
18 |
|
import java.util.concurrent.CompletionStage; |
19 |
+ |
import java.util.concurrent.ExecutionException; |
20 |
+ |
import java.util.concurrent.Executor; |
21 |
|
import java.util.concurrent.ForkJoinPool; |
22 |
|
import java.util.concurrent.ForkJoinTask; |
23 |
|
import java.util.concurrent.TimeoutException; |
24 |
|
import java.util.concurrent.atomic.AtomicInteger; |
24 |
– |
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; |
25 |
|
import java.util.function.BiConsumer; |
30 |
– |
import java.util.function.Function; |
26 |
|
import java.util.function.BiFunction; |
27 |
+ |
import java.util.function.Consumer; |
28 |
+ |
import java.util.function.Function; |
29 |
+ |
import java.util.function.Supplier; |
30 |
+ |
|
31 |
+ |
import junit.framework.Test; |
32 |
+ |
import junit.framework.TestSuite; |
33 |
|
|
34 |
|
public class CompletableFutureTest extends JSR166TestCase { |
35 |
|
|
58 |
|
} |
59 |
|
|
60 |
|
<T> void checkCompletedNormally(CompletableFuture<T> f, T value) { |
61 |
< |
try { |
62 |
< |
assertEquals(value, f.get(LONG_DELAY_MS, MILLISECONDS)); |
62 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
61 |
> |
checkTimedGet(f, value); |
62 |
> |
|
63 |
|
try { |
64 |
|
assertEquals(value, f.join()); |
65 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
76 |
|
} |
77 |
|
|
78 |
|
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
79 |
+ |
long startTime = System.nanoTime(); |
80 |
+ |
long timeoutMillis = LONG_DELAY_MS; |
81 |
|
try { |
82 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
82 |
> |
f.get(timeoutMillis, MILLISECONDS); |
83 |
|
shouldThrow(); |
84 |
|
} catch (ExecutionException success) { |
85 |
|
assertTrue(success.getCause() instanceof CFException); |
86 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
87 |
+ |
assertTrue(millisElapsedSince(startTime) < timeoutMillis/2); |
88 |
+ |
|
89 |
|
try { |
90 |
|
f.join(); |
91 |
|
shouldThrow(); |
111 |
|
|
112 |
|
<U> void checkCompletedExceptionallyWithRootCause(CompletableFuture<U> f, |
113 |
|
Throwable ex) { |
114 |
+ |
long startTime = System.nanoTime(); |
115 |
+ |
long timeoutMillis = LONG_DELAY_MS; |
116 |
|
try { |
117 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
117 |
> |
f.get(timeoutMillis, MILLISECONDS); |
118 |
|
shouldThrow(); |
119 |
|
} catch (ExecutionException success) { |
120 |
|
assertSame(ex, success.getCause()); |
121 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
122 |
+ |
assertTrue(millisElapsedSince(startTime) < timeoutMillis/2); |
123 |
+ |
|
124 |
|
try { |
125 |
|
f.join(); |
126 |
|
shouldThrow(); |
166 |
|
} |
167 |
|
|
168 |
|
void checkCancelled(CompletableFuture<?> f) { |
169 |
+ |
long startTime = System.nanoTime(); |
170 |
+ |
long timeoutMillis = LONG_DELAY_MS; |
171 |
|
try { |
172 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
172 |
> |
f.get(timeoutMillis, MILLISECONDS); |
173 |
|
shouldThrow(); |
174 |
|
} catch (CancellationException success) { |
175 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
176 |
+ |
assertTrue(millisElapsedSince(startTime) < timeoutMillis/2); |
177 |
+ |
|
178 |
|
try { |
179 |
|
f.join(); |
180 |
|
shouldThrow(); |
195 |
|
} |
196 |
|
|
197 |
|
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
198 |
+ |
long startTime = System.nanoTime(); |
199 |
+ |
long timeoutMillis = LONG_DELAY_MS; |
200 |
|
try { |
201 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
201 |
> |
f.get(timeoutMillis, MILLISECONDS); |
202 |
|
shouldThrow(); |
203 |
|
} catch (ExecutionException success) { |
204 |
|
assertTrue(success.getCause() instanceof CancellationException); |
205 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
206 |
+ |
assertTrue(millisElapsedSince(startTime) < timeoutMillis/2); |
207 |
+ |
|
208 |
|
try { |
209 |
|
f.join(); |
210 |
|
shouldThrow(); |
585 |
|
} |
586 |
|
} |
587 |
|
|
588 |
+ |
static final boolean defaultExecutorIsCommonPool |
589 |
+ |
= ForkJoinPool.getCommonPoolParallelism() > 1; |
590 |
+ |
|
591 |
|
/** |
592 |
|
* Permits the testing of parallel code for the 3 different |
593 |
|
* execution modes without copy/pasting all the test methods. |
594 |
|
*/ |
595 |
|
enum ExecutionMode { |
596 |
< |
DEFAULT { |
596 |
> |
SYNC { |
597 |
|
public void checkExecutionMode() { |
598 |
|
assertFalse(ThreadExecutor.startedCurrentThread()); |
599 |
|
assertNull(ForkJoinTask.getPool()); |
669 |
|
|
670 |
|
ASYNC { |
671 |
|
public void checkExecutionMode() { |
672 |
< |
assertSame(ForkJoinPool.commonPool(), |
673 |
< |
ForkJoinTask.getPool()); |
672 |
> |
assertEquals(defaultExecutorIsCommonPool, |
673 |
> |
(ForkJoinPool.commonPool() == ForkJoinTask.getPool())); |
674 |
|
} |
675 |
|
public CompletableFuture<Void> runAsync(Runnable a) { |
676 |
|
return CompletableFuture.runAsync(a); |
894 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
895 |
|
final CompletableFuture<Integer> g = f.exceptionally |
896 |
|
((Throwable t) -> { |
897 |
< |
ExecutionMode.DEFAULT.checkExecutionMode(); |
897 |
> |
ExecutionMode.SYNC.checkExecutionMode(); |
898 |
|
threadAssertSame(t, ex); |
899 |
|
a.getAndIncrement(); |
900 |
|
return v1; |
916 |
|
if (!createIncomplete) f.completeExceptionally(ex1); |
917 |
|
final CompletableFuture<Integer> g = f.exceptionally |
918 |
|
((Throwable t) -> { |
919 |
< |
ExecutionMode.DEFAULT.checkExecutionMode(); |
919 |
> |
ExecutionMode.SYNC.checkExecutionMode(); |
920 |
|
threadAssertSame(t, ex1); |
921 |
|
a.getAndIncrement(); |
922 |
|
throw ex2; |
1283 |
|
*/ |
1284 |
|
public void testThenRun_normalCompletion() { |
1285 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1267 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1286 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1287 |
|
{ |
1288 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1289 |
< |
final Noop r = new Noop(m); |
1290 |
< |
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 |
< |
} |
1289 |
> |
final Noop[] rs = new Noop[6]; |
1290 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1291 |
|
|
1292 |
< |
checkCompletedNormally(g, null); |
1292 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1293 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1294 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1295 |
> |
checkIncomplete(h0); |
1296 |
> |
checkIncomplete(h1); |
1297 |
> |
checkIncomplete(h2); |
1298 |
> |
assertTrue(f.complete(v1)); |
1299 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1300 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1301 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1302 |
> |
|
1303 |
> |
checkCompletedNormally(h0, null); |
1304 |
> |
checkCompletedNormally(h1, null); |
1305 |
> |
checkCompletedNormally(h2, null); |
1306 |
> |
checkCompletedNormally(h3, null); |
1307 |
> |
checkCompletedNormally(h4, null); |
1308 |
> |
checkCompletedNormally(h5, null); |
1309 |
|
checkCompletedNormally(f, v1); |
1310 |
< |
r.assertInvoked(); |
1310 |
> |
for (Noop r : rs) r.assertInvoked(); |
1311 |
|
}} |
1312 |
|
|
1313 |
|
/** |
1316 |
|
*/ |
1317 |
|
public void testThenRun_exceptionalCompletion() { |
1318 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1290 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1319 |
|
{ |
1320 |
|
final CFException ex = new CFException(); |
1321 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1322 |
< |
final Noop r = new Noop(m); |
1323 |
< |
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 |
< |
} |
1322 |
> |
final Noop[] rs = new Noop[6]; |
1323 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1324 |
|
|
1325 |
< |
checkCompletedWithWrappedException(g, ex); |
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.completeExceptionally(ex)); |
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 |
> |
checkCompletedWithWrappedException(h0, ex); |
1337 |
> |
checkCompletedWithWrappedException(h1, ex); |
1338 |
> |
checkCompletedWithWrappedException(h2, ex); |
1339 |
> |
checkCompletedWithWrappedException(h3, ex); |
1340 |
> |
checkCompletedWithWrappedException(h4, ex); |
1341 |
> |
checkCompletedWithWrappedException(h5, ex); |
1342 |
|
checkCompletedExceptionally(f, ex); |
1343 |
< |
r.assertNotInvoked(); |
1343 |
> |
for (Noop r : rs) r.assertNotInvoked(); |
1344 |
|
}} |
1345 |
|
|
1346 |
|
/** |
1348 |
|
*/ |
1349 |
|
public void testThenRun_sourceCancelled() { |
1350 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1312 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1351 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1352 |
|
{ |
1353 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1354 |
< |
final Noop r = new Noop(m); |
1355 |
< |
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 |
< |
} |
1354 |
> |
final Noop[] rs = new Noop[6]; |
1355 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1356 |
|
|
1357 |
< |
checkCompletedWithWrappedCancellationException(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 |
> |
checkIncomplete(h0); |
1361 |
> |
checkIncomplete(h1); |
1362 |
> |
checkIncomplete(h2); |
1363 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1364 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1365 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1366 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1367 |
> |
|
1368 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1369 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1370 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1371 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1372 |
> |
checkCompletedWithWrappedCancellationException(h4); |
1373 |
> |
checkCompletedWithWrappedCancellationException(h5); |
1374 |
|
checkCancelled(f); |
1375 |
< |
r.assertNotInvoked(); |
1375 |
> |
for (Noop r : rs) r.assertNotInvoked(); |
1376 |
|
}} |
1377 |
|
|
1378 |
|
/** |
1380 |
|
*/ |
1381 |
|
public void testThenRun_actionFailed() { |
1382 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1334 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1383 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1384 |
|
{ |
1385 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1386 |
< |
final FailingRunnable r = new FailingRunnable(m); |
1387 |
< |
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 |
< |
} |
1386 |
> |
final FailingRunnable[] rs = new FailingRunnable[6]; |
1387 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingRunnable(m); |
1388 |
|
|
1389 |
< |
checkCompletedWithWrappedCFException(g); |
1389 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1390 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1391 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1392 |
> |
assertTrue(f.complete(v1)); |
1393 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1394 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1395 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1396 |
> |
|
1397 |
> |
checkCompletedWithWrappedCFException(h0); |
1398 |
> |
checkCompletedWithWrappedCFException(h1); |
1399 |
> |
checkCompletedWithWrappedCFException(h2); |
1400 |
> |
checkCompletedWithWrappedCFException(h3); |
1401 |
> |
checkCompletedWithWrappedCFException(h4); |
1402 |
> |
checkCompletedWithWrappedCFException(h5); |
1403 |
|
checkCompletedNormally(f, v1); |
1404 |
|
}} |
1405 |
|
|
1408 |
|
*/ |
1409 |
|
public void testThenApply_normalCompletion() { |
1410 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1355 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1411 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1412 |
|
{ |
1413 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1414 |
< |
final IncFunction r = new IncFunction(m); |
1415 |
< |
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 |
< |
} |
1414 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1415 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1416 |
|
|
1417 |
< |
checkCompletedNormally(g, inc(v1)); |
1417 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1418 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1419 |
> |
checkIncomplete(h0); |
1420 |
> |
checkIncomplete(h1); |
1421 |
> |
assertTrue(f.complete(v1)); |
1422 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1423 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1424 |
> |
|
1425 |
> |
checkCompletedNormally(h0, inc(v1)); |
1426 |
> |
checkCompletedNormally(h1, inc(v1)); |
1427 |
> |
checkCompletedNormally(h2, inc(v1)); |
1428 |
> |
checkCompletedNormally(h3, inc(v1)); |
1429 |
|
checkCompletedNormally(f, v1); |
1430 |
< |
r.assertValue(inc(v1)); |
1430 |
> |
for (IncFunction r : rs) r.assertValue(inc(v1)); |
1431 |
|
}} |
1432 |
|
|
1433 |
|
/** |
1436 |
|
*/ |
1437 |
|
public void testThenApply_exceptionalCompletion() { |
1438 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1378 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1439 |
|
{ |
1440 |
|
final CFException ex = new CFException(); |
1441 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1442 |
< |
final IncFunction r = new IncFunction(m); |
1443 |
< |
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 |
< |
} |
1442 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1443 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1444 |
|
|
1445 |
< |
checkCompletedWithWrappedException(g, ex); |
1445 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1446 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1447 |
> |
assertTrue(f.completeExceptionally(ex)); |
1448 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1449 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1450 |
> |
|
1451 |
> |
checkCompletedWithWrappedException(h0, ex); |
1452 |
> |
checkCompletedWithWrappedException(h1, ex); |
1453 |
> |
checkCompletedWithWrappedException(h2, ex); |
1454 |
> |
checkCompletedWithWrappedException(h3, ex); |
1455 |
|
checkCompletedExceptionally(f, ex); |
1456 |
< |
r.assertNotInvoked(); |
1456 |
> |
for (IncFunction r : rs) r.assertNotInvoked(); |
1457 |
|
}} |
1458 |
|
|
1459 |
|
/** |
1461 |
|
*/ |
1462 |
|
public void testThenApply_sourceCancelled() { |
1463 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1400 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1464 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1465 |
|
{ |
1466 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1467 |
< |
final IncFunction r = new IncFunction(m); |
1468 |
< |
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 |
< |
} |
1467 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1468 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1469 |
|
|
1470 |
< |
checkCompletedWithWrappedCancellationException(g); |
1470 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1471 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1472 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1473 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1474 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1475 |
> |
|
1476 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1477 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1478 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1479 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1480 |
|
checkCancelled(f); |
1481 |
< |
r.assertNotInvoked(); |
1481 |
> |
for (IncFunction r : rs) r.assertNotInvoked(); |
1482 |
|
}} |
1483 |
|
|
1484 |
|
/** |
1486 |
|
*/ |
1487 |
|
public void testThenApply_actionFailed() { |
1488 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1422 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1489 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1490 |
|
{ |
1491 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1492 |
< |
final FailingFunction r = new FailingFunction(m); |
1493 |
< |
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 |
< |
} |
1492 |
> |
final FailingFunction[] rs = new FailingFunction[4]; |
1493 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingFunction(m); |
1494 |
|
|
1495 |
< |
checkCompletedWithWrappedCFException(g); |
1495 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1496 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1497 |
> |
assertTrue(f.complete(v1)); |
1498 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1499 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1500 |
> |
|
1501 |
> |
checkCompletedWithWrappedCFException(h0); |
1502 |
> |
checkCompletedWithWrappedCFException(h1); |
1503 |
> |
checkCompletedWithWrappedCFException(h2); |
1504 |
> |
checkCompletedWithWrappedCFException(h3); |
1505 |
|
checkCompletedNormally(f, v1); |
1506 |
|
}} |
1507 |
|
|
1510 |
|
*/ |
1511 |
|
public void testThenAccept_normalCompletion() { |
1512 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1443 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1513 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1514 |
|
{ |
1515 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1516 |
< |
final NoopConsumer r = new NoopConsumer(m); |
1517 |
< |
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 |
< |
} |
1516 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1517 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1518 |
|
|
1519 |
< |
checkCompletedNormally(g, null); |
1520 |
< |
r.assertValue(v1); |
1519 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1520 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1521 |
> |
checkIncomplete(h0); |
1522 |
> |
checkIncomplete(h1); |
1523 |
> |
assertTrue(f.complete(v1)); |
1524 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1525 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1526 |
> |
|
1527 |
> |
checkCompletedNormally(h0, null); |
1528 |
> |
checkCompletedNormally(h1, null); |
1529 |
> |
checkCompletedNormally(h2, null); |
1530 |
> |
checkCompletedNormally(h3, null); |
1531 |
|
checkCompletedNormally(f, v1); |
1532 |
+ |
for (NoopConsumer r : rs) r.assertValue(v1); |
1533 |
|
}} |
1534 |
|
|
1535 |
|
/** |
1538 |
|
*/ |
1539 |
|
public void testThenAccept_exceptionalCompletion() { |
1540 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1466 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1541 |
|
{ |
1542 |
|
final CFException ex = new CFException(); |
1543 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1544 |
< |
final NoopConsumer r = new NoopConsumer(m); |
1545 |
< |
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 |
< |
} |
1544 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1545 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1546 |
|
|
1547 |
< |
checkCompletedWithWrappedException(g, ex); |
1547 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1548 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1549 |
> |
assertTrue(f.completeExceptionally(ex)); |
1550 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1551 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1552 |
> |
|
1553 |
> |
checkCompletedWithWrappedException(h0, ex); |
1554 |
> |
checkCompletedWithWrappedException(h1, ex); |
1555 |
> |
checkCompletedWithWrappedException(h2, ex); |
1556 |
> |
checkCompletedWithWrappedException(h3, ex); |
1557 |
|
checkCompletedExceptionally(f, ex); |
1558 |
< |
r.assertNotInvoked(); |
1558 |
> |
for (NoopConsumer r : rs) r.assertNotInvoked(); |
1559 |
|
}} |
1560 |
|
|
1561 |
|
/** |
1563 |
|
*/ |
1564 |
|
public void testThenAccept_sourceCancelled() { |
1565 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1488 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1566 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1567 |
|
{ |
1568 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1569 |
< |
final NoopConsumer r = new NoopConsumer(m); |
1570 |
< |
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 |
< |
} |
1569 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1570 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1571 |
|
|
1572 |
< |
checkCompletedWithWrappedCancellationException(g); |
1572 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1573 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1574 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1575 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1576 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1577 |
> |
|
1578 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1579 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1580 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1581 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1582 |
|
checkCancelled(f); |
1583 |
< |
r.assertNotInvoked(); |
1583 |
> |
for (NoopConsumer r : rs) r.assertNotInvoked(); |
1584 |
|
}} |
1585 |
|
|
1586 |
|
/** |
1588 |
|
*/ |
1589 |
|
public void testThenAccept_actionFailed() { |
1590 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1510 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1591 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1592 |
|
{ |
1593 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1594 |
< |
final FailingConsumer r = new FailingConsumer(m); |
1595 |
< |
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 |
< |
} |
1594 |
> |
final FailingConsumer[] rs = new FailingConsumer[4]; |
1595 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingConsumer(m); |
1596 |
|
|
1597 |
< |
checkCompletedWithWrappedCFException(g); |
1597 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1598 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1599 |
> |
assertTrue(f.complete(v1)); |
1600 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1601 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1602 |
> |
|
1603 |
> |
checkCompletedWithWrappedCFException(h0); |
1604 |
> |
checkCompletedWithWrappedCFException(h1); |
1605 |
> |
checkCompletedWithWrappedCFException(h2); |
1606 |
> |
checkCompletedWithWrappedCFException(h3); |
1607 |
|
checkCompletedNormally(f, v1); |
1608 |
|
}} |
1609 |
|
|
1619 |
|
{ |
1620 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1621 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1622 |
< |
final SubtractFunction r1 = new SubtractFunction(m); |
1623 |
< |
final SubtractFunction r2 = new SubtractFunction(m); |
1540 |
< |
final SubtractFunction r3 = new SubtractFunction(m); |
1622 |
> |
final SubtractFunction[] rs = new SubtractFunction[6]; |
1623 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new SubtractFunction(m); |
1624 |
|
|
1625 |
|
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1626 |
|
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1627 |
|
final Integer w1 = fFirst ? v1 : v2; |
1628 |
|
final Integer w2 = !fFirst ? v1 : v2; |
1629 |
|
|
1630 |
< |
final CompletableFuture<Integer> h1 = m.thenCombine(f, g, r1); |
1630 |
> |
final CompletableFuture<Integer> h0 = m.thenCombine(f, g, rs[0]); |
1631 |
> |
final CompletableFuture<Integer> h1 = m.thenCombine(fst, fst, rs[1]); |
1632 |
|
assertTrue(fst.complete(w1)); |
1633 |
< |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, r2); |
1634 |
< |
checkIncomplete(h1); |
1635 |
< |
checkIncomplete(h2); |
1636 |
< |
r1.assertNotInvoked(); |
1637 |
< |
r2.assertNotInvoked(); |
1633 |
> |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, rs[2]); |
1634 |
> |
final CompletableFuture<Integer> h3 = m.thenCombine(fst, fst, rs[3]); |
1635 |
> |
checkIncomplete(h0); rs[0].assertNotInvoked(); |
1636 |
> |
checkIncomplete(h2); rs[2].assertNotInvoked(); |
1637 |
> |
checkCompletedNormally(h1, subtract(w1, w1)); |
1638 |
> |
checkCompletedNormally(h3, subtract(w1, w1)); |
1639 |
> |
rs[1].assertValue(subtract(w1, w1)); |
1640 |
> |
rs[3].assertValue(subtract(w1, w1)); |
1641 |
|
assertTrue(snd.complete(w2)); |
1642 |
< |
final CompletableFuture<Integer> h3 = m.thenCombine(f, g, r3); |
1642 |
> |
final CompletableFuture<Integer> h4 = m.thenCombine(f, g, rs[4]); |
1643 |
|
|
1644 |
< |
checkCompletedNormally(h1, subtract(v1, v2)); |
1644 |
> |
checkCompletedNormally(h0, subtract(v1, v2)); |
1645 |
|
checkCompletedNormally(h2, subtract(v1, v2)); |
1646 |
< |
checkCompletedNormally(h3, subtract(v1, v2)); |
1647 |
< |
r1.assertValue(subtract(v1, v2)); |
1648 |
< |
r2.assertValue(subtract(v1, v2)); |
1649 |
< |
r3.assertValue(subtract(v1, v2)); |
1646 |
> |
checkCompletedNormally(h4, subtract(v1, v2)); |
1647 |
> |
rs[0].assertValue(subtract(v1, v2)); |
1648 |
> |
rs[2].assertValue(subtract(v1, v2)); |
1649 |
> |
rs[4].assertValue(subtract(v1, v2)); |
1650 |
> |
|
1651 |
|
checkCompletedNormally(f, v1); |
1652 |
|
checkCompletedNormally(g, v2); |
1653 |
|
}} |
2994 |
|
checkCancelled(f); |
2995 |
|
}} |
2996 |
|
|
2997 |
+ |
/** |
2998 |
+ |
* thenCompose result completes exceptionally if the result of the action does |
2999 |
+ |
*/ |
3000 |
+ |
public void testThenCompose_actionReturnsFailingFuture() { |
3001 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
3002 |
+ |
for (int order = 0; order < 6; order++) |
3003 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3004 |
+ |
{ |
3005 |
+ |
final CFException ex = new CFException(); |
3006 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3007 |
+ |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3008 |
+ |
final CompletableFuture<Integer> h; |
3009 |
+ |
// Test all permutations of orders |
3010 |
+ |
switch (order) { |
3011 |
+ |
case 0: |
3012 |
+ |
assertTrue(f.complete(v1)); |
3013 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3014 |
+ |
h = m.thenCompose(f, (x -> g)); |
3015 |
+ |
break; |
3016 |
+ |
case 1: |
3017 |
+ |
assertTrue(f.complete(v1)); |
3018 |
+ |
h = m.thenCompose(f, (x -> g)); |
3019 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3020 |
+ |
break; |
3021 |
+ |
case 2: |
3022 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3023 |
+ |
assertTrue(f.complete(v1)); |
3024 |
+ |
h = m.thenCompose(f, (x -> g)); |
3025 |
+ |
break; |
3026 |
+ |
case 3: |
3027 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3028 |
+ |
h = m.thenCompose(f, (x -> g)); |
3029 |
+ |
assertTrue(f.complete(v1)); |
3030 |
+ |
break; |
3031 |
+ |
case 4: |
3032 |
+ |
h = m.thenCompose(f, (x -> g)); |
3033 |
+ |
assertTrue(f.complete(v1)); |
3034 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3035 |
+ |
break; |
3036 |
+ |
case 5: |
3037 |
+ |
h = m.thenCompose(f, (x -> g)); |
3038 |
+ |
assertTrue(f.complete(v1)); |
3039 |
+ |
assertTrue(g.completeExceptionally(ex)); |
3040 |
+ |
break; |
3041 |
+ |
default: throw new AssertionError(); |
3042 |
+ |
} |
3043 |
+ |
|
3044 |
+ |
checkCompletedExceptionally(g, ex); |
3045 |
+ |
checkCompletedWithWrappedException(h, ex); |
3046 |
+ |
checkCompletedNormally(f, v1); |
3047 |
+ |
}} |
3048 |
+ |
|
3049 |
|
// other static methods |
3050 |
|
|
3051 |
|
/** |
3062 |
|
* when all components complete normally |
3063 |
|
*/ |
3064 |
|
public void testAllOf_normal() throws Exception { |
3065 |
< |
for (int k = 1; k < 20; ++k) { |
3065 |
> |
for (int k = 1; k < 10; k++) { |
3066 |
|
CompletableFuture<Integer>[] fs |
3067 |
|
= (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3068 |
< |
for (int i = 0; i < k; ++i) |
3068 |
> |
for (int i = 0; i < k; i++) |
3069 |
|
fs[i] = new CompletableFuture<>(); |
3070 |
|
CompletableFuture<Void> f = CompletableFuture.allOf(fs); |
3071 |
< |
for (int i = 0; i < k; ++i) { |
3071 |
> |
for (int i = 0; i < k; i++) { |
3072 |
|
checkIncomplete(f); |
3073 |
|
checkIncomplete(CompletableFuture.allOf(fs)); |
3074 |
|
fs[i].complete(one); |
3079 |
|
} |
3080 |
|
|
3081 |
|
public void testAllOf_backwards() throws Exception { |
3082 |
< |
for (int k = 1; k < 20; ++k) { |
3082 |
> |
for (int k = 1; k < 10; k++) { |
3083 |
|
CompletableFuture<Integer>[] fs |
3084 |
|
= (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3085 |
< |
for (int i = 0; i < k; ++i) |
3085 |
> |
for (int i = 0; i < k; i++) |
3086 |
|
fs[i] = new CompletableFuture<>(); |
3087 |
|
CompletableFuture<Void> f = CompletableFuture.allOf(fs); |
3088 |
|
for (int i = k - 1; i >= 0; i--) { |
3095 |
|
} |
3096 |
|
} |
3097 |
|
|
3098 |
+ |
public void testAllOf_exceptional() throws Exception { |
3099 |
+ |
for (int k = 1; k < 10; k++) { |
3100 |
+ |
CompletableFuture<Integer>[] fs |
3101 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3102 |
+ |
CFException ex = new CFException(); |
3103 |
+ |
for (int i = 0; i < k; i++) |
3104 |
+ |
fs[i] = new CompletableFuture<>(); |
3105 |
+ |
CompletableFuture<Void> f = CompletableFuture.allOf(fs); |
3106 |
+ |
for (int i = 0; i < k; i++) { |
3107 |
+ |
checkIncomplete(f); |
3108 |
+ |
checkIncomplete(CompletableFuture.allOf(fs)); |
3109 |
+ |
if (i != k/2) { |
3110 |
+ |
fs[i].complete(i); |
3111 |
+ |
checkCompletedNormally(fs[i], i); |
3112 |
+ |
} else { |
3113 |
+ |
fs[i].completeExceptionally(ex); |
3114 |
+ |
checkCompletedExceptionally(fs[i], ex); |
3115 |
+ |
} |
3116 |
+ |
} |
3117 |
+ |
checkCompletedWithWrappedException(f, ex); |
3118 |
+ |
checkCompletedWithWrappedException(CompletableFuture.allOf(fs), ex); |
3119 |
+ |
} |
3120 |
+ |
} |
3121 |
+ |
|
3122 |
|
/** |
3123 |
|
* anyOf(no component futures) returns an incomplete future |
3124 |
|
*/ |
3125 |
|
public void testAnyOf_empty() throws Exception { |
3126 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3127 |
+ |
{ |
3128 |
|
CompletableFuture<Object> f = CompletableFuture.anyOf(); |
3129 |
|
checkIncomplete(f); |
3130 |
< |
} |
3130 |
> |
|
3131 |
> |
f.complete(v1); |
3132 |
> |
checkCompletedNormally(f, v1); |
3133 |
> |
}} |
3134 |
|
|
3135 |
|
/** |
3136 |
|
* anyOf returns a future completed normally with a value when |
3137 |
|
* a component future does |
3138 |
|
*/ |
3139 |
|
public void testAnyOf_normal() throws Exception { |
3140 |
< |
for (int k = 0; k < 10; ++k) { |
3140 |
> |
for (int k = 0; k < 10; k++) { |
3141 |
|
CompletableFuture[] fs = new CompletableFuture[k]; |
3142 |
< |
for (int i = 0; i < k; ++i) |
3142 |
> |
for (int i = 0; i < k; i++) |
3143 |
|
fs[i] = new CompletableFuture<>(); |
3144 |
|
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3145 |
|
checkIncomplete(f); |
3146 |
< |
for (int i = 0; i < k; ++i) { |
3147 |
< |
fs[i].complete(one); |
3148 |
< |
checkCompletedNormally(f, one); |
3149 |
< |
checkCompletedNormally(CompletableFuture.anyOf(fs), one); |
3146 |
> |
for (int i = 0; i < k; i++) { |
3147 |
> |
fs[i].complete(i); |
3148 |
> |
checkCompletedNormally(f, 0); |
3149 |
> |
int x = (int) CompletableFuture.anyOf(fs).join(); |
3150 |
> |
assertTrue(0 <= x && x <= i); |
3151 |
> |
} |
3152 |
> |
} |
3153 |
> |
} |
3154 |
> |
public void testAnyOf_normal_backwards() throws Exception { |
3155 |
> |
for (int k = 0; k < 10; k++) { |
3156 |
> |
CompletableFuture[] fs = new CompletableFuture[k]; |
3157 |
> |
for (int i = 0; i < k; i++) |
3158 |
> |
fs[i] = new CompletableFuture<>(); |
3159 |
> |
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3160 |
> |
checkIncomplete(f); |
3161 |
> |
for (int i = k - 1; i >= 0; i--) { |
3162 |
> |
fs[i].complete(i); |
3163 |
> |
checkCompletedNormally(f, k - 1); |
3164 |
> |
int x = (int) CompletableFuture.anyOf(fs).join(); |
3165 |
> |
assertTrue(i <= x && x <= k - 1); |
3166 |
|
} |
3167 |
|
} |
3168 |
|
} |
3171 |
|
* anyOf result completes exceptionally when any component does. |
3172 |
|
*/ |
3173 |
|
public void testAnyOf_exceptional() throws Exception { |
3174 |
< |
for (int k = 0; k < 10; ++k) { |
3174 |
> |
for (int k = 0; k < 10; k++) { |
3175 |
|
CompletableFuture[] fs = new CompletableFuture[k]; |
3176 |
< |
for (int i = 0; i < k; ++i) |
3176 |
> |
CFException[] exs = new CFException[k]; |
3177 |
> |
for (int i = 0; i < k; i++) { |
3178 |
|
fs[i] = new CompletableFuture<>(); |
3179 |
+ |
exs[i] = new CFException(); |
3180 |
+ |
} |
3181 |
|
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3182 |
|
checkIncomplete(f); |
3183 |
< |
for (int i = 0; i < k; ++i) { |
3184 |
< |
fs[i].completeExceptionally(new CFException()); |
3185 |
< |
checkCompletedWithWrappedCFException(f); |
3183 |
> |
for (int i = 0; i < k; i++) { |
3184 |
> |
fs[i].completeExceptionally(exs[i]); |
3185 |
> |
checkCompletedWithWrappedException(f, exs[0]); |
3186 |
> |
checkCompletedWithWrappedCFException(CompletableFuture.anyOf(fs)); |
3187 |
> |
} |
3188 |
> |
} |
3189 |
> |
} |
3190 |
> |
|
3191 |
> |
public void testAnyOf_exceptional_backwards() throws Exception { |
3192 |
> |
for (int k = 0; k < 10; k++) { |
3193 |
> |
CompletableFuture[] fs = new CompletableFuture[k]; |
3194 |
> |
CFException[] exs = new CFException[k]; |
3195 |
> |
for (int i = 0; i < k; i++) { |
3196 |
> |
fs[i] = new CompletableFuture<>(); |
3197 |
> |
exs[i] = new CFException(); |
3198 |
> |
} |
3199 |
> |
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3200 |
> |
checkIncomplete(f); |
3201 |
> |
for (int i = k - 1; i >= 0; i--) { |
3202 |
> |
fs[i].completeExceptionally(exs[i]); |
3203 |
> |
checkCompletedWithWrappedException(f, exs[k - 1]); |
3204 |
|
checkCompletedWithWrappedCFException(CompletableFuture.anyOf(fs)); |
3205 |
|
} |
3206 |
|
} |
3219 |
|
Runnable[] throwingActions = { |
3220 |
|
() -> CompletableFuture.supplyAsync(null), |
3221 |
|
() -> CompletableFuture.supplyAsync(null, exec), |
3222 |
< |
() -> CompletableFuture.supplyAsync(new IntegerSupplier(ExecutionMode.DEFAULT, 42), null), |
3222 |
> |
() -> CompletableFuture.supplyAsync(new IntegerSupplier(ExecutionMode.SYNC, 42), null), |
3223 |
|
|
3224 |
|
() -> CompletableFuture.runAsync(null), |
3225 |
|
() -> CompletableFuture.runAsync(null, exec), |
3324 |
|
assertSame(f, f.toCompletableFuture()); |
3325 |
|
} |
3326 |
|
|
3327 |
< |
// public void testRunAfterEither_resultDeterminedAtTimeOfCreation() { |
3328 |
< |
// for (ExecutionMode m : ExecutionMode.values()) |
3329 |
< |
// for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
3330 |
< |
// for (Integer v1 : new Integer[] { 1, null }) |
3331 |
< |
// { |
3332 |
< |
// final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3333 |
< |
// final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3334 |
< |
// final Noop[] rs = new Noop[2]; |
3335 |
< |
// for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
3336 |
< |
// f.complete(v1); |
3337 |
< |
// final CompletableFuture<Void> h0 = m.runAfterEither(f, g, rs[0]); |
3338 |
< |
// final CompletableFuture<Void> h1 = m.runAfterEither(g, f, rs[1]); |
3339 |
< |
// assertTrue(g.cancel(mayInterruptIfRunning)); |
3340 |
< |
// checkCompletedNormally(h0, null); |
3341 |
< |
// checkCompletedNormally(h1, null); |
3342 |
< |
// for (Noop r : rs) r.assertInvoked(); |
3343 |
< |
// }} |
3327 |
> |
//--- tests of implementation details; not part of official tck --- |
3328 |
> |
|
3329 |
> |
Object resultOf(CompletableFuture<?> f) { |
3330 |
> |
try { |
3331 |
> |
java.lang.reflect.Field resultField |
3332 |
> |
= CompletableFuture.class.getDeclaredField("result"); |
3333 |
> |
resultField.setAccessible(true); |
3334 |
> |
return resultField.get(f); |
3335 |
> |
} catch (Throwable t) { throw new AssertionError(t); } |
3336 |
> |
} |
3337 |
> |
|
3338 |
> |
public void testExceptionPropagationReusesResultObject() { |
3339 |
> |
if (!testImplementationDetails) return; |
3340 |
> |
for (ExecutionMode m : ExecutionMode.values()) |
3341 |
> |
{ |
3342 |
> |
final CFException ex = new CFException(); |
3343 |
> |
final CompletableFuture<Integer> v42 = CompletableFuture.completedFuture(42); |
3344 |
> |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3345 |
> |
|
3346 |
> |
List<Function<CompletableFuture<Integer>, CompletableFuture<?>>> funs |
3347 |
> |
= new ArrayList<>(); |
3348 |
> |
|
3349 |
> |
funs.add((y) -> m.thenRun(y, new Noop(m))); |
3350 |
> |
funs.add((y) -> m.thenAccept(y, new NoopConsumer(m))); |
3351 |
> |
funs.add((y) -> m.thenApply(y, new IncFunction(m))); |
3352 |
> |
|
3353 |
> |
funs.add((y) -> m.runAfterEither(y, incomplete, new Noop(m))); |
3354 |
> |
funs.add((y) -> m.acceptEither(y, incomplete, new NoopConsumer(m))); |
3355 |
> |
funs.add((y) -> m.applyToEither(y, incomplete, new IncFunction(m))); |
3356 |
> |
|
3357 |
> |
funs.add((y) -> m.runAfterBoth(y, v42, new Noop(m))); |
3358 |
> |
funs.add((y) -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
3359 |
> |
funs.add((y) -> m.thenCombine(y, v42, new SubtractFunction(m))); |
3360 |
> |
|
3361 |
> |
funs.add((y) -> m.whenComplete(y, (Integer x, Throwable t) -> {})); |
3362 |
> |
|
3363 |
> |
funs.add((y) -> m.thenCompose(y, new CompletableFutureInc(m))); |
3364 |
> |
|
3365 |
> |
funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y, v42})); |
3366 |
> |
funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y, incomplete})); |
3367 |
> |
|
3368 |
> |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3369 |
> |
fun : funs) { |
3370 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3371 |
> |
f.completeExceptionally(ex); |
3372 |
> |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3373 |
> |
checkCompletedWithWrappedException(src, ex); |
3374 |
> |
CompletableFuture<?> dep = fun.apply(src); |
3375 |
> |
checkCompletedWithWrappedException(dep, ex); |
3376 |
> |
assertSame(resultOf(src), resultOf(dep)); |
3377 |
> |
} |
3378 |
> |
|
3379 |
> |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3380 |
> |
fun : funs) { |
3381 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3382 |
> |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3383 |
> |
CompletableFuture<?> dep = fun.apply(src); |
3384 |
> |
f.completeExceptionally(ex); |
3385 |
> |
checkCompletedWithWrappedException(src, ex); |
3386 |
> |
checkCompletedWithWrappedException(dep, ex); |
3387 |
> |
assertSame(resultOf(src), resultOf(dep)); |
3388 |
> |
} |
3389 |
> |
|
3390 |
> |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
3391 |
> |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3392 |
> |
fun : funs) { |
3393 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3394 |
> |
f.cancel(mayInterruptIfRunning); |
3395 |
> |
checkCancelled(f); |
3396 |
> |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3397 |
> |
checkCompletedWithWrappedCancellationException(src); |
3398 |
> |
CompletableFuture<?> dep = fun.apply(src); |
3399 |
> |
checkCompletedWithWrappedCancellationException(dep); |
3400 |
> |
assertSame(resultOf(src), resultOf(dep)); |
3401 |
> |
} |
3402 |
> |
|
3403 |
> |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
3404 |
> |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
3405 |
> |
fun : funs) { |
3406 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3407 |
> |
CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m)); |
3408 |
> |
CompletableFuture<?> dep = fun.apply(src); |
3409 |
> |
f.cancel(mayInterruptIfRunning); |
3410 |
> |
checkCancelled(f); |
3411 |
> |
checkCompletedWithWrappedCancellationException(src); |
3412 |
> |
checkCompletedWithWrappedCancellationException(dep); |
3413 |
> |
assertSame(resultOf(src), resultOf(dep)); |
3414 |
> |
} |
3415 |
> |
}} |
3416 |
|
|
3417 |
|
} |