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

Diff Legend

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