38 |
|
import java.util.List; |
39 |
|
import java.util.ListIterator; |
40 |
|
import java.util.Map; |
41 |
+ |
import java.util.PriorityQueue; |
42 |
|
import java.util.Spliterator; |
43 |
|
import java.util.Vector; |
44 |
|
import java.util.concurrent.ArrayBlockingQueue; |
47 |
|
import java.util.concurrent.LinkedBlockingDeque; |
48 |
|
import java.util.concurrent.LinkedBlockingQueue; |
49 |
|
import java.util.concurrent.LinkedTransferQueue; |
50 |
+ |
import java.util.concurrent.PriorityBlockingQueue; |
51 |
|
import java.util.concurrent.ConcurrentSkipListMap; |
52 |
|
import java.util.concurrent.CountDownLatch; |
53 |
|
import java.util.concurrent.ThreadLocalRandom; |
254 |
|
ArrayList<Job> jobs = new ArrayList<>(Arrays.asList()); |
255 |
|
|
256 |
|
List.of(al, ad, abq, |
257 |
+ |
new PriorityQueue<>(al), |
258 |
|
new Vector<>(al), |
259 |
|
new ConcurrentLinkedQueue<>(al), |
260 |
|
new ConcurrentLinkedDeque<>(al), |
261 |
|
new LinkedBlockingQueue<>(al), |
262 |
|
new LinkedBlockingDeque<>(al), |
263 |
< |
new LinkedTransferQueue<>(al)) |
263 |
> |
new LinkedTransferQueue<>(al), |
264 |
> |
new PriorityBlockingQueue<>(al)) |
265 |
|
.stream() |
266 |
|
.forEach(x -> { |
267 |
|
jobs.addAll(collectionJobs(x)); |