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

Diff Legend

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