1 |
|
/* |
2 |
< |
* Written by members of JCP JSR-166 Expert Group and released to the |
3 |
< |
* public domain. Use, modify, and redistribute this code in any way |
4 |
< |
* without acknowledgement. Other contributors include Andrew Wright, |
5 |
< |
* Jeffrey Hayes, Pat Fischer, Mike Judd. |
2 |
> |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
> |
* Expert Group and released to the public domain, as explained at |
4 |
> |
* http://creativecommons.org/licenses/publicdomain |
5 |
> |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
> |
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
|
import junit.framework.*; |
12 |
|
|
13 |
|
public class LinkedListTest extends JSR166TestCase { |
14 |
|
public static void main(String[] args) { |
15 |
< |
junit.textui.TestRunner.run (suite()); |
15 |
> |
junit.textui.TestRunner.run(suite()); |
16 |
|
} |
17 |
|
|
18 |
|
public static Test suite() { |
19 |
< |
return new TestSuite(LinkedListTest.class); |
19 |
> |
return new TestSuite(LinkedListTest.class); |
20 |
|
} |
21 |
|
|
22 |
|
/** |
26 |
|
private LinkedList populatedQueue(int n) { |
27 |
|
LinkedList q = new LinkedList(); |
28 |
|
assertTrue(q.isEmpty()); |
29 |
< |
for(int i = 0; i < n; ++i) |
30 |
< |
assertTrue(q.offer(new Integer(i))); |
29 |
> |
for (int i = 0; i < n; ++i) |
30 |
> |
assertTrue(q.offer(new Integer(i))); |
31 |
|
assertFalse(q.isEmpty()); |
32 |
< |
assertEquals(n, q.size()); |
32 |
> |
assertEquals(n, q.size()); |
33 |
|
return q; |
34 |
|
} |
35 |
< |
|
35 |
> |
|
36 |
|
/** |
37 |
< |
* |
37 |
> |
* new queue is empty |
38 |
|
*/ |
39 |
|
public void testConstructor1() { |
40 |
|
assertEquals(0, new LinkedList().size()); |
41 |
|
} |
42 |
|
|
43 |
|
/** |
44 |
< |
* |
44 |
> |
* Initializing from null Collection throws NPE |
45 |
|
*/ |
46 |
|
public void testConstructor3() { |
47 |
|
try { |
48 |
|
LinkedList q = new LinkedList((Collection)null); |
49 |
|
shouldThrow(); |
50 |
< |
} |
50 |
< |
catch (NullPointerException success) {} |
50 |
> |
} catch (NullPointerException success) {} |
51 |
|
} |
52 |
|
|
53 |
|
/** |
54 |
< |
* |
54 |
> |
* Queue contains all elements of collection used to initialize |
55 |
|
*/ |
56 |
|
public void testConstructor6() { |
57 |
< |
try { |
58 |
< |
Integer[] ints = new Integer[SIZE]; |
59 |
< |
for (int i = 0; i < SIZE; ++i) |
60 |
< |
ints[i] = new Integer(i); |
61 |
< |
LinkedList q = new LinkedList(Arrays.asList(ints)); |
62 |
< |
for (int i = 0; i < SIZE; ++i) |
63 |
< |
assertEquals(ints[i], q.poll()); |
64 |
< |
} |
65 |
< |
finally {} |
57 |
> |
Integer[] ints = new Integer[SIZE]; |
58 |
> |
for (int i = 0; i < SIZE; ++i) |
59 |
> |
ints[i] = i; |
60 |
> |
LinkedList q = new LinkedList(Arrays.asList(ints)); |
61 |
> |
for (int i = 0; i < SIZE; ++i) |
62 |
> |
assertEquals(ints[i], q.poll()); |
63 |
|
} |
64 |
|
|
65 |
|
/** |
66 |
< |
* |
66 |
> |
* isEmpty is true before add, false after |
67 |
|
*/ |
68 |
|
public void testEmpty() { |
69 |
|
LinkedList q = new LinkedList(); |
77 |
|
} |
78 |
|
|
79 |
|
/** |
80 |
< |
* |
80 |
> |
* size changes when elements added and removed |
81 |
|
*/ |
82 |
|
public void testSize() { |
83 |
|
LinkedList q = populatedQueue(SIZE); |
92 |
|
} |
93 |
|
|
94 |
|
/** |
95 |
< |
* |
95 |
> |
* offer(null) succeeds |
96 |
|
*/ |
97 |
|
public void testOfferNull() { |
98 |
< |
try { |
99 |
< |
LinkedList q = new LinkedList(); |
103 |
< |
q.offer(null); |
104 |
< |
} catch (NullPointerException ie) { |
105 |
< |
unexpectedException(); |
106 |
< |
} |
98 |
> |
LinkedList q = new LinkedList(); |
99 |
> |
q.offer(null); |
100 |
|
} |
101 |
|
|
102 |
|
/** |
103 |
< |
* |
103 |
> |
* Offer succeeds |
104 |
|
*/ |
105 |
|
public void testOffer() { |
106 |
|
LinkedList q = new LinkedList(); |
109 |
|
} |
110 |
|
|
111 |
|
/** |
112 |
< |
* |
112 |
> |
* add succeeds |
113 |
|
*/ |
114 |
|
public void testAdd() { |
115 |
|
LinkedList q = new LinkedList(); |
120 |
|
} |
121 |
|
|
122 |
|
/** |
123 |
< |
* |
123 |
> |
* addAll(null) throws NPE |
124 |
|
*/ |
125 |
|
public void testAddAll1() { |
126 |
|
try { |
127 |
|
LinkedList q = new LinkedList(); |
128 |
|
q.addAll(null); |
129 |
|
shouldThrow(); |
130 |
< |
} |
138 |
< |
catch (NullPointerException success) {} |
130 |
> |
} catch (NullPointerException success) {} |
131 |
|
} |
132 |
|
|
133 |
|
/** |
134 |
< |
* |
134 |
> |
* Queue contains all elements, in traversal order, of successful addAll |
135 |
|
*/ |
136 |
|
public void testAddAll5() { |
137 |
+ |
Integer[] empty = new Integer[0]; |
138 |
+ |
Integer[] ints = new Integer[SIZE]; |
139 |
+ |
for (int i = 0; i < SIZE; ++i) |
140 |
+ |
ints[i] = i; |
141 |
+ |
LinkedList q = new LinkedList(); |
142 |
+ |
assertFalse(q.addAll(Arrays.asList(empty))); |
143 |
+ |
assertTrue(q.addAll(Arrays.asList(ints))); |
144 |
+ |
for (int i = 0; i < SIZE; ++i) |
145 |
+ |
assertEquals(ints[i], q.poll()); |
146 |
+ |
} |
147 |
+ |
|
148 |
+ |
/** |
149 |
+ |
* addAll with too large an index throws IOOBE |
150 |
+ |
*/ |
151 |
+ |
public void testAddAll2_IndexOutOfBoundsException() { |
152 |
+ |
LinkedList l = new LinkedList(); |
153 |
+ |
l.add(new Object()); |
154 |
+ |
LinkedList m = new LinkedList(); |
155 |
+ |
m.add(new Object()); |
156 |
|
try { |
157 |
< |
Integer[] empty = new Integer[0]; |
158 |
< |
Integer[] ints = new Integer[SIZE]; |
159 |
< |
for (int i = 0; i < SIZE; ++i) |
149 |
< |
ints[i] = new Integer(i); |
150 |
< |
LinkedList q = new LinkedList(); |
151 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
152 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
153 |
< |
for (int i = 0; i < SIZE; ++i) |
154 |
< |
assertEquals(ints[i], q.poll()); |
155 |
< |
} |
156 |
< |
finally {} |
157 |
> |
l.addAll(4,m); |
158 |
> |
shouldThrow(); |
159 |
> |
} catch (IndexOutOfBoundsException success) {} |
160 |
|
} |
161 |
|
|
162 |
|
/** |
163 |
< |
* |
163 |
> |
* addAll with negative index throws IOOBE |
164 |
> |
*/ |
165 |
> |
public void testAddAll4_BadIndex() { |
166 |
> |
LinkedList l = new LinkedList(); |
167 |
> |
l.add(new Object()); |
168 |
> |
LinkedList m = new LinkedList(); |
169 |
> |
m.add(new Object()); |
170 |
> |
try { |
171 |
> |
l.addAll(-1,m); |
172 |
> |
shouldThrow(); |
173 |
> |
} catch (IndexOutOfBoundsException success) {} |
174 |
> |
} |
175 |
> |
|
176 |
> |
/** |
177 |
> |
* poll succeeds unless empty |
178 |
|
*/ |
179 |
|
public void testPoll() { |
180 |
|
LinkedList q = populatedQueue(SIZE); |
181 |
|
for (int i = 0; i < SIZE; ++i) { |
182 |
< |
assertEquals(i, ((Integer)q.poll()).intValue()); |
182 |
> |
assertEquals(i, q.poll()); |
183 |
|
} |
184 |
< |
assertNull(q.poll()); |
184 |
> |
assertNull(q.poll()); |
185 |
|
} |
186 |
|
|
187 |
|
/** |
188 |
< |
* |
188 |
> |
* peek returns next element, or null if empty |
189 |
|
*/ |
190 |
|
public void testPeek() { |
191 |
|
LinkedList q = populatedQueue(SIZE); |
192 |
|
for (int i = 0; i < SIZE; ++i) { |
193 |
< |
assertEquals(i, ((Integer)q.peek()).intValue()); |
194 |
< |
q.poll(); |
193 |
> |
assertEquals(i, q.peek()); |
194 |
> |
assertEquals(i, q.poll()); |
195 |
|
assertTrue(q.peek() == null || |
196 |
< |
i != ((Integer)q.peek()).intValue()); |
196 |
> |
!q.peek().equals(i)); |
197 |
|
} |
198 |
< |
assertNull(q.peek()); |
198 |
> |
assertNull(q.peek()); |
199 |
|
} |
200 |
|
|
201 |
|
/** |
202 |
< |
* |
202 |
> |
* element returns next element, or throws NSEE if empty |
203 |
|
*/ |
204 |
|
public void testElement() { |
205 |
|
LinkedList q = populatedQueue(SIZE); |
206 |
|
for (int i = 0; i < SIZE; ++i) { |
207 |
< |
assertEquals(i, ((Integer)q.element()).intValue()); |
208 |
< |
q.poll(); |
207 |
> |
assertEquals(i, q.element()); |
208 |
> |
assertEquals(i, q.poll()); |
209 |
|
} |
210 |
|
try { |
211 |
|
q.element(); |
212 |
|
shouldThrow(); |
213 |
< |
} |
197 |
< |
catch (NoSuchElementException success) {} |
213 |
> |
} catch (NoSuchElementException success) {} |
214 |
|
} |
215 |
|
|
216 |
|
/** |
217 |
< |
* |
217 |
> |
* remove removes next element, or throws NSEE if empty |
218 |
|
*/ |
219 |
|
public void testRemove() { |
220 |
|
LinkedList q = populatedQueue(SIZE); |
221 |
|
for (int i = 0; i < SIZE; ++i) { |
222 |
< |
assertEquals(i, ((Integer)q.remove()).intValue()); |
222 |
> |
assertEquals(i, q.remove()); |
223 |
|
} |
224 |
|
try { |
225 |
|
q.remove(); |
226 |
|
shouldThrow(); |
227 |
< |
} catch (NoSuchElementException success){ |
212 |
< |
} |
227 |
> |
} catch (NoSuchElementException success) {} |
228 |
|
} |
229 |
|
|
230 |
|
/** |
231 |
< |
* |
231 |
> |
* remove(x) removes x and returns true if present |
232 |
|
*/ |
233 |
|
public void testRemoveElement() { |
234 |
|
LinkedList q = populatedQueue(SIZE); |
241 |
|
} |
242 |
|
assertTrue(q.isEmpty()); |
243 |
|
} |
244 |
< |
|
244 |
> |
|
245 |
|
/** |
246 |
< |
* |
246 |
> |
* contains(x) reports true when elements added but not yet removed |
247 |
|
*/ |
248 |
|
public void testContains() { |
249 |
|
LinkedList q = populatedQueue(SIZE); |
255 |
|
} |
256 |
|
|
257 |
|
/** |
258 |
< |
* |
258 |
> |
* clear removes all elements |
259 |
|
*/ |
260 |
|
public void testClear() { |
261 |
|
LinkedList q = populatedQueue(SIZE); |
262 |
|
q.clear(); |
263 |
|
assertTrue(q.isEmpty()); |
264 |
|
assertEquals(0, q.size()); |
265 |
< |
q.add(new Integer(1)); |
265 |
> |
assertTrue(q.add(new Integer(1))); |
266 |
|
assertFalse(q.isEmpty()); |
267 |
|
q.clear(); |
268 |
|
assertTrue(q.isEmpty()); |
269 |
|
} |
270 |
|
|
271 |
|
/** |
272 |
< |
* |
272 |
> |
* containsAll(c) is true when c contains a subset of elements |
273 |
|
*/ |
274 |
|
public void testContainsAll() { |
275 |
|
LinkedList q = populatedQueue(SIZE); |
277 |
|
for (int i = 0; i < SIZE; ++i) { |
278 |
|
assertTrue(q.containsAll(p)); |
279 |
|
assertFalse(p.containsAll(q)); |
280 |
< |
p.add(new Integer(i)); |
280 |
> |
assertTrue(p.add(new Integer(i))); |
281 |
|
} |
282 |
|
assertTrue(p.containsAll(q)); |
283 |
|
} |
284 |
|
|
285 |
|
/** |
286 |
< |
* |
286 |
> |
* retainAll(c) retains only those elements of c and reports true if changed |
287 |
|
*/ |
288 |
|
public void testRetainAll() { |
289 |
|
LinkedList q = populatedQueue(SIZE); |
302 |
|
} |
303 |
|
|
304 |
|
/** |
305 |
< |
* |
305 |
> |
* removeAll(c) removes only those elements of c and reports true if changed |
306 |
|
*/ |
307 |
|
public void testRemoveAll() { |
308 |
|
for (int i = 1; i < SIZE; ++i) { |
318 |
|
} |
319 |
|
|
320 |
|
/** |
321 |
< |
* |
321 |
> |
* toArray contains all elements in FIFO order |
322 |
|
*/ |
323 |
|
public void testToArray() { |
324 |
|
LinkedList q = populatedQueue(SIZE); |
325 |
< |
Object[] o = q.toArray(); |
326 |
< |
Arrays.sort(o); |
327 |
< |
for(int i = 0; i < o.length; i++) |
313 |
< |
assertEquals(o[i], q.poll()); |
325 |
> |
Object[] o = q.toArray(); |
326 |
> |
for (int i = 0; i < o.length; i++) |
327 |
> |
assertSame(o[i], q.poll()); |
328 |
|
} |
329 |
|
|
330 |
|
/** |
331 |
< |
* |
331 |
> |
* toArray(a) contains all elements in FIFO order |
332 |
|
*/ |
333 |
|
public void testToArray2() { |
334 |
|
LinkedList q = populatedQueue(SIZE); |
335 |
< |
Integer[] ints = new Integer[SIZE]; |
336 |
< |
ints = (Integer[])q.toArray(ints); |
337 |
< |
Arrays.sort(ints); |
338 |
< |
for(int i = 0; i < ints.length; i++) |
339 |
< |
assertEquals(ints[i], q.poll()); |
335 |
> |
Integer[] ints = new Integer[SIZE]; |
336 |
> |
assertSame(ints, q.toArray(ints)); |
337 |
> |
for (int i = 0; i < ints.length; i++) |
338 |
> |
assertSame(ints[i], q.poll()); |
339 |
> |
} |
340 |
> |
|
341 |
> |
/** |
342 |
> |
* toArray(null) throws NullPointerException |
343 |
> |
*/ |
344 |
> |
public void testToArray_NullArg() { |
345 |
> |
LinkedList l = new LinkedList(); |
346 |
> |
l.add(new Object()); |
347 |
> |
try { |
348 |
> |
l.toArray(null); |
349 |
> |
shouldThrow(); |
350 |
> |
} catch (NullPointerException success) {} |
351 |
> |
} |
352 |
> |
|
353 |
> |
/** |
354 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
355 |
> |
*/ |
356 |
> |
public void testToArray1_BadArg() { |
357 |
> |
LinkedList l = new LinkedList(); |
358 |
> |
l.add(new Integer(5)); |
359 |
> |
try { |
360 |
> |
l.toArray(new String[10]); |
361 |
> |
shouldThrow(); |
362 |
> |
} catch (ArrayStoreException success) {} |
363 |
|
} |
364 |
< |
|
364 |
> |
|
365 |
|
/** |
366 |
< |
* |
366 |
> |
* iterator iterates through all elements |
367 |
|
*/ |
368 |
|
public void testIterator() { |
369 |
|
LinkedList q = populatedQueue(SIZE); |
370 |
|
int i = 0; |
371 |
< |
Iterator it = q.iterator(); |
372 |
< |
while(it.hasNext()) { |
371 |
> |
Iterator it = q.iterator(); |
372 |
> |
while (it.hasNext()) { |
373 |
|
assertTrue(q.contains(it.next())); |
374 |
|
++i; |
375 |
|
} |
377 |
|
} |
378 |
|
|
379 |
|
/** |
380 |
< |
* |
380 |
> |
* iterator ordering is FIFO |
381 |
|
*/ |
382 |
|
public void testIteratorOrdering() { |
346 |
– |
|
383 |
|
final LinkedList q = new LinkedList(); |
348 |
– |
|
384 |
|
q.add(new Integer(1)); |
385 |
|
q.add(new Integer(2)); |
386 |
|
q.add(new Integer(3)); |
352 |
– |
|
387 |
|
int k = 0; |
388 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
389 |
< |
int i = ((Integer)(it.next())).intValue(); |
356 |
< |
assertEquals(++k, i); |
389 |
> |
assertEquals(++k, it.next()); |
390 |
|
} |
391 |
|
|
392 |
|
assertEquals(3, k); |
393 |
|
} |
394 |
|
|
395 |
|
/** |
396 |
< |
* |
396 |
> |
* iterator.remove removes current element |
397 |
|
*/ |
398 |
< |
public void testIteratorRemove () { |
398 |
> |
public void testIteratorRemove() { |
399 |
|
final LinkedList q = new LinkedList(); |
367 |
– |
|
400 |
|
q.add(new Integer(1)); |
401 |
|
q.add(new Integer(2)); |
402 |
|
q.add(new Integer(3)); |
371 |
– |
|
403 |
|
Iterator it = q.iterator(); |
404 |
< |
it.next(); |
404 |
> |
assertEquals(it.next(), 1); |
405 |
|
it.remove(); |
375 |
– |
|
406 |
|
it = q.iterator(); |
407 |
< |
assertEquals(it.next(), new Integer(2)); |
408 |
< |
assertEquals(it.next(), new Integer(3)); |
407 |
> |
assertEquals(it.next(), 2); |
408 |
> |
assertEquals(it.next(), 3); |
409 |
|
assertFalse(it.hasNext()); |
410 |
|
} |
411 |
|
|
382 |
– |
|
412 |
|
/** |
413 |
< |
* |
413 |
> |
* Descending iterator iterates through all elements |
414 |
|
*/ |
415 |
< |
public void testToString() { |
415 |
> |
public void testDescendingIterator() { |
416 |
|
LinkedList q = populatedQueue(SIZE); |
417 |
< |
String s = q.toString(); |
418 |
< |
for (int i = 0; i < SIZE; ++i) { |
419 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
417 |
> |
int i = 0; |
418 |
> |
Iterator it = q.descendingIterator(); |
419 |
> |
while (it.hasNext()) { |
420 |
> |
assertTrue(q.contains(it.next())); |
421 |
> |
++i; |
422 |
|
} |
423 |
< |
} |
424 |
< |
|
425 |
< |
/** |
426 |
< |
* |
427 |
< |
*/ |
428 |
< |
public void testAddFirst() { |
398 |
< |
LinkedList q = populatedQueue(3); |
399 |
< |
q.addFirst(new Integer(4)); |
400 |
< |
assertEquals(new Integer(4),q.get(0)); |
401 |
< |
} |
402 |
< |
|
403 |
< |
/** |
404 |
< |
* |
405 |
< |
*/ |
406 |
< |
public void testAddLast() { |
407 |
< |
LinkedList q = populatedQueue(3); |
408 |
< |
q.addLast(new Integer(3)); |
409 |
< |
assertEquals(new Integer(3),q.get(3)); |
410 |
< |
} |
411 |
< |
|
412 |
< |
/** |
413 |
< |
* |
414 |
< |
*/ |
415 |
< |
public void testGetFirst() { |
416 |
< |
LinkedList q = populatedQueue(3); |
417 |
< |
assertEquals(new Integer(0),q.getFirst()); |
418 |
< |
} |
419 |
< |
|
420 |
< |
/** |
421 |
< |
* |
422 |
< |
*/ |
423 |
< |
public void testGetLast() { |
424 |
< |
LinkedList q = populatedQueue(3); |
425 |
< |
assertEquals(new Integer(2),q.getLast()); |
426 |
< |
} |
427 |
< |
|
428 |
< |
/** |
429 |
< |
* |
430 |
< |
*/ |
431 |
< |
public void testIndexOf() { |
432 |
< |
LinkedList q = populatedQueue(3); |
433 |
< |
assertEquals(0,q.indexOf(new Integer(0))); |
434 |
< |
assertEquals(1,q.indexOf(new Integer(1))); |
435 |
< |
assertEquals(2,q.indexOf(new Integer(2))); |
436 |
< |
assertEquals(-1, q.indexOf("not there")); |
423 |
> |
assertEquals(i, SIZE); |
424 |
> |
assertFalse(it.hasNext()); |
425 |
> |
try { |
426 |
> |
it.next(); |
427 |
> |
shouldThrow(); |
428 |
> |
} catch (NoSuchElementException success) {} |
429 |
|
} |
430 |
|
|
431 |
|
/** |
432 |
< |
* |
432 |
> |
* Descending iterator ordering is reverse FIFO |
433 |
|
*/ |
434 |
< |
public void testLastIndexOf() { |
435 |
< |
LinkedList q = populatedQueue(3); |
434 |
> |
public void testDescendingIteratorOrdering() { |
435 |
> |
final LinkedList q = new LinkedList(); |
436 |
> |
q.add(new Integer(3)); |
437 |
|
q.add(new Integer(2)); |
438 |
< |
assertEquals(3,q.lastIndexOf(new Integer(2))); |
439 |
< |
assertEquals(-1, q.lastIndexOf("not there")); |
440 |
< |
} |
441 |
< |
|
442 |
< |
/** |
450 |
< |
* |
451 |
< |
*/ |
452 |
< |
public void testSet() { |
453 |
< |
LinkedList q = populatedQueue(3); |
454 |
< |
q.set(0,(new Integer(1))); |
455 |
< |
assertFalse(q.contains(new Integer(0))); |
456 |
< |
assertEquals(new Integer(1), q.get(0)); |
457 |
< |
} |
458 |
< |
|
438 |
> |
q.add(new Integer(1)); |
439 |
> |
int k = 0; |
440 |
> |
for (Iterator it = q.descendingIterator(); it.hasNext();) { |
441 |
> |
assertEquals(++k, it.next()); |
442 |
> |
} |
443 |
|
|
444 |
< |
/** |
461 |
< |
* |
462 |
< |
*/ |
463 |
< |
public void testGetFirst_NoSuchElementException() { |
464 |
< |
try { |
465 |
< |
LinkedList l = new LinkedList(); |
466 |
< |
l.getFirst(); |
467 |
< |
shouldThrow(); |
468 |
< |
} |
469 |
< |
catch(NoSuchElementException success) {} |
470 |
< |
} |
471 |
< |
|
472 |
< |
/** |
473 |
< |
* |
474 |
< |
*/ |
475 |
< |
public void testRemoveFirst() { |
476 |
< |
try { |
477 |
< |
LinkedList l = new LinkedList(); |
478 |
< |
l.removeFirst(); |
479 |
< |
shouldThrow(); |
480 |
< |
} |
481 |
< |
catch(NoSuchElementException success) {} |
482 |
< |
} |
483 |
< |
|
484 |
< |
/** |
485 |
< |
* |
486 |
< |
*/ |
487 |
< |
public void testRemoveLast() { |
488 |
< |
try { |
489 |
< |
LinkedList l = new LinkedList(); |
490 |
< |
l.removeLast(); |
491 |
< |
shouldThrow(); |
492 |
< |
} |
493 |
< |
catch(NoSuchElementException success) {} |
444 |
> |
assertEquals(3, k); |
445 |
|
} |
446 |
< |
|
446 |
> |
|
447 |
|
/** |
448 |
< |
* |
448 |
> |
* descendingIterator.remove removes current element |
449 |
|
*/ |
450 |
< |
public void testGetLast_NoSuchElementException() { |
451 |
< |
try { |
452 |
< |
LinkedList l = new LinkedList(); |
453 |
< |
l.getLast(); |
454 |
< |
shouldThrow(); |
455 |
< |
} |
456 |
< |
catch(NoSuchElementException success) {} |
450 |
> |
public void testDescendingIteratorRemove() { |
451 |
> |
final LinkedList q = new LinkedList(); |
452 |
> |
q.add(three); |
453 |
> |
q.add(two); |
454 |
> |
q.add(one); |
455 |
> |
Iterator it = q.descendingIterator(); |
456 |
> |
it.next(); |
457 |
> |
it.remove(); |
458 |
> |
it = q.descendingIterator(); |
459 |
> |
assertSame(it.next(), two); |
460 |
> |
assertSame(it.next(), three); |
461 |
> |
assertFalse(it.hasNext()); |
462 |
|
} |
463 |
|
|
464 |
|
|
465 |
|
/** |
466 |
< |
* |
511 |
< |
*/ |
512 |
< |
public void testAddAll_NullPointerException() { |
513 |
< |
try { |
514 |
< |
LinkedList l = new LinkedList(); |
515 |
< |
l.addAll((Collection)null); |
516 |
< |
shouldThrow(); |
517 |
< |
} |
518 |
< |
catch(NullPointerException success){} |
519 |
< |
} |
520 |
< |
|
521 |
< |
|
522 |
< |
/** |
523 |
< |
* |
466 |
> |
* toString contains toStrings of elements |
467 |
|
*/ |
468 |
< |
public void testAddAll1_OutOfBounds() { |
469 |
< |
try { |
470 |
< |
LinkedList l = new LinkedList(); |
471 |
< |
l.addAll(4,new LinkedList()); |
472 |
< |
shouldThrow(); |
473 |
< |
} |
531 |
< |
catch(IndexOutOfBoundsException success) {} |
468 |
> |
public void testToString() { |
469 |
> |
LinkedList q = populatedQueue(SIZE); |
470 |
> |
String s = q.toString(); |
471 |
> |
for (int i = 0; i < SIZE; ++i) { |
472 |
> |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
473 |
> |
} |
474 |
|
} |
475 |
< |
|
534 |
< |
|
475 |
> |
|
476 |
|
/** |
477 |
< |
* |
477 |
> |
* peek returns element inserted with addFirst |
478 |
|
*/ |
479 |
< |
public void testAddAll2_IndexOutOfBoundsException() { |
480 |
< |
try { |
481 |
< |
LinkedList l = new LinkedList(); |
482 |
< |
l.add(new Object()); |
542 |
< |
LinkedList m = new LinkedList(); |
543 |
< |
m.add(new Object()); |
544 |
< |
l.addAll(4,m); |
545 |
< |
shouldThrow(); |
546 |
< |
} catch(IndexOutOfBoundsException success) {} |
479 |
> |
public void testAddFirst() { |
480 |
> |
LinkedList q = populatedQueue(3); |
481 |
> |
q.addFirst(four); |
482 |
> |
assertSame(four, q.peek()); |
483 |
|
} |
484 |
|
|
485 |
|
/** |
486 |
< |
* |
486 |
> |
* peekFirst returns element inserted with push |
487 |
|
*/ |
488 |
< |
public void testAddAll4_BadIndex() { |
489 |
< |
try { |
490 |
< |
LinkedList l = new LinkedList(); |
491 |
< |
l.add(new Object()); |
556 |
< |
LinkedList m = new LinkedList(); |
557 |
< |
m.add(new Object()); |
558 |
< |
l.addAll(-1,m); |
559 |
< |
shouldThrow(); |
560 |
< |
} catch(IndexOutOfBoundsException success){} |
488 |
> |
public void testPush() { |
489 |
> |
LinkedList q = populatedQueue(3); |
490 |
> |
q.push(four); |
491 |
> |
assertSame(four, q.peekFirst()); |
492 |
|
} |
493 |
|
|
494 |
|
/** |
495 |
< |
* |
495 |
> |
* pop removes next element, or throws NSEE if empty |
496 |
|
*/ |
497 |
< |
public void testget1() { |
498 |
< |
try { |
499 |
< |
LinkedList l = new LinkedList(); |
500 |
< |
l.add(new Object()); |
501 |
< |
l.get(-1); |
502 |
< |
shouldThrow(); |
503 |
< |
} catch(IndexOutOfBoundsException success) {} |
497 |
> |
public void testPop() { |
498 |
> |
LinkedList q = populatedQueue(SIZE); |
499 |
> |
for (int i = 0; i < SIZE; ++i) { |
500 |
> |
assertEquals(i, q.pop()); |
501 |
> |
} |
502 |
> |
try { |
503 |
> |
q.pop(); |
504 |
> |
shouldThrow(); |
505 |
> |
} catch (NoSuchElementException success) {} |
506 |
|
} |
507 |
|
|
508 |
|
/** |
509 |
< |
* |
509 |
> |
* OfferFirst succeeds |
510 |
|
*/ |
511 |
< |
public void testget2() { |
512 |
< |
try { |
513 |
< |
LinkedList l = new LinkedList(); |
514 |
< |
l.add(new Object()); |
582 |
< |
l.get(5); |
583 |
< |
shouldThrow(); |
584 |
< |
} catch(IndexOutOfBoundsException success){} |
511 |
> |
public void testOfferFirst() { |
512 |
> |
LinkedList q = new LinkedList(); |
513 |
> |
assertTrue(q.offerFirst(new Integer(0))); |
514 |
> |
assertTrue(q.offerFirst(new Integer(1))); |
515 |
|
} |
516 |
|
|
517 |
|
/** |
518 |
< |
* |
518 |
> |
* OfferLast succeeds |
519 |
|
*/ |
520 |
< |
public void testset1() { |
521 |
< |
try { |
522 |
< |
LinkedList l = new LinkedList(); |
523 |
< |
l.add(new Object()); |
594 |
< |
l.set(-1,new Object()); |
595 |
< |
shouldThrow(); |
596 |
< |
} catch(IndexOutOfBoundsException success){} |
520 |
> |
public void testOfferLast() { |
521 |
> |
LinkedList q = new LinkedList(); |
522 |
> |
assertTrue(q.offerLast(new Integer(0))); |
523 |
> |
assertTrue(q.offerLast(new Integer(1))); |
524 |
|
} |
525 |
|
|
526 |
|
/** |
527 |
< |
* |
527 |
> |
* pollLast succeeds unless empty |
528 |
|
*/ |
529 |
< |
public void testset2() { |
530 |
< |
try { |
531 |
< |
LinkedList l = new LinkedList(); |
532 |
< |
l.add(new Object()); |
533 |
< |
l.set(5,new Object()); |
534 |
< |
shouldThrow(); |
608 |
< |
} catch(IndexOutOfBoundsException success){} |
529 |
> |
public void testPollLast() { |
530 |
> |
LinkedList q = populatedQueue(SIZE); |
531 |
> |
for (int i = SIZE-1; i >= 0; --i) { |
532 |
> |
assertEquals(i, q.pollLast()); |
533 |
> |
} |
534 |
> |
assertNull(q.pollLast()); |
535 |
|
} |
536 |
|
|
537 |
|
/** |
538 |
< |
* |
538 |
> |
* peekFirst returns next element, or null if empty |
539 |
|
*/ |
540 |
< |
public void testadd1() { |
541 |
< |
try { |
542 |
< |
LinkedList l = new LinkedList(); |
543 |
< |
l.add(new Object()); |
544 |
< |
l.add(-1,new Object()); |
545 |
< |
shouldThrow(); |
546 |
< |
} catch(IndexOutOfBoundsException success){} |
540 |
> |
public void testPeekFirst() { |
541 |
> |
LinkedList q = populatedQueue(SIZE); |
542 |
> |
for (int i = 0; i < SIZE; ++i) { |
543 |
> |
assertEquals(i, q.peekFirst()); |
544 |
> |
assertEquals(i, q.pollFirst()); |
545 |
> |
assertTrue(q.peekFirst() == null || |
546 |
> |
!q.peekFirst().equals(i)); |
547 |
> |
} |
548 |
> |
assertNull(q.peekFirst()); |
549 |
|
} |
550 |
|
|
623 |
– |
public void add2() { |
624 |
– |
try { |
625 |
– |
LinkedList l = new LinkedList(); |
626 |
– |
l.add(new Object()); |
627 |
– |
l.add(5,new Object()); |
628 |
– |
shouldThrow(); |
629 |
– |
} catch(IndexOutOfBoundsException success) {} |
630 |
– |
} |
551 |
|
|
552 |
|
/** |
553 |
< |
* |
553 |
> |
* peekLast returns next element, or null if empty |
554 |
|
*/ |
555 |
< |
public void testremove() { |
556 |
< |
try { |
557 |
< |
LinkedList l = new LinkedList(); |
558 |
< |
l.add(new Object()); |
559 |
< |
l.remove(-1); |
560 |
< |
shouldThrow(); |
561 |
< |
} catch(IndexOutOfBoundsException success){} |
562 |
< |
} |
563 |
< |
|
644 |
< |
/** |
645 |
< |
* |
646 |
< |
*/ |
647 |
< |
public void testremove1() { |
648 |
< |
try { |
649 |
< |
LinkedList l = new LinkedList(); |
650 |
< |
l.add(new Object()); |
651 |
< |
l.remove(5); |
652 |
< |
shouldThrow(); |
653 |
< |
} catch(IndexOutOfBoundsException success){} |
555 |
> |
public void testPeekLast() { |
556 |
> |
LinkedList q = populatedQueue(SIZE); |
557 |
> |
for (int i = SIZE-1; i >= 0; --i) { |
558 |
> |
assertEquals(i, q.peekLast()); |
559 |
> |
assertEquals(i, q.pollLast()); |
560 |
> |
assertTrue(q.peekLast() == null || |
561 |
> |
!q.peekLast().equals(i)); |
562 |
> |
} |
563 |
> |
assertNull(q.peekLast()); |
564 |
|
} |
565 |
|
|
566 |
< |
|
567 |
< |
/** |
568 |
< |
* |
569 |
< |
*/ |
570 |
< |
public void testremove2() { |
566 |
> |
public void testFirstElement() { |
567 |
> |
LinkedList q = populatedQueue(SIZE); |
568 |
> |
for (int i = 0; i < SIZE; ++i) { |
569 |
> |
assertEquals(i, q.getFirst()); |
570 |
> |
assertEquals(i, q.pollFirst()); |
571 |
> |
} |
572 |
|
try { |
573 |
< |
LinkedList l = new LinkedList(); |
663 |
< |
l.remove(); |
573 |
> |
q.getFirst(); |
574 |
|
shouldThrow(); |
575 |
< |
} catch(NoSuchElementException e){} |
575 |
> |
} catch (NoSuchElementException success) {} |
576 |
|
} |
577 |
|
|
578 |
|
/** |
579 |
< |
* |
670 |
< |
*/ |
671 |
< |
public void testlistIt1() { |
672 |
< |
try { |
673 |
< |
LinkedList l = new LinkedList(); |
674 |
< |
l.add(new Object()); |
675 |
< |
l.listIterator(5); |
676 |
< |
shouldThrow(); |
677 |
< |
} catch(IndexOutOfBoundsException success){} |
678 |
< |
} |
679 |
< |
|
680 |
< |
/** |
681 |
< |
* |
682 |
< |
*/ |
683 |
< |
public void testlistIt2() { |
684 |
< |
try { |
685 |
< |
LinkedList l = new LinkedList(); |
686 |
< |
l.add(new Object()); |
687 |
< |
l.listIterator(-1); |
688 |
< |
shouldThrow(); |
689 |
< |
} catch(IndexOutOfBoundsException success){} |
690 |
< |
} |
691 |
< |
|
692 |
< |
/** |
693 |
< |
* |
579 |
> |
* getLast returns next element, or throws NSEE if empty |
580 |
|
*/ |
581 |
< |
public void testlistIt3() { |
582 |
< |
try { |
583 |
< |
LinkedList l = new LinkedList(); |
584 |
< |
l.add(new Object()); |
585 |
< |
ListIterator a = l.listIterator(0); |
586 |
< |
l.removeFirst(); |
587 |
< |
a.next(); |
588 |
< |
shouldThrow(); |
589 |
< |
} catch(ConcurrentModificationException success){} |
581 |
> |
public void testLastElement() { |
582 |
> |
LinkedList q = populatedQueue(SIZE); |
583 |
> |
for (int i = SIZE-1; i >= 0; --i) { |
584 |
> |
assertEquals(i, q.getLast()); |
585 |
> |
assertEquals(i, q.pollLast()); |
586 |
> |
} |
587 |
> |
try { |
588 |
> |
q.getLast(); |
589 |
> |
shouldThrow(); |
590 |
> |
} catch (NoSuchElementException success) {} |
591 |
> |
assertNull(q.peekLast()); |
592 |
|
} |
593 |
|
|
594 |
|
/** |
595 |
< |
* |
595 |
> |
* removeFirstOccurrence(x) removes x and returns true if present |
596 |
|
*/ |
597 |
< |
public void testToArray_BadArg() { |
598 |
< |
try { |
599 |
< |
LinkedList l = new LinkedList(); |
600 |
< |
l.add(new Object()); |
601 |
< |
Object o[] = l.toArray(null); |
602 |
< |
shouldThrow(); |
603 |
< |
} catch(NullPointerException success){} |
597 |
> |
public void testRemoveFirstOccurrence() { |
598 |
> |
LinkedList q = populatedQueue(SIZE); |
599 |
> |
for (int i = 1; i < SIZE; i+=2) { |
600 |
> |
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
601 |
> |
} |
602 |
> |
for (int i = 0; i < SIZE; i+=2) { |
603 |
> |
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
604 |
> |
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
605 |
> |
} |
606 |
> |
assertTrue(q.isEmpty()); |
607 |
|
} |
608 |
|
|
609 |
|
/** |
610 |
< |
* |
610 |
> |
* removeLastOccurrence(x) removes x and returns true if present |
611 |
|
*/ |
612 |
< |
public void testToArray1_BadArg() { |
613 |
< |
try { |
614 |
< |
LinkedList l = new LinkedList(); |
615 |
< |
l.add(new Integer(5)); |
616 |
< |
Object o[] = l.toArray(new String[10] ); |
617 |
< |
shouldThrow(); |
618 |
< |
} catch(ArrayStoreException success){} |
612 |
> |
public void testRemoveLastOccurrence() { |
613 |
> |
LinkedList q = populatedQueue(SIZE); |
614 |
> |
for (int i = 1; i < SIZE; i+=2) { |
615 |
> |
assertTrue(q.removeLastOccurrence(new Integer(i))); |
616 |
> |
} |
617 |
> |
for (int i = 0; i < SIZE; i+=2) { |
618 |
> |
assertTrue(q.removeLastOccurrence(new Integer(i))); |
619 |
> |
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
620 |
> |
} |
621 |
> |
assertTrue(q.isEmpty()); |
622 |
|
} |
623 |
|
|
624 |
|
} |