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

Diff Legend

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