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.11 by jsr166, Mon Nov 16 04:57:10 2009 UTC vs.
Revision 1.41 by jsr166, Sun Oct 16 20:44:18 2016 UTC

#	Line 1 | Line 1
1		/*
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
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		* Other contributors include Andrew Wright, Jeffrey Hayes,
6		* Pat Fisher, Mike Judd.
7		*/
8
9	<	import junit.framework.*;
10	<	import java.util.*;
11	<	import java.util.concurrent.*;
9	>	import java.util.Arrays;
10	>	import java.util.Collection;
11	>	import java.util.Iterator;
12	>	import java.util.LinkedList;
13	>	import java.util.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
29	<	* Integers 0 ... n.
28	>	* Returns a new queue of given size containing consecutive
29	>	* Integers 0 ... n - 1.
30		*/
31	<	private LinkedList populatedQueue(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	>	assertEquals((Integer) 0, q.peekFirst());
39	>	assertEquals((Integer) (n - 1), q.peekLast());
40		return q;
41		}
42
#	Line 45 | Line 52 | public class LinkedListTest extends JSR1
52		*/
53		public void testConstructor3() {
54		try {
55	<	LinkedList q = new LinkedList((Collection)null);
55	>	new LinkedList((Collection)null);
56		shouldThrow();
57	<	}
51	<	catch (NullPointerException success) {}
57	>	} catch (NullPointerException success) {}
58		}
59
60		/**
61		* Queue contains all elements of collection used to initialize
56	–
62		*/
63		public void testConstructor6() {
64	<	try {
65	<	Integer[] ints = new Integer[SIZE];
66	<	for (int i = 0; i < SIZE; ++i)
67	<	ints[i] = new Integer(i);
68	<	LinkedList q = new LinkedList(Arrays.asList(ints));
69	<	for (int i = 0; i < SIZE; ++i)
65	<	assertEquals(ints[i], q.poll());
66	<	}
67	<	finally {}
64	>	Integer[] ints = new Integer[SIZE];
65	>	for (int i = 0; i < SIZE; ++i)
66	>	ints[i] = i;
67	>	LinkedList q = new LinkedList(Arrays.asList(ints));
68	>	for (int i = 0; i < SIZE; ++i)
69	>	assertEquals(ints[i], q.poll());
70		}
71
72		/**
#	Line 87 | Line 89 | public class LinkedListTest extends JSR1
89		public void testSize() {
90		LinkedList q = populatedQueue(SIZE);
91		for (int i = 0; i < SIZE; ++i) {
92	<	assertEquals(SIZE-i, q.size());
92	>	assertEquals(SIZE - i, q.size());
93		q.remove();
94		}
95		for (int i = 0; i < SIZE; ++i) {
#	Line 100 | Line 102 | public class LinkedListTest extends JSR1
102		* offer(null) succeeds
103		*/
104		public void testOfferNull() {
105	<	try {
106	<	LinkedList q = new LinkedList();
107	<	q.offer(null);
108	<	} catch (NullPointerException ie) {
107	<	unexpectedException();
108	<	}
105	>	LinkedList q = new LinkedList();
106	>	q.offer(null);
107	>	assertNull(q.get(0));
108	>	assertTrue(q.contains(null));
109		}
110
111		/**
#	Line 132 | Line 132 | public class LinkedListTest extends JSR1
132		* addAll(null) throws NPE
133		*/
134		public void testAddAll1() {
135	+	LinkedList q = new LinkedList();
136		try {
136	–	LinkedList q = new LinkedList();
137		q.addAll(null);
138		shouldThrow();
139	<	}
140	<	catch (NullPointerException success) {}
139	>	} catch (NullPointerException success) {}
140		}
141
142		/**
143		* Queue contains all elements, in traversal order, of successful addAll
144		*/
145		public void testAddAll5() {
146	<	try {
147	<	Integer[] empty = new Integer[0];
148	<	Integer[] ints = new Integer[SIZE];
149	<	for (int i = 0; i < SIZE; ++i)
150	<	ints[i] = new Integer(i);
151	<	LinkedList q = new LinkedList();
152	<	assertFalse(q.addAll(Arrays.asList(empty)));
153	<	assertTrue(q.addAll(Arrays.asList(ints)));
154	<	for (int i = 0; i < SIZE; ++i)
156	<	assertEquals(ints[i], q.poll());
157	<	}
158	<	finally {}
146	>	Integer[] empty = new Integer[0];
147	>	Integer[] ints = new Integer[SIZE];
148	>	for (int i = 0; i < SIZE; ++i)
149	>	ints[i] = i;
150	>	LinkedList q = new LinkedList();
151	>	assertFalse(q.addAll(Arrays.asList(empty)));
152	>	assertTrue(q.addAll(Arrays.asList(ints)));
153	>	for (int i = 0; i < SIZE; ++i)
154	>	assertEquals(ints[i], q.poll());
155		}
156
157		/**
158		* addAll with too large an index throws IOOBE
159		*/
160		public void testAddAll2_IndexOutOfBoundsException() {
161	<	try {
162	<	LinkedList l = new LinkedList();
163	<	l.add(new Object());
164	<	LinkedList m = new LinkedList();
165	<	m.add(new Object());
166	<	l.addAll(4,m);
167	<	shouldThrow();
168	<	} catch (IndexOutOfBoundsException  success) {}
161	>	LinkedList l = new LinkedList();
162	>	l.add(new Object());
163	>	LinkedList m = new LinkedList();
164	>	m.add(new Object());
165	>	try {
166	>	l.addAll(4,m);
167	>	shouldThrow();
168	>	} catch (IndexOutOfBoundsException success) {}
169		}
170
171		/**
172		* addAll with negative index throws IOOBE
173		*/
174		public void testAddAll4_BadIndex() {
175	<	try {
176	<	LinkedList l = new LinkedList();
177	<	l.add(new Object());
178	<	LinkedList m = new LinkedList();
179	<	m.add(new Object());
180	<	l.addAll(-1,m);
181	<	shouldThrow();
182	<	} catch (IndexOutOfBoundsException  success){}
175	>	LinkedList l = new LinkedList();
176	>	l.add(new Object());
177	>	LinkedList m = new LinkedList();
178	>	m.add(new Object());
179	>	try {
180	>	l.addAll(-1,m);
181	>	shouldThrow();
182	>	} catch (IndexOutOfBoundsException success) {}
183		}
184
185		/**
186	<	*  poll succeeds unless empty
186	>	* poll succeeds unless empty
187		*/
188		public void testPoll() {
189		LinkedList q = populatedQueue(SIZE);
190		for (int i = 0; i < SIZE; ++i) {
191	<	assertEquals(i, ((Integer)q.poll()).intValue());
191	>	assertEquals(i, q.poll());
192		}
193	<	assertNull(q.poll());
193	>	assertNull(q.poll());
194		}
195
196		/**
197	<	*  peek returns next element, or null if empty
197	>	* peek returns next element, or null if empty
198		*/
199		public void testPeek() {
200		LinkedList q = populatedQueue(SIZE);
201		for (int i = 0; i < SIZE; ++i) {
202	<	assertEquals(i, ((Integer)q.peek()).intValue());
203	<	q.poll();
202	>	assertEquals(i, q.peek());
203	>	assertEquals(i, q.poll());
204		assertTrue(q.peek() == null ||
205	<	i != ((Integer)q.peek()).intValue());
205	>	!q.peek().equals(i));
206		}
207	<	assertNull(q.peek());
207	>	assertNull(q.peek());
208		}
209
210		/**
#	Line 217 | Line 213 | public class LinkedListTest extends JSR1
213		public void testElement() {
214		LinkedList q = populatedQueue(SIZE);
215		for (int i = 0; i < SIZE; ++i) {
216	<	assertEquals(i, ((Integer)q.element()).intValue());
217	<	q.poll();
216	>	assertEquals(i, q.element());
217	>	assertEquals(i, q.poll());
218		}
219		try {
220		q.element();
221		shouldThrow();
222	<	}
227	<	catch (NoSuchElementException success) {}
222	>	} catch (NoSuchElementException success) {}
223		}
224
225		/**
226	<	*  remove removes next element, or throws NSEE if empty
226	>	* remove removes next element, or throws NSEE if empty
227		*/
228		public void testRemove() {
229		LinkedList q = populatedQueue(SIZE);
230		for (int i = 0; i < SIZE; ++i) {
231	<	assertEquals(i, ((Integer)q.remove()).intValue());
231	>	assertEquals(i, q.remove());
232		}
233		try {
234		q.remove();
235		shouldThrow();
236	<	} catch (NoSuchElementException success){
242	<	}
236	>	} catch (NoSuchElementException success) {}
237		}
238
239		/**
#	Line 247 | Line 241 | public class LinkedListTest extends JSR1
241		*/
242		public void testRemoveElement() {
243		LinkedList q = populatedQueue(SIZE);
244	<	for (int i = 1; i < SIZE; i+=2) {
245	<	assertTrue(q.remove(new Integer(i)));
246	<	}
247	<	for (int i = 0; i < SIZE; i+=2) {
248	<	assertTrue(q.remove(new Integer(i)));
249	<	assertFalse(q.remove(new Integer(i+1)));
244	>	for (int i = 1; i < SIZE; i += 2) {
245	>	assertTrue(q.contains(i));
246	>	assertTrue(q.remove((Integer)i));
247	>	assertFalse(q.contains(i));
248	>	assertTrue(q.contains(i - 1));
249	>	}
250	>	for (int i = 0; i < SIZE; i += 2) {
251	>	assertTrue(q.contains(i));
252	>	assertTrue(q.remove((Integer)i));
253	>	assertFalse(q.contains(i));
254	>	assertFalse(q.remove((Integer)(i + 1)));
255	>	assertFalse(q.contains(i + 1));
256		}
257		assertTrue(q.isEmpty());
258		}
#	Line 277 | Line 277 | public class LinkedListTest extends JSR1
277		q.clear();
278		assertTrue(q.isEmpty());
279		assertEquals(0, q.size());
280	<	q.add(new Integer(1));
280	>	assertTrue(q.add(new Integer(1)));
281		assertFalse(q.isEmpty());
282		q.clear();
283		assertTrue(q.isEmpty());
#	Line 292 | Line 292 | public class LinkedListTest extends JSR1
292		for (int i = 0; i < SIZE; ++i) {
293		assertTrue(q.containsAll(p));
294		assertFalse(p.containsAll(q));
295	<	p.add(new Integer(i));
295	>	assertTrue(p.add(new Integer(i)));
296		}
297		assertTrue(p.containsAll(q));
298		}
#	Line 311 | Line 311 | public class LinkedListTest extends JSR1
311		assertTrue(changed);
312
313		assertTrue(q.containsAll(p));
314	<	assertEquals(SIZE-i, q.size());
314	>	assertEquals(SIZE - i, q.size());
315		p.remove();
316		}
317		}
#	Line 324 | Line 324 | public class LinkedListTest extends JSR1
324		LinkedList q = populatedQueue(SIZE);
325		LinkedList p = populatedQueue(i);
326		assertTrue(q.removeAll(p));
327	<	assertEquals(SIZE-i, q.size());
327	>	assertEquals(SIZE - i, q.size());
328		for (int j = 0; j < i; ++j) {
329	<	Integer I = (Integer)(p.remove());
330	<	assertFalse(q.contains(I));
329	>	Integer x = (Integer)(p.remove());
330	>	assertFalse(q.contains(x));
331		}
332		}
333		}
334
335		/**
336	<	*  toArray contains all elements
336	>	* toArray contains all elements in FIFO order
337		*/
338		public void testToArray() {
339		LinkedList q = populatedQueue(SIZE);
340	<	Object[] o = q.toArray();
341	<	Arrays.sort(o);
342	<	for (int i = 0; i < o.length; i++)
343	<	assertEquals(o[i], q.poll());
340	>	Object[] o = q.toArray();
341	>	for (int i = 0; i < o.length; i++)
342	>	assertSame(o[i], q.poll());
343		}
344
345		/**
346	<	*  toArray(a) contains all elements
346	>	* toArray(a) contains all elements in FIFO order
347		*/
348		public void testToArray2() {
349	<	LinkedList q = populatedQueue(SIZE);
350	<	Integer[] ints = new Integer[SIZE];
351	<	ints = (Integer[])q.toArray(ints);
352	<	Arrays.sort(ints);
349	>	LinkedList<Integer> q = populatedQueue(SIZE);
350	>	Integer[] ints = new Integer[SIZE];
351	>	Integer[] array = q.toArray(ints);
352	>	assertSame(ints, array);
353		for (int i = 0; i < ints.length; i++)
354	<	assertEquals(ints[i], q.poll());
354	>	assertSame(ints[i], q.poll());
355		}
356
357		/**
358	<	* toArray(null) throws NPE
358	>	* toArray(null) throws NullPointerException
359		*/
360	<	public void testToArray_BadArg() {
361	<	try {
362	<	LinkedList l = new LinkedList();
363	<	l.add(new Object());
364	<	Object o[] = l.toArray(null);
365	<	shouldThrow();
366	<	} catch (NullPointerException success){}
360	>	public void testToArray_NullArg() {
361	>	LinkedList l = new LinkedList();
362	>	l.add(new Object());
363	>	try {
364	>	l.toArray(null);
365	>	shouldThrow();
366	>	} catch (NullPointerException success) {}
367		}
368
369		/**
370	<	* toArray with incompatable aray type throws CCE
370	>	* toArray(incompatible array type) throws ArrayStoreException
371		*/
372		public void testToArray1_BadArg() {
373	<	try {
374	<	LinkedList l = new LinkedList();
375	<	l.add(new Integer(5));
376	<	Object o[] = l.toArray(new String[10] );
377	<	shouldThrow();
378	<	} catch (ArrayStoreException  success){}
373	>	LinkedList l = new LinkedList();
374	>	l.add(new Integer(5));
375	>	try {
376	>	l.toArray(new String[10]);
377	>	shouldThrow();
378	>	} catch (ArrayStoreException success) {}
379		}
380
381		/**
382	<	*  iterator iterates through all elements
382	>	* iterator iterates through all elements
383		*/
384		public void testIterator() {
385		LinkedList q = populatedQueue(SIZE);
386	<	int i = 0;
387	<	Iterator it = q.iterator();
388	<	while (it.hasNext()) {
386	>	Iterator it = q.iterator();
387	>	int i;
388	>	for (i = 0; it.hasNext(); i++)
389		assertTrue(q.contains(it.next()));
391	–	++i;
392	–	}
390		assertEquals(i, SIZE);
391	+	assertIteratorExhausted(it);
392		}
393
394		/**
395	<	*  iterator ordering is FIFO
395	>	* iterator of empty collection has no elements
396	>	*/
397	>	public void testEmptyIterator() {
398	>	assertIteratorExhausted(new LinkedList().iterator());
399	>	}
400	>
401	>	/**
402	>	* iterator ordering is FIFO
403		*/
404		public void testIteratorOrdering() {
405		final LinkedList q = new LinkedList();
#	Line 403 | Line 408 | public class LinkedListTest extends JSR1
408		q.add(new Integer(3));
409		int k = 0;
410		for (Iterator it = q.iterator(); it.hasNext();) {
411	<	int i = ((Integer)(it.next())).intValue();
407	<	assertEquals(++k, i);
411	>	assertEquals(++k, it.next());
412		}
413
414		assertEquals(3, k);
#	Line 413 | Line 417 | public class LinkedListTest extends JSR1
417		/**
418		* iterator.remove removes current element
419		*/
420	<	public void testIteratorRemove () {
420	>	public void testIteratorRemove() {
421		final LinkedList q = new LinkedList();
422		q.add(new Integer(1));
423		q.add(new Integer(2));
424		q.add(new Integer(3));
425		Iterator it = q.iterator();
426	<	it.next();
426	>	assertEquals(1, it.next());
427		it.remove();
428		it = q.iterator();
429	<	assertEquals(it.next(), new Integer(2));
430	<	assertEquals(it.next(), new Integer(3));
429	>	assertEquals(2, it.next());
430	>	assertEquals(3, it.next());
431		assertFalse(it.hasNext());
432		}
433
434		/**
435	<	*  Descending iterator iterates through all elements
435	>	* Descending iterator iterates through all elements
436		*/
437		public void testDescendingIterator() {
438		LinkedList q = populatedQueue(SIZE);
439		int i = 0;
440	<	Iterator it = q.descendingIterator();
440	>	Iterator it = q.descendingIterator();
441		while (it.hasNext()) {
442		assertTrue(q.contains(it.next()));
443		++i;
#	Line 442 | Line 446 | public class LinkedListTest extends JSR1
446		assertFalse(it.hasNext());
447		try {
448		it.next();
449	<	} catch (NoSuchElementException success) {
450	<	}
449	>	shouldThrow();
450	>	} catch (NoSuchElementException success) {}
451		}
452
453		/**
454	<	*  Descending iterator ordering is reverse FIFO
454	>	* Descending iterator ordering is reverse FIFO
455		*/
456		public void testDescendingIteratorOrdering() {
457		final LinkedList q = new LinkedList();
#	Line 456 | Line 460 | public class LinkedListTest extends JSR1
460		q.add(new Integer(1));
461		int k = 0;
462		for (Iterator it = q.descendingIterator(); it.hasNext();) {
463	<	int i = ((Integer)(it.next())).intValue();
460	<	assertEquals(++k, i);
463	>	assertEquals(++k, it.next());
464		}
465
466		assertEquals(3, k);
#	Line 466 | Line 469 | public class LinkedListTest extends JSR1
469		/**
470		* descendingIterator.remove removes current element
471		*/
472	<	public void testDescendingIteratorRemove () {
472	>	public void testDescendingIteratorRemove() {
473		final LinkedList q = new LinkedList();
474	<	q.add(new Integer(3));
475	<	q.add(new Integer(2));
476	<	q.add(new Integer(1));
474	>	q.add(three);
475	>	q.add(two);
476	>	q.add(one);
477		Iterator it = q.descendingIterator();
478		it.next();
479		it.remove();
480		it = q.descendingIterator();
481	<	assertEquals(it.next(), new Integer(2));
482	<	assertEquals(it.next(), new Integer(3));
481	>	assertSame(it.next(), two);
482	>	assertSame(it.next(), three);
483		assertFalse(it.hasNext());
484		}
485
483	–
486		/**
487		* toString contains toStrings of elements
488		*/
#	Line 488 | Line 490 | public class LinkedListTest extends JSR1
490		LinkedList q = populatedQueue(SIZE);
491		String s = q.toString();
492		for (int i = 0; i < SIZE; ++i) {
493	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
493	>	assertTrue(s.contains(String.valueOf(i)));
494		}
495		}
496
#	Line 497 | Line 499 | public class LinkedListTest extends JSR1
499		*/
500		public void testAddFirst() {
501		LinkedList q = populatedQueue(3);
502	<	q.addFirst(four);
503	<	assertEquals(four,q.peek());
502	>	q.addFirst(four);
503	>	assertSame(four, q.peek());
504		}
505
506		/**
#	Line 506 | Line 508 | public class LinkedListTest extends JSR1
508		*/
509		public void testPush() {
510		LinkedList q = populatedQueue(3);
511	<	q.pollLast();
512	<	q.push(four);
511	<	assertEquals(four,q.peekFirst());
511	>	q.push(four);
512	>	assertSame(four, q.peekFirst());
513		}
514
515		/**
516	<	*  pop removes next element, or throws NSEE if empty
516	>	* pop removes next element, or throws NSEE if empty
517		*/
518		public void testPop() {
519		LinkedList q = populatedQueue(SIZE);
520		for (int i = 0; i < SIZE; ++i) {
521	<	assertEquals(i, ((Integer)q.pop()).intValue());
521	>	assertEquals(i, q.pop());
522		}
523		try {
524		q.pop();
525		shouldThrow();
526	<	} catch (NoSuchElementException success){
526	<	}
526	>	} catch (NoSuchElementException success) {}
527		}
528
529		/**
#	Line 545 | Line 545 | public class LinkedListTest extends JSR1
545		}
546
547		/**
548	<	*  pollLast succeeds unless empty
548	>	* pollLast succeeds unless empty
549		*/
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());
552	>	for (int i = SIZE - 1; i >= 0; --i) {
553	>	assertEquals(i, q.pollLast());
554		}
555	<	assertNull(q.pollLast());
555	>	assertNull(q.pollLast());
556		}
557
558		/**
559	<	*  peekFirst returns next element, or null if empty
559	>	* peekFirst returns next element, or null if empty
560		*/
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();
564	>	assertEquals(i, q.peekFirst());
565	>	assertEquals(i, q.pollFirst());
566		assertTrue(q.peekFirst() == null ||
567	<	i != ((Integer)q.peekFirst()).intValue());
567	>	!q.peekFirst().equals(i));
568		}
569	<	assertNull(q.peekFirst());
569	>	assertNull(q.peekFirst());
570		}
571
572	–
572		/**
573	<	*  peekLast returns next element, or null if empty
573	>	* peekLast returns next element, or null if empty
574		*/
575		public void testPeekLast() {
576		LinkedList q = populatedQueue(SIZE);
577	<	for (int i = SIZE-1; i >= 0; --i) {
578	<	assertEquals(i, ((Integer)q.peekLast()).intValue());
579	<	q.pollLast();
577	>	for (int i = SIZE - 1; i >= 0; --i) {
578	>	assertEquals(i, q.peekLast());
579	>	assertEquals(i, q.pollLast());
580		assertTrue(q.peekLast() == null ||
581	<	i != ((Integer)q.peekLast()).intValue());
581	>	!q.peekLast().equals(i));
582		}
583	<	assertNull(q.peekLast());
583	>	assertNull(q.peekLast());
584		}
585
586		public void testFirstElement() {
587		LinkedList q = populatedQueue(SIZE);
588		for (int i = 0; i < SIZE; ++i) {
589	<	assertEquals(i, ((Integer)q.getFirst()).intValue());
590	<	q.pollFirst();
589	>	assertEquals(i, q.getFirst());
590	>	assertEquals(i, q.pollFirst());
591		}
592		try {
593		q.getFirst();
594		shouldThrow();
595	<	}
597	<	catch (NoSuchElementException success) {}
595	>	} catch (NoSuchElementException success) {}
596		}
597
598		/**
599	<	*  getLast returns next element, or throws NSEE if empty
599	>	* getLast returns next element, or throws NSEE if empty
600		*/
601		public void testLastElement() {
602		LinkedList q = populatedQueue(SIZE);
603	<	for (int i = SIZE-1; i >= 0; --i) {
604	<	assertEquals(i, ((Integer)q.getLast()).intValue());
605	<	q.pollLast();
603	>	for (int i = SIZE - 1; i >= 0; --i) {
604	>	assertEquals(i, q.getLast());
605	>	assertEquals(i, q.pollLast());
606		}
607		try {
608		q.getLast();
609		shouldThrow();
610	<	}
611	<	catch (NoSuchElementException success) {}
614	<	assertNull(q.peekLast());
610	>	} catch (NoSuchElementException success) {}
611	>	assertNull(q.peekLast());
612		}
613
614		/**
#	Line 619 | Line 616 | public class LinkedListTest extends JSR1
616		*/
617		public void testRemoveFirstOccurrence() {
618		LinkedList q = populatedQueue(SIZE);
619	<	for (int i = 1; i < SIZE; i+=2) {
619	>	for (int i = 1; i < SIZE; i += 2) {
620		assertTrue(q.removeFirstOccurrence(new Integer(i)));
621		}
622	<	for (int i = 0; i < SIZE; i+=2) {
622	>	for (int i = 0; i < SIZE; i += 2) {
623		assertTrue(q.removeFirstOccurrence(new Integer(i)));
624	<	assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
624	>	assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
625		}
626		assertTrue(q.isEmpty());
627		}
#	Line 634 | Line 631 | public class LinkedListTest extends JSR1
631		*/
632		public void testRemoveLastOccurrence() {
633		LinkedList q = populatedQueue(SIZE);
634	<	for (int i = 1; i < SIZE; i+=2) {
634	>	for (int i = 1; i < SIZE; i += 2) {
635		assertTrue(q.removeLastOccurrence(new Integer(i)));
636		}
637	<	for (int i = 0; i < SIZE; i+=2) {
637	>	for (int i = 0; i < SIZE; i += 2) {
638		assertTrue(q.removeLastOccurrence(new Integer(i)));
639	<	assertFalse(q.removeLastOccurrence(new Integer(i+1)));
639	>	assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
640		}
641		assertTrue(q.isEmpty());
642		}

Diff Legend

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