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.9 by dl, Wed Sep 14 23:50:31 2005 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 33 | Line 34 | public class LinkedListTest extends JSR1
34		}
35
36		/**
37	<	*
37	>	* new queue is empty
38		*/
39		public void testConstructor1() {
40		assertEquals(0, new LinkedList().size());
41		}
42
43		/**
44	<	*
44	>	* Initializing from null Collection throws NPE
45		*/
46		public void testConstructor3() {
47		try {
#	Line 51 | Line 52 | public class LinkedListTest extends JSR1
52		}
53
54		/**
55	<	*
55	>	* Queue contains all elements of collection used to initialize
56	>
57		*/
58		public void testConstructor6() {
59		try {
#	Line 66 | Line 68 | public class LinkedListTest extends JSR1
68		}
69
70		/**
71	<	*
71	>	* isEmpty is true before add, false after
72		*/
73		public void testEmpty() {
74		LinkedList q = new LinkedList();
#	Line 80 | Line 82 | public class LinkedListTest extends JSR1
82		}
83
84		/**
85	<	*
85	>	* size changes when elements added and removed
86		*/
87		public void testSize() {
88		LinkedList q = populatedQueue(SIZE);
#	Line 95 | Line 97 | public class LinkedListTest extends JSR1
97		}
98
99		/**
100	<	*
100	>	* offer(null) succeeds
101		*/
102		public void testOfferNull() {
103		try {
#	Line 107 | Line 109 | public class LinkedListTest extends JSR1
109		}
110
111		/**
112	<	*
112	>	* Offer succeeds
113		*/
114		public void testOffer() {
115		LinkedList q = new LinkedList();
#	Line 116 | Line 118 | public class LinkedListTest extends JSR1
118		}
119
120		/**
121	<	*
121	>	* add succeeds
122		*/
123		public void testAdd() {
124		LinkedList q = new LinkedList();
#	Line 127 | Line 129 | public class LinkedListTest extends JSR1
129		}
130
131		/**
132	<	*
132	>	* addAll(null) throws NPE
133		*/
134		public void testAddAll1() {
135		try {
#	Line 139 | Line 141 | public class LinkedListTest extends JSR1
141		}
142
143		/**
144	<	*
144	>	* Queue contains all elements, in traversal order, of successful addAll
145		*/
146		public void testAddAll5() {
147		try {
#	Line 157 | Line 159 | public class LinkedListTest extends JSR1
159		}
160
161		/**
162	<	*
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);
#	Line 168 | Line 198 | public class LinkedListTest extends JSR1
198		}
199
200		/**
201	<	*
201	>	*  peek returns next element, or null if empty
202		*/
203		public void testPeek() {
204		LinkedList q = populatedQueue(SIZE);
#	Line 182 | Line 212 | public class LinkedListTest extends JSR1
212		}
213
214		/**
215	<	*
215	>	* element returns next element, or throws NSEE if empty
216		*/
217		public void testElement() {
218		LinkedList q = populatedQueue(SIZE);
#	Line 198 | Line 228 | public class LinkedListTest extends JSR1
228		}
229
230		/**
231	<	*
231	>	*  remove removes next element, or throws NSEE if empty
232		*/
233		public void testRemove() {
234		LinkedList q = populatedQueue(SIZE);
#	Line 213 | Line 243 | public class LinkedListTest extends JSR1
243		}
244
245		/**
246	<	*
246	>	* remove(x) removes x and returns true if present
247		*/
248		public void testRemoveElement() {
249		LinkedList q = populatedQueue(SIZE);
#	Line 228 | Line 258 | public class LinkedListTest extends JSR1
258		}
259
260		/**
261	<	*
261	>	* contains(x) reports true when elements added but not yet removed
262		*/
263		public void testContains() {
264		LinkedList q = populatedQueue(SIZE);
#	Line 240 | Line 270 | public class LinkedListTest extends JSR1
270		}
271
272		/**
273	<	*
273	>	* clear removes all elements
274		*/
275		public void testClear() {
276		LinkedList q = populatedQueue(SIZE);
#	Line 254 | Line 284 | public class LinkedListTest extends JSR1
284		}
285
286		/**
287	<	*
287	>	* containsAll(c) is true when c contains a subset of elements
288		*/
289		public void testContainsAll() {
290		LinkedList q = populatedQueue(SIZE);
#	Line 268 | Line 298 | public class LinkedListTest extends JSR1
298		}
299
300		/**
301	<	*
301	>	* retainAll(c) retains only those elements of c and reports true if changed
302		*/
303		public void testRetainAll() {
304		LinkedList q = populatedQueue(SIZE);
#	Line 287 | Line 317 | public class LinkedListTest extends JSR1
317		}
318
319		/**
320	<	*
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) {
#	Line 303 | Line 333 | public class LinkedListTest extends JSR1
333		}
334
335		/**
336	<	*
336	>	*  toArray contains all elements
337		*/
338		public void testToArray() {
339		LinkedList q = populatedQueue(SIZE);
#	Line 314 | Line 344 | public class LinkedListTest extends JSR1
344		}
345
346		/**
347	<	*
347	>	*  toArray(a) contains all elements
348		*/
349		public void testToArray2() {
350		LinkedList q = populatedQueue(SIZE);
#	Line 324 | 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		/**
383	<	*
383	>	*  iterator iterates through all elements
384		*/
385		public void testIterator() {
386		LinkedList q = populatedQueue(SIZE);
#	Line 340 | Line 394 | public class LinkedListTest extends JSR1
394		}
395
396		/**
397	<	*
397	>	*  iterator ordering is FIFO
398		*/
399		public void testIteratorOrdering() {
346	–
400		final LinkedList q = new LinkedList();
348	–
401		q.add(new Integer(1));
402		q.add(new Integer(2));
403		q.add(new Integer(3));
352	–
404		int k = 0;
405		for (Iterator it = q.iterator(); it.hasNext();) {
406		int i = ((Integer)(it.next())).intValue();
#	Line 360 | Line 411 | public class LinkedListTest extends JSR1
411		}
412
413		/**
414	<	*
414	>	* iterator.remove removes current element
415		*/
416		public void testIteratorRemove () {
417		final LinkedList q = new LinkedList();
367	–
418		q.add(new Integer(1));
419		q.add(new Integer(2));
420		q.add(new Integer(3));
371	–
421		Iterator it = q.iterator();
422		it.next();
423		it.remove();
375	–
424		it = q.iterator();
425		assertEquals(it.next(), new Integer(2));
426		assertEquals(it.next(), new Integer(3));
427		assertFalse(it.hasNext());
428		}
429
382	–
430		/**
431	<	*
431	>	*  Descending iterator iterates through all elements
432		*/
433	<	public void testToString() {
433	>	public void testDescendingIterator() {
434		LinkedList q = populatedQueue(SIZE);
435	<	String s = q.toString();
436	<	for (int i = 0; i < SIZE; ++i) {
437	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
435	>	int i = 0;
436	>	Iterator it = q.descendingIterator();
437	>	while(it.hasNext()) {
438	>	assertTrue(q.contains(it.next()));
439	>	++i;
440	>	}
441	>	assertEquals(i, SIZE);
442	>	assertFalse(it.hasNext());
443	>	try {
444	>	it.next();
445	>	} catch(NoSuchElementException success) {
446		}
392	–	}
393	–
394	–	/**
395	–	*
396	–	*/
397	–	public void testAddFirst() {
398	–	LinkedList q = populatedQueue(3);
399	–	q.addFirst(new Integer(4));
400	–	assertEquals(new Integer(4),q.get(0));
401	–	}
402	–
403	–	/**
404	–	*
405	–	*/
406	–	public void testAddLast() {
407	–	LinkedList q = populatedQueue(3);
408	–	q.addLast(new Integer(3));
409	–	assertEquals(new Integer(3),q.get(3));
410	–	}
411	–
412	–	/**
413	–	*
414	–	*/
415	–	public void testGetFirst() {
416	–	LinkedList q = populatedQueue(3);
417	–	assertEquals(new Integer(0),q.getFirst());
418	–	}
419	–
420	–	/**
421	–	*
422	–	*/
423	–	public void testGetLast() {
424	–	LinkedList q = populatedQueue(3);
425	–	assertEquals(new Integer(2),q.getLast());
426	–	}
427	–
428	–	/**
429	–	*
430	–	*/
431	–	public void testIndexOf() {
432	–	LinkedList q = populatedQueue(3);
433	–	assertEquals(0,q.indexOf(new Integer(0)));
434	–	assertEquals(1,q.indexOf(new Integer(1)));
435	–	assertEquals(2,q.indexOf(new Integer(2)));
436	–	assertEquals(-1, q.indexOf("not there"));
447		}
448
449		/**
450	<	*
450	>	*  Descending iterator ordering is reverse FIFO
451		*/
452	<	public void testLastIndexOf() {
453	<	LinkedList q = populatedQueue(3);
452	>	public void testDescendingIteratorOrdering() {
453	>	final LinkedList q = new LinkedList();
454	>	q.add(new Integer(3));
455		q.add(new Integer(2));
456	<	assertEquals(3,q.lastIndexOf(new Integer(2)));
457	<	assertEquals(-1, q.lastIndexOf("not there"));
458	<	}
459	<
460	<	/**
461	<	*
451	<	*/
452	<	public void testSet() {
453	<	LinkedList q = populatedQueue(3);
454	<	q.set(0,(new Integer(1)));
455	<	assertFalse(q.contains(new Integer(0)));
456	<	assertEquals(new Integer(1), q.get(0));
457	<	}
458	<
456	>	q.add(new Integer(1));
457	>	int k = 0;
458	>	for (Iterator it = q.descendingIterator(); it.hasNext();) {
459	>	int i = ((Integer)(it.next())).intValue();
460	>	assertEquals(++k, i);
461	>	}
462
463	<	/**
461	<	*
462	<	*/
463	<	public void testGetFirst_NoSuchElementException() {
464	<	try {
465	<	LinkedList l = new LinkedList();
466	<	l.getFirst();
467	<	shouldThrow();
468	<	}
469	<	catch(NoSuchElementException success) {}
470	<	}
471	<
472	<	/**
473	<	*
474	<	*/
475	<	public void testRemoveFirst() {
476	<	try {
477	<	LinkedList l = new LinkedList();
478	<	l.removeFirst();
479	<	shouldThrow();
480	<	}
481	<	catch(NoSuchElementException success) {}
482	<	}
483	<
484	<	/**
485	<	*
486	<	*/
487	<	public void testRemoveLast() {
488	<	try {
489	<	LinkedList l = new LinkedList();
490	<	l.removeLast();
491	<	shouldThrow();
492	<	}
493	<	catch(NoSuchElementException success) {}
463	>	assertEquals(3, k);
464		}
465	<
465	>
466		/**
467	<	*
467	>	* descendingIterator.remove removes current element
468		*/
469	<	public void testGetLast_NoSuchElementException() {
470	<	try {
471	<	LinkedList l = new LinkedList();
472	<	l.getLast();
473	<	shouldThrow();
474	<	}
475	<	catch(NoSuchElementException success) {}
469	>	public void testDescendingIteratorRemove () {
470	>	final LinkedList q = new LinkedList();
471	>	q.add(new Integer(3));
472	>	q.add(new Integer(2));
473	>	q.add(new Integer(1));
474	>	Iterator it = q.descendingIterator();
475	>	it.next();
476	>	it.remove();
477	>	it = q.descendingIterator();
478	>	assertEquals(it.next(), new Integer(2));
479	>	assertEquals(it.next(), new Integer(3));
480	>	assertFalse(it.hasNext());
481		}
482
483
484		/**
485	<	*
485	>	* toString contains toStrings of elements
486		*/
487	<	public void testAddAll_NullPointerException() {
488	<	try {
489	<	LinkedList l = new LinkedList();
490	<	l.addAll((Collection)null);
491	<	shouldThrow();
492	<	}
493	<	catch(NullPointerException success){}
494	<	}
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	<
487	>	public void testToString() {
488	>	LinkedList q = populatedQueue(SIZE);
489	>	String s = q.toString();
490	>	for (int i = 0; i < SIZE; ++i) {
491	>	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
492	>	}
493	>	}
494	>
495		/**
496	<	*
496	>	* peek returns element inserted with addFirst
497		*/
498	<	public void testAddAll2_IndexOutOfBoundsException() {
499	<	try {
500	<	LinkedList l = new LinkedList();
501	<	l.add(new Object());
502	<	LinkedList m = new LinkedList();
543	<	m.add(new Object());
544	<	l.addAll(4,m);
545	<	shouldThrow();
546	<	} catch(IndexOutOfBoundsException  success) {}
547	<	}
498	>	public void testAddFirst() {
499	>	LinkedList q = populatedQueue(3);
500	>	q.addFirst(four);
501	>	assertEquals(four,q.peek());
502	>	}
503
504		/**
505	<	*
505	>	* peekFirst returns element inserted with push
506		*/
507	<	public void testAddAll4_BadIndex() {
508	<	try {
509	<	LinkedList l = new LinkedList();
510	<	l.add(new Object());
511	<	LinkedList m = new LinkedList();
512	<	m.add(new Object());
558	<	l.addAll(-1,m);
559	<	shouldThrow();
560	<	} catch(IndexOutOfBoundsException  success){}
561	<	}
507	>	public void testPush() {
508	>	LinkedList q = populatedQueue(3);
509	>	q.pollLast();
510	>	q.push(four);
511	>	assertEquals(four,q.peekFirst());
512	>	}
513
514		/**
515	<	*
515	>	*  pop removes next element, or throws NSEE if empty
516		*/
517	<	public void testget1() {
518	<	try {
519	<	LinkedList l = new LinkedList();
520	<	l.add(new Object());
521	<	l.get(-1);
522	<	shouldThrow();
523	<	} catch(IndexOutOfBoundsException  success) {}
517	>	public void testPop() {
518	>	LinkedList q = populatedQueue(SIZE);
519	>	for (int i = 0; i < SIZE; ++i) {
520	>	assertEquals(i, ((Integer)q.pop()).intValue());
521	>	}
522	>	try {
523	>	q.pop();
524	>	shouldThrow();
525	>	} catch (NoSuchElementException success){
526	>	}
527		}
528
529		/**
530	<	*
530	>	* OfferFirst succeeds
531		*/
532	<	public void testget2() {
533	<	try {
534	<	LinkedList l = new LinkedList();
535	<	l.add(new Object());
582	<	l.get(5);
583	<	shouldThrow();
584	<	} catch(IndexOutOfBoundsException  success){}
532	>	public void testOfferFirst() {
533	>	LinkedList q = new LinkedList();
534	>	assertTrue(q.offerFirst(new Integer(0)));
535	>	assertTrue(q.offerFirst(new Integer(1)));
536		}
537
538		/**
539	<	*
539	>	* OfferLast succeeds
540		*/
541	<	public void testset1() {
542	<	try {
543	<	LinkedList l = new LinkedList();
544	<	l.add(new Object());
594	<	l.set(-1,new Object());
595	<	shouldThrow();
596	<	} catch(IndexOutOfBoundsException  success){}
541	>	public void testOfferLast() {
542	>	LinkedList q = new LinkedList();
543	>	assertTrue(q.offerLast(new Integer(0)));
544	>	assertTrue(q.offerLast(new Integer(1)));
545		}
546
547		/**
548	<	*
548	>	*  pollLast succeeds unless empty
549		*/
550	<	public void testset2() {
551	<	try {
552	<	LinkedList l = new LinkedList();
553	<	l.add(new Object());
554	<	l.set(5,new Object());
555	<	shouldThrow();
608	<	} catch(IndexOutOfBoundsException  success){}
550	>	public void testPollLast() {
551	>	LinkedList q = populatedQueue(SIZE);
552	>	for (int i = SIZE-1; i >= 0; --i) {
553	>	assertEquals(i, ((Integer)q.pollLast()).intValue());
554	>	}
555	>	assertNull(q.pollLast());
556		}
557
558		/**
559	<	*
559	>	*  peekFirst returns next element, or null if empty
560		*/
561	<	public void testadd1() {
562	<	try {
563	<	LinkedList l = new LinkedList();
564	<	l.add(new Object());
565	<	l.add(-1,new Object());
566	<	shouldThrow();
567	<	} catch(IndexOutOfBoundsException  success){}
561	>	public void testPeekFirst() {
562	>	LinkedList q = populatedQueue(SIZE);
563	>	for (int i = 0; i < SIZE; ++i) {
564	>	assertEquals(i, ((Integer)q.peekFirst()).intValue());
565	>	q.pollFirst();
566	>	assertTrue(q.peekFirst() == null ||
567	>	i != ((Integer)q.peekFirst()).intValue());
568	>	}
569	>	assertNull(q.peekFirst());
570		}
571
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) {}
630	–	}
572
573		/**
574	<	*
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	<	*
574	>	*  peekLast returns next element, or null if empty
575		*/
576	<	public void testremove1() {
577	<	try {
578	<	LinkedList l = new LinkedList();
579	<	l.add(new Object());
580	<	l.remove(5);
581	<	shouldThrow();
582	<	} catch(IndexOutOfBoundsException  success){}
576	>	public void testPeekLast() {
577	>	LinkedList q = populatedQueue(SIZE);
578	>	for (int i = SIZE-1; i >= 0; --i) {
579	>	assertEquals(i, ((Integer)q.peekLast()).intValue());
580	>	q.pollLast();
581	>	assertTrue(q.peekLast() == null ||
582	>	i != ((Integer)q.peekLast()).intValue());
583	>	}
584	>	assertNull(q.peekLast());
585		}
586
587	<
588	<	/**
589	<	*
590	<	*/
591	<	public void testremove2() {
587	>	public void testFirstElement() {
588	>	LinkedList q = populatedQueue(SIZE);
589	>	for (int i = 0; i < SIZE; ++i) {
590	>	assertEquals(i, ((Integer)q.getFirst()).intValue());
591	>	q.pollFirst();
592	>	}
593		try {
594	<	LinkedList l = new LinkedList();
663	<	l.remove();
594	>	q.getFirst();
595		shouldThrow();
596	<	} catch(NoSuchElementException e){}
596	>	}
597	>	catch (NoSuchElementException success) {}
598		}
599
600		/**
601	<	*
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	<	*
601	>	*  getLast returns next element, or throws NSEE if empty
602		*/
603	<	public void testlistIt3() {
604	<	try {
605	<	LinkedList l = new LinkedList();
606	<	l.add(new Object());
607	<	ListIterator a = l.listIterator(0);
608	<	l.removeFirst();
609	<	a.next();
610	<	shouldThrow();
611	<	} catch(ConcurrentModificationException success){}
603	>	public void testLastElement() {
604	>	LinkedList q = populatedQueue(SIZE);
605	>	for (int i = SIZE-1; i >= 0; --i) {
606	>	assertEquals(i, ((Integer)q.getLast()).intValue());
607	>	q.pollLast();
608	>	}
609	>	try {
610	>	q.getLast();
611	>	shouldThrow();
612	>	}
613	>	catch (NoSuchElementException success) {}
614	>	assertNull(q.peekLast());
615		}
616
617		/**
618	<	*
618	>	* removeFirstOccurrence(x) removes x and returns true if present
619		*/
620	<	public void testToArray_BadArg() {
621	<	try {
622	<	LinkedList l = new LinkedList();
623	<	l.add(new Object());
624	<	Object o[] = l.toArray(null);
625	<	shouldThrow();
626	<	} catch(NullPointerException success){}
620	>	public void testRemoveFirstOccurrence() {
621	>	LinkedList q = populatedQueue(SIZE);
622	>	for (int i = 1; i < SIZE; i+=2) {
623	>	assertTrue(q.removeFirstOccurrence(new Integer(i)));
624	>	}
625	>	for (int i = 0; i < SIZE; i+=2) {
626	>	assertTrue(q.removeFirstOccurrence(new Integer(i)));
627	>	assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
628	>	}
629	>	assertTrue(q.isEmpty());
630		}
631
632		/**
633	<	*
633	>	* removeLastOccurrence(x) removes x and returns true if present
634		*/
635	<	public void testToArray1_BadArg() {
636	<	try {
637	<	LinkedList l = new LinkedList();
638	<	l.add(new Integer(5));
639	<	Object o[] = l.toArray(new String[10] );
640	<	shouldThrow();
641	<	} catch(ArrayStoreException  success){}
635	>	public void testRemoveLastOccurrence() {
636	>	LinkedList q = populatedQueue(SIZE);
637	>	for (int i = 1; i < SIZE; i+=2) {
638	>	assertTrue(q.removeLastOccurrence(new Integer(i)));
639	>	}
640	>	for (int i = 0; i < SIZE; i+=2) {
641	>	assertTrue(q.removeLastOccurrence(new Integer(i)));
642	>	assertFalse(q.removeLastOccurrence(new Integer(i+1)));
643	>	}
644	>	assertTrue(q.isEmpty());
645		}
646
647		}

Diff Legend

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