1 |
|
/* |
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 |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
|
import junit.framework.*; |
10 |
< |
import java.util.*; |
11 |
< |
import java.util.concurrent.*; |
10 |
> |
import java.util.Arrays; |
11 |
> |
import java.util.Collection; |
12 |
> |
import java.util.Iterator; |
13 |
> |
import java.util.LinkedList; |
14 |
> |
import java.util.NoSuchElementException; |
15 |
|
|
16 |
|
public class LinkedListTest extends JSR166TestCase { |
17 |
|
public static void main(String[] args) { |
26 |
|
* Create a queue of given size containing consecutive |
27 |
|
* Integers 0 ... n. |
28 |
|
*/ |
29 |
< |
private LinkedList populatedQueue(int n) { |
30 |
< |
LinkedList q = new LinkedList(); |
29 |
> |
private LinkedList<Integer> populatedQueue(int n) { |
30 |
> |
LinkedList<Integer> q = new LinkedList<Integer>(); |
31 |
|
assertTrue(q.isEmpty()); |
32 |
|
for (int i = 0; i < n; ++i) |
33 |
|
assertTrue(q.offer(new Integer(i))); |
236 |
|
public void testRemoveElement() { |
237 |
|
LinkedList q = populatedQueue(SIZE); |
238 |
|
for (int i = 1; i < SIZE; i+=2) { |
239 |
< |
assertTrue(q.remove(new Integer(i))); |
239 |
> |
assertTrue(q.contains(i)); |
240 |
> |
assertTrue(q.remove((Integer)i)); |
241 |
> |
assertFalse(q.contains(i)); |
242 |
> |
assertTrue(q.contains(i-1)); |
243 |
|
} |
244 |
|
for (int i = 0; i < SIZE; i+=2) { |
245 |
< |
assertTrue(q.remove(new Integer(i))); |
246 |
< |
assertFalse(q.remove(new Integer(i+1))); |
245 |
> |
assertTrue(q.contains(i)); |
246 |
> |
assertTrue(q.remove((Integer)i)); |
247 |
> |
assertFalse(q.contains(i)); |
248 |
> |
assertFalse(q.remove((Integer)(i+1))); |
249 |
> |
assertFalse(q.contains(i+1)); |
250 |
|
} |
251 |
|
assertTrue(q.isEmpty()); |
252 |
|
} |
340 |
|
* toArray(a) contains all elements in FIFO order |
341 |
|
*/ |
342 |
|
public void testToArray2() { |
343 |
< |
LinkedList q = populatedQueue(SIZE); |
343 |
> |
LinkedList<Integer> q = populatedQueue(SIZE); |
344 |
|
Integer[] ints = new Integer[SIZE]; |
345 |
< |
assertSame(ints, q.toArray(ints)); |
345 |
> |
Integer[] array = q.toArray(ints); |
346 |
> |
assertSame(ints, array); |
347 |
|
for (int i = 0; i < ints.length; i++) |
348 |
|
assertSame(ints[i], q.poll()); |
349 |
|
} |
471 |
|
assertFalse(it.hasNext()); |
472 |
|
} |
473 |
|
|
464 |
– |
|
474 |
|
/** |
475 |
|
* toString contains toStrings of elements |
476 |
|
*/ |
478 |
|
LinkedList q = populatedQueue(SIZE); |
479 |
|
String s = q.toString(); |
480 |
|
for (int i = 0; i < SIZE; ++i) { |
481 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
481 |
> |
assertTrue(s.contains(String.valueOf(i))); |
482 |
|
} |
483 |
|
} |
484 |
|
|
557 |
|
assertNull(q.peekFirst()); |
558 |
|
} |
559 |
|
|
551 |
– |
|
560 |
|
/** |
561 |
|
* peekLast returns next element, or null if empty |
562 |
|
*/ |