4170 |
|
assertEquals(5 * 3 * n, count.get()); |
4171 |
|
} |
4172 |
|
|
4173 |
+ |
/** ant -Dvmoptions=-Xmx8m -Djsr166.tckTestClass=CompletableFutureTest tck */ |
4174 |
+ |
public void testCoCompletionGarbage() throws Throwable { |
4175 |
+ |
// final int n = 3_000_000; |
4176 |
+ |
final int n = 100; |
4177 |
+ |
final CompletableFuture<Integer> incomplete = new CompletableFuture<>(); |
4178 |
+ |
CompletableFuture<Integer> f; |
4179 |
+ |
for (int i = 0; i < n; i++) { |
4180 |
+ |
f = new CompletableFuture<>(); |
4181 |
+ |
f.runAfterEither(incomplete, () -> {}); |
4182 |
+ |
f.complete(null); |
4183 |
+ |
|
4184 |
+ |
f = new CompletableFuture<>(); |
4185 |
+ |
f.acceptEither(incomplete, (x) -> {}); |
4186 |
+ |
f.complete(null); |
4187 |
+ |
|
4188 |
+ |
f = new CompletableFuture<>(); |
4189 |
+ |
f.applyToEither(incomplete, (x) -> x); |
4190 |
+ |
f.complete(null); |
4191 |
+ |
|
4192 |
+ |
f = new CompletableFuture<>(); |
4193 |
+ |
CompletableFuture.anyOf(new CompletableFuture<?>[] { f, incomplete }); |
4194 |
+ |
f.complete(null); |
4195 |
+ |
} |
4196 |
+ |
|
4197 |
+ |
for (int i = 0; i < n; i++) { |
4198 |
+ |
f = new CompletableFuture<>(); |
4199 |
+ |
incomplete.runAfterEither(f, () -> {}); |
4200 |
+ |
f.complete(null); |
4201 |
+ |
|
4202 |
+ |
f = new CompletableFuture<>(); |
4203 |
+ |
incomplete.acceptEither(f, (x) -> {}); |
4204 |
+ |
f.complete(null); |
4205 |
+ |
|
4206 |
+ |
f = new CompletableFuture<>(); |
4207 |
+ |
incomplete.applyToEither(f, (x) -> x); |
4208 |
+ |
f.complete(null); |
4209 |
+ |
|
4210 |
+ |
f = new CompletableFuture<>(); |
4211 |
+ |
CompletableFuture.anyOf(new CompletableFuture<?>[] { incomplete, f }); |
4212 |
+ |
f.complete(null); |
4213 |
+ |
} |
4214 |
+ |
} |
4215 |
+ |
|
4216 |
+ |
/* |
4217 |
+ |
* Tests below currently fail in stress mode due to memory retention. |
4218 |
+ |
* ant -Dvmoptions=-Xmx8m -Djsr166.expensiveTests=true -Djsr166.tckTestClass=CompletableFutureTest tck |
4219 |
+ |
*/ |
4220 |
+ |
|
4221 |
+ |
/** Checks for garbage retention with anyOf. */ |
4222 |
+ |
public void testAnyOfGarbageRetention() throws Throwable { |
4223 |
+ |
for (Integer v : new Integer[] { 1, null }) |
4224 |
+ |
{ |
4225 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4226 |
+ |
CompletableFuture<Integer>[] fs |
4227 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4228 |
+ |
for (int i = 0; i < fs.length; i++) |
4229 |
+ |
fs[i] = new CompletableFuture<>(); |
4230 |
+ |
fs[fs.length - 1].complete(v); |
4231 |
+ |
for (int i = 0; i < n; i++) |
4232 |
+ |
checkCompletedNormally(CompletableFuture.anyOf(fs), v); |
4233 |
+ |
}} |
4234 |
+ |
|
4235 |
+ |
/** Checks for garbage retention with allOf. */ |
4236 |
+ |
public void testCancelledAllOfGarbageRetention() throws Throwable { |
4237 |
+ |
final int n = expensiveTests ? 100_000 : 10; |
4238 |
+ |
CompletableFuture<Integer>[] fs |
4239 |
+ |
= (CompletableFuture<Integer>[]) new CompletableFuture<?>[100]; |
4240 |
+ |
for (int i = 0; i < fs.length; i++) |
4241 |
+ |
fs[i] = new CompletableFuture<>(); |
4242 |
+ |
for (int i = 0; i < n; i++) |
4243 |
+ |
assertTrue(CompletableFuture.allOf(fs).cancel(false)); |
4244 |
+ |
} |
4245 |
+ |
|
4246 |
|
// static <U> U join(CompletionStage<U> stage) { |
4247 |
|
// CompletableFuture<U> f = new CompletableFuture<>(); |
4248 |
|
// stage.whenComplete((v, ex) -> { |