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.19 by jsr166, Wed Aug 25 00:07:03 2010 UTC vs.
Revision 1.36 by jsr166, Sun Feb 22 04:34:44 2015 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) {
#	Line 20 | Line 25 | public class LinkedListTest extends JSR1
25		}
26
27		/**
28	<	* Create a queue of given size containing consecutive
28	>	* Returns a new queue of given size containing consecutive
29		* Integers 0 ... n.
30		*/
31	<	private LinkedList 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)));
#	Line 45 | Line 50 | public class LinkedListTest extends JSR1
50		*/
51		public void testConstructor3() {
52		try {
53	<	LinkedList q = new LinkedList((Collection)null);
53	>	new LinkedList((Collection)null);
54		shouldThrow();
55		} catch (NullPointerException success) {}
56		}
#	Line 174 | Line 179 | public class LinkedListTest extends JSR1
179		}
180
181		/**
182	<	*  poll succeeds unless empty
182	>	* poll succeeds unless empty
183		*/
184		public void testPoll() {
185		LinkedList q = populatedQueue(SIZE);
#	Line 185 | Line 190 | public class LinkedListTest extends JSR1
190		}
191
192		/**
193	<	*  peek returns next element, or null if empty
193	>	* peek returns next element, or null if empty
194		*/
195		public void testPeek() {
196		LinkedList q = populatedQueue(SIZE);
#	Line 214 | Line 219 | public class LinkedListTest extends JSR1
219		}
220
221		/**
222	<	*  remove removes next element, or throws NSEE if empty
222	>	* remove removes next element, or throws NSEE if empty
223		*/
224		public void testRemove() {
225		LinkedList q = populatedQueue(SIZE);
#	Line 232 | Line 237 | public class LinkedListTest extends JSR1
237		*/
238		public void testRemoveElement() {
239		LinkedList q = populatedQueue(SIZE);
240	<	for (int i = 1; i < SIZE; i+=2) {
241	<	assertTrue(q.remove(new Integer(i)));
242	<	}
243	<	for (int i = 0; i < SIZE; i+=2) {
244	<	assertTrue(q.remove(new Integer(i)));
245	<	assertFalse(q.remove(new Integer(i+1)));
240	>	for (int i = 1; i < SIZE; i += 2) {
241	>	assertTrue(q.contains(i));
242	>	assertTrue(q.remove((Integer)i));
243	>	assertFalse(q.contains(i));
244	>	assertTrue(q.contains(i-1));
245	>	}
246	>	for (int i = 0; i < SIZE; i += 2) {
247	>	assertTrue(q.contains(i));
248	>	assertTrue(q.remove((Integer)i));
249	>	assertFalse(q.contains(i));
250	>	assertFalse(q.remove((Integer)(i+1)));
251	>	assertFalse(q.contains(i+1));
252		}
253		assertTrue(q.isEmpty());
254		}
#	Line 311 | Line 322 | public class LinkedListTest extends JSR1
322		assertTrue(q.removeAll(p));
323		assertEquals(SIZE-i, q.size());
324		for (int j = 0; j < i; ++j) {
325	<	Integer I = (Integer)(p.remove());
326	<	assertFalse(q.contains(I));
325	>	Integer x = (Integer)(p.remove());
326	>	assertFalse(q.contains(x));
327		}
328		}
329		}
330
331		/**
332	<	*  toArray contains all elements
332	>	* toArray contains all elements in FIFO order
333		*/
334		public void testToArray() {
335		LinkedList q = populatedQueue(SIZE);
336		Object[] o = q.toArray();
326	–	Arrays.sort(o);
337		for (int i = 0; i < o.length; i++)
338	<	assertEquals(o[i], q.poll());
338	>	assertSame(o[i], q.poll());
339		}
340
341		/**
342	<	*  toArray(a) contains all elements
342	>	* toArray(a) contains all elements in FIFO order
343		*/
344		public void testToArray2() {
345	<	LinkedList q = populatedQueue(SIZE);
345	>	LinkedList<Integer> q = populatedQueue(SIZE);
346		Integer[] ints = new Integer[SIZE];
347	<	ints = (Integer[])q.toArray(ints);
348	<	Arrays.sort(ints);
347	>	Integer[] array = q.toArray(ints);
348	>	assertSame(ints, array);
349		for (int i = 0; i < ints.length; i++)
350	<	assertEquals(ints[i], q.poll());
350	>	assertSame(ints[i], q.poll());
351		}
352
353		/**
354	<	* toArray(null) throws NPE
354	>	* toArray(null) throws NullPointerException
355		*/
356	<	public void testToArray_BadArg() {
356	>	public void testToArray_NullArg() {
357		LinkedList l = new LinkedList();
358		l.add(new Object());
359		try {
360	<	Object o[] = l.toArray(null);
360	>	l.toArray(null);
361		shouldThrow();
362		} catch (NullPointerException success) {}
363		}
364
365		/**
366	<	* toArray with incompatible array type throws CCE
366	>	* toArray(incompatible array type) throws ArrayStoreException
367		*/
368		public void testToArray1_BadArg() {
369		LinkedList l = new LinkedList();
370		l.add(new Integer(5));
371		try {
372	<	Object o[] = l.toArray(new String[10]);
372	>	l.toArray(new String[10]);
373		shouldThrow();
374		} catch (ArrayStoreException success) {}
375		}
376
377		/**
378	<	*  iterator iterates through all elements
378	>	* iterator iterates through all elements
379		*/
380		public void testIterator() {
381		LinkedList q = populatedQueue(SIZE);
372	–	int i = 0;
382		Iterator it = q.iterator();
383	<	while (it.hasNext()) {
383	>	int i;
384	>	for (i = 0; it.hasNext(); i++)
385		assertTrue(q.contains(it.next()));
376	–	++i;
377	–	}
386		assertEquals(i, SIZE);
387	+	assertIteratorExhausted(it);
388		}
389
390		/**
391	<	*  iterator ordering is FIFO
391	>	* iterator of empty collection has no elements
392	>	*/
393	>	public void testEmptyIterator() {
394	>	assertIteratorExhausted(new LinkedList().iterator());
395	>	}
396	>
397	>	/**
398	>	* iterator ordering is FIFO
399		*/
400		public void testIteratorOrdering() {
401		final LinkedList q = new LinkedList();
#	Line 403 | Line 419 | public class LinkedListTest extends JSR1
419		q.add(new Integer(2));
420		q.add(new Integer(3));
421		Iterator it = q.iterator();
422	<	assertEquals(it.next(), 1);
422	>	assertEquals(1, it.next());
423		it.remove();
424		it = q.iterator();
425	<	assertEquals(it.next(), 2);
426	<	assertEquals(it.next(), 3);
425	>	assertEquals(2, it.next());
426	>	assertEquals(3, it.next());
427		assertFalse(it.hasNext());
428		}
429
430		/**
431	<	*  Descending iterator iterates through all elements
431	>	* Descending iterator iterates through all elements
432		*/
433		public void testDescendingIterator() {
434		LinkedList q = populatedQueue(SIZE);
#	Line 431 | Line 447 | public class LinkedListTest extends JSR1
447		}
448
449		/**
450	<	*  Descending iterator ordering is reverse FIFO
450	>	* Descending iterator ordering is reverse FIFO
451		*/
452		public void testDescendingIteratorOrdering() {
453		final LinkedList q = new LinkedList();
#	Line 463 | Line 479 | public class LinkedListTest extends JSR1
479		assertFalse(it.hasNext());
480		}
481
466	–
482		/**
483		* toString contains toStrings of elements
484		*/
#	Line 471 | Line 486 | public class LinkedListTest extends JSR1
486		LinkedList q = populatedQueue(SIZE);
487		String s = q.toString();
488		for (int i = 0; i < SIZE; ++i) {
489	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
489	>	assertTrue(s.contains(String.valueOf(i)));
490		}
491		}
492
#	Line 494 | Line 509 | public class LinkedListTest extends JSR1
509		}
510
511		/**
512	<	*  pop removes next element, or throws NSEE if empty
512	>	* pop removes next element, or throws NSEE if empty
513		*/
514		public void testPop() {
515		LinkedList q = populatedQueue(SIZE);
#	Line 526 | Line 541 | public class LinkedListTest extends JSR1
541		}
542
543		/**
544	<	*  pollLast succeeds unless empty
544	>	* pollLast succeeds unless empty
545		*/
546		public void testPollLast() {
547		LinkedList q = populatedQueue(SIZE);
#	Line 537 | Line 552 | public class LinkedListTest extends JSR1
552		}
553
554		/**
555	<	*  peekFirst returns next element, or null if empty
555	>	* peekFirst returns next element, or null if empty
556		*/
557		public void testPeekFirst() {
558		LinkedList q = populatedQueue(SIZE);
#	Line 550 | Line 565 | public class LinkedListTest extends JSR1
565		assertNull(q.peekFirst());
566		}
567
553	–
568		/**
569	<	*  peekLast returns next element, or null if empty
569	>	* peekLast returns next element, or null if empty
570		*/
571		public void testPeekLast() {
572		LinkedList q = populatedQueue(SIZE);
#	Line 578 | Line 592 | public class LinkedListTest extends JSR1
592		}
593
594		/**
595	<	*  getLast returns next element, or throws NSEE if empty
595	>	* getLast returns next element, or throws NSEE if empty
596		*/
597		public void testLastElement() {
598		LinkedList q = populatedQueue(SIZE);
#	Line 598 | Line 612 | public class LinkedListTest extends JSR1
612		*/
613		public void testRemoveFirstOccurrence() {
614		LinkedList q = populatedQueue(SIZE);
615	<	for (int i = 1; i < SIZE; i+=2) {
615	>	for (int i = 1; i < SIZE; i += 2) {
616		assertTrue(q.removeFirstOccurrence(new Integer(i)));
617		}
618	<	for (int i = 0; i < SIZE; i+=2) {
618	>	for (int i = 0; i < SIZE; i += 2) {
619		assertTrue(q.removeFirstOccurrence(new Integer(i)));
620		assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
621		}
#	Line 613 | Line 627 | public class LinkedListTest extends JSR1
627		*/
628		public void testRemoveLastOccurrence() {
629		LinkedList q = populatedQueue(SIZE);
630	<	for (int i = 1; i < SIZE; i+=2) {
630	>	for (int i = 1; i < SIZE; i += 2) {
631		assertTrue(q.removeLastOccurrence(new Integer(i)));
632		}
633	<	for (int i = 0; i < SIZE; i+=2) {
633	>	for (int i = 0; i < SIZE; i += 2) {
634		assertTrue(q.removeLastOccurrence(new Integer(i)));
635		assertFalse(q.removeLastOccurrence(new Integer(i+1)));
636		}

Diff Legend

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