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.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.*;
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 populatedQueue(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	<
40	>
41		/**
42	<	*
42	>	* new queue is empty
43		*/
44		public void testConstructor1() {
45		assertEquals(0, new LinkedList().size());
46		}
47
48		/**
49	<	*
49	>	* Initializing from null Collection throws NPE
50		*/
51		public void testConstructor3() {
52		try {
53		LinkedList q = new LinkedList((Collection)null);
54		shouldThrow();
55	<	}
50	<	catch (NullPointerException success) {}
55	>	} catch (NullPointerException success) {}
56		}
57
58		/**
59	<	*
59	>	* Queue contains all elements of collection used to initialize
60		*/
61		public void testConstructor6() {
62	<	try {
63	<	Integer[] ints = new Integer[SIZE];
64	<	for (int i = 0; i < SIZE; ++i)
65	<	ints[i] = new Integer(i);
66	<	LinkedList q = new LinkedList(Arrays.asList(ints));
67	<	for (int i = 0; i < SIZE; ++i)
63	<	assertEquals(ints[i], q.poll());
64	<	}
65	<	finally {}
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	<	*
71	>	* isEmpty is true before add, false after
72		*/
73		public void testEmpty() {
74		LinkedList q = new LinkedList();
#	Line 80 | Line 82 | public class LinkedListTest extends JSR1
82		}
83
84		/**
85	<	*
85	>	* size changes when elements added and removed
86		*/
87		public void testSize() {
88		LinkedList q = populatedQueue(SIZE);
#	Line 95 | Line 97 | public class LinkedListTest extends JSR1
97		}
98
99		/**
100	<	*
100	>	* offer(null) succeeds
101		*/
102		public void testOfferNull() {
103	<	try {
104	<	LinkedList q = new LinkedList();
103	<	q.offer(null);
104	<	} catch (NullPointerException ie) {
105	<	unexpectedException();
106	<	}
103	>	LinkedList q = new LinkedList();
104	>	q.offer(null);
105		}
106
107		/**
108	<	*
108	>	* Offer succeeds
109		*/
110		public void testOffer() {
111		LinkedList q = new LinkedList();
#	Line 116 | Line 114 | public class LinkedListTest extends JSR1
114		}
115
116		/**
117	<	*
117	>	* add succeeds
118		*/
119		public void testAdd() {
120		LinkedList q = new LinkedList();
#	Line 127 | Line 125 | public class LinkedListTest extends JSR1
125		}
126
127		/**
128	<	*
128	>	* addAll(null) throws NPE
129		*/
130		public void testAddAll1() {
131		try {
132		LinkedList q = new LinkedList();
133		q.addAll(null);
134		shouldThrow();
135	<	}
138	<	catch (NullPointerException success) {}
135	>	} catch (NullPointerException success) {}
136		}
137
138		/**
139	<	*
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	+	/**
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[SIZE];
164	<	for (int i = 0; i < SIZE; ++i)
149	<	ints[i] = new Integer(i);
150	<	LinkedList q = new LinkedList();
151	<	assertFalse(q.addAll(Arrays.asList(empty)));
152	<	assertTrue(q.addAll(Arrays.asList(ints)));
153	<	for (int i = 0; i < SIZE; ++i)
154	<	assertEquals(ints[i], q.poll());
155	<	}
156	<	finally {}
162	>	l.addAll(4,m);
163	>	shouldThrow();
164	>	} catch (IndexOutOfBoundsException success) {}
165		}
166
167		/**
168	<	*
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, ((Integer)q.poll()).intValue());
187	>	assertEquals(i, q.poll());
188		}
189	<	assertNull(q.poll());
189	>	assertNull(q.poll());
190		}
191
192		/**
193	<	*
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, ((Integer)q.peek()).intValue());
199	<	q.poll();
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		/**
207	<	*
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, ((Integer)q.element()).intValue());
213	<	q.poll();
212	>	assertEquals(i, q.element());
213	>	assertEquals(i, q.poll());
214		}
215		try {
216		q.element();
217		shouldThrow();
218	<	}
197	<	catch (NoSuchElementException success) {}
218	>	} catch (NoSuchElementException success) {}
219		}
220
221		/**
222	<	*
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, ((Integer)q.remove()).intValue());
227	>	assertEquals(i, q.remove());
228		}
229		try {
230		q.remove();
231		shouldThrow();
232	<	} catch (NoSuchElementException success){
212	<	}
232	>	} catch (NoSuchElementException success) {}
233		}
234
235		/**
236	<	*
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.remove(new Integer(i)));
242	<	}
243	<	for (int i = 0; i < SIZE; i+=2) {
244	<	assertTrue(q.remove(new Integer(i)));
245	<	assertFalse(q.remove(new Integer(i+1)));
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	<
255	>
256		/**
257	<	*
257	>	* contains(x) reports true when elements added but not yet removed
258		*/
259		public void testContains() {
260		LinkedList q = populatedQueue(SIZE);
#	Line 240 | Line 266 | public class LinkedListTest extends JSR1
266		}
267
268		/**
269	<	*
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		/**
283	<	*
283	>	* containsAll(c) is true when c contains a subset of elements
284		*/
285		public void testContainsAll() {
286		LinkedList q = populatedQueue(SIZE);
#	Line 262 | Line 288 | public class LinkedListTest extends JSR1
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		/**
297	<	*
297	>	* retainAll(c) retains only those elements of c and reports true if changed
298		*/
299		public void testRetainAll() {
300		LinkedList q = populatedQueue(SIZE);
#	Line 287 | Line 313 | public class LinkedListTest extends JSR1
313		}
314
315		/**
316	<	*
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) {
#	Line 303 | Line 329 | public class LinkedListTest extends JSR1
329		}
330
331		/**
332	<	*
332	>	* toArray contains all elements in FIFO order
333		*/
334		public void testToArray() {
335		LinkedList q = populatedQueue(SIZE);
336	<	Object[] o = q.toArray();
337	<	Arrays.sort(o);
338	<	for(int i = 0; i < o.length; i++)
313	<	assertEquals(o[i], q.poll());
336	>	Object[] o = q.toArray();
337	>	for (int i = 0; i < o.length; i++)
338	>	assertSame(o[i], q.poll());
339		}
340
341		/**
342	<	*
342	>	* toArray(a) contains all elements in FIFO order
343		*/
344		public void testToArray2() {
345	<	LinkedList q = populatedQueue(SIZE);
346	<	Integer[] ints = new Integer[SIZE];
347	<	ints = (Integer[])q.toArray(ints);
348	<	Arrays.sort(ints);
349	<	for(int i = 0; i < ints.length; i++)
350	<	assertEquals(ints[i], q.poll());
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	>	/**
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	<
376	>
377		/**
378	<	*
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		}
#	Line 340 | Line 389 | public class LinkedListTest extends JSR1
389		}
390
391		/**
392	<	*
392	>	* iterator ordering is FIFO
393		*/
394		public void testIteratorOrdering() {
346	–
395		final LinkedList q = new LinkedList();
348	–
396		q.add(new Integer(1));
397		q.add(new Integer(2));
398		q.add(new Integer(3));
352	–
399		int k = 0;
400		for (Iterator it = q.iterator(); it.hasNext();) {
401	<	int i = ((Integer)(it.next())).intValue();
356	<	assertEquals(++k, i);
401	>	assertEquals(++k, it.next());
402		}
403
404		assertEquals(3, k);
405		}
406
407		/**
408	<	*
408	>	* iterator.remove removes current element
409		*/
410	<	public void testIteratorRemove () {
410	>	public void testIteratorRemove() {
411		final LinkedList q = new LinkedList();
367	–
412		q.add(new Integer(1));
413		q.add(new Integer(2));
414		q.add(new Integer(3));
371	–
415		Iterator it = q.iterator();
416	<	it.next();
416	>	assertEquals(1, it.next());
417		it.remove();
375	–
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
382	–
424		/**
425	<	*
425	>	* Descending iterator iterates through all elements
426		*/
427	<	public void testToString() {
427	>	public void testDescendingIterator() {
428		LinkedList q = populatedQueue(SIZE);
429	<	String s = q.toString();
430	<	for (int i = 0; i < SIZE; ++i) {
431	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
429	>	int i = 0;
430	>	Iterator it = q.descendingIterator();
431	>	while (it.hasNext()) {
432	>	assertTrue(q.contains(it.next()));
433	>	++i;
434		}
435	<	}
436	<
437	<	/**
438	<	*
439	<	*/
440	<	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"));
435	>	assertEquals(i, SIZE);
436	>	assertFalse(it.hasNext());
437	>	try {
438	>	it.next();
439	>	shouldThrow();
440	>	} catch (NoSuchElementException success) {}
441		}
442
443		/**
444	<	*
444	>	* Descending iterator ordering is reverse FIFO
445		*/
446	<	public void testLastIndexOf() {
447	<	LinkedList q = populatedQueue(3);
446	>	public void testDescendingIteratorOrdering() {
447	>	final LinkedList q = new LinkedList();
448	>	q.add(new Integer(3));
449		q.add(new Integer(2));
450	<	assertEquals(3,q.lastIndexOf(new Integer(2)));
451	<	assertEquals(-1, q.lastIndexOf("not there"));
452	<	}
453	<
454	<	/**
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	<
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	<	/**
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) {}
456	>	assertEquals(3, k);
457		}
458
508	–
459		/**
460	<	*
460	>	* descendingIterator.remove removes current element
461		*/
462	<	public void testAddAll_NullPointerException() {
463	<	try {
464	<	LinkedList l = new LinkedList();
465	<	l.addAll((Collection)null);
466	<	shouldThrow();
467	<	}
468	<	catch(NullPointerException success){}
469	<	}
470	<
471	<
472	<	/**
473	<	*
524	<	*/
525	<	public void testAddAll1_OutOfBounds() {
526	<	try {
527	<	LinkedList l = new LinkedList();
528	<	l.addAll(4,new LinkedList());
529	<	shouldThrow();
530	<	}
531	<	catch(IndexOutOfBoundsException  success) {}
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	<
534	<
475	>
476		/**
477	<	*
477	>	* toString contains toStrings of elements
478		*/
479	<	public void testAddAll2_IndexOutOfBoundsException() {
480	<	try {
481	<	LinkedList l = new LinkedList();
482	<	l.add(new Object());
483	<	LinkedList m = new LinkedList();
484	<	m.add(new Object());
544	<	l.addAll(4,m);
545	<	shouldThrow();
546	<	} catch(IndexOutOfBoundsException  success) {}
479	>	public void testToString() {
480	>	LinkedList q = populatedQueue(SIZE);
481	>	String s = q.toString();
482	>	for (int i = 0; i < SIZE; ++i) {
483	>	assertTrue(s.contains(String.valueOf(i)));
484	>	}
485		}
486
487		/**
488	<	*
488	>	* peek returns element inserted with addFirst
489		*/
490	<	public void testAddAll4_BadIndex() {
491	<	try {
492	<	LinkedList l = new LinkedList();
493	<	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){}
490	>	public void testAddFirst() {
491	>	LinkedList q = populatedQueue(3);
492	>	q.addFirst(four);
493	>	assertSame(four, q.peek());
494		}
495
496		/**
497	<	*
497	>	* peekFirst returns element inserted with push
498		*/
499	<	public void testget1() {
500	<	try {
501	<	LinkedList l = new LinkedList();
502	<	l.add(new Object());
570	<	l.get(-1);
571	<	shouldThrow();
572	<	} catch(IndexOutOfBoundsException  success) {}
499	>	public void testPush() {
500	>	LinkedList q = populatedQueue(3);
501	>	q.push(four);
502	>	assertSame(four, q.peekFirst());
503		}
504
505		/**
506	<	*
506	>	* pop removes next element, or throws NSEE if empty
507		*/
508	<	public void testget2() {
509	<	try {
510	<	LinkedList l = new LinkedList();
511	<	l.add(new Object());
512	<	l.get(5);
513	<	shouldThrow();
514	<	} catch(IndexOutOfBoundsException  success){}
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		/**
520	<	*
520	>	* OfferFirst succeeds
521		*/
522	<	public void testset1() {
523	<	try {
524	<	LinkedList l = new LinkedList();
525	<	l.add(new Object());
594	<	l.set(-1,new Object());
595	<	shouldThrow();
596	<	} catch(IndexOutOfBoundsException  success){}
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	<	*
529	>	* OfferLast succeeds
530		*/
531	<	public void testset2() {
532	<	try {
533	<	LinkedList l = new LinkedList();
534	<	l.add(new Object());
606	<	l.set(5,new Object());
607	<	shouldThrow();
608	<	} catch(IndexOutOfBoundsException  success){}
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		/**
538	<	*
538	>	* pollLast succeeds unless empty
539		*/
540	<	public void testadd1() {
541	<	try {
542	<	LinkedList l = new LinkedList();
543	<	l.add(new Object());
544	<	l.add(-1,new Object());
545	<	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) {}
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		/**
549	<	*
549	>	* peekFirst returns next element, or null if empty
550		*/
551	<	public void testremove() {
552	<	try {
553	<	LinkedList l = new LinkedList();
554	<	l.add(new Object());
555	<	l.remove(-1);
556	<	shouldThrow();
557	<	} catch(IndexOutOfBoundsException  success){}
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	<
561	>
562		/**
563	<	*
563	>	* peekLast returns next element, or null if empty
564		*/
565	<	public void testremove1() {
566	<	try {
567	<	LinkedList l = new LinkedList();
568	<	l.add(new Object());
569	<	l.remove(5);
570	<	shouldThrow();
571	<	} catch(IndexOutOfBoundsException  success){}
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	<
577	<	/**
578	<	*
579	<	*/
580	<	public void testremove2() {
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	<	LinkedList l = new LinkedList();
663	<	l.remove();
583	>	q.getFirst();
584		shouldThrow();
585	<	} catch(NoSuchElementException e){}
585	>	} catch (NoSuchElementException success) {}
586		}
587
588		/**
589	<	*
670	<	*/
671	<	public void testlistIt1() {
672	<	try {
673	<	LinkedList l = new LinkedList();
674	<	l.add(new Object());
675	<	l.listIterator(5);
676	<	shouldThrow();
677	<	} catch(IndexOutOfBoundsException  success){}
678	<	}
679	<
680	<	/**
681	<	*
589	>	* getLast returns next element, or throws NSEE if empty
590		*/
591	<	public void testlistIt2() {
592	<	try {
593	<	LinkedList l = new LinkedList();
594	<	l.add(new Object());
595	<	l.listIterator(-1);
596	<	shouldThrow();
597	<	} catch(IndexOutOfBoundsException  success){}
598	<	}
599	<
600	<	/**
601	<	*
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){}
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	<	*
605	>	* removeFirstOccurrence(x) removes x and returns true if present
606		*/
607	<	public void testToArray_BadArg() {
608	<	try {
609	<	LinkedList l = new LinkedList();
610	<	l.add(new Object());
611	<	Object o[] = l.toArray(null);
612	<	shouldThrow();
613	<	} catch(NullPointerException success){}
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	<	*
620	>	* removeLastOccurrence(x) removes x and returns true if present
621		*/
622	<	public void testToArray1_BadArg() {
623	<	try {
624	<	LinkedList l = new LinkedList();
625	<	l.add(new Integer(5));
626	<	Object o[] = l.toArray(new String[10] );
627	<	shouldThrow();
628	<	} catch(ArrayStoreException  success){}
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