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

Diff Legend

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