ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/LinkedBlockingDequeTest.java

Comparing jsr166/src/test/tck/LinkedBlockingDequeTest.java (file contents):
Revision 1.24 by jsr166, Wed Oct 6 07:49:22 2010 UTC vs.
Revision 1.25 by jsr166, Sat Oct 9 19:30:35 2010 UTC

#	Line 108 | Line 108 | public class LinkedBlockingDequeTest ext
108		}
109
110		/**
111	<	*  pollFirst succeeds unless empty
111	>	* pollFirst succeeds unless empty
112		*/
113		public void testPollFirst() {
114		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 119 | Line 119 | public class LinkedBlockingDequeTest ext
119		}
120
121		/**
122	<	*  pollLast succeeds unless empty
122	>	* pollLast succeeds unless empty
123		*/
124		public void testPollLast() {
125		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 130 | Line 130 | public class LinkedBlockingDequeTest ext
130		}
131
132		/**
133	<	*  peekFirst returns next element, or null if empty
133	>	* peekFirst returns next element, or null if empty
134		*/
135		public void testPeekFirst() {
136		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 144 | Line 144 | public class LinkedBlockingDequeTest ext
144		}
145
146		/**
147	<	*  peek returns next element, or null if empty
147	>	* peek returns next element, or null if empty
148		*/
149		public void testPeek() {
150		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 158 | Line 158 | public class LinkedBlockingDequeTest ext
158		}
159
160		/**
161	<	*  peekLast returns next element, or null if empty
161	>	* peekLast returns next element, or null if empty
162		*/
163		public void testPeekLast() {
164		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 188 | Line 188 | public class LinkedBlockingDequeTest ext
188		}
189
190		/**
191	<	*  getLast() returns last element, or throws NSEE if empty
191	>	* getLast() returns last element, or throws NSEE if empty
192		*/
193		public void testLastElement() {
194		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 234 | Line 234 | public class LinkedBlockingDequeTest ext
234		}
235
236		/**
237	<	*  remove removes next element, or throws NSEE if empty
237	>	* remove removes next element, or throws NSEE if empty
238		*/
239		public void testRemove() {
240		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 457 | Line 457 | public class LinkedBlockingDequeTest ext
457
458
459		/**
460	<	*  pop removes next element, or throws NSEE if empty
460	>	* pop removes next element, or throws NSEE if empty
461		*/
462		public void testPop() {
463		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 967 | Line 967 | public class LinkedBlockingDequeTest ext
967		}
968
969		/**
970	<	*  timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
971	<	*  on interruption throws
970	>	* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
971	>	* on interruption throws
972		*/
973		public void testTimedPollFirstWithOfferFirst() throws InterruptedException {
974		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
#	Line 1417 | Line 1417 | public class LinkedBlockingDequeTest ext
1417
1418
1419		/**
1420	<	*  Descending iterator iterates through all elements
1420	>	* Descending iterator iterates through all elements
1421		*/
1422		public void testDescendingIterator() {
1423		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 1436 | Line 1436 | public class LinkedBlockingDequeTest ext
1436		}
1437
1438		/**
1439	<	*  Descending iterator ordering is reverse FIFO
1439	>	* Descending iterator ordering is reverse FIFO
1440		*/
1441		public void testDescendingIteratorOrdering() {
1442		final LinkedBlockingDeque q = new LinkedBlockingDeque();

Diff Legend

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