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.1 by dl, Sun Aug 31 19:24:55 2003 UTC vs.
Revision 1.48 by jsr166, Mon May 28 21:19:50 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.*;
12	<
13	<	public class LinkedListTest extends TestCase {
14	<
15	<	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.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 fullQueue(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	<
64	<	public void testConstructor1(){
63	>
64	>	/**
65	>	* new queue is empty
66	>	*/
67	>	public void testConstructor1() {
68		assertEquals(0, new LinkedList().size());
69		}
70
71	+	/**
72	+	* Initializing from null Collection throws NPE
73	+	*/
74		public void testConstructor3() {
75		try {
76	<	LinkedList q = new LinkedList((Collection)null);
77	<	fail("Cannot make from null collection");
78	<	}
50	<	catch (NullPointerException success) {}
76	>	new LinkedList((Collection)null);
77	>	shouldThrow();
78	>	} catch (NullPointerException success) {}
79		}
80
81	<	public void testConstructor6(){
82	<	try {
83	<	Integer[] ints = new Integer[N];
84	<	for (int i = 0; i < N; ++i)
85	<	ints[i] = new Integer(i);
86	<	LinkedList q = new LinkedList(Arrays.asList(ints));
87	<	for (int i = 0; i < N; ++i)
88	<	assertEquals(ints[i], q.poll());
89	<	}
90	<	finally {}
81	>	/**
82	>	* Queue contains all elements of collection used to initialize
83	>	*/
84	>	public void testConstructor6() {
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	+	* isEmpty is true before add, false after
95	+	*/
96		public void testEmpty() {
97		LinkedList q = new LinkedList();
98		assertTrue(q.isEmpty());
#	Line 73 | Line 104 | public class LinkedListTest extends Test
104		assertTrue(q.isEmpty());
105		}
106
107	+	/**
108	+	* size changes when elements added and removed
109	+	*/
110		public void testSize() {
111	<	LinkedList q = fullQueue(N);
112	<	for (int i = 0; i < N; ++i) {
113	<	assertEquals(N-i, q.size());
111	>	LinkedList q = populatedQueue(SIZE);
112	>	for (int i = 0; i < SIZE; ++i) {
113	>	assertEquals(SIZE - i, q.size());
114		q.remove();
115		}
116	<	for (int i = 0; i < N; ++i) {
116	>	for (int i = 0; i < SIZE; ++i) {
117		assertEquals(i, q.size());
118		q.add(new Integer(i));
119		}
120		}
121
122	<	public void testOfferNull(){
123	<	try {
124	<	LinkedList q = new LinkedList();
125	<	q.offer(null);
126	<	} catch (NullPointerException ie) {
127	<	fail("should not throw NPE");
128	<	}
122	>	/**
123	>	* offer(null) succeeds
124	>	*/
125	>	public void testOfferNull() {
126	>	LinkedList q = new LinkedList();
127	>	q.offer(null);
128	>	assertNull(q.get(0));
129	>	assertTrue(q.contains(null));
130		}
131
132	+	/**
133	+	* Offer succeeds
134	+	*/
135		public void testOffer() {
136		LinkedList q = new LinkedList();
137		assertTrue(q.offer(new Integer(0)));
138		assertTrue(q.offer(new Integer(1)));
139		}
140
141	<	public void testAdd(){
141	>	/**
142	>	* add succeeds
143	>	*/
144	>	public void testAdd() {
145		LinkedList q = new LinkedList();
146	<	for (int i = 0; i < N; ++i) {
146	>	for (int i = 0; i < SIZE; ++i) {
147		assertEquals(i, q.size());
148		assertTrue(q.add(new Integer(i)));
149		}
150		}
151
152	<	public void testAddAll1(){
152	>	/**
153	>	* addAll(null) throws NPE
154	>	*/
155	>	public void testAddAll1() {
156	>	LinkedList q = new LinkedList();
157		try {
113	–	LinkedList q = new LinkedList();
158		q.addAll(null);
159	<	fail("Cannot add null collection");
160	<	}
117	<	catch (NullPointerException success) {}
159	>	shouldThrow();
160	>	} catch (NullPointerException success) {}
161		}
162
163	<	public void testAddAll5(){
163	>	/**
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[N];
189	<	for (int i = 0; i < N; ++i)
190	<	ints[i] = new Integer(i);
191	<	LinkedList q = new LinkedList();
192	<	assertFalse(q.addAll(Arrays.asList(empty)));
193	<	assertTrue(q.addAll(Arrays.asList(ints)));
194	<	for (int i = 0; i < N; ++i)
195	<	assertEquals(ints[i], q.poll());
196	<	}
197	<	finally {}
187	>	l.addAll(4,m);
188	>	shouldThrow();
189	>	} catch (IndexOutOfBoundsException success) {}
190	>	}
191	>
192	>	/**
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	<	public void testPoll(){
207	<	LinkedList q = fullQueue(N);
208	<	for (int i = 0; i < N; ++i) {
209	<	assertEquals(i, ((Integer)q.poll()).intValue());
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, q.poll());
213		}
214	<	assertNull(q.poll());
214	>	assertNull(q.poll());
215		}
216
217	<	public void testPeek(){
218	<	LinkedList q = fullQueue(N);
219	<	for (int i = 0; i < N; ++i) {
220	<	assertEquals(i, ((Integer)q.peek()).intValue());
221	<	q.poll();
217	>	/**
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, 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	<	public void testElement(){
232	<	LinkedList q = fullQueue(N);
233	<	for (int i = 0; i < N; ++i) {
234	<	assertEquals(i, ((Integer)q.element()).intValue());
235	<	q.poll();
231	>	/**
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, q.element());
238	>	assertEquals(i, q.poll());
239		}
240		try {
241		q.element();
242	<	fail("no such element");
243	<	}
164	<	catch (NoSuchElementException success) {}
242	>	shouldThrow();
243	>	} catch (NoSuchElementException success) {}
244		}
245
246	<	public void testRemove(){
247	<	LinkedList q = fullQueue(N);
248	<	for (int i = 0; i < N; ++i) {
249	<	assertEquals(i, ((Integer)q.remove()).intValue());
246	>	/**
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, q.remove());
253		}
254		try {
255		q.remove();
256	<	fail("remove should throw");
257	<	} catch (NoSuchElementException success){
258	<	}
259	<	}
260	<
261	<	public void testRemoveElement(){
262	<	LinkedList q = fullQueue(N);
263	<	for (int i = 1; i < N; i+=2) {
264	<	assertTrue(q.remove(new Integer(i)));
265	<	}
266	<	for (int i = 0; i < N; i+=2) {
267	<	assertTrue(q.remove(new Integer(i)));
268	<	assertFalse(q.remove(new Integer(i+1)));
269	<	}
270	<	assert(q.isEmpty());
271	<	}
272	<
273	<	public void testContains(){
274	<	LinkedList q = fullQueue(N);
275	<	for (int i = 0; i < N; ++i) {
256	>	shouldThrow();
257	>	} catch (NoSuchElementException success) {}
258	>	}
259	>
260	>	/**
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.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	>
281	>	/**
282	>	* contains(x) reports true when elements added but not yet removed
283	>	*/
284	>	public void testContains() {
285	>	LinkedList q = populatedQueue(SIZE);
286	>	for (int i = 0; i < SIZE; ++i) {
287		assertTrue(q.contains(new Integer(i)));
288		q.poll();
289		assertFalse(q.contains(new Integer(i)));
290		}
291		}
292
293	<	public void testClear(){
294	<	LinkedList q = fullQueue(N);
293	>	/**
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	<	public void testContainsAll(){
308	<	LinkedList q = fullQueue(N);
307	>	/**
308	>	* containsAll(c) is true when c contains a subset of elements
309	>	*/
310	>	public void testContainsAll() {
311	>	LinkedList q = populatedQueue(SIZE);
312		LinkedList p = new LinkedList();
313	<	for (int i = 0; i < N; ++i) {
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	<	public void testRetainAll(){
322	<	LinkedList q = fullQueue(N);
323	<	LinkedList p = fullQueue(N);
324	<	for (int i = 0; i < N; ++i) {
321	>	/**
322	>	* retainAll(c) retains only those elements of c and reports true if changed
323	>	*/
324	>	public void testRetainAll() {
325	>	LinkedList q = populatedQueue(SIZE);
326	>	LinkedList p = populatedQueue(SIZE);
327	>	for (int i = 0; i < SIZE; ++i) {
328		boolean changed = q.retainAll(p);
329		if (i == 0)
330		assertFalse(changed);
#	Line 230 | Line 332 | public class LinkedListTest extends Test
332		assertTrue(changed);
333
334		assertTrue(q.containsAll(p));
335	<	assertEquals(N-i, q.size());
335	>	assertEquals(SIZE - i, q.size());
336		p.remove();
337		}
338		}
339
340	<	public void testRemoveAll(){
341	<	for (int i = 1; i < N; ++i) {
342	<	LinkedList q = fullQueue(N);
343	<	LinkedList p = fullQueue(i);
340	>	/**
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(N-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	<	public void testToArray(){
357	<	LinkedList q = fullQueue(N);
358	<	Object[] o = q.toArray();
359	<	Arrays.sort(o);
360	<	for(int i = 0; i < o.length; i++)
361	<	assertEquals(o[i], q.poll());
356	>	/**
357	>	* toArray contains all elements in FIFO order
358	>	*/
359	>	public void testToArray() {
360	>	LinkedList q = populatedQueue(SIZE);
361	>	Object[] a = q.toArray();
362	>	assertSame(Object[].class, a.getClass());
363	>	for (Object o : a)
364	>	assertSame(o, q.poll());
365	>	assertTrue(q.isEmpty());
366		}
367
368	<	public void testToArray2(){
369	<	LinkedList q = fullQueue(N);
370	<	Integer[] ints = new Integer[N];
371	<	ints = (Integer[])q.toArray(ints);
372	<	Arrays.sort(ints);
373	<	for(int i = 0; i < ints.length; i++)
374	<	assertEquals(ints[i], q.poll());
368	>	/**
369	>	* toArray(a) contains all elements in FIFO order
370	>	*/
371	>	public void testToArray2() {
372	>	LinkedList<Integer> q = populatedQueue(SIZE);
373	>	Integer[] ints = new Integer[SIZE];
374	>	Integer[] array = q.toArray(ints);
375	>	assertSame(ints, array);
376	>	for (Integer o : ints)
377	>	assertSame(o, q.poll());
378	>	assertTrue(q.isEmpty());
379		}
380	<
381	<	public void testIterator(){
382	<	LinkedList q = fullQueue(N);
383	<	int i = 0;
384	<	Iterator it = q.iterator();
385	<	while(it.hasNext()) {
380	>
381	>	/**
382	>	* toArray(null) throws NullPointerException
383	>	*/
384	>	public void testToArray_NullArg() {
385	>	LinkedList l = new LinkedList();
386	>	l.add(new Object());
387	>	try {
388	>	l.toArray(null);
389	>	shouldThrow();
390	>	} catch (NullPointerException success) {}
391	>	}
392	>
393	>	/**
394	>	* toArray(incompatible array type) throws ArrayStoreException
395	>	*/
396	>	public void testToArray1_BadArg() {
397	>	LinkedList l = new LinkedList();
398	>	l.add(new Integer(5));
399	>	try {
400	>	l.toArray(new String[10]);
401	>	shouldThrow();
402	>	} catch (ArrayStoreException success) {}
403	>	}
404	>
405	>	/**
406	>	* iterator iterates through all elements
407	>	*/
408	>	public void testIterator() {
409	>	LinkedList q = populatedQueue(SIZE);
410	>	Iterator it = q.iterator();
411	>	int i;
412	>	for (i = 0; it.hasNext(); i++)
413		assertTrue(q.contains(it.next()));
414	<	++i;
415	<	}
276	<	assertEquals(i, N);
414	>	assertEquals(i, SIZE);
415	>	assertIteratorExhausted(it);
416		}
417
418	<	public void testIteratorOrdering() {
418	>	/**
419	>	* iterator of empty collection has no elements
420	>	*/
421	>	public void testEmptyIterator() {
422	>	assertIteratorExhausted(new LinkedList().iterator());
423	>	}
424
425	+	/**
426	+	* iterator ordering is FIFO
427	+	*/
428	+	public void testIteratorOrdering() {
429		final LinkedList q = new LinkedList();
282	–
430		q.add(new Integer(1));
431		q.add(new Integer(2));
432		q.add(new Integer(3));
286	–
433		int k = 0;
434		for (Iterator it = q.iterator(); it.hasNext();) {
435	<	int i = ((Integer)(it.next())).intValue();
290	<	assertEquals("items should come out in order", ++k, i);
435	>	assertEquals(++k, it.next());
436		}
437
438	<	assertEquals("should go through 3 elements", 3, k);
438	>	assertEquals(3, k);
439		}
440
441	<	public void testIteratorRemove () {
441	>	/**
442	>	* iterator.remove removes current element
443	>	*/
444	>	public void testIteratorRemove() {
445		final LinkedList q = new LinkedList();
298	–
446		q.add(new Integer(1));
447		q.add(new Integer(2));
448		q.add(new Integer(3));
302	–
449		Iterator it = q.iterator();
450	<	it.next();
450	>	assertEquals(1, it.next());
451		it.remove();
306	–
452		it = q.iterator();
453	<	assertEquals(it.next(), new Integer(2));
454	<	assertEquals(it.next(), new Integer(3));
453	>	assertEquals(2, it.next());
454	>	assertEquals(3, it.next());
455	>	assertFalse(it.hasNext());
456	>	}
457	>
458	>	/**
459	>	* Descending iterator iterates through all elements
460	>	*/
461	>	public void testDescendingIterator() {
462	>	LinkedList q = populatedQueue(SIZE);
463	>	int i = 0;
464	>	Iterator it = q.descendingIterator();
465	>	while (it.hasNext()) {
466	>	assertTrue(q.contains(it.next()));
467	>	++i;
468	>	}
469	>	assertEquals(i, SIZE);
470		assertFalse(it.hasNext());
471	+	try {
472	+	it.next();
473	+	shouldThrow();
474	+	} catch (NoSuchElementException success) {}
475		}
476
477	+	/**
478	+	* Descending iterator ordering is reverse FIFO
479	+	*/
480	+	public void testDescendingIteratorOrdering() {
481	+	final LinkedList q = new LinkedList();
482	+	q.add(new Integer(3));
483	+	q.add(new Integer(2));
484	+	q.add(new Integer(1));
485	+	int k = 0;
486	+	for (Iterator it = q.descendingIterator(); it.hasNext();) {
487	+	assertEquals(++k, it.next());
488	+	}
489	+
490	+	assertEquals(3, k);
491	+	}
492
493	<	public void testToString(){
494	<	LinkedList q = fullQueue(N);
493	>	/**
494	>	* descendingIterator.remove removes current element
495	>	*/
496	>	public void testDescendingIteratorRemove() {
497	>	final LinkedList q = new LinkedList();
498	>	q.add(three);
499	>	q.add(two);
500	>	q.add(one);
501	>	Iterator it = q.descendingIterator();
502	>	it.next();
503	>	it.remove();
504	>	it = q.descendingIterator();
505	>	assertSame(it.next(), two);
506	>	assertSame(it.next(), three);
507	>	assertFalse(it.hasNext());
508	>	}
509	>
510	>	/**
511	>	* toString contains toStrings of elements
512	>	*/
513	>	public void testToString() {
514	>	LinkedList q = populatedQueue(SIZE);
515		String s = q.toString();
516	<	for (int i = 0; i < N; ++i) {
517	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
516	>	for (int i = 0; i < SIZE; ++i) {
517	>	assertTrue(s.contains(String.valueOf(i)));
518		}
519	<	}
519	>	}
520
521	<	public void testAddFirst(){
522	<	LinkedList q = fullQueue(3);
523	<	q.addFirst(new Integer(4));
524	<	assertEquals(new Integer(4),q.get(0));
525	<	}
526	<
527	<	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"));
521	>	/**
522	>	* peek returns element inserted with addFirst
523	>	*/
524	>	public void testAddFirst() {
525	>	LinkedList q = populatedQueue(3);
526	>	q.addFirst(four);
527	>	assertSame(four, q.peek());
528		}
529
530	<	public void testLastIndexOf(){
531	<	LinkedList q = fullQueue(3);
532	<	q.add(new Integer(2));
533	<	assertEquals(3,q.lastIndexOf(new Integer(2)));
534	<	assertEquals(-1, q.lastIndexOf("not there"));
530	>	/**
531	>	* peekFirst returns element inserted with push
532	>	*/
533	>	public void testPush() {
534	>	LinkedList q = populatedQueue(3);
535	>	q.push(four);
536	>	assertSame(four, q.peekFirst());
537		}
538	<
539	<	public void testSet(){
540	<	LinkedList q = fullQueue(3);
541	<	q.set(0,(new Integer(1)));
542	<	assertFalse(q.contains(new Integer(0)));
543	<	assertEquals(new Integer(1), q.get(0));
544	<	}
545	<
546	<
547	<	public void testGetFirst_NoSuchElementException(){
548	<	try {
549	<	LinkedList l = new LinkedList();
550	<	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) {}
538	>
539	>	/**
540	>	* pop removes next element, or throws NSEE if empty
541	>	*/
542	>	public void testPop() {
543	>	LinkedList q = populatedQueue(SIZE);
544	>	for (int i = 0; i < SIZE; ++i) {
545	>	assertEquals(i, q.pop());
546	>	}
547	>	try {
548	>	q.pop();
549	>	shouldThrow();
550	>	} catch (NoSuchElementException success) {}
551		}
552	<
553	<
554	<	public void testAddAll2_IndexOutOfBoundsException() {
555	<	try {
556	<	LinkedList l = new LinkedList();
557	<	l.add(new Object());
558	<	LinkedList m = new LinkedList();
559	<	m.add(new Object());
430	<	l.addAll(4,m);
431	<	fail("Add All Failed " + l.size());
432	<	}catch(IndexOutOfBoundsException  success) {}
552	>
553	>	/**
554	>	* OfferFirst succeeds
555	>	*/
556	>	public void testOfferFirst() {
557	>	LinkedList q = new LinkedList();
558	>	assertTrue(q.offerFirst(new Integer(0)));
559	>	assertTrue(q.offerFirst(new Integer(1)));
560		}
561
562	<	public void testAddAll4_BadIndex() {
563	<	try {
564	<	LinkedList l = new LinkedList();
565	<	l.add(new Object());
566	<	LinkedList m = new LinkedList();
567	<	m.add(new Object());
568	<	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){}
562	>	/**
563	>	* OfferLast succeeds
564	>	*/
565	>	public void testOfferLast() {
566	>	LinkedList q = new LinkedList();
567	>	assertTrue(q.offerLast(new Integer(0)));
568	>	assertTrue(q.offerLast(new Integer(1)));
569		}
570
571	<	public void testToArray1_BadArg() {
572	<	try {
573	<	LinkedList l = new LinkedList();
574	<	l.add(new Integer(5));
575	<	Object o[] = l.toArray(new String[10] );
576	<	fail("l.toArray(String[] f) did not throw an exception, an Integer was added");
577	<	}catch(ArrayStoreException  success){}
571	>	/**
572	>	* pollLast succeeds unless empty
573	>	*/
574	>	public void testPollLast() {
575	>	LinkedList q = populatedQueue(SIZE);
576	>	for (int i = SIZE - 1; i >= 0; --i) {
577	>	assertEquals(i, q.pollLast());
578	>	}
579	>	assertNull(q.pollLast());
580	>	}
581	>
582	>	/**
583	>	* peekFirst returns next element, or null if empty
584	>	*/
585	>	public void testPeekFirst() {
586	>	LinkedList q = populatedQueue(SIZE);
587	>	for (int i = 0; i < SIZE; ++i) {
588	>	assertEquals(i, q.peekFirst());
589	>	assertEquals(i, q.pollFirst());
590	>	assertTrue(q.peekFirst() == null ||
591	>	!q.peekFirst().equals(i));
592	>	}
593	>	assertNull(q.peekFirst());
594	>	}
595	>
596	>	/**
597	>	* peekLast returns next element, or null if empty
598	>	*/
599	>	public void testPeekLast() {
600	>	LinkedList q = populatedQueue(SIZE);
601	>	for (int i = SIZE - 1; i >= 0; --i) {
602	>	assertEquals(i, q.peekLast());
603	>	assertEquals(i, q.pollLast());
604	>	assertTrue(q.peekLast() == null ||
605	>	!q.peekLast().equals(i));
606	>	}
607	>	assertNull(q.peekLast());
608	>	}
609	>
610	>	public void testFirstElement() {
611	>	LinkedList q = populatedQueue(SIZE);
612	>	for (int i = 0; i < SIZE; ++i) {
613	>	assertEquals(i, q.getFirst());
614	>	assertEquals(i, q.pollFirst());
615	>	}
616	>	try {
617	>	q.getFirst();
618	>	shouldThrow();
619	>	} catch (NoSuchElementException success) {}
620	>	}
621	>
622	>	/**
623	>	* getLast returns next element, or throws NSEE if empty
624	>	*/
625	>	public void testLastElement() {
626	>	LinkedList q = populatedQueue(SIZE);
627	>	for (int i = SIZE - 1; i >= 0; --i) {
628	>	assertEquals(i, q.getLast());
629	>	assertEquals(i, q.pollLast());
630	>	}
631	>	try {
632	>	q.getLast();
633	>	shouldThrow();
634	>	} catch (NoSuchElementException success) {}
635	>	assertNull(q.peekLast());
636	>	}
637	>
638	>	/**
639	>	* removeFirstOccurrence(x) removes x and returns true if present
640	>	*/
641	>	public void testRemoveFirstOccurrence() {
642	>	LinkedList q = populatedQueue(SIZE);
643	>	for (int i = 1; i < SIZE; i += 2) {
644	>	assertTrue(q.removeFirstOccurrence(new Integer(i)));
645	>	}
646	>	for (int i = 0; i < SIZE; i += 2) {
647	>	assertTrue(q.removeFirstOccurrence(new Integer(i)));
648	>	assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
649	>	}
650	>	assertTrue(q.isEmpty());
651	>	}
652	>
653	>	/**
654	>	* removeLastOccurrence(x) removes x and returns true if present
655	>	*/
656	>	public void testRemoveLastOccurrence() {
657	>	LinkedList q = populatedQueue(SIZE);
658	>	for (int i = 1; i < SIZE; i += 2) {
659	>	assertTrue(q.removeLastOccurrence(new Integer(i)));
660	>	}
661	>	for (int i = 0; i < SIZE; i += 2) {
662	>	assertTrue(q.removeLastOccurrence(new Integer(i)));
663	>	assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
664	>	}
665	>	assertTrue(q.isEmpty());
666		}
667
668		}

Diff Legend

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