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.7 by jsr166, Sat Nov 21 02:07:26 2009 UTC vs.
Revision 1.77 by jsr166, Sun May 14 00:56:43 2017 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		*/
6
7	<	import junit.framework.*;
8	<	import java.util.*;
9	<	import java.util.concurrent.*;
10	<	import java.io.*;
7	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
8	>
9	>	import java.util.ArrayList;
10	>	import java.util.Arrays;
11	>	import java.util.Collection;
12	>	import java.util.Deque;
13	>	import java.util.Iterator;
14	>	import java.util.NoSuchElementException;
15	>	import java.util.Queue;
16	>	import java.util.concurrent.BlockingDeque;
17	>	import java.util.concurrent.BlockingQueue;
18	>	import java.util.concurrent.CountDownLatch;
19	>	import java.util.concurrent.Executors;
20	>	import java.util.concurrent.ExecutorService;
21	>	import java.util.concurrent.LinkedBlockingDeque;
22	>
23	>	import junit.framework.Test;
24
25		public class LinkedBlockingDequeTest extends JSR166TestCase {
26	+
27	+	public static class Unbounded extends BlockingQueueTest {
28	+	protected BlockingQueue emptyCollection() {
29	+	return new LinkedBlockingDeque();
30	+	}
31	+	}
32	+
33	+	public static class Bounded extends BlockingQueueTest {
34	+	protected BlockingQueue emptyCollection() {
35	+	return new LinkedBlockingDeque(SIZE);
36	+	}
37	+	}
38	+
39		public static void main(String[] args) {
40	<	junit.textui.TestRunner.run (suite());
40	>	main(suite(), args);
41		}
42
43		public static Test suite() {
44	<	return new TestSuite(LinkedBlockingDequeTest.class);
44	>	class Implementation implements CollectionImplementation {
45	>	public Class<?> klazz() { return LinkedBlockingDeque.class; }
46	>	public Collection emptyCollection() { return new LinkedBlockingDeque(); }
47	>	public Object makeElement(int i) { return i; }
48	>	public boolean isConcurrent() { return true; }
49	>	public boolean permitsNulls() { return false; }
50	>	}
51	>	return newTestSuite(LinkedBlockingDequeTest.class,
52	>	new Unbounded().testSuite(),
53	>	new Bounded().testSuite(),
54	>	CollectionTest.testSuite(new Implementation()));
55		}
56
57		/**
58	<	* Create a deque of given size containing consecutive
59	<	* Integers 0 ... n.
60	<	*/
61	<	private LinkedBlockingDeque populatedDeque(int n) {
62	<	LinkedBlockingDeque q = new LinkedBlockingDeque(n);
58	>	* Returns a new deque of given size containing consecutive
59	>	* Integers 0 ... n - 1.
60	>	*/
61	>	private static LinkedBlockingDeque<Integer> populatedDeque(int n) {
62	>	LinkedBlockingDeque<Integer> q =
63	>	new LinkedBlockingDeque<Integer>(n);
64		assertTrue(q.isEmpty());
65		for (int i = 0; i < n; i++)
66		assertTrue(q.offer(new Integer(i)));
67		assertFalse(q.isEmpty());
68		assertEquals(0, q.remainingCapacity());
69		assertEquals(n, q.size());
70	+	assertEquals((Integer) 0, q.peekFirst());
71	+	assertEquals((Integer) (n - 1), q.peekLast());
72		return q;
73		}
74
#	Line 53 | Line 92 | public class LinkedBlockingDequeTest ext
92		public void testSize() {
93		LinkedBlockingDeque q = populatedDeque(SIZE);
94		for (int i = 0; i < SIZE; ++i) {
95	<	assertEquals(SIZE-i, q.size());
95	>	assertEquals(SIZE - i, q.size());
96		q.removeFirst();
97		}
98		for (int i = 0; i < SIZE; ++i) {
#	Line 63 | Line 102 | public class LinkedBlockingDequeTest ext
102		}
103
104		/**
105	<	* offer(null) throws NPE
105	>	* offerFirst(null) throws NullPointerException
106		*/
107		public void testOfferFirstNull() {
108	+	LinkedBlockingDeque q = new LinkedBlockingDeque();
109		try {
70	–	LinkedBlockingDeque q = new LinkedBlockingDeque();
110		q.offerFirst(null);
111		shouldThrow();
112	<	} catch (NullPointerException success) {
113	<	}
112	>	} catch (NullPointerException success) {}
113	>	}
114	>
115	>	/**
116	>	* offerLast(null) throws NullPointerException
117	>	*/
118	>	public void testOfferLastNull() {
119	>	LinkedBlockingDeque q = new LinkedBlockingDeque();
120	>	try {
121	>	q.offerLast(null);
122	>	shouldThrow();
123	>	} catch (NullPointerException success) {}
124		}
125
126		/**
#	Line 93 | Line 142 | public class LinkedBlockingDequeTest ext
142		}
143
144		/**
145	<	*  pollFirst succeeds unless empty
145	>	* pollFirst succeeds unless empty
146		*/
147		public void testPollFirst() {
148		LinkedBlockingDeque q = populatedDeque(SIZE);
149		for (int i = 0; i < SIZE; ++i) {
150	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
150	>	assertEquals(i, q.pollFirst());
151		}
152		assertNull(q.pollFirst());
153		}
154
155		/**
156	<	*  pollLast succeeds unless empty
156	>	* pollLast succeeds unless empty
157		*/
158		public void testPollLast() {
159		LinkedBlockingDeque q = populatedDeque(SIZE);
160	<	for (int i = SIZE-1; i >= 0; --i) {
161	<	assertEquals(i, ((Integer)q.pollLast()).intValue());
160	>	for (int i = SIZE - 1; i >= 0; --i) {
161	>	assertEquals(i, q.pollLast());
162		}
163		assertNull(q.pollLast());
164		}
165
166		/**
167	<	*  peekFirst returns next element, or null if empty
167	>	* peekFirst returns next element, or null if empty
168		*/
169		public void testPeekFirst() {
170		LinkedBlockingDeque q = populatedDeque(SIZE);
171		for (int i = 0; i < SIZE; ++i) {
172	<	assertEquals(i, ((Integer)q.peekFirst()).intValue());
173	<	q.pollFirst();
172	>	assertEquals(i, q.peekFirst());
173	>	assertEquals(i, q.pollFirst());
174		assertTrue(q.peekFirst() == null ||
175	<	i != ((Integer)q.peekFirst()).intValue());
175	>	!q.peekFirst().equals(i));
176		}
177		assertNull(q.peekFirst());
178		}
179
180		/**
181	<	*  peek returns next element, or null if empty
181	>	* peek returns next element, or null if empty
182		*/
183		public void testPeek() {
184		LinkedBlockingDeque q = populatedDeque(SIZE);
185		for (int i = 0; i < SIZE; ++i) {
186	<	assertEquals(i, ((Integer)q.peek()).intValue());
187	<	q.pollFirst();
186	>	assertEquals(i, q.peek());
187	>	assertEquals(i, q.pollFirst());
188		assertTrue(q.peek() == null ||
189	<	i != ((Integer)q.peek()).intValue());
189	>	!q.peek().equals(i));
190		}
191		assertNull(q.peek());
192		}
193
194		/**
195	<	*  peekLast returns next element, or null if empty
195	>	* peekLast returns next element, or null if empty
196		*/
197		public void testPeekLast() {
198		LinkedBlockingDeque q = populatedDeque(SIZE);
199	<	for (int i = SIZE-1; i >= 0; --i) {
200	<	assertEquals(i, ((Integer)q.peekLast()).intValue());
201	<	q.pollLast();
199	>	for (int i = SIZE - 1; i >= 0; --i) {
200	>	assertEquals(i, q.peekLast());
201	>	assertEquals(i, q.pollLast());
202		assertTrue(q.peekLast() == null ||
203	<	i != ((Integer)q.peekLast()).intValue());
203	>	!q.peekLast().equals(i));
204		}
205		assertNull(q.peekLast());
206		}
207
208		/**
209	<	* getFirst returns next getFirst, or throws NSEE if empty
209	>	* getFirst() returns first element, or throws NSEE if empty
210		*/
211		public void testFirstElement() {
212		LinkedBlockingDeque q = populatedDeque(SIZE);
213		for (int i = 0; i < SIZE; ++i) {
214	<	assertEquals(i, ((Integer)q.getFirst()).intValue());
215	<	q.pollFirst();
214	>	assertEquals(i, q.getFirst());
215	>	assertEquals(i, q.pollFirst());
216		}
217		try {
218		q.getFirst();
219		shouldThrow();
220	<	}
221	<	catch (NoSuchElementException success) {}
220	>	} catch (NoSuchElementException success) {}
221	>	assertNull(q.peekFirst());
222		}
223
224		/**
225	<	*  getLast returns next element, or throws NSEE if empty
225	>	* getLast() returns last element, or throws NSEE if empty
226		*/
227		public void testLastElement() {
228		LinkedBlockingDeque q = populatedDeque(SIZE);
229	<	for (int i = SIZE-1; i >= 0; --i) {
230	<	assertEquals(i, ((Integer)q.getLast()).intValue());
231	<	q.pollLast();
229	>	for (int i = SIZE - 1; i >= 0; --i) {
230	>	assertEquals(i, q.getLast());
231	>	assertEquals(i, q.pollLast());
232		}
233		try {
234		q.getLast();
235		shouldThrow();
236	<	}
188	<	catch (NoSuchElementException success) {}
236	>	} catch (NoSuchElementException success) {}
237		assertNull(q.peekLast());
238		}
239
240		/**
241	<	*  removeFirst removes next element, or throws NSEE if empty
241	>	* removeFirst() removes first element, or throws NSEE if empty
242		*/
243		public void testRemoveFirst() {
244		LinkedBlockingDeque q = populatedDeque(SIZE);
245		for (int i = 0; i < SIZE; ++i) {
246	<	assertEquals(i, ((Integer)q.removeFirst()).intValue());
246	>	assertEquals(i, q.removeFirst());
247		}
248		try {
249		q.removeFirst();
250		shouldThrow();
251	<	} catch (NoSuchElementException success) {
251	>	} catch (NoSuchElementException success) {}
252	>	assertNull(q.peekFirst());
253	>	}
254	>
255	>	/**
256	>	* removeLast() removes last element, or throws NSEE if empty
257	>	*/
258	>	public void testRemoveLast() {
259	>	LinkedBlockingDeque q = populatedDeque(SIZE);
260	>	for (int i = SIZE - 1; i >= 0; --i) {
261	>	assertEquals(i, q.removeLast());
262		}
263	+	try {
264	+	q.removeLast();
265	+	shouldThrow();
266	+	} catch (NoSuchElementException success) {}
267	+	assertNull(q.peekLast());
268		}
269
270		/**
271	<	*  remove removes next element, or throws NSEE if empty
271	>	* remove removes next element, or throws NSEE if empty
272		*/
273		public void testRemove() {
274		LinkedBlockingDeque q = populatedDeque(SIZE);
275		for (int i = 0; i < SIZE; ++i) {
276	<	assertEquals(i, ((Integer)q.remove()).intValue());
276	>	assertEquals(i, q.remove());
277		}
278		try {
279		q.remove();
280		shouldThrow();
281	<	} catch (NoSuchElementException success) {
219	<	}
281	>	} catch (NoSuchElementException success) {}
282		}
283
284		/**
#	Line 224 | Line 286 | public class LinkedBlockingDequeTest ext
286		*/
287		public void testRemoveFirstOccurrence() {
288		LinkedBlockingDeque q = populatedDeque(SIZE);
289	<	for (int i = 1; i < SIZE; i+=2) {
289	>	for (int i = 1; i < SIZE; i += 2) {
290		assertTrue(q.removeFirstOccurrence(new Integer(i)));
291		}
292	<	for (int i = 0; i < SIZE; i+=2) {
292	>	for (int i = 0; i < SIZE; i += 2) {
293		assertTrue(q.removeFirstOccurrence(new Integer(i)));
294	<	assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
294	>	assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
295		}
296		assertTrue(q.isEmpty());
297		}
#	Line 239 | Line 301 | public class LinkedBlockingDequeTest ext
301		*/
302		public void testRemoveLastOccurrence() {
303		LinkedBlockingDeque q = populatedDeque(SIZE);
304	<	for (int i = 1; i < SIZE; i+=2) {
304	>	for (int i = 1; i < SIZE; i += 2) {
305		assertTrue(q.removeLastOccurrence(new Integer(i)));
306		}
307	<	for (int i = 0; i < SIZE; i+=2) {
307	>	for (int i = 0; i < SIZE; i += 2) {
308		assertTrue(q.removeLastOccurrence(new Integer(i)));
309	<	assertFalse(q.removeLastOccurrence(new Integer(i+1)));
309	>	assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
310		}
311		assertTrue(q.isEmpty());
312		}
#	Line 256 | Line 318 | public class LinkedBlockingDequeTest ext
318		LinkedBlockingDeque q = populatedDeque(3);
319		q.pollLast();
320		q.addFirst(four);
321	<	assertEquals(four,q.peekFirst());
321	>	assertSame(four, q.peekFirst());
322		}
323
324		/**
#	Line 266 | Line 328 | public class LinkedBlockingDequeTest ext
328		LinkedBlockingDeque q = populatedDeque(3);
329		q.pollLast();
330		q.addLast(four);
331	<	assertEquals(four,q.peekLast());
331	>	assertSame(four, q.peekLast());
332		}
333
272	–
334		/**
335		* A new deque has the indicated capacity, or Integer.MAX_VALUE if
336		* none given
#	Line 280 | Line 341 | public class LinkedBlockingDequeTest ext
341		}
342
343		/**
344	<	* Constructor throws IAE if  capacity argument nonpositive
344	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
345		*/
346		public void testConstructor2() {
347		try {
348	<	LinkedBlockingDeque q = new LinkedBlockingDeque(0);
348	>	new LinkedBlockingDeque(0);
349		shouldThrow();
350	<	}
290	<	catch (IllegalArgumentException success) {}
350	>	} catch (IllegalArgumentException success) {}
351		}
352
353		/**
354	<	* Initializing from null Collection throws NPE
354	>	* Initializing from null Collection throws NullPointerException
355		*/
356		public void testConstructor3() {
357		try {
358	<	LinkedBlockingDeque q = new LinkedBlockingDeque(null);
358	>	new LinkedBlockingDeque(null);
359		shouldThrow();
360	<	}
301	<	catch (NullPointerException success) {}
360	>	} catch (NullPointerException success) {}
361		}
362
363		/**
364	<	* Initializing from Collection of null elements throws NPE
364	>	* Initializing from Collection of null elements throws NullPointerException
365		*/
366		public void testConstructor4() {
367	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
368		try {
369	<	Integer[] ints = new Integer[SIZE];
310	<	LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints));
369	>	new LinkedBlockingDeque(elements);
370		shouldThrow();
371	<	}
313	<	catch (NullPointerException success) {}
371	>	} catch (NullPointerException success) {}
372		}
373
374		/**
375	<	* Initializing from Collection with some null elements throws NPE
375	>	* Initializing from Collection with some null elements throws
376	>	* NullPointerException
377		*/
378		public void testConstructor5() {
379	+	Integer[] ints = new Integer[SIZE];
380	+	for (int i = 0; i < SIZE - 1; ++i)
381	+	ints[i] = i;
382	+	Collection<Integer> elements = Arrays.asList(ints);
383		try {
384	<	Integer[] ints = new Integer[SIZE];
322	<	for (int i = 0; i < SIZE-1; ++i)
323	<	ints[i] = new Integer(i);
324	<	LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints));
384	>	new LinkedBlockingDeque(elements);
385		shouldThrow();
386	<	}
327	<	catch (NullPointerException success) {}
386	>	} catch (NullPointerException success) {}
387		}
388
389		/**
390		* Deque contains all elements of collection used to initialize
391		*/
392		public void testConstructor6() {
393	<	try {
394	<	Integer[] ints = new Integer[SIZE];
395	<	for (int i = 0; i < SIZE; ++i)
396	<	ints[i] = new Integer(i);
397	<	LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints));
398	<	for (int i = 0; i < SIZE; ++i)
340	<	assertEquals(ints[i], q.poll());
341	<	}
342	<	finally {}
393	>	Integer[] ints = new Integer[SIZE];
394	>	for (int i = 0; i < SIZE; ++i)
395	>	ints[i] = i;
396	>	LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints));
397	>	for (int i = 0; i < SIZE; ++i)
398	>	assertEquals(ints[i], q.poll());
399		}
400
401		/**
#	Line 361 | Line 417 | public class LinkedBlockingDequeTest ext
417		* remainingCapacity decreases on add, increases on remove
418		*/
419		public void testRemainingCapacity() {
420	<	LinkedBlockingDeque q = populatedDeque(SIZE);
420	>	BlockingQueue q = populatedDeque(SIZE);
421		for (int i = 0; i < SIZE; ++i) {
422		assertEquals(i, q.remainingCapacity());
423	<	assertEquals(SIZE-i, q.size());
424	<	q.remove();
423	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
424	>	assertEquals(i, q.remove());
425		}
426		for (int i = 0; i < SIZE; ++i) {
427	<	assertEquals(SIZE-i, q.remainingCapacity());
428	<	assertEquals(i, q.size());
429	<	q.add(new Integer(i));
427	>	assertEquals(SIZE - i, q.remainingCapacity());
428	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
429	>	assertTrue(q.add(i));
430		}
431		}
432
433		/**
378	–	* offer(null) throws NPE
379	–	*/
380	–	public void testOfferNull() {
381	–	try {
382	–	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
383	–	q.offer(null);
384	–	shouldThrow();
385	–	} catch (NullPointerException success) { }
386	–	}
387	–
388	–	/**
389	–	* add(null) throws NPE
390	–	*/
391	–	public void testAddNull() {
392	–	try {
393	–	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
394	–	q.add(null);
395	–	shouldThrow();
396	–	} catch (NullPointerException success) { }
397	–	}
398	–
399	–	/**
434		* push(null) throws NPE
435		*/
436		public void testPushNull() {
437	+	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
438		try {
404	–	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
439		q.push(null);
440		shouldThrow();
441	<	} catch (NullPointerException success) { }
441	>	} catch (NullPointerException success) {}
442		}
443
444		/**
445		* push succeeds if not full; throws ISE if full
446		*/
447		public void testPush() {
448	+	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
449	+	for (int i = 0; i < SIZE; ++i) {
450	+	Integer x = new Integer(i);
451	+	q.push(x);
452	+	assertEquals(x, q.peek());
453	+	}
454	+	assertEquals(0, q.remainingCapacity());
455		try {
415	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
416	–	for (int i = 0; i < SIZE; ++i) {
417	–	Integer I = new Integer(i);
418	–	q.push(I);
419	–	assertEquals(I, q.peek());
420	–	}
421	–	assertEquals(0, q.remainingCapacity());
456		q.push(new Integer(SIZE));
457	<	} catch (IllegalStateException success) {
458	<	}
457	>	shouldThrow();
458	>	} catch (IllegalStateException success) {}
459		}
460
461		/**
#	Line 431 | Line 465 | public class LinkedBlockingDequeTest ext
465		LinkedBlockingDeque q = populatedDeque(3);
466		q.pollLast();
467		q.push(four);
468	<	assertEquals(four,q.peekFirst());
468	>	assertSame(four, q.peekFirst());
469		}
470
437	–
471		/**
472	<	*  pop removes next element, or throws NSEE if empty
472	>	* pop removes next element, or throws NSEE if empty
473		*/
474		public void testPop() {
475		LinkedBlockingDeque q = populatedDeque(SIZE);
476		for (int i = 0; i < SIZE; ++i) {
477	<	assertEquals(i, ((Integer)q.pop()).intValue());
477	>	assertEquals(i, q.pop());
478		}
479		try {
480		q.pop();
481		shouldThrow();
482	<	} catch (NoSuchElementException success) {
450	<	}
482	>	} catch (NoSuchElementException success) {}
483		}
484
453	–
485		/**
486		* Offer succeeds if not full; fails if full
487		*/
#	Line 464 | Line 495 | public class LinkedBlockingDequeTest ext
495		* add succeeds if not full; throws ISE if full
496		*/
497		public void testAdd() {
498	+	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
499	+	for (int i = 0; i < SIZE; ++i)
500	+	assertTrue(q.add(new Integer(i)));
501	+	assertEquals(0, q.remainingCapacity());
502		try {
468	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
469	–	for (int i = 0; i < SIZE; ++i) {
470	–	assertTrue(q.add(new Integer(i)));
471	–	}
472	–	assertEquals(0, q.remainingCapacity());
503		q.add(new Integer(SIZE));
474	–	} catch (IllegalStateException success) {
475	–	}
476	–	}
477	–
478	–	/**
479	–	* addAll(null) throws NPE
480	–	*/
481	–	public void testAddAll1() {
482	–	try {
483	–	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
484	–	q.addAll(null);
504		shouldThrow();
505	<	}
487	<	catch (NullPointerException success) {}
505	>	} catch (IllegalStateException success) {}
506		}
507
508		/**
509		* addAll(this) throws IAE
510		*/
511		public void testAddAllSelf() {
512	+	LinkedBlockingDeque q = populatedDeque(SIZE);
513		try {
495	–	LinkedBlockingDeque q = populatedDeque(SIZE);
514		q.addAll(q);
515		shouldThrow();
516	<	}
499	<	catch (IllegalArgumentException success) {}
516	>	} catch (IllegalArgumentException success) {}
517		}
518
519		/**
503	–	* addAll of a collection with null elements throws NPE
504	–	*/
505	–	public void testAddAll2() {
506	–	try {
507	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
508	–	Integer[] ints = new Integer[SIZE];
509	–	q.addAll(Arrays.asList(ints));
510	–	shouldThrow();
511	–	}
512	–	catch (NullPointerException success) {}
513	–	}
514	–	/**
520		* addAll of a collection with any null elements throws NPE after
521		* possibly adding some elements
522		*/
523		public void testAddAll3() {
524	+	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
525	+	Integer[] ints = new Integer[SIZE];
526	+	for (int i = 0; i < SIZE - 1; ++i)
527	+	ints[i] = new Integer(i);
528	+	Collection<Integer> elements = Arrays.asList(ints);
529		try {
530	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
521	<	Integer[] ints = new Integer[SIZE];
522	<	for (int i = 0; i < SIZE-1; ++i)
523	<	ints[i] = new Integer(i);
524	<	q.addAll(Arrays.asList(ints));
530	>	q.addAll(elements);
531		shouldThrow();
532	<	}
527	<	catch (NullPointerException success) {}
532	>	} catch (NullPointerException success) {}
533		}
534	+
535		/**
536	<	* addAll throws ISE if not enough room
536	>	* addAll throws IllegalStateException if not enough room
537		*/
538		public void testAddAll4() {
539	+	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE - 1);
540	+	Integer[] ints = new Integer[SIZE];
541	+	for (int i = 0; i < SIZE; ++i)
542	+	ints[i] = new Integer(i);
543	+	Collection<Integer> elements = Arrays.asList(ints);
544		try {
545	<	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
535	<	Integer[] ints = new Integer[SIZE];
536	<	for (int i = 0; i < SIZE; ++i)
537	<	ints[i] = new Integer(i);
538	<	q.addAll(Arrays.asList(ints));
545	>	q.addAll(elements);
546		shouldThrow();
547	<	}
541	<	catch (IllegalStateException success) {}
547	>	} catch (IllegalStateException success) {}
548		}
549	+
550		/**
551		* Deque contains all elements, in traversal order, of successful addAll
552		*/
553		public void testAddAll5() {
554	<	try {
555	<	Integer[] empty = new Integer[0];
556	<	Integer[] ints = new Integer[SIZE];
557	<	for (int i = 0; i < SIZE; ++i)
558	<	ints[i] = new Integer(i);
559	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
560	<	assertFalse(q.addAll(Arrays.asList(empty)));
561	<	assertTrue(q.addAll(Arrays.asList(ints)));
562	<	for (int i = 0; i < SIZE; ++i)
556	<	assertEquals(ints[i], q.poll());
557	<	}
558	<	finally {}
554	>	Integer[] empty = new Integer[0];
555	>	Integer[] ints = new Integer[SIZE];
556	>	for (int i = 0; i < SIZE; ++i)
557	>	ints[i] = new Integer(i);
558	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
559	>	assertFalse(q.addAll(Arrays.asList(empty)));
560	>	assertTrue(q.addAll(Arrays.asList(ints)));
561	>	for (int i = 0; i < SIZE; ++i)
562	>	assertEquals(ints[i], q.poll());
563		}
564
561	–
562	–	/**
563	–	* put(null) throws NPE
564	–	*/
565	–	public void testPutNull() {
566	–	try {
567	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
568	–	q.put(null);
569	–	shouldThrow();
570	–	}
571	–	catch (NullPointerException success) {
572	–	}
573	–	catch (InterruptedException ie) {
574	–	unexpectedException();
575	–	}
576	–	}
577	–
565		/**
566		* all elements successfully put are contained
567		*/
568	<	public void testPut() {
569	<	try {
570	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
571	<	for (int i = 0; i < SIZE; ++i) {
572	<	Integer I = new Integer(i);
573	<	q.put(I);
587	<	assertTrue(q.contains(I));
588	<	}
589	<	assertEquals(0, q.remainingCapacity());
590	<	}
591	<	catch (InterruptedException ie) {
592	<	unexpectedException();
568	>	public void testPut() throws InterruptedException {
569	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
570	>	for (int i = 0; i < SIZE; ++i) {
571	>	Integer x = new Integer(i);
572	>	q.put(x);
573	>	assertTrue(q.contains(x));
574		}
575	+	assertEquals(0, q.remainingCapacity());
576		}
577
578		/**
579		* put blocks interruptibly if full
580		*/
581	<	public void testBlockingPut() {
582	<	Thread t = new Thread(new Runnable() {
583	<	public void run() {
584	<	int added = 0;
585	<	try {
586	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
587	<	for (int i = 0; i < SIZE; ++i) {
588	<	q.put(new Integer(i));
589	<	++added;
590	<	}
591	<	q.put(new Integer(SIZE));
592	<	threadShouldThrow();
593	<	} catch (InterruptedException ie) {
594	<	threadAssertEquals(added, SIZE);
595	<	}
596	<	}});
597	<	t.start();
598	<	try {
599	<	Thread.sleep(SHORT_DELAY_MS);
600	<	t.interrupt();
601	<	t.join();
602	<	}
603	<	catch (InterruptedException ie) {
604	<	unexpectedException();
605	<	}
581	>	public void testBlockingPut() throws InterruptedException {
582	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
583	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
584	>	Thread t = newStartedThread(new CheckedRunnable() {
585	>	public void realRun() throws InterruptedException {
586	>	for (int i = 0; i < SIZE; ++i)
587	>	q.put(i);
588	>	assertEquals(SIZE, q.size());
589	>	assertEquals(0, q.remainingCapacity());
590	>
591	>	Thread.currentThread().interrupt();
592	>	try {
593	>	q.put(99);
594	>	shouldThrow();
595	>	} catch (InterruptedException success) {}
596	>	assertFalse(Thread.interrupted());
597	>
598	>	pleaseInterrupt.countDown();
599	>	try {
600	>	q.put(99);
601	>	shouldThrow();
602	>	} catch (InterruptedException success) {}
603	>	assertFalse(Thread.interrupted());
604	>	}});
605	>
606	>	await(pleaseInterrupt);
607	>	assertThreadBlocks(t, Thread.State.WAITING);
608	>	t.interrupt();
609	>	awaitTermination(t);
610	>	assertEquals(SIZE, q.size());
611	>	assertEquals(0, q.remainingCapacity());
612		}
613
614		/**
615	<	* put blocks waiting for take when full
615	>	* put blocks interruptibly waiting for take when full
616		*/
617	<	public void testPutWithTake() {
618	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
619	<	Thread t = new Thread(new Runnable() {
620	<	public void run() {
621	<	int added = 0;
622	<	try {
623	<	q.put(new Object());
624	<	++added;
625	<	q.put(new Object());
626	<	++added;
627	<	q.put(new Object());
628	<	++added;
629	<	q.put(new Object());
630	<	++added;
631	<	threadShouldThrow();
632	<	} catch (InterruptedException e) {
633	<	threadAssertTrue(added >= 2);
634	<	}
635	<	}
636	<	});
637	<	try {
638	<	t.start();
639	<	Thread.sleep(SHORT_DELAY_MS);
640	<	q.take();
641	<	t.interrupt();
642	<	t.join();
643	<	} catch (Exception e) {
644	<	unexpectedException();
645	<	}
617	>	public void testPutWithTake() throws InterruptedException {
618	>	final int capacity = 2;
619	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity);
620	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
621	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
622	>	Thread t = newStartedThread(new CheckedRunnable() {
623	>	public void realRun() throws InterruptedException {
624	>	for (int i = 0; i < capacity; i++)
625	>	q.put(i);
626	>	pleaseTake.countDown();
627	>	q.put(86);
628	>
629	>	pleaseInterrupt.countDown();
630	>	try {
631	>	q.put(99);
632	>	shouldThrow();
633	>	} catch (InterruptedException success) {}
634	>	assertFalse(Thread.interrupted());
635	>	}});
636	>
637	>	await(pleaseTake);
638	>	assertEquals(0, q.remainingCapacity());
639	>	assertEquals(0, q.take());
640	>
641	>	await(pleaseInterrupt);
642	>	assertThreadBlocks(t, Thread.State.WAITING);
643	>	t.interrupt();
644	>	awaitTermination(t);
645	>	assertEquals(0, q.remainingCapacity());
646		}
647
648		/**
649		* timed offer times out if full and elements not taken
650		*/
651	<	public void testTimedOffer() {
651	>	public void testTimedOffer() throws InterruptedException {
652		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
653	<	Thread t = new Thread(new Runnable() {
654	<	public void run() {
655	<	try {
656	<	q.put(new Object());
657	<	q.put(new Object());
658	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
659	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
660	<	threadShouldThrow();
661	<	} catch (InterruptedException success) {}
662	<	}
663	<	});
664	<
665	<	try {
666	<	t.start();
667	<	Thread.sleep(SMALL_DELAY_MS);
668	<	t.interrupt();
669	<	t.join();
670	<	} catch (Exception e) {
671	<	unexpectedException();
672	<	}
653	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
654	>	Thread t = newStartedThread(new CheckedRunnable() {
655	>	public void realRun() throws InterruptedException {
656	>	q.put(new Object());
657	>	q.put(new Object());
658	>	long startTime = System.nanoTime();
659	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
660	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
661	>	pleaseInterrupt.countDown();
662	>	try {
663	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
664	>	shouldThrow();
665	>	} catch (InterruptedException success) {}
666	>	assertFalse(Thread.interrupted());
667	>	}});
668	>
669	>	await(pleaseInterrupt);
670	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
671	>	t.interrupt();
672	>	awaitTermination(t);
673		}
674
675		/**
676		* take retrieves elements in FIFO order
677		*/
678	<	public void testTake() {
679	<	try {
680	<	LinkedBlockingDeque q = populatedDeque(SIZE);
681	<	for (int i = 0; i < SIZE; ++i) {
694	<	assertEquals(i, ((Integer)q.take()).intValue());
695	<	}
696	<	} catch (InterruptedException e) {
697	<	unexpectedException();
678	>	public void testTake() throws InterruptedException {
679	>	LinkedBlockingDeque q = populatedDeque(SIZE);
680	>	for (int i = 0; i < SIZE; ++i) {
681	>	assertEquals(i, q.take());
682		}
683		}
684
685		/**
686	<	* take blocks interruptibly when empty
686	>	* take removes existing elements until empty, then blocks interruptibly
687		*/
688	<	public void testTakeFromEmpty() {
689	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
690	<	Thread t = new Thread(new Runnable() {
691	<	public void run() {
692	<	try {
693	<	q.take();
710	<	threadShouldThrow();
711	<	} catch (InterruptedException success) { }
712	<	}
713	<	});
714	<	try {
715	<	t.start();
716	<	Thread.sleep(SHORT_DELAY_MS);
717	<	t.interrupt();
718	<	t.join();
719	<	} catch (Exception e) {
720	<	unexpectedException();
721	<	}
722	<	}
688	>	public void testBlockingTake() throws InterruptedException {
689	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
690	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
691	>	Thread t = newStartedThread(new CheckedRunnable() {
692	>	public void realRun() throws InterruptedException {
693	>	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
694
695	<	/**
696	<	* Take removes existing elements until empty, then blocks interruptibly
697	<	*/
698	<	public void testBlockingTake() {
699	<	Thread t = new Thread(new Runnable() {
700	<	public void run() {
730	<	try {
731	<	LinkedBlockingDeque q = populatedDeque(SIZE);
732	<	for (int i = 0; i < SIZE; ++i) {
733	<	assertEquals(i, ((Integer)q.take()).intValue());
734	<	}
735	<	q.take();
736	<	threadShouldThrow();
737	<	} catch (InterruptedException success) {
738	<	}
739	<	}});
740	<	t.start();
741	<	try {
742	<	Thread.sleep(SHORT_DELAY_MS);
743	<	t.interrupt();
744	<	t.join();
745	<	}
746	<	catch (InterruptedException ie) {
747	<	unexpectedException();
748	<	}
749	<	}
695	>	Thread.currentThread().interrupt();
696	>	try {
697	>	q.take();
698	>	shouldThrow();
699	>	} catch (InterruptedException success) {}
700	>	assertFalse(Thread.interrupted());
701
702	+	pleaseInterrupt.countDown();
703	+	try {
704	+	q.take();
705	+	shouldThrow();
706	+	} catch (InterruptedException success) {}
707	+	assertFalse(Thread.interrupted());
708	+	}});
709	+
710	+	await(pleaseInterrupt);
711	+	assertThreadBlocks(t, Thread.State.WAITING);
712	+	t.interrupt();
713	+	awaitTermination(t);
714	+	}
715
716		/**
717		* poll succeeds unless empty
#	Line 755 | Line 719 | public class LinkedBlockingDequeTest ext
719		public void testPoll() {
720		LinkedBlockingDeque q = populatedDeque(SIZE);
721		for (int i = 0; i < SIZE; ++i) {
722	<	assertEquals(i, ((Integer)q.poll()).intValue());
722	>	assertEquals(i, q.poll());
723		}
724		assertNull(q.poll());
725		}
#	Line 763 | Line 727 | public class LinkedBlockingDequeTest ext
727		/**
728		* timed poll with zero timeout succeeds when non-empty, else times out
729		*/
730	<	public void testTimedPoll0() {
731	<	try {
732	<	LinkedBlockingDeque q = populatedDeque(SIZE);
733	<	for (int i = 0; i < SIZE; ++i) {
770	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
771	<	}
772	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
773	<	} catch (InterruptedException e) {
774	<	unexpectedException();
730	>	public void testTimedPoll0() throws InterruptedException {
731	>	LinkedBlockingDeque q = populatedDeque(SIZE);
732	>	for (int i = 0; i < SIZE; ++i) {
733	>	assertEquals(i, q.poll(0, MILLISECONDS));
734		}
735	+	assertNull(q.poll(0, MILLISECONDS));
736		}
737
738		/**
739		* timed poll with nonzero timeout succeeds when non-empty, else times out
740		*/
741	<	public void testTimedPoll() {
742	<	try {
743	<	LinkedBlockingDeque q = populatedDeque(SIZE);
744	<	for (int i = 0; i < SIZE; ++i) {
745	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
746	<	}
747	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
748	<	} catch (InterruptedException e) {
749	<	unexpectedException();
750	<	}
741	>	public void testTimedPoll() throws InterruptedException {
742	>	LinkedBlockingDeque q = populatedDeque(SIZE);
743	>	for (int i = 0; i < SIZE; ++i) {
744	>	long startTime = System.nanoTime();
745	>	assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
746	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
747	>	}
748	>	long startTime = System.nanoTime();
749	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
750	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
751	>	checkEmpty(q);
752		}
753
754		/**
755		* Interrupted timed poll throws InterruptedException instead of
756		* returning timeout status
757		*/
758	<	public void testInterruptedTimedPoll() {
759	<	Thread t = new Thread(new Runnable() {
760	<	public void run() {
761	<	try {
762	<	LinkedBlockingDeque q = populatedDeque(SIZE);
763	<	for (int i = 0; i < SIZE; ++i) {
764	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
765	<	}
805	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
806	<	} catch (InterruptedException success) {
807	<	}
808	<	}});
809	<	t.start();
810	<	try {
811	<	Thread.sleep(SHORT_DELAY_MS);
812	<	t.interrupt();
813	<	t.join();
814	<	}
815	<	catch (InterruptedException ie) {
816	<	unexpectedException();
817	<	}
818	<	}
819	<
820	<	/**
821	<	*  timed poll before a delayed offer fails; after offer succeeds;
822	<	*  on interruption throws
823	<	*/
824	<	public void testTimedPollWithOffer() {
825	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
826	<	Thread t = new Thread(new Runnable() {
827	<	public void run() {
828	<	try {
829	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
830	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
831	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
832	<	threadShouldThrow();
833	<	} catch (InterruptedException success) { }
758	>	public void testInterruptedTimedPoll() throws InterruptedException {
759	>	final BlockingQueue<Integer> q = populatedDeque(SIZE);
760	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
761	>	Thread t = newStartedThread(new CheckedRunnable() {
762	>	public void realRun() throws InterruptedException {
763	>	long startTime = System.nanoTime();
764	>	for (int i = 0; i < SIZE; ++i) {
765	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
766		}
835	–	});
836	–	try {
837	–	t.start();
838	–	Thread.sleep(SMALL_DELAY_MS);
839	–	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
840	–	t.interrupt();
841	–	t.join();
842	–	} catch (Exception e) {
843	–	unexpectedException();
844	–	}
845	–	}
767
768	+	pleaseInterrupt.countDown();
769	+	try {
770	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
771	+	shouldThrow();
772	+	} catch (InterruptedException success) {}
773	+	assertFalse(Thread.interrupted());
774	+
775	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
776	+	}});
777	+
778	+	await(pleaseInterrupt);
779	+	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
780	+	t.interrupt();
781	+	awaitTermination(t);
782	+	checkEmpty(q);
783	+	}
784
785		/**
786		* putFirst(null) throws NPE
787		*/
788	<	public void testPutFirstNull() {
788	>	public void testPutFirstNull() throws InterruptedException {
789	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
790		try {
853	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
791		q.putFirst(null);
792		shouldThrow();
793	<	}
794	<	catch (NullPointerException success) {
858	<	}
859	<	catch (InterruptedException ie) {
860	<	unexpectedException();
861	<	}
862	<	}
793	>	} catch (NullPointerException success) {}
794	>	}
795
796		/**
797		* all elements successfully putFirst are contained
798		*/
799	<	public void testPutFirst() {
800	<	try {
801	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
802	<	for (int i = 0; i < SIZE; ++i) {
803	<	Integer I = new Integer(i);
804	<	q.putFirst(I);
873	<	assertTrue(q.contains(I));
874	<	}
875	<	assertEquals(0, q.remainingCapacity());
876	<	}
877	<	catch (InterruptedException ie) {
878	<	unexpectedException();
799	>	public void testPutFirst() throws InterruptedException {
800	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
801	>	for (int i = 0; i < SIZE; ++i) {
802	>	Integer x = new Integer(i);
803	>	q.putFirst(x);
804	>	assertTrue(q.contains(x));
805		}
806	+	assertEquals(0, q.remainingCapacity());
807		}
808
809		/**
810		* putFirst blocks interruptibly if full
811		*/
812	<	public void testBlockingPutFirst() {
813	<	Thread t = new Thread(new Runnable() {
814	<	public void run() {
815	<	int added = 0;
816	<	try {
817	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
818	<	for (int i = 0; i < SIZE; ++i) {
819	<	q.putFirst(new Integer(i));
820	<	++added;
821	<	}
822	<	q.putFirst(new Integer(SIZE));
823	<	threadShouldThrow();
824	<	} catch (InterruptedException ie) {
825	<	threadAssertEquals(added, SIZE);
826	<	}
827	<	}});
828	<	t.start();
829	<	try {
830	<	Thread.sleep(SHORT_DELAY_MS);
831	<	t.interrupt();
832	<	t.join();
833	<	}
834	<	catch (InterruptedException ie) {
835	<	unexpectedException();
836	<	}
812	>	public void testBlockingPutFirst() throws InterruptedException {
813	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
814	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
815	>	Thread t = newStartedThread(new CheckedRunnable() {
816	>	public void realRun() throws InterruptedException {
817	>	for (int i = 0; i < SIZE; ++i)
818	>	q.putFirst(i);
819	>	assertEquals(SIZE, q.size());
820	>	assertEquals(0, q.remainingCapacity());
821	>
822	>	Thread.currentThread().interrupt();
823	>	try {
824	>	q.putFirst(99);
825	>	shouldThrow();
826	>	} catch (InterruptedException success) {}
827	>	assertFalse(Thread.interrupted());
828	>
829	>	pleaseInterrupt.countDown();
830	>	try {
831	>	q.putFirst(99);
832	>	shouldThrow();
833	>	} catch (InterruptedException success) {}
834	>	assertFalse(Thread.interrupted());
835	>	}});
836	>
837	>	await(pleaseInterrupt);
838	>	assertThreadBlocks(t, Thread.State.WAITING);
839	>	t.interrupt();
840	>	awaitTermination(t);
841	>	assertEquals(SIZE, q.size());
842	>	assertEquals(0, q.remainingCapacity());
843		}
844
845		/**
846	<	* putFirst blocks waiting for take when full
846	>	* putFirst blocks interruptibly waiting for take when full
847		*/
848	<	public void testPutFirstWithTake() {
849	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
850	<	Thread t = new Thread(new Runnable() {
851	<	public void run() {
852	<	int added = 0;
853	<	try {
854	<	q.putFirst(new Object());
855	<	++added;
856	<	q.putFirst(new Object());
857	<	++added;
858	<	q.putFirst(new Object());
859	<	++added;
860	<	q.putFirst(new Object());
861	<	++added;
862	<	threadShouldThrow();
863	<	} catch (InterruptedException e) {
864	<	threadAssertTrue(added >= 2);
865	<	}
866	<	}
867	<	});
868	<	try {
869	<	t.start();
870	<	Thread.sleep(SHORT_DELAY_MS);
871	<	q.take();
872	<	t.interrupt();
873	<	t.join();
874	<	} catch (Exception e) {
875	<	unexpectedException();
876	<	}
848	>	public void testPutFirstWithTake() throws InterruptedException {
849	>	final int capacity = 2;
850	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity);
851	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
852	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
853	>	Thread t = newStartedThread(new CheckedRunnable() {
854	>	public void realRun() throws InterruptedException {
855	>	for (int i = 0; i < capacity; i++)
856	>	q.putFirst(i);
857	>	pleaseTake.countDown();
858	>	q.putFirst(86);
859	>
860	>	pleaseInterrupt.countDown();
861	>	try {
862	>	q.putFirst(99);
863	>	shouldThrow();
864	>	} catch (InterruptedException success) {}
865	>	assertFalse(Thread.interrupted());
866	>	}});
867	>
868	>	await(pleaseTake);
869	>	assertEquals(0, q.remainingCapacity());
870	>	assertEquals(capacity - 1, q.take());
871	>
872	>	await(pleaseInterrupt);
873	>	assertThreadBlocks(t, Thread.State.WAITING);
874	>	t.interrupt();
875	>	awaitTermination(t);
876	>	assertEquals(0, q.remainingCapacity());
877		}
878
879		/**
880		* timed offerFirst times out if full and elements not taken
881		*/
882	<	public void testTimedOfferFirst() {
882	>	public void testTimedOfferFirst() throws InterruptedException {
883		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
884	<	Thread t = new Thread(new Runnable() {
885	<	public void run() {
886	<	try {
887	<	q.putFirst(new Object());
888	<	q.putFirst(new Object());
889	<	threadAssertFalse(q.offerFirst(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
890	<	q.offerFirst(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
891	<	threadShouldThrow();
892	<	} catch (InterruptedException success) {}
893	<	}
894	<	});
895	<
896	<	try {
897	<	t.start();
898	<	Thread.sleep(SMALL_DELAY_MS);
899	<	t.interrupt();
900	<	t.join();
901	<	} catch (Exception e) {
902	<	unexpectedException();
903	<	}
884	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
885	>	Thread t = newStartedThread(new CheckedRunnable() {
886	>	public void realRun() throws InterruptedException {
887	>	q.putFirst(new Object());
888	>	q.putFirst(new Object());
889	>	long startTime = System.nanoTime();
890	>	assertFalse(q.offerFirst(new Object(), timeoutMillis(), MILLISECONDS));
891	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
892	>	pleaseInterrupt.countDown();
893	>	try {
894	>	q.offerFirst(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
895	>	shouldThrow();
896	>	} catch (InterruptedException success) {}
897	>	assertFalse(Thread.interrupted());
898	>	}});
899	>
900	>	await(pleaseInterrupt);
901	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
902	>	t.interrupt();
903	>	awaitTermination(t);
904		}
905
906		/**
907		* take retrieves elements in FIFO order
908		*/
909	<	public void testTakeFirst() {
910	<	try {
911	<	LinkedBlockingDeque q = populatedDeque(SIZE);
912	<	for (int i = 0; i < SIZE; ++i) {
980	<	assertEquals(i, ((Integer)q.takeFirst()).intValue());
981	<	}
982	<	} catch (InterruptedException e) {
983	<	unexpectedException();
909	>	public void testTakeFirst() throws InterruptedException {
910	>	LinkedBlockingDeque q = populatedDeque(SIZE);
911	>	for (int i = 0; i < SIZE; ++i) {
912	>	assertEquals(i, q.takeFirst());
913		}
914		}
915
916		/**
917	<	* takeFirst blocks interruptibly when empty
917	>	* takeFirst() blocks interruptibly when empty
918		*/
919	<	public void testTakeFirstFromEmpty() {
920	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
921	<	Thread t = new Thread(new Runnable() {
922	<	public void run() {
923	<	try {
924	<	q.takeFirst();
925	<	threadShouldThrow();
926	<	} catch (InterruptedException success) { }
927	<	}
928	<	});
929	<	try {
930	<	t.start();
931	<	Thread.sleep(SHORT_DELAY_MS);
932	<	t.interrupt();
933	<	t.join();
934	<	} catch (Exception e) {
935	<	unexpectedException();
1007	<	}
919	>	public void testTakeFirstFromEmptyBlocksInterruptibly() {
920	>	final BlockingDeque q = new LinkedBlockingDeque();
921	>	final CountDownLatch threadStarted = new CountDownLatch(1);
922	>	Thread t = newStartedThread(new CheckedRunnable() {
923	>	public void realRun() {
924	>	threadStarted.countDown();
925	>	try {
926	>	q.takeFirst();
927	>	shouldThrow();
928	>	} catch (InterruptedException success) {}
929	>	assertFalse(Thread.interrupted());
930	>	}});
931	>
932	>	await(threadStarted);
933	>	assertThreadBlocks(t, Thread.State.WAITING);
934	>	t.interrupt();
935	>	awaitTermination(t);
936		}
937
938		/**
939	<	* TakeFirst removes existing elements until empty, then blocks interruptibly
940	<	*/
941	<	public void testBlockingTakeFirst() {
942	<	Thread t = new Thread(new Runnable() {
943	<	public void run() {
944	<	try {
945	<	LinkedBlockingDeque q = populatedDeque(SIZE);
946	<	for (int i = 0; i < SIZE; ++i) {
947	<	assertEquals(i, ((Integer)q.takeFirst()).intValue());
948	<	}
949	<	q.takeFirst();
950	<	threadShouldThrow();
951	<	} catch (InterruptedException success) {
952	<	}
953	<	}});
954	<	t.start();
955	<	try {
956	<	Thread.sleep(SHORT_DELAY_MS);
957	<	t.interrupt();
958	<	t.join();
959	<	}
960	<	catch (InterruptedException ie) {
961	<	unexpectedException();
962	<	}
939	>	* takeFirst() throws InterruptedException immediately if interrupted
940	>	* before waiting
941	>	*/
942	>	public void testTakeFirstFromEmptyAfterInterrupt() {
943	>	final BlockingDeque q = new LinkedBlockingDeque();
944	>	Thread t = newStartedThread(new CheckedRunnable() {
945	>	public void realRun() {
946	>	Thread.currentThread().interrupt();
947	>	try {
948	>	q.takeFirst();
949	>	shouldThrow();
950	>	} catch (InterruptedException success) {}
951	>	assertFalse(Thread.interrupted());
952	>	}});
953	>
954	>	awaitTermination(t);
955	>	}
956	>
957	>	/**
958	>	* takeLast() blocks interruptibly when empty
959	>	*/
960	>	public void testTakeLastFromEmptyBlocksInterruptibly() {
961	>	final BlockingDeque q = new LinkedBlockingDeque();
962	>	final CountDownLatch threadStarted = new CountDownLatch(1);
963	>	Thread t = newStartedThread(new CheckedRunnable() {
964	>	public void realRun() {
965	>	threadStarted.countDown();
966	>	try {
967	>	q.takeLast();
968	>	shouldThrow();
969	>	} catch (InterruptedException success) {}
970	>	assertFalse(Thread.interrupted());
971	>	}});
972	>
973	>	await(threadStarted);
974	>	assertThreadBlocks(t, Thread.State.WAITING);
975	>	t.interrupt();
976	>	awaitTermination(t);
977		}
978
979	+	/**
980	+	* takeLast() throws InterruptedException immediately if interrupted
981	+	* before waiting
982	+	*/
983	+	public void testTakeLastFromEmptyAfterInterrupt() {
984	+	final BlockingDeque q = new LinkedBlockingDeque();
985	+	Thread t = newStartedThread(new CheckedRunnable() {
986	+	public void realRun() {
987	+	Thread.currentThread().interrupt();
988	+	try {
989	+	q.takeLast();
990	+	shouldThrow();
991	+	} catch (InterruptedException success) {}
992	+	assertFalse(Thread.interrupted());
993	+	}});
994	+
995	+	awaitTermination(t);
996	+	}
997	+
998	+	/**
999	+	* takeFirst removes existing elements until empty, then blocks interruptibly
1000	+	*/
1001	+	public void testBlockingTakeFirst() throws InterruptedException {
1002	+	final LinkedBlockingDeque q = populatedDeque(SIZE);
1003	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1004	+	Thread t = newStartedThread(new CheckedRunnable() {
1005	+	public void realRun() throws InterruptedException {
1006	+	for (int i = 0; i < SIZE; i++) assertEquals(i, q.takeFirst());
1007	+
1008	+	Thread.currentThread().interrupt();
1009	+	try {
1010	+	q.takeFirst();
1011	+	shouldThrow();
1012	+	} catch (InterruptedException success) {}
1013	+	assertFalse(Thread.interrupted());
1014	+
1015	+	pleaseInterrupt.countDown();
1016	+	try {
1017	+	q.takeFirst();
1018	+	shouldThrow();
1019	+	} catch (InterruptedException success) {}
1020	+	assertFalse(Thread.interrupted());
1021	+	}});
1022	+
1023	+	await(pleaseInterrupt);
1024	+	assertThreadBlocks(t, Thread.State.WAITING);
1025	+	t.interrupt();
1026	+	awaitTermination(t);
1027	+	}
1028
1029		/**
1030		* timed pollFirst with zero timeout succeeds when non-empty, else times out
1031		*/
1032	<	public void testTimedPollFirst0() {
1033	<	try {
1034	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1035	<	for (int i = 0; i < SIZE; ++i) {
1045	<	assertEquals(i, ((Integer)q.pollFirst(0, TimeUnit.MILLISECONDS)).intValue());
1046	<	}
1047	<	assertNull(q.pollFirst(0, TimeUnit.MILLISECONDS));
1048	<	} catch (InterruptedException e) {
1049	<	unexpectedException();
1032	>	public void testTimedPollFirst0() throws InterruptedException {
1033	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1034	>	for (int i = 0; i < SIZE; ++i) {
1035	>	assertEquals(i, q.pollFirst(0, MILLISECONDS));
1036		}
1037	+	assertNull(q.pollFirst(0, MILLISECONDS));
1038		}
1039
1040		/**
1041		* timed pollFirst with nonzero timeout succeeds when non-empty, else times out
1042		*/
1043	<	public void testTimedPollFirst() {
1044	<	try {
1045	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1046	<	for (int i = 0; i < SIZE; ++i) {
1047	<	assertEquals(i, ((Integer)q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1048	<	}
1049	<	assertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1050	<	} catch (InterruptedException e) {
1051	<	unexpectedException();
1052	<	}
1043	>	public void testTimedPollFirst() throws InterruptedException {
1044	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1045	>	for (int i = 0; i < SIZE; ++i) {
1046	>	long startTime = System.nanoTime();
1047	>	assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1048	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1049	>	}
1050	>	long startTime = System.nanoTime();
1051	>	assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS));
1052	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1053	>	checkEmpty(q);
1054		}
1055
1056		/**
1057		* Interrupted timed pollFirst throws InterruptedException instead of
1058		* returning timeout status
1059		*/
1060	<	public void testInterruptedTimedPollFirst() {
1061	<	Thread t = new Thread(new Runnable() {
1062	<	public void run() {
1063	<	try {
1064	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1065	<	for (int i = 0; i < SIZE; ++i) {
1066	<	threadAssertEquals(i, ((Integer)q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1067	<	}
1068	<	threadAssertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1069	<	} catch (InterruptedException success) {
1070	<	}
1071	<	}});
1072	<	t.start();
1073	<	try {
1074	<	Thread.sleep(SHORT_DELAY_MS);
1075	<	t.interrupt();
1076	<	t.join();
1077	<	}
1078	<	catch (InterruptedException ie) {
1079	<	unexpectedException();
1080	<	}
1060	>	public void testInterruptedTimedPollFirst() throws InterruptedException {
1061	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1062	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1063	>	Thread t = newStartedThread(new CheckedRunnable() {
1064	>	public void realRun() throws InterruptedException {
1065	>	long startTime = System.nanoTime();
1066	>	for (int i = 0; i < SIZE; ++i) {
1067	>	assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1068	>	}
1069	>
1070	>	Thread.currentThread().interrupt();
1071	>	try {
1072	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1073	>	shouldThrow();
1074	>	} catch (InterruptedException success) {}
1075	>	assertFalse(Thread.interrupted());
1076	>
1077	>	pleaseInterrupt.countDown();
1078	>	try {
1079	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1080	>	shouldThrow();
1081	>	} catch (InterruptedException success) {}
1082	>	assertFalse(Thread.interrupted());
1083	>
1084	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1085	>	}});
1086	>
1087	>	await(pleaseInterrupt);
1088	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1089	>	t.interrupt();
1090	>	awaitTermination(t);
1091		}
1092
1093		/**
1094	<	*  timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
1095	<	*  on interruption throws
1094	>	* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
1095	>	* on interruption throws
1096		*/
1097	<	public void testTimedPollFirstWithOfferFirst() {
1097	>	public void testTimedPollFirstWithOfferFirst() throws InterruptedException {
1098		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1099	<	Thread t = new Thread(new Runnable() {
1100	<	public void run() {
1101	<	try {
1102	<	threadAssertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1103	<	q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1104	<	q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1105	<	threadShouldThrow();
1106	<	} catch (InterruptedException success) { }
1107	<	}
1108	<	});
1109	<	try {
1110	<	t.start();
1111	<	Thread.sleep(SMALL_DELAY_MS);
1112	<	assertTrue(q.offerFirst(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1113	<	t.interrupt();
1114	<	t.join();
1115	<	} catch (Exception e) {
1116	<	unexpectedException();
1117	<	}
1099	>	final CheckedBarrier barrier = new CheckedBarrier(2);
1100	>	Thread t = newStartedThread(new CheckedRunnable() {
1101	>	public void realRun() throws InterruptedException {
1102	>	long startTime = System.nanoTime();
1103	>	assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS));
1104	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1105	>
1106	>	barrier.await();
1107	>
1108	>	assertSame(zero, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1109	>
1110	>	Thread.currentThread().interrupt();
1111	>	try {
1112	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1113	>	shouldThrow();
1114	>	} catch (InterruptedException success) {}
1115	>
1116	>	barrier.await();
1117	>	try {
1118	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1119	>	shouldThrow();
1120	>	} catch (InterruptedException success) {}
1121	>	assertFalse(Thread.interrupted());
1122	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1123	>	}});
1124	>
1125	>	barrier.await();
1126	>	long startTime = System.nanoTime();
1127	>	assertTrue(q.offerFirst(zero, LONG_DELAY_MS, MILLISECONDS));
1128	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1129	>	barrier.await();
1130	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1131	>	t.interrupt();
1132	>	awaitTermination(t);
1133		}
1134
1135		/**
1136		* putLast(null) throws NPE
1137		*/
1138	<	public void testPutLastNull() {
1138	>	public void testPutLastNull() throws InterruptedException {
1139	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1140		try {
1127	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1141		q.putLast(null);
1142		shouldThrow();
1143	<	}
1144	<	catch (NullPointerException success) {
1132	<	}
1133	<	catch (InterruptedException ie) {
1134	<	unexpectedException();
1135	<	}
1136	<	}
1143	>	} catch (NullPointerException success) {}
1144	>	}
1145
1146		/**
1147		* all elements successfully putLast are contained
1148		*/
1149	<	public void testPutLast() {
1150	<	try {
1151	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1152	<	for (int i = 0; i < SIZE; ++i) {
1153	<	Integer I = new Integer(i);
1154	<	q.putLast(I);
1147	<	assertTrue(q.contains(I));
1148	<	}
1149	<	assertEquals(0, q.remainingCapacity());
1150	<	}
1151	<	catch (InterruptedException ie) {
1152	<	unexpectedException();
1149	>	public void testPutLast() throws InterruptedException {
1150	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1151	>	for (int i = 0; i < SIZE; ++i) {
1152	>	Integer x = new Integer(i);
1153	>	q.putLast(x);
1154	>	assertTrue(q.contains(x));
1155		}
1156	+	assertEquals(0, q.remainingCapacity());
1157		}
1158
1159		/**
1160		* putLast blocks interruptibly if full
1161		*/
1162	<	public void testBlockingPutLast() {
1163	<	Thread t = new Thread(new Runnable() {
1164	<	public void run() {
1165	<	int added = 0;
1166	<	try {
1167	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1168	<	for (int i = 0; i < SIZE; ++i) {
1169	<	q.putLast(new Integer(i));
1170	<	++added;
1171	<	}
1172	<	q.putLast(new Integer(SIZE));
1173	<	threadShouldThrow();
1174	<	} catch (InterruptedException ie) {
1175	<	threadAssertEquals(added, SIZE);
1176	<	}
1177	<	}});
1178	<	t.start();
1179	<	try {
1180	<	Thread.sleep(SHORT_DELAY_MS);
1181	<	t.interrupt();
1182	<	t.join();
1183	<	}
1184	<	catch (InterruptedException ie) {
1185	<	unexpectedException();
1186	<	}
1162	>	public void testBlockingPutLast() throws InterruptedException {
1163	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1164	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1165	>	Thread t = newStartedThread(new CheckedRunnable() {
1166	>	public void realRun() throws InterruptedException {
1167	>	for (int i = 0; i < SIZE; ++i)
1168	>	q.putLast(i);
1169	>	assertEquals(SIZE, q.size());
1170	>	assertEquals(0, q.remainingCapacity());
1171	>
1172	>	Thread.currentThread().interrupt();
1173	>	try {
1174	>	q.putLast(99);
1175	>	shouldThrow();
1176	>	} catch (InterruptedException success) {}
1177	>	assertFalse(Thread.interrupted());
1178	>
1179	>	pleaseInterrupt.countDown();
1180	>	try {
1181	>	q.putLast(99);
1182	>	shouldThrow();
1183	>	} catch (InterruptedException success) {}
1184	>	assertFalse(Thread.interrupted());
1185	>	}});
1186	>
1187	>	await(pleaseInterrupt);
1188	>	assertThreadBlocks(t, Thread.State.WAITING);
1189	>	t.interrupt();
1190	>	awaitTermination(t);
1191	>	assertEquals(SIZE, q.size());
1192	>	assertEquals(0, q.remainingCapacity());
1193		}
1194
1195		/**
1196	<	* putLast blocks waiting for take when full
1196	>	* putLast blocks interruptibly waiting for take when full
1197		*/
1198	<	public void testPutLastWithTake() {
1199	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1200	<	Thread t = new Thread(new Runnable() {
1201	<	public void run() {
1202	<	int added = 0;
1203	<	try {
1204	<	q.putLast(new Object());
1205	<	++added;
1206	<	q.putLast(new Object());
1207	<	++added;
1208	<	q.putLast(new Object());
1209	<	++added;
1210	<	q.putLast(new Object());
1211	<	++added;
1212	<	threadShouldThrow();
1213	<	} catch (InterruptedException e) {
1214	<	threadAssertTrue(added >= 2);
1215	<	}
1216	<	}
1217	<	});
1218	<	try {
1219	<	t.start();
1220	<	Thread.sleep(SHORT_DELAY_MS);
1221	<	q.take();
1222	<	t.interrupt();
1223	<	t.join();
1224	<	} catch (Exception e) {
1225	<	unexpectedException();
1226	<	}
1198	>	public void testPutLastWithTake() throws InterruptedException {
1199	>	final int capacity = 2;
1200	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity);
1201	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
1202	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1203	>	Thread t = newStartedThread(new CheckedRunnable() {
1204	>	public void realRun() throws InterruptedException {
1205	>	for (int i = 0; i < capacity; i++)
1206	>	q.putLast(i);
1207	>	pleaseTake.countDown();
1208	>	q.putLast(86);
1209	>
1210	>	pleaseInterrupt.countDown();
1211	>	try {
1212	>	q.putLast(99);
1213	>	shouldThrow();
1214	>	} catch (InterruptedException success) {}
1215	>	assertFalse(Thread.interrupted());
1216	>	}});
1217	>
1218	>	await(pleaseTake);
1219	>	assertEquals(0, q.remainingCapacity());
1220	>	assertEquals(0, q.take());
1221	>
1222	>	await(pleaseInterrupt);
1223	>	assertThreadBlocks(t, Thread.State.WAITING);
1224	>	t.interrupt();
1225	>	awaitTermination(t);
1226	>	assertEquals(0, q.remainingCapacity());
1227		}
1228
1229		/**
1230		* timed offerLast times out if full and elements not taken
1231		*/
1232	<	public void testTimedOfferLast() {
1232	>	public void testTimedOfferLast() throws InterruptedException {
1233		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1234	<	Thread t = new Thread(new Runnable() {
1235	<	public void run() {
1236	<	try {
1237	<	q.putLast(new Object());
1238	<	q.putLast(new Object());
1239	<	threadAssertFalse(q.offerLast(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1240	<	q.offerLast(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1241	<	threadShouldThrow();
1242	<	} catch (InterruptedException success) {}
1243	<	}
1244	<	});
1245	<
1246	<	try {
1247	<	t.start();
1248	<	Thread.sleep(SMALL_DELAY_MS);
1249	<	t.interrupt();
1250	<	t.join();
1251	<	} catch (Exception e) {
1252	<	unexpectedException();
1244	<	}
1234	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1235	>	Thread t = newStartedThread(new CheckedRunnable() {
1236	>	public void realRun() throws InterruptedException {
1237	>	q.putLast(new Object());
1238	>	q.putLast(new Object());
1239	>	long startTime = System.nanoTime();
1240	>	assertFalse(q.offerLast(new Object(), timeoutMillis(), MILLISECONDS));
1241	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1242	>	pleaseInterrupt.countDown();
1243	>	try {
1244	>	q.offerLast(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
1245	>	shouldThrow();
1246	>	} catch (InterruptedException success) {}
1247	>	}});
1248	>
1249	>	await(pleaseInterrupt);
1250	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1251	>	t.interrupt();
1252	>	awaitTermination(t);
1253		}
1254
1255		/**
1256		* takeLast retrieves elements in FIFO order
1257		*/
1258	<	public void testTakeLast() {
1259	<	try {
1260	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1261	<	for (int i = 0; i < SIZE; ++i) {
1254	<	assertEquals(SIZE-i-1, ((Integer)q.takeLast()).intValue());
1255	<	}
1256	<	} catch (InterruptedException e) {
1257	<	unexpectedException();
1258	>	public void testTakeLast() throws InterruptedException {
1259	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1260	>	for (int i = 0; i < SIZE; ++i) {
1261	>	assertEquals(SIZE - i - 1, q.takeLast());
1262		}
1263		}
1264
1265		/**
1266	<	* takeLast blocks interruptibly when empty
1266	>	* takeLast removes existing elements until empty, then blocks interruptibly
1267		*/
1268	<	public void testTakeLastFromEmpty() {
1269	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1270	<	Thread t = new Thread(new Runnable() {
1271	<	public void run() {
1272	<	try {
1273	<	q.takeLast();
1274	<	threadShouldThrow();
1271	<	} catch (InterruptedException success) { }
1272	<	}
1273	<	});
1274	<	try {
1275	<	t.start();
1276	<	Thread.sleep(SHORT_DELAY_MS);
1277	<	t.interrupt();
1278	<	t.join();
1279	<	} catch (Exception e) {
1280	<	unexpectedException();
1281	<	}
1282	<	}
1268	>	public void testBlockingTakeLast() throws InterruptedException {
1269	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1270	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1271	>	Thread t = newStartedThread(new CheckedRunnable() {
1272	>	public void realRun() throws InterruptedException {
1273	>	for (int i = 0; i < SIZE; i++)
1274	>	assertEquals(SIZE - i - 1, q.takeLast());
1275
1276	<	/**
1277	<	* TakeLast removes existing elements until empty, then blocks interruptibly
1278	<	*/
1279	<	public void testBlockingTakeLast() {
1280	<	Thread t = new Thread(new Runnable() {
1281	<	public void run() {
1290	<	try {
1291	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1292	<	for (int i = 0; i < SIZE; ++i) {
1293	<	assertEquals(SIZE-i-1, ((Integer)q.takeLast()).intValue());
1294	<	}
1295	<	q.takeLast();
1296	<	threadShouldThrow();
1297	<	} catch (InterruptedException success) {
1298	<	}
1299	<	}});
1300	<	t.start();
1301	<	try {
1302	<	Thread.sleep(SHORT_DELAY_MS);
1303	<	t.interrupt();
1304	<	t.join();
1305	<	}
1306	<	catch (InterruptedException ie) {
1307	<	unexpectedException();
1308	<	}
1309	<	}
1276	>	Thread.currentThread().interrupt();
1277	>	try {
1278	>	q.takeLast();
1279	>	shouldThrow();
1280	>	} catch (InterruptedException success) {}
1281	>	assertFalse(Thread.interrupted());
1282
1283	+	pleaseInterrupt.countDown();
1284	+	try {
1285	+	q.takeLast();
1286	+	shouldThrow();
1287	+	} catch (InterruptedException success) {}
1288	+	assertFalse(Thread.interrupted());
1289	+	}});
1290	+
1291	+	await(pleaseInterrupt);
1292	+	assertThreadBlocks(t, Thread.State.WAITING);
1293	+	t.interrupt();
1294	+	awaitTermination(t);
1295	+	}
1296
1297		/**
1298		* timed pollLast with zero timeout succeeds when non-empty, else times out
1299		*/
1300	<	public void testTimedPollLast0() {
1301	<	try {
1302	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1303	<	for (int i = 0; i < SIZE; ++i) {
1319	<	assertEquals(SIZE-i-1, ((Integer)q.pollLast(0, TimeUnit.MILLISECONDS)).intValue());
1320	<	}
1321	<	assertNull(q.pollLast(0, TimeUnit.MILLISECONDS));
1322	<	} catch (InterruptedException e) {
1323	<	unexpectedException();
1300	>	public void testTimedPollLast0() throws InterruptedException {
1301	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1302	>	for (int i = 0; i < SIZE; ++i) {
1303	>	assertEquals(SIZE - i - 1, q.pollLast(0, MILLISECONDS));
1304		}
1305	+	assertNull(q.pollLast(0, MILLISECONDS));
1306		}
1307
1308		/**
1309		* timed pollLast with nonzero timeout succeeds when non-empty, else times out
1310		*/
1311	<	public void testTimedPollLast() {
1312	<	try {
1313	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1314	<	for (int i = 0; i < SIZE; ++i) {
1315	<	assertEquals(SIZE-i-1, ((Integer)q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1316	<	}
1317	<	assertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1318	<	} catch (InterruptedException e) {
1319	<	unexpectedException();
1320	<	}
1311	>	public void testTimedPollLast() throws InterruptedException {
1312	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1313	>	for (int i = 0; i < SIZE; ++i) {
1314	>	long startTime = System.nanoTime();
1315	>	assertEquals(SIZE - i - 1, q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1316	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1317	>	}
1318	>	long startTime = System.nanoTime();
1319	>	assertNull(q.pollLast(timeoutMillis(), MILLISECONDS));
1320	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1321	>	checkEmpty(q);
1322		}
1323
1324		/**
1325		* Interrupted timed pollLast throws InterruptedException instead of
1326		* returning timeout status
1327		*/
1328	<	public void testInterruptedTimedPollLast() {
1329	<	Thread t = new Thread(new Runnable() {
1330	<	public void run() {
1331	<	try {
1332	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1333	<	for (int i = 0; i < SIZE; ++i) {
1334	<	threadAssertEquals(SIZE-i-1, ((Integer)q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1335	<	}
1336	<	threadAssertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1337	<	} catch (InterruptedException success) {
1338	<	}
1339	<	}});
1340	<	t.start();
1341	<	try {
1342	<	Thread.sleep(SHORT_DELAY_MS);
1343	<	t.interrupt();
1344	<	t.join();
1345	<	}
1346	<	catch (InterruptedException ie) {
1347	<	unexpectedException();
1348	<	}
1328	>	public void testInterruptedTimedPollLast() throws InterruptedException {
1329	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1330	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1331	>	Thread t = newStartedThread(new CheckedRunnable() {
1332	>	public void realRun() throws InterruptedException {
1333	>	long startTime = System.nanoTime();
1334	>	for (int i = 0; i < SIZE; ++i) {
1335	>	assertEquals(SIZE - i - 1,
1336	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1337	>	}
1338	>
1339	>	Thread.currentThread().interrupt();
1340	>	try {
1341	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS);
1342	>	shouldThrow();
1343	>	} catch (InterruptedException success) {}
1344	>	assertFalse(Thread.interrupted());
1345	>
1346	>	pleaseInterrupt.countDown();
1347	>	try {
1348	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS);
1349	>	shouldThrow();
1350	>	} catch (InterruptedException success) {}
1351	>	assertFalse(Thread.interrupted());
1352	>
1353	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1354	>	}});
1355	>
1356	>	await(pleaseInterrupt);
1357	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1358	>	t.interrupt();
1359	>	awaitTermination(t);
1360	>	checkEmpty(q);
1361		}
1362
1363		/**
1364	<	*  timed poll before a delayed offerLast fails; after offerLast succeeds;
1365	<	*  on interruption throws
1364	>	* timed poll before a delayed offerLast fails; after offerLast succeeds;
1365	>	* on interruption throws
1366		*/
1367	<	public void testTimedPollWithOfferLast() {
1367	>	public void testTimedPollWithOfferLast() throws InterruptedException {
1368		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1369	<	Thread t = new Thread(new Runnable() {
1370	<	public void run() {
1371	<	try {
1372	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1373	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1374	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1375	<	threadShouldThrow();
1376	<	} catch (InterruptedException success) { }
1383	<	}
1384	<	});
1385	<	try {
1386	<	t.start();
1387	<	Thread.sleep(SMALL_DELAY_MS);
1388	<	assertTrue(q.offerLast(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1389	<	t.interrupt();
1390	<	t.join();
1391	<	} catch (Exception e) {
1392	<	unexpectedException();
1393	<	}
1394	<	}
1369	>	final CheckedBarrier barrier = new CheckedBarrier(2);
1370	>	Thread t = newStartedThread(new CheckedRunnable() {
1371	>	public void realRun() throws InterruptedException {
1372	>	long startTime = System.nanoTime();
1373	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
1374	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1375	>
1376	>	barrier.await();
1377
1378	+	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
1379	+
1380	+	Thread.currentThread().interrupt();
1381	+	try {
1382	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
1383	+	shouldThrow();
1384	+	} catch (InterruptedException success) {}
1385	+	assertFalse(Thread.interrupted());
1386	+
1387	+	barrier.await();
1388	+	try {
1389	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
1390	+	shouldThrow();
1391	+	} catch (InterruptedException success) {}
1392	+	assertFalse(Thread.interrupted());
1393	+
1394	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1395	+	}});
1396	+
1397	+	barrier.await();
1398	+	long startTime = System.nanoTime();
1399	+	assertTrue(q.offerLast(zero, LONG_DELAY_MS, MILLISECONDS));
1400	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1401	+
1402	+	barrier.await();
1403	+	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1404	+	t.interrupt();
1405	+	awaitTermination(t);
1406	+	}
1407
1408		/**
1409		* element returns next element, or throws NSEE if empty
#	Line 1400 | Line 1411 | public class LinkedBlockingDequeTest ext
1411		public void testElement() {
1412		LinkedBlockingDeque q = populatedDeque(SIZE);
1413		for (int i = 0; i < SIZE; ++i) {
1414	<	assertEquals(i, ((Integer)q.element()).intValue());
1414	>	assertEquals(i, q.element());
1415		q.poll();
1416		}
1417		try {
1418		q.element();
1419		shouldThrow();
1420	<	}
1410	<	catch (NoSuchElementException success) {}
1411	<	}
1412	<
1413	<	/**
1414	<	* remove(x) removes x and returns true if present
1415	<	*/
1416	<	public void testRemoveElement() {
1417	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1418	<	for (int i = 1; i < SIZE; i+=2) {
1419	<	assertTrue(q.remove(new Integer(i)));
1420	<	}
1421	<	for (int i = 0; i < SIZE; i+=2) {
1422	<	assertTrue(q.remove(new Integer(i)));
1423	<	assertFalse(q.remove(new Integer(i+1)));
1424	<	}
1425	<	assertTrue(q.isEmpty());
1420	>	} catch (NoSuchElementException success) {}
1421		}
1422
1423		/**
#	Line 1481 | Line 1476 | public class LinkedBlockingDequeTest ext
1476		assertTrue(changed);
1477
1478		assertTrue(q.containsAll(p));
1479	<	assertEquals(SIZE-i, q.size());
1479	>	assertEquals(SIZE - i, q.size());
1480		p.remove();
1481		}
1482		}
#	Line 1494 | Line 1489 | public class LinkedBlockingDequeTest ext
1489		LinkedBlockingDeque q = populatedDeque(SIZE);
1490		LinkedBlockingDeque p = populatedDeque(i);
1491		assertTrue(q.removeAll(p));
1492	<	assertEquals(SIZE-i, q.size());
1492	>	assertEquals(SIZE - i, q.size());
1493		for (int j = 0; j < i; ++j) {
1494	<	Integer I = (Integer)(p.remove());
1495	<	assertFalse(q.contains(I));
1494	>	Integer x = (Integer)(p.remove());
1495	>	assertFalse(q.contains(x));
1496		}
1497		}
1498		}
1499
1500		/**
1501	<	* toArray contains all elements
1501	>	* toArray contains all elements in FIFO order
1502		*/
1503	<	public void testToArray() {
1503	>	public void testToArray() throws InterruptedException {
1504		LinkedBlockingDeque q = populatedDeque(SIZE);
1505		Object[] o = q.toArray();
1511	–	try {
1506		for (int i = 0; i < o.length; i++)
1507	<	assertEquals(o[i], q.take());
1514	<	} catch (InterruptedException e) {
1515	<	unexpectedException();
1516	<	}
1507	>	assertSame(o[i], q.poll());
1508		}
1509
1510		/**
1511	<	* toArray(a) contains all elements
1511	>	* toArray(a) contains all elements in FIFO order
1512		*/
1513		public void testToArray2() {
1514	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1514	>	LinkedBlockingDeque<Integer> q = populatedDeque(SIZE);
1515		Integer[] ints = new Integer[SIZE];
1516	<	ints = (Integer[])q.toArray(ints);
1517	<	try {
1518	<	for (int i = 0; i < ints.length; i++)
1519	<	assertEquals(ints[i], q.take());
1529	<	} catch (InterruptedException e) {
1530	<	unexpectedException();
1531	<	}
1532	<	}
1533	<
1534	<	/**
1535	<	* toArray(null) throws NPE
1536	<	*/
1537	<	public void testToArray_BadArg() {
1538	<	try {
1539	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1540	<	Object o[] = q.toArray(null);
1541	<	shouldThrow();
1542	<	} catch (NullPointerException success) {}
1516	>	Integer[] array = q.toArray(ints);
1517	>	assertSame(ints, array);
1518	>	for (int i = 0; i < ints.length; i++)
1519	>	assertSame(ints[i], q.remove());
1520		}
1521
1522		/**
1523	<	* toArray with incompatible array type throws CCE
1523	>	* toArray(incompatible array type) throws ArrayStoreException
1524		*/
1525		public void testToArray1_BadArg() {
1526	+	LinkedBlockingDeque q = populatedDeque(SIZE);
1527		try {
1528	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1551	<	Object o[] = q.toArray(new String[10] );
1528	>	q.toArray(new String[10]);
1529		shouldThrow();
1530	<	} catch (ArrayStoreException  success) {}
1530	>	} catch (ArrayStoreException success) {}
1531		}
1532
1556	–
1533		/**
1534		* iterator iterates through all elements
1535		*/
1536	<	public void testIterator() {
1536	>	public void testIterator() throws InterruptedException {
1537		LinkedBlockingDeque q = populatedDeque(SIZE);
1538		Iterator it = q.iterator();
1539	<	try {
1540	<	while (it.hasNext()) {
1541	<	assertEquals(it.next(), q.take());
1542	<	}
1543	<	} catch (InterruptedException e) {
1544	<	unexpectedException();
1545	<	}
1539	>	int i;
1540	>	for (i = 0; it.hasNext(); i++)
1541	>	assertTrue(q.contains(it.next()));
1542	>	assertEquals(i, SIZE);
1543	>	assertIteratorExhausted(it);
1544	>
1545	>	it = q.iterator();
1546	>	for (i = 0; it.hasNext(); i++)
1547	>	assertEquals(it.next(), q.take());
1548	>	assertEquals(i, SIZE);
1549	>	assertIteratorExhausted(it);
1550	>	}
1551	>
1552	>	/**
1553	>	* iterator of empty collection has no elements
1554	>	*/
1555	>	public void testEmptyIterator() {
1556	>	Deque c = new LinkedBlockingDeque();
1557	>	assertIteratorExhausted(c.iterator());
1558	>	assertIteratorExhausted(c.descendingIterator());
1559		}
1560
1561		/**
1562		* iterator.remove removes current element
1563		*/
1564	<	public void testIteratorRemove () {
1564	>	public void testIteratorRemove() {
1565		final LinkedBlockingDeque q = new LinkedBlockingDeque(3);
1566		q.add(two);
1567		q.add(one);
#	Line 1583 | Line 1572 | public class LinkedBlockingDequeTest ext
1572		it.remove();
1573
1574		it = q.iterator();
1575	<	assertEquals(it.next(), one);
1576	<	assertEquals(it.next(), three);
1575	>	assertSame(it.next(), one);
1576	>	assertSame(it.next(), three);
1577		assertFalse(it.hasNext());
1578		}
1579
1591	–
1580		/**
1581		* iterator ordering is FIFO
1582		*/
#	Line 1600 | Line 1588 | public class LinkedBlockingDequeTest ext
1588		assertEquals(0, q.remainingCapacity());
1589		int k = 0;
1590		for (Iterator it = q.iterator(); it.hasNext();) {
1591	<	int i = ((Integer)(it.next())).intValue();
1604	<	assertEquals(++k, i);
1591	>	assertEquals(++k, it.next());
1592		}
1593		assertEquals(3, k);
1594		}
#	Line 1609 | Line 1596 | public class LinkedBlockingDequeTest ext
1596		/**
1597		* Modifications do not cause iterators to fail
1598		*/
1599	<	public void testWeaklyConsistentIteration () {
1599	>	public void testWeaklyConsistentIteration() {
1600		final LinkedBlockingDeque q = new LinkedBlockingDeque(3);
1601		q.add(one);
1602		q.add(two);
1603		q.add(three);
1604	<	try {
1605	<	for (Iterator it = q.iterator(); it.hasNext();) {
1606	<	q.remove();
1620	<	it.next();
1621	<	}
1622	<	}
1623	<	catch (ConcurrentModificationException e) {
1624	<	unexpectedException();
1604	>	for (Iterator it = q.iterator(); it.hasNext();) {
1605	>	q.remove();
1606	>	it.next();
1607		}
1608		assertEquals(0, q.size());
1609		}
1610
1629	–
1611		/**
1612	<	*  Descending iterator iterates through all elements
1612	>	* Descending iterator iterates through all elements
1613		*/
1614		public void testDescendingIterator() {
1615		LinkedBlockingDeque q = populatedDeque(SIZE);
#	Line 1642 | Line 1623 | public class LinkedBlockingDequeTest ext
1623		assertFalse(it.hasNext());
1624		try {
1625		it.next();
1626	<	} catch (NoSuchElementException success) {
1627	<	}
1626	>	shouldThrow();
1627	>	} catch (NoSuchElementException success) {}
1628		}
1629
1630		/**
1631	<	*  Descending iterator ordering is reverse FIFO
1631	>	* Descending iterator ordering is reverse FIFO
1632		*/
1633		public void testDescendingIteratorOrdering() {
1634		final LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 1657 | Line 1638 | public class LinkedBlockingDequeTest ext
1638		q.add(new Integer(1));
1639		int k = 0;
1640		for (Iterator it = q.descendingIterator(); it.hasNext();) {
1641	<	int i = ((Integer)(it.next())).intValue();
1661	<	assertEquals(++k, i);
1641	>	assertEquals(++k, it.next());
1642		}
1643
1644		assertEquals(3, k);
#	Line 1671 | Line 1651 | public class LinkedBlockingDequeTest ext
1651		/**
1652		* descendingIterator.remove removes current element
1653		*/
1654	<	public void testDescendingIteratorRemove () {
1654	>	public void testDescendingIteratorRemove() {
1655		final LinkedBlockingDeque q = new LinkedBlockingDeque();
1656		for (int iters = 0; iters < 100; ++iters) {
1657		q.add(new Integer(3));
#	Line 1690 | Line 1670 | public class LinkedBlockingDequeTest ext
1670		}
1671		}
1672
1693	–
1673		/**
1674		* toString contains toStrings of elements
1675		*/
#	Line 1698 | Line 1677 | public class LinkedBlockingDequeTest ext
1677		LinkedBlockingDeque q = populatedDeque(SIZE);
1678		String s = q.toString();
1679		for (int i = 0; i < SIZE; ++i) {
1680	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
1680	>	assertTrue(s.contains(String.valueOf(i)));
1681		}
1682		}
1683
1705	–
1684		/**
1685		* offer transfers elements across Executor tasks
1686		*/
#	Line 1710 | Line 1688 | public class LinkedBlockingDequeTest ext
1688		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1689		q.add(one);
1690		q.add(two);
1691	<	ExecutorService executor = Executors.newFixedThreadPool(2);
1692	<	executor.execute(new Runnable() {
1693	<	public void run() {
1694	<	threadAssertFalse(q.offer(three));
1695	<	try {
1696	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
1697	<	threadAssertEquals(0, q.remainingCapacity());
1698	<	}
1699	<	catch (InterruptedException e) {
1700	<	threadUnexpectedException();
1723	<	}
1724	<	}
1725	<	});
1726	<
1727	<	executor.execute(new Runnable() {
1728	<	public void run() {
1729	<	try {
1730	<	Thread.sleep(SMALL_DELAY_MS);
1731	<	threadAssertEquals(one, q.take());
1732	<	}
1733	<	catch (InterruptedException e) {
1734	<	threadUnexpectedException();
1735	<	}
1736	<	}
1737	<	});
1691	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
1692	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
1693	>	try (PoolCleaner cleaner = cleaner(executor)) {
1694	>	executor.execute(new CheckedRunnable() {
1695	>	public void realRun() throws InterruptedException {
1696	>	assertFalse(q.offer(three));
1697	>	threadsStarted.await();
1698	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
1699	>	assertEquals(0, q.remainingCapacity());
1700	>	}});
1701
1702	<	joinPool(executor);
1702	>	executor.execute(new CheckedRunnable() {
1703	>	public void realRun() throws InterruptedException {
1704	>	threadsStarted.await();
1705	>	assertSame(one, q.take());
1706	>	}});
1707	>	}
1708		}
1709
1710		/**
1711	<	* poll retrieves elements across Executor threads
1711	>	* timed poll retrieves elements across Executor threads
1712		*/
1713		public void testPollInExecutor() {
1714		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1715	<	ExecutorService executor = Executors.newFixedThreadPool(2);
1716	<	executor.execute(new Runnable() {
1717	<	public void run() {
1718	<	threadAssertNull(q.poll());
1719	<	try {
1720	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
1721	<	threadAssertTrue(q.isEmpty());
1722	<	}
1723	<	catch (InterruptedException e) {
1724	<	threadUnexpectedException();
1757	<	}
1758	<	}
1759	<	});
1715	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
1716	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
1717	>	try (PoolCleaner cleaner = cleaner(executor)) {
1718	>	executor.execute(new CheckedRunnable() {
1719	>	public void realRun() throws InterruptedException {
1720	>	assertNull(q.poll());
1721	>	threadsStarted.await();
1722	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
1723	>	checkEmpty(q);
1724	>	}});
1725
1726	<	executor.execute(new Runnable() {
1727	<	public void run() {
1728	<	try {
1764	<	Thread.sleep(SMALL_DELAY_MS);
1726	>	executor.execute(new CheckedRunnable() {
1727	>	public void realRun() throws InterruptedException {
1728	>	threadsStarted.await();
1729		q.put(one);
1730	<	}
1767	<	catch (InterruptedException e) {
1768	<	threadUnexpectedException();
1769	<	}
1770	<	}
1771	<	});
1772	<
1773	<	joinPool(executor);
1774	<	}
1775	<
1776	<	/**
1777	<	* A deserialized serialized deque has same elements in same order
1778	<	*/
1779	<	public void testSerialization() {
1780	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1781	<
1782	<	try {
1783	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
1784	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
1785	<	out.writeObject(q);
1786	<	out.close();
1787	<
1788	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
1789	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
1790	<	LinkedBlockingDeque r = (LinkedBlockingDeque)in.readObject();
1791	<	assertEquals(q.size(), r.size());
1792	<	while (!q.isEmpty())
1793	<	assertEquals(q.remove(), r.remove());
1794	<	} catch (Exception e) {
1795	<	unexpectedException();
1796	<	}
1797	<	}
1798	<
1799	<	/**
1800	<	* drainTo(null) throws NPE
1801	<	*/
1802	<	public void testDrainToNull() {
1803	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1804	<	try {
1805	<	q.drainTo(null);
1806	<	shouldThrow();
1807	<	} catch (NullPointerException success) {
1730	>	}});
1731		}
1732		}
1733
1734		/**
1735	<	* drainTo(this) throws IAE
1735	>	* A deserialized serialized deque has same elements in same order
1736		*/
1737	<	public void testDrainToSelf() {
1738	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1739	<	try {
1740	<	q.drainTo(q);
1741	<	shouldThrow();
1742	<	} catch (IllegalArgumentException success) {
1737	>	public void testSerialization() throws Exception {
1738	>	Queue x = populatedDeque(SIZE);
1739	>	Queue y = serialClone(x);
1740	>
1741	>	assertNotSame(y, x);
1742	>	assertEquals(x.size(), y.size());
1743	>	assertEquals(x.toString(), y.toString());
1744	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
1745	>	while (!x.isEmpty()) {
1746	>	assertFalse(y.isEmpty());
1747	>	assertEquals(x.remove(), y.remove());
1748		}
1749	+	assertTrue(y.isEmpty());
1750		}
1751
1752		/**
#	Line 1827 | Line 1756 | public class LinkedBlockingDequeTest ext
1756		LinkedBlockingDeque q = populatedDeque(SIZE);
1757		ArrayList l = new ArrayList();
1758		q.drainTo(l);
1759	<	assertEquals(q.size(), 0);
1760	<	assertEquals(l.size(), SIZE);
1759	>	assertEquals(0, q.size());
1760	>	assertEquals(SIZE, l.size());
1761		for (int i = 0; i < SIZE; ++i)
1762		assertEquals(l.get(i), new Integer(i));
1763		q.add(zero);
#	Line 1838 | Line 1767 | public class LinkedBlockingDequeTest ext
1767		assertTrue(q.contains(one));
1768		l.clear();
1769		q.drainTo(l);
1770	<	assertEquals(q.size(), 0);
1771	<	assertEquals(l.size(), 2);
1770	>	assertEquals(0, q.size());
1771	>	assertEquals(2, l.size());
1772		for (int i = 0; i < 2; ++i)
1773		assertEquals(l.get(i), new Integer(i));
1774		}
#	Line 1847 | Line 1776 | public class LinkedBlockingDequeTest ext
1776		/**
1777		* drainTo empties full deque, unblocking a waiting put.
1778		*/
1779	<	public void testDrainToWithActivePut() {
1779	>	public void testDrainToWithActivePut() throws InterruptedException {
1780		final LinkedBlockingDeque q = populatedDeque(SIZE);
1781	<	Thread t = new Thread(new Runnable() {
1782	<	public void run() {
1783	<	try {
1784	<	q.put(new Integer(SIZE+1));
1856	<	} catch (InterruptedException ie) {
1857	<	threadUnexpectedException();
1858	<	}
1859	<	}
1860	<	});
1861	<	try {
1862	<	t.start();
1863	<	ArrayList l = new ArrayList();
1864	<	q.drainTo(l);
1865	<	assertTrue(l.size() >= SIZE);
1866	<	for (int i = 0; i < SIZE; ++i)
1867	<	assertEquals(l.get(i), new Integer(i));
1868	<	t.join();
1869	<	assertTrue(q.size() + l.size() >= SIZE);
1870	<	} catch (Exception e) {
1871	<	unexpectedException();
1872	<	}
1873	<	}
1874	<
1875	<	/**
1876	<	* drainTo(null, n) throws NPE
1877	<	*/
1878	<	public void testDrainToNullN() {
1879	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1880	<	try {
1881	<	q.drainTo(null, 0);
1882	<	shouldThrow();
1883	<	} catch (NullPointerException success) {
1884	<	}
1885	<	}
1781	>	Thread t = new Thread(new CheckedRunnable() {
1782	>	public void realRun() throws InterruptedException {
1783	>	q.put(new Integer(SIZE + 1));
1784	>	}});
1785
1786	<	/**
1787	<	* drainTo(this, n) throws IAE
1788	<	*/
1789	<	public void testDrainToSelfN() {
1790	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1791	<	try {
1792	<	q.drainTo(q, 0);
1793	<	shouldThrow();
1895	<	} catch (IllegalArgumentException success) {
1896	<	}
1786	>	t.start();
1787	>	ArrayList l = new ArrayList();
1788	>	q.drainTo(l);
1789	>	assertTrue(l.size() >= SIZE);
1790	>	for (int i = 0; i < SIZE; ++i)
1791	>	assertEquals(l.get(i), new Integer(i));
1792	>	t.join();
1793	>	assertTrue(q.size() + l.size() >= SIZE);
1794		}
1795
1796		/**
1797	<	* drainTo(c, n) empties first max {n, size} elements of deque into c
1797	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
1798		*/
1799		public void testDrainToN() {
1800		LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 1906 | Line 1803 | public class LinkedBlockingDequeTest ext
1803		assertTrue(q.offer(new Integer(j)));
1804		ArrayList l = new ArrayList();
1805		q.drainTo(l, i);
1806	<	int k = (i < SIZE)? i : SIZE;
1807	<	assertEquals(l.size(), k);
1808	<	assertEquals(q.size(), SIZE-k);
1806	>	int k = (i < SIZE) ? i : SIZE;
1807	>	assertEquals(k, l.size());
1808	>	assertEquals(SIZE - k, q.size());
1809		for (int j = 0; j < k; ++j)
1810		assertEquals(l.get(j), new Integer(j));
1811	<	while (q.poll() != null) ;
1811	>	do {} while (q.poll() != null);
1812	>	}
1813	>	}
1814	>
1815	>	/**
1816	>	* remove(null), contains(null) always return false
1817	>	*/
1818	>	public void testNeverContainsNull() {
1819	>	Deque<?>[] qs = {
1820	>	new LinkedBlockingDeque<Object>(),
1821	>	populatedDeque(2),
1822	>	};
1823	>
1824	>	for (Deque<?> q : qs) {
1825	>	assertFalse(q.contains(null));
1826	>	assertFalse(q.remove(null));
1827	>	assertFalse(q.removeFirstOccurrence(null));
1828	>	assertFalse(q.removeLastOccurrence(null));
1829		}
1830		}
1831

Diff Legend

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