ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/CompletableFutureTest.java

Comparing jsr166/src/test/tck/CompletableFutureTest.java (file contents):
Revision 1.154 by jsr166, Sun Jun 26 19:27:42 2016 UTC vs.
Revision 1.165 by jsr166, Sun Jul 3 19:35:50 2016 UTC

#	Line 550 | Line 550 | public class CompletableFutureTest exten
550		}
551		}
552
553	+	static class CountingRejectingExecutor implements Executor {
554	+	final RejectedExecutionException ex = new RejectedExecutionException();
555	+	final AtomicInteger count = new AtomicInteger(0);
556	+	public void execute(Runnable r) {
557	+	count.getAndIncrement();
558	+	throw ex;
559	+	}
560	+	}
561	+
562		// Used for explicit executor tests
563		static final class ThreadExecutor implements Executor {
564		final AtomicInteger count = new AtomicInteger(0);
#	Line 1234 | Line 1243 | public class CompletableFutureTest exten
1243		r.assertInvoked();
1244		}}
1245
1246	+	public void testRunAsync_rejectingExecutor() {
1247	+	CountingRejectingExecutor e = new CountingRejectingExecutor();
1248	+	try {
1249	+	CompletableFuture.runAsync(() -> {}, e);
1250	+	shouldThrow();
1251	+	} catch (Throwable t) {
1252	+	assertSame(e.ex, t);
1253	+	}
1254	+
1255	+	assertEquals(1, e.count.get());
1256	+	}
1257	+
1258		/**
1259		* supplyAsync completes with result of supplier
1260		*/
#	Line 1268 | Line 1289 | public class CompletableFutureTest exten
1289		r.assertInvoked();
1290		}}
1291
1292	+	public void testSupplyAsync_rejectingExecutor() {
1293	+	CountingRejectingExecutor e = new CountingRejectingExecutor();
1294	+	try {
1295	+	CompletableFuture.supplyAsync(() -> null, e);
1296	+	shouldThrow();
1297	+	} catch (Throwable t) {
1298	+	assertSame(e.ex, t);
1299	+	}
1300	+
1301	+	assertEquals(1, e.count.get());
1302	+	}
1303	+
1304		// seq completion methods
1305
1306		/**
#	Line 2667 | Line 2700 | public class CompletableFutureTest exten
2700		for (ExecutionMode m : ExecutionMode.values())
2701		for (Integer v1 : new Integer[] { 1, null })
2702		for (Integer v2 : new Integer[] { 2, null })
2703	+	for (boolean pushNop : new boolean[] { true, false })
2704		{
2705		final CompletableFuture<Integer> f = new CompletableFuture<>();
2706		final CompletableFuture<Integer> g = new CompletableFuture<>();
#	Line 2679 | Line 2713 | public class CompletableFutureTest exten
2713		checkIncomplete(h1);
2714		rs[0].assertNotInvoked();
2715		rs[1].assertNotInvoked();
2716	+	if (pushNop) {          // ad hoc test of intra-completion interference
2717	+	m.thenRun(f, () -> {});
2718	+	m.thenRun(g, () -> {});
2719	+	}
2720		f.complete(v1);
2721		checkCompletedNormally(h0, null);
2722		checkCompletedNormally(h1, null);
#	Line 3317 | Line 3355 | public class CompletableFutureTest exten
3355		assertEquals(0, exec.count.get());
3356		}
3357
3320	–	static class CountingRejectingExecutor implements Executor {
3321	–	final RejectedExecutionException ex = new RejectedExecutionException();
3322	–	final AtomicInteger count = new AtomicInteger(0);
3323	–	public void execute(Runnable r) {
3324	–	count.getAndIncrement();
3325	–	throw ex;
3326	–	}
3327	–	}
3328	–
3358		/**
3359		* Test submissions to an executor that rejects all tasks.
3360		*/
3361		public void testRejectingExecutor() {
3362	<	for (Integer v : new Integer[] { 1, null }) {
3363	<
3362	>	for (Integer v : new Integer[] { 1, null })
3363	>	{
3364		final CountingRejectingExecutor e = new CountingRejectingExecutor();
3365
3366		final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v);
#	Line 3410 | Line 3439 | public class CompletableFutureTest exten
3439		checkCompletedWithWrappedException(future, e.ex);
3440
3441		assertEquals(futures.size(), e.count.get());
3442	<
3414	<	}
3415	<	}
3442	>	}}
3443
3444		/**
3445		* Test submissions to an executor that rejects all tasks, but
#	Line 3420 | Line 3447 | public class CompletableFutureTest exten
3447		* explicitly completed.
3448		*/
3449		public void testRejectingExecutorNeverInvoked() {
3450	+	for (Integer v : new Integer[] { 1, null })
3451	+	{
3452		final CountingRejectingExecutor e = new CountingRejectingExecutor();
3453
3425	–	for (Integer v : new Integer[] { 1, null }) {
3426	–
3454		final CompletableFuture<Integer> complete = CompletableFuture.completedFuture(v);
3455		final CompletableFuture<Integer> incomplete = new CompletableFuture<>();
3456
#	Line 3471 | Line 3498 | public class CompletableFutureTest exten
3498		checkCompletedNormally(future, null);
3499
3500		assertEquals(0, e.count.get());
3501	<
3475	<	}
3476	<	}
3501	>	}}
3502
3503		/**
3504		* toCompletableFuture returns this CompletableFuture.
#	Line 3827 | Line 3852 | public class CompletableFutureTest exten
3852		final CompletableFuture<Integer> v42 = CompletableFuture.completedFuture(42);
3853		final CompletableFuture<Integer> incomplete = new CompletableFuture<>();
3854
3855	+	final Runnable noopRunnable = new Noop(m);
3856	+	final Consumer<Integer> noopConsumer = new NoopConsumer(m);
3857	+	final Function<Integer, Integer> incFunction = new IncFunction(m);
3858	+
3859		List<Function<CompletableFuture<Integer>, CompletableFuture<?>>> funs
3860		= new ArrayList<>();
3861
3862	<	funs.add((y) -> m.thenRun(y, new Noop(m)));
3863	<	funs.add((y) -> m.thenAccept(y, new NoopConsumer(m)));
3864	<	funs.add((y) -> m.thenApply(y, new IncFunction(m)));
3865	<
3866	<	funs.add((y) -> m.runAfterEither(y, incomplete, new Noop(m)));
3867	<	funs.add((y) -> m.acceptEither(y, incomplete, new NoopConsumer(m)));
3868	<	funs.add((y) -> m.applyToEither(y, incomplete, new IncFunction(m)));
3862	>	funs.add((y) -> m.thenRun(y, noopRunnable));
3863	>	funs.add((y) -> m.thenAccept(y, noopConsumer));
3864	>	funs.add((y) -> m.thenApply(y, incFunction));
3865	>
3866	>	funs.add((y) -> m.runAfterEither(y, incomplete, noopRunnable));
3867	>	funs.add((y) -> m.acceptEither(y, incomplete, noopConsumer));
3868	>	funs.add((y) -> m.applyToEither(y, incomplete, incFunction));
3869
3870	<	funs.add((y) -> m.runAfterBoth(y, v42, new Noop(m)));
3871	<	funs.add((y) -> m.runAfterBoth(v42, y, new Noop(m)));
3870	>	funs.add((y) -> m.runAfterBoth(y, v42, noopRunnable));
3871	>	funs.add((y) -> m.runAfterBoth(v42, y, noopRunnable));
3872		funs.add((y) -> m.thenAcceptBoth(y, v42, new SubtractAction(m)));
3873		funs.add((y) -> m.thenAcceptBoth(v42, y, new SubtractAction(m)));
3874		funs.add((y) -> m.thenCombine(y, v42, new SubtractFunction(m)));
#	Line 3849 | Line 3878 | public class CompletableFutureTest exten
3878
3879		funs.add((y) -> m.thenCompose(y, new CompletableFutureInc(m)));
3880
3881	<	funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y}));
3882	<	funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {y, v42}));
3883	<	funs.add((y) -> CompletableFuture.allOf(new CompletableFuture<?>[] {v42, y}));
3884	<	funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y}));
3885	<	funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {y, incomplete}));
3886	<	funs.add((y) -> CompletableFuture.anyOf(new CompletableFuture<?>[] {incomplete, y}));
3881	>	funs.add((y) -> CompletableFuture.allOf(y));
3882	>	funs.add((y) -> CompletableFuture.allOf(y, v42));
3883	>	funs.add((y) -> CompletableFuture.allOf(v42, y));
3884	>	funs.add((y) -> CompletableFuture.anyOf(y));
3885	>	funs.add((y) -> CompletableFuture.anyOf(y, incomplete));
3886	>	funs.add((y) -> CompletableFuture.anyOf(incomplete, y));
3887
3888		for (Function<CompletableFuture<Integer>, CompletableFuture<?>>
3889		fun : funs) {
3890		CompletableFuture<Integer> f = new CompletableFuture<>();
3891		f.completeExceptionally(ex);
3892	<	CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m));
3892	>	CompletableFuture<Integer> src = m.thenApply(f, incFunction);
3893		checkCompletedWithWrappedException(src, ex);
3894		CompletableFuture<?> dep = fun.apply(src);
3895		checkCompletedWithWrappedException(dep, ex);
#	Line 3870 | Line 3899 | public class CompletableFutureTest exten
3899		for (Function<CompletableFuture<Integer>, CompletableFuture<?>>
3900		fun : funs) {
3901		CompletableFuture<Integer> f = new CompletableFuture<>();
3902	<	CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m));
3902	>	CompletableFuture<Integer> src = m.thenApply(f, incFunction);
3903		CompletableFuture<?> dep = fun.apply(src);
3904		f.completeExceptionally(ex);
3905		checkCompletedWithWrappedException(src, ex);
#	Line 3884 | Line 3913 | public class CompletableFutureTest exten
3913		CompletableFuture<Integer> f = new CompletableFuture<>();
3914		f.cancel(mayInterruptIfRunning);
3915		checkCancelled(f);
3916	<	CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m));
3916	>	CompletableFuture<Integer> src = m.thenApply(f, incFunction);
3917		checkCompletedWithWrappedCancellationException(src);
3918		CompletableFuture<?> dep = fun.apply(src);
3919		checkCompletedWithWrappedCancellationException(dep);
#	Line 3895 | Line 3924 | public class CompletableFutureTest exten
3924		for (Function<CompletableFuture<Integer>, CompletableFuture<?>>
3925		fun : funs) {
3926		CompletableFuture<Integer> f = new CompletableFuture<>();
3927	<	CompletableFuture<Integer> src = m.thenApply(f, new IncFunction(m));
3927	>	CompletableFuture<Integer> src = m.thenApply(f, incFunction);
3928		CompletableFuture<?> dep = fun.apply(src);
3929		f.cancel(mayInterruptIfRunning);
3930		checkCancelled(f);
#	Line 3906 | Line 3935 | public class CompletableFutureTest exten
3935		}}
3936
3937		/**
3938	<	* Minimal completion stages throw UOE for all non-CompletionStage methods
3938	>	* Minimal completion stages throw UOE for most non-CompletionStage methods
3939		*/
3940		public void testMinimalCompletionStage_minimality() {
3941		if (!testImplementationDetails) return;
#	Line 3935 | Line 3964 | public class CompletableFutureTest exten
3964		.filter((method) -> !permittedMethodSignatures.contains(toSignature.apply(method)))
3965		.collect(Collectors.toList());
3966
3967	<	CompletionStage<Integer> minimalStage =
3968	<	new CompletableFuture<Integer>().minimalCompletionStage();
3967	>	List<CompletionStage<Integer>> stages = new ArrayList<>();
3968	>	stages.add(new CompletableFuture<Integer>().minimalCompletionStage());
3969	>	stages.add(CompletableFuture.completedStage(1));
3970
3971		List<Method> bugs = new ArrayList<>();
3972		for (Method method : allMethods) {
#	Line 3952 | Line 3982 | public class CompletableFutureTest exten
3982		else if (parameterTypes[i] == long.class)
3983		args[i] = 0L;
3984		}
3985	<	try {
3986	<	method.invoke(minimalStage, args);
3987	<	bugs.add(method);
3958	<	}
3959	<	catch (java.lang.reflect.InvocationTargetException expected) {
3960	<	if (! (expected.getCause() instanceof UnsupportedOperationException)) {
3985	>	for (CompletionStage<Integer> stage : stages) {
3986	>	try {
3987	>	method.invoke(stage, args);
3988		bugs.add(method);
3962	–	// expected.getCause().printStackTrace();
3989		}
3990	+	catch (java.lang.reflect.InvocationTargetException expected) {
3991	+	if (! (expected.getCause() instanceof UnsupportedOperationException)) {
3992	+	bugs.add(method);
3993	+	// expected.getCause().printStackTrace();
3994	+	}
3995	+	}
3996	+	catch (ReflectiveOperationException bad) { throw new Error(bad); }
3997		}
3965	–	catch (ReflectiveOperationException bad) { throw new Error(bad); }
3998		}
3999		if (!bugs.isEmpty())
4000	<	throw new Error("Methods did not throw UOE: " + bugs.toString());
4000	>	throw new Error("Methods did not throw UOE: " + bugs);
4001		}
4002
4003		static class Monad {
#	Line 4114 | Line 4146 | public class CompletableFutureTest exten
4146		Monad.plus(godot, Monad.unit(5L)));
4147		}
4148
4149	+	/** Test long recursive chains of CompletableFutures with cascading completions */
4150	+	public void testRecursiveChains() throws Throwable {
4151	+	for (ExecutionMode m : ExecutionMode.values())
4152	+	for (boolean addDeadEnds : new boolean[] { true, false })
4153	+	{
4154	+	final int val = 42;
4155	+	final int n = expensiveTests ? 1_000 : 2;
4156	+	CompletableFuture<Integer> head = new CompletableFuture<>();
4157	+	CompletableFuture<Integer> tail = head;
4158	+	for (int i = 0; i < n; i++) {
4159	+	if (addDeadEnds) m.thenApply(tail, v -> v + 1);
4160	+	tail = m.thenApply(tail, v -> v + 1);
4161	+	if (addDeadEnds) m.applyToEither(tail, tail, v -> v + 1);
4162	+	tail = m.applyToEither(tail, tail, v -> v + 1);
4163	+	if (addDeadEnds) m.thenCombine(tail, tail, (v, w) -> v + 1);
4164	+	tail = m.thenCombine(tail, tail, (v, w) -> v + 1);
4165	+	}
4166	+	head.complete(val);
4167	+	assertEquals(val + 3 * n, (int) tail.join());
4168	+	}}
4169	+
4170		/**
4171		* A single CompletableFuture with many dependents.
4172		* A demo of scalability - runtime is O(n).
4173		*/
4174		public void testManyDependents() throws Throwable {
4175	<	final int n = 1_000;
4175	>	final int n = expensiveTests ? 1_000_000 : 10;
4176		final CompletableFuture<Void> head = new CompletableFuture<>();
4177		final CompletableFuture<Void> complete = CompletableFuture.completedFuture((Void)null);
4178		final AtomicInteger count = new AtomicInteger(0);
#	Line 4146 | Line 4199 | public class CompletableFutureTest exten
4199		assertEquals(5 * 3 * n, count.get());
4200		}
4201
4202	+	/** ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck */
4203	+	public void testCoCompletionGarbageRetention() throws Throwable {
4204	+	final int n = expensiveTests ? 1_000_000 : 10;
4205	+	final CompletableFuture<Integer> incomplete = new CompletableFuture<>();
4206	+	CompletableFuture<Integer> f;
4207	+	for (int i = 0; i < n; i++) {
4208	+	f = new CompletableFuture<>();
4209	+	f.runAfterEither(incomplete, () -> {});
4210	+	f.complete(null);
4211	+
4212	+	f = new CompletableFuture<>();
4213	+	f.acceptEither(incomplete, (x) -> {});
4214	+	f.complete(null);
4215	+
4216	+	f = new CompletableFuture<>();
4217	+	f.applyToEither(incomplete, (x) -> x);
4218	+	f.complete(null);
4219	+
4220	+	f = new CompletableFuture<>();
4221	+	CompletableFuture.anyOf(new CompletableFuture<?>[] { f, incomplete });
4222	+	f.complete(null);
4223	+	}
4224	+
4225	+	for (int i = 0; i < n; i++) {
4226	+	f = new CompletableFuture<>();
4227	+	incomplete.runAfterEither(f, () -> {});
4228	+	f.complete(null);
4229	+
4230	+	f = new CompletableFuture<>();
4231	+	incomplete.acceptEither(f, (x) -> {});
4232	+	f.complete(null);
4233	+
4234	+	f = new CompletableFuture<>();
4235	+	incomplete.applyToEither(f, (x) -> x);
4236	+	f.complete(null);
4237	+
4238	+	f = new CompletableFuture<>();
4239	+	CompletableFuture.anyOf(new CompletableFuture<?>[] { incomplete, f });
4240	+	f.complete(null);
4241	+	}
4242	+	}
4243	+
4244	+	/*
4245	+	* Tests below currently fail in stress mode due to memory retention.
4246	+	* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck
4247	+	*/
4248	+
4249	+	/** Checks for garbage retention with anyOf. */
4250	+	public void testAnyOfGarbageRetention() throws Throwable {
4251	+	for (Integer v : new Integer[] { 1, null })
4252	+	{
4253	+	final int n = expensiveTests ? 100_000 : 10;
4254	+	CompletableFuture<Integer>[] fs
4255	+	= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100];
4256	+	for (int i = 0; i < fs.length; i++)
4257	+	fs[i] = new CompletableFuture<>();
4258	+	fs[fs.length - 1].complete(v);
4259	+	for (int i = 0; i < n; i++)
4260	+	checkCompletedNormally(CompletableFuture.anyOf(fs), v);
4261	+	}}
4262	+
4263	+	/** Checks for garbage retention with allOf. */
4264	+	public void testCancelledAllOfGarbageRetention() throws Throwable {
4265	+	final int n = expensiveTests ? 100_000 : 10;
4266	+	CompletableFuture<Integer>[] fs
4267	+	= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100];
4268	+	for (int i = 0; i < fs.length; i++)
4269	+	fs[i] = new CompletableFuture<>();
4270	+	for (int i = 0; i < n; i++)
4271	+	assertTrue(CompletableFuture.allOf(fs).cancel(false));
4272	+	}
4273	+
4274		//     static <U> U join(CompletionStage<U> stage) {
4275		//         CompletableFuture<U> f = new CompletableFuture<>();
4276		//         stage.whenComplete((v, ex) -> {

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines