10 |
|
import java.util.Comparator; |
11 |
|
import java.util.List; |
12 |
|
import java.util.Set; |
13 |
– |
import java.util.HashSet; |
13 |
|
import java.util.concurrent.Callable; |
14 |
|
import java.util.concurrent.CompletionService; |
15 |
|
import java.util.concurrent.ExecutionException; |
50 |
|
List<Future<Integer>> futures = new ArrayList<>(n); |
51 |
|
Integer result = null; |
52 |
|
try { |
53 |
< |
solvers.forEach((solver) -> futures.add(cs.submit(solver))); |
53 |
> |
solvers.forEach(solver -> futures.add(cs.submit(solver))); |
54 |
|
for (int i = n; i > 0; i--) { |
55 |
|
try { |
56 |
|
Integer r = cs.take().get(); |
61 |
|
} catch (ExecutionException ignore) {} |
62 |
|
} |
63 |
|
} finally { |
64 |
< |
futures.forEach((future) -> future.cancel(true)); |
64 |
> |
futures.forEach(future -> future.cancel(true)); |
65 |
|
} |
66 |
|
|
67 |
|
if (result != null) |
71 |
|
ArrayList<Integer> results; |
72 |
|
|
73 |
|
void use(Integer x) { |
74 |
< |
if (results == null) results = new ArrayList<Integer>(); |
74 |
> |
if (results == null) results = new ArrayList<>(); |
75 |
|
results.add(x); |
76 |
|
} |
77 |
|
|