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.17 by jsr166, Tue Dec 1 09:56:28 2009 UTC vs.
Revision 1.20 by jsr166, Sat Oct 9 19:30:35 2010 UTC

#	Line 12 | Line 12 | import java.util.concurrent.*;
12
13		public class LinkedListTest extends JSR166TestCase {
14		public static void main(String[] args) {
15	<	junit.textui.TestRunner.run (suite());
15	>	junit.textui.TestRunner.run(suite());
16		}
17
18		public static Test suite() {
#	Line 174 | Line 174 | public class LinkedListTest extends JSR1
174		}
175
176		/**
177	<	*  poll succeeds unless empty
177	>	* poll succeeds unless empty
178		*/
179		public void testPoll() {
180		LinkedList q = populatedQueue(SIZE);
#	Line 185 | Line 185 | public class LinkedListTest extends JSR1
185		}
186
187		/**
188	<	*  peek returns next element, or null if empty
188	>	* peek returns next element, or null if empty
189		*/
190		public void testPeek() {
191		LinkedList q = populatedQueue(SIZE);
#	Line 214 | Line 214 | public class LinkedListTest extends JSR1
214		}
215
216		/**
217	<	*  remove removes next element, or throws NSEE if empty
217	>	* remove removes next element, or throws NSEE if empty
218		*/
219		public void testRemove() {
220		LinkedList q = populatedQueue(SIZE);
#	Line 318 | Line 318 | public class LinkedListTest extends JSR1
318		}
319
320		/**
321	<	*  toArray contains all elements
321	>	* toArray contains all elements
322		*/
323		public void testToArray() {
324		LinkedList q = populatedQueue(SIZE);
#	Line 329 | Line 329 | public class LinkedListTest extends JSR1
329		}
330
331		/**
332	<	*  toArray(a) contains all elements
332	>	* toArray(a) contains all elements
333		*/
334		public void testToArray2() {
335		LinkedList q = populatedQueue(SIZE);
#	Line 353 | Line 353 | public class LinkedListTest extends JSR1
353		}
354
355		/**
356	<	* toArray with incompatable aray type throws CCE
356	>	* toArray with incompatible array type throws CCE
357		*/
358		public void testToArray1_BadArg() {
359		LinkedList l = new LinkedList();
#	Line 365 | Line 365 | public class LinkedListTest extends JSR1
365		}
366
367		/**
368	<	*  iterator iterates through all elements
368	>	* iterator iterates through all elements
369		*/
370		public void testIterator() {
371		LinkedList q = populatedQueue(SIZE);
#	Line 379 | Line 379 | public class LinkedListTest extends JSR1
379		}
380
381		/**
382	<	*  iterator ordering is FIFO
382	>	* iterator ordering is FIFO
383		*/
384		public void testIteratorOrdering() {
385		final LinkedList q = new LinkedList();
#	Line 397 | Line 397 | public class LinkedListTest extends JSR1
397		/**
398		* iterator.remove removes current element
399		*/
400	<	public void testIteratorRemove () {
400	>	public void testIteratorRemove() {
401		final LinkedList q = new LinkedList();
402		q.add(new Integer(1));
403		q.add(new Integer(2));
#	Line 412 | Line 412 | public class LinkedListTest extends JSR1
412		}
413
414		/**
415	<	*  Descending iterator iterates through all elements
415	>	* Descending iterator iterates through all elements
416		*/
417		public void testDescendingIterator() {
418		LinkedList q = populatedQueue(SIZE);
#	Line 431 | Line 431 | public class LinkedListTest extends JSR1
431		}
432
433		/**
434	<	*  Descending iterator ordering is reverse FIFO
434	>	* Descending iterator ordering is reverse FIFO
435		*/
436		public void testDescendingIteratorOrdering() {
437		final LinkedList q = new LinkedList();
#	Line 449 | Line 449 | public class LinkedListTest extends JSR1
449		/**
450		* descendingIterator.remove removes current element
451		*/
452	<	public void testDescendingIteratorRemove () {
452	>	public void testDescendingIteratorRemove() {
453		final LinkedList q = new LinkedList();
454		q.add(three);
455		q.add(two);
#	Line 494 | Line 494 | public class LinkedListTest extends JSR1
494		}
495
496		/**
497	<	*  pop removes next element, or throws NSEE if empty
497	>	* pop removes next element, or throws NSEE if empty
498		*/
499		public void testPop() {
500		LinkedList q = populatedQueue(SIZE);
#	Line 526 | Line 526 | public class LinkedListTest extends JSR1
526		}
527
528		/**
529	<	*  pollLast succeeds unless empty
529	>	* pollLast succeeds unless empty
530		*/
531		public void testPollLast() {
532		LinkedList q = populatedQueue(SIZE);
#	Line 537 | Line 537 | public class LinkedListTest extends JSR1
537		}
538
539		/**
540	<	*  peekFirst returns next element, or null if empty
540	>	* peekFirst returns next element, or null if empty
541		*/
542		public void testPeekFirst() {
543		LinkedList q = populatedQueue(SIZE);
#	Line 552 | Line 552 | public class LinkedListTest extends JSR1
552
553
554		/**
555	<	*  peekLast returns next element, or null if empty
555	>	* peekLast returns next element, or null if empty
556		*/
557		public void testPeekLast() {
558		LinkedList q = populatedQueue(SIZE);
#	Line 578 | Line 578 | public class LinkedListTest extends JSR1
578		}
579
580		/**
581	<	*  getLast returns next element, or throws NSEE if empty
581	>	* getLast returns next element, or throws NSEE if empty
582		*/
583		public void testLastElement() {
584		LinkedList q = populatedQueue(SIZE);

Diff Legend

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