ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/LinkedListTest.java

Comparing jsr166/src/test/tck/LinkedListTest.java (file contents):
Revision 1.2 by dl, Sun Sep 7 20:39:11 2003 UTC vs.
Revision 1.33 by jsr166, Wed Dec 31 20:09:08 2014 UTC

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

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines