84 |
|
*/ |
85 |
|
public void testConstructor6() { |
86 |
|
Item[] items = defaultItems; |
87 |
< |
LinkedList<Item> q = new LinkedList<Item>(Arrays.asList(items)); |
87 |
> |
LinkedList<Item> q = new LinkedList<>(Arrays.asList(items)); |
88 |
|
for (int i = 0; i < SIZE; ++i) |
89 |
|
mustEqual(items[i], q.poll()); |
90 |
|
} |
93 |
|
* isEmpty is true before add, false after |
94 |
|
*/ |
95 |
|
public void testEmpty() { |
96 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
96 |
> |
LinkedList<Item> q = new LinkedList<>(); |
97 |
|
assertTrue(q.isEmpty()); |
98 |
|
q.add(one); |
99 |
|
assertFalse(q.isEmpty()); |
122 |
|
* offer(null) succeeds |
123 |
|
*/ |
124 |
|
public void testOfferNull() { |
125 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
125 |
> |
LinkedList<Item> q = new LinkedList<>(); |
126 |
|
q.offer(null); |
127 |
|
assertNull(q.get(0)); |
128 |
|
assertTrue(q.contains(null)); |
132 |
|
* Offer succeeds |
133 |
|
*/ |
134 |
|
public void testOffer() { |
135 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
135 |
> |
LinkedList<Item> q = new LinkedList<>(); |
136 |
|
mustOffer(q, zero); |
137 |
|
mustOffer(q, one); |
138 |
|
} |
141 |
|
* add succeeds |
142 |
|
*/ |
143 |
|
public void testAdd() { |
144 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
144 |
> |
LinkedList<Item> q = new LinkedList<>(); |
145 |
|
for (int i = 0; i < SIZE; ++i) { |
146 |
|
mustEqual(i, q.size()); |
147 |
|
mustAdd(q, i); |
152 |
|
* addAll(null) throws NPE |
153 |
|
*/ |
154 |
|
public void testAddAll1() { |
155 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
155 |
> |
LinkedList<Item> q = new LinkedList<>(); |
156 |
|
try { |
157 |
|
q.addAll(null); |
158 |
|
shouldThrow(); |
165 |
|
public void testAddAll5() { |
166 |
|
Item[] empty = new Item[0]; |
167 |
|
Item[] items = defaultItems; |
168 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
168 |
> |
LinkedList<Item> q = new LinkedList<>(); |
169 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
170 |
|
assertTrue(q.addAll(Arrays.asList(items))); |
171 |
|
for (int i = 0; i < SIZE; ++i) |
176 |
|
* addAll with too large an index throws IOOBE |
177 |
|
*/ |
178 |
|
public void testAddAll2_IndexOutOfBoundsException() { |
179 |
< |
LinkedList<Item> l = new LinkedList<Item>(); |
179 |
> |
LinkedList<Item> l = new LinkedList<>(); |
180 |
|
l.add(zero); |
181 |
< |
LinkedList<Item> m = new LinkedList<Item>(); |
181 |
> |
LinkedList<Item> m = new LinkedList<>(); |
182 |
|
m.add(one); |
183 |
|
try { |
184 |
|
l.addAll(4,m); |
190 |
|
* addAll with negative index throws IOOBE |
191 |
|
*/ |
192 |
|
public void testAddAll4_BadIndex() { |
193 |
< |
LinkedList<Item> l = new LinkedList<Item>(); |
193 |
> |
LinkedList<Item> l = new LinkedList<>(); |
194 |
|
l.add(zero); |
195 |
< |
LinkedList<Item> m = new LinkedList<Item>(); |
195 |
> |
LinkedList<Item> m = new LinkedList<>(); |
196 |
|
m.add(one); |
197 |
|
try { |
198 |
|
l.addAll(-1,m); |
306 |
|
*/ |
307 |
|
public void testContainsAll() { |
308 |
|
LinkedList<Item> q = populatedQueue(SIZE); |
309 |
< |
LinkedList<Item> p = new LinkedList<Item>(); |
309 |
> |
LinkedList<Item> p = new LinkedList<>(); |
310 |
|
for (int i = 0; i < SIZE; ++i) { |
311 |
|
assertTrue(q.containsAll(p)); |
312 |
|
assertFalse(p.containsAll(q)); |
378 |
|
* toArray(null) throws NullPointerException |
379 |
|
*/ |
380 |
|
public void testToArray_NullArg() { |
381 |
< |
LinkedList<Item> l = new LinkedList<Item>(); |
381 |
> |
LinkedList<Item> l = new LinkedList<>(); |
382 |
|
l.add(zero); |
383 |
|
try { |
384 |
|
l.toArray((Item[])null); |
390 |
|
* toArray(incompatible array type) throws ArrayStoreException |
391 |
|
*/ |
392 |
|
public void testToArray1_BadArg() { |
393 |
< |
LinkedList<Item> l = new LinkedList<Item>(); |
393 |
> |
LinkedList<Item> l = new LinkedList<>(); |
394 |
|
l.add(five); |
395 |
|
try { |
396 |
|
l.toArray(new String[10]); |
415 |
|
* iterator of empty collection has no elements |
416 |
|
*/ |
417 |
|
public void testEmptyIterator() { |
418 |
< |
assertIteratorExhausted(new LinkedList<Item>().iterator()); |
418 |
> |
assertIteratorExhausted(new LinkedList<>().iterator()); |
419 |
|
} |
420 |
|
|
421 |
|
/** |
422 |
|
* iterator ordering is FIFO |
423 |
|
*/ |
424 |
|
public void testIteratorOrdering() { |
425 |
< |
final LinkedList<Item> q = new LinkedList<Item>(); |
425 |
> |
final LinkedList<Item> q = new LinkedList<>(); |
426 |
|
q.add(one); |
427 |
|
q.add(two); |
428 |
|
q.add(three); |
438 |
|
* iterator.remove removes current element |
439 |
|
*/ |
440 |
|
public void testIteratorRemove() { |
441 |
< |
final LinkedList<Item> q = new LinkedList<Item>(); |
441 |
> |
final LinkedList<Item> q = new LinkedList<>(); |
442 |
|
q.add(one); |
443 |
|
q.add(two); |
444 |
|
q.add(three); |
474 |
|
* Descending iterator ordering is reverse FIFO |
475 |
|
*/ |
476 |
|
public void testDescendingIteratorOrdering() { |
477 |
< |
final LinkedList<Item> q = new LinkedList<Item>(); |
477 |
> |
final LinkedList<Item> q = new LinkedList<>(); |
478 |
|
q.add(three); |
479 |
|
q.add(two); |
480 |
|
q.add(one); |
490 |
|
* descendingIterator.remove removes current element |
491 |
|
*/ |
492 |
|
public void testDescendingIteratorRemove() { |
493 |
< |
final LinkedList<Item> q = new LinkedList<Item>(); |
493 |
> |
final LinkedList<Item> q = new LinkedList<>(); |
494 |
|
q.add(three); |
495 |
|
q.add(two); |
496 |
|
q.add(one); |
550 |
|
* OfferFirst succeeds |
551 |
|
*/ |
552 |
|
public void testOfferFirst() { |
553 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
553 |
> |
LinkedList<Item> q = new LinkedList<>(); |
554 |
|
assertTrue(q.offerFirst(zero)); |
555 |
|
assertTrue(q.offerFirst(one)); |
556 |
|
} |
559 |
|
* OfferLast succeeds |
560 |
|
*/ |
561 |
|
public void testOfferLast() { |
562 |
< |
LinkedList<Item> q = new LinkedList<Item>(); |
562 |
> |
LinkedList<Item> q = new LinkedList<>(); |
563 |
|
assertTrue(q.offerLast(zero)); |
564 |
|
assertTrue(q.offerLast(one)); |
565 |
|
} |