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 |
|
import junit.framework.TestSuite; |
17 |
|
|
18 |
public class LinkedListTest extends JSR166TestCase { |
public class LinkedListTest extends JSR166TestCase { |
19 |
public static void main(String[] args) { |
public static void main(String[] args) { |
20 |
junit.textui.TestRunner.run(suite()); |
main(suite(), args); |
21 |
} |
} |
22 |
|
|
23 |
public static Test suite() { |
public static Test suite() { |
25 |
} |
} |
26 |
|
|
27 |
/** |
/** |
28 |
* Create a queue of given size containing consecutive |
* Returns a new queue of given size containing consecutive |
29 |
* Integers 0 ... n. |
* Integers 0 ... n - 1. |
30 |
*/ |
*/ |
31 |
private LinkedList populatedQueue(int n) { |
private LinkedList<Integer> populatedQueue(int n) { |
32 |
LinkedList q = new LinkedList(); |
LinkedList<Integer> q = new LinkedList<Integer>(); |
33 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
34 |
for (int i = 0; i < n; ++i) |
for (int i = 0; i < n; ++i) |
35 |
assertTrue(q.offer(new Integer(i))); |
assertTrue(q.offer(new Integer(i))); |
36 |
assertFalse(q.isEmpty()); |
assertFalse(q.isEmpty()); |
37 |
assertEquals(n, q.size()); |
assertEquals(n, q.size()); |
38 |
|
assertEquals((Integer) 0, q.peekFirst()); |
39 |
|
assertEquals((Integer) (n - 1), q.peekLast()); |
40 |
return q; |
return q; |
41 |
} |
} |
42 |
|
|
52 |
*/ |
*/ |
53 |
public void testConstructor3() { |
public void testConstructor3() { |
54 |
try { |
try { |
55 |
LinkedList q = new LinkedList((Collection)null); |
new LinkedList((Collection)null); |
56 |
shouldThrow(); |
shouldThrow(); |
57 |
} catch (NullPointerException success) {} |
} catch (NullPointerException success) {} |
58 |
} |
} |
104 |
public void testOfferNull() { |
public void testOfferNull() { |
105 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
106 |
q.offer(null); |
q.offer(null); |
107 |
|
assertNull(q.get(0)); |
108 |
|
assertTrue(q.contains(null)); |
109 |
} |
} |
110 |
|
|
111 |
/** |
/** |
132 |
* addAll(null) throws NPE |
* addAll(null) throws NPE |
133 |
*/ |
*/ |
134 |
public void testAddAll1() { |
public void testAddAll1() { |
|
try { |
|
135 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
136 |
|
try { |
137 |
q.addAll(null); |
q.addAll(null); |
138 |
shouldThrow(); |
shouldThrow(); |
139 |
} catch (NullPointerException success) {} |
} catch (NullPointerException success) {} |
242 |
public void testRemoveElement() { |
public void testRemoveElement() { |
243 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
244 |
for (int i = 1; i < SIZE; i+=2) { |
for (int i = 1; i < SIZE; i+=2) { |
245 |
assertTrue(q.remove(new Integer(i))); |
assertTrue(q.contains(i)); |
246 |
|
assertTrue(q.remove((Integer)i)); |
247 |
|
assertFalse(q.contains(i)); |
248 |
|
assertTrue(q.contains(i - 1)); |
249 |
} |
} |
250 |
for (int i = 0; i < SIZE; i+=2) { |
for (int i = 0; i < SIZE; i+=2) { |
251 |
assertTrue(q.remove(new Integer(i))); |
assertTrue(q.contains(i)); |
252 |
assertFalse(q.remove(new Integer(i+1))); |
assertTrue(q.remove((Integer)i)); |
253 |
|
assertFalse(q.contains(i)); |
254 |
|
assertFalse(q.remove((Integer)(i + 1))); |
255 |
|
assertFalse(q.contains(i + 1)); |
256 |
} |
} |
257 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
258 |
} |
} |
326 |
assertTrue(q.removeAll(p)); |
assertTrue(q.removeAll(p)); |
327 |
assertEquals(SIZE-i, q.size()); |
assertEquals(SIZE-i, q.size()); |
328 |
for (int j = 0; j < i; ++j) { |
for (int j = 0; j < i; ++j) { |
329 |
Integer I = (Integer)(p.remove()); |
Integer x = (Integer)(p.remove()); |
330 |
assertFalse(q.contains(I)); |
assertFalse(q.contains(x)); |
331 |
} |
} |
332 |
} |
} |
333 |
} |
} |
334 |
|
|
335 |
/** |
/** |
336 |
* toArray contains all elements |
* toArray contains all elements in FIFO order |
337 |
*/ |
*/ |
338 |
public void testToArray() { |
public void testToArray() { |
339 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
340 |
Object[] o = q.toArray(); |
Object[] o = q.toArray(); |
|
Arrays.sort(o); |
|
341 |
for (int i = 0; i < o.length; i++) |
for (int i = 0; i < o.length; i++) |
342 |
assertEquals(o[i], q.poll()); |
assertSame(o[i], q.poll()); |
343 |
} |
} |
344 |
|
|
345 |
/** |
/** |
346 |
* toArray(a) contains all elements |
* toArray(a) contains all elements in FIFO order |
347 |
*/ |
*/ |
348 |
public void testToArray2() { |
public void testToArray2() { |
349 |
LinkedList q = populatedQueue(SIZE); |
LinkedList<Integer> q = populatedQueue(SIZE); |
350 |
Integer[] ints = new Integer[SIZE]; |
Integer[] ints = new Integer[SIZE]; |
351 |
ints = (Integer[])q.toArray(ints); |
Integer[] array = q.toArray(ints); |
352 |
Arrays.sort(ints); |
assertSame(ints, array); |
353 |
for (int i = 0; i < ints.length; i++) |
for (int i = 0; i < ints.length; i++) |
354 |
assertEquals(ints[i], q.poll()); |
assertSame(ints[i], q.poll()); |
355 |
} |
} |
356 |
|
|
357 |
/** |
/** |
383 |
*/ |
*/ |
384 |
public void testIterator() { |
public void testIterator() { |
385 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
|
int i = 0; |
|
386 |
Iterator it = q.iterator(); |
Iterator it = q.iterator(); |
387 |
while (it.hasNext()) { |
int i; |
388 |
|
for (i = 0; it.hasNext(); i++) |
389 |
assertTrue(q.contains(it.next())); |
assertTrue(q.contains(it.next())); |
|
++i; |
|
|
} |
|
390 |
assertEquals(i, SIZE); |
assertEquals(i, SIZE); |
391 |
|
assertIteratorExhausted(it); |
392 |
|
} |
393 |
|
|
394 |
|
/** |
395 |
|
* iterator of empty collection has no elements |
396 |
|
*/ |
397 |
|
public void testEmptyIterator() { |
398 |
|
assertIteratorExhausted(new LinkedList().iterator()); |
399 |
} |
} |
400 |
|
|
401 |
/** |
/** |
423 |
q.add(new Integer(2)); |
q.add(new Integer(2)); |
424 |
q.add(new Integer(3)); |
q.add(new Integer(3)); |
425 |
Iterator it = q.iterator(); |
Iterator it = q.iterator(); |
426 |
assertEquals(it.next(), 1); |
assertEquals(1, it.next()); |
427 |
it.remove(); |
it.remove(); |
428 |
it = q.iterator(); |
it = q.iterator(); |
429 |
assertEquals(it.next(), 2); |
assertEquals(2, it.next()); |
430 |
assertEquals(it.next(), 3); |
assertEquals(3, it.next()); |
431 |
assertFalse(it.hasNext()); |
assertFalse(it.hasNext()); |
432 |
} |
} |
433 |
|
|
483 |
assertFalse(it.hasNext()); |
assertFalse(it.hasNext()); |
484 |
} |
} |
485 |
|
|
|
|
|
486 |
/** |
/** |
487 |
* toString contains toStrings of elements |
* toString contains toStrings of elements |
488 |
*/ |
*/ |
490 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
491 |
String s = q.toString(); |
String s = q.toString(); |
492 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
493 |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
assertTrue(s.contains(String.valueOf(i))); |
494 |
} |
} |
495 |
} |
} |
496 |
|
|
569 |
assertNull(q.peekFirst()); |
assertNull(q.peekFirst()); |
570 |
} |
} |
571 |
|
|
|
|
|
572 |
/** |
/** |
573 |
* peekLast returns next element, or null if empty |
* peekLast returns next element, or null if empty |
574 |
*/ |
*/ |