1 |
/* |
/* |
2 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
* Expert Group and released to the public domain, as explained at |
* Expert Group and released to the public domain, as explained at |
4 |
* http://creativecommons.org/licenses/publicdomain |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
* Pat Fisher, Mike Judd. |
* Pat Fisher, Mike Judd. |
7 |
*/ |
*/ |
8 |
|
|
9 |
import junit.framework.*; |
import java.util.Arrays; |
10 |
import java.util.*; |
import java.util.Collection; |
11 |
import java.util.concurrent.*; |
import java.util.Iterator; |
12 |
|
import java.util.LinkedList; |
13 |
|
import java.util.NoSuchElementException; |
14 |
|
|
15 |
|
import junit.framework.Test; |
16 |
|
|
17 |
public class LinkedListTest extends JSR166TestCase { |
public class LinkedListTest extends JSR166TestCase { |
18 |
public static void main(String[] args) { |
public static void main(String[] args) { |
19 |
junit.textui.TestRunner.run(suite()); |
main(suite(), args); |
20 |
} |
} |
21 |
|
|
22 |
public static Test suite() { |
public static Test suite() { |
23 |
return new TestSuite(LinkedListTest.class); |
class Implementation implements CollectionImplementation { |
24 |
|
public Class<?> klazz() { return LinkedList.class; } |
25 |
|
public Collection emptyCollection() { return new LinkedList(); } |
26 |
|
public Object makeElement(int i) { return i; } |
27 |
|
public boolean isConcurrent() { return false; } |
28 |
|
public boolean permitsNulls() { return true; } |
29 |
|
} |
30 |
|
class SubListImplementation extends Implementation { |
31 |
|
public Collection emptyCollection() { |
32 |
|
return new LinkedList().subList(0, 0); |
33 |
|
} |
34 |
|
} |
35 |
|
return newTestSuite( |
36 |
|
LinkedListTest.class, |
37 |
|
CollectionTest.testSuite(new Implementation()), |
38 |
|
CollectionTest.testSuite(new SubListImplementation())); |
39 |
} |
} |
40 |
|
|
41 |
/** |
/** |
42 |
* Create a queue of given size containing consecutive |
* Returns a new queue of given size containing consecutive |
43 |
* Integers 0 ... n. |
* Integers 0 ... n - 1. |
44 |
*/ |
*/ |
45 |
private LinkedList populatedQueue(int n) { |
private static LinkedList<Integer> populatedQueue(int n) { |
46 |
LinkedList q = new LinkedList(); |
LinkedList<Integer> q = new LinkedList<>(); |
47 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
48 |
for (int i = 0; i < n; ++i) |
for (int i = 0; i < n; ++i) |
49 |
assertTrue(q.offer(new Integer(i))); |
assertTrue(q.offer(new Integer(i))); |
50 |
assertFalse(q.isEmpty()); |
assertFalse(q.isEmpty()); |
51 |
assertEquals(n, q.size()); |
assertEquals(n, q.size()); |
52 |
|
assertEquals((Integer) 0, q.peekFirst()); |
53 |
|
assertEquals((Integer) (n - 1), q.peekLast()); |
54 |
return q; |
return q; |
55 |
} |
} |
56 |
|
|
66 |
*/ |
*/ |
67 |
public void testConstructor3() { |
public void testConstructor3() { |
68 |
try { |
try { |
69 |
LinkedList q = new LinkedList((Collection)null); |
new LinkedList((Collection)null); |
70 |
shouldThrow(); |
shouldThrow(); |
71 |
} catch (NullPointerException success) {} |
} catch (NullPointerException success) {} |
72 |
} |
} |
118 |
public void testOfferNull() { |
public void testOfferNull() { |
119 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
120 |
q.offer(null); |
q.offer(null); |
121 |
|
assertNull(q.get(0)); |
122 |
|
assertTrue(q.contains(null)); |
123 |
} |
} |
124 |
|
|
125 |
/** |
/** |
146 |
* addAll(null) throws NPE |
* addAll(null) throws NPE |
147 |
*/ |
*/ |
148 |
public void testAddAll1() { |
public void testAddAll1() { |
|
try { |
|
149 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
150 |
|
try { |
151 |
q.addAll(null); |
q.addAll(null); |
152 |
shouldThrow(); |
shouldThrow(); |
153 |
} catch (NullPointerException success) {} |
} catch (NullPointerException success) {} |
256 |
public void testRemoveElement() { |
public void testRemoveElement() { |
257 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
258 |
for (int i = 1; i < SIZE; i+=2) { |
for (int i = 1; i < SIZE; i+=2) { |
259 |
assertTrue(q.remove(new Integer(i))); |
assertTrue(q.contains(i)); |
260 |
|
assertTrue(q.remove((Integer)i)); |
261 |
|
assertFalse(q.contains(i)); |
262 |
|
assertTrue(q.contains(i - 1)); |
263 |
} |
} |
264 |
for (int i = 0; i < SIZE; i+=2) { |
for (int i = 0; i < SIZE; i+=2) { |
265 |
assertTrue(q.remove(new Integer(i))); |
assertTrue(q.contains(i)); |
266 |
assertFalse(q.remove(new Integer(i+1))); |
assertTrue(q.remove((Integer)i)); |
267 |
|
assertFalse(q.contains(i)); |
268 |
|
assertFalse(q.remove((Integer)(i + 1))); |
269 |
|
assertFalse(q.contains(i + 1)); |
270 |
} |
} |
271 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
272 |
} |
} |
340 |
assertTrue(q.removeAll(p)); |
assertTrue(q.removeAll(p)); |
341 |
assertEquals(SIZE-i, q.size()); |
assertEquals(SIZE-i, q.size()); |
342 |
for (int j = 0; j < i; ++j) { |
for (int j = 0; j < i; ++j) { |
343 |
Integer I = (Integer)(p.remove()); |
Integer x = (Integer)(p.remove()); |
344 |
assertFalse(q.contains(I)); |
assertFalse(q.contains(x)); |
345 |
} |
} |
346 |
} |
} |
347 |
} |
} |
348 |
|
|
349 |
/** |
/** |
350 |
* toArray contains all elements |
* toArray contains all elements in FIFO order |
351 |
*/ |
*/ |
352 |
public void testToArray() { |
public void testToArray() { |
353 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
354 |
Object[] o = q.toArray(); |
Object[] o = q.toArray(); |
|
Arrays.sort(o); |
|
355 |
for (int i = 0; i < o.length; i++) |
for (int i = 0; i < o.length; i++) |
356 |
assertEquals(o[i], q.poll()); |
assertSame(o[i], q.poll()); |
357 |
} |
} |
358 |
|
|
359 |
/** |
/** |
360 |
* toArray(a) contains all elements |
* toArray(a) contains all elements in FIFO order |
361 |
*/ |
*/ |
362 |
public void testToArray2() { |
public void testToArray2() { |
363 |
LinkedList q = populatedQueue(SIZE); |
LinkedList<Integer> q = populatedQueue(SIZE); |
364 |
Integer[] ints = new Integer[SIZE]; |
Integer[] ints = new Integer[SIZE]; |
365 |
ints = (Integer[])q.toArray(ints); |
Integer[] array = q.toArray(ints); |
366 |
Arrays.sort(ints); |
assertSame(ints, array); |
367 |
for (int i = 0; i < ints.length; i++) |
for (int i = 0; i < ints.length; i++) |
368 |
assertEquals(ints[i], q.poll()); |
assertSame(ints[i], q.poll()); |
369 |
} |
} |
370 |
|
|
371 |
/** |
/** |
372 |
* toArray(null) throws NPE |
* toArray(null) throws NullPointerException |
373 |
*/ |
*/ |
374 |
public void testToArray_BadArg() { |
public void testToArray_NullArg() { |
375 |
LinkedList l = new LinkedList(); |
LinkedList l = new LinkedList(); |
376 |
l.add(new Object()); |
l.add(new Object()); |
377 |
try { |
try { |
378 |
Object o[] = l.toArray(null); |
l.toArray(null); |
379 |
shouldThrow(); |
shouldThrow(); |
380 |
} catch (NullPointerException success) {} |
} catch (NullPointerException success) {} |
381 |
} |
} |
382 |
|
|
383 |
/** |
/** |
384 |
* toArray with incompatible array type throws CCE |
* toArray(incompatible array type) throws ArrayStoreException |
385 |
*/ |
*/ |
386 |
public void testToArray1_BadArg() { |
public void testToArray1_BadArg() { |
387 |
LinkedList l = new LinkedList(); |
LinkedList l = new LinkedList(); |
388 |
l.add(new Integer(5)); |
l.add(new Integer(5)); |
389 |
try { |
try { |
390 |
Object o[] = l.toArray(new String[10]); |
l.toArray(new String[10]); |
391 |
shouldThrow(); |
shouldThrow(); |
392 |
} catch (ArrayStoreException success) {} |
} catch (ArrayStoreException success) {} |
393 |
} |
} |
397 |
*/ |
*/ |
398 |
public void testIterator() { |
public void testIterator() { |
399 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
|
int i = 0; |
|
400 |
Iterator it = q.iterator(); |
Iterator it = q.iterator(); |
401 |
while (it.hasNext()) { |
int i; |
402 |
|
for (i = 0; it.hasNext(); i++) |
403 |
assertTrue(q.contains(it.next())); |
assertTrue(q.contains(it.next())); |
|
++i; |
|
|
} |
|
404 |
assertEquals(i, SIZE); |
assertEquals(i, SIZE); |
405 |
|
assertIteratorExhausted(it); |
406 |
|
} |
407 |
|
|
408 |
|
/** |
409 |
|
* iterator of empty collection has no elements |
410 |
|
*/ |
411 |
|
public void testEmptyIterator() { |
412 |
|
assertIteratorExhausted(new LinkedList().iterator()); |
413 |
} |
} |
414 |
|
|
415 |
/** |
/** |
437 |
q.add(new Integer(2)); |
q.add(new Integer(2)); |
438 |
q.add(new Integer(3)); |
q.add(new Integer(3)); |
439 |
Iterator it = q.iterator(); |
Iterator it = q.iterator(); |
440 |
assertEquals(it.next(), 1); |
assertEquals(1, it.next()); |
441 |
it.remove(); |
it.remove(); |
442 |
it = q.iterator(); |
it = q.iterator(); |
443 |
assertEquals(it.next(), 2); |
assertEquals(2, it.next()); |
444 |
assertEquals(it.next(), 3); |
assertEquals(3, it.next()); |
445 |
assertFalse(it.hasNext()); |
assertFalse(it.hasNext()); |
446 |
} |
} |
447 |
|
|
497 |
assertFalse(it.hasNext()); |
assertFalse(it.hasNext()); |
498 |
} |
} |
499 |
|
|
|
|
|
500 |
/** |
/** |
501 |
* toString contains toStrings of elements |
* toString contains toStrings of elements |
502 |
*/ |
*/ |
504 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
505 |
String s = q.toString(); |
String s = q.toString(); |
506 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
507 |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
assertTrue(s.contains(String.valueOf(i))); |
508 |
} |
} |
509 |
} |
} |
510 |
|
|
583 |
assertNull(q.peekFirst()); |
assertNull(q.peekFirst()); |
584 |
} |
} |
585 |
|
|
|
|
|
586 |
/** |
/** |
587 |
* peekLast returns next element, or null if empty |
* peekLast returns next element, or null if empty |
588 |
*/ |
*/ |