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.3 by dl, Sun Sep 14 20:42:40 2003 UTC vs.
Revision 1.31 by jsr166, Tue Feb 21 02:04:17 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.*;
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	>	* Returns a new 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)));
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	<	}
44	<	catch (NullPointerException success) {}
52	>	shouldThrow();
53	>	} catch (NullPointerException success) {}
54		}
55
56	<	public void testConstructor6(){
57	<	try {
58	<	Integer[] ints = new Integer[SIZE];
59	<	for (int i = 0; i < SIZE; ++i)
60	<	ints[i] = new Integer(i);
61	<	LinkedList q = new LinkedList(Arrays.asList(ints));
62	<	for (int i = 0; i < SIZE; ++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 67 | Line 79 | public class LinkedListTest extends JSR1
79		assertTrue(q.isEmpty());
80		}
81
82	+	/**
83	+	* size changes when elements added and removed
84	+	*/
85		public void testSize() {
86		LinkedList q = populatedQueue(SIZE);
87		for (int i = 0; i < SIZE; ++i) {
#	Line 79 | Line 94 | public class LinkedListTest extends JSR1
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");
88	<	}
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 < SIZE; ++i) {
120		assertEquals(i, q.size());
#	Line 102 | Line 122 | public class LinkedListTest extends JSR1
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	<	public void testAddAll5(){
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	<	Integer[] empty = new Integer[0];
161	<	Integer[] ints = new Integer[SIZE];
162	<	for (int i = 0; i < SIZE; ++i)
163	<	ints[i] = new Integer(i);
164	<	LinkedList q = new LinkedList();
165	<	assertFalse(q.addAll(Arrays.asList(empty)));
166	<	assertTrue(q.addAll(Arrays.asList(ints)));
167	<	for (int i = 0; i < SIZE; ++i)
168	<	assertEquals(ints[i], q.poll());
169	<	}
170	<	finally {}
160	>	l.addAll(4,m);
161	>	shouldThrow();
162	>	} catch (IndexOutOfBoundsException success) {}
163	>	}
164	>
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	>	l.addAll(-1,m);
175	>	shouldThrow();
176	>	} catch (IndexOutOfBoundsException success) {}
177		}
178
179	<	public void testPoll(){
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, ((Integer)q.poll()).intValue());
185	>	assertEquals(i, q.poll());
186		}
187	<	assertNull(q.poll());
187	>	assertNull(q.poll());
188		}
189
190	<	public void testPeek(){
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, ((Integer)q.peek()).intValue());
197	<	q.poll();
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(){
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, ((Integer)q.element()).intValue());
211	<	q.poll();
210	>	assertEquals(i, q.element());
211	>	assertEquals(i, q.poll());
212		}
213		try {
214		q.element();
215	<	fail("no such element");
216	<	}
158	<	catch (NoSuchElementException success) {}
215	>	shouldThrow();
216	>	} catch (NoSuchElementException success) {}
217		}
218
219	<	public void testRemove(){
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, ((Integer)q.remove()).intValue());
225	>	assertEquals(i, q.remove());
226		}
227		try {
228		q.remove();
229	<	fail("remove should throw");
230	<	} catch (NoSuchElementException success){
170	<	}
229	>	shouldThrow();
230	>	} catch (NoSuchElementException success) {}
231		}
232
233	<	public void testRemoveElement(){
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.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		}
253	<
254	<	public void testContains(){
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)));
#	Line 191 | Line 263 | public class LinkedListTest extends JSR1
263		}
264		}
265
266	<	public void testClear(){
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(){
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 < 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(){
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) {
#	Line 229 | Line 310 | public class LinkedListTest extends JSR1
310		}
311		}
312
313	<	public void testRemoveAll(){
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);
#	Line 242 | Line 326 | public class LinkedListTest extends JSR1
326		}
327		}
328
329	<	public void testToArray(){
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	<	Arrays.sort(o);
336	<	for(int i = 0; i < o.length; i++)
250	<	assertEquals(o[i], q.poll());
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 = populatedQueue(SIZE);
341	<	Integer[] ints = new Integer[SIZE];
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(){
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, SIZE);
387		}
388
389	+	/**
390	+	* iterator ordering is FIFO
391	+	*/
392		public void testIteratorOrdering() {
274	–
393		final LinkedList q = new LinkedList();
276	–
394		q.add(new Integer(1));
395		q.add(new Integer(2));
396		q.add(new Integer(3));
280	–
397		int k = 0;
398		for (Iterator it = q.iterator(); it.hasNext();) {
399	<	int i = ((Integer)(it.next())).intValue();
284	<	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();
292	–
410		q.add(new Integer(1));
411		q.add(new Integer(2));
412		q.add(new Integer(3));
296	–
413		Iterator it = q.iterator();
414	<	it.next();
414	>	assertEquals(1, it.next());
415		it.remove();
300	–
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	<	public void testToString(){
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	>	/**
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 < SIZE; ++i) {
481	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
481	>	assertTrue(s.contains(String.valueOf(i)));
482		}
483	<	}
483	>	}
484
485	<	public void testAddFirst(){
485	>	/**
486	>	* peek returns element inserted with addFirst
487	>	*/
488	>	public void testAddFirst() {
489		LinkedList q = populatedQueue(3);
490	<	q.addFirst(new Integer(4));
491	<	assertEquals(new Integer(4),q.get(0));
492	<	}
490	>	q.addFirst(four);
491	>	assertSame(four, q.peek());
492	>	}
493
494	<	public void testAddLast(){
494	>	/**
495	>	* peekFirst returns element inserted with push
496	>	*/
497	>	public void testPush() {
498		LinkedList q = populatedQueue(3);
499	<	q.addLast(new Integer(3));
500	<	assertEquals(new Integer(3),q.get(3));
499	>	q.push(four);
500	>	assertSame(four, q.peekFirst());
501		}
502	<
503	<	public void testGetFirst() {
504	<	LinkedList q = populatedQueue(3);
505	<	assertEquals(new Integer(0),q.getFirst());
506	<	}
507	<
508	<	public void testGetLast() {
509	<	LinkedList q = populatedQueue(3);
510	<	assertEquals(new Integer(2),q.getLast());
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	<	public void testIndexOf(){
518	<	LinkedList q = populatedQueue(3);
519	<	assertEquals(0,q.indexOf(new Integer(0)));
520	<	assertEquals(1,q.indexOf(new Integer(1)));
521	<	assertEquals(2,q.indexOf(new Integer(2)));
522	<	assertEquals(-1, q.indexOf("not there"));
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 testLastIndexOf(){
527	<	LinkedList q = populatedQueue(3);
528	<	q.add(new Integer(2));
529	<	assertEquals(3,q.lastIndexOf(new Integer(2)));
530	<	assertEquals(-1, q.lastIndexOf("not there"));
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 testSet(){
536	<	LinkedList q = populatedQueue(3);
537	<	q.set(0,(new Integer(1)));
538	<	assertFalse(q.contains(new Integer(0)));
539	<	assertEquals(new Integer(1), q.get(0));
540	<	}
541	<
542	<
543	<	public void testGetFirst_NoSuchElementException(){
362	<	try {
363	<	LinkedList l = new LinkedList();
364	<	l.getFirst();
365	<	fail("First Element");
366	<	}
367	<	catch(NoSuchElementException success) {}
368	<	}
369	<
370	<	public void testRemoveFirst() {
371	<	try {
372	<	LinkedList l = new LinkedList();
373	<	l.removeFirst();
374	<	fail("R: First Element");
375	<	}
376	<	catch(NoSuchElementException success) {}
377	<	}
378	<
379	<	public void testRemoveLast() {
380	<	try {
381	<	LinkedList l = new LinkedList();
382	<	l.removeLast();
383	<	fail("R: Last Element");
384	<	}
385	<	catch(NoSuchElementException success) {}
386	<	}
387	<
388	<	public void testGetLast_NoSuchElementException(){
389	<	try {
390	<	LinkedList l = new LinkedList();
391	<	l.getLast();
392	<	fail("Last Element");
393	<	}
394	<	catch(NoSuchElementException success) {}
534	>
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	<	public void testAddAll_NullPointerException(){
561	<	try {
562	<	LinkedList l = new LinkedList();
563	<	l.addAll((Collection)null);
564	<	fail("Add All Failed");
565	<	}
566	<	catch(NullPointerException success){}
567	<	}
568	<
569	<
570	<	public void testAddAll1_OutOfBounds() {
571	<	try {
410	<	LinkedList l = new LinkedList();
411	<	l.addAll(4,new LinkedList());
412	<	fail("boolean addAll(int, Collection) should throw IndexOutOfBoundsException");
413	<	}
414	<	catch(IndexOutOfBoundsException  success) {}
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	<
575	<	public void testAddAll2_IndexOutOfBoundsException() {
576	<	try {
577	<	LinkedList l = new LinkedList();
578	<	l.add(new Object());
579	<	LinkedList m = new LinkedList();
580	<	m.add(new Object());
581	<	l.addAll(4,m);
582	<	fail("Add All Failed " + l.size());
583	<	}catch(IndexOutOfBoundsException  success) {}
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	<	public void testAddAll4_BadIndex() {
587	<	try {
588	<	LinkedList l = new LinkedList();
589	<	l.add(new Object());
590	<	LinkedList m = new LinkedList();
591	<	m.add(new Object());
592	<	l.addAll(-1,m);
593	<	fail("Add All Failed " + l.size());
594	<	}catch(IndexOutOfBoundsException  success){}
595	<	}
596	<
597	<	public void testget1() {
598	<	try {
599	<	LinkedList l = new LinkedList();
443	<	l.add(new Object());
444	<	l.get(-1);
445	<	fail("get Failed - l.get(-1)");
446	<	}catch(IndexOutOfBoundsException  success) {}
447	<	}
448	<
449	<	public void testget2() {
450	<	try {
451	<	LinkedList l = new LinkedList();
452	<	l.add(new Object());
453	<	l.get(5);
454	<	fail("get Failed - l.get(5) l.size(): " + l.size());
455	<	}catch(IndexOutOfBoundsException  success){}
456	<	}
457	<
458	<	public void testset1() {
459	<	try {
460	<	LinkedList l = new LinkedList();
461	<	l.add(new Object());
462	<	l.set(-1,new Object());
463	<	fail("set failed - l.set(-1,...)" + l.size());
464	<	}catch(IndexOutOfBoundsException  success){}
465	<	}
466	<
467	<	public void testset2() {
468	<	try {
469	<	LinkedList l = new LinkedList();
470	<	l.add(new Object());
471	<	l.set(5,new Object());
472	<	fail("set failed = l.set(5,..) l.size():" + l.size());
473	<	}catch(IndexOutOfBoundsException  success){}
474	<	}
475	<
476	<	public void testadd1() {
477	<	try {
478	<	LinkedList l = new LinkedList();
479	<	l.add(new Object());
480	<	l.add(-1,new Object());
481	<	fail("Add Failed - l.add(-1) l.size(): " + l.size());
482	<	}catch(IndexOutOfBoundsException  success){}
483	<	}
484	<
485	<	public void add2(){
486	<	try {
487	<	LinkedList l = new LinkedList();
488	<	l.add(new Object());
489	<	l.add(5,new Object());
490	<	fail("Add Failed  l.add(f,...)");
491	<	}catch(IndexOutOfBoundsException  success) {}
492	<	}
493	<
494	<	public void testremove(){
495	<	try {
496	<	LinkedList l = new LinkedList();
497	<	l.add(new Object());
498	<	l.remove(-1);
499	<	fail("Remove Failed l.remove(-1); l.size():" + l.size());
500	<	}catch(IndexOutOfBoundsException  success){}
501	<	}
502	<
503	<	public void testremove1(){
504	<	try {
505	<	LinkedList l = new LinkedList();
506	<	l.add(new Object());
507	<	l.remove(5);
508	<	fail("Remove Failed l.remove(5); l.size():" + l.size());
509	<	}catch(IndexOutOfBoundsException  success){}
510	<	}
511	<
512	<
513	<	public void testremove2(){
514	<	try{
515	<	LinkedList l = new LinkedList();
516	<	l.remove();
517	<	fail("LinkedList - Object remove() should throw a NoSuchElementException");
518	<	}catch(NoSuchElementException e){}
519	<	}
520	<
521	<	public void testlistIt1() {
522	<	try {
523	<	LinkedList l = new LinkedList();
524	<	l.add(new Object());
525	<	l.listIterator(5);
526	<	fail("l.listIterator(5) l.size():" + l.size());
527	<	}catch(IndexOutOfBoundsException  success){}
528	<	}
529	<
530	<	public void testlistIt2() {
531	<	try {
532	<	LinkedList l = new LinkedList();
533	<	l.add(new Object());
534	<	l.listIterator(-1);
535	<	fail("l.listIterator(-1) l.size():" + l.size());
536	<	}catch(IndexOutOfBoundsException  success){}
537	<	}
538	<
539	<	public void testlistIt3() {
540	<	try {
541	<	LinkedList l = new LinkedList();
542	<	l.add(new Object());
543	<	ListIterator a = l.listIterator(0);
544	<	l.removeFirst();
545	<	a.next();
546	<	fail("l.listIterator(-1) l.size():" + l.size());
547	<	}catch(ConcurrentModificationException success){}
548	<	}
549	<
550	<	public void testToArray_BadArg() {
551	<	try {
552	<	LinkedList l = new LinkedList();
553	<	l.add(new Object());
554	<	Object o[] = l.toArray(null);
555	<	fail("l.toArray(null) did not throw an exception");
556	<	}catch(NullPointerException success){}
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	<	public void testToArray1_BadArg() {
603	<	try {
604	<	LinkedList l = new LinkedList();
605	<	l.add(new Integer(5));
606	<	Object o[] = l.toArray(new String[10] );
607	<	fail("l.toArray(String[] f) did not throw an exception, an Integer was added");
608	<	}catch(ArrayStoreException  success){}
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