6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
< |
import junit.framework.*; |
10 |
< |
import java.util.*; |
11 |
< |
import java.util.concurrent.*; |
9 |
> |
import java.util.Arrays; |
10 |
> |
import java.util.Collection; |
11 |
> |
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 { |
18 |
|
public static void main(String[] args) { |
19 |
< |
junit.textui.TestRunner.run(suite()); |
19 |
> |
main(suite(), args); |
20 |
|
} |
21 |
|
|
22 |
|
public static Test suite() { |
23 |
< |
return new TestSuite(LinkedListTest.class); |
23 |
> |
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 |
43 |
< |
* Integers 0 ... n. |
42 |
> |
* Returns a new queue of given size containing consecutive |
43 |
> |
* Integers 0 ... n - 1. |
44 |
|
*/ |
45 |
|
private LinkedList<Integer> populatedQueue(int n) { |
46 |
< |
LinkedList<Integer> q = new LinkedList<Integer>(); |
46 |
> |
LinkedList<Integer> q = new LinkedList<>(); |
47 |
|
assertTrue(q.isEmpty()); |
48 |
|
for (int i = 0; i < n; ++i) |
49 |
|
assertTrue(q.offer(new Integer(i))); |
50 |
|
assertFalse(q.isEmpty()); |
51 |
|
assertEquals(n, q.size()); |
52 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
53 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
54 |
|
return q; |
55 |
|
} |
56 |
|
|
66 |
|
*/ |
67 |
|
public void testConstructor3() { |
68 |
|
try { |
69 |
< |
LinkedList q = new LinkedList((Collection)null); |
69 |
> |
new LinkedList((Collection)null); |
70 |
|
shouldThrow(); |
71 |
|
} catch (NullPointerException success) {} |
72 |
|
} |
103 |
|
public void testSize() { |
104 |
|
LinkedList q = populatedQueue(SIZE); |
105 |
|
for (int i = 0; i < SIZE; ++i) { |
106 |
< |
assertEquals(SIZE-i, q.size()); |
106 |
> |
assertEquals(SIZE - i, q.size()); |
107 |
|
q.remove(); |
108 |
|
} |
109 |
|
for (int i = 0; i < SIZE; ++i) { |
118 |
|
public void testOfferNull() { |
119 |
|
LinkedList q = new LinkedList(); |
120 |
|
q.offer(null); |
121 |
+ |
assertNull(q.get(0)); |
122 |
+ |
assertTrue(q.contains(null)); |
123 |
|
} |
124 |
|
|
125 |
|
/** |
146 |
|
* addAll(null) throws NPE |
147 |
|
*/ |
148 |
|
public void testAddAll1() { |
149 |
+ |
LinkedList q = new LinkedList(); |
150 |
|
try { |
127 |
– |
LinkedList q = new LinkedList(); |
151 |
|
q.addAll(null); |
152 |
|
shouldThrow(); |
153 |
|
} catch (NullPointerException success) {} |
255 |
|
*/ |
256 |
|
public void testRemoveElement() { |
257 |
|
LinkedList q = populatedQueue(SIZE); |
258 |
< |
for (int i = 1; i < SIZE; i+=2) { |
258 |
> |
for (int i = 1; i < SIZE; i += 2) { |
259 |
|
assertTrue(q.contains(i)); |
260 |
|
assertTrue(q.remove((Integer)i)); |
261 |
|
assertFalse(q.contains(i)); |
262 |
< |
assertTrue(q.contains(i-1)); |
262 |
> |
assertTrue(q.contains(i - 1)); |
263 |
|
} |
264 |
< |
for (int i = 0; i < SIZE; i+=2) { |
264 |
> |
for (int i = 0; i < SIZE; i += 2) { |
265 |
|
assertTrue(q.contains(i)); |
266 |
|
assertTrue(q.remove((Integer)i)); |
267 |
|
assertFalse(q.contains(i)); |
268 |
< |
assertFalse(q.remove((Integer)(i+1))); |
269 |
< |
assertFalse(q.contains(i+1)); |
268 |
> |
assertFalse(q.remove((Integer)(i + 1))); |
269 |
> |
assertFalse(q.contains(i + 1)); |
270 |
|
} |
271 |
|
assertTrue(q.isEmpty()); |
272 |
|
} |
325 |
|
assertTrue(changed); |
326 |
|
|
327 |
|
assertTrue(q.containsAll(p)); |
328 |
< |
assertEquals(SIZE-i, q.size()); |
328 |
> |
assertEquals(SIZE - i, q.size()); |
329 |
|
p.remove(); |
330 |
|
} |
331 |
|
} |
338 |
|
LinkedList q = populatedQueue(SIZE); |
339 |
|
LinkedList p = populatedQueue(i); |
340 |
|
assertTrue(q.removeAll(p)); |
341 |
< |
assertEquals(SIZE-i, q.size()); |
341 |
> |
assertEquals(SIZE - i, q.size()); |
342 |
|
for (int j = 0; j < i; ++j) { |
343 |
< |
Integer I = (Integer)(p.remove()); |
344 |
< |
assertFalse(q.contains(I)); |
343 |
> |
Integer x = (Integer)(p.remove()); |
344 |
> |
assertFalse(q.contains(x)); |
345 |
|
} |
346 |
|
} |
347 |
|
} |
397 |
|
*/ |
398 |
|
public void testIterator() { |
399 |
|
LinkedList q = populatedQueue(SIZE); |
377 |
– |
int i = 0; |
400 |
|
Iterator it = q.iterator(); |
401 |
< |
while (it.hasNext()) { |
401 |
> |
int i; |
402 |
> |
for (i = 0; it.hasNext(); i++) |
403 |
|
assertTrue(q.contains(it.next())); |
381 |
– |
++i; |
382 |
– |
} |
404 |
|
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)); |
438 |
|
q.add(new Integer(3)); |
439 |
|
Iterator it = q.iterator(); |
440 |
< |
assertEquals(it.next(), 1); |
440 |
> |
assertEquals(1, it.next()); |
441 |
|
it.remove(); |
442 |
|
it = q.iterator(); |
443 |
< |
assertEquals(it.next(), 2); |
444 |
< |
assertEquals(it.next(), 3); |
443 |
> |
assertEquals(2, it.next()); |
444 |
> |
assertEquals(3, it.next()); |
445 |
|
assertFalse(it.hasNext()); |
446 |
|
} |
447 |
|
|
563 |
|
*/ |
564 |
|
public void testPollLast() { |
565 |
|
LinkedList q = populatedQueue(SIZE); |
566 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
566 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
567 |
|
assertEquals(i, q.pollLast()); |
568 |
|
} |
569 |
|
assertNull(q.pollLast()); |
588 |
|
*/ |
589 |
|
public void testPeekLast() { |
590 |
|
LinkedList q = populatedQueue(SIZE); |
591 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
591 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
592 |
|
assertEquals(i, q.peekLast()); |
593 |
|
assertEquals(i, q.pollLast()); |
594 |
|
assertTrue(q.peekLast() == null || |
614 |
|
*/ |
615 |
|
public void testLastElement() { |
616 |
|
LinkedList q = populatedQueue(SIZE); |
617 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
617 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
618 |
|
assertEquals(i, q.getLast()); |
619 |
|
assertEquals(i, q.pollLast()); |
620 |
|
} |
630 |
|
*/ |
631 |
|
public void testRemoveFirstOccurrence() { |
632 |
|
LinkedList q = populatedQueue(SIZE); |
633 |
< |
for (int i = 1; i < SIZE; i+=2) { |
633 |
> |
for (int i = 1; i < SIZE; i += 2) { |
634 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
635 |
|
} |
636 |
< |
for (int i = 0; i < SIZE; i+=2) { |
636 |
> |
for (int i = 0; i < SIZE; i += 2) { |
637 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
638 |
< |
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
638 |
> |
assertFalse(q.removeFirstOccurrence(new Integer(i + 1))); |
639 |
|
} |
640 |
|
assertTrue(q.isEmpty()); |
641 |
|
} |
645 |
|
*/ |
646 |
|
public void testRemoveLastOccurrence() { |
647 |
|
LinkedList q = populatedQueue(SIZE); |
648 |
< |
for (int i = 1; i < SIZE; i+=2) { |
648 |
> |
for (int i = 1; i < SIZE; i += 2) { |
649 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
650 |
|
} |
651 |
< |
for (int i = 0; i < SIZE; i+=2) { |
651 |
> |
for (int i = 0; i < SIZE; i += 2) { |
652 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
653 |
< |
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
653 |
> |
assertFalse(q.removeLastOccurrence(new Integer(i + 1))); |
654 |
|
} |
655 |
|
assertTrue(q.isEmpty()); |
656 |
|
} |