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.4 by dl, Sat Sep 20 18:20:08 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.*;
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 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	<
38	>
39		/**
40	<	*
40	>	* new queue is empty
41		*/
42		public void testConstructor1() {
43		assertEquals(0, new LinkedList().size());
44		}
45
46		/**
47	<	*
47	>	* Initializing from null Collection throws NPE
48		*/
49		public void testConstructor3() {
50		try {
51		LinkedList q = new LinkedList((Collection)null);
52		shouldThrow();
53	<	}
50	<	catch (NullPointerException success) {}
53	>	} catch (NullPointerException success) {}
54		}
55
56		/**
57	<	*
57	>	* Queue contains all elements of collection used to initialize
58		*/
59		public void testConstructor6() {
60	<	try {
61	<	Integer[] ints = new Integer[SIZE];
62	<	for (int i = 0; i < SIZE; ++i)
63	<	ints[i] = new Integer(i);
64	<	LinkedList q = new LinkedList(Arrays.asList(ints));
65	<	for (int i = 0; i < SIZE; ++i)
63	<	assertEquals(ints[i], q.poll());
64	<	}
65	<	finally {}
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	<	*
69	>	* isEmpty is true before add, false after
70		*/
71		public void testEmpty() {
72		LinkedList q = new LinkedList();
#	Line 80 | Line 80 | public class LinkedListTest extends JSR1
80		}
81
82		/**
83	<	*
83	>	* size changes when elements added and removed
84		*/
85		public void testSize() {
86		LinkedList q = populatedQueue(SIZE);
#	Line 95 | Line 95 | public class LinkedListTest extends JSR1
95		}
96
97		/**
98	<	*
98	>	* offer(null) succeeds
99		*/
100		public void testOfferNull() {
101	<	try {
102	<	LinkedList q = new LinkedList();
103	<	q.offer(null);
104	<	} catch (NullPointerException ie) {
105	<	unexpectedException();
106	<	}
101	>	LinkedList q = new LinkedList();
102	>	q.offer(null);
103		}
104
105		/**
106	<	*
106	>	* Offer succeeds
107		*/
108		public void testOffer() {
109		LinkedList q = new LinkedList();
#	Line 116 | Line 112 | public class LinkedListTest extends JSR1
112		}
113
114		/**
115	<	*
115	>	* add succeeds
116		*/
117		public void testAdd() {
118		LinkedList q = new LinkedList();
#	Line 127 | Line 123 | public class LinkedListTest extends JSR1
123		}
124
125		/**
126	<	*
126	>	* addAll(null) throws NPE
127		*/
128		public void testAddAll1() {
129		try {
130		LinkedList q = new LinkedList();
131		q.addAll(null);
132		shouldThrow();
133	<	}
138	<	catch (NullPointerException success) {}
133	>	} catch (NullPointerException success) {}
134		}
135
136		/**
137	<	*
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	<	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		/**
180	<	*
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		/**
191	<	*
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		/**
205	<	*
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		shouldThrow();
216	<	}
197	<	catch (NoSuchElementException success) {}
216	>	} catch (NoSuchElementException success) {}
217		}
218
219		/**
220	<	*
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		shouldThrow();
230	<	} catch (NoSuchElementException success){
212	<	}
230	>	} catch (NoSuchElementException success) {}
231		}
232
233		/**
234	<	*
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	<
253	>
254		/**
255	<	*
255	>	* contains(x) reports true when elements added but not yet removed
256		*/
257		public void testContains() {
258		LinkedList q = populatedQueue(SIZE);
#	Line 240 | Line 264 | public class LinkedListTest extends JSR1
264		}
265
266		/**
267	<	*
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		/**
281	<	*
281	>	* containsAll(c) is true when c contains a subset of elements
282		*/
283		public void testContainsAll() {
284		LinkedList q = populatedQueue(SIZE);
#	Line 262 | Line 286 | public class LinkedListTest extends JSR1
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		/**
295	<	*
295	>	* retainAll(c) retains only those elements of c and reports true if changed
296		*/
297		public void testRetainAll() {
298		LinkedList q = populatedQueue(SIZE);
#	Line 287 | Line 311 | public class LinkedListTest extends JSR1
311		}
312
313		/**
314	<	*
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) {
#	Line 303 | Line 327 | public class LinkedListTest extends JSR1
327		}
328
329		/**
330	<	*
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++)
313	<	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		/**
340	<	*
340	>	* toArray(a) contains all elements in FIFO order
341		*/
342		public void testToArray2() {
343	<	LinkedList q = populatedQueue(SIZE);
344	<	Integer[] ints = new Integer[SIZE];
345	<	ints = (Integer[])q.toArray(ints);
346	<	Arrays.sort(ints);
347	<	for(int i = 0; i < ints.length; i++)
348	<	assertEquals(ints[i], q.poll());
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	<
350	>
351		/**
352	<	*
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		}
#	Line 340 | Line 387 | public class LinkedListTest extends JSR1
387		}
388
389		/**
390	<	*
390	>	* iterator ordering is FIFO
391		*/
392		public void testIteratorOrdering() {
346	–
393		final LinkedList q = new LinkedList();
348	–
394		q.add(new Integer(1));
395		q.add(new Integer(2));
396		q.add(new Integer(3));
352	–
397		int k = 0;
398		for (Iterator it = q.iterator(); it.hasNext();) {
399	<	int i = ((Integer)(it.next())).intValue();
356	<	assertEquals(++k, i);
399	>	assertEquals(++k, it.next());
400		}
401
402		assertEquals(3, k);
403		}
404
405		/**
406	<	*
406	>	* iterator.remove removes current element
407		*/
408	<	public void testIteratorRemove () {
408	>	public void testIteratorRemove() {
409		final LinkedList q = new LinkedList();
367	–
410		q.add(new Integer(1));
411		q.add(new Integer(2));
412		q.add(new Integer(3));
371	–
413		Iterator it = q.iterator();
414	<	it.next();
414	>	assertEquals(1, it.next());
415		it.remove();
375	–
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
382	–
422		/**
423	<	*
423	>	* Descending iterator iterates through all elements
424		*/
425	<	public void testToString() {
425	>	public void testDescendingIterator() {
426		LinkedList q = populatedQueue(SIZE);
427	<	String s = q.toString();
428	<	for (int i = 0; i < SIZE; ++i) {
429	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
427	>	int i = 0;
428	>	Iterator it = q.descendingIterator();
429	>	while (it.hasNext()) {
430	>	assertTrue(q.contains(it.next()));
431	>	++i;
432		}
433	<	}
434	<
435	<	/**
436	<	*
437	<	*/
438	<	public void testAddFirst() {
398	<	LinkedList q = populatedQueue(3);
399	<	q.addFirst(new Integer(4));
400	<	assertEquals(new Integer(4),q.get(0));
401	<	}
402	<
403	<	/**
404	<	*
405	<	*/
406	<	public void testAddLast() {
407	<	LinkedList q = populatedQueue(3);
408	<	q.addLast(new Integer(3));
409	<	assertEquals(new Integer(3),q.get(3));
410	<	}
411	<
412	<	/**
413	<	*
414	<	*/
415	<	public void testGetFirst() {
416	<	LinkedList q = populatedQueue(3);
417	<	assertEquals(new Integer(0),q.getFirst());
418	<	}
419	<
420	<	/**
421	<	*
422	<	*/
423	<	public void testGetLast() {
424	<	LinkedList q = populatedQueue(3);
425	<	assertEquals(new Integer(2),q.getLast());
426	<	}
427	<
428	<	/**
429	<	*
430	<	*/
431	<	public void testIndexOf() {
432	<	LinkedList q = populatedQueue(3);
433	<	assertEquals(0,q.indexOf(new Integer(0)));
434	<	assertEquals(1,q.indexOf(new Integer(1)));
435	<	assertEquals(2,q.indexOf(new Integer(2)));
436	<	assertEquals(-1, q.indexOf("not there"));
433	>	assertEquals(i, SIZE);
434	>	assertFalse(it.hasNext());
435	>	try {
436	>	it.next();
437	>	shouldThrow();
438	>	} catch (NoSuchElementException success) {}
439		}
440
441		/**
442	<	*
442	>	* Descending iterator ordering is reverse FIFO
443		*/
444	<	public void testLastIndexOf() {
445	<	LinkedList q = populatedQueue(3);
444	>	public void testDescendingIteratorOrdering() {
445	>	final LinkedList q = new LinkedList();
446	>	q.add(new Integer(3));
447		q.add(new Integer(2));
448	<	assertEquals(3,q.lastIndexOf(new Integer(2)));
449	<	assertEquals(-1, q.lastIndexOf("not there"));
450	<	}
451	<
452	<	/**
450	<	*
451	<	*/
452	<	public void testSet() {
453	<	LinkedList q = populatedQueue(3);
454	<	q.set(0,(new Integer(1)));
455	<	assertFalse(q.contains(new Integer(0)));
456	<	assertEquals(new Integer(1), q.get(0));
457	<	}
458	<
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	<	/**
461	<	*
462	<	*/
463	<	public void testGetFirst_NoSuchElementException() {
464	<	try {
465	<	LinkedList l = new LinkedList();
466	<	l.getFirst();
467	<	shouldThrow();
468	<	}
469	<	catch(NoSuchElementException success) {}
470	<	}
471	<
472	<	/**
473	<	*
474	<	*/
475	<	public void testRemoveFirst() {
476	<	try {
477	<	LinkedList l = new LinkedList();
478	<	l.removeFirst();
479	<	shouldThrow();
480	<	}
481	<	catch(NoSuchElementException success) {}
482	<	}
483	<
484	<	/**
485	<	*
486	<	*/
487	<	public void testRemoveLast() {
488	<	try {
489	<	LinkedList l = new LinkedList();
490	<	l.removeLast();
491	<	shouldThrow();
492	<	}
493	<	catch(NoSuchElementException success) {}
494	<	}
495	<
496	<	/**
497	<	*
498	<	*/
499	<	public void testGetLast_NoSuchElementException() {
500	<	try {
501	<	LinkedList l = new LinkedList();
502	<	l.getLast();
503	<	shouldThrow();
504	<	}
505	<	catch(NoSuchElementException success) {}
454	>	assertEquals(3, k);
455		}
456
508	–
509	–	/**
510	–	*
511	–	*/
512	–	public void testAddAll_NullPointerException() {
513	–	try {
514	–	LinkedList l = new LinkedList();
515	–	l.addAll((Collection)null);
516	–	shouldThrow();
517	–	}
518	–	catch(NullPointerException success){}
519	–	}
520	–
521	–
457		/**
458	<	*
458	>	* descendingIterator.remove removes current element
459		*/
460	<	public void testAddAll1_OutOfBounds() {
461	<	try {
462	<	LinkedList l = new LinkedList();
463	<	l.addAll(4,new LinkedList());
464	<	shouldThrow();
465	<	}
466	<	catch(IndexOutOfBoundsException  success) {}
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	<
534	<
473	>
474		/**
475	<	*
475	>	* toString contains toStrings of elements
476		*/
477	<	public void testAddAll2_IndexOutOfBoundsException() {
478	<	try {
479	<	LinkedList l = new LinkedList();
480	<	l.add(new Object());
481	<	LinkedList m = new LinkedList();
482	<	m.add(new Object());
544	<	l.addAll(4,m);
545	<	shouldThrow();
546	<	} catch(IndexOutOfBoundsException  success) {}
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.contains(String.valueOf(i)));
482	>	}
483		}
484
485		/**
486	<	*
486	>	* peek returns element inserted with addFirst
487		*/
488	<	public void testAddAll4_BadIndex() {
489	<	try {
490	<	LinkedList l = new LinkedList();
491	<	l.add(new Object());
556	<	LinkedList m = new LinkedList();
557	<	m.add(new Object());
558	<	l.addAll(-1,m);
559	<	shouldThrow();
560	<	} catch(IndexOutOfBoundsException  success){}
488	>	public void testAddFirst() {
489	>	LinkedList q = populatedQueue(3);
490	>	q.addFirst(four);
491	>	assertSame(four, q.peek());
492		}
493
494		/**
495	<	*
495	>	* peekFirst returns element inserted with push
496		*/
497	<	public void testget1() {
498	<	try {
499	<	LinkedList l = new LinkedList();
500	<	l.add(new Object());
570	<	l.get(-1);
571	<	shouldThrow();
572	<	} catch(IndexOutOfBoundsException  success) {}
497	>	public void testPush() {
498	>	LinkedList q = populatedQueue(3);
499	>	q.push(four);
500	>	assertSame(four, q.peekFirst());
501		}
502
503		/**
504	<	*
504	>	* pop removes next element, or throws NSEE if empty
505		*/
506	<	public void testget2() {
507	<	try {
508	<	LinkedList l = new LinkedList();
509	<	l.add(new Object());
510	<	l.get(5);
511	<	shouldThrow();
512	<	} catch(IndexOutOfBoundsException  success){}
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	<	*
518	>	* OfferFirst succeeds
519		*/
520	<	public void testset1() {
521	<	try {
522	<	LinkedList l = new LinkedList();
523	<	l.add(new Object());
594	<	l.set(-1,new Object());
595	<	shouldThrow();
596	<	} catch(IndexOutOfBoundsException  success){}
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		/**
527	<	*
527	>	* OfferLast succeeds
528		*/
529	<	public void testset2() {
530	<	try {
531	<	LinkedList l = new LinkedList();
532	<	l.add(new Object());
606	<	l.set(5,new Object());
607	<	shouldThrow();
608	<	} catch(IndexOutOfBoundsException  success){}
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		/**
536	<	*
536	>	* pollLast succeeds unless empty
537		*/
538	<	public void testadd1() {
539	<	try {
540	<	LinkedList l = new LinkedList();
541	<	l.add(new Object());
542	<	l.add(-1,new Object());
543	<	shouldThrow();
620	<	} catch(IndexOutOfBoundsException  success){}
621	<	}
622	<
623	<	public void add2() {
624	<	try {
625	<	LinkedList l = new LinkedList();
626	<	l.add(new Object());
627	<	l.add(5,new Object());
628	<	shouldThrow();
629	<	} catch(IndexOutOfBoundsException  success) {}
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	<	*
547	>	* peekFirst returns next element, or null if empty
548		*/
549	<	public void testremove() {
550	<	try {
551	<	LinkedList l = new LinkedList();
552	<	l.add(new Object());
553	<	l.remove(-1);
554	<	shouldThrow();
555	<	} catch(IndexOutOfBoundsException  success){}
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	<
559	>
560		/**
561	<	*
561	>	* peekLast returns next element, or null if empty
562		*/
563	<	public void testremove1() {
564	<	try {
565	<	LinkedList l = new LinkedList();
566	<	l.add(new Object());
567	<	l.remove(5);
568	<	shouldThrow();
569	<	} catch(IndexOutOfBoundsException  success){}
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	<	/**
576	<	*
577	<	*/
578	<	public void testremove2() {
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	<	LinkedList l = new LinkedList();
663	<	l.remove();
581	>	q.getFirst();
582		shouldThrow();
583	<	} catch(NoSuchElementException e){}
583	>	} catch (NoSuchElementException success) {}
584		}
585
586		/**
587	<	*
587	>	* getLast returns next element, or throws NSEE if empty
588		*/
589	<	public void testlistIt1() {
590	<	try {
591	<	LinkedList l = new LinkedList();
592	<	l.add(new Object());
593	<	l.listIterator(5);
594	<	shouldThrow();
595	<	} catch(IndexOutOfBoundsException  success){}
596	<	}
597	<
598	<	/**
599	<	*
682	<	*/
683	<	public void testlistIt2() {
684	<	try {
685	<	LinkedList l = new LinkedList();
686	<	l.add(new Object());
687	<	l.listIterator(-1);
688	<	shouldThrow();
689	<	} catch(IndexOutOfBoundsException  success){}
690	<	}
691	<
692	<	/**
693	<	*
694	<	*/
695	<	public void testlistIt3() {
696	<	try {
697	<	LinkedList l = new LinkedList();
698	<	l.add(new Object());
699	<	ListIterator a = l.listIterator(0);
700	<	l.removeFirst();
701	<	a.next();
702	<	shouldThrow();
703	<	} catch(ConcurrentModificationException success){}
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	<	*
603	>	* removeFirstOccurrence(x) removes x and returns true if present
604		*/
605	<	public void testToArray_BadArg() {
606	<	try {
607	<	LinkedList l = new LinkedList();
608	<	l.add(new Object());
609	<	Object o[] = l.toArray(null);
610	<	shouldThrow();
611	<	} catch(NullPointerException success){}
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	<	*
618	>	* removeLastOccurrence(x) removes x and returns true if present
619		*/
620	<	public void testToArray1_BadArg() {
621	<	try {
622	<	LinkedList l = new LinkedList();
623	<	l.add(new Integer(5));
624	<	Object o[] = l.toArray(new String[10] );
625	<	shouldThrow();
626	<	} catch(ArrayStoreException  success){}
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