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.RejectedExecutionException; |
34 |
|
import java.util.concurrent.TimeoutException; |
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.Test; |
45 |
+ |
import junit.framework.TestSuite; |
46 |
|
|
47 |
|
public class CompletableFutureTest extends JSR166TestCase { |
48 |
|
|
49 |
|
public static void main(String[] args) { |
50 |
< |
junit.textui.TestRunner.run(suite()); |
50 |
> |
main(suite(), args); |
51 |
|
} |
52 |
|
public static Test suite() { |
53 |
|
return new TestSuite(CompletableFutureTest.class); |
58 |
|
void checkIncomplete(CompletableFuture<?> f) { |
59 |
|
assertFalse(f.isDone()); |
60 |
|
assertFalse(f.isCancelled()); |
61 |
< |
assertTrue(f.toString().contains("[Not completed]")); |
61 |
> |
assertTrue(f.toString().matches(".*\\[.*Not completed.*\\]")); |
62 |
> |
|
63 |
> |
Object result = null; |
64 |
|
try { |
65 |
< |
assertNull(f.getNow(null)); |
65 |
> |
result = f.getNow(null); |
66 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
67 |
+ |
assertNull(result); |
68 |
+ |
|
69 |
|
try { |
70 |
< |
f.get(0L, SECONDS); |
70 |
> |
f.get(randomExpiredTimeout(), randomTimeUnit()); |
71 |
|
shouldThrow(); |
72 |
|
} |
73 |
|
catch (TimeoutException success) {} |
74 |
|
catch (Throwable fail) { threadUnexpectedException(fail); } |
75 |
|
} |
76 |
|
|
77 |
< |
<T> void checkCompletedNormally(CompletableFuture<T> f, T value) { |
78 |
< |
try { |
79 |
< |
assertEquals(value, f.get(LONG_DELAY_MS, MILLISECONDS)); |
80 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
81 |
< |
try { |
82 |
< |
assertEquals(value, f.join()); |
83 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
66 |
< |
try { |
67 |
< |
assertEquals(value, f.getNow(null)); |
68 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
77 |
> |
<T> void checkCompletedNormally(CompletableFuture<T> f, T expectedValue) { |
78 |
> |
checkTimedGet(f, expectedValue); |
79 |
> |
|
80 |
> |
assertEquals(expectedValue, f.join()); |
81 |
> |
assertEquals(expectedValue, f.getNow(null)); |
82 |
> |
|
83 |
> |
T result = null; |
84 |
|
try { |
85 |
< |
assertEquals(value, f.get()); |
85 |
> |
result = f.get(); |
86 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
87 |
+ |
assertEquals(expectedValue, result); |
88 |
+ |
|
89 |
|
assertTrue(f.isDone()); |
90 |
|
assertFalse(f.isCancelled()); |
91 |
|
assertFalse(f.isCompletedExceptionally()); |
92 |
< |
assertTrue(f.toString().contains("[Completed normally]")); |
92 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed normally.*\\]")); |
93 |
|
} |
94 |
|
|
95 |
< |
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
96 |
< |
try { |
97 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
98 |
< |
shouldThrow(); |
99 |
< |
} catch (ExecutionException success) { |
100 |
< |
assertTrue(success.getCause() instanceof CFException); |
101 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
102 |
< |
try { |
86 |
< |
f.join(); |
87 |
< |
shouldThrow(); |
88 |
< |
} catch (CompletionException success) { |
89 |
< |
assertTrue(success.getCause() instanceof CFException); |
90 |
< |
} |
91 |
< |
try { |
92 |
< |
f.getNow(null); |
93 |
< |
shouldThrow(); |
94 |
< |
} catch (CompletionException success) { |
95 |
< |
assertTrue(success.getCause() instanceof CFException); |
96 |
< |
} |
97 |
< |
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]")); |
95 |
> |
/** |
96 |
> |
* Returns the "raw" internal exceptional completion of f, |
97 |
> |
* without any additional wrapping with CompletionException. |
98 |
> |
*/ |
99 |
> |
Throwable exceptionalCompletion(CompletableFuture<?> f) { |
100 |
> |
// handle (and whenComplete and exceptionally) can distinguish |
101 |
> |
// between "direct" and "wrapped" exceptional completion |
102 |
> |
return f.handle((u, t) -> t).join(); |
103 |
|
} |
104 |
|
|
105 |
< |
void checkCompletedWithWrappedCFException(CompletableFuture<?> f, |
106 |
< |
CFException ex) { |
105 |
> |
void checkCompletedExceptionally(CompletableFuture<?> f, |
106 |
> |
boolean wrapped, |
107 |
> |
Consumer<Throwable> checker) { |
108 |
> |
Throwable cause = exceptionalCompletion(f); |
109 |
> |
if (wrapped) { |
110 |
> |
assertTrue(cause instanceof CompletionException); |
111 |
> |
cause = cause.getCause(); |
112 |
> |
} |
113 |
> |
checker.accept(cause); |
114 |
> |
|
115 |
> |
long startTime = System.nanoTime(); |
116 |
|
try { |
117 |
|
f.get(LONG_DELAY_MS, MILLISECONDS); |
118 |
|
shouldThrow(); |
119 |
|
} catch (ExecutionException success) { |
120 |
< |
assertSame(ex, success.getCause()); |
120 |
> |
assertSame(cause, success.getCause()); |
121 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
122 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
123 |
+ |
|
124 |
|
try { |
125 |
|
f.join(); |
126 |
|
shouldThrow(); |
127 |
|
} catch (CompletionException success) { |
128 |
< |
assertSame(ex, success.getCause()); |
129 |
< |
} |
128 |
> |
assertSame(cause, success.getCause()); |
129 |
> |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
130 |
> |
|
131 |
|
try { |
132 |
|
f.getNow(null); |
133 |
|
shouldThrow(); |
134 |
|
} catch (CompletionException success) { |
135 |
< |
assertSame(ex, success.getCause()); |
136 |
< |
} |
135 |
> |
assertSame(cause, success.getCause()); |
136 |
> |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
137 |
> |
|
138 |
|
try { |
139 |
|
f.get(); |
140 |
|
shouldThrow(); |
141 |
|
} catch (ExecutionException success) { |
142 |
< |
assertSame(ex, success.getCause()); |
142 |
> |
assertSame(cause, success.getCause()); |
143 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
144 |
< |
assertTrue(f.isDone()); |
144 |
> |
|
145 |
|
assertFalse(f.isCancelled()); |
146 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
146 |
> |
assertTrue(f.isDone()); |
147 |
> |
assertTrue(f.isCompletedExceptionally()); |
148 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
149 |
> |
} |
150 |
> |
|
151 |
> |
void checkCompletedWithWrappedCFException(CompletableFuture<?> f) { |
152 |
> |
checkCompletedExceptionally(f, true, |
153 |
> |
t -> assertTrue(t instanceof CFException)); |
154 |
> |
} |
155 |
> |
|
156 |
> |
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
157 |
> |
checkCompletedExceptionally(f, true, |
158 |
> |
t -> assertTrue(t instanceof CancellationException)); |
159 |
> |
} |
160 |
> |
|
161 |
> |
void checkCompletedWithTimeoutException(CompletableFuture<?> f) { |
162 |
> |
checkCompletedExceptionally(f, false, |
163 |
> |
t -> assertTrue(t instanceof TimeoutException)); |
164 |
> |
} |
165 |
> |
|
166 |
> |
void checkCompletedWithWrappedException(CompletableFuture<?> f, |
167 |
> |
Throwable ex) { |
168 |
> |
checkCompletedExceptionally(f, true, t -> assertSame(t, ex)); |
169 |
> |
} |
170 |
> |
|
171 |
> |
void checkCompletedExceptionally(CompletableFuture<?> f, Throwable ex) { |
172 |
> |
checkCompletedExceptionally(f, false, t -> assertSame(t, ex)); |
173 |
|
} |
174 |
|
|
175 |
|
void checkCancelled(CompletableFuture<?> f) { |
176 |
+ |
long startTime = System.nanoTime(); |
177 |
|
try { |
178 |
|
f.get(LONG_DELAY_MS, MILLISECONDS); |
179 |
|
shouldThrow(); |
180 |
|
} catch (CancellationException success) { |
181 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
182 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
183 |
+ |
|
184 |
|
try { |
185 |
|
f.join(); |
186 |
|
shouldThrow(); |
194 |
|
shouldThrow(); |
195 |
|
} catch (CancellationException success) { |
196 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
158 |
– |
assertTrue(f.isDone()); |
159 |
– |
assertTrue(f.isCompletedExceptionally()); |
160 |
– |
assertTrue(f.isCancelled()); |
161 |
– |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
162 |
– |
} |
197 |
|
|
198 |
< |
void checkCompletedWithWrappedCancellationException(CompletableFuture<?> f) { |
199 |
< |
try { |
166 |
< |
f.get(LONG_DELAY_MS, MILLISECONDS); |
167 |
< |
shouldThrow(); |
168 |
< |
} catch (ExecutionException success) { |
169 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
170 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
171 |
< |
try { |
172 |
< |
f.join(); |
173 |
< |
shouldThrow(); |
174 |
< |
} catch (CompletionException success) { |
175 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
176 |
< |
} |
177 |
< |
try { |
178 |
< |
f.getNow(null); |
179 |
< |
shouldThrow(); |
180 |
< |
} catch (CompletionException success) { |
181 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
182 |
< |
} |
183 |
< |
try { |
184 |
< |
f.get(); |
185 |
< |
shouldThrow(); |
186 |
< |
} catch (ExecutionException success) { |
187 |
< |
assertTrue(success.getCause() instanceof CancellationException); |
188 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
198 |
> |
assertTrue(exceptionalCompletion(f) instanceof CancellationException); |
199 |
> |
|
200 |
|
assertTrue(f.isDone()); |
190 |
– |
assertFalse(f.isCancelled()); |
201 |
|
assertTrue(f.isCompletedExceptionally()); |
202 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
202 |
> |
assertTrue(f.isCancelled()); |
203 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
204 |
|
} |
205 |
|
|
206 |
|
/** |
217 |
|
* isCancelled, join, get, and getNow |
218 |
|
*/ |
219 |
|
public void testComplete() { |
220 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
221 |
+ |
{ |
222 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
223 |
|
checkIncomplete(f); |
224 |
< |
f.complete(one); |
225 |
< |
checkCompletedNormally(f, one); |
226 |
< |
} |
224 |
> |
assertTrue(f.complete(v1)); |
225 |
> |
assertFalse(f.complete(v1)); |
226 |
> |
checkCompletedNormally(f, v1); |
227 |
> |
}} |
228 |
|
|
229 |
|
/** |
230 |
|
* completeExceptionally completes exceptionally, as indicated by |
232 |
|
*/ |
233 |
|
public void testCompleteExceptionally() { |
234 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
235 |
+ |
CFException ex = new CFException(); |
236 |
|
checkIncomplete(f); |
237 |
< |
f.completeExceptionally(new CFException()); |
238 |
< |
checkCompletedWithWrappedCFException(f); |
237 |
> |
f.completeExceptionally(ex); |
238 |
> |
checkCompletedExceptionally(f, ex); |
239 |
|
} |
240 |
|
|
241 |
|
/** |
243 |
|
* methods isDone, isCancelled, join, get, and getNow |
244 |
|
*/ |
245 |
|
public void testCancel() { |
246 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
247 |
+ |
{ |
248 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
249 |
|
checkIncomplete(f); |
250 |
< |
assertTrue(f.cancel(true)); |
250 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
251 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
252 |
> |
assertTrue(f.cancel(!mayInterruptIfRunning)); |
253 |
|
checkCancelled(f); |
254 |
< |
} |
254 |
> |
}} |
255 |
|
|
256 |
|
/** |
257 |
|
* obtrudeValue forces completion with given value |
259 |
|
public void testObtrudeValue() { |
260 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
261 |
|
checkIncomplete(f); |
262 |
< |
f.complete(one); |
262 |
> |
assertTrue(f.complete(one)); |
263 |
|
checkCompletedNormally(f, one); |
264 |
|
f.obtrudeValue(three); |
265 |
|
checkCompletedNormally(f, three); |
280 |
|
* obtrudeException forces completion with given exception |
281 |
|
*/ |
282 |
|
public void testObtrudeException() { |
283 |
< |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
284 |
< |
checkIncomplete(f); |
285 |
< |
f.complete(one); |
286 |
< |
checkCompletedNormally(f, one); |
287 |
< |
f.obtrudeException(new CFException()); |
269 |
< |
checkCompletedWithWrappedCFException(f); |
283 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
284 |
> |
{ |
285 |
> |
CFException ex; |
286 |
> |
CompletableFuture<Integer> f; |
287 |
> |
|
288 |
|
f = new CompletableFuture<>(); |
289 |
< |
f.obtrudeException(new CFException()); |
290 |
< |
checkCompletedWithWrappedCFException(f); |
289 |
> |
assertTrue(f.complete(v1)); |
290 |
> |
for (int i = 0; i < 2; i++) { |
291 |
> |
f.obtrudeException(ex = new CFException()); |
292 |
> |
checkCompletedExceptionally(f, ex); |
293 |
> |
} |
294 |
> |
|
295 |
> |
f = new CompletableFuture<>(); |
296 |
> |
for (int i = 0; i < 2; i++) { |
297 |
> |
f.obtrudeException(ex = new CFException()); |
298 |
> |
checkCompletedExceptionally(f, ex); |
299 |
> |
} |
300 |
> |
|
301 |
|
f = new CompletableFuture<>(); |
302 |
|
f.completeExceptionally(new CFException()); |
303 |
< |
f.obtrudeValue(four); |
304 |
< |
checkCompletedNormally(f, four); |
305 |
< |
f.obtrudeException(new CFException()); |
306 |
< |
checkCompletedWithWrappedCFException(f); |
307 |
< |
} |
303 |
> |
f.obtrudeValue(v1); |
304 |
> |
checkCompletedNormally(f, v1); |
305 |
> |
f.obtrudeException(ex = new CFException()); |
306 |
> |
checkCompletedExceptionally(f, ex); |
307 |
> |
f.completeExceptionally(new CFException()); |
308 |
> |
checkCompletedExceptionally(f, ex); |
309 |
> |
assertFalse(f.complete(v1)); |
310 |
> |
checkCompletedExceptionally(f, ex); |
311 |
> |
}} |
312 |
|
|
313 |
|
/** |
314 |
|
* getNumberOfDependents returns number of dependent tasks |
315 |
|
*/ |
316 |
|
public void testGetNumberOfDependents() { |
317 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
318 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
319 |
+ |
{ |
320 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
321 |
|
assertEquals(0, f.getNumberOfDependents()); |
322 |
< |
CompletableFuture g = f.thenRun(new Noop(ExecutionMode.DEFAULT)); |
322 |
> |
final CompletableFuture<Void> g = m.thenRun(f, new Noop(m)); |
323 |
|
assertEquals(1, f.getNumberOfDependents()); |
324 |
|
assertEquals(0, g.getNumberOfDependents()); |
325 |
< |
CompletableFuture h = f.thenRun(new Noop(ExecutionMode.DEFAULT)); |
325 |
> |
final CompletableFuture<Void> h = m.thenRun(f, new Noop(m)); |
326 |
|
assertEquals(2, f.getNumberOfDependents()); |
327 |
< |
f.complete(1); |
327 |
> |
assertEquals(0, h.getNumberOfDependents()); |
328 |
> |
assertTrue(f.complete(v1)); |
329 |
|
checkCompletedNormally(g, null); |
330 |
+ |
checkCompletedNormally(h, null); |
331 |
|
assertEquals(0, f.getNumberOfDependents()); |
332 |
|
assertEquals(0, g.getNumberOfDependents()); |
333 |
< |
} |
333 |
> |
assertEquals(0, h.getNumberOfDependents()); |
334 |
> |
}} |
335 |
|
|
336 |
|
/** |
337 |
|
* toString indicates current completion state |
338 |
|
*/ |
339 |
< |
public void testToString() { |
340 |
< |
CompletableFuture<String> f; |
341 |
< |
|
342 |
< |
f = new CompletableFuture<String>(); |
343 |
< |
assertTrue(f.toString().contains("[Not completed]")); |
344 |
< |
|
345 |
< |
f.complete("foo"); |
346 |
< |
assertTrue(f.toString().contains("[Completed normally]")); |
347 |
< |
|
348 |
< |
f = new CompletableFuture<String>(); |
349 |
< |
f.completeExceptionally(new IndexOutOfBoundsException()); |
350 |
< |
assertTrue(f.toString().contains("[Completed exceptionally]")); |
339 |
> |
public void testToString_incomplete() { |
340 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
341 |
> |
assertTrue(f.toString().matches(".*\\[.*Not completed.*\\]")); |
342 |
> |
if (testImplementationDetails) |
343 |
> |
assertEquals(identityString(f) + "[Not completed]", |
344 |
> |
f.toString()); |
345 |
> |
} |
346 |
> |
|
347 |
> |
public void testToString_normal() { |
348 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
349 |
> |
assertTrue(f.complete("foo")); |
350 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed normally.*\\]")); |
351 |
> |
if (testImplementationDetails) |
352 |
> |
assertEquals(identityString(f) + "[Completed normally]", |
353 |
> |
f.toString()); |
354 |
> |
} |
355 |
> |
|
356 |
> |
public void testToString_exception() { |
357 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
358 |
> |
assertTrue(f.completeExceptionally(new IndexOutOfBoundsException())); |
359 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
360 |
> |
if (testImplementationDetails) |
361 |
> |
assertTrue(f.toString().startsWith( |
362 |
> |
identityString(f) + "[Completed exceptionally: ")); |
363 |
> |
} |
364 |
> |
|
365 |
> |
public void testToString_cancelled() { |
366 |
> |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) { |
367 |
> |
CompletableFuture<String> f = new CompletableFuture<>(); |
368 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
369 |
> |
assertTrue(f.toString().matches(".*\\[.*Completed exceptionally.*\\]")); |
370 |
> |
if (testImplementationDetails) |
371 |
> |
assertTrue(f.toString().startsWith( |
372 |
> |
identityString(f) + "[Completed exceptionally: ")); |
373 |
> |
} |
374 |
|
} |
375 |
|
|
376 |
|
/** |
381 |
|
checkCompletedNormally(f, "test"); |
382 |
|
} |
383 |
|
|
384 |
< |
// Choose non-commutative actions for better coverage |
384 |
> |
abstract static class CheckedAction { |
385 |
> |
int invocationCount = 0; |
386 |
> |
final ExecutionMode m; |
387 |
> |
CheckedAction(ExecutionMode m) { this.m = m; } |
388 |
> |
void invoked() { |
389 |
> |
m.checkExecutionMode(); |
390 |
> |
assertEquals(0, invocationCount++); |
391 |
> |
} |
392 |
> |
void assertNotInvoked() { assertEquals(0, invocationCount); } |
393 |
> |
void assertInvoked() { assertEquals(1, invocationCount); } |
394 |
> |
} |
395 |
|
|
396 |
< |
// A non-commutative function that handles and produces null values as well. |
397 |
< |
static Integer subtract(Integer x, Integer y) { |
398 |
< |
return (x == null && y == null) ? null : |
399 |
< |
((x == null) ? 42 : x.intValue()) |
400 |
< |
- ((y == null) ? 99 : y.intValue()); |
396 |
> |
abstract static class CheckedIntegerAction extends CheckedAction { |
397 |
> |
Integer value; |
398 |
> |
CheckedIntegerAction(ExecutionMode m) { super(m); } |
399 |
> |
void assertValue(Integer expected) { |
400 |
> |
assertInvoked(); |
401 |
> |
assertEquals(expected, value); |
402 |
> |
} |
403 |
> |
} |
404 |
> |
|
405 |
> |
static class IntegerSupplier extends CheckedAction |
406 |
> |
implements Supplier<Integer> |
407 |
> |
{ |
408 |
> |
final Integer value; |
409 |
> |
IntegerSupplier(ExecutionMode m, Integer value) { |
410 |
> |
super(m); |
411 |
> |
this.value = value; |
412 |
> |
} |
413 |
> |
public Integer get() { |
414 |
> |
invoked(); |
415 |
> |
return value; |
416 |
> |
} |
417 |
|
} |
418 |
|
|
419 |
|
// A function that handles and produces null values as well. |
421 |
|
return (x == null) ? null : x + 1; |
422 |
|
} |
423 |
|
|
424 |
< |
static final Supplier<Integer> supplyOne = |
425 |
< |
() -> Integer.valueOf(1); |
426 |
< |
static final Function<Integer, Integer> inc = |
427 |
< |
(Integer x) -> Integer.valueOf(x.intValue() + 1); |
341 |
< |
static final BiFunction<Integer, Integer, Integer> subtract = |
342 |
< |
(Integer x, Integer y) -> subtract(x, y); |
343 |
< |
static final class IncAction implements Consumer<Integer> { |
344 |
< |
int invocationCount = 0; |
345 |
< |
Integer value; |
424 |
> |
static class NoopConsumer extends CheckedIntegerAction |
425 |
> |
implements Consumer<Integer> |
426 |
> |
{ |
427 |
> |
NoopConsumer(ExecutionMode m) { super(m); } |
428 |
|
public void accept(Integer x) { |
429 |
< |
invocationCount++; |
430 |
< |
value = inc(x); |
429 |
> |
invoked(); |
430 |
> |
value = x; |
431 |
|
} |
432 |
|
} |
433 |
< |
static final class IncFunction implements Function<Integer,Integer> { |
434 |
< |
int invocationCount = 0; |
435 |
< |
Integer value; |
433 |
> |
|
434 |
> |
static class IncFunction extends CheckedIntegerAction |
435 |
> |
implements Function<Integer,Integer> |
436 |
> |
{ |
437 |
> |
IncFunction(ExecutionMode m) { super(m); } |
438 |
|
public Integer apply(Integer x) { |
439 |
< |
invocationCount++; |
439 |
> |
invoked(); |
440 |
|
return value = inc(x); |
441 |
|
} |
442 |
|
} |
443 |
< |
static final class SubtractAction implements BiConsumer<Integer, Integer> { |
444 |
< |
int invocationCount = 0; |
445 |
< |
Integer value; |
446 |
< |
// Check this action was invoked exactly once when result is computed. |
443 |
> |
|
444 |
> |
// Choose non-commutative actions for better coverage |
445 |
> |
// A non-commutative function that handles and produces null values as well. |
446 |
> |
static Integer subtract(Integer x, Integer y) { |
447 |
> |
return (x == null && y == null) ? null : |
448 |
> |
((x == null) ? 42 : x.intValue()) |
449 |
> |
- ((y == null) ? 99 : y.intValue()); |
450 |
> |
} |
451 |
> |
|
452 |
> |
static class SubtractAction extends CheckedIntegerAction |
453 |
> |
implements BiConsumer<Integer, Integer> |
454 |
> |
{ |
455 |
> |
SubtractAction(ExecutionMode m) { super(m); } |
456 |
|
public void accept(Integer x, Integer y) { |
457 |
< |
invocationCount++; |
457 |
> |
invoked(); |
458 |
|
value = subtract(x, y); |
459 |
|
} |
460 |
|
} |
461 |
< |
static final class SubtractFunction implements BiFunction<Integer, Integer, Integer> { |
462 |
< |
int invocationCount = 0; |
463 |
< |
Integer value; |
464 |
< |
// Check this action was invoked exactly once when result is computed. |
461 |
> |
|
462 |
> |
static class SubtractFunction extends CheckedIntegerAction |
463 |
> |
implements BiFunction<Integer, Integer, Integer> |
464 |
> |
{ |
465 |
> |
SubtractFunction(ExecutionMode m) { super(m); } |
466 |
|
public Integer apply(Integer x, Integer y) { |
467 |
< |
invocationCount++; |
467 |
> |
invoked(); |
468 |
|
return value = subtract(x, y); |
469 |
|
} |
470 |
|
} |
471 |
< |
static final class Noop implements Runnable { |
472 |
< |
final ExecutionMode m; |
473 |
< |
int invocationCount = 0; |
380 |
< |
Noop(ExecutionMode m) { this.m = m; } |
471 |
> |
|
472 |
> |
static class Noop extends CheckedAction implements Runnable { |
473 |
> |
Noop(ExecutionMode m) { super(m); } |
474 |
|
public void run() { |
475 |
< |
m.checkExecutionMode(); |
383 |
< |
invocationCount++; |
475 |
> |
invoked(); |
476 |
|
} |
477 |
|
} |
478 |
|
|
479 |
< |
static final class FailingSupplier implements Supplier<Integer> { |
480 |
< |
int invocationCount = 0; |
479 |
> |
static class FailingSupplier extends CheckedAction |
480 |
> |
implements Supplier<Integer> |
481 |
> |
{ |
482 |
> |
final CFException ex; |
483 |
> |
FailingSupplier(ExecutionMode m) { super(m); ex = new CFException(); } |
484 |
|
public Integer get() { |
485 |
< |
invocationCount++; |
486 |
< |
throw new CFException(); |
485 |
> |
invoked(); |
486 |
> |
throw ex; |
487 |
|
} |
488 |
|
} |
489 |
< |
static final class FailingConsumer implements Consumer<Integer> { |
490 |
< |
int invocationCount = 0; |
489 |
> |
|
490 |
> |
static class FailingConsumer extends CheckedIntegerAction |
491 |
> |
implements Consumer<Integer> |
492 |
> |
{ |
493 |
> |
final CFException ex; |
494 |
> |
FailingConsumer(ExecutionMode m) { super(m); ex = new CFException(); } |
495 |
|
public void accept(Integer x) { |
496 |
< |
invocationCount++; |
497 |
< |
throw new CFException(); |
496 |
> |
invoked(); |
497 |
> |
value = x; |
498 |
> |
throw ex; |
499 |
|
} |
500 |
|
} |
501 |
< |
static final class FailingBiConsumer implements BiConsumer<Integer, Integer> { |
502 |
< |
int invocationCount = 0; |
501 |
> |
|
502 |
> |
static class FailingBiConsumer extends CheckedIntegerAction |
503 |
> |
implements BiConsumer<Integer, Integer> |
504 |
> |
{ |
505 |
> |
final CFException ex; |
506 |
> |
FailingBiConsumer(ExecutionMode m) { super(m); ex = new CFException(); } |
507 |
|
public void accept(Integer x, Integer y) { |
508 |
< |
invocationCount++; |
509 |
< |
throw new CFException(); |
508 |
> |
invoked(); |
509 |
> |
value = subtract(x, y); |
510 |
> |
throw ex; |
511 |
|
} |
512 |
|
} |
513 |
< |
static final class FailingFunction implements Function<Integer, Integer> { |
514 |
< |
int invocationCount = 0; |
513 |
> |
|
514 |
> |
static class FailingFunction extends CheckedIntegerAction |
515 |
> |
implements Function<Integer, Integer> |
516 |
> |
{ |
517 |
> |
final CFException ex; |
518 |
> |
FailingFunction(ExecutionMode m) { super(m); ex = new CFException(); } |
519 |
|
public Integer apply(Integer x) { |
520 |
< |
invocationCount++; |
521 |
< |
throw new CFException(); |
520 |
> |
invoked(); |
521 |
> |
value = x; |
522 |
> |
throw ex; |
523 |
|
} |
524 |
|
} |
525 |
< |
static final class FailingBiFunction implements BiFunction<Integer, Integer, Integer> { |
526 |
< |
int invocationCount = 0; |
525 |
> |
|
526 |
> |
static class FailingBiFunction extends CheckedIntegerAction |
527 |
> |
implements BiFunction<Integer, Integer, Integer> |
528 |
> |
{ |
529 |
> |
final CFException ex; |
530 |
> |
FailingBiFunction(ExecutionMode m) { super(m); ex = new CFException(); } |
531 |
|
public Integer apply(Integer x, Integer y) { |
532 |
< |
invocationCount++; |
533 |
< |
throw new CFException(); |
532 |
> |
invoked(); |
533 |
> |
value = subtract(x, y); |
534 |
> |
throw ex; |
535 |
|
} |
536 |
|
} |
537 |
< |
static final class FailingRunnable implements Runnable { |
538 |
< |
int invocationCount = 0; |
537 |
> |
|
538 |
> |
static class FailingRunnable extends CheckedAction implements Runnable { |
539 |
> |
final CFException ex; |
540 |
> |
FailingRunnable(ExecutionMode m) { super(m); ex = new CFException(); } |
541 |
|
public void run() { |
542 |
< |
invocationCount++; |
543 |
< |
throw new CFException(); |
542 |
> |
invoked(); |
543 |
> |
throw ex; |
544 |
|
} |
545 |
|
} |
546 |
|
|
547 |
< |
static final class CompletableFutureInc |
548 |
< |
implements Function<Integer, CompletableFuture<Integer>> { |
549 |
< |
int invocationCount = 0; |
547 |
> |
static class CompletableFutureInc extends CheckedIntegerAction |
548 |
> |
implements Function<Integer, CompletableFuture<Integer>> |
549 |
> |
{ |
550 |
> |
CompletableFutureInc(ExecutionMode m) { super(m); } |
551 |
|
public CompletableFuture<Integer> apply(Integer x) { |
552 |
< |
invocationCount++; |
553 |
< |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
554 |
< |
f.complete(inc(x)); |
437 |
< |
return f; |
552 |
> |
invoked(); |
553 |
> |
value = x; |
554 |
> |
return CompletableFuture.completedFuture(inc(x)); |
555 |
|
} |
556 |
|
} |
557 |
|
|
558 |
< |
static final class FailingCompletableFutureFunction |
559 |
< |
implements Function<Integer, CompletableFuture<Integer>> { |
560 |
< |
int invocationCount = 0; |
558 |
> |
static class FailingExceptionalCompletableFutureFunction extends CheckedAction |
559 |
> |
implements Function<Throwable, CompletableFuture<Integer>> |
560 |
> |
{ |
561 |
> |
final CFException ex; |
562 |
> |
FailingExceptionalCompletableFutureFunction(ExecutionMode m) { super(m); ex = new CFException(); } |
563 |
> |
public CompletableFuture<Integer> apply(Throwable x) { |
564 |
> |
invoked(); |
565 |
> |
throw ex; |
566 |
> |
} |
567 |
> |
} |
568 |
> |
|
569 |
> |
static class ExceptionalCompletableFutureFunction extends CheckedAction |
570 |
> |
implements Function<Throwable, CompletionStage<Integer>> { |
571 |
> |
final Integer value = 3; |
572 |
> |
ExceptionalCompletableFutureFunction(ExecutionMode m) { super(m); } |
573 |
> |
public CompletionStage<Integer> apply(Throwable x) { |
574 |
> |
invoked(); |
575 |
> |
return CompletableFuture.completedFuture(value); |
576 |
> |
} |
577 |
> |
} |
578 |
> |
|
579 |
> |
static class FailingCompletableFutureFunction extends CheckedIntegerAction |
580 |
> |
implements Function<Integer, CompletableFuture<Integer>> |
581 |
> |
{ |
582 |
> |
final CFException ex; |
583 |
> |
FailingCompletableFutureFunction(ExecutionMode m) { super(m); ex = new CFException(); } |
584 |
|
public CompletableFuture<Integer> apply(Integer x) { |
585 |
< |
invocationCount++; |
586 |
< |
throw new CFException(); |
585 |
> |
invoked(); |
586 |
> |
value = x; |
587 |
> |
throw ex; |
588 |
> |
} |
589 |
> |
} |
590 |
> |
|
591 |
> |
static class CountingRejectingExecutor implements Executor { |
592 |
> |
final RejectedExecutionException ex = new RejectedExecutionException(); |
593 |
> |
final AtomicInteger count = new AtomicInteger(0); |
594 |
> |
public void execute(Runnable r) { |
595 |
> |
count.getAndIncrement(); |
596 |
> |
throw ex; |
597 |
|
} |
598 |
|
} |
599 |
|
|
600 |
|
// Used for explicit executor tests |
601 |
|
static final class ThreadExecutor implements Executor { |
602 |
< |
AtomicInteger count = new AtomicInteger(0); |
602 |
> |
final AtomicInteger count = new AtomicInteger(0); |
603 |
> |
static final ThreadGroup tg = new ThreadGroup("ThreadExecutor"); |
604 |
> |
static boolean startedCurrentThread() { |
605 |
> |
return Thread.currentThread().getThreadGroup() == tg; |
606 |
> |
} |
607 |
|
|
608 |
|
public void execute(Runnable r) { |
609 |
|
count.getAndIncrement(); |
610 |
< |
new Thread(r).start(); |
610 |
> |
new Thread(tg, r).start(); |
611 |
|
} |
612 |
|
} |
613 |
|
|
614 |
+ |
static final boolean defaultExecutorIsCommonPool |
615 |
+ |
= ForkJoinPool.getCommonPoolParallelism() > 1; |
616 |
+ |
|
617 |
|
/** |
618 |
|
* Permits the testing of parallel code for the 3 different |
619 |
< |
* execution modes without repeating all the testing code. |
619 |
> |
* execution modes without copy/pasting all the test methods. |
620 |
|
*/ |
621 |
|
enum ExecutionMode { |
622 |
< |
DEFAULT { |
622 |
> |
SYNC { |
623 |
|
public void checkExecutionMode() { |
624 |
+ |
assertFalse(ThreadExecutor.startedCurrentThread()); |
625 |
|
assertNull(ForkJoinTask.getPool()); |
626 |
|
} |
627 |
+ |
public CompletableFuture<Void> runAsync(Runnable a) { |
628 |
+ |
throw new UnsupportedOperationException(); |
629 |
+ |
} |
630 |
+ |
public <U> CompletableFuture<U> supplyAsync(Supplier<U> a) { |
631 |
+ |
throw new UnsupportedOperationException(); |
632 |
+ |
} |
633 |
|
public <T> CompletableFuture<Void> thenRun |
634 |
|
(CompletableFuture<T> f, Runnable a) { |
635 |
|
return f.thenRun(a); |
691 |
|
Function<? super T,U> a) { |
692 |
|
return f.applyToEither(g, a); |
693 |
|
} |
694 |
+ |
public <T> CompletableFuture<T> exceptionally |
695 |
+ |
(CompletableFuture<T> f, |
696 |
+ |
Function<Throwable, ? extends T> fn) { |
697 |
+ |
return f.exceptionally(fn); |
698 |
+ |
} |
699 |
+ |
public <T> CompletableFuture<T> exceptionallyCompose |
700 |
+ |
(CompletableFuture<T> f, Function<Throwable, ? extends CompletionStage<T>> fn) { |
701 |
+ |
return f.exceptionallyCompose(fn); |
702 |
+ |
} |
703 |
|
}, |
531 |
– |
|
704 |
|
ASYNC { |
705 |
|
public void checkExecutionMode() { |
706 |
< |
assertSame(ForkJoinPool.commonPool(), |
707 |
< |
ForkJoinTask.getPool()); |
706 |
> |
assertEquals(defaultExecutorIsCommonPool, |
707 |
> |
(ForkJoinPool.commonPool() == ForkJoinTask.getPool())); |
708 |
> |
} |
709 |
> |
public CompletableFuture<Void> runAsync(Runnable a) { |
710 |
> |
return CompletableFuture.runAsync(a); |
711 |
> |
} |
712 |
> |
public <U> CompletableFuture<U> supplyAsync(Supplier<U> a) { |
713 |
> |
return CompletableFuture.supplyAsync(a); |
714 |
|
} |
715 |
|
public <T> CompletableFuture<Void> thenRun |
716 |
|
(CompletableFuture<T> f, Runnable a) { |
773 |
|
Function<? super T,U> a) { |
774 |
|
return f.applyToEitherAsync(g, a); |
775 |
|
} |
776 |
+ |
public <T> CompletableFuture<T> exceptionally |
777 |
+ |
(CompletableFuture<T> f, |
778 |
+ |
Function<Throwable, ? extends T> fn) { |
779 |
+ |
return f.exceptionallyAsync(fn); |
780 |
+ |
} |
781 |
+ |
|
782 |
+ |
public <T> CompletableFuture<T> exceptionallyCompose |
783 |
+ |
(CompletableFuture<T> f, Function<Throwable, ? extends CompletionStage<T>> fn) { |
784 |
+ |
return f.exceptionallyComposeAsync(fn); |
785 |
+ |
} |
786 |
+ |
|
787 |
|
}, |
788 |
|
|
789 |
|
EXECUTOR { |
790 |
|
public void checkExecutionMode() { |
791 |
< |
//TODO |
791 |
> |
assertTrue(ThreadExecutor.startedCurrentThread()); |
792 |
> |
} |
793 |
> |
public CompletableFuture<Void> runAsync(Runnable a) { |
794 |
> |
return CompletableFuture.runAsync(a, new ThreadExecutor()); |
795 |
> |
} |
796 |
> |
public <U> CompletableFuture<U> supplyAsync(Supplier<U> a) { |
797 |
> |
return CompletableFuture.supplyAsync(a, new ThreadExecutor()); |
798 |
|
} |
799 |
|
public <T> CompletableFuture<Void> thenRun |
800 |
|
(CompletableFuture<T> f, Runnable a) { |
857 |
|
Function<? super T,U> a) { |
858 |
|
return f.applyToEitherAsync(g, a, new ThreadExecutor()); |
859 |
|
} |
860 |
+ |
public <T> CompletableFuture<T> exceptionally |
861 |
+ |
(CompletableFuture<T> f, |
862 |
+ |
Function<Throwable, ? extends T> fn) { |
863 |
+ |
return f.exceptionallyAsync(fn, new ThreadExecutor()); |
864 |
+ |
} |
865 |
+ |
public <T> CompletableFuture<T> exceptionallyCompose |
866 |
+ |
(CompletableFuture<T> f, Function<Throwable, ? extends CompletionStage<T>> fn) { |
867 |
+ |
return f.exceptionallyComposeAsync(fn, new ThreadExecutor()); |
868 |
+ |
} |
869 |
+ |
|
870 |
|
}; |
871 |
|
|
872 |
|
public abstract void checkExecutionMode(); |
873 |
+ |
public abstract CompletableFuture<Void> runAsync(Runnable a); |
874 |
+ |
public abstract <U> CompletableFuture<U> supplyAsync(Supplier<U> a); |
875 |
|
public abstract <T> CompletableFuture<Void> thenRun |
876 |
|
(CompletableFuture<T> f, Runnable a); |
877 |
|
public abstract <T> CompletableFuture<Void> thenAccept |
909 |
|
(CompletableFuture<T> f, |
910 |
|
CompletionStage<? extends T> g, |
911 |
|
Function<? super T,U> a); |
912 |
+ |
public abstract <T> CompletableFuture<T> exceptionally |
913 |
+ |
(CompletableFuture<T> f, |
914 |
+ |
Function<Throwable, ? extends T> fn); |
915 |
+ |
public abstract <T> CompletableFuture<T> exceptionallyCompose |
916 |
+ |
(CompletableFuture<T> f, |
917 |
+ |
Function<Throwable, ? extends CompletionStage<T>> fn); |
918 |
|
} |
919 |
|
|
920 |
|
/** |
922 |
|
* normally, and source result is propagated |
923 |
|
*/ |
924 |
|
public void testExceptionally_normalCompletion() { |
925 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
926 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
927 |
|
for (Integer v1 : new Integer[] { 1, null }) |
928 |
|
{ |
715 |
– |
final AtomicInteger a = new AtomicInteger(0); |
929 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
930 |
< |
if (!createIncomplete) f.complete(v1); |
931 |
< |
final CompletableFuture<Integer> g = f.exceptionally |
932 |
< |
((Throwable t) -> { |
933 |
< |
// Should not be called |
934 |
< |
a.getAndIncrement(); |
722 |
< |
throw new AssertionError(); |
930 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
931 |
> |
final CompletableFuture<Integer> g = m.exceptionally |
932 |
> |
(f, (Throwable t) -> { |
933 |
> |
threadFail("should not be called"); |
934 |
> |
return null; // unreached |
935 |
|
}); |
936 |
< |
if (createIncomplete) f.complete(v1); |
936 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
937 |
|
|
938 |
|
checkCompletedNormally(g, v1); |
939 |
|
checkCompletedNormally(f, v1); |
728 |
– |
assertEquals(0, a.get()); |
940 |
|
}} |
941 |
|
|
731 |
– |
|
942 |
|
/** |
943 |
|
* exceptionally action completes with function value on source |
944 |
|
* exception |
945 |
|
*/ |
946 |
|
public void testExceptionally_exceptionalCompletion() { |
947 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
948 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
949 |
|
for (Integer v1 : new Integer[] { 1, null }) |
950 |
|
{ |
952 |
|
final CFException ex = new CFException(); |
953 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
954 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
955 |
< |
final CompletableFuture<Integer> g = f.exceptionally |
956 |
< |
((Throwable t) -> { |
955 |
> |
final CompletableFuture<Integer> g = m.exceptionally |
956 |
> |
(f, (Throwable t) -> { |
957 |
> |
m.checkExecutionMode(); |
958 |
|
threadAssertSame(t, ex); |
959 |
|
a.getAndIncrement(); |
960 |
|
return v1; |
965 |
|
assertEquals(1, a.get()); |
966 |
|
}} |
967 |
|
|
968 |
+ |
/** |
969 |
+ |
* If an "exceptionally action" throws an exception, it completes |
970 |
+ |
* exceptionally with that exception |
971 |
+ |
*/ |
972 |
|
public void testExceptionally_exceptionalCompletionActionFailed() { |
973 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
974 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
975 |
+ |
{ |
976 |
+ |
final AtomicInteger a = new AtomicInteger(0); |
977 |
+ |
final CFException ex1 = new CFException(); |
978 |
+ |
final CFException ex2 = new CFException(); |
979 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
980 |
+ |
if (!createIncomplete) f.completeExceptionally(ex1); |
981 |
+ |
final CompletableFuture<Integer> g = m.exceptionally |
982 |
+ |
(f, (Throwable t) -> { |
983 |
+ |
m.checkExecutionMode(); |
984 |
+ |
threadAssertSame(t, ex1); |
985 |
+ |
a.getAndIncrement(); |
986 |
+ |
throw ex2; |
987 |
+ |
}); |
988 |
+ |
if (createIncomplete) f.completeExceptionally(ex1); |
989 |
+ |
|
990 |
+ |
checkCompletedWithWrappedException(g, ex2); |
991 |
+ |
checkCompletedExceptionally(f, ex1); |
992 |
+ |
assertEquals(1, a.get()); |
993 |
+ |
}} |
994 |
+ |
|
995 |
+ |
/** |
996 |
+ |
* whenComplete action executes on normal completion, propagating |
997 |
+ |
* source result. |
998 |
+ |
*/ |
999 |
+ |
public void testWhenComplete_normalCompletion() { |
1000 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
1001 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
1002 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
1003 |
+ |
{ |
1004 |
+ |
final AtomicInteger a = new AtomicInteger(0); |
1005 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1006 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1007 |
+ |
final CompletableFuture<Integer> g = m.whenComplete |
1008 |
+ |
(f, |
1009 |
+ |
(Integer result, Throwable t) -> { |
1010 |
+ |
m.checkExecutionMode(); |
1011 |
+ |
threadAssertSame(result, v1); |
1012 |
+ |
threadAssertNull(t); |
1013 |
+ |
a.getAndIncrement(); |
1014 |
+ |
}); |
1015 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
1016 |
+ |
|
1017 |
+ |
checkCompletedNormally(g, v1); |
1018 |
+ |
checkCompletedNormally(f, v1); |
1019 |
+ |
assertEquals(1, a.get()); |
1020 |
+ |
}} |
1021 |
+ |
|
1022 |
+ |
/** |
1023 |
+ |
* whenComplete action executes on exceptional completion, propagating |
1024 |
+ |
* source result. |
1025 |
+ |
*/ |
1026 |
+ |
public void testWhenComplete_exceptionalCompletion() { |
1027 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
1028 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
1029 |
+ |
{ |
1030 |
+ |
final AtomicInteger a = new AtomicInteger(0); |
1031 |
+ |
final CFException ex = new CFException(); |
1032 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1033 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
1034 |
+ |
final CompletableFuture<Integer> g = m.whenComplete |
1035 |
+ |
(f, |
1036 |
+ |
(Integer result, Throwable t) -> { |
1037 |
+ |
m.checkExecutionMode(); |
1038 |
+ |
threadAssertNull(result); |
1039 |
+ |
threadAssertSame(t, ex); |
1040 |
+ |
a.getAndIncrement(); |
1041 |
+ |
}); |
1042 |
+ |
if (createIncomplete) f.completeExceptionally(ex); |
1043 |
+ |
|
1044 |
+ |
checkCompletedWithWrappedException(g, ex); |
1045 |
+ |
checkCompletedExceptionally(f, ex); |
1046 |
+ |
assertEquals(1, a.get()); |
1047 |
+ |
}} |
1048 |
+ |
|
1049 |
+ |
/** |
1050 |
+ |
* whenComplete action executes on cancelled source, propagating |
1051 |
+ |
* CancellationException. |
1052 |
+ |
*/ |
1053 |
+ |
public void testWhenComplete_sourceCancelled() { |
1054 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
1055 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1056 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
1057 |
+ |
{ |
1058 |
+ |
final AtomicInteger a = new AtomicInteger(0); |
1059 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1060 |
+ |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1061 |
+ |
final CompletableFuture<Integer> g = m.whenComplete |
1062 |
+ |
(f, |
1063 |
+ |
(Integer result, Throwable t) -> { |
1064 |
+ |
m.checkExecutionMode(); |
1065 |
+ |
threadAssertNull(result); |
1066 |
+ |
threadAssertTrue(t instanceof CancellationException); |
1067 |
+ |
a.getAndIncrement(); |
1068 |
+ |
}); |
1069 |
+ |
if (createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1070 |
+ |
|
1071 |
+ |
checkCompletedWithWrappedCancellationException(g); |
1072 |
+ |
checkCancelled(f); |
1073 |
+ |
assertEquals(1, a.get()); |
1074 |
+ |
}} |
1075 |
+ |
|
1076 |
+ |
/** |
1077 |
+ |
* If a whenComplete action throws an exception when triggered by |
1078 |
+ |
* a normal completion, it completes exceptionally |
1079 |
+ |
*/ |
1080 |
+ |
public void testWhenComplete_sourceCompletedNormallyActionFailed() { |
1081 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
1082 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
1083 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1084 |
|
{ |
1085 |
|
final AtomicInteger a = new AtomicInteger(0); |
1086 |
+ |
final CFException ex = new CFException(); |
1087 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1088 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1089 |
+ |
final CompletableFuture<Integer> g = m.whenComplete |
1090 |
+ |
(f, |
1091 |
+ |
(Integer result, Throwable t) -> { |
1092 |
+ |
m.checkExecutionMode(); |
1093 |
+ |
threadAssertSame(result, v1); |
1094 |
+ |
threadAssertNull(t); |
1095 |
+ |
a.getAndIncrement(); |
1096 |
+ |
throw ex; |
1097 |
+ |
}); |
1098 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
1099 |
+ |
|
1100 |
+ |
checkCompletedWithWrappedException(g, ex); |
1101 |
+ |
checkCompletedNormally(f, v1); |
1102 |
+ |
assertEquals(1, a.get()); |
1103 |
+ |
}} |
1104 |
+ |
|
1105 |
+ |
/** |
1106 |
+ |
* If a whenComplete action throws an exception when triggered by |
1107 |
+ |
* a source completion that also throws an exception, the source |
1108 |
+ |
* exception takes precedence (unlike handle) |
1109 |
+ |
*/ |
1110 |
+ |
public void testWhenComplete_sourceFailedActionFailed() { |
1111 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
1112 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
1113 |
+ |
{ |
1114 |
+ |
final AtomicInteger a = new AtomicInteger(0); |
1115 |
|
final CFException ex1 = new CFException(); |
1116 |
|
final CFException ex2 = new CFException(); |
1117 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1118 |
+ |
|
1119 |
|
if (!createIncomplete) f.completeExceptionally(ex1); |
1120 |
< |
final CompletableFuture<Integer> g = f.exceptionally |
1121 |
< |
((Throwable t) -> { |
1120 |
> |
final CompletableFuture<Integer> g = m.whenComplete |
1121 |
> |
(f, |
1122 |
> |
(Integer result, Throwable t) -> { |
1123 |
> |
m.checkExecutionMode(); |
1124 |
|
threadAssertSame(t, ex1); |
1125 |
+ |
threadAssertNull(result); |
1126 |
|
a.getAndIncrement(); |
1127 |
|
throw ex2; |
1128 |
|
}); |
1129 |
|
if (createIncomplete) f.completeExceptionally(ex1); |
1130 |
|
|
1131 |
< |
checkCompletedWithWrappedCFException(g, ex2); |
1131 |
> |
checkCompletedWithWrappedException(g, ex1); |
1132 |
> |
checkCompletedExceptionally(f, ex1); |
1133 |
> |
if (testImplementationDetails) { |
1134 |
> |
assertEquals(1, ex1.getSuppressed().length); |
1135 |
> |
assertSame(ex2, ex1.getSuppressed()[0]); |
1136 |
> |
} |
1137 |
|
assertEquals(1, a.get()); |
1138 |
|
}} |
1139 |
|
|
1148 |
|
{ |
1149 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1150 |
|
final AtomicInteger a = new AtomicInteger(0); |
1151 |
< |
if (!createIncomplete) f.complete(v1); |
1151 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1152 |
|
final CompletableFuture<Integer> g = m.handle |
1153 |
|
(f, |
1154 |
< |
(Integer x, Throwable t) -> { |
1155 |
< |
threadAssertSame(x, v1); |
1154 |
> |
(Integer result, Throwable t) -> { |
1155 |
> |
m.checkExecutionMode(); |
1156 |
> |
threadAssertSame(result, v1); |
1157 |
|
threadAssertNull(t); |
1158 |
|
a.getAndIncrement(); |
1159 |
|
return inc(v1); |
1160 |
|
}); |
1161 |
< |
if (createIncomplete) f.complete(v1); |
1161 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
1162 |
|
|
1163 |
|
checkCompletedNormally(g, inc(v1)); |
1164 |
|
checkCompletedNormally(f, v1); |
1180 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
1181 |
|
final CompletableFuture<Integer> g = m.handle |
1182 |
|
(f, |
1183 |
< |
(Integer x, Throwable t) -> { |
1184 |
< |
threadAssertNull(x); |
1183 |
> |
(Integer result, Throwable t) -> { |
1184 |
> |
m.checkExecutionMode(); |
1185 |
> |
threadAssertNull(result); |
1186 |
|
threadAssertSame(t, ex); |
1187 |
|
a.getAndIncrement(); |
1188 |
|
return v1; |
1190 |
|
if (createIncomplete) f.completeExceptionally(ex); |
1191 |
|
|
1192 |
|
checkCompletedNormally(g, v1); |
1193 |
< |
checkCompletedWithWrappedCFException(f, ex); |
1193 |
> |
checkCompletedExceptionally(f, ex); |
1194 |
|
assertEquals(1, a.get()); |
1195 |
|
}} |
1196 |
|
|
1209 |
|
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1210 |
|
final CompletableFuture<Integer> g = m.handle |
1211 |
|
(f, |
1212 |
< |
(Integer x, Throwable t) -> { |
1213 |
< |
threadAssertNull(x); |
1212 |
> |
(Integer result, Throwable t) -> { |
1213 |
> |
m.checkExecutionMode(); |
1214 |
> |
threadAssertNull(result); |
1215 |
|
threadAssertTrue(t instanceof CancellationException); |
1216 |
|
a.getAndIncrement(); |
1217 |
|
return v1; |
1224 |
|
}} |
1225 |
|
|
1226 |
|
/** |
1227 |
< |
* handle result completes exceptionally if action does |
1227 |
> |
* If a "handle action" throws an exception when triggered by |
1228 |
> |
* a normal completion, it completes exceptionally |
1229 |
|
*/ |
1230 |
< |
public void testHandle_sourceFailedActionFailed() { |
1230 |
> |
public void testHandle_sourceCompletedNormallyActionFailed() { |
1231 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1232 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
1233 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
1234 |
|
{ |
1235 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1236 |
|
final AtomicInteger a = new AtomicInteger(0); |
1237 |
< |
final CFException ex1 = new CFException(); |
1238 |
< |
final CFException ex2 = new CFException(); |
871 |
< |
if (!createIncomplete) f.completeExceptionally(ex1); |
1237 |
> |
final CFException ex = new CFException(); |
1238 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
1239 |
|
final CompletableFuture<Integer> g = m.handle |
1240 |
|
(f, |
1241 |
< |
(Integer x, Throwable t) -> { |
1242 |
< |
threadAssertNull(x); |
1243 |
< |
threadAssertSame(ex1, t); |
1241 |
> |
(Integer result, Throwable t) -> { |
1242 |
> |
m.checkExecutionMode(); |
1243 |
> |
threadAssertSame(result, v1); |
1244 |
> |
threadAssertNull(t); |
1245 |
|
a.getAndIncrement(); |
1246 |
< |
throw ex2; |
1246 |
> |
throw ex; |
1247 |
|
}); |
1248 |
< |
if (createIncomplete) f.completeExceptionally(ex1); |
1248 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
1249 |
|
|
1250 |
< |
checkCompletedWithWrappedCFException(g, ex2); |
1251 |
< |
checkCompletedWithWrappedCFException(f, ex1); |
1250 |
> |
checkCompletedWithWrappedException(g, ex); |
1251 |
> |
checkCompletedNormally(f, v1); |
1252 |
|
assertEquals(1, a.get()); |
1253 |
|
}} |
1254 |
|
|
1255 |
< |
public void testHandle_sourceCompletedNormallyActionFailed() { |
1256 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
1255 |
> |
/** |
1256 |
> |
* If a "handle action" throws an exception when triggered by |
1257 |
> |
* a source completion that also throws an exception, the action |
1258 |
> |
* exception takes precedence (unlike whenComplete) |
1259 |
> |
*/ |
1260 |
> |
public void testHandle_sourceFailedActionFailed() { |
1261 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
1262 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
1262 |
> |
for (ExecutionMode m : ExecutionMode.values()) |
1263 |
|
{ |
892 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1264 |
|
final AtomicInteger a = new AtomicInteger(0); |
1265 |
< |
final CFException ex = new CFException(); |
1266 |
< |
if (!createIncomplete) f.complete(v1); |
1265 |
> |
final CFException ex1 = new CFException(); |
1266 |
> |
final CFException ex2 = new CFException(); |
1267 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1268 |
> |
|
1269 |
> |
if (!createIncomplete) f.completeExceptionally(ex1); |
1270 |
|
final CompletableFuture<Integer> g = m.handle |
1271 |
|
(f, |
1272 |
< |
(Integer x, Throwable t) -> { |
1273 |
< |
threadAssertSame(x, v1); |
1274 |
< |
threadAssertNull(t); |
1272 |
> |
(Integer result, Throwable t) -> { |
1273 |
> |
m.checkExecutionMode(); |
1274 |
> |
threadAssertNull(result); |
1275 |
> |
threadAssertSame(ex1, t); |
1276 |
|
a.getAndIncrement(); |
1277 |
< |
throw ex; |
1277 |
> |
throw ex2; |
1278 |
|
}); |
1279 |
< |
if (createIncomplete) f.complete(v1); |
1279 |
> |
if (createIncomplete) f.completeExceptionally(ex1); |
1280 |
|
|
1281 |
< |
checkCompletedWithWrappedCFException(g, ex); |
1282 |
< |
checkCompletedNormally(f, v1); |
1281 |
> |
checkCompletedWithWrappedException(g, ex2); |
1282 |
> |
checkCompletedExceptionally(f, ex1); |
1283 |
|
assertEquals(1, a.get()); |
1284 |
|
}} |
1285 |
|
|
1286 |
|
/** |
1287 |
|
* runAsync completes after running Runnable |
1288 |
|
*/ |
1289 |
< |
public void testRunAsync() { |
1290 |
< |
Noop r = new Noop(ExecutionMode.ASYNC); |
1291 |
< |
CompletableFuture<Void> f = CompletableFuture.runAsync(r); |
1292 |
< |
assertNull(f.join()); |
1293 |
< |
assertEquals(1, r.invocationCount); |
1294 |
< |
checkCompletedNormally(f, null); |
1295 |
< |
} |
1296 |
< |
|
1297 |
< |
/** |
923 |
< |
* runAsync with executor completes after running Runnable |
924 |
< |
*/ |
925 |
< |
public void testRunAsync2() { |
926 |
< |
Noop r = new Noop(ExecutionMode.EXECUTOR); |
927 |
< |
ThreadExecutor exec = new ThreadExecutor(); |
928 |
< |
CompletableFuture<Void> f = CompletableFuture.runAsync(r, exec); |
1289 |
> |
public void testRunAsync_normalCompletion() { |
1290 |
> |
ExecutionMode[] executionModes = { |
1291 |
> |
ExecutionMode.ASYNC, |
1292 |
> |
ExecutionMode.EXECUTOR, |
1293 |
> |
}; |
1294 |
> |
for (ExecutionMode m : executionModes) |
1295 |
> |
{ |
1296 |
> |
final Noop r = new Noop(m); |
1297 |
> |
final CompletableFuture<Void> f = m.runAsync(r); |
1298 |
|
assertNull(f.join()); |
930 |
– |
assertEquals(1, r.invocationCount); |
1299 |
|
checkCompletedNormally(f, null); |
1300 |
< |
assertEquals(1, exec.count.get()); |
1301 |
< |
} |
1300 |
> |
r.assertInvoked(); |
1301 |
> |
}} |
1302 |
|
|
1303 |
|
/** |
1304 |
|
* failing runAsync completes exceptionally after running Runnable |
1305 |
|
*/ |
1306 |
< |
public void testRunAsync3() { |
1307 |
< |
FailingRunnable r = new FailingRunnable(); |
1308 |
< |
CompletableFuture<Void> f = CompletableFuture.runAsync(r); |
1309 |
< |
checkCompletedWithWrappedCFException(f); |
1310 |
< |
assertEquals(1, r.invocationCount); |
1311 |
< |
} |
1306 |
> |
public void testRunAsync_exceptionalCompletion() { |
1307 |
> |
ExecutionMode[] executionModes = { |
1308 |
> |
ExecutionMode.ASYNC, |
1309 |
> |
ExecutionMode.EXECUTOR, |
1310 |
> |
}; |
1311 |
> |
for (ExecutionMode m : executionModes) |
1312 |
> |
{ |
1313 |
> |
final FailingRunnable r = new FailingRunnable(m); |
1314 |
> |
final CompletableFuture<Void> f = m.runAsync(r); |
1315 |
> |
checkCompletedWithWrappedException(f, r.ex); |
1316 |
> |
r.assertInvoked(); |
1317 |
> |
}} |
1318 |
|
|
1319 |
< |
/** |
1320 |
< |
* supplyAsync completes with result of supplier |
1321 |
< |
*/ |
1322 |
< |
public void testSupplyAsync() { |
1323 |
< |
CompletableFuture<Integer> f; |
1324 |
< |
f = CompletableFuture.supplyAsync(supplyOne); |
1325 |
< |
assertEquals(f.join(), one); |
1326 |
< |
checkCompletedNormally(f, one); |
1319 |
> |
@SuppressWarnings("FutureReturnValueIgnored") |
1320 |
> |
public void testRunAsync_rejectingExecutor() { |
1321 |
> |
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1322 |
> |
try { |
1323 |
> |
CompletableFuture.runAsync(() -> {}, e); |
1324 |
> |
shouldThrow(); |
1325 |
> |
} catch (Throwable t) { |
1326 |
> |
assertSame(e.ex, t); |
1327 |
> |
} |
1328 |
> |
|
1329 |
> |
assertEquals(1, e.count.get()); |
1330 |
|
} |
1331 |
|
|
1332 |
|
/** |
1333 |
< |
* supplyAsync with executor completes with result of supplier |
1333 |
> |
* supplyAsync completes with result of supplier |
1334 |
|
*/ |
1335 |
< |
public void testSupplyAsync2() { |
1336 |
< |
CompletableFuture<Integer> f; |
1337 |
< |
f = CompletableFuture.supplyAsync(supplyOne, new ThreadExecutor()); |
1338 |
< |
assertEquals(f.join(), one); |
1339 |
< |
checkCompletedNormally(f, one); |
1340 |
< |
} |
1335 |
> |
public void testSupplyAsync_normalCompletion() { |
1336 |
> |
ExecutionMode[] executionModes = { |
1337 |
> |
ExecutionMode.ASYNC, |
1338 |
> |
ExecutionMode.EXECUTOR, |
1339 |
> |
}; |
1340 |
> |
for (ExecutionMode m : executionModes) |
1341 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
1342 |
> |
{ |
1343 |
> |
final IntegerSupplier r = new IntegerSupplier(m, v1); |
1344 |
> |
final CompletableFuture<Integer> f = m.supplyAsync(r); |
1345 |
> |
assertSame(v1, f.join()); |
1346 |
> |
checkCompletedNormally(f, v1); |
1347 |
> |
r.assertInvoked(); |
1348 |
> |
}} |
1349 |
|
|
1350 |
|
/** |
1351 |
|
* Failing supplyAsync completes exceptionally |
1352 |
|
*/ |
1353 |
< |
public void testSupplyAsync3() { |
1354 |
< |
FailingSupplier r = new FailingSupplier(); |
1355 |
< |
CompletableFuture<Integer> f = CompletableFuture.supplyAsync(r); |
1356 |
< |
checkCompletedWithWrappedCFException(f); |
1357 |
< |
assertEquals(1, r.invocationCount); |
1353 |
> |
public void testSupplyAsync_exceptionalCompletion() { |
1354 |
> |
ExecutionMode[] executionModes = { |
1355 |
> |
ExecutionMode.ASYNC, |
1356 |
> |
ExecutionMode.EXECUTOR, |
1357 |
> |
}; |
1358 |
> |
for (ExecutionMode m : executionModes) |
1359 |
> |
{ |
1360 |
> |
FailingSupplier r = new FailingSupplier(m); |
1361 |
> |
CompletableFuture<Integer> f = m.supplyAsync(r); |
1362 |
> |
checkCompletedWithWrappedException(f, r.ex); |
1363 |
> |
r.assertInvoked(); |
1364 |
> |
}} |
1365 |
> |
|
1366 |
> |
@SuppressWarnings("FutureReturnValueIgnored") |
1367 |
> |
public void testSupplyAsync_rejectingExecutor() { |
1368 |
> |
CountingRejectingExecutor e = new CountingRejectingExecutor(); |
1369 |
> |
try { |
1370 |
> |
CompletableFuture.supplyAsync(() -> null, e); |
1371 |
> |
shouldThrow(); |
1372 |
> |
} catch (Throwable t) { |
1373 |
> |
assertSame(e.ex, t); |
1374 |
> |
} |
1375 |
> |
|
1376 |
> |
assertEquals(1, e.count.get()); |
1377 |
|
} |
1378 |
|
|
1379 |
|
// seq completion methods |
1383 |
|
*/ |
1384 |
|
public void testThenRun_normalCompletion() { |
1385 |
|
for (ExecutionMode m : ExecutionMode.values()) |
982 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1386 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1387 |
|
{ |
1388 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1389 |
< |
final Noop r = new Noop(m); |
1390 |
< |
if (!createIncomplete) f.complete(v1); |
988 |
< |
final CompletableFuture<Void> g = m.thenRun(f, r); |
989 |
< |
if (createIncomplete) { |
990 |
< |
checkIncomplete(g); |
991 |
< |
f.complete(v1); |
992 |
< |
} |
1389 |
> |
final Noop[] rs = new Noop[6]; |
1390 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1391 |
|
|
1392 |
< |
checkCompletedNormally(g, null); |
1392 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1393 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1394 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1395 |
> |
checkIncomplete(h0); |
1396 |
> |
checkIncomplete(h1); |
1397 |
> |
checkIncomplete(h2); |
1398 |
> |
assertTrue(f.complete(v1)); |
1399 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1400 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1401 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1402 |
> |
|
1403 |
> |
checkCompletedNormally(h0, null); |
1404 |
> |
checkCompletedNormally(h1, null); |
1405 |
> |
checkCompletedNormally(h2, null); |
1406 |
> |
checkCompletedNormally(h3, null); |
1407 |
> |
checkCompletedNormally(h4, null); |
1408 |
> |
checkCompletedNormally(h5, null); |
1409 |
|
checkCompletedNormally(f, v1); |
1410 |
< |
assertEquals(1, r.invocationCount); |
1410 |
> |
for (Noop r : rs) r.assertInvoked(); |
1411 |
|
}} |
1412 |
|
|
1413 |
|
/** |
1416 |
|
*/ |
1417 |
|
public void testThenRun_exceptionalCompletion() { |
1418 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1005 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1419 |
|
{ |
1420 |
|
final CFException ex = new CFException(); |
1421 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1422 |
< |
final Noop r = new Noop(m); |
1423 |
< |
if (!createIncomplete) f.completeExceptionally(ex); |
1011 |
< |
final CompletableFuture<Void> g = m.thenRun(f, r); |
1012 |
< |
if (createIncomplete) { |
1013 |
< |
checkIncomplete(g); |
1014 |
< |
f.completeExceptionally(ex); |
1015 |
< |
} |
1422 |
> |
final Noop[] rs = new Noop[6]; |
1423 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1424 |
|
|
1425 |
< |
checkCompletedWithWrappedCFException(g, ex); |
1426 |
< |
checkCompletedWithWrappedCFException(f, ex); |
1427 |
< |
assertEquals(0, r.invocationCount); |
1425 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1426 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1427 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1428 |
> |
checkIncomplete(h0); |
1429 |
> |
checkIncomplete(h1); |
1430 |
> |
checkIncomplete(h2); |
1431 |
> |
assertTrue(f.completeExceptionally(ex)); |
1432 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1433 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1434 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1435 |
> |
|
1436 |
> |
checkCompletedWithWrappedException(h0, ex); |
1437 |
> |
checkCompletedWithWrappedException(h1, ex); |
1438 |
> |
checkCompletedWithWrappedException(h2, ex); |
1439 |
> |
checkCompletedWithWrappedException(h3, ex); |
1440 |
> |
checkCompletedWithWrappedException(h4, ex); |
1441 |
> |
checkCompletedWithWrappedException(h5, ex); |
1442 |
> |
checkCompletedExceptionally(f, ex); |
1443 |
> |
for (Noop r : rs) r.assertNotInvoked(); |
1444 |
|
}} |
1445 |
|
|
1446 |
|
/** |
1448 |
|
*/ |
1449 |
|
public void testThenRun_sourceCancelled() { |
1450 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1027 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1451 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1452 |
|
{ |
1453 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1454 |
< |
final Noop r = new Noop(m); |
1455 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1033 |
< |
final CompletableFuture<Void> g = f.thenRun(r); |
1034 |
< |
if (createIncomplete) { |
1035 |
< |
checkIncomplete(g); |
1036 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1037 |
< |
} |
1454 |
> |
final Noop[] rs = new Noop[6]; |
1455 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
1456 |
|
|
1457 |
< |
checkCompletedWithWrappedCancellationException(g); |
1457 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1458 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1459 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1460 |
> |
checkIncomplete(h0); |
1461 |
> |
checkIncomplete(h1); |
1462 |
> |
checkIncomplete(h2); |
1463 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1464 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1465 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1466 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1467 |
> |
|
1468 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1469 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1470 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1471 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1472 |
> |
checkCompletedWithWrappedCancellationException(h4); |
1473 |
> |
checkCompletedWithWrappedCancellationException(h5); |
1474 |
|
checkCancelled(f); |
1475 |
< |
assertEquals(0, r.invocationCount); |
1475 |
> |
for (Noop r : rs) r.assertNotInvoked(); |
1476 |
|
}} |
1477 |
|
|
1478 |
|
/** |
1480 |
|
*/ |
1481 |
|
public void testThenRun_actionFailed() { |
1482 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1049 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1483 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1484 |
|
{ |
1485 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1486 |
< |
final FailingRunnable r = new FailingRunnable(); |
1487 |
< |
if (!createIncomplete) f.complete(v1); |
1055 |
< |
final CompletableFuture<Void> g = f.thenRun(r); |
1056 |
< |
if (createIncomplete) { |
1057 |
< |
checkIncomplete(g); |
1058 |
< |
f.complete(v1); |
1059 |
< |
} |
1486 |
> |
final FailingRunnable[] rs = new FailingRunnable[6]; |
1487 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingRunnable(m); |
1488 |
|
|
1489 |
< |
checkCompletedWithWrappedCFException(g); |
1489 |
> |
final CompletableFuture<Void> h0 = m.thenRun(f, rs[0]); |
1490 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, f, rs[1]); |
1491 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, f, rs[2]); |
1492 |
> |
assertTrue(f.complete(v1)); |
1493 |
> |
final CompletableFuture<Void> h3 = m.thenRun(f, rs[3]); |
1494 |
> |
final CompletableFuture<Void> h4 = m.runAfterBoth(f, f, rs[4]); |
1495 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(f, f, rs[5]); |
1496 |
> |
|
1497 |
> |
checkCompletedWithWrappedException(h0, rs[0].ex); |
1498 |
> |
checkCompletedWithWrappedException(h1, rs[1].ex); |
1499 |
> |
checkCompletedWithWrappedException(h2, rs[2].ex); |
1500 |
> |
checkCompletedWithWrappedException(h3, rs[3].ex); |
1501 |
> |
checkCompletedWithWrappedException(h4, rs[4].ex); |
1502 |
> |
checkCompletedWithWrappedException(h5, rs[5].ex); |
1503 |
|
checkCompletedNormally(f, v1); |
1504 |
|
}} |
1505 |
|
|
1508 |
|
*/ |
1509 |
|
public void testThenApply_normalCompletion() { |
1510 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1070 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1511 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1512 |
|
{ |
1513 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1514 |
< |
final IncFunction r = new IncFunction(); |
1515 |
< |
if (!createIncomplete) f.complete(v1); |
1076 |
< |
final CompletableFuture<Integer> g = m.thenApply(f, r); |
1077 |
< |
if (createIncomplete) { |
1078 |
< |
checkIncomplete(g); |
1079 |
< |
f.complete(v1); |
1080 |
< |
} |
1514 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1515 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1516 |
|
|
1517 |
< |
checkCompletedNormally(g, inc(v1)); |
1517 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1518 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1519 |
> |
checkIncomplete(h0); |
1520 |
> |
checkIncomplete(h1); |
1521 |
> |
assertTrue(f.complete(v1)); |
1522 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1523 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1524 |
> |
|
1525 |
> |
checkCompletedNormally(h0, inc(v1)); |
1526 |
> |
checkCompletedNormally(h1, inc(v1)); |
1527 |
> |
checkCompletedNormally(h2, inc(v1)); |
1528 |
> |
checkCompletedNormally(h3, inc(v1)); |
1529 |
|
checkCompletedNormally(f, v1); |
1530 |
< |
assertEquals(1, r.invocationCount); |
1530 |
> |
for (IncFunction r : rs) r.assertValue(inc(v1)); |
1531 |
|
}} |
1532 |
|
|
1533 |
|
/** |
1536 |
|
*/ |
1537 |
|
public void testThenApply_exceptionalCompletion() { |
1538 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1093 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1539 |
|
{ |
1540 |
|
final CFException ex = new CFException(); |
1541 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1542 |
< |
final IncFunction r = new IncFunction(); |
1543 |
< |
if (!createIncomplete) f.completeExceptionally(ex); |
1099 |
< |
final CompletableFuture<Integer> g = m.thenApply(f, r); |
1100 |
< |
if (createIncomplete) { |
1101 |
< |
checkIncomplete(g); |
1102 |
< |
f.completeExceptionally(ex); |
1103 |
< |
} |
1542 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1543 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1544 |
|
|
1545 |
< |
checkCompletedWithWrappedCFException(g, ex); |
1546 |
< |
checkCompletedWithWrappedCFException(f, ex); |
1547 |
< |
assertEquals(0, r.invocationCount); |
1545 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1546 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1547 |
> |
assertTrue(f.completeExceptionally(ex)); |
1548 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1549 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1550 |
> |
|
1551 |
> |
checkCompletedWithWrappedException(h0, ex); |
1552 |
> |
checkCompletedWithWrappedException(h1, ex); |
1553 |
> |
checkCompletedWithWrappedException(h2, ex); |
1554 |
> |
checkCompletedWithWrappedException(h3, ex); |
1555 |
> |
checkCompletedExceptionally(f, ex); |
1556 |
> |
for (IncFunction r : rs) r.assertNotInvoked(); |
1557 |
|
}} |
1558 |
|
|
1559 |
|
/** |
1561 |
|
*/ |
1562 |
|
public void testThenApply_sourceCancelled() { |
1563 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1115 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1564 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1565 |
|
{ |
1566 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1567 |
< |
final IncFunction r = new IncFunction(); |
1568 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1121 |
< |
final CompletableFuture<Integer> g = f.thenApply(r); |
1122 |
< |
if (createIncomplete) { |
1123 |
< |
checkIncomplete(g); |
1124 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1125 |
< |
} |
1567 |
> |
final IncFunction[] rs = new IncFunction[4]; |
1568 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
1569 |
|
|
1570 |
< |
checkCompletedWithWrappedCancellationException(g); |
1570 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1571 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1572 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1573 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1574 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1575 |
> |
|
1576 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1577 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1578 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1579 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1580 |
|
checkCancelled(f); |
1581 |
< |
assertEquals(0, r.invocationCount); |
1581 |
> |
for (IncFunction r : rs) r.assertNotInvoked(); |
1582 |
|
}} |
1583 |
|
|
1584 |
|
/** |
1586 |
|
*/ |
1587 |
|
public void testThenApply_actionFailed() { |
1588 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1137 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1589 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1590 |
|
{ |
1591 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1592 |
< |
final FailingFunction r = new FailingFunction(); |
1593 |
< |
if (!createIncomplete) f.complete(v1); |
1143 |
< |
final CompletableFuture<Integer> g = f.thenApply(r); |
1144 |
< |
if (createIncomplete) { |
1145 |
< |
checkIncomplete(g); |
1146 |
< |
f.complete(v1); |
1147 |
< |
} |
1592 |
> |
final FailingFunction[] rs = new FailingFunction[4]; |
1593 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingFunction(m); |
1594 |
|
|
1595 |
< |
checkCompletedWithWrappedCFException(g); |
1595 |
> |
final CompletableFuture<Integer> h0 = m.thenApply(f, rs[0]); |
1596 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(f, f, rs[1]); |
1597 |
> |
assertTrue(f.complete(v1)); |
1598 |
> |
final CompletableFuture<Integer> h2 = m.thenApply(f, rs[2]); |
1599 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(f, f, rs[3]); |
1600 |
> |
|
1601 |
> |
checkCompletedWithWrappedException(h0, rs[0].ex); |
1602 |
> |
checkCompletedWithWrappedException(h1, rs[1].ex); |
1603 |
> |
checkCompletedWithWrappedException(h2, rs[2].ex); |
1604 |
> |
checkCompletedWithWrappedException(h3, rs[3].ex); |
1605 |
|
checkCompletedNormally(f, v1); |
1606 |
|
}} |
1607 |
|
|
1610 |
|
*/ |
1611 |
|
public void testThenAccept_normalCompletion() { |
1612 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1158 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1613 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1614 |
|
{ |
1615 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1616 |
< |
final IncAction r = new IncAction(); |
1617 |
< |
if (!createIncomplete) f.complete(v1); |
1164 |
< |
final CompletableFuture<Void> g = m.thenAccept(f, r); |
1165 |
< |
if (createIncomplete) { |
1166 |
< |
checkIncomplete(g); |
1167 |
< |
f.complete(v1); |
1168 |
< |
} |
1616 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1617 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1618 |
|
|
1619 |
< |
checkCompletedNormally(g, null); |
1619 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1620 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1621 |
> |
checkIncomplete(h0); |
1622 |
> |
checkIncomplete(h1); |
1623 |
> |
assertTrue(f.complete(v1)); |
1624 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1625 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1626 |
> |
|
1627 |
> |
checkCompletedNormally(h0, null); |
1628 |
> |
checkCompletedNormally(h1, null); |
1629 |
> |
checkCompletedNormally(h2, null); |
1630 |
> |
checkCompletedNormally(h3, null); |
1631 |
|
checkCompletedNormally(f, v1); |
1632 |
< |
assertEquals(1, r.invocationCount); |
1173 |
< |
assertEquals(inc(v1), r.value); |
1632 |
> |
for (NoopConsumer r : rs) r.assertValue(v1); |
1633 |
|
}} |
1634 |
|
|
1635 |
|
/** |
1638 |
|
*/ |
1639 |
|
public void testThenAccept_exceptionalCompletion() { |
1640 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1182 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1641 |
|
{ |
1642 |
|
final CFException ex = new CFException(); |
1643 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1644 |
< |
final IncAction r = new IncAction(); |
1645 |
< |
if (!createIncomplete) f.completeExceptionally(ex); |
1188 |
< |
final CompletableFuture<Void> g = m.thenAccept(f, r); |
1189 |
< |
if (createIncomplete) { |
1190 |
< |
checkIncomplete(g); |
1191 |
< |
f.completeExceptionally(ex); |
1192 |
< |
} |
1644 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1645 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1646 |
|
|
1647 |
< |
checkCompletedWithWrappedCFException(g, ex); |
1648 |
< |
checkCompletedWithWrappedCFException(f, ex); |
1649 |
< |
assertEquals(0, r.invocationCount); |
1647 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1648 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1649 |
> |
assertTrue(f.completeExceptionally(ex)); |
1650 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1651 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1652 |
> |
|
1653 |
> |
checkCompletedWithWrappedException(h0, ex); |
1654 |
> |
checkCompletedWithWrappedException(h1, ex); |
1655 |
> |
checkCompletedWithWrappedException(h2, ex); |
1656 |
> |
checkCompletedWithWrappedException(h3, ex); |
1657 |
> |
checkCompletedExceptionally(f, ex); |
1658 |
> |
for (NoopConsumer r : rs) r.assertNotInvoked(); |
1659 |
|
}} |
1660 |
|
|
1661 |
|
/** |
1662 |
< |
* thenAccept result completes exceptionally if action does |
1662 |
> |
* thenAccept result completes exceptionally if source cancelled |
1663 |
|
*/ |
1664 |
< |
public void testThenAccept_actionFailed() { |
1664 |
> |
public void testThenAccept_sourceCancelled() { |
1665 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1666 |
< |
for (boolean createIncomplete : new boolean[] { true, false }) |
1205 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
1666 |
> |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1667 |
|
{ |
1668 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1669 |
< |
final FailingConsumer r = new FailingConsumer(); |
1670 |
< |
if (!createIncomplete) f.complete(v1); |
1210 |
< |
final CompletableFuture<Void> g = f.thenAccept(r); |
1211 |
< |
if (createIncomplete) { |
1212 |
< |
checkIncomplete(g); |
1213 |
< |
f.complete(v1); |
1214 |
< |
} |
1669 |
> |
final NoopConsumer[] rs = new NoopConsumer[4]; |
1670 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
1671 |
|
|
1672 |
< |
checkCompletedWithWrappedCFException(g); |
1673 |
< |
checkCompletedNormally(f, v1); |
1672 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1673 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1674 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1675 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1676 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1677 |
> |
|
1678 |
> |
checkCompletedWithWrappedCancellationException(h0); |
1679 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1680 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1681 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1682 |
> |
checkCancelled(f); |
1683 |
> |
for (NoopConsumer r : rs) r.assertNotInvoked(); |
1684 |
|
}} |
1685 |
|
|
1686 |
|
/** |
1687 |
< |
* thenAccept result completes exceptionally if source cancelled |
1687 |
> |
* thenAccept result completes exceptionally if action does |
1688 |
|
*/ |
1689 |
< |
public void testThenAccept_sourceCancelled() { |
1689 |
> |
public void testThenAccept_actionFailed() { |
1690 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1691 |
< |
for (boolean createIncomplete : new boolean[] { true, false }) |
1226 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1691 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
1692 |
|
{ |
1693 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1694 |
< |
final IncAction r = new IncAction(); |
1695 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
1231 |
< |
final CompletableFuture<Void> g = f.thenAccept(r); |
1232 |
< |
if (createIncomplete) { |
1233 |
< |
checkIncomplete(g); |
1234 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
1235 |
< |
} |
1694 |
> |
final FailingConsumer[] rs = new FailingConsumer[4]; |
1695 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingConsumer(m); |
1696 |
|
|
1697 |
< |
checkCompletedWithWrappedCancellationException(g); |
1698 |
< |
checkCancelled(f); |
1699 |
< |
assertEquals(0, r.invocationCount); |
1697 |
> |
final CompletableFuture<Void> h0 = m.thenAccept(f, rs[0]); |
1698 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(f, f, rs[1]); |
1699 |
> |
assertTrue(f.complete(v1)); |
1700 |
> |
final CompletableFuture<Void> h2 = m.thenAccept(f, rs[2]); |
1701 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(f, f, rs[3]); |
1702 |
> |
|
1703 |
> |
checkCompletedWithWrappedException(h0, rs[0].ex); |
1704 |
> |
checkCompletedWithWrappedException(h1, rs[1].ex); |
1705 |
> |
checkCompletedWithWrappedException(h2, rs[2].ex); |
1706 |
> |
checkCompletedWithWrappedException(h3, rs[3].ex); |
1707 |
> |
checkCompletedNormally(f, v1); |
1708 |
|
}} |
1709 |
|
|
1710 |
|
/** |
1713 |
|
*/ |
1714 |
|
public void testThenCombine_normalCompletion() { |
1715 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1248 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1716 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1717 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1718 |
|
for (Integer v2 : new Integer[] { 2, null }) |
1719 |
|
{ |
1720 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1721 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1722 |
< |
final SubtractFunction r = new SubtractFunction(); |
1722 |
> |
final SubtractFunction[] rs = new SubtractFunction[6]; |
1723 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new SubtractFunction(m); |
1724 |
|
|
1725 |
< |
if (fFirst) f.complete(v1); else g.complete(v2); |
1726 |
< |
if (!createIncomplete) |
1727 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
1728 |
< |
final CompletableFuture<Integer> h = m.thenCombine(f, g, r); |
1729 |
< |
if (createIncomplete) { |
1730 |
< |
checkIncomplete(h); |
1731 |
< |
assertEquals(0, r.invocationCount); |
1732 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
1733 |
< |
} |
1725 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1726 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1727 |
> |
final Integer w1 = fFirst ? v1 : v2; |
1728 |
> |
final Integer w2 = !fFirst ? v1 : v2; |
1729 |
> |
|
1730 |
> |
final CompletableFuture<Integer> h0 = m.thenCombine(f, g, rs[0]); |
1731 |
> |
final CompletableFuture<Integer> h1 = m.thenCombine(fst, fst, rs[1]); |
1732 |
> |
assertTrue(fst.complete(w1)); |
1733 |
> |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, rs[2]); |
1734 |
> |
final CompletableFuture<Integer> h3 = m.thenCombine(fst, fst, rs[3]); |
1735 |
> |
checkIncomplete(h0); rs[0].assertNotInvoked(); |
1736 |
> |
checkIncomplete(h2); rs[2].assertNotInvoked(); |
1737 |
> |
checkCompletedNormally(h1, subtract(w1, w1)); |
1738 |
> |
checkCompletedNormally(h3, subtract(w1, w1)); |
1739 |
> |
rs[1].assertValue(subtract(w1, w1)); |
1740 |
> |
rs[3].assertValue(subtract(w1, w1)); |
1741 |
> |
assertTrue(snd.complete(w2)); |
1742 |
> |
final CompletableFuture<Integer> h4 = m.thenCombine(f, g, rs[4]); |
1743 |
> |
|
1744 |
> |
checkCompletedNormally(h0, subtract(v1, v2)); |
1745 |
> |
checkCompletedNormally(h2, subtract(v1, v2)); |
1746 |
> |
checkCompletedNormally(h4, subtract(v1, v2)); |
1747 |
> |
rs[0].assertValue(subtract(v1, v2)); |
1748 |
> |
rs[2].assertValue(subtract(v1, v2)); |
1749 |
> |
rs[4].assertValue(subtract(v1, v2)); |
1750 |
|
|
1267 |
– |
checkCompletedNormally(h, subtract(v1, v2)); |
1751 |
|
checkCompletedNormally(f, v1); |
1752 |
|
checkCompletedNormally(g, v2); |
1270 |
– |
assertEquals(1, r.invocationCount); |
1753 |
|
}} |
1754 |
|
|
1755 |
|
/** |
1756 |
|
* thenCombine result completes exceptionally after exceptional |
1757 |
|
* completion of either source |
1758 |
|
*/ |
1759 |
< |
public void testThenCombine_exceptionalCompletion() { |
1759 |
> |
public void testThenCombine_exceptionalCompletion() throws Throwable { |
1760 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1279 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1761 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1762 |
+ |
for (boolean failFirst : new boolean[] { true, false }) |
1763 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1764 |
|
{ |
1765 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1766 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1767 |
|
final CFException ex = new CFException(); |
1768 |
< |
final SubtractFunction r = new SubtractFunction(); |
1769 |
< |
|
1770 |
< |
(fFirst ? f : g).complete(v1); |
1771 |
< |
if (!createIncomplete) |
1772 |
< |
(!fFirst ? f : g).completeExceptionally(ex); |
1773 |
< |
final CompletableFuture<Integer> h = m.thenCombine(f, g, r); |
1774 |
< |
if (createIncomplete) { |
1775 |
< |
checkIncomplete(h); |
1776 |
< |
(!fFirst ? f : g).completeExceptionally(ex); |
1777 |
< |
} |
1778 |
< |
|
1779 |
< |
checkCompletedWithWrappedCFException(h, ex); |
1780 |
< |
assertEquals(0, r.invocationCount); |
1781 |
< |
checkCompletedNormally(fFirst ? f : g, v1); |
1782 |
< |
checkCompletedWithWrappedCFException(!fFirst ? f : g, ex); |
1768 |
> |
final SubtractFunction r1 = new SubtractFunction(m); |
1769 |
> |
final SubtractFunction r2 = new SubtractFunction(m); |
1770 |
> |
final SubtractFunction r3 = new SubtractFunction(m); |
1771 |
> |
|
1772 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1773 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1774 |
> |
final Callable<Boolean> complete1 = failFirst ? |
1775 |
> |
() -> fst.completeExceptionally(ex) : |
1776 |
> |
() -> fst.complete(v1); |
1777 |
> |
final Callable<Boolean> complete2 = failFirst ? |
1778 |
> |
() -> snd.complete(v1) : |
1779 |
> |
() -> snd.completeExceptionally(ex); |
1780 |
> |
|
1781 |
> |
final CompletableFuture<Integer> h1 = m.thenCombine(f, g, r1); |
1782 |
> |
assertTrue(complete1.call()); |
1783 |
> |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, r2); |
1784 |
> |
checkIncomplete(h1); |
1785 |
> |
checkIncomplete(h2); |
1786 |
> |
assertTrue(complete2.call()); |
1787 |
> |
final CompletableFuture<Integer> h3 = m.thenCombine(f, g, r3); |
1788 |
> |
|
1789 |
> |
checkCompletedWithWrappedException(h1, ex); |
1790 |
> |
checkCompletedWithWrappedException(h2, ex); |
1791 |
> |
checkCompletedWithWrappedException(h3, ex); |
1792 |
> |
r1.assertNotInvoked(); |
1793 |
> |
r2.assertNotInvoked(); |
1794 |
> |
r3.assertNotInvoked(); |
1795 |
> |
checkCompletedNormally(failFirst ? snd : fst, v1); |
1796 |
> |
checkCompletedExceptionally(failFirst ? fst : snd, ex); |
1797 |
|
}} |
1798 |
|
|
1799 |
|
/** |
1800 |
< |
* thenCombine result completes exceptionally if action does |
1800 |
> |
* thenCombine result completes exceptionally if either source cancelled |
1801 |
|
*/ |
1802 |
< |
public void testThenCombine_actionFailed() { |
1802 |
> |
public void testThenCombine_sourceCancelled() throws Throwable { |
1803 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1804 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1805 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1806 |
+ |
for (boolean failFirst : new boolean[] { true, false }) |
1807 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1310 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
1808 |
|
{ |
1809 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1810 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1811 |
< |
final FailingBiFunction r = new FailingBiFunction(); |
1812 |
< |
final CompletableFuture<Integer> h = m.thenCombine(f, g, r); |
1813 |
< |
|
1814 |
< |
if (fFirst) { |
1815 |
< |
f.complete(v1); |
1816 |
< |
g.complete(v2); |
1817 |
< |
} else { |
1818 |
< |
g.complete(v2); |
1819 |
< |
f.complete(v1); |
1820 |
< |
} |
1821 |
< |
|
1822 |
< |
checkCompletedWithWrappedCFException(h); |
1823 |
< |
checkCompletedNormally(f, v1); |
1824 |
< |
checkCompletedNormally(g, v2); |
1811 |
> |
final SubtractFunction r1 = new SubtractFunction(m); |
1812 |
> |
final SubtractFunction r2 = new SubtractFunction(m); |
1813 |
> |
final SubtractFunction r3 = new SubtractFunction(m); |
1814 |
> |
|
1815 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1816 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1817 |
> |
final Callable<Boolean> complete1 = failFirst ? |
1818 |
> |
() -> fst.cancel(mayInterruptIfRunning) : |
1819 |
> |
() -> fst.complete(v1); |
1820 |
> |
final Callable<Boolean> complete2 = failFirst ? |
1821 |
> |
() -> snd.complete(v1) : |
1822 |
> |
() -> snd.cancel(mayInterruptIfRunning); |
1823 |
> |
|
1824 |
> |
final CompletableFuture<Integer> h1 = m.thenCombine(f, g, r1); |
1825 |
> |
assertTrue(complete1.call()); |
1826 |
> |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, r2); |
1827 |
> |
checkIncomplete(h1); |
1828 |
> |
checkIncomplete(h2); |
1829 |
> |
assertTrue(complete2.call()); |
1830 |
> |
final CompletableFuture<Integer> h3 = m.thenCombine(f, g, r3); |
1831 |
> |
|
1832 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1833 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1834 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1835 |
> |
r1.assertNotInvoked(); |
1836 |
> |
r2.assertNotInvoked(); |
1837 |
> |
r3.assertNotInvoked(); |
1838 |
> |
checkCompletedNormally(failFirst ? snd : fst, v1); |
1839 |
> |
checkCancelled(failFirst ? fst : snd); |
1840 |
|
}} |
1841 |
|
|
1842 |
|
/** |
1843 |
< |
* thenCombine result completes exceptionally if either source cancelled |
1843 |
> |
* thenCombine result completes exceptionally if action does |
1844 |
|
*/ |
1845 |
< |
public void testThenCombine_sourceCancelled() { |
1845 |
> |
public void testThenCombine_actionFailed() { |
1846 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1335 |
– |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1336 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1847 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1848 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1849 |
+ |
for (Integer v2 : new Integer[] { 2, null }) |
1850 |
|
{ |
1851 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1852 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1853 |
< |
final SubtractFunction r = new SubtractFunction(); |
1854 |
< |
|
1855 |
< |
(fFirst ? f : g).complete(v1); |
1856 |
< |
if (!createIncomplete) |
1857 |
< |
assertTrue((!fFirst ? f : g).cancel(mayInterruptIfRunning)); |
1858 |
< |
final CompletableFuture<Integer> h = m.thenCombine(f, g, r); |
1859 |
< |
if (createIncomplete) { |
1860 |
< |
checkIncomplete(h); |
1861 |
< |
assertTrue((!fFirst ? f : g).cancel(mayInterruptIfRunning)); |
1862 |
< |
} |
1863 |
< |
|
1864 |
< |
checkCompletedWithWrappedCancellationException(h); |
1865 |
< |
checkCancelled(!fFirst ? f : g); |
1866 |
< |
assertEquals(0, r.invocationCount); |
1867 |
< |
checkCompletedNormally(fFirst ? f : g, v1); |
1853 |
> |
final FailingBiFunction r1 = new FailingBiFunction(m); |
1854 |
> |
final FailingBiFunction r2 = new FailingBiFunction(m); |
1855 |
> |
final FailingBiFunction r3 = new FailingBiFunction(m); |
1856 |
> |
|
1857 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1858 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1859 |
> |
final Integer w1 = fFirst ? v1 : v2; |
1860 |
> |
final Integer w2 = !fFirst ? v1 : v2; |
1861 |
> |
|
1862 |
> |
final CompletableFuture<Integer> h1 = m.thenCombine(f, g, r1); |
1863 |
> |
assertTrue(fst.complete(w1)); |
1864 |
> |
final CompletableFuture<Integer> h2 = m.thenCombine(f, g, r2); |
1865 |
> |
assertTrue(snd.complete(w2)); |
1866 |
> |
final CompletableFuture<Integer> h3 = m.thenCombine(f, g, r3); |
1867 |
> |
|
1868 |
> |
checkCompletedWithWrappedException(h1, r1.ex); |
1869 |
> |
checkCompletedWithWrappedException(h2, r2.ex); |
1870 |
> |
checkCompletedWithWrappedException(h3, r3.ex); |
1871 |
> |
r1.assertInvoked(); |
1872 |
> |
r2.assertInvoked(); |
1873 |
> |
r3.assertInvoked(); |
1874 |
> |
checkCompletedNormally(f, v1); |
1875 |
> |
checkCompletedNormally(g, v2); |
1876 |
|
}} |
1877 |
|
|
1878 |
|
/** |
1881 |
|
*/ |
1882 |
|
public void testThenAcceptBoth_normalCompletion() { |
1883 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1365 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1884 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1885 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1886 |
|
for (Integer v2 : new Integer[] { 2, null }) |
1887 |
|
{ |
1888 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1889 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1890 |
< |
final SubtractAction r = new SubtractAction(); |
1891 |
< |
|
1892 |
< |
if (fFirst) f.complete(v1); else g.complete(v2); |
1893 |
< |
if (!createIncomplete) |
1894 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
1895 |
< |
final CompletableFuture<Void> h = m.thenAcceptBoth(f, g, r); |
1896 |
< |
if (createIncomplete) { |
1897 |
< |
checkIncomplete(h); |
1898 |
< |
assertEquals(0, r.invocationCount); |
1899 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
1900 |
< |
} |
1901 |
< |
|
1902 |
< |
checkCompletedNormally(h, null); |
1903 |
< |
assertEquals(subtract(v1, v2), r.value); |
1890 |
> |
final SubtractAction r1 = new SubtractAction(m); |
1891 |
> |
final SubtractAction r2 = new SubtractAction(m); |
1892 |
> |
final SubtractAction r3 = new SubtractAction(m); |
1893 |
> |
|
1894 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1895 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1896 |
> |
final Integer w1 = fFirst ? v1 : v2; |
1897 |
> |
final Integer w2 = !fFirst ? v1 : v2; |
1898 |
> |
|
1899 |
> |
final CompletableFuture<Void> h1 = m.thenAcceptBoth(f, g, r1); |
1900 |
> |
assertTrue(fst.complete(w1)); |
1901 |
> |
final CompletableFuture<Void> h2 = m.thenAcceptBoth(f, g, r2); |
1902 |
> |
checkIncomplete(h1); |
1903 |
> |
checkIncomplete(h2); |
1904 |
> |
r1.assertNotInvoked(); |
1905 |
> |
r2.assertNotInvoked(); |
1906 |
> |
assertTrue(snd.complete(w2)); |
1907 |
> |
final CompletableFuture<Void> h3 = m.thenAcceptBoth(f, g, r3); |
1908 |
> |
|
1909 |
> |
checkCompletedNormally(h1, null); |
1910 |
> |
checkCompletedNormally(h2, null); |
1911 |
> |
checkCompletedNormally(h3, null); |
1912 |
> |
r1.assertValue(subtract(v1, v2)); |
1913 |
> |
r2.assertValue(subtract(v1, v2)); |
1914 |
> |
r3.assertValue(subtract(v1, v2)); |
1915 |
|
checkCompletedNormally(f, v1); |
1916 |
|
checkCompletedNormally(g, v2); |
1917 |
|
}} |
1920 |
|
* thenAcceptBoth result completes exceptionally after exceptional |
1921 |
|
* completion of either source |
1922 |
|
*/ |
1923 |
< |
public void testThenAcceptBoth_exceptionalCompletion() { |
1923 |
> |
public void testThenAcceptBoth_exceptionalCompletion() throws Throwable { |
1924 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1396 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1925 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1926 |
+ |
for (boolean failFirst : new boolean[] { true, false }) |
1927 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1928 |
|
{ |
1929 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1930 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1931 |
|
final CFException ex = new CFException(); |
1932 |
< |
final SubtractAction r = new SubtractAction(); |
1933 |
< |
|
1934 |
< |
(fFirst ? f : g).complete(v1); |
1935 |
< |
if (!createIncomplete) |
1936 |
< |
(!fFirst ? f : g).completeExceptionally(ex); |
1937 |
< |
final CompletableFuture<Void> h = m.thenAcceptBoth(f, g, r); |
1938 |
< |
if (createIncomplete) { |
1939 |
< |
checkIncomplete(h); |
1940 |
< |
(!fFirst ? f : g).completeExceptionally(ex); |
1941 |
< |
} |
1942 |
< |
|
1943 |
< |
checkCompletedWithWrappedCFException(h, ex); |
1944 |
< |
assertEquals(0, r.invocationCount); |
1945 |
< |
checkCompletedNormally(fFirst ? f : g, v1); |
1946 |
< |
checkCompletedWithWrappedCFException(!fFirst ? f : g, ex); |
1932 |
> |
final SubtractAction r1 = new SubtractAction(m); |
1933 |
> |
final SubtractAction r2 = new SubtractAction(m); |
1934 |
> |
final SubtractAction r3 = new SubtractAction(m); |
1935 |
> |
|
1936 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1937 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1938 |
> |
final Callable<Boolean> complete1 = failFirst ? |
1939 |
> |
() -> fst.completeExceptionally(ex) : |
1940 |
> |
() -> fst.complete(v1); |
1941 |
> |
final Callable<Boolean> complete2 = failFirst ? |
1942 |
> |
() -> snd.complete(v1) : |
1943 |
> |
() -> snd.completeExceptionally(ex); |
1944 |
> |
|
1945 |
> |
final CompletableFuture<Void> h1 = m.thenAcceptBoth(f, g, r1); |
1946 |
> |
assertTrue(complete1.call()); |
1947 |
> |
final CompletableFuture<Void> h2 = m.thenAcceptBoth(f, g, r2); |
1948 |
> |
checkIncomplete(h1); |
1949 |
> |
checkIncomplete(h2); |
1950 |
> |
assertTrue(complete2.call()); |
1951 |
> |
final CompletableFuture<Void> h3 = m.thenAcceptBoth(f, g, r3); |
1952 |
> |
|
1953 |
> |
checkCompletedWithWrappedException(h1, ex); |
1954 |
> |
checkCompletedWithWrappedException(h2, ex); |
1955 |
> |
checkCompletedWithWrappedException(h3, ex); |
1956 |
> |
r1.assertNotInvoked(); |
1957 |
> |
r2.assertNotInvoked(); |
1958 |
> |
r3.assertNotInvoked(); |
1959 |
> |
checkCompletedNormally(failFirst ? snd : fst, v1); |
1960 |
> |
checkCompletedExceptionally(failFirst ? fst : snd, ex); |
1961 |
|
}} |
1962 |
|
|
1963 |
|
/** |
1964 |
< |
* thenAcceptBoth result completes exceptionally if action does |
1964 |
> |
* thenAcceptBoth result completes exceptionally if either source cancelled |
1965 |
|
*/ |
1966 |
< |
public void testThenAcceptBoth_actionFailed() { |
1966 |
> |
public void testThenAcceptBoth_sourceCancelled() throws Throwable { |
1967 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1968 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1969 |
|
for (boolean fFirst : new boolean[] { true, false }) |
1970 |
+ |
for (boolean failFirst : new boolean[] { true, false }) |
1971 |
|
for (Integer v1 : new Integer[] { 1, null }) |
1427 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
1972 |
|
{ |
1973 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1974 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1975 |
< |
final FailingBiConsumer r = new FailingBiConsumer(); |
1976 |
< |
final CompletableFuture<Void> h = m.thenAcceptBoth(f, g, r); |
1977 |
< |
|
1978 |
< |
if (fFirst) { |
1979 |
< |
f.complete(v1); |
1980 |
< |
g.complete(v2); |
1981 |
< |
} else { |
1982 |
< |
g.complete(v2); |
1983 |
< |
f.complete(v1); |
1984 |
< |
} |
1985 |
< |
|
1986 |
< |
checkCompletedWithWrappedCFException(h); |
1987 |
< |
checkCompletedNormally(f, v1); |
1988 |
< |
checkCompletedNormally(g, v2); |
1975 |
> |
final SubtractAction r1 = new SubtractAction(m); |
1976 |
> |
final SubtractAction r2 = new SubtractAction(m); |
1977 |
> |
final SubtractAction r3 = new SubtractAction(m); |
1978 |
> |
|
1979 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
1980 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
1981 |
> |
final Callable<Boolean> complete1 = failFirst ? |
1982 |
> |
() -> fst.cancel(mayInterruptIfRunning) : |
1983 |
> |
() -> fst.complete(v1); |
1984 |
> |
final Callable<Boolean> complete2 = failFirst ? |
1985 |
> |
() -> snd.complete(v1) : |
1986 |
> |
() -> snd.cancel(mayInterruptIfRunning); |
1987 |
> |
|
1988 |
> |
final CompletableFuture<Void> h1 = m.thenAcceptBoth(f, g, r1); |
1989 |
> |
assertTrue(complete1.call()); |
1990 |
> |
final CompletableFuture<Void> h2 = m.thenAcceptBoth(f, g, r2); |
1991 |
> |
checkIncomplete(h1); |
1992 |
> |
checkIncomplete(h2); |
1993 |
> |
assertTrue(complete2.call()); |
1994 |
> |
final CompletableFuture<Void> h3 = m.thenAcceptBoth(f, g, r3); |
1995 |
> |
|
1996 |
> |
checkCompletedWithWrappedCancellationException(h1); |
1997 |
> |
checkCompletedWithWrappedCancellationException(h2); |
1998 |
> |
checkCompletedWithWrappedCancellationException(h3); |
1999 |
> |
r1.assertNotInvoked(); |
2000 |
> |
r2.assertNotInvoked(); |
2001 |
> |
r3.assertNotInvoked(); |
2002 |
> |
checkCompletedNormally(failFirst ? snd : fst, v1); |
2003 |
> |
checkCancelled(failFirst ? fst : snd); |
2004 |
|
}} |
2005 |
|
|
2006 |
|
/** |
2007 |
< |
* thenAcceptBoth result completes exceptionally if either source cancelled |
2007 |
> |
* thenAcceptBoth result completes exceptionally if action does |
2008 |
|
*/ |
2009 |
< |
public void testThenAcceptBoth_sourceCancelled() { |
2009 |
> |
public void testThenAcceptBoth_actionFailed() { |
2010 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1452 |
– |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1453 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
2011 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2012 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2013 |
+ |
for (Integer v2 : new Integer[] { 2, null }) |
2014 |
|
{ |
2015 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2016 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2017 |
< |
final SubtractAction r = new SubtractAction(); |
2018 |
< |
|
2019 |
< |
(fFirst ? f : g).complete(v1); |
2020 |
< |
if (!createIncomplete) |
2021 |
< |
assertTrue((!fFirst ? f : g).cancel(mayInterruptIfRunning)); |
2022 |
< |
final CompletableFuture<Void> h = m.thenAcceptBoth(f, g, r); |
2023 |
< |
if (createIncomplete) { |
2024 |
< |
checkIncomplete(h); |
2025 |
< |
assertTrue((!fFirst ? f : g).cancel(mayInterruptIfRunning)); |
2026 |
< |
} |
2027 |
< |
|
2028 |
< |
checkCompletedWithWrappedCancellationException(h); |
2029 |
< |
checkCancelled(!fFirst ? f : g); |
2030 |
< |
assertEquals(0, r.invocationCount); |
2031 |
< |
checkCompletedNormally(fFirst ? f : g, v1); |
2017 |
> |
final FailingBiConsumer r1 = new FailingBiConsumer(m); |
2018 |
> |
final FailingBiConsumer r2 = new FailingBiConsumer(m); |
2019 |
> |
final FailingBiConsumer r3 = new FailingBiConsumer(m); |
2020 |
> |
|
2021 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
2022 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
2023 |
> |
final Integer w1 = fFirst ? v1 : v2; |
2024 |
> |
final Integer w2 = !fFirst ? v1 : v2; |
2025 |
> |
|
2026 |
> |
final CompletableFuture<Void> h1 = m.thenAcceptBoth(f, g, r1); |
2027 |
> |
assertTrue(fst.complete(w1)); |
2028 |
> |
final CompletableFuture<Void> h2 = m.thenAcceptBoth(f, g, r2); |
2029 |
> |
assertTrue(snd.complete(w2)); |
2030 |
> |
final CompletableFuture<Void> h3 = m.thenAcceptBoth(f, g, r3); |
2031 |
> |
|
2032 |
> |
checkCompletedWithWrappedException(h1, r1.ex); |
2033 |
> |
checkCompletedWithWrappedException(h2, r2.ex); |
2034 |
> |
checkCompletedWithWrappedException(h3, r3.ex); |
2035 |
> |
r1.assertInvoked(); |
2036 |
> |
r2.assertInvoked(); |
2037 |
> |
r3.assertInvoked(); |
2038 |
> |
checkCompletedNormally(f, v1); |
2039 |
> |
checkCompletedNormally(g, v2); |
2040 |
|
}} |
2041 |
|
|
2042 |
|
/** |
2045 |
|
*/ |
2046 |
|
public void testRunAfterBoth_normalCompletion() { |
2047 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1482 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
2048 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2049 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2050 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2051 |
|
{ |
2052 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2053 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2054 |
< |
final Noop r = new Noop(m); |
2055 |
< |
|
2056 |
< |
if (fFirst) f.complete(v1); else g.complete(v2); |
2057 |
< |
if (!createIncomplete) |
2058 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
2059 |
< |
final CompletableFuture<Void> h = m.runAfterBoth(f, g, r); |
2060 |
< |
if (createIncomplete) { |
2061 |
< |
checkIncomplete(h); |
2062 |
< |
assertEquals(0, r.invocationCount); |
2063 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
2064 |
< |
} |
2065 |
< |
|
2066 |
< |
checkCompletedNormally(h, null); |
2067 |
< |
assertEquals(1, r.invocationCount); |
2054 |
> |
final Noop r1 = new Noop(m); |
2055 |
> |
final Noop r2 = new Noop(m); |
2056 |
> |
final Noop r3 = new Noop(m); |
2057 |
> |
|
2058 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
2059 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
2060 |
> |
final Integer w1 = fFirst ? v1 : v2; |
2061 |
> |
final Integer w2 = !fFirst ? v1 : v2; |
2062 |
> |
|
2063 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, g, r1); |
2064 |
> |
assertTrue(fst.complete(w1)); |
2065 |
> |
final CompletableFuture<Void> h2 = m.runAfterBoth(f, g, r2); |
2066 |
> |
checkIncomplete(h1); |
2067 |
> |
checkIncomplete(h2); |
2068 |
> |
r1.assertNotInvoked(); |
2069 |
> |
r2.assertNotInvoked(); |
2070 |
> |
assertTrue(snd.complete(w2)); |
2071 |
> |
final CompletableFuture<Void> h3 = m.runAfterBoth(f, g, r3); |
2072 |
> |
|
2073 |
> |
checkCompletedNormally(h1, null); |
2074 |
> |
checkCompletedNormally(h2, null); |
2075 |
> |
checkCompletedNormally(h3, null); |
2076 |
> |
r1.assertInvoked(); |
2077 |
> |
r2.assertInvoked(); |
2078 |
> |
r3.assertInvoked(); |
2079 |
|
checkCompletedNormally(f, v1); |
2080 |
|
checkCompletedNormally(g, v2); |
2081 |
|
}} |
2084 |
|
* runAfterBoth result completes exceptionally after exceptional |
2085 |
|
* completion of either source |
2086 |
|
*/ |
2087 |
< |
public void testRunAfterBoth_exceptionalCompletion() { |
2087 |
> |
public void testRunAfterBoth_exceptionalCompletion() throws Throwable { |
2088 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1513 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
2089 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2090 |
+ |
for (boolean failFirst : new boolean[] { true, false }) |
2091 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2092 |
|
{ |
2093 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2094 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2095 |
|
final CFException ex = new CFException(); |
2096 |
< |
final Noop r = new Noop(m); |
2097 |
< |
|
2098 |
< |
(fFirst ? f : g).complete(v1); |
2099 |
< |
if (!createIncomplete) |
2100 |
< |
(!fFirst ? f : g).completeExceptionally(ex); |
2101 |
< |
final CompletableFuture<Void> h = m.runAfterBoth(f, g, r); |
2102 |
< |
if (createIncomplete) { |
2103 |
< |
checkIncomplete(h); |
2104 |
< |
(!fFirst ? f : g).completeExceptionally(ex); |
2105 |
< |
} |
2106 |
< |
|
2107 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2108 |
< |
assertEquals(0, r.invocationCount); |
2109 |
< |
checkCompletedNormally(fFirst ? f : g, v1); |
2110 |
< |
checkCompletedWithWrappedCFException(!fFirst ? f : g, ex); |
2111 |
< |
}} |
2112 |
< |
|
2113 |
< |
/** |
2114 |
< |
* runAfterBoth result completes exceptionally if action does |
2115 |
< |
*/ |
2116 |
< |
public void testRunAfterBoth_actionFailed() { |
2117 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
2118 |
< |
for (boolean fFirst : new boolean[] { true, false }) |
2119 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
2120 |
< |
for (Integer v2 : new Integer[] { 2, null }) |
2121 |
< |
{ |
2122 |
< |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2123 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2124 |
< |
final FailingRunnable r = new FailingRunnable(); |
1549 |
< |
|
1550 |
< |
CompletableFuture<Void> h1 = m.runAfterBoth(f, g, r); |
1551 |
< |
if (fFirst) { |
1552 |
< |
f.complete(v1); |
1553 |
< |
g.complete(v2); |
1554 |
< |
} else { |
1555 |
< |
g.complete(v2); |
1556 |
< |
f.complete(v1); |
1557 |
< |
} |
1558 |
< |
CompletableFuture<Void> h2 = m.runAfterBoth(f, g, r); |
1559 |
< |
|
1560 |
< |
checkCompletedWithWrappedCFException(h1); |
1561 |
< |
checkCompletedWithWrappedCFException(h2); |
1562 |
< |
checkCompletedNormally(f, v1); |
1563 |
< |
checkCompletedNormally(g, v2); |
2096 |
> |
final Noop r1 = new Noop(m); |
2097 |
> |
final Noop r2 = new Noop(m); |
2098 |
> |
final Noop r3 = new Noop(m); |
2099 |
> |
|
2100 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
2101 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
2102 |
> |
final Callable<Boolean> complete1 = failFirst ? |
2103 |
> |
() -> fst.completeExceptionally(ex) : |
2104 |
> |
() -> fst.complete(v1); |
2105 |
> |
final Callable<Boolean> complete2 = failFirst ? |
2106 |
> |
() -> snd.complete(v1) : |
2107 |
> |
() -> snd.completeExceptionally(ex); |
2108 |
> |
|
2109 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, g, r1); |
2110 |
> |
assertTrue(complete1.call()); |
2111 |
> |
final CompletableFuture<Void> h2 = m.runAfterBoth(f, g, r2); |
2112 |
> |
checkIncomplete(h1); |
2113 |
> |
checkIncomplete(h2); |
2114 |
> |
assertTrue(complete2.call()); |
2115 |
> |
final CompletableFuture<Void> h3 = m.runAfterBoth(f, g, r3); |
2116 |
> |
|
2117 |
> |
checkCompletedWithWrappedException(h1, ex); |
2118 |
> |
checkCompletedWithWrappedException(h2, ex); |
2119 |
> |
checkCompletedWithWrappedException(h3, ex); |
2120 |
> |
r1.assertNotInvoked(); |
2121 |
> |
r2.assertNotInvoked(); |
2122 |
> |
r3.assertNotInvoked(); |
2123 |
> |
checkCompletedNormally(failFirst ? snd : fst, v1); |
2124 |
> |
checkCompletedExceptionally(failFirst ? fst : snd, ex); |
2125 |
|
}} |
2126 |
|
|
2127 |
|
/** |
2128 |
|
* runAfterBoth result completes exceptionally if either source cancelled |
2129 |
|
*/ |
2130 |
< |
public void testRunAfterBoth_sourceCancelled() { |
2130 |
> |
public void testRunAfterBoth_sourceCancelled() throws Throwable { |
2131 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2132 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1572 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
2133 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2134 |
+ |
for (boolean failFirst : new boolean[] { true, false }) |
2135 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2136 |
|
{ |
2137 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2138 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2139 |
< |
final Noop r = new Noop(m); |
2140 |
< |
|
2141 |
< |
|
2142 |
< |
(fFirst ? f : g).complete(v1); |
2143 |
< |
if (!createIncomplete) |
2144 |
< |
assertTrue((!fFirst ? f : g).cancel(mayInterruptIfRunning)); |
2145 |
< |
final CompletableFuture<Void> h = m.runAfterBoth(f, g, r); |
2146 |
< |
if (createIncomplete) { |
2147 |
< |
checkIncomplete(h); |
2148 |
< |
assertTrue((!fFirst ? f : g).cancel(mayInterruptIfRunning)); |
2149 |
< |
} |
2150 |
< |
|
2151 |
< |
checkCompletedWithWrappedCancellationException(h); |
2152 |
< |
checkCancelled(!fFirst ? f : g); |
2153 |
< |
assertEquals(0, r.invocationCount); |
2154 |
< |
checkCompletedNormally(fFirst ? f : g, v1); |
2139 |
> |
final Noop r1 = new Noop(m); |
2140 |
> |
final Noop r2 = new Noop(m); |
2141 |
> |
final Noop r3 = new Noop(m); |
2142 |
> |
|
2143 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
2144 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
2145 |
> |
final Callable<Boolean> complete1 = failFirst ? |
2146 |
> |
() -> fst.cancel(mayInterruptIfRunning) : |
2147 |
> |
() -> fst.complete(v1); |
2148 |
> |
final Callable<Boolean> complete2 = failFirst ? |
2149 |
> |
() -> snd.complete(v1) : |
2150 |
> |
() -> snd.cancel(mayInterruptIfRunning); |
2151 |
> |
|
2152 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, g, r1); |
2153 |
> |
assertTrue(complete1.call()); |
2154 |
> |
final CompletableFuture<Void> h2 = m.runAfterBoth(f, g, r2); |
2155 |
> |
checkIncomplete(h1); |
2156 |
> |
checkIncomplete(h2); |
2157 |
> |
assertTrue(complete2.call()); |
2158 |
> |
final CompletableFuture<Void> h3 = m.runAfterBoth(f, g, r3); |
2159 |
> |
|
2160 |
> |
checkCompletedWithWrappedCancellationException(h1); |
2161 |
> |
checkCompletedWithWrappedCancellationException(h2); |
2162 |
> |
checkCompletedWithWrappedCancellationException(h3); |
2163 |
> |
r1.assertNotInvoked(); |
2164 |
> |
r2.assertNotInvoked(); |
2165 |
> |
r3.assertNotInvoked(); |
2166 |
> |
checkCompletedNormally(failFirst ? snd : fst, v1); |
2167 |
> |
checkCancelled(failFirst ? fst : snd); |
2168 |
|
}} |
2169 |
|
|
2170 |
|
/** |
2171 |
< |
* applyToEither result completes normally after normal completion |
1598 |
< |
* of either source |
2171 |
> |
* runAfterBoth result completes exceptionally if action does |
2172 |
|
*/ |
2173 |
< |
public void testApplyToEither_normalCompletion() { |
2173 |
> |
public void testRunAfterBoth_actionFailed() { |
2174 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1602 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
2175 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2176 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2177 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2178 |
|
{ |
2179 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2180 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2181 |
< |
final IncFunction r = new IncFunction(); |
2182 |
< |
|
2183 |
< |
if (!createIncomplete) |
2184 |
< |
if (fFirst) f.complete(v1); else g.complete(v2); |
2185 |
< |
final CompletableFuture<Integer> h = m.applyToEither(f, g, r); |
2186 |
< |
if (createIncomplete) { |
2187 |
< |
checkIncomplete(h); |
2188 |
< |
assertEquals(0, r.invocationCount); |
2189 |
< |
if (fFirst) f.complete(v1); else g.complete(v2); |
2190 |
< |
} |
2191 |
< |
checkCompletedNormally(h, inc(fFirst ? v1 : v2)); |
2192 |
< |
if (!fFirst) f.complete(v1); else g.complete(v2); |
2193 |
< |
|
2181 |
> |
final FailingRunnable r1 = new FailingRunnable(m); |
2182 |
> |
final FailingRunnable r2 = new FailingRunnable(m); |
2183 |
> |
final FailingRunnable r3 = new FailingRunnable(m); |
2184 |
> |
|
2185 |
> |
final CompletableFuture<Integer> fst = fFirst ? f : g; |
2186 |
> |
final CompletableFuture<Integer> snd = !fFirst ? f : g; |
2187 |
> |
final Integer w1 = fFirst ? v1 : v2; |
2188 |
> |
final Integer w2 = !fFirst ? v1 : v2; |
2189 |
> |
|
2190 |
> |
final CompletableFuture<Void> h1 = m.runAfterBoth(f, g, r1); |
2191 |
> |
assertTrue(fst.complete(w1)); |
2192 |
> |
final CompletableFuture<Void> h2 = m.runAfterBoth(f, g, r2); |
2193 |
> |
assertTrue(snd.complete(w2)); |
2194 |
> |
final CompletableFuture<Void> h3 = m.runAfterBoth(f, g, r3); |
2195 |
> |
|
2196 |
> |
checkCompletedWithWrappedException(h1, r1.ex); |
2197 |
> |
checkCompletedWithWrappedException(h2, r2.ex); |
2198 |
> |
checkCompletedWithWrappedException(h3, r3.ex); |
2199 |
> |
r1.assertInvoked(); |
2200 |
> |
r2.assertInvoked(); |
2201 |
> |
r3.assertInvoked(); |
2202 |
|
checkCompletedNormally(f, v1); |
2203 |
|
checkCompletedNormally(g, v2); |
1624 |
– |
checkCompletedNormally(h, inc(fFirst ? v1 : v2)); |
2204 |
|
}} |
2205 |
|
|
2206 |
< |
public void testApplyToEither_normalCompletionBothAvailable() { |
2206 |
> |
/** |
2207 |
> |
* applyToEither result completes normally after normal completion |
2208 |
> |
* of either source |
2209 |
> |
*/ |
2210 |
> |
public void testApplyToEither_normalCompletion() { |
2211 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1629 |
– |
for (boolean fFirst : new boolean[] { true, false }) |
2212 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2213 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2214 |
|
{ |
2215 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2216 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2217 |
< |
final IncFunction r = new IncFunction(); |
2217 |
> |
final IncFunction[] rs = new IncFunction[6]; |
2218 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
2219 |
|
|
2220 |
< |
if (fFirst) { |
2221 |
< |
f.complete(v1); |
2222 |
< |
g.complete(v2); |
2223 |
< |
} else { |
2224 |
< |
g.complete(v2); |
2225 |
< |
f.complete(v1); |
2226 |
< |
} |
2220 |
> |
final CompletableFuture<Integer> h0 = m.applyToEither(f, g, rs[0]); |
2221 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(g, f, rs[1]); |
2222 |
> |
checkIncomplete(h0); |
2223 |
> |
checkIncomplete(h1); |
2224 |
> |
rs[0].assertNotInvoked(); |
2225 |
> |
rs[1].assertNotInvoked(); |
2226 |
> |
f.complete(v1); |
2227 |
> |
checkCompletedNormally(h0, inc(v1)); |
2228 |
> |
checkCompletedNormally(h1, inc(v1)); |
2229 |
> |
final CompletableFuture<Integer> h2 = m.applyToEither(f, g, rs[2]); |
2230 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(g, f, rs[3]); |
2231 |
> |
checkCompletedNormally(h2, inc(v1)); |
2232 |
> |
checkCompletedNormally(h3, inc(v1)); |
2233 |
> |
g.complete(v2); |
2234 |
|
|
2235 |
< |
final CompletableFuture<Integer> h = m.applyToEither(f, g, r); |
2235 |
> |
// unspecified behavior - both source completions available |
2236 |
> |
final CompletableFuture<Integer> h4 = m.applyToEither(f, g, rs[4]); |
2237 |
> |
final CompletableFuture<Integer> h5 = m.applyToEither(g, f, rs[5]); |
2238 |
> |
rs[4].assertValue(h4.join()); |
2239 |
> |
rs[5].assertValue(h5.join()); |
2240 |
> |
assertTrue(Objects.equals(inc(v1), h4.join()) || |
2241 |
> |
Objects.equals(inc(v2), h4.join())); |
2242 |
> |
assertTrue(Objects.equals(inc(v1), h5.join()) || |
2243 |
> |
Objects.equals(inc(v2), h5.join())); |
2244 |
|
|
2245 |
|
checkCompletedNormally(f, v1); |
2246 |
|
checkCompletedNormally(g, v2); |
2247 |
< |
|
2248 |
< |
// unspecified behavior |
2249 |
< |
assertTrue(Objects.equals(h.join(), inc(v1)) || |
2250 |
< |
Objects.equals(h.join(), inc(v2))); |
2251 |
< |
assertEquals(1, r.invocationCount); |
2247 |
> |
checkCompletedNormally(h0, inc(v1)); |
2248 |
> |
checkCompletedNormally(h1, inc(v1)); |
2249 |
> |
checkCompletedNormally(h2, inc(v1)); |
2250 |
> |
checkCompletedNormally(h3, inc(v1)); |
2251 |
> |
for (int i = 0; i < 4; i++) rs[i].assertValue(inc(v1)); |
2252 |
|
}} |
2253 |
|
|
2254 |
|
/** |
2255 |
|
* applyToEither result completes exceptionally after exceptional |
2256 |
|
* completion of either source |
2257 |
|
*/ |
2258 |
< |
public void testApplyToEither_exceptionalCompletion1() { |
2258 |
> |
public void testApplyToEither_exceptionalCompletion() { |
2259 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1662 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1663 |
– |
for (boolean fFirst : new boolean[] { true, false }) |
2260 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2261 |
|
{ |
2262 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2263 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2264 |
|
final CFException ex = new CFException(); |
2265 |
< |
final IncFunction r = new IncFunction(); |
2265 |
> |
final IncFunction[] rs = new IncFunction[6]; |
2266 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
2267 |
|
|
2268 |
< |
if (!createIncomplete) (fFirst ? f : g).completeExceptionally(ex); |
2269 |
< |
final CompletableFuture<Integer> h = m.applyToEither(f, g, r); |
2270 |
< |
if (createIncomplete) { |
2271 |
< |
checkIncomplete(h); |
2272 |
< |
assertEquals(0, r.invocationCount); |
2273 |
< |
(fFirst ? f : g).completeExceptionally(ex); |
2268 |
> |
final CompletableFuture<Integer> h0 = m.applyToEither(f, g, rs[0]); |
2269 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(g, f, rs[1]); |
2270 |
> |
checkIncomplete(h0); |
2271 |
> |
checkIncomplete(h1); |
2272 |
> |
rs[0].assertNotInvoked(); |
2273 |
> |
rs[1].assertNotInvoked(); |
2274 |
> |
f.completeExceptionally(ex); |
2275 |
> |
checkCompletedWithWrappedException(h0, ex); |
2276 |
> |
checkCompletedWithWrappedException(h1, ex); |
2277 |
> |
final CompletableFuture<Integer> h2 = m.applyToEither(f, g, rs[2]); |
2278 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(g, f, rs[3]); |
2279 |
> |
checkCompletedWithWrappedException(h2, ex); |
2280 |
> |
checkCompletedWithWrappedException(h3, ex); |
2281 |
> |
g.complete(v1); |
2282 |
> |
|
2283 |
> |
// unspecified behavior - both source completions available |
2284 |
> |
final CompletableFuture<Integer> h4 = m.applyToEither(f, g, rs[4]); |
2285 |
> |
final CompletableFuture<Integer> h5 = m.applyToEither(g, f, rs[5]); |
2286 |
> |
try { |
2287 |
> |
assertEquals(inc(v1), h4.join()); |
2288 |
> |
rs[4].assertValue(inc(v1)); |
2289 |
> |
} catch (CompletionException ok) { |
2290 |
> |
checkCompletedWithWrappedException(h4, ex); |
2291 |
> |
rs[4].assertNotInvoked(); |
2292 |
> |
} |
2293 |
> |
try { |
2294 |
> |
assertEquals(inc(v1), h5.join()); |
2295 |
> |
rs[5].assertValue(inc(v1)); |
2296 |
> |
} catch (CompletionException ok) { |
2297 |
> |
checkCompletedWithWrappedException(h5, ex); |
2298 |
> |
rs[5].assertNotInvoked(); |
2299 |
|
} |
2300 |
|
|
2301 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2302 |
< |
(!fFirst ? f : g).complete(v1); |
2303 |
< |
|
2304 |
< |
assertEquals(0, r.invocationCount); |
2305 |
< |
checkCompletedNormally(!fFirst ? f : g, v1); |
2306 |
< |
checkCompletedWithWrappedCFException(fFirst ? f : g, ex); |
2307 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2301 |
> |
checkCompletedExceptionally(f, ex); |
2302 |
> |
checkCompletedNormally(g, v1); |
2303 |
> |
checkCompletedWithWrappedException(h0, ex); |
2304 |
> |
checkCompletedWithWrappedException(h1, ex); |
2305 |
> |
checkCompletedWithWrappedException(h2, ex); |
2306 |
> |
checkCompletedWithWrappedException(h3, ex); |
2307 |
> |
checkCompletedWithWrappedException(h4, ex); |
2308 |
> |
for (int i = 0; i < 4; i++) rs[i].assertNotInvoked(); |
2309 |
|
}} |
2310 |
|
|
2311 |
|
public void testApplyToEither_exceptionalCompletion2() { |
2312 |
|
for (ExecutionMode m : ExecutionMode.values()) |
1690 |
– |
for (boolean reverseArgs : new boolean[] { true, false }) |
2313 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2314 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2315 |
|
{ |
2316 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2317 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1696 |
– |
final IncFunction r1 = new IncFunction(); |
1697 |
– |
final IncFunction r2 = new IncFunction(); |
2318 |
|
final CFException ex = new CFException(); |
2319 |
< |
final CompletableFuture<Integer> j = (reverseArgs ? g : f); |
2320 |
< |
final CompletableFuture<Integer> k = (reverseArgs ? f : g); |
2321 |
< |
final CompletableFuture<Integer> h1 = m.applyToEither(j, k, r1); |
2322 |
< |
if (fFirst) { |
2323 |
< |
f.complete(v1); |
2324 |
< |
g.completeExceptionally(ex); |
2325 |
< |
} else { |
2326 |
< |
g.completeExceptionally(ex); |
2327 |
< |
f.complete(v1); |
1708 |
< |
} |
1709 |
< |
final CompletableFuture<Integer> h2 = m.applyToEither(j, k, r2); |
2319 |
> |
final IncFunction[] rs = new IncFunction[6]; |
2320 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
2321 |
> |
|
2322 |
> |
final CompletableFuture<Integer> h0 = m.applyToEither(f, g, rs[0]); |
2323 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(g, f, rs[1]); |
2324 |
> |
assertTrue(fFirst ? f.complete(v1) : g.completeExceptionally(ex)); |
2325 |
> |
assertTrue(!fFirst ? f.complete(v1) : g.completeExceptionally(ex)); |
2326 |
> |
final CompletableFuture<Integer> h2 = m.applyToEither(f, g, rs[2]); |
2327 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(g, f, rs[3]); |
2328 |
|
|
2329 |
< |
// unspecified behavior |
2329 |
> |
// unspecified behavior - both source completions available |
2330 |
> |
try { |
2331 |
> |
assertEquals(inc(v1), h0.join()); |
2332 |
> |
rs[0].assertValue(inc(v1)); |
2333 |
> |
} catch (CompletionException ok) { |
2334 |
> |
checkCompletedWithWrappedException(h0, ex); |
2335 |
> |
rs[0].assertNotInvoked(); |
2336 |
> |
} |
2337 |
|
try { |
2338 |
|
assertEquals(inc(v1), h1.join()); |
2339 |
< |
assertEquals(1, r1.invocationCount); |
2339 |
> |
rs[1].assertValue(inc(v1)); |
2340 |
|
} catch (CompletionException ok) { |
2341 |
< |
checkCompletedWithWrappedCFException(h1, ex); |
2342 |
< |
assertEquals(0, r1.invocationCount); |
2341 |
> |
checkCompletedWithWrappedException(h1, ex); |
2342 |
> |
rs[1].assertNotInvoked(); |
2343 |
|
} |
1719 |
– |
|
2344 |
|
try { |
2345 |
|
assertEquals(inc(v1), h2.join()); |
2346 |
< |
assertEquals(1, r2.invocationCount); |
2346 |
> |
rs[2].assertValue(inc(v1)); |
2347 |
|
} catch (CompletionException ok) { |
2348 |
< |
checkCompletedWithWrappedCFException(h2, ex); |
2349 |
< |
assertEquals(0, r2.invocationCount); |
2348 |
> |
checkCompletedWithWrappedException(h2, ex); |
2349 |
> |
rs[2].assertNotInvoked(); |
2350 |
> |
} |
2351 |
> |
try { |
2352 |
> |
assertEquals(inc(v1), h3.join()); |
2353 |
> |
rs[3].assertValue(inc(v1)); |
2354 |
> |
} catch (CompletionException ok) { |
2355 |
> |
checkCompletedWithWrappedException(h3, ex); |
2356 |
> |
rs[3].assertNotInvoked(); |
2357 |
|
} |
2358 |
|
|
1728 |
– |
checkCompletedWithWrappedCFException(g, ex); |
1729 |
– |
checkCompletedNormally(f, v1); |
1730 |
– |
}} |
1731 |
– |
|
1732 |
– |
/** |
1733 |
– |
* applyToEither result completes exceptionally if action does |
1734 |
– |
*/ |
1735 |
– |
public void testApplyToEither_actionFailed1() { |
1736 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
1737 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
1738 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
1739 |
– |
{ |
1740 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1741 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1742 |
– |
final FailingFunction r = new FailingFunction(); |
1743 |
– |
final CompletableFuture<Integer> h = m.applyToEither(f, g, r); |
1744 |
– |
|
1745 |
– |
f.complete(v1); |
1746 |
– |
checkCompletedWithWrappedCFException(h); |
1747 |
– |
g.complete(v2); |
1748 |
– |
checkCompletedNormally(f, v1); |
1749 |
– |
checkCompletedNormally(g, v2); |
1750 |
– |
}} |
1751 |
– |
|
1752 |
– |
public void testApplyToEither_actionFailed2() { |
1753 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
1754 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
1755 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
1756 |
– |
{ |
1757 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1758 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1759 |
– |
final FailingFunction r = new FailingFunction(); |
1760 |
– |
final CompletableFuture<Integer> h = m.applyToEither(f, g, r); |
1761 |
– |
|
1762 |
– |
g.complete(v2); |
1763 |
– |
checkCompletedWithWrappedCFException(h); |
1764 |
– |
f.complete(v1); |
2359 |
|
checkCompletedNormally(f, v1); |
2360 |
< |
checkCompletedNormally(g, v2); |
2360 |
> |
checkCompletedExceptionally(g, ex); |
2361 |
|
}} |
2362 |
|
|
2363 |
|
/** |
2364 |
|
* applyToEither result completes exceptionally if either source cancelled |
2365 |
|
*/ |
2366 |
< |
public void testApplyToEither_sourceCancelled1() { |
2366 |
> |
public void testApplyToEither_sourceCancelled() { |
2367 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2368 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1775 |
– |
for (boolean createIncomplete : new boolean[] { true, false }) |
1776 |
– |
for (boolean fFirst : new boolean[] { true, false }) |
2369 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2370 |
|
{ |
2371 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2372 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2373 |
< |
final IncFunction r = new IncFunction(); |
2373 |
> |
final IncFunction[] rs = new IncFunction[6]; |
2374 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
2375 |
|
|
2376 |
< |
if (!createIncomplete) assertTrue((fFirst ? f : g).cancel(mayInterruptIfRunning)); |
2377 |
< |
final CompletableFuture<Integer> h = m.applyToEither(f, g, r); |
2378 |
< |
if (createIncomplete) { |
2379 |
< |
checkIncomplete(h); |
2380 |
< |
assertEquals(0, r.invocationCount); |
2381 |
< |
assertTrue((fFirst ? f : g).cancel(mayInterruptIfRunning)); |
2376 |
> |
final CompletableFuture<Integer> h0 = m.applyToEither(f, g, rs[0]); |
2377 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(g, f, rs[1]); |
2378 |
> |
checkIncomplete(h0); |
2379 |
> |
checkIncomplete(h1); |
2380 |
> |
rs[0].assertNotInvoked(); |
2381 |
> |
rs[1].assertNotInvoked(); |
2382 |
> |
f.cancel(mayInterruptIfRunning); |
2383 |
> |
checkCompletedWithWrappedCancellationException(h0); |
2384 |
> |
checkCompletedWithWrappedCancellationException(h1); |
2385 |
> |
final CompletableFuture<Integer> h2 = m.applyToEither(f, g, rs[2]); |
2386 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(g, f, rs[3]); |
2387 |
> |
checkCompletedWithWrappedCancellationException(h2); |
2388 |
> |
checkCompletedWithWrappedCancellationException(h3); |
2389 |
> |
g.complete(v1); |
2390 |
> |
|
2391 |
> |
// unspecified behavior - both source completions available |
2392 |
> |
final CompletableFuture<Integer> h4 = m.applyToEither(f, g, rs[4]); |
2393 |
> |
final CompletableFuture<Integer> h5 = m.applyToEither(g, f, rs[5]); |
2394 |
> |
try { |
2395 |
> |
assertEquals(inc(v1), h4.join()); |
2396 |
> |
rs[4].assertValue(inc(v1)); |
2397 |
> |
} catch (CompletionException ok) { |
2398 |
> |
checkCompletedWithWrappedCancellationException(h4); |
2399 |
> |
rs[4].assertNotInvoked(); |
2400 |
> |
} |
2401 |
> |
try { |
2402 |
> |
assertEquals(inc(v1), h5.join()); |
2403 |
> |
rs[5].assertValue(inc(v1)); |
2404 |
> |
} catch (CompletionException ok) { |
2405 |
> |
checkCompletedWithWrappedCancellationException(h5); |
2406 |
> |
rs[5].assertNotInvoked(); |
2407 |
|
} |
2408 |
|
|
2409 |
< |
checkCompletedWithWrappedCancellationException(h); |
2410 |
< |
(!fFirst ? f : g).complete(v1); |
2411 |
< |
|
2412 |
< |
assertEquals(0, r.invocationCount); |
2413 |
< |
checkCompletedNormally(!fFirst ? f : g, v1); |
2414 |
< |
checkCancelled(fFirst ? f : g); |
2415 |
< |
checkCompletedWithWrappedCancellationException(h); |
2409 |
> |
checkCancelled(f); |
2410 |
> |
checkCompletedNormally(g, v1); |
2411 |
> |
checkCompletedWithWrappedCancellationException(h0); |
2412 |
> |
checkCompletedWithWrappedCancellationException(h1); |
2413 |
> |
checkCompletedWithWrappedCancellationException(h2); |
2414 |
> |
checkCompletedWithWrappedCancellationException(h3); |
2415 |
> |
for (int i = 0; i < 4; i++) rs[i].assertNotInvoked(); |
2416 |
|
}} |
2417 |
|
|
2418 |
|
public void testApplyToEither_sourceCancelled2() { |
2419 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2420 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
1803 |
– |
for (boolean reverseArgs : new boolean[] { true, false }) |
2421 |
|
for (boolean fFirst : new boolean[] { true, false }) |
2422 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2423 |
|
{ |
2424 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2425 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2426 |
< |
final IncFunction r1 = new IncFunction(); |
2427 |
< |
final IncFunction r2 = new IncFunction(); |
1811 |
< |
final CFException ex = new CFException(); |
1812 |
< |
final CompletableFuture<Integer> j = (reverseArgs ? g : f); |
1813 |
< |
final CompletableFuture<Integer> k = (reverseArgs ? f : g); |
2426 |
> |
final IncFunction[] rs = new IncFunction[6]; |
2427 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new IncFunction(m); |
2428 |
|
|
2429 |
< |
final CompletableFuture<Integer> h1 = m.applyToEither(j, k, r1); |
2430 |
< |
if (fFirst) { |
2431 |
< |
f.complete(v1); |
2432 |
< |
assertTrue(g.cancel(mayInterruptIfRunning)); |
2433 |
< |
} else { |
2434 |
< |
assertTrue(g.cancel(mayInterruptIfRunning)); |
1821 |
< |
f.complete(v1); |
1822 |
< |
} |
1823 |
< |
final CompletableFuture<Integer> h2 = m.applyToEither(j, k, r2); |
2429 |
> |
final CompletableFuture<Integer> h0 = m.applyToEither(f, g, rs[0]); |
2430 |
> |
final CompletableFuture<Integer> h1 = m.applyToEither(g, f, rs[1]); |
2431 |
> |
assertTrue(fFirst ? f.complete(v1) : g.cancel(mayInterruptIfRunning)); |
2432 |
> |
assertTrue(!fFirst ? f.complete(v1) : g.cancel(mayInterruptIfRunning)); |
2433 |
> |
final CompletableFuture<Integer> h2 = m.applyToEither(f, g, rs[2]); |
2434 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(g, f, rs[3]); |
2435 |
|
|
2436 |
< |
// unspecified behavior |
2436 |
> |
// unspecified behavior - both source completions available |
2437 |
> |
try { |
2438 |
> |
assertEquals(inc(v1), h0.join()); |
2439 |
> |
rs[0].assertValue(inc(v1)); |
2440 |
> |
} catch (CompletionException ok) { |
2441 |
> |
checkCompletedWithWrappedCancellationException(h0); |
2442 |
> |
rs[0].assertNotInvoked(); |
2443 |
> |
} |
2444 |
|
try { |
2445 |
|
assertEquals(inc(v1), h1.join()); |
2446 |
< |
assertEquals(1, r1.invocationCount); |
2446 |
> |
rs[1].assertValue(inc(v1)); |
2447 |
|
} catch (CompletionException ok) { |
2448 |
|
checkCompletedWithWrappedCancellationException(h1); |
2449 |
< |
assertEquals(0, r1.invocationCount); |
2449 |
> |
rs[1].assertNotInvoked(); |
2450 |
|
} |
1833 |
– |
|
2451 |
|
try { |
2452 |
|
assertEquals(inc(v1), h2.join()); |
2453 |
< |
assertEquals(1, r2.invocationCount); |
2453 |
> |
rs[2].assertValue(inc(v1)); |
2454 |
|
} catch (CompletionException ok) { |
2455 |
|
checkCompletedWithWrappedCancellationException(h2); |
2456 |
< |
assertEquals(0, r2.invocationCount); |
2456 |
> |
rs[2].assertNotInvoked(); |
2457 |
> |
} |
2458 |
> |
try { |
2459 |
> |
assertEquals(inc(v1), h3.join()); |
2460 |
> |
rs[3].assertValue(inc(v1)); |
2461 |
> |
} catch (CompletionException ok) { |
2462 |
> |
checkCompletedWithWrappedCancellationException(h3); |
2463 |
> |
rs[3].assertNotInvoked(); |
2464 |
|
} |
2465 |
|
|
1842 |
– |
checkCancelled(g); |
2466 |
|
checkCompletedNormally(f, v1); |
2467 |
+ |
checkCancelled(g); |
2468 |
|
}} |
2469 |
|
|
2470 |
|
/** |
2471 |
< |
* acceptEither result completes normally after normal completion |
1848 |
< |
* of either source |
2471 |
> |
* applyToEither result completes exceptionally if action does |
2472 |
|
*/ |
2473 |
< |
public void testAcceptEither_normalCompletion1() { |
2473 |
> |
public void testApplyToEither_actionFailed() { |
2474 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2475 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2476 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2477 |
|
{ |
2478 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2479 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2480 |
< |
final IncAction r = new IncAction(); |
2481 |
< |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2480 |
> |
final FailingFunction[] rs = new FailingFunction[6]; |
2481 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingFunction(m); |
2482 |
|
|
2483 |
+ |
final CompletableFuture<Integer> h0 = m.applyToEither(f, g, rs[0]); |
2484 |
+ |
final CompletableFuture<Integer> h1 = m.applyToEither(g, f, rs[1]); |
2485 |
|
f.complete(v1); |
2486 |
< |
checkCompletedNormally(h, null); |
2487 |
< |
assertEquals(inc(v1), r.value); |
2488 |
< |
g.complete(v2); |
2489 |
< |
|
2490 |
< |
checkCompletedNormally(f, v1); |
2491 |
< |
checkCompletedNormally(g, v2); |
2492 |
< |
checkCompletedNormally(h, null); |
1868 |
< |
}} |
1869 |
< |
|
1870 |
< |
public void testAcceptEither_normalCompletion2() { |
1871 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
1872 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
1873 |
< |
for (Integer v2 : new Integer[] { 2, null }) |
1874 |
< |
{ |
1875 |
< |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1876 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1877 |
< |
final IncAction r = new IncAction(); |
1878 |
< |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2486 |
> |
final CompletableFuture<Integer> h2 = m.applyToEither(f, g, rs[2]); |
2487 |
> |
final CompletableFuture<Integer> h3 = m.applyToEither(g, f, rs[3]); |
2488 |
> |
checkCompletedWithWrappedException(h0, rs[0].ex); |
2489 |
> |
checkCompletedWithWrappedException(h1, rs[1].ex); |
2490 |
> |
checkCompletedWithWrappedException(h2, rs[2].ex); |
2491 |
> |
checkCompletedWithWrappedException(h3, rs[3].ex); |
2492 |
> |
for (int i = 0; i < 4; i++) rs[i].assertValue(v1); |
2493 |
|
|
2494 |
|
g.complete(v2); |
2495 |
< |
checkCompletedNormally(h, null); |
2496 |
< |
assertEquals(inc(v2), r.value); |
2497 |
< |
f.complete(v1); |
2495 |
> |
|
2496 |
> |
// unspecified behavior - both source completions available |
2497 |
> |
final CompletableFuture<Integer> h4 = m.applyToEither(f, g, rs[4]); |
2498 |
> |
final CompletableFuture<Integer> h5 = m.applyToEither(g, f, rs[5]); |
2499 |
> |
|
2500 |
> |
checkCompletedWithWrappedException(h4, rs[4].ex); |
2501 |
> |
assertTrue(Objects.equals(v1, rs[4].value) || |
2502 |
> |
Objects.equals(v2, rs[4].value)); |
2503 |
> |
checkCompletedWithWrappedException(h5, rs[5].ex); |
2504 |
> |
assertTrue(Objects.equals(v1, rs[5].value) || |
2505 |
> |
Objects.equals(v2, rs[5].value)); |
2506 |
|
|
2507 |
|
checkCompletedNormally(f, v1); |
2508 |
|
checkCompletedNormally(g, v2); |
1887 |
– |
checkCompletedNormally(h, null); |
2509 |
|
}} |
2510 |
|
|
2511 |
< |
public void testAcceptEither_normalCompletion3() { |
2511 |
> |
/** |
2512 |
> |
* acceptEither result completes normally after normal completion |
2513 |
> |
* of either source |
2514 |
> |
*/ |
2515 |
> |
public void testAcceptEither_normalCompletion() { |
2516 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2517 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2518 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2519 |
|
{ |
2520 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2521 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2522 |
< |
final IncAction r = new IncAction(); |
2522 |
> |
final NoopConsumer[] rs = new NoopConsumer[6]; |
2523 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
2524 |
|
|
2525 |
+ |
final CompletableFuture<Void> h0 = m.acceptEither(f, g, rs[0]); |
2526 |
+ |
final CompletableFuture<Void> h1 = m.acceptEither(g, f, rs[1]); |
2527 |
+ |
checkIncomplete(h0); |
2528 |
+ |
checkIncomplete(h1); |
2529 |
+ |
rs[0].assertNotInvoked(); |
2530 |
+ |
rs[1].assertNotInvoked(); |
2531 |
|
f.complete(v1); |
2532 |
+ |
checkCompletedNormally(h0, null); |
2533 |
+ |
checkCompletedNormally(h1, null); |
2534 |
+ |
rs[0].assertValue(v1); |
2535 |
+ |
rs[1].assertValue(v1); |
2536 |
+ |
final CompletableFuture<Void> h2 = m.acceptEither(f, g, rs[2]); |
2537 |
+ |
final CompletableFuture<Void> h3 = m.acceptEither(g, f, rs[3]); |
2538 |
+ |
checkCompletedNormally(h2, null); |
2539 |
+ |
checkCompletedNormally(h3, null); |
2540 |
+ |
rs[2].assertValue(v1); |
2541 |
+ |
rs[3].assertValue(v1); |
2542 |
|
g.complete(v2); |
1901 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2543 |
|
|
2544 |
< |
checkCompletedNormally(h, null); |
2544 |
> |
// unspecified behavior - both source completions available |
2545 |
> |
final CompletableFuture<Void> h4 = m.acceptEither(f, g, rs[4]); |
2546 |
> |
final CompletableFuture<Void> h5 = m.acceptEither(g, f, rs[5]); |
2547 |
> |
checkCompletedNormally(h4, null); |
2548 |
> |
checkCompletedNormally(h5, null); |
2549 |
> |
assertTrue(Objects.equals(v1, rs[4].value) || |
2550 |
> |
Objects.equals(v2, rs[4].value)); |
2551 |
> |
assertTrue(Objects.equals(v1, rs[5].value) || |
2552 |
> |
Objects.equals(v2, rs[5].value)); |
2553 |
> |
|
2554 |
|
checkCompletedNormally(f, v1); |
2555 |
|
checkCompletedNormally(g, v2); |
2556 |
< |
|
2557 |
< |
// unspecified behavior |
2558 |
< |
assertTrue(Objects.equals(r.value, inc(v1)) || |
2559 |
< |
Objects.equals(r.value, inc(v2))); |
2556 |
> |
checkCompletedNormally(h0, null); |
2557 |
> |
checkCompletedNormally(h1, null); |
2558 |
> |
checkCompletedNormally(h2, null); |
2559 |
> |
checkCompletedNormally(h3, null); |
2560 |
> |
for (int i = 0; i < 4; i++) rs[i].assertValue(v1); |
2561 |
|
}} |
2562 |
|
|
2563 |
|
/** |
2564 |
|
* acceptEither result completes exceptionally after exceptional |
2565 |
|
* completion of either source |
2566 |
|
*/ |
2567 |
< |
public void testAcceptEither_exceptionalCompletion1() { |
2567 |
> |
public void testAcceptEither_exceptionalCompletion() { |
2568 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2569 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2570 |
|
{ |
2571 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2572 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1922 |
– |
final IncAction r = new IncAction(); |
1923 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2573 |
|
final CFException ex = new CFException(); |
2574 |
+ |
final NoopConsumer[] rs = new NoopConsumer[6]; |
2575 |
+ |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
2576 |
|
|
2577 |
+ |
final CompletableFuture<Void> h0 = m.acceptEither(f, g, rs[0]); |
2578 |
+ |
final CompletableFuture<Void> h1 = m.acceptEither(g, f, rs[1]); |
2579 |
+ |
checkIncomplete(h0); |
2580 |
+ |
checkIncomplete(h1); |
2581 |
+ |
rs[0].assertNotInvoked(); |
2582 |
+ |
rs[1].assertNotInvoked(); |
2583 |
|
f.completeExceptionally(ex); |
2584 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2584 |
> |
checkCompletedWithWrappedException(h0, ex); |
2585 |
> |
checkCompletedWithWrappedException(h1, ex); |
2586 |
> |
final CompletableFuture<Void> h2 = m.acceptEither(f, g, rs[2]); |
2587 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(g, f, rs[3]); |
2588 |
> |
checkCompletedWithWrappedException(h2, ex); |
2589 |
> |
checkCompletedWithWrappedException(h3, ex); |
2590 |
> |
|
2591 |
|
g.complete(v1); |
2592 |
|
|
2593 |
< |
assertEquals(0, r.invocationCount); |
2593 |
> |
// unspecified behavior - both source completions available |
2594 |
> |
final CompletableFuture<Void> h4 = m.acceptEither(f, g, rs[4]); |
2595 |
> |
final CompletableFuture<Void> h5 = m.acceptEither(g, f, rs[5]); |
2596 |
> |
try { |
2597 |
> |
assertNull(h4.join()); |
2598 |
> |
rs[4].assertValue(v1); |
2599 |
> |
} catch (CompletionException ok) { |
2600 |
> |
checkCompletedWithWrappedException(h4, ex); |
2601 |
> |
rs[4].assertNotInvoked(); |
2602 |
> |
} |
2603 |
> |
try { |
2604 |
> |
assertNull(h5.join()); |
2605 |
> |
rs[5].assertValue(v1); |
2606 |
> |
} catch (CompletionException ok) { |
2607 |
> |
checkCompletedWithWrappedException(h5, ex); |
2608 |
> |
rs[5].assertNotInvoked(); |
2609 |
> |
} |
2610 |
> |
|
2611 |
> |
checkCompletedExceptionally(f, ex); |
2612 |
|
checkCompletedNormally(g, v1); |
2613 |
< |
checkCompletedWithWrappedCFException(f, ex); |
2614 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2613 |
> |
checkCompletedWithWrappedException(h0, ex); |
2614 |
> |
checkCompletedWithWrappedException(h1, ex); |
2615 |
> |
checkCompletedWithWrappedException(h2, ex); |
2616 |
> |
checkCompletedWithWrappedException(h3, ex); |
2617 |
> |
checkCompletedWithWrappedException(h4, ex); |
2618 |
> |
for (int i = 0; i < 4; i++) rs[i].assertNotInvoked(); |
2619 |
|
}} |
2620 |
|
|
2621 |
|
public void testAcceptEither_exceptionalCompletion2() { |
2622 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2623 |
+ |
for (boolean fFirst : new boolean[] { true, false }) |
2624 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2625 |
|
{ |
2626 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2627 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1942 |
– |
final IncAction r = new IncAction(); |
1943 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
1944 |
– |
final CFException ex = new CFException(); |
1945 |
– |
|
1946 |
– |
g.completeExceptionally(ex); |
1947 |
– |
checkCompletedWithWrappedCFException(h, ex); |
1948 |
– |
f.complete(v1); |
1949 |
– |
|
1950 |
– |
assertEquals(0, r.invocationCount); |
1951 |
– |
checkCompletedNormally(f, v1); |
1952 |
– |
checkCompletedWithWrappedCFException(g, ex); |
1953 |
– |
checkCompletedWithWrappedCFException(h, ex); |
1954 |
– |
}} |
1955 |
– |
|
1956 |
– |
public void testAcceptEither_exceptionalCompletion3() { |
1957 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
1958 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
1959 |
– |
{ |
1960 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1961 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1962 |
– |
final IncAction r = new IncAction(); |
2628 |
|
final CFException ex = new CFException(); |
2629 |
+ |
final NoopConsumer[] rs = new NoopConsumer[6]; |
2630 |
+ |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
2631 |
|
|
2632 |
< |
g.completeExceptionally(ex); |
2633 |
< |
f.complete(v1); |
2634 |
< |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2632 |
> |
final CompletableFuture<Void> h0 = m.acceptEither(f, g, rs[0]); |
2633 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(g, f, rs[1]); |
2634 |
> |
assertTrue(fFirst ? f.complete(v1) : g.completeExceptionally(ex)); |
2635 |
> |
assertTrue(!fFirst ? f.complete(v1) : g.completeExceptionally(ex)); |
2636 |
> |
final CompletableFuture<Void> h2 = m.acceptEither(f, g, rs[2]); |
2637 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(g, f, rs[3]); |
2638 |
|
|
2639 |
< |
// unspecified behavior |
1970 |
< |
Integer v; |
2639 |
> |
// unspecified behavior - both source completions available |
2640 |
|
try { |
2641 |
< |
assertNull(h.join()); |
2642 |
< |
assertEquals(1, r.invocationCount); |
1974 |
< |
assertEquals(inc(v1), r.value); |
2641 |
> |
assertNull(h0.join()); |
2642 |
> |
rs[0].assertValue(v1); |
2643 |
|
} catch (CompletionException ok) { |
2644 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2645 |
< |
assertEquals(0, r.invocationCount); |
2644 |
> |
checkCompletedWithWrappedException(h0, ex); |
2645 |
> |
rs[0].assertNotInvoked(); |
2646 |
|
} |
1979 |
– |
|
1980 |
– |
checkCompletedWithWrappedCFException(g, ex); |
1981 |
– |
checkCompletedNormally(f, v1); |
1982 |
– |
}} |
1983 |
– |
|
1984 |
– |
public void testAcceptEither_exceptionalCompletion4() { |
1985 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
1986 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
1987 |
– |
{ |
1988 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
1989 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
1990 |
– |
final IncAction r = new IncAction(); |
1991 |
– |
final CFException ex = new CFException(); |
1992 |
– |
|
1993 |
– |
f.completeExceptionally(ex); |
1994 |
– |
g.complete(v1); |
1995 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
1996 |
– |
|
1997 |
– |
// unspecified behavior |
1998 |
– |
Integer v; |
2647 |
|
try { |
2648 |
< |
assertNull(h.join()); |
2649 |
< |
assertEquals(1, r.invocationCount); |
2002 |
< |
assertEquals(inc(v1), r.value); |
2648 |
> |
assertNull(h1.join()); |
2649 |
> |
rs[1].assertValue(v1); |
2650 |
|
} catch (CompletionException ok) { |
2651 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2652 |
< |
assertEquals(0, r.invocationCount); |
2651 |
> |
checkCompletedWithWrappedException(h1, ex); |
2652 |
> |
rs[1].assertNotInvoked(); |
2653 |
> |
} |
2654 |
> |
try { |
2655 |
> |
assertNull(h2.join()); |
2656 |
> |
rs[2].assertValue(v1); |
2657 |
> |
} catch (CompletionException ok) { |
2658 |
> |
checkCompletedWithWrappedException(h2, ex); |
2659 |
> |
rs[2].assertNotInvoked(); |
2660 |
> |
} |
2661 |
> |
try { |
2662 |
> |
assertNull(h3.join()); |
2663 |
> |
rs[3].assertValue(v1); |
2664 |
> |
} catch (CompletionException ok) { |
2665 |
> |
checkCompletedWithWrappedException(h3, ex); |
2666 |
> |
rs[3].assertNotInvoked(); |
2667 |
|
} |
2668 |
|
|
2008 |
– |
checkCompletedWithWrappedCFException(f, ex); |
2009 |
– |
checkCompletedNormally(g, v1); |
2010 |
– |
}} |
2011 |
– |
|
2012 |
– |
/** |
2013 |
– |
* acceptEither result completes exceptionally if action does |
2014 |
– |
*/ |
2015 |
– |
public void testAcceptEither_actionFailed1() { |
2016 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
2017 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
2018 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
2019 |
– |
{ |
2020 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2021 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2022 |
– |
final FailingConsumer r = new FailingConsumer(); |
2023 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2024 |
– |
|
2025 |
– |
f.complete(v1); |
2026 |
– |
checkCompletedWithWrappedCFException(h); |
2027 |
– |
g.complete(v2); |
2028 |
– |
checkCompletedNormally(f, v1); |
2029 |
– |
checkCompletedNormally(g, v2); |
2030 |
– |
}} |
2031 |
– |
|
2032 |
– |
public void testAcceptEither_actionFailed2() { |
2033 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
2034 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
2035 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
2036 |
– |
{ |
2037 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2038 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2039 |
– |
final FailingConsumer r = new FailingConsumer(); |
2040 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2041 |
– |
|
2042 |
– |
g.complete(v2); |
2043 |
– |
checkCompletedWithWrappedCFException(h); |
2044 |
– |
f.complete(v1); |
2669 |
|
checkCompletedNormally(f, v1); |
2670 |
< |
checkCompletedNormally(g, v2); |
2670 |
> |
checkCompletedExceptionally(g, ex); |
2671 |
|
}} |
2672 |
|
|
2673 |
|
/** |
2674 |
|
* acceptEither result completes exceptionally if either source cancelled |
2675 |
|
*/ |
2676 |
< |
public void testAcceptEither_sourceCancelled1() { |
2676 |
> |
public void testAcceptEither_sourceCancelled() { |
2677 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2678 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2679 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2680 |
|
{ |
2681 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2682 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2683 |
< |
final IncAction r = new IncAction(); |
2684 |
< |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2683 |
> |
final NoopConsumer[] rs = new NoopConsumer[6]; |
2684 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new NoopConsumer(m); |
2685 |
|
|
2686 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
2687 |
< |
checkCompletedWithWrappedCancellationException(h); |
2688 |
< |
g.complete(v1); |
2686 |
> |
final CompletableFuture<Void> h0 = m.acceptEither(f, g, rs[0]); |
2687 |
> |
final CompletableFuture<Void> h1 = m.acceptEither(g, f, rs[1]); |
2688 |
> |
checkIncomplete(h0); |
2689 |
> |
checkIncomplete(h1); |
2690 |
> |
rs[0].assertNotInvoked(); |
2691 |
> |
rs[1].assertNotInvoked(); |
2692 |
> |
f.cancel(mayInterruptIfRunning); |
2693 |
> |
checkCompletedWithWrappedCancellationException(h0); |
2694 |
> |
checkCompletedWithWrappedCancellationException(h1); |
2695 |
> |
final CompletableFuture<Void> h2 = m.acceptEither(f, g, rs[2]); |
2696 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(g, f, rs[3]); |
2697 |
> |
checkCompletedWithWrappedCancellationException(h2); |
2698 |
> |
checkCompletedWithWrappedCancellationException(h3); |
2699 |
|
|
2700 |
< |
checkCancelled(f); |
2067 |
< |
assertEquals(0, r.invocationCount); |
2068 |
< |
checkCompletedNormally(g, v1); |
2069 |
< |
checkCompletedWithWrappedCancellationException(h); |
2070 |
< |
}} |
2071 |
< |
|
2072 |
< |
public void testAcceptEither_sourceCancelled2() { |
2073 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
2074 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2075 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
2076 |
< |
{ |
2077 |
< |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2078 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2079 |
< |
final IncAction r = new IncAction(); |
2080 |
< |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2081 |
< |
|
2082 |
< |
assertTrue(g.cancel(mayInterruptIfRunning)); |
2083 |
< |
checkCompletedWithWrappedCancellationException(h); |
2084 |
< |
f.complete(v1); |
2085 |
< |
|
2086 |
< |
checkCancelled(g); |
2087 |
< |
assertEquals(0, r.invocationCount); |
2088 |
< |
checkCompletedNormally(f, v1); |
2089 |
< |
checkCompletedWithWrappedCancellationException(h); |
2090 |
< |
}} |
2091 |
< |
|
2092 |
< |
public void testAcceptEither_sourceCancelled3() { |
2093 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
2094 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2095 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
2096 |
< |
{ |
2097 |
< |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2098 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2099 |
< |
final IncAction r = new IncAction(); |
2100 |
< |
|
2101 |
< |
assertTrue(g.cancel(mayInterruptIfRunning)); |
2102 |
< |
f.complete(v1); |
2103 |
< |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2700 |
> |
g.complete(v1); |
2701 |
|
|
2702 |
< |
// unspecified behavior |
2703 |
< |
Integer v; |
2702 |
> |
// unspecified behavior - both source completions available |
2703 |
> |
final CompletableFuture<Void> h4 = m.acceptEither(f, g, rs[4]); |
2704 |
> |
final CompletableFuture<Void> h5 = m.acceptEither(g, f, rs[5]); |
2705 |
|
try { |
2706 |
< |
assertNull(h.join()); |
2707 |
< |
assertEquals(1, r.invocationCount); |
2110 |
< |
assertEquals(inc(v1), r.value); |
2706 |
> |
assertNull(h4.join()); |
2707 |
> |
rs[4].assertValue(v1); |
2708 |
|
} catch (CompletionException ok) { |
2709 |
< |
checkCompletedWithWrappedCancellationException(h); |
2710 |
< |
assertEquals(0, r.invocationCount); |
2709 |
> |
checkCompletedWithWrappedCancellationException(h4); |
2710 |
> |
rs[4].assertNotInvoked(); |
2711 |
|
} |
2115 |
– |
|
2116 |
– |
checkCancelled(g); |
2117 |
– |
checkCompletedNormally(f, v1); |
2118 |
– |
}} |
2119 |
– |
|
2120 |
– |
public void testAcceptEither_sourceCancelled4() { |
2121 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
2122 |
– |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2123 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
2124 |
– |
{ |
2125 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2126 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2127 |
– |
final IncAction r = new IncAction(); |
2128 |
– |
|
2129 |
– |
assertTrue(f.cancel(mayInterruptIfRunning)); |
2130 |
– |
g.complete(v1); |
2131 |
– |
final CompletableFuture<Void> h = m.acceptEither(f, g, r); |
2132 |
– |
|
2133 |
– |
// unspecified behavior |
2134 |
– |
Integer v; |
2712 |
|
try { |
2713 |
< |
assertNull(h.join()); |
2714 |
< |
assertEquals(1, r.invocationCount); |
2138 |
< |
assertEquals(inc(v1), r.value); |
2713 |
> |
assertNull(h5.join()); |
2714 |
> |
rs[5].assertValue(v1); |
2715 |
|
} catch (CompletionException ok) { |
2716 |
< |
checkCompletedWithWrappedCancellationException(h); |
2717 |
< |
assertEquals(0, r.invocationCount); |
2716 |
> |
checkCompletedWithWrappedCancellationException(h5); |
2717 |
> |
rs[5].assertNotInvoked(); |
2718 |
|
} |
2719 |
|
|
2720 |
|
checkCancelled(f); |
2721 |
|
checkCompletedNormally(g, v1); |
2722 |
+ |
checkCompletedWithWrappedCancellationException(h0); |
2723 |
+ |
checkCompletedWithWrappedCancellationException(h1); |
2724 |
+ |
checkCompletedWithWrappedCancellationException(h2); |
2725 |
+ |
checkCompletedWithWrappedCancellationException(h3); |
2726 |
+ |
for (int i = 0; i < 4; i++) rs[i].assertNotInvoked(); |
2727 |
|
}} |
2728 |
|
|
2729 |
|
/** |
2730 |
< |
* runAfterEither result completes normally after normal completion |
2150 |
< |
* of either source |
2730 |
> |
* acceptEither result completes exceptionally if action does |
2731 |
|
*/ |
2732 |
< |
public void testRunAfterEither_normalCompletion1() { |
2732 |
> |
public void testAcceptEither_actionFailed() { |
2733 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2734 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2735 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2736 |
|
{ |
2737 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2738 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2739 |
< |
final Noop r = new Noop(m); |
2740 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2739 |
> |
final FailingConsumer[] rs = new FailingConsumer[6]; |
2740 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingConsumer(m); |
2741 |
|
|
2742 |
+ |
final CompletableFuture<Void> h0 = m.acceptEither(f, g, rs[0]); |
2743 |
+ |
final CompletableFuture<Void> h1 = m.acceptEither(g, f, rs[1]); |
2744 |
|
f.complete(v1); |
2745 |
< |
checkCompletedNormally(h, null); |
2746 |
< |
assertEquals(1, r.invocationCount); |
2745 |
> |
final CompletableFuture<Void> h2 = m.acceptEither(f, g, rs[2]); |
2746 |
> |
final CompletableFuture<Void> h3 = m.acceptEither(g, f, rs[3]); |
2747 |
> |
checkCompletedWithWrappedException(h0, rs[0].ex); |
2748 |
> |
checkCompletedWithWrappedException(h1, rs[1].ex); |
2749 |
> |
checkCompletedWithWrappedException(h2, rs[2].ex); |
2750 |
> |
checkCompletedWithWrappedException(h3, rs[3].ex); |
2751 |
> |
for (int i = 0; i < 4; i++) rs[i].assertValue(v1); |
2752 |
> |
|
2753 |
|
g.complete(v2); |
2754 |
|
|
2755 |
+ |
// unspecified behavior - both source completions available |
2756 |
+ |
final CompletableFuture<Void> h4 = m.acceptEither(f, g, rs[4]); |
2757 |
+ |
final CompletableFuture<Void> h5 = m.acceptEither(g, f, rs[5]); |
2758 |
+ |
|
2759 |
+ |
checkCompletedWithWrappedException(h4, rs[4].ex); |
2760 |
+ |
assertTrue(Objects.equals(v1, rs[4].value) || |
2761 |
+ |
Objects.equals(v2, rs[4].value)); |
2762 |
+ |
checkCompletedWithWrappedException(h5, rs[5].ex); |
2763 |
+ |
assertTrue(Objects.equals(v1, rs[5].value) || |
2764 |
+ |
Objects.equals(v2, rs[5].value)); |
2765 |
+ |
|
2766 |
|
checkCompletedNormally(f, v1); |
2767 |
|
checkCompletedNormally(g, v2); |
2169 |
– |
checkCompletedNormally(h, null); |
2170 |
– |
assertEquals(1, r.invocationCount); |
2768 |
|
}} |
2769 |
|
|
2770 |
< |
public void testRunAfterEither_normalCompletion2() { |
2770 |
> |
/** |
2771 |
> |
* runAfterEither result completes normally after normal completion |
2772 |
> |
* of either source |
2773 |
> |
*/ |
2774 |
> |
public void testRunAfterEither_normalCompletion() { |
2775 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2776 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2777 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2778 |
+ |
for (boolean pushNop : new boolean[] { true, false }) |
2779 |
|
{ |
2780 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2781 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2782 |
< |
final Noop r = new Noop(m); |
2783 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2782 |
> |
final Noop[] rs = new Noop[6]; |
2783 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
2784 |
|
|
2785 |
< |
g.complete(v2); |
2786 |
< |
checkCompletedNormally(h, null); |
2787 |
< |
assertEquals(1, r.invocationCount); |
2785 |
> |
final CompletableFuture<Void> h0 = m.runAfterEither(f, g, rs[0]); |
2786 |
> |
final CompletableFuture<Void> h1 = m.runAfterEither(g, f, rs[1]); |
2787 |
> |
checkIncomplete(h0); |
2788 |
> |
checkIncomplete(h1); |
2789 |
> |
rs[0].assertNotInvoked(); |
2790 |
> |
rs[1].assertNotInvoked(); |
2791 |
> |
if (pushNop) { // ad hoc test of intra-completion interference |
2792 |
> |
m.thenRun(f, () -> {}); |
2793 |
> |
m.thenRun(g, () -> {}); |
2794 |
> |
} |
2795 |
|
f.complete(v1); |
2796 |
+ |
checkCompletedNormally(h0, null); |
2797 |
+ |
checkCompletedNormally(h1, null); |
2798 |
+ |
rs[0].assertInvoked(); |
2799 |
+ |
rs[1].assertInvoked(); |
2800 |
+ |
final CompletableFuture<Void> h2 = m.runAfterEither(f, g, rs[2]); |
2801 |
+ |
final CompletableFuture<Void> h3 = m.runAfterEither(g, f, rs[3]); |
2802 |
+ |
checkCompletedNormally(h2, null); |
2803 |
+ |
checkCompletedNormally(h3, null); |
2804 |
+ |
rs[2].assertInvoked(); |
2805 |
+ |
rs[3].assertInvoked(); |
2806 |
|
|
2188 |
– |
checkCompletedNormally(f, v1); |
2189 |
– |
checkCompletedNormally(g, v2); |
2190 |
– |
checkCompletedNormally(h, null); |
2191 |
– |
assertEquals(1, r.invocationCount); |
2192 |
– |
}} |
2193 |
– |
|
2194 |
– |
public void testRunAfterEither_normalCompletion3() { |
2195 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
2196 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
2197 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
2198 |
– |
{ |
2199 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2200 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2201 |
– |
final Noop r = new Noop(m); |
2202 |
– |
|
2203 |
– |
f.complete(v1); |
2807 |
|
g.complete(v2); |
2205 |
– |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2808 |
|
|
2809 |
< |
checkCompletedNormally(h, null); |
2809 |
> |
final CompletableFuture<Void> h4 = m.runAfterEither(f, g, rs[4]); |
2810 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(g, f, rs[5]); |
2811 |
> |
|
2812 |
|
checkCompletedNormally(f, v1); |
2813 |
|
checkCompletedNormally(g, v2); |
2814 |
< |
assertEquals(1, r.invocationCount); |
2814 |
> |
checkCompletedNormally(h0, null); |
2815 |
> |
checkCompletedNormally(h1, null); |
2816 |
> |
checkCompletedNormally(h2, null); |
2817 |
> |
checkCompletedNormally(h3, null); |
2818 |
> |
checkCompletedNormally(h4, null); |
2819 |
> |
checkCompletedNormally(h5, null); |
2820 |
> |
for (int i = 0; i < 6; i++) rs[i].assertInvoked(); |
2821 |
|
}} |
2822 |
|
|
2823 |
|
/** |
2824 |
|
* runAfterEither result completes exceptionally after exceptional |
2825 |
|
* completion of either source |
2826 |
|
*/ |
2827 |
< |
public void testRunAfterEither_exceptionalCompletion1() { |
2827 |
> |
public void testRunAfterEither_exceptionalCompletion() { |
2828 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2829 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2830 |
|
{ |
2831 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2832 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2223 |
– |
final Noop r = new Noop(m); |
2224 |
– |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2833 |
|
final CFException ex = new CFException(); |
2834 |
+ |
final Noop[] rs = new Noop[6]; |
2835 |
+ |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
2836 |
|
|
2837 |
< |
f.completeExceptionally(ex); |
2838 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2839 |
< |
g.complete(v1); |
2837 |
> |
final CompletableFuture<Void> h0 = m.runAfterEither(f, g, rs[0]); |
2838 |
> |
final CompletableFuture<Void> h1 = m.runAfterEither(g, f, rs[1]); |
2839 |
> |
checkIncomplete(h0); |
2840 |
> |
checkIncomplete(h1); |
2841 |
> |
rs[0].assertNotInvoked(); |
2842 |
> |
rs[1].assertNotInvoked(); |
2843 |
> |
assertTrue(f.completeExceptionally(ex)); |
2844 |
> |
checkCompletedWithWrappedException(h0, ex); |
2845 |
> |
checkCompletedWithWrappedException(h1, ex); |
2846 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, g, rs[2]); |
2847 |
> |
final CompletableFuture<Void> h3 = m.runAfterEither(g, f, rs[3]); |
2848 |
> |
checkCompletedWithWrappedException(h2, ex); |
2849 |
> |
checkCompletedWithWrappedException(h3, ex); |
2850 |
> |
|
2851 |
> |
assertTrue(g.complete(v1)); |
2852 |
> |
|
2853 |
> |
// unspecified behavior - both source completions available |
2854 |
> |
final CompletableFuture<Void> h4 = m.runAfterEither(f, g, rs[4]); |
2855 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(g, f, rs[5]); |
2856 |
> |
try { |
2857 |
> |
assertNull(h4.join()); |
2858 |
> |
rs[4].assertInvoked(); |
2859 |
> |
} catch (CompletionException ok) { |
2860 |
> |
checkCompletedWithWrappedException(h4, ex); |
2861 |
> |
rs[4].assertNotInvoked(); |
2862 |
> |
} |
2863 |
> |
try { |
2864 |
> |
assertNull(h5.join()); |
2865 |
> |
rs[5].assertInvoked(); |
2866 |
> |
} catch (CompletionException ok) { |
2867 |
> |
checkCompletedWithWrappedException(h5, ex); |
2868 |
> |
rs[5].assertNotInvoked(); |
2869 |
> |
} |
2870 |
|
|
2871 |
< |
assertEquals(0, r.invocationCount); |
2871 |
> |
checkCompletedExceptionally(f, ex); |
2872 |
|
checkCompletedNormally(g, v1); |
2873 |
< |
checkCompletedWithWrappedCFException(f, ex); |
2874 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2873 |
> |
checkCompletedWithWrappedException(h0, ex); |
2874 |
> |
checkCompletedWithWrappedException(h1, ex); |
2875 |
> |
checkCompletedWithWrappedException(h2, ex); |
2876 |
> |
checkCompletedWithWrappedException(h3, ex); |
2877 |
> |
checkCompletedWithWrappedException(h4, ex); |
2878 |
> |
for (int i = 0; i < 4; i++) rs[i].assertNotInvoked(); |
2879 |
|
}} |
2880 |
|
|
2881 |
|
public void testRunAfterEither_exceptionalCompletion2() { |
2882 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2883 |
+ |
for (boolean fFirst : new boolean[] { true, false }) |
2884 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2885 |
|
{ |
2886 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2887 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2243 |
– |
final Noop r = new Noop(m); |
2244 |
– |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2245 |
– |
final CFException ex = new CFException(); |
2246 |
– |
|
2247 |
– |
g.completeExceptionally(ex); |
2248 |
– |
checkCompletedWithWrappedCFException(h, ex); |
2249 |
– |
f.complete(v1); |
2250 |
– |
|
2251 |
– |
assertEquals(0, r.invocationCount); |
2252 |
– |
checkCompletedNormally(f, v1); |
2253 |
– |
checkCompletedWithWrappedCFException(g, ex); |
2254 |
– |
checkCompletedWithWrappedCFException(h, ex); |
2255 |
– |
}} |
2256 |
– |
|
2257 |
– |
public void testRunAfterEither_exceptionalCompletion3() { |
2258 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
2259 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
2260 |
– |
{ |
2261 |
– |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2262 |
– |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2263 |
– |
final Noop r = new Noop(m); |
2888 |
|
final CFException ex = new CFException(); |
2889 |
+ |
final Noop[] rs = new Noop[6]; |
2890 |
+ |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
2891 |
|
|
2892 |
< |
g.completeExceptionally(ex); |
2893 |
< |
f.complete(v1); |
2894 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2892 |
> |
final CompletableFuture<Void> h0 = m.runAfterEither(f, g, rs[0]); |
2893 |
> |
final CompletableFuture<Void> h1 = m.runAfterEither(g, f, rs[1]); |
2894 |
> |
assertTrue( fFirst ? f.complete(v1) : g.completeExceptionally(ex)); |
2895 |
> |
assertTrue(!fFirst ? f.complete(v1) : g.completeExceptionally(ex)); |
2896 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, g, rs[2]); |
2897 |
> |
final CompletableFuture<Void> h3 = m.runAfterEither(g, f, rs[3]); |
2898 |
|
|
2899 |
< |
// unspecified behavior |
2900 |
< |
Integer v; |
2899 |
> |
// unspecified behavior - both source completions available |
2900 |
> |
try { |
2901 |
> |
assertNull(h0.join()); |
2902 |
> |
rs[0].assertInvoked(); |
2903 |
> |
} catch (CompletionException ok) { |
2904 |
> |
checkCompletedWithWrappedException(h0, ex); |
2905 |
> |
rs[0].assertNotInvoked(); |
2906 |
> |
} |
2907 |
> |
try { |
2908 |
> |
assertNull(h1.join()); |
2909 |
> |
rs[1].assertInvoked(); |
2910 |
> |
} catch (CompletionException ok) { |
2911 |
> |
checkCompletedWithWrappedException(h1, ex); |
2912 |
> |
rs[1].assertNotInvoked(); |
2913 |
> |
} |
2914 |
> |
try { |
2915 |
> |
assertNull(h2.join()); |
2916 |
> |
rs[2].assertInvoked(); |
2917 |
> |
} catch (CompletionException ok) { |
2918 |
> |
checkCompletedWithWrappedException(h2, ex); |
2919 |
> |
rs[2].assertNotInvoked(); |
2920 |
> |
} |
2921 |
|
try { |
2922 |
< |
assertNull(h.join()); |
2923 |
< |
assertEquals(1, r.invocationCount); |
2922 |
> |
assertNull(h3.join()); |
2923 |
> |
rs[3].assertInvoked(); |
2924 |
|
} catch (CompletionException ok) { |
2925 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2926 |
< |
assertEquals(0, r.invocationCount); |
2925 |
> |
checkCompletedWithWrappedException(h3, ex); |
2926 |
> |
rs[3].assertNotInvoked(); |
2927 |
|
} |
2928 |
|
|
2280 |
– |
checkCompletedWithWrappedCFException(g, ex); |
2929 |
|
checkCompletedNormally(f, v1); |
2930 |
+ |
checkCompletedExceptionally(g, ex); |
2931 |
|
}} |
2932 |
|
|
2933 |
< |
public void testRunAfterEither_exceptionalCompletion4() { |
2933 |
> |
/** |
2934 |
> |
* runAfterEither result completes exceptionally if either source cancelled |
2935 |
> |
*/ |
2936 |
> |
public void testRunAfterEither_sourceCancelled() { |
2937 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2938 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2939 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2940 |
|
{ |
2941 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2942 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2943 |
< |
final Noop r = new Noop(m); |
2944 |
< |
final CFException ex = new CFException(); |
2943 |
> |
final Noop[] rs = new Noop[6]; |
2944 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new Noop(m); |
2945 |
|
|
2946 |
< |
f.completeExceptionally(ex); |
2947 |
< |
g.complete(v1); |
2948 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2949 |
< |
|
2950 |
< |
// unspecified behavior |
2951 |
< |
Integer v; |
2946 |
> |
final CompletableFuture<Void> h0 = m.runAfterEither(f, g, rs[0]); |
2947 |
> |
final CompletableFuture<Void> h1 = m.runAfterEither(g, f, rs[1]); |
2948 |
> |
checkIncomplete(h0); |
2949 |
> |
checkIncomplete(h1); |
2950 |
> |
rs[0].assertNotInvoked(); |
2951 |
> |
rs[1].assertNotInvoked(); |
2952 |
> |
f.cancel(mayInterruptIfRunning); |
2953 |
> |
checkCompletedWithWrappedCancellationException(h0); |
2954 |
> |
checkCompletedWithWrappedCancellationException(h1); |
2955 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, g, rs[2]); |
2956 |
> |
final CompletableFuture<Void> h3 = m.runAfterEither(g, f, rs[3]); |
2957 |
> |
checkCompletedWithWrappedCancellationException(h2); |
2958 |
> |
checkCompletedWithWrappedCancellationException(h3); |
2959 |
> |
|
2960 |
> |
assertTrue(g.complete(v1)); |
2961 |
> |
|
2962 |
> |
// unspecified behavior - both source completions available |
2963 |
> |
final CompletableFuture<Void> h4 = m.runAfterEither(f, g, rs[4]); |
2964 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(g, f, rs[5]); |
2965 |
> |
try { |
2966 |
> |
assertNull(h4.join()); |
2967 |
> |
rs[4].assertInvoked(); |
2968 |
> |
} catch (CompletionException ok) { |
2969 |
> |
checkCompletedWithWrappedCancellationException(h4); |
2970 |
> |
rs[4].assertNotInvoked(); |
2971 |
> |
} |
2972 |
|
try { |
2973 |
< |
assertNull(h.join()); |
2974 |
< |
assertEquals(1, r.invocationCount); |
2973 |
> |
assertNull(h5.join()); |
2974 |
> |
rs[5].assertInvoked(); |
2975 |
|
} catch (CompletionException ok) { |
2976 |
< |
checkCompletedWithWrappedCFException(h, ex); |
2977 |
< |
assertEquals(0, r.invocationCount); |
2976 |
> |
checkCompletedWithWrappedCancellationException(h5); |
2977 |
> |
rs[5].assertNotInvoked(); |
2978 |
|
} |
2979 |
|
|
2980 |
< |
checkCompletedWithWrappedCFException(f, ex); |
2980 |
> |
checkCancelled(f); |
2981 |
|
checkCompletedNormally(g, v1); |
2982 |
+ |
checkCompletedWithWrappedCancellationException(h0); |
2983 |
+ |
checkCompletedWithWrappedCancellationException(h1); |
2984 |
+ |
checkCompletedWithWrappedCancellationException(h2); |
2985 |
+ |
checkCompletedWithWrappedCancellationException(h3); |
2986 |
+ |
for (int i = 0; i < 4; i++) rs[i].assertNotInvoked(); |
2987 |
|
}} |
2988 |
|
|
2989 |
|
/** |
2990 |
|
* runAfterEither result completes exceptionally if action does |
2991 |
|
*/ |
2992 |
< |
public void testRunAfterEither_actionFailed1() { |
2992 |
> |
public void testRunAfterEither_actionFailed() { |
2993 |
|
for (ExecutionMode m : ExecutionMode.values()) |
2994 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2995 |
|
for (Integer v2 : new Integer[] { 2, null }) |
2996 |
|
{ |
2997 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
2998 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
2999 |
< |
final FailingRunnable r = new FailingRunnable(); |
3000 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2999 |
> |
final FailingRunnable[] rs = new FailingRunnable[6]; |
3000 |
> |
for (int i = 0; i < rs.length; i++) rs[i] = new FailingRunnable(m); |
3001 |
> |
|
3002 |
> |
final CompletableFuture<Void> h0 = m.runAfterEither(f, g, rs[0]); |
3003 |
> |
final CompletableFuture<Void> h1 = m.runAfterEither(g, f, rs[1]); |
3004 |
> |
assertTrue(f.complete(v1)); |
3005 |
> |
final CompletableFuture<Void> h2 = m.runAfterEither(f, g, rs[2]); |
3006 |
> |
final CompletableFuture<Void> h3 = m.runAfterEither(g, f, rs[3]); |
3007 |
> |
checkCompletedWithWrappedException(h0, rs[0].ex); |
3008 |
> |
checkCompletedWithWrappedException(h1, rs[1].ex); |
3009 |
> |
checkCompletedWithWrappedException(h2, rs[2].ex); |
3010 |
> |
checkCompletedWithWrappedException(h3, rs[3].ex); |
3011 |
> |
for (int i = 0; i < 4; i++) rs[i].assertInvoked(); |
3012 |
> |
assertTrue(g.complete(v2)); |
3013 |
> |
final CompletableFuture<Void> h4 = m.runAfterEither(f, g, rs[4]); |
3014 |
> |
final CompletableFuture<Void> h5 = m.runAfterEither(g, f, rs[5]); |
3015 |
> |
checkCompletedWithWrappedException(h4, rs[4].ex); |
3016 |
> |
checkCompletedWithWrappedException(h5, rs[5].ex); |
3017 |
|
|
2324 |
– |
f.complete(v1); |
2325 |
– |
checkCompletedWithWrappedCFException(h); |
2326 |
– |
g.complete(v2); |
3018 |
|
checkCompletedNormally(f, v1); |
3019 |
|
checkCompletedNormally(g, v2); |
3020 |
+ |
for (int i = 0; i < 6; i++) rs[i].assertInvoked(); |
3021 |
|
}} |
3022 |
|
|
3023 |
< |
public void testRunAfterEither_actionFailed2() { |
3023 |
> |
/** |
3024 |
> |
* thenCompose result completes normally after normal completion of source |
3025 |
> |
*/ |
3026 |
> |
public void testThenCompose_normalCompletion() { |
3027 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3028 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
3029 |
|
for (Integer v1 : new Integer[] { 1, null }) |
2334 |
– |
for (Integer v2 : new Integer[] { 2, null }) |
3030 |
|
{ |
3031 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3032 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3033 |
< |
final FailingRunnable r = new FailingRunnable(); |
3034 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
3032 |
> |
final CompletableFutureInc r = new CompletableFutureInc(m); |
3033 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3034 |
> |
final CompletableFuture<Integer> g = m.thenCompose(f, r); |
3035 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
3036 |
|
|
3037 |
< |
g.complete(v2); |
2342 |
< |
checkCompletedWithWrappedCFException(h); |
2343 |
< |
f.complete(v1); |
3037 |
> |
checkCompletedNormally(g, inc(v1)); |
3038 |
|
checkCompletedNormally(f, v1); |
3039 |
< |
checkCompletedNormally(g, v2); |
3039 |
> |
r.assertValue(v1); |
3040 |
|
}} |
3041 |
|
|
3042 |
|
/** |
3043 |
< |
* runAfterEither result completes exceptionally if either source cancelled |
3043 |
> |
* thenCompose result completes exceptionally after exceptional |
3044 |
> |
* completion of source |
3045 |
|
*/ |
3046 |
< |
public void testRunAfterEither_sourceCancelled1() { |
3046 |
> |
public void testThenCompose_exceptionalCompletion() { |
3047 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3048 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2354 |
< |
for (Integer v1 : new Integer[] { 1, null }) |
3048 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3049 |
|
{ |
3050 |
+ |
final CFException ex = new CFException(); |
3051 |
+ |
final CompletableFutureInc r = new CompletableFutureInc(m); |
3052 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3053 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3054 |
< |
final Noop r = new Noop(m); |
3055 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2360 |
< |
|
2361 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
2362 |
< |
checkCompletedWithWrappedCancellationException(h); |
2363 |
< |
g.complete(v1); |
3053 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
3054 |
> |
final CompletableFuture<Integer> g = m.thenCompose(f, r); |
3055 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
3056 |
|
|
3057 |
< |
checkCancelled(f); |
3058 |
< |
assertEquals(0, r.invocationCount); |
3059 |
< |
checkCompletedNormally(g, v1); |
2368 |
< |
checkCompletedWithWrappedCancellationException(h); |
3057 |
> |
checkCompletedWithWrappedException(g, ex); |
3058 |
> |
checkCompletedExceptionally(f, ex); |
3059 |
> |
r.assertNotInvoked(); |
3060 |
|
}} |
3061 |
|
|
3062 |
< |
public void testRunAfterEither_sourceCancelled2() { |
3062 |
> |
/** |
3063 |
> |
* thenCompose result completes exceptionally if action does |
3064 |
> |
*/ |
3065 |
> |
public void testThenCompose_actionFailed() { |
3066 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3067 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
3067 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3068 |
|
for (Integer v1 : new Integer[] { 1, null }) |
3069 |
|
{ |
3070 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3071 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3072 |
< |
final Noop r = new Noop(m); |
3073 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
3074 |
< |
|
3075 |
< |
assertTrue(g.cancel(mayInterruptIfRunning)); |
2382 |
< |
checkCompletedWithWrappedCancellationException(h); |
2383 |
< |
f.complete(v1); |
3071 |
> |
final FailingCompletableFutureFunction r |
3072 |
> |
= new FailingCompletableFutureFunction(m); |
3073 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3074 |
> |
final CompletableFuture<Integer> g = m.thenCompose(f, r); |
3075 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
3076 |
|
|
3077 |
< |
checkCancelled(g); |
2386 |
< |
assertEquals(0, r.invocationCount); |
3077 |
> |
checkCompletedWithWrappedException(g, r.ex); |
3078 |
|
checkCompletedNormally(f, v1); |
2388 |
– |
checkCompletedWithWrappedCancellationException(h); |
3079 |
|
}} |
3080 |
|
|
3081 |
< |
public void testRunAfterEither_sourceCancelled3() { |
3081 |
> |
/** |
3082 |
> |
* thenCompose result completes exceptionally if source cancelled |
3083 |
> |
*/ |
3084 |
> |
public void testThenCompose_sourceCancelled() { |
3085 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3086 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
3087 |
|
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
2394 |
– |
for (Integer v1 : new Integer[] { 1, null }) |
3088 |
|
{ |
3089 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3090 |
< |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3091 |
< |
final Noop r = new Noop(m); |
3092 |
< |
|
3093 |
< |
assertTrue(g.cancel(mayInterruptIfRunning)); |
3094 |
< |
f.complete(v1); |
3095 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
2403 |
< |
|
2404 |
< |
// unspecified behavior |
2405 |
< |
Integer v; |
2406 |
< |
try { |
2407 |
< |
assertNull(h.join()); |
2408 |
< |
assertEquals(1, r.invocationCount); |
2409 |
< |
} catch (CompletionException ok) { |
2410 |
< |
checkCompletedWithWrappedCancellationException(h); |
2411 |
< |
assertEquals(0, r.invocationCount); |
3090 |
> |
final CompletableFutureInc r = new CompletableFutureInc(m); |
3091 |
> |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
3092 |
> |
final CompletableFuture<Integer> g = m.thenCompose(f, r); |
3093 |
> |
if (createIncomplete) { |
3094 |
> |
checkIncomplete(g); |
3095 |
> |
assertTrue(f.cancel(mayInterruptIfRunning)); |
3096 |
|
} |
3097 |
|
|
3098 |
< |
checkCancelled(g); |
3099 |
< |
checkCompletedNormally(f, v1); |
3098 |
> |
checkCompletedWithWrappedCancellationException(g); |
3099 |
> |
checkCancelled(f); |
3100 |
|
}} |
3101 |
|
|
3102 |
< |
public void testRunAfterEither_sourceCancelled4() { |
3102 |
> |
/** |
3103 |
> |
* thenCompose result completes exceptionally if the result of the action does |
3104 |
> |
*/ |
3105 |
> |
public void testThenCompose_actionReturnsFailingFuture() { |
3106 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3107 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
3107 |
> |
for (int order = 0; order < 6; order++) |
3108 |
|
for (Integer v1 : new Integer[] { 1, null }) |
3109 |
|
{ |
3110 |
+ |
final CFException ex = new CFException(); |
3111 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3112 |
|
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3113 |
< |
final Noop r = new Noop(m); |
3114 |
< |
|
3115 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
3116 |
< |
g.complete(v1); |
3117 |
< |
final CompletableFuture<Void> h = m.runAfterEither(f, g, r); |
3118 |
< |
|
3119 |
< |
// unspecified behavior |
3120 |
< |
Integer v; |
3121 |
< |
try { |
3122 |
< |
assertNull(h.join()); |
3123 |
< |
assertEquals(1, r.invocationCount); |
3124 |
< |
} catch (CompletionException ok) { |
3125 |
< |
checkCompletedWithWrappedCancellationException(h); |
3126 |
< |
assertEquals(0, r.invocationCount); |
3113 |
> |
final CompletableFuture<Integer> h; |
3114 |
> |
// Test all permutations of orders |
3115 |
> |
switch (order) { |
3116 |
> |
case 0: |
3117 |
> |
assertTrue(f.complete(v1)); |
3118 |
> |
assertTrue(g.completeExceptionally(ex)); |
3119 |
> |
h = m.thenCompose(f, (x -> g)); |
3120 |
> |
break; |
3121 |
> |
case 1: |
3122 |
> |
assertTrue(f.complete(v1)); |
3123 |
> |
h = m.thenCompose(f, (x -> g)); |
3124 |
> |
assertTrue(g.completeExceptionally(ex)); |
3125 |
> |
break; |
3126 |
> |
case 2: |
3127 |
> |
assertTrue(g.completeExceptionally(ex)); |
3128 |
> |
assertTrue(f.complete(v1)); |
3129 |
> |
h = m.thenCompose(f, (x -> g)); |
3130 |
> |
break; |
3131 |
> |
case 3: |
3132 |
> |
assertTrue(g.completeExceptionally(ex)); |
3133 |
> |
h = m.thenCompose(f, (x -> g)); |
3134 |
> |
assertTrue(f.complete(v1)); |
3135 |
> |
break; |
3136 |
> |
case 4: |
3137 |
> |
h = m.thenCompose(f, (x -> g)); |
3138 |
> |
assertTrue(f.complete(v1)); |
3139 |
> |
assertTrue(g.completeExceptionally(ex)); |
3140 |
> |
break; |
3141 |
> |
case 5: |
3142 |
> |
h = m.thenCompose(f, (x -> g)); |
3143 |
> |
assertTrue(f.complete(v1)); |
3144 |
> |
assertTrue(g.completeExceptionally(ex)); |
3145 |
> |
break; |
3146 |
> |
default: throw new AssertionError(); |
3147 |
|
} |
3148 |
|
|
3149 |
< |
checkCancelled(f); |
3150 |
< |
checkCompletedNormally(g, v1); |
3149 |
> |
checkCompletedExceptionally(g, ex); |
3150 |
> |
checkCompletedWithWrappedException(h, ex); |
3151 |
> |
checkCompletedNormally(f, v1); |
3152 |
|
}} |
3153 |
|
|
3154 |
|
/** |
3155 |
< |
* thenCompose result completes normally after normal completion of source |
3155 |
> |
* exceptionallyCompose result completes normally after normal |
3156 |
> |
* completion of source |
3157 |
|
*/ |
3158 |
< |
public void testThenCompose_normalCompletion() { |
3158 |
> |
public void testExceptionallyCompose_normalCompletion() { |
3159 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3160 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
3161 |
|
for (Integer v1 : new Integer[] { 1, null }) |
3162 |
|
{ |
3163 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3164 |
< |
final CompletableFutureInc r = new CompletableFutureInc(); |
3165 |
< |
if (!createIncomplete) f.complete(v1); |
3166 |
< |
final CompletableFuture<Integer> g = f.thenCompose(r); |
3167 |
< |
if (createIncomplete) f.complete(v1); |
3164 |
> |
final ExceptionalCompletableFutureFunction r = |
3165 |
> |
new ExceptionalCompletableFutureFunction(m); |
3166 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3167 |
> |
final CompletableFuture<Integer> g = m.exceptionallyCompose(f, r); |
3168 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
3169 |
> |
|
3170 |
> |
if (!createIncomplete && testImplementationDetails) |
3171 |
> |
assertSame(f, g); // an optimization |
3172 |
|
|
2459 |
– |
checkCompletedNormally(g, inc(v1)); |
3173 |
|
checkCompletedNormally(f, v1); |
3174 |
< |
assertEquals(1, r.invocationCount); |
3174 |
> |
checkCompletedNormally(g, v1); |
3175 |
> |
r.assertNotInvoked(); |
3176 |
|
}} |
3177 |
|
|
3178 |
|
/** |
3179 |
< |
* thenCompose result completes exceptionally after exceptional |
3179 |
> |
* exceptionallyCompose result completes normally after exceptional |
3180 |
|
* completion of source |
3181 |
|
*/ |
3182 |
< |
public void testThenCompose_exceptionalCompletion() { |
3182 |
> |
public void testExceptionallyCompose_exceptionalCompletion() { |
3183 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3184 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
3185 |
|
{ |
3186 |
|
final CFException ex = new CFException(); |
3187 |
< |
final CompletableFutureInc r = new CompletableFutureInc(); |
3187 |
> |
final ExceptionalCompletableFutureFunction r = |
3188 |
> |
new ExceptionalCompletableFutureFunction(m); |
3189 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3190 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
3191 |
< |
final CompletableFuture<Integer> g = f.thenCompose(r); |
3191 |
> |
final CompletableFuture<Integer> g = m.exceptionallyCompose(f, r); |
3192 |
|
if (createIncomplete) f.completeExceptionally(ex); |
3193 |
|
|
3194 |
< |
checkCompletedWithWrappedCFException(g, ex); |
3195 |
< |
checkCompletedWithWrappedCFException(f, ex); |
3196 |
< |
assertEquals(0, r.invocationCount); |
3194 |
> |
checkCompletedExceptionally(f, ex); |
3195 |
> |
checkCompletedNormally(g, r.value); |
3196 |
> |
r.assertInvoked(); |
3197 |
|
}} |
3198 |
|
|
3199 |
|
/** |
3200 |
< |
* thenCompose result completes exceptionally if action does |
3200 |
> |
* exceptionallyCompose completes exceptionally on exception if action does |
3201 |
|
*/ |
3202 |
< |
public void testThenCompose_actionFailed() { |
3202 |
> |
public void testExceptionallyCompose_actionFailed() { |
3203 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3204 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
3205 |
|
for (Integer v1 : new Integer[] { 1, null }) |
3206 |
|
{ |
3207 |
+ |
final CFException ex = new CFException(); |
3208 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3209 |
< |
final FailingCompletableFutureFunction r |
3210 |
< |
= new FailingCompletableFutureFunction(); |
3211 |
< |
if (!createIncomplete) f.complete(v1); |
3212 |
< |
final CompletableFuture<Integer> g = f.thenCompose(r); |
3213 |
< |
if (createIncomplete) f.complete(v1); |
3209 |
> |
final FailingExceptionalCompletableFutureFunction r |
3210 |
> |
= new FailingExceptionalCompletableFutureFunction(m); |
3211 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
3212 |
> |
final CompletableFuture<Integer> g = m.exceptionallyCompose(f, r); |
3213 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
3214 |
|
|
3215 |
< |
checkCompletedWithWrappedCFException(g); |
3216 |
< |
checkCompletedNormally(f, v1); |
3215 |
> |
checkCompletedExceptionally(f, ex); |
3216 |
> |
checkCompletedWithWrappedException(g, r.ex); |
3217 |
> |
r.assertInvoked(); |
3218 |
|
}} |
3219 |
|
|
3220 |
|
/** |
3221 |
< |
* thenCompose result completes exceptionally if source cancelled |
3221 |
> |
* thenComposeExceptionally result completes exceptionally if the |
3222 |
> |
* result of the action does |
3223 |
|
*/ |
3224 |
< |
public void testThenCompose_sourceCancelled() { |
3224 |
> |
public void testExceptionallyCompose_actionReturnsFailingFuture() { |
3225 |
|
for (ExecutionMode m : ExecutionMode.values()) |
3226 |
< |
for (boolean createIncomplete : new boolean[] { true, false }) |
3227 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
3226 |
> |
for (int order = 0; order < 6; order++) |
3227 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
3228 |
|
{ |
3229 |
+ |
final CFException ex0 = new CFException(); |
3230 |
+ |
final CFException ex = new CFException(); |
3231 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3232 |
< |
final CompletableFutureInc r = new CompletableFutureInc(); |
3233 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
3234 |
< |
final CompletableFuture<Integer> g = f.thenCompose(r); |
3235 |
< |
if (createIncomplete) { |
3236 |
< |
checkIncomplete(g); |
3237 |
< |
assertTrue(f.cancel(mayInterruptIfRunning)); |
3232 |
> |
final CompletableFuture<Integer> g = new CompletableFuture<>(); |
3233 |
> |
final CompletableFuture<Integer> h; |
3234 |
> |
// Test all permutations of orders |
3235 |
> |
switch (order) { |
3236 |
> |
case 0: |
3237 |
> |
assertTrue(f.completeExceptionally(ex0)); |
3238 |
> |
assertTrue(g.completeExceptionally(ex)); |
3239 |
> |
h = m.exceptionallyCompose(f, (x -> g)); |
3240 |
> |
break; |
3241 |
> |
case 1: |
3242 |
> |
assertTrue(f.completeExceptionally(ex0)); |
3243 |
> |
h = m.exceptionallyCompose(f, (x -> g)); |
3244 |
> |
assertTrue(g.completeExceptionally(ex)); |
3245 |
> |
break; |
3246 |
> |
case 2: |
3247 |
> |
assertTrue(g.completeExceptionally(ex)); |
3248 |
> |
assertTrue(f.completeExceptionally(ex0)); |
3249 |
> |
h = m.exceptionallyCompose(f, (x -> g)); |
3250 |
> |
break; |
3251 |
> |
case 3: |
3252 |
> |
assertTrue(g.completeExceptionally(ex)); |
3253 |
> |
h = m.exceptionallyCompose(f, (x -> g)); |
3254 |
> |
assertTrue(f.completeExceptionally(ex0)); |
3255 |
> |
break; |
3256 |
> |
case 4: |
3257 |
> |
h = m.exceptionallyCompose(f, (x -> g)); |
3258 |
> |
assertTrue(f.completeExceptionally(ex0)); |
3259 |
> |
assertTrue(g.completeExceptionally(ex)); |
3260 |
> |
break; |
3261 |
> |
case 5: |
3262 |
> |
h = m.exceptionallyCompose(f, (x -> g)); |
3263 |
> |
assertTrue(f.completeExceptionally(ex0)); |
3264 |
> |
assertTrue(g.completeExceptionally(ex)); |
3265 |
> |
break; |
3266 |
> |
default: throw new AssertionError(); |
3267 |
|
} |
3268 |
|
|
3269 |
< |
checkCompletedWithWrappedCancellationException(g); |
3270 |
< |
checkCancelled(f); |
3269 |
> |
checkCompletedExceptionally(g, ex); |
3270 |
> |
|
3271 |
> |
// TODO: should this be: checkCompletedWithWrappedException(h, ex); |
3272 |
> |
try { |
3273 |
> |
h.join(); |
3274 |
> |
shouldThrow(); |
3275 |
> |
} catch (Throwable t) { |
3276 |
> |
assertSame(ex, (t instanceof CompletionException) ? t.getCause() : t); |
3277 |
> |
} |
3278 |
> |
|
3279 |
> |
checkCompletedExceptionally(f, ex0); |
3280 |
|
}} |
3281 |
|
|
3282 |
|
// other static methods |
3295 |
|
* when all components complete normally |
3296 |
|
*/ |
3297 |
|
public void testAllOf_normal() throws Exception { |
3298 |
< |
for (int k = 1; k < 20; ++k) { |
3299 |
< |
CompletableFuture<Integer>[] fs = (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3300 |
< |
for (int i = 0; i < k; ++i) |
3298 |
> |
for (int k = 1; k < 10; k++) { |
3299 |
> |
CompletableFuture<Integer>[] fs |
3300 |
> |
= (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3301 |
> |
for (int i = 0; i < k; i++) |
3302 |
> |
fs[i] = new CompletableFuture<>(); |
3303 |
> |
CompletableFuture<Void> f = CompletableFuture.allOf(fs); |
3304 |
> |
for (int i = 0; i < k; i++) { |
3305 |
> |
checkIncomplete(f); |
3306 |
> |
checkIncomplete(CompletableFuture.allOf(fs)); |
3307 |
> |
fs[i].complete(one); |
3308 |
> |
} |
3309 |
> |
checkCompletedNormally(f, null); |
3310 |
> |
checkCompletedNormally(CompletableFuture.allOf(fs), null); |
3311 |
> |
} |
3312 |
> |
} |
3313 |
> |
|
3314 |
> |
public void testAllOf_normal_backwards() throws Exception { |
3315 |
> |
for (int k = 1; k < 10; k++) { |
3316 |
> |
CompletableFuture<Integer>[] fs |
3317 |
> |
= (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3318 |
> |
for (int i = 0; i < k; i++) |
3319 |
|
fs[i] = new CompletableFuture<>(); |
3320 |
|
CompletableFuture<Void> f = CompletableFuture.allOf(fs); |
3321 |
< |
for (int i = 0; i < k; ++i) { |
3321 |
> |
for (int i = k - 1; i >= 0; i--) { |
3322 |
|
checkIncomplete(f); |
3323 |
|
checkIncomplete(CompletableFuture.allOf(fs)); |
3324 |
|
fs[i].complete(one); |
3328 |
|
} |
3329 |
|
} |
3330 |
|
|
3331 |
+ |
public void testAllOf_exceptional() throws Exception { |
3332 |
+ |
for (int k = 1; k < 10; k++) { |
3333 |
+ |
CompletableFuture<Integer>[] fs |
3334 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture[k]; |
3335 |
+ |
CFException ex = new CFException(); |
3336 |
+ |
for (int i = 0; i < k; i++) |
3337 |
+ |
fs[i] = new CompletableFuture<>(); |
3338 |
+ |
CompletableFuture<Void> f = CompletableFuture.allOf(fs); |
3339 |
+ |
for (int i = 0; i < k; i++) { |
3340 |
+ |
checkIncomplete(f); |
3341 |
+ |
checkIncomplete(CompletableFuture.allOf(fs)); |
3342 |
+ |
if (i != k / 2) { |
3343 |
+ |
fs[i].complete(i); |
3344 |
+ |
checkCompletedNormally(fs[i], i); |
3345 |
+ |
} else { |
3346 |
+ |
fs[i].completeExceptionally(ex); |
3347 |
+ |
checkCompletedExceptionally(fs[i], ex); |
3348 |
+ |
} |
3349 |
+ |
} |
3350 |
+ |
checkCompletedWithWrappedException(f, ex); |
3351 |
+ |
checkCompletedWithWrappedException(CompletableFuture.allOf(fs), ex); |
3352 |
+ |
} |
3353 |
+ |
} |
3354 |
+ |
|
3355 |
|
/** |
3356 |
|
* anyOf(no component futures) returns an incomplete future |
3357 |
|
*/ |
3358 |
|
public void testAnyOf_empty() throws Exception { |
3359 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3360 |
+ |
{ |
3361 |
|
CompletableFuture<Object> f = CompletableFuture.anyOf(); |
3362 |
|
checkIncomplete(f); |
3363 |
< |
} |
3363 |
> |
|
3364 |
> |
f.complete(v1); |
3365 |
> |
checkCompletedNormally(f, v1); |
3366 |
> |
}} |
3367 |
|
|
3368 |
|
/** |
3369 |
|
* anyOf returns a future completed normally with a value when |
3370 |
|
* a component future does |
3371 |
|
*/ |
3372 |
|
public void testAnyOf_normal() throws Exception { |
3373 |
< |
for (int k = 0; k < 10; ++k) { |
3373 |
> |
for (int k = 0; k < 10; k++) { |
3374 |
|
CompletableFuture[] fs = new CompletableFuture[k]; |
3375 |
< |
for (int i = 0; i < k; ++i) |
3375 |
> |
for (int i = 0; i < k; i++) |
3376 |
|
fs[i] = new CompletableFuture<>(); |
3377 |
|
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3378 |
|
checkIncomplete(f); |
3379 |
< |
for (int i = 0; i < k; ++i) { |
3380 |
< |
fs[i].complete(one); |
3381 |
< |
checkCompletedNormally(f, one); |
3382 |
< |
checkCompletedNormally(CompletableFuture.anyOf(fs), one); |
3379 |
> |
for (int i = 0; i < k; i++) { |
3380 |
> |
fs[i].complete(i); |
3381 |
> |
checkCompletedNormally(f, 0); |
3382 |
> |
int x = (int) CompletableFuture.anyOf(fs).join(); |
3383 |
> |
assertTrue(0 <= x && x <= i); |
3384 |
> |
} |
3385 |
> |
} |
3386 |
> |
} |
3387 |
> |
public void testAnyOf_normal_backwards() throws Exception { |
3388 |
> |
for (int k = 0; k < 10; k++) { |
3389 |
> |
CompletableFuture[] fs = new CompletableFuture[k]; |
3390 |
> |
for (int i = 0; i < k; i++) |
3391 |
> |
fs[i] = new CompletableFuture<>(); |
3392 |
> |
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3393 |
> |
checkIncomplete(f); |
3394 |
> |
for (int i = k - 1; i >= 0; i--) { |
3395 |
> |
fs[i].complete(i); |
3396 |
> |
checkCompletedNormally(f, k - 1); |
3397 |
> |
int x = (int) CompletableFuture.anyOf(fs).join(); |
3398 |
> |
assertTrue(i <= x && x <= k - 1); |
3399 |
|
} |
3400 |
|
} |
3401 |
|
} |
3404 |
|
* anyOf result completes exceptionally when any component does. |
3405 |
|
*/ |
3406 |
|
public void testAnyOf_exceptional() throws Exception { |
3407 |
< |
for (int k = 0; k < 10; ++k) { |
3407 |
> |
for (int k = 0; k < 10; k++) { |
3408 |
> |
CompletableFuture[] fs = new CompletableFuture[k]; |
3409 |
> |
CFException[] exs = new CFException[k]; |
3410 |
> |
for (int i = 0; i < k; i++) { |
3411 |
> |
fs[i] = new CompletableFuture<>(); |
3412 |
> |
exs[i] = new CFException(); |
3413 |
> |
} |
3414 |
> |
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3415 |
> |
checkIncomplete(f); |
3416 |
> |
for (int i = 0; i < k; i++) { |
3417 |
> |
fs[i].completeExceptionally(exs[i]); |
3418 |
> |
checkCompletedWithWrappedException(f, exs[0]); |
3419 |
> |
checkCompletedWithWrappedCFException(CompletableFuture.anyOf(fs)); |
3420 |
> |
} |
3421 |
> |
} |
3422 |
> |
} |
3423 |
> |
|
3424 |
> |
public void testAnyOf_exceptional_backwards() throws Exception { |
3425 |
> |
for (int k = 0; k < 10; k++) { |
3426 |
|
CompletableFuture[] fs = new CompletableFuture[k]; |
3427 |
< |
for (int i = 0; i < k; ++i) |
3427 |
> |
CFException[] exs = new CFException[k]; |
3428 |
> |
for (int i = 0; i < k; i++) { |
3429 |
|
fs[i] = new CompletableFuture<>(); |
3430 |
+ |
exs[i] = new CFException(); |
3431 |
+ |
} |
3432 |
|
CompletableFuture<Object> f = CompletableFuture.anyOf(fs); |
3433 |
|
checkIncomplete(f); |
3434 |
< |
for (int i = 0; i < k; ++i) { |
3435 |
< |
fs[i].completeExceptionally(new CFException()); |
3436 |
< |
checkCompletedWithWrappedCFException(f); |
3434 |
> |
for (int i = k - 1; i >= 0; i--) { |
3435 |
> |
fs[i].completeExceptionally(exs[i]); |
3436 |
> |
checkCompletedWithWrappedException(f, exs[k - 1]); |
3437 |
|
checkCompletedWithWrappedCFException(CompletableFuture.anyOf(fs)); |
3438 |
|
} |
3439 |
|
} |
3442 |
|
/** |
3443 |
|
* Completion methods throw NullPointerException with null arguments |
3444 |
|
*/ |
3445 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
3446 |
|
public void testNPE() { |
3447 |
|
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3448 |
|
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3449 |
|
CompletableFuture<Integer> nullFuture = (CompletableFuture<Integer>)null; |
2607 |
– |
CompletableFuture<?> h; |
3450 |
|
ThreadExecutor exec = new ThreadExecutor(); |
3451 |
|
|
3452 |
|
Runnable[] throwingActions = { |
3453 |
|
() -> CompletableFuture.supplyAsync(null), |
3454 |
|
() -> CompletableFuture.supplyAsync(null, exec), |
3455 |
< |
() -> CompletableFuture.supplyAsync(supplyOne, null), |
3455 |
> |
() -> CompletableFuture.supplyAsync(new IntegerSupplier(ExecutionMode.SYNC, 42), null), |
3456 |
|
|
3457 |
|
() -> CompletableFuture.runAsync(null), |
3458 |
|
() -> CompletableFuture.runAsync(null, exec), |
3462 |
|
|
3463 |
|
() -> f.thenApply(null), |
3464 |
|
() -> f.thenApplyAsync(null), |
3465 |
< |
() -> f.thenApplyAsync((x) -> x, null), |
3465 |
> |
() -> f.thenApplyAsync(x -> x, null), |
3466 |
|
() -> f.thenApplyAsync(null, exec), |
3467 |
|
|
3468 |
|
() -> f.thenAccept(null), |
3469 |
|
() -> f.thenAcceptAsync(null), |
3470 |
< |
() -> f.thenAcceptAsync((x) -> {} , null), |
3470 |
> |
() -> f.thenAcceptAsync(x -> {} , null), |
3471 |
|
() -> f.thenAcceptAsync(null, exec), |
3472 |
|
|
3473 |
|
() -> f.thenRun(null), |
3502 |
|
() -> f.applyToEither(g, null), |
3503 |
|
() -> f.applyToEitherAsync(g, null), |
3504 |
|
() -> f.applyToEitherAsync(g, null, exec), |
3505 |
< |
() -> f.applyToEither(nullFuture, (x) -> x), |
3506 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x), |
3507 |
< |
() -> f.applyToEitherAsync(nullFuture, (x) -> x, exec), |
3508 |
< |
() -> f.applyToEitherAsync(g, (x) -> x, null), |
3505 |
> |
() -> f.applyToEither(nullFuture, x -> x), |
3506 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x), |
3507 |
> |
() -> f.applyToEitherAsync(nullFuture, x -> x, exec), |
3508 |
> |
() -> f.applyToEitherAsync(g, x -> x, null), |
3509 |
|
|
3510 |
|
() -> f.acceptEither(g, null), |
3511 |
|
() -> f.acceptEitherAsync(g, null), |
3512 |
|
() -> f.acceptEitherAsync(g, null, exec), |
3513 |
< |
() -> f.acceptEither(nullFuture, (x) -> {}), |
3514 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}), |
3515 |
< |
() -> f.acceptEitherAsync(nullFuture, (x) -> {}, exec), |
3516 |
< |
() -> f.acceptEitherAsync(g, (x) -> {}, null), |
3513 |
> |
() -> f.acceptEither(nullFuture, x -> {}), |
3514 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}), |
3515 |
> |
() -> f.acceptEitherAsync(nullFuture, x -> {}, exec), |
3516 |
> |
() -> f.acceptEitherAsync(g, x -> {}, null), |
3517 |
|
|
3518 |
|
() -> f.runAfterEither(g, null), |
3519 |
|
() -> f.runAfterEitherAsync(g, null), |
3525 |
|
|
3526 |
|
() -> f.thenCompose(null), |
3527 |
|
() -> f.thenComposeAsync(null), |
3528 |
< |
() -> f.thenComposeAsync(new CompletableFutureInc(), null), |
3528 |
> |
() -> f.thenComposeAsync(new CompletableFutureInc(ExecutionMode.EXECUTOR), null), |
3529 |
|
() -> f.thenComposeAsync(null, exec), |
3530 |
|
|
3531 |
|
() -> f.exceptionally(null), |
3543 |
|
() -> CompletableFuture.anyOf(null, f), |
3544 |
|
|
3545 |
|
() -> f.obtrudeException(null), |
3546 |
+ |
|
3547 |
+ |
() -> CompletableFuture.delayedExecutor(1L, SECONDS, null), |
3548 |
+ |
() -> CompletableFuture.delayedExecutor(1L, null, exec), |
3549 |
+ |
() -> CompletableFuture.delayedExecutor(1L, null), |
3550 |
+ |
|
3551 |
+ |
() -> f.orTimeout(1L, null), |
3552 |
+ |
() -> f.completeOnTimeout(42, 1L, null), |
3553 |
+ |
|
3554 |
+ |
() -> CompletableFuture.failedFuture(null), |
3555 |
+ |
() -> CompletableFuture.failedStage(null), |
3556 |
|
}; |
3557 |
|
|
3558 |
|
assertThrows(NullPointerException.class, throwingActions); |
3560 |
|
} |
3561 |
|
|
3562 |
|
/** |
3563 |
+ |
* Test submissions to an executor that rejects all tasks. |
3564 |
+ |
*/ |
3565 |
+ |
public void testRejectingExecutor() { |
3566 |
+ |
for (Integer v : new Integer[] { 1, null }) |
3567 |
+ |
{ |
3568 |
+ |
final CountingRejectingExecutor e = new CountingRejectingExecutor(); |
3569 |
+ |
|
3570 |
+ |
final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v); |
3571 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3572 |
+ |
|
3573 |
+ |
List<CompletableFuture<?>> futures = new ArrayList<>(); |
3574 |
+ |
|
3575 |
+ |
List<CompletableFuture<Integer>> srcs = new ArrayList<>(); |
3576 |
+ |
srcs.add(complete); |
3577 |
+ |
srcs.add(incomplete); |
3578 |
+ |
|
3579 |
+ |
for (CompletableFuture<Integer> src : srcs) { |
3580 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3581 |
+ |
fs.add(src.thenRunAsync(() -> {}, e)); |
3582 |
+ |
fs.add(src.thenAcceptAsync(z -> {}, e)); |
3583 |
+ |
fs.add(src.thenApplyAsync(z -> z, e)); |
3584 |
+ |
|
3585 |
+ |
fs.add(src.thenCombineAsync(src, (x, y) -> x, e)); |
3586 |
+ |
fs.add(src.thenAcceptBothAsync(src, (x, y) -> {}, e)); |
3587 |
+ |
fs.add(src.runAfterBothAsync(src, () -> {}, e)); |
3588 |
+ |
|
3589 |
+ |
fs.add(src.applyToEitherAsync(src, z -> z, e)); |
3590 |
+ |
fs.add(src.acceptEitherAsync(src, z -> {}, e)); |
3591 |
+ |
fs.add(src.runAfterEitherAsync(src, () -> {}, e)); |
3592 |
+ |
|
3593 |
+ |
fs.add(src.thenComposeAsync(z -> null, e)); |
3594 |
+ |
fs.add(src.whenCompleteAsync((z, t) -> {}, e)); |
3595 |
+ |
fs.add(src.handleAsync((z, t) -> null, e)); |
3596 |
+ |
|
3597 |
+ |
for (CompletableFuture<?> future : fs) { |
3598 |
+ |
if (src.isDone()) |
3599 |
+ |
checkCompletedWithWrappedException(future, e.ex); |
3600 |
+ |
else |
3601 |
+ |
checkIncomplete(future); |
3602 |
+ |
} |
3603 |
+ |
futures.addAll(fs); |
3604 |
+ |
} |
3605 |
+ |
|
3606 |
+ |
{ |
3607 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3608 |
+ |
|
3609 |
+ |
fs.add(complete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3610 |
+ |
fs.add(incomplete.thenCombineAsync(complete, (x, y) -> x, e)); |
3611 |
+ |
|
3612 |
+ |
fs.add(complete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3613 |
+ |
fs.add(incomplete.thenAcceptBothAsync(complete, (x, y) -> {}, e)); |
3614 |
+ |
|
3615 |
+ |
fs.add(complete.runAfterBothAsync(incomplete, () -> {}, e)); |
3616 |
+ |
fs.add(incomplete.runAfterBothAsync(complete, () -> {}, e)); |
3617 |
+ |
|
3618 |
+ |
for (CompletableFuture<?> future : fs) |
3619 |
+ |
checkIncomplete(future); |
3620 |
+ |
futures.addAll(fs); |
3621 |
+ |
} |
3622 |
+ |
|
3623 |
+ |
{ |
3624 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3625 |
+ |
|
3626 |
+ |
fs.add(complete.applyToEitherAsync(incomplete, z -> z, e)); |
3627 |
+ |
fs.add(incomplete.applyToEitherAsync(complete, z -> z, e)); |
3628 |
+ |
|
3629 |
+ |
fs.add(complete.acceptEitherAsync(incomplete, z -> {}, e)); |
3630 |
+ |
fs.add(incomplete.acceptEitherAsync(complete, z -> {}, e)); |
3631 |
+ |
|
3632 |
+ |
fs.add(complete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3633 |
+ |
fs.add(incomplete.runAfterEitherAsync(complete, () -> {}, e)); |
3634 |
+ |
|
3635 |
+ |
for (CompletableFuture<?> future : fs) |
3636 |
+ |
checkCompletedWithWrappedException(future, e.ex); |
3637 |
+ |
futures.addAll(fs); |
3638 |
+ |
} |
3639 |
+ |
|
3640 |
+ |
incomplete.complete(v); |
3641 |
+ |
|
3642 |
+ |
for (CompletableFuture<?> future : futures) |
3643 |
+ |
checkCompletedWithWrappedException(future, e.ex); |
3644 |
+ |
|
3645 |
+ |
assertEquals(futures.size(), e.count.get()); |
3646 |
+ |
}} |
3647 |
+ |
|
3648 |
+ |
/** |
3649 |
+ |
* Test submissions to an executor that rejects all tasks, but |
3650 |
+ |
* should never be invoked because the dependent future is |
3651 |
+ |
* explicitly completed. |
3652 |
+ |
*/ |
3653 |
+ |
public void testRejectingExecutorNeverInvoked() { |
3654 |
+ |
for (Integer v : new Integer[] { 1, null }) |
3655 |
+ |
{ |
3656 |
+ |
final CountingRejectingExecutor e = new CountingRejectingExecutor(); |
3657 |
+ |
|
3658 |
+ |
final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v); |
3659 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
3660 |
+ |
|
3661 |
+ |
List<CompletableFuture<?>> futures = new ArrayList<>(); |
3662 |
+ |
|
3663 |
+ |
List<CompletableFuture<Integer>> srcs = new ArrayList<>(); |
3664 |
+ |
srcs.add(complete); |
3665 |
+ |
srcs.add(incomplete); |
3666 |
+ |
|
3667 |
+ |
List<CompletableFuture<?>> fs = new ArrayList<>(); |
3668 |
+ |
fs.add(incomplete.thenRunAsync(() -> {}, e)); |
3669 |
+ |
fs.add(incomplete.thenAcceptAsync(z -> {}, e)); |
3670 |
+ |
fs.add(incomplete.thenApplyAsync(z -> z, e)); |
3671 |
+ |
|
3672 |
+ |
fs.add(incomplete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3673 |
+ |
fs.add(incomplete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3674 |
+ |
fs.add(incomplete.runAfterBothAsync(incomplete, () -> {}, e)); |
3675 |
+ |
|
3676 |
+ |
fs.add(incomplete.applyToEitherAsync(incomplete, z -> z, e)); |
3677 |
+ |
fs.add(incomplete.acceptEitherAsync(incomplete, z -> {}, e)); |
3678 |
+ |
fs.add(incomplete.runAfterEitherAsync(incomplete, () -> {}, e)); |
3679 |
+ |
|
3680 |
+ |
fs.add(incomplete.thenComposeAsync(z -> null, e)); |
3681 |
+ |
fs.add(incomplete.whenCompleteAsync((z, t) -> {}, e)); |
3682 |
+ |
fs.add(incomplete.handleAsync((z, t) -> null, e)); |
3683 |
+ |
|
3684 |
+ |
fs.add(complete.thenCombineAsync(incomplete, (x, y) -> x, e)); |
3685 |
+ |
fs.add(incomplete.thenCombineAsync(complete, (x, y) -> x, e)); |
3686 |
+ |
|
3687 |
+ |
fs.add(complete.thenAcceptBothAsync(incomplete, (x, y) -> {}, e)); |
3688 |
+ |
fs.add(incomplete.thenAcceptBothAsync(complete, (x, y) -> {}, e)); |
3689 |
+ |
|
3690 |
+ |
fs.add(complete.runAfterBothAsync(incomplete, () -> {}, e)); |
3691 |
+ |
fs.add(incomplete.runAfterBothAsync(complete, () -> {}, e)); |
3692 |
+ |
|
3693 |
+ |
for (CompletableFuture<?> future : fs) |
3694 |
+ |
checkIncomplete(future); |
3695 |
+ |
|
3696 |
+ |
for (CompletableFuture<?> future : fs) |
3697 |
+ |
future.complete(null); |
3698 |
+ |
|
3699 |
+ |
incomplete.complete(v); |
3700 |
+ |
|
3701 |
+ |
for (CompletableFuture<?> future : fs) |
3702 |
+ |
checkCompletedNormally(future, null); |
3703 |
+ |
|
3704 |
+ |
assertEquals(0, e.count.get()); |
3705 |
+ |
}} |
3706 |
+ |
|
3707 |
+ |
/** |
3708 |
|
* toCompletableFuture returns this CompletableFuture. |
3709 |
|
*/ |
3710 |
|
public void testToCompletableFuture() { |
3712 |
|
assertSame(f, f.toCompletableFuture()); |
3713 |
|
} |
3714 |
|
|
3715 |
+ |
// jdk9 |
3716 |
+ |
|
3717 |
|
/** |
3718 |
< |
* whenComplete action executes on normal completion, propagating |
2720 |
< |
* source result. |
3718 |
> |
* newIncompleteFuture returns an incomplete CompletableFuture |
3719 |
|
*/ |
3720 |
< |
public void testWhenComplete_normalCompletion1() { |
3721 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
3720 |
> |
public void testNewIncompleteFuture() { |
3721 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
3722 |
> |
{ |
3723 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3724 |
> |
CompletableFuture<Integer> g = f.newIncompleteFuture(); |
3725 |
> |
checkIncomplete(f); |
3726 |
> |
checkIncomplete(g); |
3727 |
> |
f.complete(v1); |
3728 |
> |
checkCompletedNormally(f, v1); |
3729 |
> |
checkIncomplete(g); |
3730 |
> |
g.complete(v1); |
3731 |
> |
checkCompletedNormally(g, v1); |
3732 |
> |
assertSame(g.getClass(), CompletableFuture.class); |
3733 |
> |
}} |
3734 |
> |
|
3735 |
> |
/** |
3736 |
> |
* completedStage returns a completed CompletionStage |
3737 |
> |
*/ |
3738 |
> |
public void testCompletedStage() { |
3739 |
> |
AtomicInteger x = new AtomicInteger(0); |
3740 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3741 |
> |
CompletionStage<Integer> f = CompletableFuture.completedStage(1); |
3742 |
> |
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3743 |
> |
assertEquals(x.get(), 1); |
3744 |
> |
assertNull(r.get()); |
3745 |
> |
} |
3746 |
> |
|
3747 |
> |
/** |
3748 |
> |
* defaultExecutor by default returns the commonPool if |
3749 |
> |
* it supports more than one thread. |
3750 |
> |
*/ |
3751 |
> |
public void testDefaultExecutor() { |
3752 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3753 |
> |
Executor e = f.defaultExecutor(); |
3754 |
> |
Executor c = ForkJoinPool.commonPool(); |
3755 |
> |
if (ForkJoinPool.getCommonPoolParallelism() > 1) |
3756 |
> |
assertSame(e, c); |
3757 |
> |
else |
3758 |
> |
assertNotSame(e, c); |
3759 |
> |
} |
3760 |
> |
|
3761 |
> |
/** |
3762 |
> |
* failedFuture returns a CompletableFuture completed |
3763 |
> |
* exceptionally with the given Exception |
3764 |
> |
*/ |
3765 |
> |
public void testFailedFuture() { |
3766 |
> |
CFException ex = new CFException(); |
3767 |
> |
CompletableFuture<Integer> f = CompletableFuture.failedFuture(ex); |
3768 |
> |
checkCompletedExceptionally(f, ex); |
3769 |
> |
} |
3770 |
> |
|
3771 |
> |
/** |
3772 |
> |
* failedFuture(null) throws NPE |
3773 |
> |
*/ |
3774 |
> |
public void testFailedFuture_null() { |
3775 |
> |
try { |
3776 |
> |
CompletableFuture<Integer> f = CompletableFuture.failedFuture(null); |
3777 |
> |
shouldThrow(); |
3778 |
> |
} catch (NullPointerException success) {} |
3779 |
> |
} |
3780 |
> |
|
3781 |
> |
/** |
3782 |
> |
* copy returns a CompletableFuture that is completed normally, |
3783 |
> |
* with the same value, when source is. |
3784 |
> |
*/ |
3785 |
> |
public void testCopy_normalCompletion() { |
3786 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
3787 |
|
for (Integer v1 : new Integer[] { 1, null }) |
3788 |
|
{ |
3789 |
< |
final AtomicInteger a = new AtomicInteger(0); |
3790 |
< |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
3791 |
< |
if (!createIncomplete) f.complete(v1); |
3792 |
< |
final CompletableFuture<Integer> g = m.whenComplete |
3793 |
< |
(f, |
3794 |
< |
(Integer x, Throwable t) -> { |
3795 |
< |
threadAssertSame(x, v1); |
3796 |
< |
threadAssertNull(t); |
3797 |
< |
a.getAndIncrement(); |
3798 |
< |
}); |
3799 |
< |
if (createIncomplete) f.complete(v1); |
3789 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3790 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
3791 |
> |
CompletableFuture<Integer> g = f.copy(); |
3792 |
> |
if (createIncomplete) { |
3793 |
> |
checkIncomplete(f); |
3794 |
> |
checkIncomplete(g); |
3795 |
> |
assertTrue(f.complete(v1)); |
3796 |
> |
} |
3797 |
> |
checkCompletedNormally(f, v1); |
3798 |
> |
checkCompletedNormally(g, v1); |
3799 |
> |
}} |
3800 |
> |
|
3801 |
> |
/** |
3802 |
> |
* copy returns a CompletableFuture that is completed exceptionally |
3803 |
> |
* when source is. |
3804 |
> |
*/ |
3805 |
> |
public void testCopy_exceptionalCompletion() { |
3806 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
3807 |
> |
{ |
3808 |
> |
CFException ex = new CFException(); |
3809 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3810 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
3811 |
> |
CompletableFuture<Integer> g = f.copy(); |
3812 |
> |
if (createIncomplete) { |
3813 |
> |
checkIncomplete(f); |
3814 |
> |
checkIncomplete(g); |
3815 |
> |
f.completeExceptionally(ex); |
3816 |
> |
} |
3817 |
> |
checkCompletedExceptionally(f, ex); |
3818 |
> |
checkCompletedWithWrappedException(g, ex); |
3819 |
> |
}} |
3820 |
> |
|
3821 |
> |
/** |
3822 |
> |
* Completion of a copy does not complete its source. |
3823 |
> |
*/ |
3824 |
> |
public void testCopy_oneWayPropagation() { |
3825 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3826 |
> |
assertTrue(f.copy().complete(1)); |
3827 |
> |
assertTrue(f.copy().complete(null)); |
3828 |
> |
assertTrue(f.copy().cancel(true)); |
3829 |
> |
assertTrue(f.copy().cancel(false)); |
3830 |
> |
assertTrue(f.copy().completeExceptionally(new CFException())); |
3831 |
> |
checkIncomplete(f); |
3832 |
> |
} |
3833 |
> |
|
3834 |
> |
/** |
3835 |
> |
* minimalCompletionStage returns a CompletableFuture that is |
3836 |
> |
* completed normally, with the same value, when source is. |
3837 |
> |
*/ |
3838 |
> |
public void testMinimalCompletionStage() { |
3839 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3840 |
> |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3841 |
> |
AtomicInteger x = new AtomicInteger(0); |
3842 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3843 |
> |
checkIncomplete(f); |
3844 |
> |
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3845 |
> |
f.complete(1); |
3846 |
> |
checkCompletedNormally(f, 1); |
3847 |
> |
assertEquals(x.get(), 1); |
3848 |
> |
assertNull(r.get()); |
3849 |
> |
} |
3850 |
> |
|
3851 |
> |
/** |
3852 |
> |
* minimalCompletionStage returns a CompletableFuture that is |
3853 |
> |
* completed exceptionally when source is. |
3854 |
> |
*/ |
3855 |
> |
public void testMinimalCompletionStage2() { |
3856 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3857 |
> |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
3858 |
> |
AtomicInteger x = new AtomicInteger(0); |
3859 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3860 |
> |
g.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3861 |
> |
checkIncomplete(f); |
3862 |
> |
CFException ex = new CFException(); |
3863 |
> |
f.completeExceptionally(ex); |
3864 |
> |
checkCompletedExceptionally(f, ex); |
3865 |
> |
assertEquals(x.get(), 0); |
3866 |
> |
assertEquals(r.get().getCause(), ex); |
3867 |
> |
} |
3868 |
> |
|
3869 |
> |
/** |
3870 |
> |
* failedStage returns a CompletionStage completed |
3871 |
> |
* exceptionally with the given Exception |
3872 |
> |
*/ |
3873 |
> |
public void testFailedStage() { |
3874 |
> |
CFException ex = new CFException(); |
3875 |
> |
CompletionStage<Integer> f = CompletableFuture.failedStage(ex); |
3876 |
> |
AtomicInteger x = new AtomicInteger(0); |
3877 |
> |
AtomicReference<Throwable> r = new AtomicReference<>(); |
3878 |
> |
f.whenComplete((v, e) -> {if (e != null) r.set(e); else x.set(v);}); |
3879 |
> |
assertEquals(x.get(), 0); |
3880 |
> |
assertEquals(r.get(), ex); |
3881 |
> |
} |
3882 |
> |
|
3883 |
> |
/** |
3884 |
> |
* completeAsync completes with value of given supplier |
3885 |
> |
*/ |
3886 |
> |
public void testCompleteAsync() { |
3887 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
3888 |
> |
{ |
3889 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3890 |
> |
f.completeAsync(() -> v1); |
3891 |
> |
f.join(); |
3892 |
> |
checkCompletedNormally(f, v1); |
3893 |
> |
}} |
3894 |
> |
|
3895 |
> |
/** |
3896 |
> |
* completeAsync completes exceptionally if given supplier throws |
3897 |
> |
*/ |
3898 |
> |
public void testCompleteAsync2() { |
3899 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3900 |
> |
CFException ex = new CFException(); |
3901 |
> |
f.completeAsync(() -> { throw ex; }); |
3902 |
> |
try { |
3903 |
> |
f.join(); |
3904 |
> |
shouldThrow(); |
3905 |
> |
} catch (CompletionException success) {} |
3906 |
> |
checkCompletedWithWrappedException(f, ex); |
3907 |
> |
} |
3908 |
> |
|
3909 |
> |
/** |
3910 |
> |
* completeAsync with given executor completes with value of given supplier |
3911 |
> |
*/ |
3912 |
> |
public void testCompleteAsync3() { |
3913 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
3914 |
> |
{ |
3915 |
> |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3916 |
> |
ThreadExecutor executor = new ThreadExecutor(); |
3917 |
> |
f.completeAsync(() -> v1, executor); |
3918 |
> |
assertSame(v1, f.join()); |
3919 |
> |
checkCompletedNormally(f, v1); |
3920 |
> |
assertEquals(1, executor.count.get()); |
3921 |
> |
}} |
3922 |
|
|
3923 |
+ |
/** |
3924 |
+ |
* completeAsync with given executor completes exceptionally if |
3925 |
+ |
* given supplier throws |
3926 |
+ |
*/ |
3927 |
+ |
public void testCompleteAsync4() { |
3928 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3929 |
+ |
CFException ex = new CFException(); |
3930 |
+ |
ThreadExecutor executor = new ThreadExecutor(); |
3931 |
+ |
f.completeAsync(() -> { throw ex; }, executor); |
3932 |
+ |
try { |
3933 |
+ |
f.join(); |
3934 |
+ |
shouldThrow(); |
3935 |
+ |
} catch (CompletionException success) {} |
3936 |
+ |
checkCompletedWithWrappedException(f, ex); |
3937 |
+ |
assertEquals(1, executor.count.get()); |
3938 |
+ |
} |
3939 |
+ |
|
3940 |
+ |
/** |
3941 |
+ |
* orTimeout completes with TimeoutException if not complete |
3942 |
+ |
*/ |
3943 |
+ |
public void testOrTimeout_timesOut() { |
3944 |
+ |
long timeoutMillis = timeoutMillis(); |
3945 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3946 |
+ |
long startTime = System.nanoTime(); |
3947 |
+ |
assertSame(f, f.orTimeout(timeoutMillis, MILLISECONDS)); |
3948 |
+ |
checkCompletedWithTimeoutException(f); |
3949 |
+ |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
3950 |
+ |
} |
3951 |
+ |
|
3952 |
+ |
/** |
3953 |
+ |
* orTimeout completes normally if completed before timeout |
3954 |
+ |
*/ |
3955 |
+ |
public void testOrTimeout_completed() { |
3956 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3957 |
+ |
{ |
3958 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3959 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
3960 |
+ |
long startTime = System.nanoTime(); |
3961 |
+ |
f.complete(v1); |
3962 |
+ |
assertSame(f, f.orTimeout(LONG_DELAY_MS, MILLISECONDS)); |
3963 |
+ |
assertSame(g, g.orTimeout(LONG_DELAY_MS, MILLISECONDS)); |
3964 |
+ |
g.complete(v1); |
3965 |
+ |
checkCompletedNormally(f, v1); |
3966 |
|
checkCompletedNormally(g, v1); |
3967 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
3968 |
+ |
}} |
3969 |
+ |
|
3970 |
+ |
/** |
3971 |
+ |
* completeOnTimeout completes with given value if not complete |
3972 |
+ |
*/ |
3973 |
+ |
public void testCompleteOnTimeout_timesOut() { |
3974 |
+ |
testInParallel(() -> testCompleteOnTimeout_timesOut(42), |
3975 |
+ |
() -> testCompleteOnTimeout_timesOut(null)); |
3976 |
+ |
} |
3977 |
+ |
|
3978 |
+ |
/** |
3979 |
+ |
* completeOnTimeout completes with given value if not complete |
3980 |
+ |
*/ |
3981 |
+ |
public void testCompleteOnTimeout_timesOut(Integer v) { |
3982 |
+ |
long timeoutMillis = timeoutMillis(); |
3983 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3984 |
+ |
long startTime = System.nanoTime(); |
3985 |
+ |
assertSame(f, f.completeOnTimeout(v, timeoutMillis, MILLISECONDS)); |
3986 |
+ |
assertSame(v, f.join()); |
3987 |
+ |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
3988 |
+ |
f.complete(99); // should have no effect |
3989 |
+ |
checkCompletedNormally(f, v); |
3990 |
+ |
} |
3991 |
+ |
|
3992 |
+ |
/** |
3993 |
+ |
* completeOnTimeout has no effect if completed within timeout |
3994 |
+ |
*/ |
3995 |
+ |
public void testCompleteOnTimeout_completed() { |
3996 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
3997 |
+ |
{ |
3998 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
3999 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
4000 |
+ |
long startTime = System.nanoTime(); |
4001 |
+ |
f.complete(v1); |
4002 |
+ |
assertSame(f, f.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS)); |
4003 |
+ |
assertSame(g, g.completeOnTimeout(-1, LONG_DELAY_MS, MILLISECONDS)); |
4004 |
+ |
g.complete(v1); |
4005 |
|
checkCompletedNormally(f, v1); |
4006 |
< |
assertEquals(1, a.get()); |
4006 |
> |
checkCompletedNormally(g, v1); |
4007 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS / 2); |
4008 |
|
}} |
4009 |
|
|
4010 |
|
/** |
4011 |
< |
* whenComplete action executes on exceptional completion, propagating |
2746 |
< |
* source result. |
4011 |
> |
* delayedExecutor returns an executor that delays submission |
4012 |
|
*/ |
4013 |
< |
public void testWhenComplete_exceptionalCompletion() { |
4013 |
> |
public void testDelayedExecutor() { |
4014 |
> |
testInParallel(() -> testDelayedExecutor(null, null), |
4015 |
> |
() -> testDelayedExecutor(null, 1), |
4016 |
> |
() -> testDelayedExecutor(new ThreadExecutor(), 1), |
4017 |
> |
() -> testDelayedExecutor(new ThreadExecutor(), 1)); |
4018 |
> |
} |
4019 |
> |
|
4020 |
> |
public void testDelayedExecutor(Executor executor, Integer v) throws Exception { |
4021 |
> |
long timeoutMillis = timeoutMillis(); |
4022 |
> |
// Use an "unreasonably long" long timeout to catch lingering threads |
4023 |
> |
long longTimeoutMillis = 1000 * 60 * 60 * 24; |
4024 |
> |
final Executor delayer, longDelayer; |
4025 |
> |
if (executor == null) { |
4026 |
> |
delayer = CompletableFuture.delayedExecutor(timeoutMillis, MILLISECONDS); |
4027 |
> |
longDelayer = CompletableFuture.delayedExecutor(longTimeoutMillis, MILLISECONDS); |
4028 |
> |
} else { |
4029 |
> |
delayer = CompletableFuture.delayedExecutor(timeoutMillis, MILLISECONDS, executor); |
4030 |
> |
longDelayer = CompletableFuture.delayedExecutor(longTimeoutMillis, MILLISECONDS, executor); |
4031 |
> |
} |
4032 |
> |
long startTime = System.nanoTime(); |
4033 |
> |
CompletableFuture<Integer> f = |
4034 |
> |
CompletableFuture.supplyAsync(() -> v, delayer); |
4035 |
> |
CompletableFuture<Integer> g = |
4036 |
> |
CompletableFuture.supplyAsync(() -> v, longDelayer); |
4037 |
> |
|
4038 |
> |
assertNull(g.getNow(null)); |
4039 |
> |
|
4040 |
> |
assertSame(v, f.get(LONG_DELAY_MS, MILLISECONDS)); |
4041 |
> |
long millisElapsed = millisElapsedSince(startTime); |
4042 |
> |
assertTrue(millisElapsed >= timeoutMillis); |
4043 |
> |
assertTrue(millisElapsed < LONG_DELAY_MS / 2); |
4044 |
> |
|
4045 |
> |
checkCompletedNormally(f, v); |
4046 |
> |
|
4047 |
> |
checkIncomplete(g); |
4048 |
> |
assertTrue(g.cancel(true)); |
4049 |
> |
} |
4050 |
> |
|
4051 |
> |
//--- tests of implementation details; not part of official tck --- |
4052 |
> |
|
4053 |
> |
Object resultOf(CompletableFuture<?> f) { |
4054 |
> |
SecurityManager sm = System.getSecurityManager(); |
4055 |
> |
if (sm != null) { |
4056 |
> |
try { |
4057 |
> |
System.setSecurityManager(null); |
4058 |
> |
} catch (SecurityException giveUp) { |
4059 |
> |
return "Reflection not available"; |
4060 |
> |
} |
4061 |
> |
} |
4062 |
> |
|
4063 |
> |
try { |
4064 |
> |
java.lang.reflect.Field resultField |
4065 |
> |
= CompletableFuture.class.getDeclaredField("result"); |
4066 |
> |
resultField.setAccessible(true); |
4067 |
> |
return resultField.get(f); |
4068 |
> |
} catch (Throwable t) { |
4069 |
> |
throw new AssertionError(t); |
4070 |
> |
} finally { |
4071 |
> |
if (sm != null) System.setSecurityManager(sm); |
4072 |
> |
} |
4073 |
> |
} |
4074 |
> |
|
4075 |
> |
public void testExceptionPropagationReusesResultObject() { |
4076 |
> |
if (!testImplementationDetails) return; |
4077 |
|
for (ExecutionMode m : ExecutionMode.values()) |
4078 |
+ |
{ |
4079 |
+ |
final CFException ex = new CFException(); |
4080 |
+ |
final CompletableFuture<Integer> v42 = CompletableFuture.completedFuture(42); |
4081 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4082 |
+ |
|
4083 |
+ |
final Runnable noopRunnable = new Noop(m); |
4084 |
+ |
final Consumer<Integer> noopConsumer = new NoopConsumer(m); |
4085 |
+ |
final Function<Integer, Integer> incFunction = new IncFunction(m); |
4086 |
+ |
|
4087 |
+ |
List<Function<CompletableFuture<Integer>, CompletableFuture<?>>> funs |
4088 |
+ |
= new ArrayList<>(); |
4089 |
+ |
|
4090 |
+ |
funs.add(y -> m.thenRun(y, noopRunnable)); |
4091 |
+ |
funs.add(y -> m.thenAccept(y, noopConsumer)); |
4092 |
+ |
funs.add(y -> m.thenApply(y, incFunction)); |
4093 |
+ |
|
4094 |
+ |
funs.add(y -> m.runAfterEither(y, incomplete, noopRunnable)); |
4095 |
+ |
funs.add(y -> m.acceptEither(y, incomplete, noopConsumer)); |
4096 |
+ |
funs.add(y -> m.applyToEither(y, incomplete, incFunction)); |
4097 |
+ |
|
4098 |
+ |
funs.add(y -> m.runAfterBoth(y, v42, noopRunnable)); |
4099 |
+ |
funs.add(y -> m.runAfterBoth(v42, y, noopRunnable)); |
4100 |
+ |
funs.add(y -> m.thenAcceptBoth(y, v42, new SubtractAction(m))); |
4101 |
+ |
funs.add(y -> m.thenAcceptBoth(v42, y, new SubtractAction(m))); |
4102 |
+ |
funs.add(y -> m.thenCombine(y, v42, new SubtractFunction(m))); |
4103 |
+ |
funs.add(y -> m.thenCombine(v42, y, new SubtractFunction(m))); |
4104 |
+ |
|
4105 |
+ |
funs.add(y -> m.whenComplete(y, (Integer r, Throwable t) -> {})); |
4106 |
+ |
|
4107 |
+ |
funs.add(y -> m.thenCompose(y, new CompletableFutureInc(m))); |
4108 |
+ |
|
4109 |
+ |
funs.add(y -> CompletableFuture.allOf(y)); |
4110 |
+ |
funs.add(y -> CompletableFuture.allOf(y, v42)); |
4111 |
+ |
funs.add(y -> CompletableFuture.allOf(v42, y)); |
4112 |
+ |
funs.add(y -> CompletableFuture.anyOf(y)); |
4113 |
+ |
funs.add(y -> CompletableFuture.anyOf(y, incomplete)); |
4114 |
+ |
funs.add(y -> CompletableFuture.anyOf(incomplete, y)); |
4115 |
+ |
|
4116 |
+ |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4117 |
+ |
fun : funs) { |
4118 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4119 |
+ |
f.completeExceptionally(ex); |
4120 |
+ |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4121 |
+ |
checkCompletedWithWrappedException(src, ex); |
4122 |
+ |
CompletableFuture<?> dep = fun.apply(src); |
4123 |
+ |
checkCompletedWithWrappedException(dep, ex); |
4124 |
+ |
assertSame(resultOf(src), resultOf(dep)); |
4125 |
+ |
} |
4126 |
+ |
|
4127 |
+ |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4128 |
+ |
fun : funs) { |
4129 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4130 |
+ |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4131 |
+ |
CompletableFuture<?> dep = fun.apply(src); |
4132 |
+ |
f.completeExceptionally(ex); |
4133 |
+ |
checkCompletedWithWrappedException(src, ex); |
4134 |
+ |
checkCompletedWithWrappedException(dep, ex); |
4135 |
+ |
assertSame(resultOf(src), resultOf(dep)); |
4136 |
+ |
} |
4137 |
+ |
|
4138 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
4139 |
+ |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4140 |
+ |
fun : funs) { |
4141 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4142 |
+ |
f.cancel(mayInterruptIfRunning); |
4143 |
+ |
checkCancelled(f); |
4144 |
+ |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4145 |
+ |
checkCompletedWithWrappedCancellationException(src); |
4146 |
+ |
CompletableFuture<?> dep = fun.apply(src); |
4147 |
+ |
checkCompletedWithWrappedCancellationException(dep); |
4148 |
+ |
assertSame(resultOf(src), resultOf(dep)); |
4149 |
+ |
} |
4150 |
+ |
|
4151 |
+ |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
4152 |
+ |
for (Function<CompletableFuture<Integer>, CompletableFuture<?>> |
4153 |
+ |
fun : funs) { |
4154 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4155 |
+ |
CompletableFuture<Integer> src = m.thenApply(f, incFunction); |
4156 |
+ |
CompletableFuture<?> dep = fun.apply(src); |
4157 |
+ |
f.cancel(mayInterruptIfRunning); |
4158 |
+ |
checkCancelled(f); |
4159 |
+ |
checkCompletedWithWrappedCancellationException(src); |
4160 |
+ |
checkCompletedWithWrappedCancellationException(dep); |
4161 |
+ |
assertSame(resultOf(src), resultOf(dep)); |
4162 |
+ |
} |
4163 |
+ |
}} |
4164 |
+ |
|
4165 |
+ |
/** |
4166 |
+ |
* Minimal completion stages throw UOE for most non-CompletionStage methods |
4167 |
+ |
*/ |
4168 |
+ |
public void testMinimalCompletionStage_minimality() { |
4169 |
+ |
if (!testImplementationDetails) return; |
4170 |
+ |
Function<Method, String> toSignature = |
4171 |
+ |
method -> method.getName() + Arrays.toString(method.getParameterTypes()); |
4172 |
+ |
Predicate<Method> isNotStatic = |
4173 |
+ |
method -> (method.getModifiers() & Modifier.STATIC) == 0; |
4174 |
+ |
List<Method> minimalMethods = |
4175 |
+ |
Stream.of(Object.class, CompletionStage.class) |
4176 |
+ |
.flatMap(klazz -> Stream.of(klazz.getMethods())) |
4177 |
+ |
.filter(isNotStatic) |
4178 |
+ |
.collect(Collectors.toList()); |
4179 |
+ |
// Methods from CompletableFuture permitted NOT to throw UOE |
4180 |
+ |
String[] signatureWhitelist = { |
4181 |
+ |
"newIncompleteFuture[]", |
4182 |
+ |
"defaultExecutor[]", |
4183 |
+ |
"minimalCompletionStage[]", |
4184 |
+ |
"copy[]", |
4185 |
+ |
}; |
4186 |
+ |
Set<String> permittedMethodSignatures = |
4187 |
+ |
Stream.concat(minimalMethods.stream().map(toSignature), |
4188 |
+ |
Stream.of(signatureWhitelist)) |
4189 |
+ |
.collect(Collectors.toSet()); |
4190 |
+ |
List<Method> allMethods = Stream.of(CompletableFuture.class.getMethods()) |
4191 |
+ |
.filter(isNotStatic) |
4192 |
+ |
.filter(method -> !permittedMethodSignatures.contains(toSignature.apply(method))) |
4193 |
+ |
.collect(Collectors.toList()); |
4194 |
+ |
|
4195 |
+ |
List<CompletionStage<Integer>> stages = new ArrayList<>(); |
4196 |
+ |
CompletionStage<Integer> min = |
4197 |
+ |
new CompletableFuture<Integer>().minimalCompletionStage(); |
4198 |
+ |
stages.add(min); |
4199 |
+ |
stages.add(min.thenApply(x -> x)); |
4200 |
+ |
stages.add(CompletableFuture.completedStage(1)); |
4201 |
+ |
stages.add(CompletableFuture.failedStage(new CFException())); |
4202 |
+ |
|
4203 |
+ |
List<Method> bugs = new ArrayList<>(); |
4204 |
+ |
for (Method method : allMethods) { |
4205 |
+ |
Class<?>[] parameterTypes = method.getParameterTypes(); |
4206 |
+ |
Object[] args = new Object[parameterTypes.length]; |
4207 |
+ |
// Manufacture boxed primitives for primitive params |
4208 |
+ |
for (int i = 0; i < args.length; i++) { |
4209 |
+ |
Class<?> type = parameterTypes[i]; |
4210 |
+ |
if (parameterTypes[i] == boolean.class) |
4211 |
+ |
args[i] = false; |
4212 |
+ |
else if (parameterTypes[i] == int.class) |
4213 |
+ |
args[i] = 0; |
4214 |
+ |
else if (parameterTypes[i] == long.class) |
4215 |
+ |
args[i] = 0L; |
4216 |
+ |
} |
4217 |
+ |
for (CompletionStage<Integer> stage : stages) { |
4218 |
+ |
try { |
4219 |
+ |
method.invoke(stage, args); |
4220 |
+ |
bugs.add(method); |
4221 |
+ |
} |
4222 |
+ |
catch (java.lang.reflect.InvocationTargetException expected) { |
4223 |
+ |
if (! (expected.getCause() instanceof UnsupportedOperationException)) { |
4224 |
+ |
bugs.add(method); |
4225 |
+ |
// expected.getCause().printStackTrace(); |
4226 |
+ |
} |
4227 |
+ |
} |
4228 |
+ |
catch (ReflectiveOperationException bad) { throw new Error(bad); } |
4229 |
+ |
} |
4230 |
+ |
} |
4231 |
+ |
if (!bugs.isEmpty()) |
4232 |
+ |
throw new Error("Methods did not throw UOE: " + bugs); |
4233 |
+ |
} |
4234 |
+ |
|
4235 |
+ |
/** |
4236 |
+ |
* minimalStage.toCompletableFuture() returns a CompletableFuture that |
4237 |
+ |
* is completed normally, with the same value, when source is. |
4238 |
+ |
*/ |
4239 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_normalCompletion() { |
4240 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4241 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4242 |
+ |
{ |
4243 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4244 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4245 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4246 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4247 |
+ |
if (createIncomplete) { |
4248 |
+ |
checkIncomplete(f); |
4249 |
+ |
checkIncomplete(g); |
4250 |
+ |
assertTrue(f.complete(v1)); |
4251 |
+ |
} |
4252 |
+ |
checkCompletedNormally(f, v1); |
4253 |
+ |
checkCompletedNormally(g, v1); |
4254 |
+ |
}} |
4255 |
+ |
|
4256 |
+ |
/** |
4257 |
+ |
* minimalStage.toCompletableFuture() returns a CompletableFuture that |
4258 |
+ |
* is completed exceptionally when source is. |
4259 |
+ |
*/ |
4260 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_exceptionalCompletion() { |
4261 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4262 |
+ |
{ |
4263 |
+ |
CFException ex = new CFException(); |
4264 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4265 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4266 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
4267 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4268 |
+ |
if (createIncomplete) { |
4269 |
+ |
checkIncomplete(f); |
4270 |
+ |
checkIncomplete(g); |
4271 |
+ |
f.completeExceptionally(ex); |
4272 |
+ |
} |
4273 |
+ |
checkCompletedExceptionally(f, ex); |
4274 |
+ |
checkCompletedWithWrappedException(g, ex); |
4275 |
+ |
}} |
4276 |
+ |
|
4277 |
+ |
/** |
4278 |
+ |
* minimalStage.toCompletableFuture() gives mutable CompletableFuture |
4279 |
+ |
*/ |
4280 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_mutable() { |
4281 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4282 |
+ |
{ |
4283 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4284 |
+ |
CompletionStage minimal = f.minimalCompletionStage(); |
4285 |
+ |
CompletableFuture<Integer> g = minimal.toCompletableFuture(); |
4286 |
+ |
assertTrue(g.complete(v1)); |
4287 |
+ |
checkCompletedNormally(g, v1); |
4288 |
+ |
checkIncomplete(f); |
4289 |
+ |
checkIncomplete(minimal.toCompletableFuture()); |
4290 |
+ |
}} |
4291 |
+ |
|
4292 |
+ |
/** |
4293 |
+ |
* minimalStage.toCompletableFuture().join() awaits completion |
4294 |
+ |
*/ |
4295 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_join() throws Exception { |
4296 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4297 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4298 |
+ |
{ |
4299 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4300 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4301 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4302 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4303 |
+ |
assertEquals(v1, minimal.toCompletableFuture().join()); |
4304 |
+ |
assertEquals(v1, minimal.toCompletableFuture().get()); |
4305 |
+ |
checkCompletedNormally(minimal.toCompletableFuture(), v1); |
4306 |
+ |
}} |
4307 |
+ |
|
4308 |
+ |
/** |
4309 |
+ |
* Completion of a toCompletableFuture copy of a minimal stage |
4310 |
+ |
* does not complete its source. |
4311 |
+ |
*/ |
4312 |
+ |
public void testMinimalCompletionStage_toCompletableFuture_oneWayPropagation() { |
4313 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4314 |
+ |
CompletionStage<Integer> g = f.minimalCompletionStage(); |
4315 |
+ |
assertTrue(g.toCompletableFuture().complete(1)); |
4316 |
+ |
assertTrue(g.toCompletableFuture().complete(null)); |
4317 |
+ |
assertTrue(g.toCompletableFuture().cancel(true)); |
4318 |
+ |
assertTrue(g.toCompletableFuture().cancel(false)); |
4319 |
+ |
assertTrue(g.toCompletableFuture().completeExceptionally(new CFException())); |
4320 |
+ |
checkIncomplete(g.toCompletableFuture()); |
4321 |
+ |
f.complete(1); |
4322 |
+ |
checkCompletedNormally(g.toCompletableFuture(), 1); |
4323 |
+ |
} |
4324 |
+ |
|
4325 |
+ |
/** Demo utility method for external reliable toCompletableFuture */ |
4326 |
+ |
static <T> CompletableFuture<T> toCompletableFuture(CompletionStage<T> stage) { |
4327 |
+ |
CompletableFuture<T> f = new CompletableFuture<>(); |
4328 |
+ |
stage.handle((T t, Throwable ex) -> { |
4329 |
+ |
if (ex != null) f.completeExceptionally(ex); |
4330 |
+ |
else f.complete(t); |
4331 |
+ |
return null; |
4332 |
+ |
}); |
4333 |
+ |
return f; |
4334 |
+ |
} |
4335 |
+ |
|
4336 |
+ |
/** Demo utility method to join a CompletionStage */ |
4337 |
+ |
static <T> T join(CompletionStage<T> stage) { |
4338 |
+ |
return toCompletableFuture(stage).join(); |
4339 |
+ |
} |
4340 |
+ |
|
4341 |
+ |
/** |
4342 |
+ |
* Joining a minimal stage "by hand" works |
4343 |
+ |
*/ |
4344 |
+ |
public void testMinimalCompletionStage_join_by_hand() { |
4345 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4346 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4347 |
+ |
{ |
4348 |
+ |
CompletableFuture<Integer> f = new CompletableFuture<>(); |
4349 |
+ |
CompletionStage<Integer> minimal = f.minimalCompletionStage(); |
4350 |
+ |
CompletableFuture<Integer> g = new CompletableFuture<>(); |
4351 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4352 |
+ |
minimal.thenAccept(x -> g.complete(x)); |
4353 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4354 |
+ |
g.join(); |
4355 |
+ |
checkCompletedNormally(g, v1); |
4356 |
+ |
checkCompletedNormally(f, v1); |
4357 |
+ |
assertEquals(v1, join(minimal)); |
4358 |
+ |
}} |
4359 |
+ |
|
4360 |
+ |
static class Monad { |
4361 |
+ |
static class ZeroException extends RuntimeException { |
4362 |
+ |
public ZeroException() { super("monadic zero"); } |
4363 |
+ |
} |
4364 |
+ |
// "return", "unit" |
4365 |
+ |
static <T> CompletableFuture<T> unit(T value) { |
4366 |
+ |
return completedFuture(value); |
4367 |
+ |
} |
4368 |
+ |
// monadic zero ? |
4369 |
+ |
static <T> CompletableFuture<T> zero() { |
4370 |
+ |
return failedFuture(new ZeroException()); |
4371 |
+ |
} |
4372 |
+ |
// >=> |
4373 |
+ |
static <T,U,V> Function<T, CompletableFuture<V>> compose |
4374 |
+ |
(Function<T, CompletableFuture<U>> f, |
4375 |
+ |
Function<U, CompletableFuture<V>> g) { |
4376 |
+ |
return x -> f.apply(x).thenCompose(g); |
4377 |
+ |
} |
4378 |
+ |
|
4379 |
+ |
static void assertZero(CompletableFuture<?> f) { |
4380 |
+ |
try { |
4381 |
+ |
f.getNow(null); |
4382 |
+ |
throw new AssertionError("should throw"); |
4383 |
+ |
} catch (CompletionException success) { |
4384 |
+ |
assertTrue(success.getCause() instanceof ZeroException); |
4385 |
+ |
} |
4386 |
+ |
} |
4387 |
+ |
|
4388 |
+ |
static <T> void assertFutureEquals(CompletableFuture<T> f, |
4389 |
+ |
CompletableFuture<T> g) { |
4390 |
+ |
T fval = null, gval = null; |
4391 |
+ |
Throwable fex = null, gex = null; |
4392 |
+ |
|
4393 |
+ |
try { fval = f.get(); } |
4394 |
+ |
catch (ExecutionException ex) { fex = ex.getCause(); } |
4395 |
+ |
catch (Throwable ex) { fex = ex; } |
4396 |
+ |
|
4397 |
+ |
try { gval = g.get(); } |
4398 |
+ |
catch (ExecutionException ex) { gex = ex.getCause(); } |
4399 |
+ |
catch (Throwable ex) { gex = ex; } |
4400 |
+ |
|
4401 |
+ |
if (fex != null || gex != null) |
4402 |
+ |
assertSame(fex.getClass(), gex.getClass()); |
4403 |
+ |
else |
4404 |
+ |
assertEquals(fval, gval); |
4405 |
+ |
} |
4406 |
+ |
|
4407 |
+ |
static class PlusFuture<T> extends CompletableFuture<T> { |
4408 |
+ |
AtomicReference<Throwable> firstFailure = new AtomicReference<>(null); |
4409 |
+ |
} |
4410 |
+ |
|
4411 |
+ |
/** Implements "monadic plus". */ |
4412 |
+ |
static <T> CompletableFuture<T> plus(CompletableFuture<? extends T> f, |
4413 |
+ |
CompletableFuture<? extends T> g) { |
4414 |
+ |
PlusFuture<T> plus = new PlusFuture<T>(); |
4415 |
+ |
BiConsumer<T, Throwable> action = (T result, Throwable ex) -> { |
4416 |
+ |
try { |
4417 |
+ |
if (ex == null) { |
4418 |
+ |
if (plus.complete(result)) |
4419 |
+ |
if (plus.firstFailure.get() != null) |
4420 |
+ |
plus.firstFailure.set(null); |
4421 |
+ |
} |
4422 |
+ |
else if (plus.firstFailure.compareAndSet(null, ex)) { |
4423 |
+ |
if (plus.isDone()) |
4424 |
+ |
plus.firstFailure.set(null); |
4425 |
+ |
} |
4426 |
+ |
else { |
4427 |
+ |
// first failure has precedence |
4428 |
+ |
Throwable first = plus.firstFailure.getAndSet(null); |
4429 |
+ |
|
4430 |
+ |
// may fail with "Self-suppression not permitted" |
4431 |
+ |
try { first.addSuppressed(ex); } |
4432 |
+ |
catch (Exception ignored) {} |
4433 |
+ |
|
4434 |
+ |
plus.completeExceptionally(first); |
4435 |
+ |
} |
4436 |
+ |
} catch (Throwable unexpected) { |
4437 |
+ |
plus.completeExceptionally(unexpected); |
4438 |
+ |
} |
4439 |
+ |
}; |
4440 |
+ |
f.whenComplete(action); |
4441 |
+ |
g.whenComplete(action); |
4442 |
+ |
return plus; |
4443 |
+ |
} |
4444 |
+ |
} |
4445 |
+ |
|
4446 |
+ |
/** |
4447 |
+ |
* CompletableFuture is an additive monad - sort of. |
4448 |
+ |
* https://en.wikipedia.org/wiki/Monad_(functional_programming)#Additive_monads |
4449 |
+ |
*/ |
4450 |
+ |
public void testAdditiveMonad() throws Throwable { |
4451 |
+ |
Function<Long, CompletableFuture<Long>> unit = Monad::unit; |
4452 |
+ |
CompletableFuture<Long> zero = Monad.zero(); |
4453 |
+ |
|
4454 |
+ |
// Some mutually non-commutative functions |
4455 |
+ |
Function<Long, CompletableFuture<Long>> triple |
4456 |
+ |
= x -> Monad.unit(3 * x); |
4457 |
+ |
Function<Long, CompletableFuture<Long>> inc |
4458 |
+ |
= x -> Monad.unit(x + 1); |
4459 |
+ |
|
4460 |
+ |
// unit is a right identity: m >>= unit === m |
4461 |
+ |
Monad.assertFutureEquals(inc.apply(5L).thenCompose(unit), |
4462 |
+ |
inc.apply(5L)); |
4463 |
+ |
// unit is a left identity: (unit x) >>= f === f x |
4464 |
+ |
Monad.assertFutureEquals(unit.apply(5L).thenCompose(inc), |
4465 |
+ |
inc.apply(5L)); |
4466 |
+ |
|
4467 |
+ |
// associativity: (m >>= f) >>= g === m >>= ( \x -> (f x >>= g) ) |
4468 |
+ |
Monad.assertFutureEquals( |
4469 |
+ |
unit.apply(5L).thenCompose(inc).thenCompose(triple), |
4470 |
+ |
unit.apply(5L).thenCompose(x -> inc.apply(x).thenCompose(triple))); |
4471 |
+ |
|
4472 |
+ |
// The case for CompletableFuture as an additive monad is weaker... |
4473 |
+ |
|
4474 |
+ |
// zero is a monadic zero |
4475 |
+ |
Monad.assertZero(zero); |
4476 |
+ |
|
4477 |
+ |
// left zero: zero >>= f === zero |
4478 |
+ |
Monad.assertZero(zero.thenCompose(inc)); |
4479 |
+ |
// right zero: f >>= (\x -> zero) === zero |
4480 |
+ |
Monad.assertZero(inc.apply(5L).thenCompose(x -> zero)); |
4481 |
+ |
|
4482 |
+ |
// f plus zero === f |
4483 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
4484 |
+ |
Monad.plus(Monad.unit(5L), zero)); |
4485 |
+ |
// zero plus f === f |
4486 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
4487 |
+ |
Monad.plus(zero, Monad.unit(5L))); |
4488 |
+ |
// zero plus zero === zero |
4489 |
+ |
Monad.assertZero(Monad.plus(zero, zero)); |
4490 |
+ |
{ |
4491 |
+ |
CompletableFuture<Long> f = Monad.plus(Monad.unit(5L), |
4492 |
+ |
Monad.unit(8L)); |
4493 |
+ |
// non-determinism |
4494 |
+ |
assertTrue(f.get() == 5L || f.get() == 8L); |
4495 |
+ |
} |
4496 |
+ |
|
4497 |
+ |
CompletableFuture<Long> godot = new CompletableFuture<>(); |
4498 |
+ |
// f plus godot === f (doesn't wait for godot) |
4499 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
4500 |
+ |
Monad.plus(Monad.unit(5L), godot)); |
4501 |
+ |
// godot plus f === f (doesn't wait for godot) |
4502 |
+ |
Monad.assertFutureEquals(Monad.unit(5L), |
4503 |
+ |
Monad.plus(godot, Monad.unit(5L))); |
4504 |
+ |
} |
4505 |
+ |
|
4506 |
+ |
/** Test long recursive chains of CompletableFutures with cascading completions */ |
4507 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4508 |
+ |
public void testRecursiveChains() throws Throwable { |
4509 |
+ |
for (ExecutionMode m : ExecutionMode.values()) |
4510 |
+ |
for (boolean addDeadEnds : new boolean[] { true, false }) |
4511 |
+ |
{ |
4512 |
+ |
final int val = 42; |
4513 |
+ |
final int n = expensiveTests ? 1_000 : 2; |
4514 |
+ |
CompletableFuture<Integer> head = new CompletableFuture<>(); |
4515 |
+ |
CompletableFuture<Integer> tail = head; |
4516 |
+ |
for (int i = 0; i < n; i++) { |
4517 |
+ |
if (addDeadEnds) m.thenApply(tail, v -> v + 1); |
4518 |
+ |
tail = m.thenApply(tail, v -> v + 1); |
4519 |
+ |
if (addDeadEnds) m.applyToEither(tail, tail, v -> v + 1); |
4520 |
+ |
tail = m.applyToEither(tail, tail, v -> v + 1); |
4521 |
+ |
if (addDeadEnds) m.thenCombine(tail, tail, (v, w) -> v + 1); |
4522 |
+ |
tail = m.thenCombine(tail, tail, (v, w) -> v + 1); |
4523 |
+ |
} |
4524 |
+ |
head.complete(val); |
4525 |
+ |
assertEquals(val + 3 * n, (int) tail.join()); |
4526 |
+ |
}} |
4527 |
+ |
|
4528 |
+ |
/** |
4529 |
+ |
* A single CompletableFuture with many dependents. |
4530 |
+ |
* A demo of scalability - runtime is O(n). |
4531 |
+ |
*/ |
4532 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4533 |
+ |
public void testManyDependents() throws Throwable { |
4534 |
+ |
final int n = expensiveTests ? 1_000_000 : 10; |
4535 |
+ |
final CompletableFuture<Void> head = new CompletableFuture<>(); |
4536 |
+ |
final CompletableFuture<Void> complete = CompletableFuture.completedFuture((Void)null); |
4537 |
+ |
final AtomicInteger count = new AtomicInteger(0); |
4538 |
+ |
for (int i = 0; i < n; i++) { |
4539 |
+ |
head.thenRun(() -> count.getAndIncrement()); |
4540 |
+ |
head.thenAccept(x -> count.getAndIncrement()); |
4541 |
+ |
head.thenApply(x -> count.getAndIncrement()); |
4542 |
+ |
|
4543 |
+ |
head.runAfterBoth(complete, () -> count.getAndIncrement()); |
4544 |
+ |
head.thenAcceptBoth(complete, (x, y) -> count.getAndIncrement()); |
4545 |
+ |
head.thenCombine(complete, (x, y) -> count.getAndIncrement()); |
4546 |
+ |
complete.runAfterBoth(head, () -> count.getAndIncrement()); |
4547 |
+ |
complete.thenAcceptBoth(head, (x, y) -> count.getAndIncrement()); |
4548 |
+ |
complete.thenCombine(head, (x, y) -> count.getAndIncrement()); |
4549 |
+ |
|
4550 |
+ |
head.runAfterEither(new CompletableFuture<Void>(), () -> count.getAndIncrement()); |
4551 |
+ |
head.acceptEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4552 |
+ |
head.applyToEither(new CompletableFuture<Void>(), x -> count.getAndIncrement()); |
4553 |
+ |
new CompletableFuture<Void>().runAfterEither(head, () -> count.getAndIncrement()); |
4554 |
+ |
new CompletableFuture<Void>().acceptEither(head, x -> count.getAndIncrement()); |
4555 |
+ |
new CompletableFuture<Void>().applyToEither(head, x -> count.getAndIncrement()); |
4556 |
+ |
} |
4557 |
+ |
head.complete(null); |
4558 |
+ |
assertEquals(5 * 3 * n, count.get()); |
4559 |
+ |
} |
4560 |
+ |
|
4561 |
+ |
/** ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck */ |
4562 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
4563 |
+ |
public void testCoCompletionGarbageRetention() throws Throwable { |
4564 |
+ |
final int n = expensiveTests ? 1_000_000 : 10; |
4565 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4566 |
+ |
CompletableFuture<Integer> f; |
4567 |
+ |
for (int i = 0; i < n; i++) { |
4568 |
+ |
f = new CompletableFuture<>(); |
4569 |
+ |
f.runAfterEither(incomplete, () -> {}); |
4570 |
+ |
f.complete(null); |
4571 |
+ |
|
4572 |
+ |
f = new CompletableFuture<>(); |
4573 |
+ |
f.acceptEither(incomplete, x -> {}); |
4574 |
+ |
f.complete(null); |
4575 |
+ |
|
4576 |
+ |
f = new CompletableFuture<>(); |
4577 |
+ |
f.applyToEither(incomplete, x -> x); |
4578 |
+ |
f.complete(null); |
4579 |
+ |
|
4580 |
+ |
f = new CompletableFuture<>(); |
4581 |
+ |
CompletableFuture.anyOf(f, incomplete); |
4582 |
+ |
f.complete(null); |
4583 |
+ |
} |
4584 |
+ |
|
4585 |
+ |
for (int i = 0; i < n; i++) { |
4586 |
+ |
f = new CompletableFuture<>(); |
4587 |
+ |
incomplete.runAfterEither(f, () -> {}); |
4588 |
+ |
f.complete(null); |
4589 |
+ |
|
4590 |
+ |
f = new CompletableFuture<>(); |
4591 |
+ |
incomplete.acceptEither(f, x -> {}); |
4592 |
+ |
f.complete(null); |
4593 |
+ |
|
4594 |
+ |
f = new CompletableFuture<>(); |
4595 |
+ |
incomplete.applyToEither(f, x -> x); |
4596 |
+ |
f.complete(null); |
4597 |
+ |
|
4598 |
+ |
f = new CompletableFuture<>(); |
4599 |
+ |
CompletableFuture.anyOf(incomplete, f); |
4600 |
+ |
f.complete(null); |
4601 |
+ |
} |
4602 |
+ |
} |
4603 |
+ |
|
4604 |
+ |
/** |
4605 |
+ |
* Reproduction recipe for: |
4606 |
+ |
* 8160402: Garbage retention with CompletableFuture.anyOf |
4607 |
+ |
* cvs update -D '2016-05-01' ./src/main/java/util/concurrent/CompletableFuture.java && ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testAnyOfGarbageRetention tck; cvs update -A |
4608 |
+ |
*/ |
4609 |
+ |
public void testAnyOfGarbageRetention() throws Throwable { |
4610 |
+ |
for (Integer v : new Integer[] { 1, null }) |
4611 |
+ |
{ |
4612 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4613 |
+ |
CompletableFuture<Integer>[] fs |
4614 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4615 |
+ |
for (int i = 0; i < fs.length; i++) |
4616 |
+ |
fs[i] = new CompletableFuture<>(); |
4617 |
+ |
fs[fs.length - 1].complete(v); |
4618 |
+ |
for (int i = 0; i < n; i++) |
4619 |
+ |
checkCompletedNormally(CompletableFuture.anyOf(fs), v); |
4620 |
+ |
}} |
4621 |
+ |
|
4622 |
+ |
/** |
4623 |
+ |
* Checks for garbage retention with allOf. |
4624 |
+ |
* |
4625 |
+ |
* As of 2016-07, fails with OOME: |
4626 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testCancelledAllOfGarbageRetention tck |
4627 |
+ |
*/ |
4628 |
+ |
public void testCancelledAllOfGarbageRetention() throws Throwable { |
4629 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4630 |
+ |
CompletableFuture<Integer>[] fs |
4631 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4632 |
+ |
for (int i = 0; i < fs.length; i++) |
4633 |
+ |
fs[i] = new CompletableFuture<>(); |
4634 |
+ |
for (int i = 0; i < n; i++) |
4635 |
+ |
assertTrue(CompletableFuture.allOf(fs).cancel(false)); |
4636 |
+ |
} |
4637 |
+ |
|
4638 |
+ |
/** |
4639 |
+ |
* Checks for garbage retention when a dependent future is |
4640 |
+ |
* cancelled and garbage-collected. |
4641 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4642 |
+ |
* |
4643 |
+ |
* As of 2016-07, fails with OOME: |
4644 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testCancelledGarbageRetention tck |
4645 |
+ |
*/ |
4646 |
+ |
public void testCancelledGarbageRetention() throws Throwable { |
4647 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4648 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4649 |
+ |
for (int i = 0; i < n; i++) |
4650 |
+ |
assertTrue(neverCompleted.thenRun(() -> {}).cancel(true)); |
4651 |
+ |
} |
4652 |
+ |
|
4653 |
+ |
/** |
4654 |
+ |
* Checks for garbage retention when MinimalStage.toCompletableFuture() |
4655 |
+ |
* is invoked many times. |
4656 |
+ |
* 8161600: Garbage retention when source CompletableFutures are never completed |
4657 |
+ |
* |
4658 |
+ |
* As of 2016-07, fails with OOME: |
4659 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest -Djsr166.methodFilter=testToCompletableFutureGarbageRetention tck |
4660 |
+ |
*/ |
4661 |
+ |
public void testToCompletableFutureGarbageRetention() throws Throwable { |
4662 |
+ |
final int n = expensiveTests ? 900_000 : 10; |
4663 |
+ |
CompletableFuture<Integer> neverCompleted = new CompletableFuture<>(); |
4664 |
+ |
CompletionStage minimal = neverCompleted.minimalCompletionStage(); |
4665 |
+ |
for (int i = 0; i < n; i++) |
4666 |
+ |
assertTrue(minimal.toCompletableFuture().cancel(true)); |
4667 |
+ |
} |
4668 |
+ |
|
4669 |
+ |
// static <U> U join(CompletionStage<U> stage) { |
4670 |
+ |
// CompletableFuture<U> f = new CompletableFuture<>(); |
4671 |
+ |
// stage.whenComplete((v, ex) -> { |
4672 |
+ |
// if (ex != null) f.completeExceptionally(ex); else f.complete(v); |
4673 |
+ |
// }); |
4674 |
+ |
// return f.join(); |
4675 |
+ |
// } |
4676 |
+ |
|
4677 |
+ |
// static <U> boolean isDone(CompletionStage<U> stage) { |
4678 |
+ |
// CompletableFuture<U> f = new CompletableFuture<>(); |
4679 |
+ |
// stage.whenComplete((v, ex) -> { |
4680 |
+ |
// if (ex != null) f.completeExceptionally(ex); else f.complete(v); |
4681 |
+ |
// }); |
4682 |
+ |
// return f.isDone(); |
4683 |
+ |
// } |
4684 |
+ |
|
4685 |
+ |
// static <U> U join2(CompletionStage<U> stage) { |
4686 |
+ |
// return stage.toCompletableFuture().copy().join(); |
4687 |
+ |
// } |
4688 |
+ |
|
4689 |
+ |
// static <U> boolean isDone2(CompletionStage<U> stage) { |
4690 |
+ |
// return stage.toCompletableFuture().copy().isDone(); |
4691 |
+ |
// } |
4692 |
+ |
|
4693 |
+ |
// For testing default implementations |
4694 |
+ |
// Only non-default interface methods defined. |
4695 |
+ |
static final class DelegatedCompletionStage<T> implements CompletionStage<T> { |
4696 |
+ |
final CompletableFuture<T> cf; |
4697 |
+ |
DelegatedCompletionStage(CompletableFuture<T> cf) { this.cf = cf; } |
4698 |
+ |
public CompletableFuture<T> toCompletableFuture() { |
4699 |
+ |
return cf; } |
4700 |
+ |
public CompletionStage<Void> thenRun |
4701 |
+ |
(Runnable action) { |
4702 |
+ |
return cf.thenRun(action); } |
4703 |
+ |
public CompletionStage<Void> thenRunAsync |
4704 |
+ |
(Runnable action) { |
4705 |
+ |
return cf.thenRunAsync(action); } |
4706 |
+ |
public CompletionStage<Void> thenRunAsync |
4707 |
+ |
(Runnable action, |
4708 |
+ |
Executor executor) { |
4709 |
+ |
return cf.thenRunAsync(action, executor); } |
4710 |
+ |
public CompletionStage<Void> thenAccept |
4711 |
+ |
(Consumer<? super T> action) { |
4712 |
+ |
return cf.thenAccept(action); } |
4713 |
+ |
public CompletionStage<Void> thenAcceptAsync |
4714 |
+ |
(Consumer<? super T> action) { |
4715 |
+ |
return cf.thenAcceptAsync(action); } |
4716 |
+ |
public CompletionStage<Void> thenAcceptAsync |
4717 |
+ |
(Consumer<? super T> action, |
4718 |
+ |
Executor executor) { |
4719 |
+ |
return cf.thenAcceptAsync(action, executor); } |
4720 |
+ |
public <U> CompletionStage<U> thenApply |
4721 |
+ |
(Function<? super T,? extends U> a) { |
4722 |
+ |
return cf.thenApply(a); } |
4723 |
+ |
public <U> CompletionStage<U> thenApplyAsync |
4724 |
+ |
(Function<? super T,? extends U> fn) { |
4725 |
+ |
return cf.thenApplyAsync(fn); } |
4726 |
+ |
public <U> CompletionStage<U> thenApplyAsync |
4727 |
+ |
(Function<? super T,? extends U> fn, |
4728 |
+ |
Executor executor) { |
4729 |
+ |
return cf.thenApplyAsync(fn, executor); } |
4730 |
+ |
public <U,V> CompletionStage<V> thenCombine |
4731 |
+ |
(CompletionStage<? extends U> other, |
4732 |
+ |
BiFunction<? super T,? super U,? extends V> fn) { |
4733 |
+ |
return cf.thenCombine(other, fn); } |
4734 |
+ |
public <U,V> CompletionStage<V> thenCombineAsync |
4735 |
+ |
(CompletionStage<? extends U> other, |
4736 |
+ |
BiFunction<? super T,? super U,? extends V> fn) { |
4737 |
+ |
return cf.thenCombineAsync(other, fn); } |
4738 |
+ |
public <U,V> CompletionStage<V> thenCombineAsync |
4739 |
+ |
(CompletionStage<? extends U> other, |
4740 |
+ |
BiFunction<? super T,? super U,? extends V> fn, |
4741 |
+ |
Executor executor) { |
4742 |
+ |
return cf.thenCombineAsync(other, fn, executor); } |
4743 |
+ |
public <U> CompletionStage<Void> thenAcceptBoth |
4744 |
+ |
(CompletionStage<? extends U> other, |
4745 |
+ |
BiConsumer<? super T, ? super U> action) { |
4746 |
+ |
return cf.thenAcceptBoth(other, action); } |
4747 |
+ |
public <U> CompletionStage<Void> thenAcceptBothAsync |
4748 |
+ |
(CompletionStage<? extends U> other, |
4749 |
+ |
BiConsumer<? super T, ? super U> action) { |
4750 |
+ |
return cf.thenAcceptBothAsync(other, action); } |
4751 |
+ |
public <U> CompletionStage<Void> thenAcceptBothAsync |
4752 |
+ |
(CompletionStage<? extends U> other, |
4753 |
+ |
BiConsumer<? super T, ? super U> action, |
4754 |
+ |
Executor executor) { |
4755 |
+ |
return cf.thenAcceptBothAsync(other, action, executor); } |
4756 |
+ |
public CompletionStage<Void> runAfterBoth |
4757 |
+ |
(CompletionStage<?> other, |
4758 |
+ |
Runnable action) { |
4759 |
+ |
return cf.runAfterBoth(other, action); } |
4760 |
+ |
public CompletionStage<Void> runAfterBothAsync |
4761 |
+ |
(CompletionStage<?> other, |
4762 |
+ |
Runnable action) { |
4763 |
+ |
return cf.runAfterBothAsync(other, action); } |
4764 |
+ |
public CompletionStage<Void> runAfterBothAsync |
4765 |
+ |
(CompletionStage<?> other, |
4766 |
+ |
Runnable action, |
4767 |
+ |
Executor executor) { |
4768 |
+ |
return cf.runAfterBothAsync(other, action, executor); } |
4769 |
+ |
public <U> CompletionStage<U> applyToEither |
4770 |
+ |
(CompletionStage<? extends T> other, |
4771 |
+ |
Function<? super T, U> fn) { |
4772 |
+ |
return cf.applyToEither(other, fn); } |
4773 |
+ |
public <U> CompletionStage<U> applyToEitherAsync |
4774 |
+ |
(CompletionStage<? extends T> other, |
4775 |
+ |
Function<? super T, U> fn) { |
4776 |
+ |
return cf.applyToEitherAsync(other, fn); } |
4777 |
+ |
public <U> CompletionStage<U> applyToEitherAsync |
4778 |
+ |
(CompletionStage<? extends T> other, |
4779 |
+ |
Function<? super T, U> fn, |
4780 |
+ |
Executor executor) { |
4781 |
+ |
return cf.applyToEitherAsync(other, fn, executor); } |
4782 |
+ |
public CompletionStage<Void> acceptEither |
4783 |
+ |
(CompletionStage<? extends T> other, |
4784 |
+ |
Consumer<? super T> action) { |
4785 |
+ |
return cf.acceptEither(other, action); } |
4786 |
+ |
public CompletionStage<Void> acceptEitherAsync |
4787 |
+ |
(CompletionStage<? extends T> other, |
4788 |
+ |
Consumer<? super T> action) { |
4789 |
+ |
return cf.acceptEitherAsync(other, action); } |
4790 |
+ |
public CompletionStage<Void> acceptEitherAsync |
4791 |
+ |
(CompletionStage<? extends T> other, |
4792 |
+ |
Consumer<? super T> action, |
4793 |
+ |
Executor executor) { |
4794 |
+ |
return cf.acceptEitherAsync(other, action, executor); } |
4795 |
+ |
public CompletionStage<Void> runAfterEither |
4796 |
+ |
(CompletionStage<?> other, |
4797 |
+ |
Runnable action) { |
4798 |
+ |
return cf.runAfterEither(other, action); } |
4799 |
+ |
public CompletionStage<Void> runAfterEitherAsync |
4800 |
+ |
(CompletionStage<?> other, |
4801 |
+ |
Runnable action) { |
4802 |
+ |
return cf.runAfterEitherAsync(other, action); } |
4803 |
+ |
public CompletionStage<Void> runAfterEitherAsync |
4804 |
+ |
(CompletionStage<?> other, |
4805 |
+ |
Runnable action, |
4806 |
+ |
Executor executor) { |
4807 |
+ |
return cf.runAfterEitherAsync(other, action, executor); } |
4808 |
+ |
public <U> CompletionStage<U> thenCompose |
4809 |
+ |
(Function<? super T, ? extends CompletionStage<U>> fn) { |
4810 |
+ |
return cf.thenCompose(fn); } |
4811 |
+ |
public <U> CompletionStage<U> thenComposeAsync |
4812 |
+ |
(Function<? super T, ? extends CompletionStage<U>> fn) { |
4813 |
+ |
return cf.thenComposeAsync(fn); } |
4814 |
+ |
public <U> CompletionStage<U> thenComposeAsync |
4815 |
+ |
(Function<? super T, ? extends CompletionStage<U>> fn, |
4816 |
+ |
Executor executor) { |
4817 |
+ |
return cf.thenComposeAsync(fn, executor); } |
4818 |
+ |
public <U> CompletionStage<U> handle |
4819 |
+ |
(BiFunction<? super T, Throwable, ? extends U> fn) { |
4820 |
+ |
return cf.handle(fn); } |
4821 |
+ |
public <U> CompletionStage<U> handleAsync |
4822 |
+ |
(BiFunction<? super T, Throwable, ? extends U> fn) { |
4823 |
+ |
return cf.handleAsync(fn); } |
4824 |
+ |
public <U> CompletionStage<U> handleAsync |
4825 |
+ |
(BiFunction<? super T, Throwable, ? extends U> fn, |
4826 |
+ |
Executor executor) { |
4827 |
+ |
return cf.handleAsync(fn, executor); } |
4828 |
+ |
public CompletionStage<T> whenComplete |
4829 |
+ |
(BiConsumer<? super T, ? super Throwable> action) { |
4830 |
+ |
return cf.whenComplete(action); } |
4831 |
+ |
public CompletionStage<T> whenCompleteAsync |
4832 |
+ |
(BiConsumer<? super T, ? super Throwable> action) { |
4833 |
+ |
return cf.whenCompleteAsync(action); } |
4834 |
+ |
public CompletionStage<T> whenCompleteAsync |
4835 |
+ |
(BiConsumer<? super T, ? super Throwable> action, |
4836 |
+ |
Executor executor) { |
4837 |
+ |
return cf.whenCompleteAsync(action, executor); } |
4838 |
+ |
public CompletionStage<T> exceptionally |
4839 |
+ |
(Function<Throwable, ? extends T> fn) { |
4840 |
+ |
return cf.exceptionally(fn); } |
4841 |
+ |
} |
4842 |
+ |
|
4843 |
+ |
/** |
4844 |
+ |
* default-implemented exceptionallyAsync action is not invoked when |
4845 |
+ |
* source completes normally, and source result is propagated |
4846 |
+ |
*/ |
4847 |
+ |
public void testDefaultExceptionallyAsync_normalCompletion() { |
4848 |
+ |
for (boolean createIncomplete : new boolean[] { true, false }) |
4849 |
+ |
for (Integer v1 : new Integer[] { 1, null }) |
4850 |
+ |
{ |
4851 |
+ |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4852 |
+ |
final DelegatedCompletionStage<Integer> d = |
4853 |
+ |
new DelegatedCompletionStage<Integer>(f); |
4854 |
+ |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4855 |
+ |
final CompletionStage<Integer> g = d.exceptionallyAsync |
4856 |
+ |
((Throwable t) -> { |
4857 |
+ |
threadFail("should not be called"); |
4858 |
+ |
return null; // unreached |
4859 |
+ |
}); |
4860 |
+ |
if (createIncomplete) assertTrue(f.complete(v1)); |
4861 |
+ |
|
4862 |
+ |
checkCompletedNormally(g.toCompletableFuture(), v1); |
4863 |
+ |
}} |
4864 |
+ |
|
4865 |
+ |
/** |
4866 |
+ |
* default-implemented exceptionallyAsync action completes with |
4867 |
+ |
* function value on source exception |
4868 |
+ |
*/ |
4869 |
+ |
public void testDefaultExceptionallyAsync_exceptionalCompletion() { |
4870 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
4871 |
|
for (Integer v1 : new Integer[] { 1, null }) |
4872 |
|
{ |
4873 |
|
final AtomicInteger a = new AtomicInteger(0); |
4874 |
|
final CFException ex = new CFException(); |
4875 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4876 |
+ |
final DelegatedCompletionStage<Integer> d = |
4877 |
+ |
new DelegatedCompletionStage<Integer>(f); |
4878 |
|
if (!createIncomplete) f.completeExceptionally(ex); |
4879 |
< |
final CompletableFuture<Integer> g = m.whenComplete |
4880 |
< |
(f, |
2759 |
< |
(Integer x, Throwable t) -> { |
2760 |
< |
threadAssertNull(x); |
4879 |
> |
final CompletionStage<Integer> g = d.exceptionallyAsync |
4880 |
> |
((Throwable t) -> { |
4881 |
|
threadAssertSame(t, ex); |
4882 |
|
a.getAndIncrement(); |
4883 |
+ |
return v1; |
4884 |
|
}); |
4885 |
|
if (createIncomplete) f.completeExceptionally(ex); |
4886 |
< |
checkCompletedWithWrappedCFException(f, ex); |
4887 |
< |
checkCompletedWithWrappedCFException(g, ex); |
4886 |
> |
|
4887 |
> |
checkCompletedNormally(g.toCompletableFuture(), v1); |
4888 |
|
assertEquals(1, a.get()); |
4889 |
|
}} |
4890 |
|
|
4891 |
|
/** |
4892 |
< |
* whenComplete action executes on cancelled source, propagating |
4893 |
< |
* CancellationException. |
4892 |
> |
* Under default implementation, if an "exceptionally action" |
4893 |
> |
* throws an exception, it completes exceptionally with that |
4894 |
> |
* exception |
4895 |
|
*/ |
4896 |
< |
public void testWhenComplete_sourceCancelled() { |
2775 |
< |
for (ExecutionMode m : ExecutionMode.values()) |
2776 |
< |
for (boolean mayInterruptIfRunning : new boolean[] { true, false }) |
4896 |
> |
public void testDefaultExceptionallyAsync_exceptionalCompletionActionFailed() { |
4897 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
4898 |
|
{ |
4899 |
|
final AtomicInteger a = new AtomicInteger(0); |
4900 |
+ |
final CFException ex1 = new CFException(); |
4901 |
+ |
final CFException ex2 = new CFException(); |
4902 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4903 |
< |
if (!createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
4904 |
< |
final CompletableFuture<Integer> g = m.whenComplete |
4905 |
< |
(f, |
4906 |
< |
(Integer x, Throwable t) -> { |
4907 |
< |
threadAssertNull(x); |
4908 |
< |
threadAssertTrue(t instanceof CancellationException); |
4903 |
> |
final DelegatedCompletionStage<Integer> d = |
4904 |
> |
new DelegatedCompletionStage<Integer>(f); |
4905 |
> |
if (!createIncomplete) f.completeExceptionally(ex1); |
4906 |
> |
final CompletionStage<Integer> g = d.exceptionallyAsync |
4907 |
> |
((Throwable t) -> { |
4908 |
> |
threadAssertSame(t, ex1); |
4909 |
|
a.getAndIncrement(); |
4910 |
+ |
throw ex2; |
4911 |
|
}); |
4912 |
< |
if (createIncomplete) assertTrue(f.cancel(mayInterruptIfRunning)); |
4912 |
> |
if (createIncomplete) f.completeExceptionally(ex1); |
4913 |
|
|
4914 |
< |
//try { g.join(); } catch (Throwable t) { throw new Error(t); } |
4915 |
< |
checkCompletedWithWrappedCancellationException(g); |
4916 |
< |
checkCancelled(f); |
4914 |
> |
checkCompletedWithWrappedException(g.toCompletableFuture(), ex2); |
4915 |
> |
checkCompletedExceptionally(f, ex1); |
4916 |
> |
checkCompletedExceptionally(d.toCompletableFuture(), ex1); |
4917 |
|
assertEquals(1, a.get()); |
4918 |
|
}} |
4919 |
|
|
4920 |
|
/** |
4921 |
< |
* If a whenComplete action throws an exception when triggered by |
4922 |
< |
* a normal completion, it completes exceptionally |
4921 |
> |
* default exceptionallyCompose result completes normally after normal |
4922 |
> |
* completion of source |
4923 |
|
*/ |
4924 |
< |
public void testWhenComplete_actionFailed() { |
4924 |
> |
public void testDefaultExceptionallyCompose_normalCompletion() { |
4925 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
2803 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
4926 |
|
for (Integer v1 : new Integer[] { 1, null }) |
4927 |
|
{ |
4928 |
< |
final AtomicInteger a = new AtomicInteger(0); |
4928 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4929 |
> |
final ExceptionalCompletableFutureFunction r = |
4930 |
> |
new ExceptionalCompletableFutureFunction(ExecutionMode.SYNC); |
4931 |
> |
final DelegatedCompletionStage<Integer> d = |
4932 |
> |
new DelegatedCompletionStage<Integer>(f); |
4933 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
4934 |
> |
final CompletionStage<Integer> g = d.exceptionallyCompose(r); |
4935 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
4936 |
> |
|
4937 |
> |
checkCompletedNormally(f, v1); |
4938 |
> |
checkCompletedNormally(g.toCompletableFuture(), v1); |
4939 |
> |
r.assertNotInvoked(); |
4940 |
> |
}} |
4941 |
> |
|
4942 |
> |
/** |
4943 |
> |
* default-implemented exceptionallyCompose result completes |
4944 |
> |
* normally after exceptional completion of source |
4945 |
> |
*/ |
4946 |
> |
public void testDefaultExceptionallyCompose_exceptionalCompletion() { |
4947 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
4948 |
> |
{ |
4949 |
|
final CFException ex = new CFException(); |
4950 |
+ |
final ExceptionalCompletableFutureFunction r = |
4951 |
+ |
new ExceptionalCompletableFutureFunction(ExecutionMode.SYNC); |
4952 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4953 |
< |
if (!createIncomplete) f.complete(v1); |
4954 |
< |
final CompletableFuture<Integer> g = m.whenComplete |
4955 |
< |
(f, |
4956 |
< |
(Integer x, Throwable t) -> { |
4957 |
< |
threadAssertSame(x, v1); |
4958 |
< |
threadAssertNull(t); |
4959 |
< |
a.getAndIncrement(); |
4960 |
< |
throw ex; |
4961 |
< |
}); |
4962 |
< |
if (createIncomplete) f.complete(v1); |
4953 |
> |
final DelegatedCompletionStage<Integer> d = |
4954 |
> |
new DelegatedCompletionStage<Integer>(f); |
4955 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
4956 |
> |
final CompletionStage<Integer> g = d.exceptionallyCompose(r); |
4957 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
4958 |
> |
|
4959 |
> |
checkCompletedExceptionally(f, ex); |
4960 |
> |
checkCompletedNormally(g.toCompletableFuture(), r.value); |
4961 |
> |
r.assertInvoked(); |
4962 |
> |
}} |
4963 |
> |
|
4964 |
> |
/** |
4965 |
> |
* default-implemented exceptionallyCompose completes |
4966 |
> |
* exceptionally on exception if action does |
4967 |
> |
*/ |
4968 |
> |
public void testDefaultExceptionallyCompose_actionFailed() { |
4969 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
4970 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
4971 |
> |
{ |
4972 |
> |
final CFException ex = new CFException(); |
4973 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4974 |
> |
final FailingExceptionalCompletableFutureFunction r |
4975 |
> |
= new FailingExceptionalCompletableFutureFunction(ExecutionMode.SYNC); |
4976 |
> |
final DelegatedCompletionStage<Integer> d = |
4977 |
> |
new DelegatedCompletionStage<Integer>(f); |
4978 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
4979 |
> |
final CompletionStage<Integer> g = d.exceptionallyCompose(r); |
4980 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
4981 |
> |
|
4982 |
> |
checkCompletedExceptionally(f, ex); |
4983 |
> |
checkCompletedWithWrappedException(g.toCompletableFuture(), r.ex); |
4984 |
> |
r.assertInvoked(); |
4985 |
> |
}} |
4986 |
> |
|
4987 |
> |
/** |
4988 |
> |
* default exceptionallyComposeAsync result completes normally after normal |
4989 |
> |
* completion of source |
4990 |
> |
*/ |
4991 |
> |
public void testDefaultExceptionallyComposeAsync_normalCompletion() { |
4992 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
4993 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
4994 |
> |
{ |
4995 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
4996 |
> |
final ExceptionalCompletableFutureFunction r = |
4997 |
> |
new ExceptionalCompletableFutureFunction(ExecutionMode.ASYNC); |
4998 |
> |
final DelegatedCompletionStage<Integer> d = |
4999 |
> |
new DelegatedCompletionStage<Integer>(f); |
5000 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
5001 |
> |
final CompletionStage<Integer> g = d.exceptionallyComposeAsync(r); |
5002 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
5003 |
> |
|
5004 |
|
checkCompletedNormally(f, v1); |
5005 |
< |
checkCompletedWithWrappedCFException(g, ex); |
5006 |
< |
assertEquals(1, a.get()); |
5005 |
> |
checkCompletedNormally(g.toCompletableFuture(), v1); |
5006 |
> |
r.assertNotInvoked(); |
5007 |
|
}} |
5008 |
|
|
5009 |
|
/** |
5010 |
< |
* If a whenComplete action throws an exception when triggered by |
5011 |
< |
* a source completion that also throws an exception, the source |
2827 |
< |
* exception takes precedence. |
5010 |
> |
* default-implemented exceptionallyComposeAsync result completes |
5011 |
> |
* normally after exceptional completion of source |
5012 |
|
*/ |
5013 |
< |
public void testWhenComplete_actionFailedSourceFailed() { |
5013 |
> |
public void testDefaultExceptionallyComposeAsync_exceptionalCompletion() { |
5014 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
5015 |
> |
{ |
5016 |
> |
final CFException ex = new CFException(); |
5017 |
> |
final ExceptionalCompletableFutureFunction r = |
5018 |
> |
new ExceptionalCompletableFutureFunction(ExecutionMode.ASYNC); |
5019 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
5020 |
> |
final DelegatedCompletionStage<Integer> d = |
5021 |
> |
new DelegatedCompletionStage<Integer>(f); |
5022 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
5023 |
> |
final CompletionStage<Integer> g = d.exceptionallyComposeAsync(r); |
5024 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
5025 |
> |
|
5026 |
> |
checkCompletedExceptionally(f, ex); |
5027 |
> |
checkCompletedNormally(g.toCompletableFuture(), r.value); |
5028 |
> |
r.assertInvoked(); |
5029 |
> |
}} |
5030 |
> |
|
5031 |
> |
/** |
5032 |
> |
* default-implemented exceptionallyComposeAsync completes |
5033 |
> |
* exceptionally on exception if action does |
5034 |
> |
*/ |
5035 |
> |
public void testDefaultExceptionallyComposeAsync_actionFailed() { |
5036 |
|
for (boolean createIncomplete : new boolean[] { true, false }) |
2831 |
– |
for (ExecutionMode m : ExecutionMode.values()) |
5037 |
|
for (Integer v1 : new Integer[] { 1, null }) |
5038 |
|
{ |
5039 |
< |
final AtomicInteger a = new AtomicInteger(0); |
2835 |
< |
final CFException ex1 = new CFException(); |
2836 |
< |
final CFException ex2 = new CFException(); |
5039 |
> |
final CFException ex = new CFException(); |
5040 |
|
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
5041 |
+ |
final FailingExceptionalCompletableFutureFunction r |
5042 |
+ |
= new FailingExceptionalCompletableFutureFunction(ExecutionMode.ASYNC); |
5043 |
+ |
final DelegatedCompletionStage<Integer> d = |
5044 |
+ |
new DelegatedCompletionStage<Integer>(f); |
5045 |
+ |
if (!createIncomplete) f.completeExceptionally(ex); |
5046 |
+ |
final CompletionStage<Integer> g = d.exceptionallyComposeAsync(r); |
5047 |
+ |
if (createIncomplete) f.completeExceptionally(ex); |
5048 |
|
|
5049 |
< |
if (!createIncomplete) f.completeExceptionally(ex1); |
5050 |
< |
final CompletableFuture<Integer> g = m.whenComplete |
5051 |
< |
(f, |
5052 |
< |
(Integer x, Throwable t) -> { |
2843 |
< |
threadAssertSame(t, ex1); |
2844 |
< |
threadAssertNull(x); |
2845 |
< |
a.getAndIncrement(); |
2846 |
< |
throw ex2; |
2847 |
< |
}); |
2848 |
< |
if (createIncomplete) f.completeExceptionally(ex1); |
5049 |
> |
checkCompletedExceptionally(f, ex); |
5050 |
> |
checkCompletedWithWrappedException(g.toCompletableFuture(), r.ex); |
5051 |
> |
r.assertInvoked(); |
5052 |
> |
}} |
5053 |
|
|
5054 |
< |
checkCompletedWithWrappedCFException(f, ex1); |
5055 |
< |
checkCompletedWithWrappedCFException(g, ex1); |
5056 |
< |
assertEquals(1, a.get()); |
5054 |
> |
|
5055 |
> |
/** |
5056 |
> |
* default exceptionallyComposeAsync result completes normally after normal |
5057 |
> |
* completion of source |
5058 |
> |
*/ |
5059 |
> |
public void testDefaultExceptionallyComposeAsyncExecutor_normalCompletion() { |
5060 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
5061 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
5062 |
> |
{ |
5063 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
5064 |
> |
final ExceptionalCompletableFutureFunction r = |
5065 |
> |
new ExceptionalCompletableFutureFunction(ExecutionMode.EXECUTOR); |
5066 |
> |
final DelegatedCompletionStage<Integer> d = |
5067 |
> |
new DelegatedCompletionStage<Integer>(f); |
5068 |
> |
if (!createIncomplete) assertTrue(f.complete(v1)); |
5069 |
> |
final CompletionStage<Integer> g = d.exceptionallyComposeAsync(r, new ThreadExecutor()); |
5070 |
> |
if (createIncomplete) assertTrue(f.complete(v1)); |
5071 |
> |
|
5072 |
> |
checkCompletedNormally(f, v1); |
5073 |
> |
checkCompletedNormally(g.toCompletableFuture(), v1); |
5074 |
> |
r.assertNotInvoked(); |
5075 |
> |
}} |
5076 |
> |
|
5077 |
> |
/** |
5078 |
> |
* default-implemented exceptionallyComposeAsync result completes |
5079 |
> |
* normally after exceptional completion of source |
5080 |
> |
*/ |
5081 |
> |
public void testDefaultExceptionallyComposeAsyncExecutor_exceptionalCompletion() { |
5082 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
5083 |
> |
{ |
5084 |
> |
final CFException ex = new CFException(); |
5085 |
> |
final ExceptionalCompletableFutureFunction r = |
5086 |
> |
new ExceptionalCompletableFutureFunction(ExecutionMode.EXECUTOR); |
5087 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
5088 |
> |
final DelegatedCompletionStage<Integer> d = |
5089 |
> |
new DelegatedCompletionStage<Integer>(f); |
5090 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
5091 |
> |
final CompletionStage<Integer> g = d.exceptionallyComposeAsync(r, new ThreadExecutor()); |
5092 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
5093 |
> |
|
5094 |
> |
checkCompletedExceptionally(f, ex); |
5095 |
> |
checkCompletedNormally(g.toCompletableFuture(), r.value); |
5096 |
> |
r.assertInvoked(); |
5097 |
> |
}} |
5098 |
> |
|
5099 |
> |
/** |
5100 |
> |
* default-implemented exceptionallyComposeAsync completes |
5101 |
> |
* exceptionally on exception if action does |
5102 |
> |
*/ |
5103 |
> |
public void testDefaultExceptionallyComposeAsyncExecutor_actionFailed() { |
5104 |
> |
for (boolean createIncomplete : new boolean[] { true, false }) |
5105 |
> |
for (Integer v1 : new Integer[] { 1, null }) |
5106 |
> |
{ |
5107 |
> |
final CFException ex = new CFException(); |
5108 |
> |
final CompletableFuture<Integer> f = new CompletableFuture<>(); |
5109 |
> |
final FailingExceptionalCompletableFutureFunction r |
5110 |
> |
= new FailingExceptionalCompletableFutureFunction(ExecutionMode.EXECUTOR); |
5111 |
> |
final DelegatedCompletionStage<Integer> d = |
5112 |
> |
new DelegatedCompletionStage<Integer>(f); |
5113 |
> |
if (!createIncomplete) f.completeExceptionally(ex); |
5114 |
> |
final CompletionStage<Integer> g = d.exceptionallyComposeAsync(r, new ThreadExecutor()); |
5115 |
> |
if (createIncomplete) f.completeExceptionally(ex); |
5116 |
> |
|
5117 |
> |
checkCompletedExceptionally(f, ex); |
5118 |
> |
checkCompletedWithWrappedException(g.toCompletableFuture(), r.ex); |
5119 |
> |
r.assertInvoked(); |
5120 |
|
}} |
5121 |
|
|
5122 |
|
} |