92 |
|
*/ |
93 |
|
public void testConstructor6() { |
94 |
|
Item[] items = defaultItems; |
95 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(Arrays.asList(items)); |
95 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(Arrays.asList(items)); |
96 |
|
for (int i = 0; i < SIZE; ++i) |
97 |
|
mustEqual(items[i], q.poll()); |
98 |
|
} |
101 |
|
* isEmpty is true before add, false after |
102 |
|
*/ |
103 |
|
public void testEmpty() { |
104 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
104 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
105 |
|
assertTrue(q.isEmpty()); |
106 |
|
q.add(one); |
107 |
|
assertFalse(q.isEmpty()); |
130 |
|
* offer(null) throws NPE |
131 |
|
*/ |
132 |
|
public void testOfferNull() { |
133 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
133 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
134 |
|
try { |
135 |
|
q.offer(null); |
136 |
|
shouldThrow(); |
141 |
|
* add(null) throws NPE |
142 |
|
*/ |
143 |
|
public void testAddNull() { |
144 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
144 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
145 |
|
try { |
146 |
|
q.add(null); |
147 |
|
shouldThrow(); |
152 |
|
* Offer returns true |
153 |
|
*/ |
154 |
|
public void testOffer() { |
155 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
155 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
156 |
|
assertTrue(q.offer(zero)); |
157 |
|
assertTrue(q.offer(one)); |
158 |
|
} |
161 |
|
* add returns true |
162 |
|
*/ |
163 |
|
public void testAdd() { |
164 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
164 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
165 |
|
for (int i = 0; i < SIZE; ++i) { |
166 |
|
mustEqual(i, q.size()); |
167 |
|
mustAdd(q, i); |
172 |
|
* addAll(null) throws NullPointerException |
173 |
|
*/ |
174 |
|
public void testAddAll1() { |
175 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
175 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
176 |
|
try { |
177 |
|
q.addAll(null); |
178 |
|
shouldThrow(); |
194 |
|
* addAll of a collection with null elements throws NullPointerException |
195 |
|
*/ |
196 |
|
public void testAddAll2() { |
197 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
197 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
198 |
|
try { |
199 |
|
q.addAll(Arrays.asList(new Item[SIZE])); |
200 |
|
shouldThrow(); |
206 |
|
* possibly adding some elements |
207 |
|
*/ |
208 |
|
public void testAddAll3() { |
209 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
209 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
210 |
|
Item[] items = new Item[2]; |
211 |
|
items[0] = zero; |
212 |
|
try { |
221 |
|
public void testAddAll5() { |
222 |
|
Item[] empty = new Item[0]; |
223 |
|
Item[] items = defaultItems; |
224 |
< |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
224 |
> |
ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
225 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
226 |
|
assertTrue(q.addAll(Arrays.asList(items))); |
227 |
|
for (int i = 0; i < SIZE; ++i) |
334 |
|
*/ |
335 |
|
public void testContainsAll() { |
336 |
|
ConcurrentLinkedQueue<Item> q = populatedQueue(SIZE); |
337 |
< |
ConcurrentLinkedQueue<Item> p = new ConcurrentLinkedQueue<Item>(); |
337 |
> |
ConcurrentLinkedQueue<Item> p = new ConcurrentLinkedQueue<>(); |
338 |
|
for (int i = 0; i < SIZE; ++i) { |
339 |
|
assertTrue(q.containsAll(p)); |
340 |
|
assertFalse(p.containsAll(q)); |
442 |
|
* iterator of empty collection has no elements |
443 |
|
*/ |
444 |
|
public void testEmptyIterator() { |
445 |
< |
assertIteratorExhausted(new ConcurrentLinkedQueue<Item>().iterator()); |
445 |
> |
assertIteratorExhausted(new ConcurrentLinkedQueue<>().iterator()); |
446 |
|
} |
447 |
|
|
448 |
|
/** |
449 |
|
* iterator ordering is FIFO |
450 |
|
*/ |
451 |
|
public void testIteratorOrdering() { |
452 |
< |
final ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
452 |
> |
final ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
453 |
|
q.add(one); |
454 |
|
q.add(two); |
455 |
|
q.add(three); |
466 |
|
* Modifications do not cause iterators to fail |
467 |
|
*/ |
468 |
|
public void testWeaklyConsistentIteration() { |
469 |
< |
final ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
469 |
> |
final ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
470 |
|
q.add(one); |
471 |
|
q.add(two); |
472 |
|
q.add(three); |
483 |
|
* iterator.remove removes current element |
484 |
|
*/ |
485 |
|
public void testIteratorRemove() { |
486 |
< |
final ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<Item>(); |
486 |
> |
final ConcurrentLinkedQueue<Item> q = new ConcurrentLinkedQueue<>(); |
487 |
|
q.add(one); |
488 |
|
q.add(two); |
489 |
|
q.add(three); |
530 |
|
*/ |
531 |
|
public void testNeverContainsNull() { |
532 |
|
Collection<?>[] qs = { |
533 |
< |
new ConcurrentLinkedQueue<Object>(), |
533 |
> |
new ConcurrentLinkedQueue<>(), |
534 |
|
populatedQueue(2), |
535 |
|
}; |
536 |
|
|