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.28 by jsr166, Thu Oct 28 17:57:26 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 682 | Line 682 | public class LinkedBlockingDequeTest ext
682		}
683
684		/**
685	–	* take blocks interruptibly when empty
686	–	*/
687	–	public void testTakeFromEmpty() throws InterruptedException {
688	–	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
689	–	Thread t = new ThreadShouldThrow(InterruptedException.class) {
690	–	public void realRun() throws InterruptedException {
691	–	q.take();
692	–	}};
693	–
694	–	t.start();
695	–	Thread.sleep(SHORT_DELAY_MS);
696	–	t.interrupt();
697	–	t.join();
698	–	}
699	–
700	–	/**
685		* Take removes existing elements until empty, then blocks interruptibly
686		*/
687		public void testBlockingTake() throws InterruptedException {
#	Line 967 | Line 951 | public class LinkedBlockingDequeTest ext
951		}
952
953		/**
954	<	*  timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
955	<	*  on interruption throws
954	>	* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
955	>	* on interruption throws
956		*/
957		public void testTimedPollFirstWithOfferFirst() throws InterruptedException {
958		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
#	Line 1417 | Line 1401 | public class LinkedBlockingDequeTest ext
1401
1402
1403		/**
1404	<	*  Descending iterator iterates through all elements
1404	>	* Descending iterator iterates through all elements
1405		*/
1406		public void testDescendingIterator() {
1407		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 1436 | Line 1420 | public class LinkedBlockingDequeTest ext
1420		}
1421
1422		/**
1423	<	*  Descending iterator ordering is reverse FIFO
1423	>	* Descending iterator ordering is reverse FIFO
1424		*/
1425		public void testDescendingIteratorOrdering() {
1426		final LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 1645 | Line 1629 | public class LinkedBlockingDequeTest ext
1629		}
1630
1631		/**
1632	<	* drainTo(c, n) empties first max {n, size} elements of deque into c
1632	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
1633		*/
1634		public void testDrainToN() {
1635		LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 1654 | Line 1638 | public class LinkedBlockingDequeTest ext
1638		assertTrue(q.offer(new Integer(j)));
1639		ArrayList l = new ArrayList();
1640		q.drainTo(l, i);
1641	<	int k = (i < SIZE)? i : SIZE;
1641	>	int k = (i < SIZE) ? i : SIZE;
1642		assertEquals(l.size(), k);
1643		assertEquals(q.size(), SIZE-k);
1644		for (int j = 0; j < k; ++j)

Diff Legend

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