88 |
|
* Items 0 ... n - 1. |
89 |
|
*/ |
90 |
|
private static PriorityBlockingQueue<Item> populatedQueue(int n) { |
91 |
< |
PriorityBlockingQueue<Item> q = |
92 |
< |
new PriorityBlockingQueue<Item>(n); |
91 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(n); |
92 |
|
assertTrue(q.isEmpty()); |
93 |
|
for (int i = n - 1; i >= 0; i -= 2) |
94 |
|
mustOffer(q, i); |
157 |
|
*/ |
158 |
|
public void testConstructor6() { |
159 |
|
Item[] items = defaultItems; |
160 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(Arrays.asList(items)); |
160 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(Arrays.asList(items)); |
161 |
|
for (int i = 0; i < SIZE; ++i) |
162 |
|
mustEqual(items[i], q.poll()); |
163 |
|
} |
168 |
|
public void testConstructor7() { |
169 |
|
MyReverseComparator cmp = new MyReverseComparator(); |
170 |
|
@SuppressWarnings("unchecked") |
171 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(SIZE, cmp); |
171 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(SIZE, cmp); |
172 |
|
mustEqual(cmp, q.comparator()); |
173 |
|
Item[] items = defaultItems; |
174 |
|
q.addAll(Arrays.asList(items)); |
180 |
|
* isEmpty is true before add, false after |
181 |
|
*/ |
182 |
|
public void testEmpty() { |
183 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(2); |
183 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(2); |
184 |
|
assertTrue(q.isEmpty()); |
185 |
|
mustEqual(Integer.MAX_VALUE, q.remainingCapacity()); |
186 |
|
q.add(one); |
212 |
|
* Offer of comparable element succeeds |
213 |
|
*/ |
214 |
|
public void testOffer() { |
215 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(1); |
215 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(1); |
216 |
|
assertTrue(q.offer(zero)); |
217 |
|
assertTrue(q.offer(one)); |
218 |
|
} |
221 |
|
* Offer of non-Comparable throws CCE |
222 |
|
*/ |
223 |
|
public void testOfferNonComparable() { |
224 |
< |
PriorityBlockingQueue<Object> q = new PriorityBlockingQueue<Object>(1); |
224 |
> |
PriorityBlockingQueue<Object> q = new PriorityBlockingQueue<>(1); |
225 |
|
try { |
226 |
|
q.offer(new Object()); |
227 |
|
shouldThrow(); |
236 |
|
* add of comparable succeeds |
237 |
|
*/ |
238 |
|
public void testAdd() { |
239 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(SIZE); |
239 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(SIZE); |
240 |
|
for (int i = 0; i < SIZE; ++i) { |
241 |
|
mustEqual(i, q.size()); |
242 |
|
mustAdd(q, i); |
259 |
|
* possibly adding some elements |
260 |
|
*/ |
261 |
|
public void testAddAll3() { |
262 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(SIZE); |
262 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(SIZE); |
263 |
|
Item[] items = new Item[2]; |
264 |
|
items[0] = zero; |
265 |
|
try { |
274 |
|
public void testAddAll5() { |
275 |
|
Item[] empty = new Item[0]; |
276 |
|
Item[] items = defaultItems; |
277 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(SIZE); |
277 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(SIZE); |
278 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
279 |
|
assertTrue(q.addAll(Arrays.asList(items))); |
280 |
|
for (int i = 0; i < SIZE; ++i) |
285 |
|
* all elements successfully put are contained |
286 |
|
*/ |
287 |
|
public void testPut() { |
288 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(SIZE); |
288 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(SIZE); |
289 |
|
for (int i = 0; i < SIZE; ++i) { |
290 |
|
Item x = itemFor(i); |
291 |
|
q.put(x); |
298 |
|
* put doesn't block waiting for take |
299 |
|
*/ |
300 |
|
public void testPutWithTake() throws InterruptedException { |
301 |
< |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(2); |
301 |
> |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(2); |
302 |
|
final int size = 4; |
303 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
304 |
|
public void realRun() { |
315 |
|
* Queue is unbounded, so timed offer never times out |
316 |
|
*/ |
317 |
|
public void testTimedOffer() { |
318 |
< |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(2); |
318 |
> |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(2); |
319 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
320 |
|
public void realRun() { |
321 |
|
q.put(one); |
514 |
|
*/ |
515 |
|
public void testContainsAll() { |
516 |
|
PriorityBlockingQueue<Item> q = populatedQueue(SIZE); |
517 |
< |
PriorityBlockingQueue<Item> p = new PriorityBlockingQueue<Item>(SIZE); |
517 |
> |
PriorityBlockingQueue<Item> p = new PriorityBlockingQueue<>(SIZE); |
518 |
|
for (int i = 0; i < SIZE; ++i) { |
519 |
|
assertTrue(q.containsAll(p)); |
520 |
|
assertFalse(p.containsAll(q)); |
613 |
|
* iterator of empty collection has no elements |
614 |
|
*/ |
615 |
|
public void testEmptyIterator() { |
616 |
< |
assertIteratorExhausted(new PriorityBlockingQueue<Item>().iterator()); |
616 |
> |
assertIteratorExhausted(new PriorityBlockingQueue<>().iterator()); |
617 |
|
} |
618 |
|
|
619 |
|
/** |
620 |
|
* iterator.remove removes current element |
621 |
|
*/ |
622 |
|
public void testIteratorRemove() { |
623 |
< |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(3); |
623 |
> |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(3); |
624 |
|
q.add(two); |
625 |
|
q.add(one); |
626 |
|
q.add(three); |
650 |
|
* timed poll transfers elements across Executor tasks |
651 |
|
*/ |
652 |
|
public void testPollInExecutor() { |
653 |
< |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(2); |
653 |
> |
final PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(2); |
654 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
655 |
|
final ExecutorService executor = Executors.newFixedThreadPool(2); |
656 |
|
try (PoolCleaner cleaner = cleaner(executor)) { |
691 |
|
*/ |
692 |
|
public void testDrainTo() { |
693 |
|
PriorityBlockingQueue<Item> q = populatedQueue(SIZE); |
694 |
< |
ArrayList<Item> l = new ArrayList<Item>(); |
694 |
> |
ArrayList<Item> l = new ArrayList<>(); |
695 |
|
q.drainTo(l); |
696 |
|
mustEqual(0, q.size()); |
697 |
|
mustEqual(SIZE, l.size()); |
720 |
|
}}); |
721 |
|
|
722 |
|
t.start(); |
723 |
< |
ArrayList<Item> l = new ArrayList<Item>(); |
723 |
> |
ArrayList<Item> l = new ArrayList<>(); |
724 |
|
q.drainTo(l); |
725 |
|
assertTrue(l.size() >= SIZE); |
726 |
|
for (int i = 0; i < SIZE; ++i) |
733 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
734 |
|
*/ |
735 |
|
public void testDrainToN() { |
736 |
< |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<Item>(SIZE * 2); |
736 |
> |
PriorityBlockingQueue<Item> q = new PriorityBlockingQueue<>(SIZE * 2); |
737 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
738 |
|
for (int j = 0; j < SIZE; j++) |
739 |
|
mustOffer(q, j); |
740 |
< |
ArrayList<Item> l = new ArrayList<Item>(); |
740 |
> |
ArrayList<Item> l = new ArrayList<>(); |
741 |
|
q.drainTo(l, i); |
742 |
|
int k = (i < SIZE) ? i : SIZE; |
743 |
|
mustEqual(k, l.size()); |
753 |
|
*/ |
754 |
|
public void testNeverContainsNull() { |
755 |
|
Collection<?>[] qs = { |
756 |
< |
new PriorityBlockingQueue<Object>(), |
756 |
> |
new PriorityBlockingQueue<>(), |
757 |
|
populatedQueue(2), |
758 |
|
}; |
759 |
|
|