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.3 by dl, Sun Sep 14 20:42:40 2003 UTC vs.
Revision 1.7 by dl, Sat Dec 27 19:26:43 2003 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/licenses/publicdomain
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9		import junit.framework.*;
#	Line 32 | Line 33 | public class LinkedListTest extends JSR1
33		return q;
34		}
35
36	<	public void testConstructor1(){
36	>	/**
37	>	* new queue is empty
38	>	*/
39	>	public void testConstructor1() {
40		assertEquals(0, new LinkedList().size());
41		}
42
43	+	/**
44	+	* Initializing from null Collection throws NPE
45	+	*/
46		public void testConstructor3() {
47		try {
48		LinkedList q = new LinkedList((Collection)null);
49	<	fail("Cannot make from null collection");
49	>	shouldThrow();
50		}
51		catch (NullPointerException success) {}
52		}
53
54	<	public void testConstructor6(){
54	>	/**
55	>	* Queue contains all elements of collection used to initialize
56	>
57	>	*/
58	>	public void testConstructor6() {
59		try {
60		Integer[] ints = new Integer[SIZE];
61		for (int i = 0; i < SIZE; ++i)
#	Line 56 | Line 67 | public class LinkedListTest extends JSR1
67		finally {}
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 67 | Line 81 | public class LinkedListTest extends JSR1
81		assertTrue(q.isEmpty());
82		}
83
84	+	/**
85	+	* size changes when elements added and removed
86	+	*/
87		public void testSize() {
88		LinkedList q = populatedQueue(SIZE);
89		for (int i = 0; i < SIZE; ++i) {
#	Line 79 | Line 96 | public class LinkedListTest extends JSR1
96		}
97		}
98
99	<	public void testOfferNull(){
99	>	/**
100	>	* offer(null) succeeds
101	>	*/
102	>	public void testOfferNull() {
103		try {
104		LinkedList q = new LinkedList();
105		q.offer(null);
106		} catch (NullPointerException ie) {
107	<	fail("should not throw NPE");
107	>	unexpectedException();
108		}
109		}
110
111	+	/**
112	+	* Offer succeeds
113	+	*/
114		public void testOffer() {
115		LinkedList q = new LinkedList();
116		assertTrue(q.offer(new Integer(0)));
117		assertTrue(q.offer(new Integer(1)));
118		}
119
120	<	public void testAdd(){
120	>	/**
121	>	* add succeeds
122	>	*/
123	>	public void testAdd() {
124		LinkedList q = new LinkedList();
125		for (int i = 0; i < SIZE; ++i) {
126		assertEquals(i, q.size());
#	Line 102 | Line 128 | public class LinkedListTest extends JSR1
128		}
129		}
130
131	<	public void testAddAll1(){
131	>	/**
132	>	* addAll(null) throws NPE
133	>	*/
134	>	public void testAddAll1() {
135		try {
136		LinkedList q = new LinkedList();
137		q.addAll(null);
138	<	fail("Cannot add null collection");
138	>	shouldThrow();
139		}
140		catch (NullPointerException success) {}
141		}
142
143	<	public void testAddAll5(){
143	>	/**
144	>	* Queue contains all elements, in traversal order, of successful addAll
145	>	*/
146	>	public void testAddAll5() {
147		try {
148		Integer[] empty = new Integer[0];
149		Integer[] ints = new Integer[SIZE];
#	Line 126 | Line 158 | public class LinkedListTest extends JSR1
158		finally {}
159		}
160
161	<	public void testPoll(){
161	>	/**
162	>	* addAll with too large an index throws IOOBE
163	>	*/
164	>	public void testAddAll2_IndexOutOfBoundsException() {
165	>	try {
166	>	LinkedList l = new LinkedList();
167	>	l.add(new Object());
168	>	LinkedList m = new LinkedList();
169	>	m.add(new Object());
170	>	l.addAll(4,m);
171	>	shouldThrow();
172	>	} catch(IndexOutOfBoundsException  success) {}
173	>	}
174	>
175	>	/**
176	>	* addAll with negative index throws IOOBE
177	>	*/
178	>	public void testAddAll4_BadIndex() {
179	>	try {
180	>	LinkedList l = new LinkedList();
181	>	l.add(new Object());
182	>	LinkedList m = new LinkedList();
183	>	m.add(new Object());
184	>	l.addAll(-1,m);
185	>	shouldThrow();
186	>	} catch(IndexOutOfBoundsException  success){}
187	>	}
188	>
189	>	/**
190	>	*  poll succeeds unless empty
191	>	*/
192	>	public void testPoll() {
193		LinkedList q = populatedQueue(SIZE);
194		for (int i = 0; i < SIZE; ++i) {
195		assertEquals(i, ((Integer)q.poll()).intValue());
#	Line 134 | Line 197 | public class LinkedListTest extends JSR1
197		assertNull(q.poll());
198		}
199
200	<	public void testPeek(){
200	>	/**
201	>	*  peek returns next element, or null if empty
202	>	*/
203	>	public void testPeek() {
204		LinkedList q = populatedQueue(SIZE);
205		for (int i = 0; i < SIZE; ++i) {
206		assertEquals(i, ((Integer)q.peek()).intValue());
#	Line 145 | Line 211 | public class LinkedListTest extends JSR1
211		assertNull(q.peek());
212		}
213
214	<	public void testElement(){
214	>	/**
215	>	* element returns next element, or throws NSEE if empty
216	>	*/
217	>	public void testElement() {
218		LinkedList q = populatedQueue(SIZE);
219		for (int i = 0; i < SIZE; ++i) {
220		assertEquals(i, ((Integer)q.element()).intValue());
#	Line 153 | Line 222 | public class LinkedListTest extends JSR1
222		}
223		try {
224		q.element();
225	<	fail("no such element");
225	>	shouldThrow();
226		}
227		catch (NoSuchElementException success) {}
228		}
229
230	<	public void testRemove(){
230	>	/**
231	>	*  remove removes next element, or throws NSEE if empty
232	>	*/
233	>	public void testRemove() {
234		LinkedList q = populatedQueue(SIZE);
235		for (int i = 0; i < SIZE; ++i) {
236		assertEquals(i, ((Integer)q.remove()).intValue());
237		}
238		try {
239		q.remove();
240	<	fail("remove should throw");
240	>	shouldThrow();
241		} catch (NoSuchElementException success){
242		}
243		}
244
245	<	public void testRemoveElement(){
245	>	/**
246	>	* remove(x) removes x and returns true if present
247	>	*/
248	>	public void testRemoveElement() {
249		LinkedList q = populatedQueue(SIZE);
250		for (int i = 1; i < SIZE; i+=2) {
251		assertTrue(q.remove(new Integer(i)));
#	Line 182 | Line 257 | public class LinkedListTest extends JSR1
257		assertTrue(q.isEmpty());
258		}
259
260	<	public void testContains(){
260	>	/**
261	>	* contains(x) reports true when elements added but not yet removed
262	>	*/
263	>	public void testContains() {
264		LinkedList q = populatedQueue(SIZE);
265		for (int i = 0; i < SIZE; ++i) {
266		assertTrue(q.contains(new Integer(i)));
#	Line 191 | Line 269 | public class LinkedListTest extends JSR1
269		}
270		}
271
272	<	public void testClear(){
272	>	/**
273	>	* clear removes all elements
274	>	*/
275	>	public void testClear() {
276		LinkedList q = populatedQueue(SIZE);
277		q.clear();
278		assertTrue(q.isEmpty());
#	Line 202 | Line 283 | public class LinkedListTest extends JSR1
283		assertTrue(q.isEmpty());
284		}
285
286	<	public void testContainsAll(){
286	>	/**
287	>	* containsAll(c) is true when c contains a subset of elements
288	>	*/
289	>	public void testContainsAll() {
290		LinkedList q = populatedQueue(SIZE);
291		LinkedList p = new LinkedList();
292		for (int i = 0; i < SIZE; ++i) {
#	Line 213 | Line 297 | public class LinkedListTest extends JSR1
297		assertTrue(p.containsAll(q));
298		}
299
300	<	public void testRetainAll(){
300	>	/**
301	>	* retainAll(c) retains only those elements of c and reports true if changed
302	>	*/
303	>	public void testRetainAll() {
304		LinkedList q = populatedQueue(SIZE);
305		LinkedList p = populatedQueue(SIZE);
306		for (int i = 0; i < SIZE; ++i) {
#	Line 229 | Line 316 | public class LinkedListTest extends JSR1
316		}
317		}
318
319	<	public void testRemoveAll(){
319	>	/**
320	>	* removeAll(c) removes only those elements of c and reports true if changed
321	>	*/
322	>	public void testRemoveAll() {
323		for (int i = 1; i < SIZE; ++i) {
324		LinkedList q = populatedQueue(SIZE);
325		LinkedList p = populatedQueue(i);
#	Line 242 | Line 332 | public class LinkedListTest extends JSR1
332		}
333		}
334
335	<	public void testToArray(){
335	>	/**
336	>	*  toArray contains all elements
337	>	*/
338	>	public void testToArray() {
339		LinkedList q = populatedQueue(SIZE);
340		Object[] o = q.toArray();
341		Arrays.sort(o);
#	Line 250 | Line 343 | public class LinkedListTest extends JSR1
343		assertEquals(o[i], q.poll());
344		}
345
346	<	public void testToArray2(){
346	>	/**
347	>	*  toArray(a) contains all elements
348	>	*/
349	>	public void testToArray2() {
350		LinkedList q = populatedQueue(SIZE);
351		Integer[] ints = new Integer[SIZE];
352		ints = (Integer[])q.toArray(ints);
#	Line 258 | Line 354 | public class LinkedListTest extends JSR1
354		for(int i = 0; i < ints.length; i++)
355		assertEquals(ints[i], q.poll());
356		}
357	+
358	+	/**
359	+	* toArray(null) throws NPE
360	+	*/
361	+	public void testToArray_BadArg() {
362	+	try {
363	+	LinkedList l = new LinkedList();
364	+	l.add(new Object());
365	+	Object o[] = l.toArray(null);
366	+	shouldThrow();
367	+	} catch(NullPointerException success){}
368	+	}
369	+
370	+	/**
371	+	* toArray with incompatable aray type throws CCE
372	+	*/
373	+	public void testToArray1_BadArg() {
374	+	try {
375	+	LinkedList l = new LinkedList();
376	+	l.add(new Integer(5));
377	+	Object o[] = l.toArray(new String[10] );
378	+	shouldThrow();
379	+	} catch(ArrayStoreException  success){}
380	+	}
381
382	<	public void testIterator(){
382	>	/**
383	>	*  iterator iterates through all elements
384	>	*/
385	>	public void testIterator() {
386		LinkedList q = populatedQueue(SIZE);
387		int i = 0;
388		Iterator it = q.iterator();
#	Line 270 | Line 393 | public class LinkedListTest extends JSR1
393		assertEquals(i, SIZE);
394		}
395
396	+	/**
397	+	*  iterator ordering is FIFO
398	+	*/
399		public void testIteratorOrdering() {
274	–
400		final LinkedList q = new LinkedList();
276	–
401		q.add(new Integer(1));
402		q.add(new Integer(2));
403		q.add(new Integer(3));
280	–
404		int k = 0;
405		for (Iterator it = q.iterator(); it.hasNext();) {
406		int i = ((Integer)(it.next())).intValue();
407	<	assertEquals("items should come out in order", ++k, i);
407	>	assertEquals(++k, i);
408		}
409
410	<	assertEquals("should go through 3 elements", 3, k);
410	>	assertEquals(3, k);
411		}
412
413	+	/**
414	+	* iterator.remove removes current element
415	+	*/
416		public void testIteratorRemove () {
417		final LinkedList q = new LinkedList();
292	–
418		q.add(new Integer(1));
419		q.add(new Integer(2));
420		q.add(new Integer(3));
296	–
421		Iterator it = q.iterator();
422		it.next();
423		it.remove();
300	–
424		it = q.iterator();
425		assertEquals(it.next(), new Integer(2));
426		assertEquals(it.next(), new Integer(3));
#	Line 305 | Line 428 | public class LinkedListTest extends JSR1
428		}
429
430
431	<	public void testToString(){
431	>	/**
432	>	* toString contains toStrings of elements
433	>	*/
434	>	public void testToString() {
435		LinkedList q = populatedQueue(SIZE);
436		String s = q.toString();
437		for (int i = 0; i < SIZE; ++i) {
#	Line 313 | Line 439 | public class LinkedListTest extends JSR1
439		}
440		}
441
442	<	public void testAddFirst(){
443	<	LinkedList q = populatedQueue(3);
444	<	q.addFirst(new Integer(4));
445	<	assertEquals(new Integer(4),q.get(0));
320	<	}
321	<
322	<	public void testAddLast(){
323	<	LinkedList q = populatedQueue(3);
324	<	q.addLast(new Integer(3));
325	<	assertEquals(new Integer(3),q.get(3));
326	<	}
327	<
328	<	public void testGetFirst() {
442	>	/**
443	>	* peek returns element inserted with addFirst
444	>	*/
445	>	public void testAddFirst() {
446		LinkedList q = populatedQueue(3);
447	<	assertEquals(new Integer(0),q.getFirst());
447	>	q.addFirst(four);
448	>	assertEquals(four,q.peek());
449		}
332	–
333	–	public void testGetLast() {
334	–	LinkedList q = populatedQueue(3);
335	–	assertEquals(new Integer(2),q.getLast());
336	–	}
337	–
338	–	public void testIndexOf(){
339	–	LinkedList q = populatedQueue(3);
340	–	assertEquals(0,q.indexOf(new Integer(0)));
341	–	assertEquals(1,q.indexOf(new Integer(1)));
342	–	assertEquals(2,q.indexOf(new Integer(2)));
343	–	assertEquals(-1, q.indexOf("not there"));
344	–	}
345	–
346	–	public void testLastIndexOf(){
347	–	LinkedList q = populatedQueue(3);
348	–	q.add(new Integer(2));
349	–	assertEquals(3,q.lastIndexOf(new Integer(2)));
350	–	assertEquals(-1, q.lastIndexOf("not there"));
351	–	}
352	–
353	–	public void testSet(){
354	–	LinkedList q = populatedQueue(3);
355	–	q.set(0,(new Integer(1)));
356	–	assertFalse(q.contains(new Integer(0)));
357	–	assertEquals(new Integer(1), q.get(0));
358	–	}
359	–
360	–
361	–	public void testGetFirst_NoSuchElementException(){
362	–	try {
363	–	LinkedList l = new LinkedList();
364	–	l.getFirst();
365	–	fail("First Element");
366	–	}
367	–	catch(NoSuchElementException success) {}
368	–	}
369	–
370	–	public void testRemoveFirst() {
371	–	try {
372	–	LinkedList l = new LinkedList();
373	–	l.removeFirst();
374	–	fail("R: First Element");
375	–	}
376	–	catch(NoSuchElementException success) {}
377	–	}
378	–
379	–	public void testRemoveLast() {
380	–	try {
381	–	LinkedList l = new LinkedList();
382	–	l.removeLast();
383	–	fail("R: Last Element");
384	–	}
385	–	catch(NoSuchElementException success) {}
386	–	}
387	–
388	–	public void testGetLast_NoSuchElementException(){
389	–	try {
390	–	LinkedList l = new LinkedList();
391	–	l.getLast();
392	–	fail("Last Element");
393	–	}
394	–	catch(NoSuchElementException success) {}
395	–	}
396	–
397	–
398	–	public void testAddAll_NullPointerException(){
399	–	try {
400	–	LinkedList l = new LinkedList();
401	–	l.addAll((Collection)null);
402	–	fail("Add All Failed");
403	–	}
404	–	catch(NullPointerException success){}
405	–	}
406	–
407	–
408	–	public void testAddAll1_OutOfBounds() {
409	–	try {
410	–	LinkedList l = new LinkedList();
411	–	l.addAll(4,new LinkedList());
412	–	fail("boolean addAll(int, Collection) should throw IndexOutOfBoundsException");
413	–	}
414	–	catch(IndexOutOfBoundsException  success) {}
415	–	}
416	–
417	–
418	–	public void testAddAll2_IndexOutOfBoundsException() {
419	–	try {
420	–	LinkedList l = new LinkedList();
421	–	l.add(new Object());
422	–	LinkedList m = new LinkedList();
423	–	m.add(new Object());
424	–	l.addAll(4,m);
425	–	fail("Add All Failed " + l.size());
426	–	}catch(IndexOutOfBoundsException  success) {}
427	–	}
428	–
429	–	public void testAddAll4_BadIndex() {
430	–	try {
431	–	LinkedList l = new LinkedList();
432	–	l.add(new Object());
433	–	LinkedList m = new LinkedList();
434	–	m.add(new Object());
435	–	l.addAll(-1,m);
436	–	fail("Add All Failed " + l.size());
437	–	}catch(IndexOutOfBoundsException  success){}
438	–	}
439	–
440	–	public void testget1() {
441	–	try {
442	–	LinkedList l = new LinkedList();
443	–	l.add(new Object());
444	–	l.get(-1);
445	–	fail("get Failed - l.get(-1)");
446	–	}catch(IndexOutOfBoundsException  success) {}
447	–	}
448	–
449	–	public void testget2() {
450	–	try {
451	–	LinkedList l = new LinkedList();
452	–	l.add(new Object());
453	–	l.get(5);
454	–	fail("get Failed - l.get(5) l.size(): " + l.size());
455	–	}catch(IndexOutOfBoundsException  success){}
456	–	}
457	–
458	–	public void testset1() {
459	–	try {
460	–	LinkedList l = new LinkedList();
461	–	l.add(new Object());
462	–	l.set(-1,new Object());
463	–	fail("set failed - l.set(-1,...)" + l.size());
464	–	}catch(IndexOutOfBoundsException  success){}
465	–	}
466	–
467	–	public void testset2() {
468	–	try {
469	–	LinkedList l = new LinkedList();
470	–	l.add(new Object());
471	–	l.set(5,new Object());
472	–	fail("set failed = l.set(5,..) l.size():" + l.size());
473	–	}catch(IndexOutOfBoundsException  success){}
474	–	}
475	–
476	–	public void testadd1() {
477	–	try {
478	–	LinkedList l = new LinkedList();
479	–	l.add(new Object());
480	–	l.add(-1,new Object());
481	–	fail("Add Failed - l.add(-1) l.size(): " + l.size());
482	–	}catch(IndexOutOfBoundsException  success){}
483	–	}
484	–
485	–	public void add2(){
486	–	try {
487	–	LinkedList l = new LinkedList();
488	–	l.add(new Object());
489	–	l.add(5,new Object());
490	–	fail("Add Failed  l.add(f,...)");
491	–	}catch(IndexOutOfBoundsException  success) {}
492	–	}
493	–
494	–	public void testremove(){
495	–	try {
496	–	LinkedList l = new LinkedList();
497	–	l.add(new Object());
498	–	l.remove(-1);
499	–	fail("Remove Failed l.remove(-1); l.size():" + l.size());
500	–	}catch(IndexOutOfBoundsException  success){}
501	–	}
502	–
503	–	public void testremove1(){
504	–	try {
505	–	LinkedList l = new LinkedList();
506	–	l.add(new Object());
507	–	l.remove(5);
508	–	fail("Remove Failed l.remove(5); l.size():" + l.size());
509	–	}catch(IndexOutOfBoundsException  success){}
510	–	}
511	–
512	–
513	–	public void testremove2(){
514	–	try{
515	–	LinkedList l = new LinkedList();
516	–	l.remove();
517	–	fail("LinkedList - Object remove() should throw a NoSuchElementException");
518	–	}catch(NoSuchElementException e){}
519	–	}
520	–
521	–	public void testlistIt1() {
522	–	try {
523	–	LinkedList l = new LinkedList();
524	–	l.add(new Object());
525	–	l.listIterator(5);
526	–	fail("l.listIterator(5) l.size():" + l.size());
527	–	}catch(IndexOutOfBoundsException  success){}
528	–	}
529	–
530	–	public void testlistIt2() {
531	–	try {
532	–	LinkedList l = new LinkedList();
533	–	l.add(new Object());
534	–	l.listIterator(-1);
535	–	fail("l.listIterator(-1) l.size():" + l.size());
536	–	}catch(IndexOutOfBoundsException  success){}
537	–	}
538	–
539	–	public void testlistIt3() {
540	–	try {
541	–	LinkedList l = new LinkedList();
542	–	l.add(new Object());
543	–	ListIterator a = l.listIterator(0);
544	–	l.removeFirst();
545	–	a.next();
546	–	fail("l.listIterator(-1) l.size():" + l.size());
547	–	}catch(ConcurrentModificationException success){}
548	–	}
549	–
550	–	public void testToArray_BadArg() {
551	–	try {
552	–	LinkedList l = new LinkedList();
553	–	l.add(new Object());
554	–	Object o[] = l.toArray(null);
555	–	fail("l.toArray(null) did not throw an exception");
556	–	}catch(NullPointerException success){}
557	–	}
558	–
559	–	public void testToArray1_BadArg() {
560	–	try {
561	–	LinkedList l = new LinkedList();
562	–	l.add(new Integer(5));
563	–	Object o[] = l.toArray(new String[10] );
564	–	fail("l.toArray(String[] f) did not throw an exception, an Integer was added");
565	–	}catch(ArrayStoreException  success){}
566	–	}
450
451		}

Diff Legend

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