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.4 by jsr166, Mon Nov 2 20:28:31 2009 UTC vs.
Revision 1.76 by jsr166, Sun May 14 00:48:20 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)));
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());
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	<	try {
109	<	LinkedBlockingDeque q = new LinkedBlockingDeque();
108	>	LinkedBlockingDeque q = new LinkedBlockingDeque();
109	>	try {
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());
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());
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());
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());
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());
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	<	}
237	<	catch (NoSuchElementException success) {}
189	<	assertNull(q.peekLast());
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){
252	<	}
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 255 | Line 317 | public class LinkedBlockingDequeTest ext
317		public void testAddFirst() {
318		LinkedBlockingDeque q = populatedDeque(3);
319		q.pollLast();
320	<	q.addFirst(four);
321	<	assertEquals(four,q.peekFirst());
320	>	q.addFirst(four);
321	>	assertSame(four, q.peekFirst());
322		}
323
324		/**
#	Line 265 | Line 327 | public class LinkedBlockingDequeTest ext
327		public void testAddLast() {
328		LinkedBlockingDeque q = populatedDeque(3);
329		q.pollLast();
330	<	q.addLast(four);
331	<	assertEquals(four,q.peekLast());
330	>	q.addLast(four);
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	<	try {
438	<	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
437	>	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
438	>	try {
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	<	try {
449	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
450	<	for (int i = 0; i < SIZE; ++i) {
451	<	Integer I = new Integer(i);
452	<	q.push(I);
453	<	assertEquals(I, q.peek());
454	<	}
455	<	assertEquals(0, q.remainingCapacity());
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 {
456		q.push(new Integer(SIZE));
457	<	} catch (IllegalStateException success){
458	<	}
457	>	shouldThrow();
458	>	} catch (IllegalStateException success) {}
459		}
460
461		/**
#	Line 430 | Line 464 | public class LinkedBlockingDequeTest ext
464		public void testPushWithPeek() {
465		LinkedBlockingDeque q = populatedDeque(3);
466		q.pollLast();
467	<	q.push(four);
468	<	assertEquals(four,q.peekFirst());
467	>	q.push(four);
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	<	try {
499	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
500	<	for (int i = 0; i < SIZE; ++i) {
501	<	assertTrue(q.add(new Integer(i)));
471	<	}
472	<	assertEquals(0, q.remainingCapacity());
473	<	q.add(new Integer(SIZE));
474	<	} catch (IllegalStateException success){
475	<	}
476	<	}
477	<
478	<	/**
479	<	* addAll(null) throws NPE
480	<	*/
481	<	public void testAddAll1() {
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 {
503	<	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
484	<	q.addAll(null);
503	>	q.add(new Integer(SIZE));
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();
684	<	}
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	>	}});
667	>
668	>	await(pleaseInterrupt);
669	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
670	>	t.interrupt();
671	>	awaitTermination(t);
672		}
673
674		/**
675		* take retrieves elements in FIFO order
676		*/
677	<	public void testTake() {
678	<	try {
679	<	LinkedBlockingDeque q = populatedDeque(SIZE);
680	<	for (int i = 0; i < SIZE; ++i) {
681	<	assertEquals(i, ((Integer)q.take()).intValue());
695	<	}
696	<	} catch (InterruptedException e){
697	<	unexpectedException();
698	<	}
677	>	public void testTake() throws InterruptedException {
678	>	LinkedBlockingDeque q = populatedDeque(SIZE);
679	>	for (int i = 0; i < SIZE; ++i) {
680	>	assertEquals(i, q.take());
681	>	}
682		}
683
684		/**
685	<	* take blocks interruptibly when empty
685	>	* take removes existing elements until empty, then blocks interruptibly
686		*/
687	<	public void testTakeFromEmpty() {
688	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
689	<	Thread t = new Thread(new Runnable() {
690	<	public void run() {
691	<	try {
692	<	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	<	}
687	>	public void testBlockingTake() throws InterruptedException {
688	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
689	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
690	>	Thread t = newStartedThread(new CheckedRunnable() {
691	>	public void realRun() throws InterruptedException {
692	>	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
693
694	<	/**
695	<	* Take removes existing elements until empty, then blocks interruptibly
696	<	*/
697	<	public void testBlockingTake() {
698	<	Thread t = new Thread(new Runnable() {
699	<	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	<	}
694	>	Thread.currentThread().interrupt();
695	>	try {
696	>	q.take();
697	>	shouldThrow();
698	>	} catch (InterruptedException success) {}
699	>	assertFalse(Thread.interrupted());
700
701	+	pleaseInterrupt.countDown();
702	+	try {
703	+	q.take();
704	+	shouldThrow();
705	+	} catch (InterruptedException success) {}
706	+	assertFalse(Thread.interrupted());
707	+	}});
708	+
709	+	await(pleaseInterrupt);
710	+	assertThreadBlocks(t, Thread.State.WAITING);
711	+	t.interrupt();
712	+	awaitTermination(t);
713	+	}
714
715		/**
716		* poll succeeds unless empty
#	Line 755 | Line 718 | public class LinkedBlockingDequeTest ext
718		public void testPoll() {
719		LinkedBlockingDeque q = populatedDeque(SIZE);
720		for (int i = 0; i < SIZE; ++i) {
721	<	assertEquals(i, ((Integer)q.poll()).intValue());
721	>	assertEquals(i, q.poll());
722		}
723	<	assertNull(q.poll());
723	>	assertNull(q.poll());
724		}
725
726		/**
727		* timed poll with zero timeout succeeds when non-empty, else times out
728		*/
729	<	public void testTimedPoll0() {
730	<	try {
731	<	LinkedBlockingDeque q = populatedDeque(SIZE);
732	<	for (int i = 0; i < SIZE; ++i) {
733	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
734	<	}
772	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
773	<	} catch (InterruptedException e){
774	<	unexpectedException();
775	<	}
729	>	public void testTimedPoll0() throws InterruptedException {
730	>	LinkedBlockingDeque q = populatedDeque(SIZE);
731	>	for (int i = 0; i < SIZE; ++i) {
732	>	assertEquals(i, q.poll(0, MILLISECONDS));
733	>	}
734	>	assertNull(q.poll(0, MILLISECONDS));
735		}
736
737		/**
738		* timed poll with nonzero timeout succeeds when non-empty, else times out
739		*/
740	<	public void testTimedPoll() {
741	<	try {
742	<	LinkedBlockingDeque q = populatedDeque(SIZE);
743	<	for (int i = 0; i < SIZE; ++i) {
744	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
745	<	}
746	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
747	<	} catch (InterruptedException e){
748	<	unexpectedException();
749	<	}
740	>	public void testTimedPoll() throws InterruptedException {
741	>	LinkedBlockingDeque q = populatedDeque(SIZE);
742	>	for (int i = 0; i < SIZE; ++i) {
743	>	long startTime = System.nanoTime();
744	>	assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
745	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
746	>	}
747	>	long startTime = System.nanoTime();
748	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
749	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
750	>	checkEmpty(q);
751		}
752
753		/**
754		* Interrupted timed poll throws InterruptedException instead of
755		* returning timeout status
756		*/
757	<	public void testInterruptedTimedPoll() {
758	<	Thread t = new Thread(new Runnable() {
759	<	public void run() {
760	<	try {
761	<	LinkedBlockingDeque q = populatedDeque(SIZE);
762	<	for (int i = 0; i < SIZE; ++i) {
763	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
764	<	}
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) { }
757	>	public void testInterruptedTimedPoll() throws InterruptedException {
758	>	final BlockingQueue<Integer> q = populatedDeque(SIZE);
759	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
760	>	Thread t = newStartedThread(new CheckedRunnable() {
761	>	public void realRun() throws InterruptedException {
762	>	long startTime = System.nanoTime();
763	>	for (int i = 0; i < SIZE; ++i) {
764	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
765		}
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	–	}
766
767	+	pleaseInterrupt.countDown();
768	+	try {
769	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
770	+	shouldThrow();
771	+	} catch (InterruptedException success) {}
772	+	assertFalse(Thread.interrupted());
773	+
774	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
775	+	}});
776	+
777	+	await(pleaseInterrupt);
778	+	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
779	+	t.interrupt();
780	+	awaitTermination(t);
781	+	checkEmpty(q);
782	+	}
783
784		/**
785		* putFirst(null) throws NPE
786		*/
787	<	public void testPutFirstNull() {
788	<	try {
789	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
787	>	public void testPutFirstNull() throws InterruptedException {
788	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
789	>	try {
790		q.putFirst(null);
791		shouldThrow();
792	<	}
793	<	catch (NullPointerException success){
858	<	}
859	<	catch (InterruptedException ie) {
860	<	unexpectedException();
861	<	}
862	<	}
792	>	} catch (NullPointerException success) {}
793	>	}
794
795		/**
796		* all elements successfully putFirst are contained
797		*/
798	<	public void testPutFirst() {
799	<	try {
800	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
801	<	for (int i = 0; i < SIZE; ++i) {
802	<	Integer I = new Integer(i);
803	<	q.putFirst(I);
873	<	assertTrue(q.contains(I));
874	<	}
875	<	assertEquals(0, q.remainingCapacity());
876	<	}
877	<	catch (InterruptedException ie) {
878	<	unexpectedException();
798	>	public void testPutFirst() throws InterruptedException {
799	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
800	>	for (int i = 0; i < SIZE; ++i) {
801	>	Integer x = new Integer(i);
802	>	q.putFirst(x);
803	>	assertTrue(q.contains(x));
804		}
805	+	assertEquals(0, q.remainingCapacity());
806		}
807
808		/**
809		* putFirst blocks interruptibly if full
810		*/
811	<	public void testBlockingPutFirst() {
812	<	Thread t = new Thread(new Runnable() {
813	<	public void run() {
814	<	int added = 0;
815	<	try {
816	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
817	<	for (int i = 0; i < SIZE; ++i) {
818	<	q.putFirst(new Integer(i));
819	<	++added;
820	<	}
821	<	q.putFirst(new Integer(SIZE));
822	<	threadShouldThrow();
823	<	} catch (InterruptedException ie){
824	<	threadAssertEquals(added, SIZE);
825	<	}
826	<	}});
827	<	t.start();
828	<	try {
829	<	Thread.sleep(SHORT_DELAY_MS);
830	<	t.interrupt();
831	<	t.join();
832	<	}
833	<	catch (InterruptedException ie) {
834	<	unexpectedException();
835	<	}
811	>	public void testBlockingPutFirst() throws InterruptedException {
812	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
813	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
814	>	Thread t = newStartedThread(new CheckedRunnable() {
815	>	public void realRun() throws InterruptedException {
816	>	for (int i = 0; i < SIZE; ++i)
817	>	q.putFirst(i);
818	>	assertEquals(SIZE, q.size());
819	>	assertEquals(0, q.remainingCapacity());
820	>
821	>	Thread.currentThread().interrupt();
822	>	try {
823	>	q.putFirst(99);
824	>	shouldThrow();
825	>	} catch (InterruptedException success) {}
826	>	assertFalse(Thread.interrupted());
827	>
828	>	pleaseInterrupt.countDown();
829	>	try {
830	>	q.putFirst(99);
831	>	shouldThrow();
832	>	} catch (InterruptedException success) {}
833	>	assertFalse(Thread.interrupted());
834	>	}});
835	>
836	>	await(pleaseInterrupt);
837	>	assertThreadBlocks(t, Thread.State.WAITING);
838	>	t.interrupt();
839	>	awaitTermination(t);
840	>	assertEquals(SIZE, q.size());
841	>	assertEquals(0, q.remainingCapacity());
842		}
843
844		/**
845	<	* putFirst blocks waiting for take when full
845	>	* putFirst blocks interruptibly waiting for take when full
846		*/
847	<	public void testPutFirstWithTake() {
848	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
849	<	Thread t = new Thread(new Runnable() {
850	<	public void run() {
851	<	int added = 0;
852	<	try {
853	<	q.putFirst(new Object());
854	<	++added;
855	<	q.putFirst(new Object());
856	<	++added;
857	<	q.putFirst(new Object());
858	<	++added;
859	<	q.putFirst(new Object());
860	<	++added;
861	<	threadShouldThrow();
862	<	} catch (InterruptedException e){
863	<	threadAssertTrue(added >= 2);
864	<	}
865	<	}
866	<	});
867	<	try {
868	<	t.start();
869	<	Thread.sleep(SHORT_DELAY_MS);
870	<	q.take();
871	<	t.interrupt();
872	<	t.join();
873	<	} catch (Exception e){
874	<	unexpectedException();
875	<	}
847	>	public void testPutFirstWithTake() throws InterruptedException {
848	>	final int capacity = 2;
849	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity);
850	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
851	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
852	>	Thread t = newStartedThread(new CheckedRunnable() {
853	>	public void realRun() throws InterruptedException {
854	>	for (int i = 0; i < capacity; i++)
855	>	q.putFirst(i);
856	>	pleaseTake.countDown();
857	>	q.putFirst(86);
858	>
859	>	pleaseInterrupt.countDown();
860	>	try {
861	>	q.putFirst(99);
862	>	shouldThrow();
863	>	} catch (InterruptedException success) {}
864	>	assertFalse(Thread.interrupted());
865	>	}});
866	>
867	>	await(pleaseTake);
868	>	assertEquals(0, q.remainingCapacity());
869	>	assertEquals(capacity - 1, q.take());
870	>
871	>	await(pleaseInterrupt);
872	>	assertThreadBlocks(t, Thread.State.WAITING);
873	>	t.interrupt();
874	>	awaitTermination(t);
875	>	assertEquals(0, q.remainingCapacity());
876		}
877
878		/**
879		* timed offerFirst times out if full and elements not taken
880		*/
881	<	public void testTimedOfferFirst() {
881	>	public void testTimedOfferFirst() throws InterruptedException {
882		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
883	<	Thread t = new Thread(new Runnable() {
884	<	public void run() {
885	<	try {
886	<	q.putFirst(new Object());
887	<	q.putFirst(new Object());
888	<	threadAssertFalse(q.offerFirst(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
889	<	q.offerFirst(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
890	<	threadShouldThrow();
891	<	} catch (InterruptedException success){}
892	<	}
893	<	});
883	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
884	>	Thread t = newStartedThread(new CheckedRunnable() {
885	>	public void realRun() throws InterruptedException {
886	>	q.putFirst(new Object());
887	>	q.putFirst(new Object());
888	>	long startTime = System.nanoTime();
889	>	assertFalse(q.offerFirst(new Object(), timeoutMillis(), MILLISECONDS));
890	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
891	>	pleaseInterrupt.countDown();
892	>	try {
893	>	q.offerFirst(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
894	>	shouldThrow();
895	>	} catch (InterruptedException success) {}
896	>	}});
897	>
898	>	await(pleaseInterrupt);
899	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
900	>	t.interrupt();
901	>	awaitTermination(t);
902	>	}
903
904	<	try {
905	<	t.start();
906	<	Thread.sleep(SMALL_DELAY_MS);
907	<	t.interrupt();
908	<	t.join();
909	<	} catch (Exception e){
910	<	unexpectedException();
904	>	/**
905	>	* take retrieves elements in FIFO order
906	>	*/
907	>	public void testTakeFirst() throws InterruptedException {
908	>	LinkedBlockingDeque q = populatedDeque(SIZE);
909	>	for (int i = 0; i < SIZE; ++i) {
910	>	assertEquals(i, q.takeFirst());
911		}
912		}
913
914		/**
915	<	* take retrieves elements in FIFO order
915	>	* takeFirst() blocks interruptibly when empty
916		*/
917	<	public void testTakeFirst() {
918	<	try {
919	<	LinkedBlockingDeque q = populatedDeque(SIZE);
920	<	for (int i = 0; i < SIZE; ++i) {
921	<	assertEquals(i, ((Integer)q.takeFirst()).intValue());
922	<	}
923	<	} catch (InterruptedException e){
924	<	unexpectedException();
925	<	}
917	>	public void testTakeFirstFromEmptyBlocksInterruptibly() {
918	>	final BlockingDeque q = new LinkedBlockingDeque();
919	>	final CountDownLatch threadStarted = new CountDownLatch(1);
920	>	Thread t = newStartedThread(new CheckedRunnable() {
921	>	public void realRun() {
922	>	threadStarted.countDown();
923	>	try {
924	>	q.takeFirst();
925	>	shouldThrow();
926	>	} catch (InterruptedException success) {}
927	>	assertFalse(Thread.interrupted());
928	>	}});
929	>
930	>	await(threadStarted);
931	>	assertThreadBlocks(t, Thread.State.WAITING);
932	>	t.interrupt();
933	>	awaitTermination(t);
934		}
935
936		/**
937	<	* takeFirst blocks interruptibly when empty
937	>	* takeFirst() throws InterruptedException immediately if interrupted
938	>	* before waiting
939	>	*/
940	>	public void testTakeFirstFromEmptyAfterInterrupt() {
941	>	final BlockingDeque q = new LinkedBlockingDeque();
942	>	Thread t = newStartedThread(new CheckedRunnable() {
943	>	public void realRun() {
944	>	Thread.currentThread().interrupt();
945	>	try {
946	>	q.takeFirst();
947	>	shouldThrow();
948	>	} catch (InterruptedException success) {}
949	>	assertFalse(Thread.interrupted());
950	>	}});
951	>
952	>	awaitTermination(t);
953	>	}
954	>
955	>	/**
956	>	* takeLast() blocks interruptibly when empty
957		*/
958	<	public void testTakeFirstFromEmpty() {
959	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
960	<	Thread t = new Thread(new Runnable() {
961	<	public void run() {
962	<	try {
963	<	q.takeFirst();
964	<	threadShouldThrow();
965	<	} catch (InterruptedException success){ }
966	<	}
967	<	});
968	<	try {
969	<	t.start();
970	<	Thread.sleep(SHORT_DELAY_MS);
971	<	t.interrupt();
972	<	t.join();
973	<	} catch (Exception e){
974	<	unexpectedException();
1007	<	}
958	>	public void testTakeLastFromEmptyBlocksInterruptibly() {
959	>	final BlockingDeque q = new LinkedBlockingDeque();
960	>	final CountDownLatch threadStarted = new CountDownLatch(1);
961	>	Thread t = newStartedThread(new CheckedRunnable() {
962	>	public void realRun() {
963	>	threadStarted.countDown();
964	>	try {
965	>	q.takeLast();
966	>	shouldThrow();
967	>	} catch (InterruptedException success) {}
968	>	assertFalse(Thread.interrupted());
969	>	}});
970	>
971	>	await(threadStarted);
972	>	assertThreadBlocks(t, Thread.State.WAITING);
973	>	t.interrupt();
974	>	awaitTermination(t);
975		}
976
977		/**
978	<	* TakeFirst removes existing elements until empty, then blocks interruptibly
979	<	*/
980	<	public void testBlockingTakeFirst() {
981	<	Thread t = new Thread(new Runnable() {
982	<	public void run() {
983	<	try {
984	<	LinkedBlockingDeque q = populatedDeque(SIZE);
985	<	for (int i = 0; i < SIZE; ++i) {
986	<	assertEquals(i, ((Integer)q.takeFirst()).intValue());
987	<	}
988	<	q.takeFirst();
989	<	threadShouldThrow();
990	<	} catch (InterruptedException success){
991	<	}
992	<	}});
993	<	t.start();
1027	<	try {
1028	<	Thread.sleep(SHORT_DELAY_MS);
1029	<	t.interrupt();
1030	<	t.join();
1031	<	}
1032	<	catch (InterruptedException ie) {
1033	<	unexpectedException();
1034	<	}
978	>	* takeLast() throws InterruptedException immediately if interrupted
979	>	* before waiting
980	>	*/
981	>	public void testTakeLastFromEmptyAfterInterrupt() {
982	>	final BlockingDeque q = new LinkedBlockingDeque();
983	>	Thread t = newStartedThread(new CheckedRunnable() {
984	>	public void realRun() {
985	>	Thread.currentThread().interrupt();
986	>	try {
987	>	q.takeLast();
988	>	shouldThrow();
989	>	} catch (InterruptedException success) {}
990	>	assertFalse(Thread.interrupted());
991	>	}});
992	>
993	>	awaitTermination(t);
994		}
995
996	+	/**
997	+	* takeFirst removes existing elements until empty, then blocks interruptibly
998	+	*/
999	+	public void testBlockingTakeFirst() throws InterruptedException {
1000	+	final LinkedBlockingDeque q = populatedDeque(SIZE);
1001	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1002	+	Thread t = newStartedThread(new CheckedRunnable() {
1003	+	public void realRun() throws InterruptedException {
1004	+	for (int i = 0; i < SIZE; i++) assertEquals(i, q.takeFirst());
1005	+
1006	+	Thread.currentThread().interrupt();
1007	+	try {
1008	+	q.takeFirst();
1009	+	shouldThrow();
1010	+	} catch (InterruptedException success) {}
1011	+	assertFalse(Thread.interrupted());
1012	+
1013	+	pleaseInterrupt.countDown();
1014	+	try {
1015	+	q.takeFirst();
1016	+	shouldThrow();
1017	+	} catch (InterruptedException success) {}
1018	+	assertFalse(Thread.interrupted());
1019	+	}});
1020	+
1021	+	await(pleaseInterrupt);
1022	+	assertThreadBlocks(t, Thread.State.WAITING);
1023	+	t.interrupt();
1024	+	awaitTermination(t);
1025	+	}
1026
1027		/**
1028		* timed pollFirst with zero timeout succeeds when non-empty, else times out
1029		*/
1030	<	public void testTimedPollFirst0() {
1031	<	try {
1032	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1033	<	for (int i = 0; i < SIZE; ++i) {
1034	<	assertEquals(i, ((Integer)q.pollFirst(0, TimeUnit.MILLISECONDS)).intValue());
1035	<	}
1047	<	assertNull(q.pollFirst(0, TimeUnit.MILLISECONDS));
1048	<	} catch (InterruptedException e){
1049	<	unexpectedException();
1050	<	}
1030	>	public void testTimedPollFirst0() throws InterruptedException {
1031	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1032	>	for (int i = 0; i < SIZE; ++i) {
1033	>	assertEquals(i, q.pollFirst(0, MILLISECONDS));
1034	>	}
1035	>	assertNull(q.pollFirst(0, MILLISECONDS));
1036		}
1037
1038		/**
1039		* timed pollFirst with nonzero timeout succeeds when non-empty, else times out
1040		*/
1041	<	public void testTimedPollFirst() {
1042	<	try {
1043	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1044	<	for (int i = 0; i < SIZE; ++i) {
1045	<	assertEquals(i, ((Integer)q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1046	<	}
1047	<	assertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1048	<	} catch (InterruptedException e){
1049	<	unexpectedException();
1050	<	}
1041	>	public void testTimedPollFirst() throws InterruptedException {
1042	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1043	>	for (int i = 0; i < SIZE; ++i) {
1044	>	long startTime = System.nanoTime();
1045	>	assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1046	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1047	>	}
1048	>	long startTime = System.nanoTime();
1049	>	assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS));
1050	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1051	>	checkEmpty(q);
1052		}
1053
1054		/**
1055		* Interrupted timed pollFirst throws InterruptedException instead of
1056		* returning timeout status
1057		*/
1058	<	public void testInterruptedTimedPollFirst() {
1059	<	Thread t = new Thread(new Runnable() {
1060	<	public void run() {
1061	<	try {
1062	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1063	<	for (int i = 0; i < SIZE; ++i) {
1064	<	threadAssertEquals(i, ((Integer)q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1065	<	}
1066	<	threadAssertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1067	<	} catch (InterruptedException success){
1068	<	}
1069	<	}});
1070	<	t.start();
1071	<	try {
1072	<	Thread.sleep(SHORT_DELAY_MS);
1073	<	t.interrupt();
1074	<	t.join();
1075	<	}
1076	<	catch (InterruptedException ie) {
1077	<	unexpectedException();
1078	<	}
1058	>	public void testInterruptedTimedPollFirst() throws InterruptedException {
1059	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1060	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1061	>	Thread t = newStartedThread(new CheckedRunnable() {
1062	>	public void realRun() throws InterruptedException {
1063	>	long startTime = System.nanoTime();
1064	>	for (int i = 0; i < SIZE; ++i) {
1065	>	assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1066	>	}
1067	>
1068	>	Thread.currentThread().interrupt();
1069	>	try {
1070	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1071	>	shouldThrow();
1072	>	} catch (InterruptedException success) {}
1073	>	assertFalse(Thread.interrupted());
1074	>
1075	>	pleaseInterrupt.countDown();
1076	>	try {
1077	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1078	>	shouldThrow();
1079	>	} catch (InterruptedException success) {}
1080	>	assertFalse(Thread.interrupted());
1081	>
1082	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1083	>	}});
1084	>
1085	>	await(pleaseInterrupt);
1086	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1087	>	t.interrupt();
1088	>	awaitTermination(t);
1089		}
1090
1091		/**
1092	<	*  timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
1093	<	*  on interruption throws
1092	>	* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
1093	>	* on interruption throws
1094		*/
1095	<	public void testTimedPollFirstWithOfferFirst() {
1095	>	public void testTimedPollFirstWithOfferFirst() throws InterruptedException {
1096		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1097	<	Thread t = new Thread(new Runnable() {
1098	<	public void run() {
1099	<	try {
1100	<	threadAssertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1101	<	q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1102	<	q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1103	<	threadShouldThrow();
1104	<	} catch (InterruptedException success) { }
1105	<	}
1106	<	});
1107	<	try {
1108	<	t.start();
1109	<	Thread.sleep(SMALL_DELAY_MS);
1110	<	assertTrue(q.offerFirst(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1111	<	t.interrupt();
1112	<	t.join();
1113	<	} catch (Exception e){
1114	<	unexpectedException();
1115	<	}
1097	>	final CheckedBarrier barrier = new CheckedBarrier(2);
1098	>	Thread t = newStartedThread(new CheckedRunnable() {
1099	>	public void realRun() throws InterruptedException {
1100	>	long startTime = System.nanoTime();
1101	>	assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS));
1102	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1103	>
1104	>	barrier.await();
1105	>
1106	>	assertSame(zero, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1107	>
1108	>	Thread.currentThread().interrupt();
1109	>	try {
1110	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1111	>	shouldThrow();
1112	>	} catch (InterruptedException success) {}
1113	>
1114	>	barrier.await();
1115	>	try {
1116	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1117	>	shouldThrow();
1118	>	} catch (InterruptedException success) {}
1119	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1120	>	}});
1121	>
1122	>	barrier.await();
1123	>	long startTime = System.nanoTime();
1124	>	assertTrue(q.offerFirst(zero, LONG_DELAY_MS, MILLISECONDS));
1125	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1126	>	barrier.await();
1127	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1128	>	t.interrupt();
1129	>	awaitTermination(t);
1130		}
1131
1132		/**
1133		* putLast(null) throws NPE
1134		*/
1135	<	public void testPutLastNull() {
1136	<	try {
1137	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1135	>	public void testPutLastNull() throws InterruptedException {
1136	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1137	>	try {
1138		q.putLast(null);
1139		shouldThrow();
1140	<	}
1141	<	catch (NullPointerException success){
1132	<	}
1133	<	catch (InterruptedException ie) {
1134	<	unexpectedException();
1135	<	}
1136	<	}
1140	>	} catch (NullPointerException success) {}
1141	>	}
1142
1143		/**
1144		* all elements successfully putLast are contained
1145		*/
1146	<	public void testPutLast() {
1147	<	try {
1148	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1149	<	for (int i = 0; i < SIZE; ++i) {
1150	<	Integer I = new Integer(i);
1151	<	q.putLast(I);
1147	<	assertTrue(q.contains(I));
1148	<	}
1149	<	assertEquals(0, q.remainingCapacity());
1150	<	}
1151	<	catch (InterruptedException ie) {
1152	<	unexpectedException();
1146	>	public void testPutLast() throws InterruptedException {
1147	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1148	>	for (int i = 0; i < SIZE; ++i) {
1149	>	Integer x = new Integer(i);
1150	>	q.putLast(x);
1151	>	assertTrue(q.contains(x));
1152		}
1153	+	assertEquals(0, q.remainingCapacity());
1154		}
1155
1156		/**
1157		* putLast blocks interruptibly if full
1158		*/
1159	<	public void testBlockingPutLast() {
1160	<	Thread t = new Thread(new Runnable() {
1161	<	public void run() {
1162	<	int added = 0;
1163	<	try {
1164	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1165	<	for (int i = 0; i < SIZE; ++i) {
1166	<	q.putLast(new Integer(i));
1167	<	++added;
1168	<	}
1169	<	q.putLast(new Integer(SIZE));
1170	<	threadShouldThrow();
1171	<	} catch (InterruptedException ie){
1172	<	threadAssertEquals(added, SIZE);
1173	<	}
1174	<	}});
1175	<	t.start();
1176	<	try {
1177	<	Thread.sleep(SHORT_DELAY_MS);
1178	<	t.interrupt();
1179	<	t.join();
1180	<	}
1181	<	catch (InterruptedException ie) {
1182	<	unexpectedException();
1183	<	}
1159	>	public void testBlockingPutLast() throws InterruptedException {
1160	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1161	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1162	>	Thread t = newStartedThread(new CheckedRunnable() {
1163	>	public void realRun() throws InterruptedException {
1164	>	for (int i = 0; i < SIZE; ++i)
1165	>	q.putLast(i);
1166	>	assertEquals(SIZE, q.size());
1167	>	assertEquals(0, q.remainingCapacity());
1168	>
1169	>	Thread.currentThread().interrupt();
1170	>	try {
1171	>	q.putLast(99);
1172	>	shouldThrow();
1173	>	} catch (InterruptedException success) {}
1174	>	assertFalse(Thread.interrupted());
1175	>
1176	>	pleaseInterrupt.countDown();
1177	>	try {
1178	>	q.putLast(99);
1179	>	shouldThrow();
1180	>	} catch (InterruptedException success) {}
1181	>	assertFalse(Thread.interrupted());
1182	>	}});
1183	>
1184	>	await(pleaseInterrupt);
1185	>	assertThreadBlocks(t, Thread.State.WAITING);
1186	>	t.interrupt();
1187	>	awaitTermination(t);
1188	>	assertEquals(SIZE, q.size());
1189	>	assertEquals(0, q.remainingCapacity());
1190		}
1191
1192		/**
1193	<	* putLast blocks waiting for take when full
1193	>	* putLast blocks interruptibly waiting for take when full
1194		*/
1195	<	public void testPutLastWithTake() {
1196	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1197	<	Thread t = new Thread(new Runnable() {
1198	<	public void run() {
1199	<	int added = 0;
1200	<	try {
1201	<	q.putLast(new Object());
1202	<	++added;
1203	<	q.putLast(new Object());
1204	<	++added;
1205	<	q.putLast(new Object());
1206	<	++added;
1207	<	q.putLast(new Object());
1208	<	++added;
1209	<	threadShouldThrow();
1210	<	} catch (InterruptedException e){
1211	<	threadAssertTrue(added >= 2);
1212	<	}
1213	<	}
1214	<	});
1215	<	try {
1216	<	t.start();
1217	<	Thread.sleep(SHORT_DELAY_MS);
1218	<	q.take();
1219	<	t.interrupt();
1220	<	t.join();
1221	<	} catch (Exception e){
1222	<	unexpectedException();
1223	<	}
1195	>	public void testPutLastWithTake() throws InterruptedException {
1196	>	final int capacity = 2;
1197	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity);
1198	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
1199	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1200	>	Thread t = newStartedThread(new CheckedRunnable() {
1201	>	public void realRun() throws InterruptedException {
1202	>	for (int i = 0; i < capacity; i++)
1203	>	q.putLast(i);
1204	>	pleaseTake.countDown();
1205	>	q.putLast(86);
1206	>
1207	>	pleaseInterrupt.countDown();
1208	>	try {
1209	>	q.putLast(99);
1210	>	shouldThrow();
1211	>	} catch (InterruptedException success) {}
1212	>	assertFalse(Thread.interrupted());
1213	>	}});
1214	>
1215	>	await(pleaseTake);
1216	>	assertEquals(0, q.remainingCapacity());
1217	>	assertEquals(0, q.take());
1218	>
1219	>	await(pleaseInterrupt);
1220	>	assertThreadBlocks(t, Thread.State.WAITING);
1221	>	t.interrupt();
1222	>	awaitTermination(t);
1223	>	assertEquals(0, q.remainingCapacity());
1224		}
1225
1226		/**
1227		* timed offerLast times out if full and elements not taken
1228		*/
1229	<	public void testTimedOfferLast() {
1229	>	public void testTimedOfferLast() throws InterruptedException {
1230		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1231	<	Thread t = new Thread(new Runnable() {
1232	<	public void run() {
1233	<	try {
1234	<	q.putLast(new Object());
1235	<	q.putLast(new Object());
1236	<	threadAssertFalse(q.offerLast(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1237	<	q.offerLast(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1238	<	threadShouldThrow();
1239	<	} catch (InterruptedException success){}
1240	<	}
1241	<	});
1242	<
1243	<	try {
1244	<	t.start();
1245	<	Thread.sleep(SMALL_DELAY_MS);
1246	<	t.interrupt();
1247	<	t.join();
1248	<	} catch (Exception e){
1249	<	unexpectedException();
1244	<	}
1231	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1232	>	Thread t = newStartedThread(new CheckedRunnable() {
1233	>	public void realRun() throws InterruptedException {
1234	>	q.putLast(new Object());
1235	>	q.putLast(new Object());
1236	>	long startTime = System.nanoTime();
1237	>	assertFalse(q.offerLast(new Object(), timeoutMillis(), MILLISECONDS));
1238	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1239	>	pleaseInterrupt.countDown();
1240	>	try {
1241	>	q.offerLast(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
1242	>	shouldThrow();
1243	>	} catch (InterruptedException success) {}
1244	>	}});
1245	>
1246	>	await(pleaseInterrupt);
1247	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1248	>	t.interrupt();
1249	>	awaitTermination(t);
1250		}
1251
1252		/**
1253		* takeLast retrieves elements in FIFO order
1254		*/
1255	<	public void testTakeLast() {
1256	<	try {
1257	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1258	<	for (int i = 0; i < SIZE; ++i) {
1259	<	assertEquals(SIZE-i-1, ((Integer)q.takeLast()).intValue());
1255	<	}
1256	<	} catch (InterruptedException e){
1257	<	unexpectedException();
1258	<	}
1255	>	public void testTakeLast() throws InterruptedException {
1256	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1257	>	for (int i = 0; i < SIZE; ++i) {
1258	>	assertEquals(SIZE - i - 1, q.takeLast());
1259	>	}
1260		}
1261
1262		/**
1263	<	* takeLast blocks interruptibly when empty
1263	>	* takeLast removes existing elements until empty, then blocks interruptibly
1264		*/
1265	<	public void testTakeLastFromEmpty() {
1266	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1267	<	Thread t = new Thread(new Runnable() {
1268	<	public void run() {
1269	<	try {
1270	<	q.takeLast();
1271	<	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	<	}
1265	>	public void testBlockingTakeLast() throws InterruptedException {
1266	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1267	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1268	>	Thread t = newStartedThread(new CheckedRunnable() {
1269	>	public void realRun() throws InterruptedException {
1270	>	for (int i = 0; i < SIZE; i++)
1271	>	assertEquals(SIZE - i - 1, q.takeLast());
1272
1273	<	/**
1274	<	* TakeLast removes existing elements until empty, then blocks interruptibly
1275	<	*/
1276	<	public void testBlockingTakeLast() {
1277	<	Thread t = new Thread(new Runnable() {
1278	<	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	<	}
1273	>	Thread.currentThread().interrupt();
1274	>	try {
1275	>	q.takeLast();
1276	>	shouldThrow();
1277	>	} catch (InterruptedException success) {}
1278	>	assertFalse(Thread.interrupted());
1279
1280	+	pleaseInterrupt.countDown();
1281	+	try {
1282	+	q.takeLast();
1283	+	shouldThrow();
1284	+	} catch (InterruptedException success) {}
1285	+	assertFalse(Thread.interrupted());
1286	+	}});
1287	+
1288	+	await(pleaseInterrupt);
1289	+	assertThreadBlocks(t, Thread.State.WAITING);
1290	+	t.interrupt();
1291	+	awaitTermination(t);
1292	+	}
1293
1294		/**
1295		* timed pollLast with zero timeout succeeds when non-empty, else times out
1296		*/
1297	<	public void testTimedPollLast0() {
1298	<	try {
1299	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1300	<	for (int i = 0; i < SIZE; ++i) {
1301	<	assertEquals(SIZE-i-1, ((Integer)q.pollLast(0, TimeUnit.MILLISECONDS)).intValue());
1302	<	}
1321	<	assertNull(q.pollLast(0, TimeUnit.MILLISECONDS));
1322	<	} catch (InterruptedException e){
1323	<	unexpectedException();
1324	<	}
1297	>	public void testTimedPollLast0() throws InterruptedException {
1298	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1299	>	for (int i = 0; i < SIZE; ++i) {
1300	>	assertEquals(SIZE - i - 1, q.pollLast(0, MILLISECONDS));
1301	>	}
1302	>	assertNull(q.pollLast(0, MILLISECONDS));
1303		}
1304
1305		/**
1306		* timed pollLast with nonzero timeout succeeds when non-empty, else times out
1307		*/
1308	<	public void testTimedPollLast() {
1309	<	try {
1310	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1311	<	for (int i = 0; i < SIZE; ++i) {
1312	<	assertEquals(SIZE-i-1, ((Integer)q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1313	<	}
1314	<	assertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1315	<	} catch (InterruptedException e){
1316	<	unexpectedException();
1317	<	}
1308	>	public void testTimedPollLast() throws InterruptedException {
1309	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1310	>	for (int i = 0; i < SIZE; ++i) {
1311	>	long startTime = System.nanoTime();
1312	>	assertEquals(SIZE - i - 1, q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1313	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1314	>	}
1315	>	long startTime = System.nanoTime();
1316	>	assertNull(q.pollLast(timeoutMillis(), MILLISECONDS));
1317	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1318	>	checkEmpty(q);
1319		}
1320
1321		/**
1322		* Interrupted timed pollLast throws InterruptedException instead of
1323		* returning timeout status
1324		*/
1325	<	public void testInterruptedTimedPollLast() {
1326	<	Thread t = new Thread(new Runnable() {
1327	<	public void run() {
1328	<	try {
1329	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1330	<	for (int i = 0; i < SIZE; ++i) {
1331	<	threadAssertEquals(SIZE-i-1, ((Integer)q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1332	<	}
1333	<	threadAssertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1334	<	} catch (InterruptedException success){
1335	<	}
1336	<	}});
1337	<	t.start();
1338	<	try {
1339	<	Thread.sleep(SHORT_DELAY_MS);
1340	<	t.interrupt();
1341	<	t.join();
1342	<	}
1343	<	catch (InterruptedException ie) {
1344	<	unexpectedException();
1345	<	}
1325	>	public void testInterruptedTimedPollLast() throws InterruptedException {
1326	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1327	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1328	>	Thread t = newStartedThread(new CheckedRunnable() {
1329	>	public void realRun() throws InterruptedException {
1330	>	long startTime = System.nanoTime();
1331	>	for (int i = 0; i < SIZE; ++i) {
1332	>	assertEquals(SIZE - i - 1,
1333	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1334	>	}
1335	>
1336	>	Thread.currentThread().interrupt();
1337	>	try {
1338	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS);
1339	>	shouldThrow();
1340	>	} catch (InterruptedException success) {}
1341	>	assertFalse(Thread.interrupted());
1342	>
1343	>	pleaseInterrupt.countDown();
1344	>	try {
1345	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS);
1346	>	shouldThrow();
1347	>	} catch (InterruptedException success) {}
1348	>	assertFalse(Thread.interrupted());
1349	>
1350	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1351	>	}});
1352	>
1353	>	await(pleaseInterrupt);
1354	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1355	>	t.interrupt();
1356	>	awaitTermination(t);
1357	>	checkEmpty(q);
1358		}
1359
1360		/**
1361	<	*  timed poll before a delayed offerLast fails; after offerLast succeeds;
1362	<	*  on interruption throws
1361	>	* timed poll before a delayed offerLast fails; after offerLast succeeds;
1362	>	* on interruption throws
1363		*/
1364	<	public void testTimedPollWithOfferLast() {
1364	>	public void testTimedPollWithOfferLast() throws InterruptedException {
1365		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1366	<	Thread t = new Thread(new Runnable() {
1367	<	public void run() {
1368	<	try {
1369	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1370	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1371	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1381	<	threadShouldThrow();
1382	<	} 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	<	}
1366	>	final CheckedBarrier barrier = new CheckedBarrier(2);
1367	>	Thread t = newStartedThread(new CheckedRunnable() {
1368	>	public void realRun() throws InterruptedException {
1369	>	long startTime = System.nanoTime();
1370	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
1371	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1372
1373	+	barrier.await();
1374	+
1375	+	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
1376	+
1377	+	Thread.currentThread().interrupt();
1378	+	try {
1379	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
1380	+	shouldThrow();
1381	+	} catch (InterruptedException success) {}
1382	+	assertFalse(Thread.interrupted());
1383	+
1384	+	barrier.await();
1385	+	try {
1386	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
1387	+	shouldThrow();
1388	+	} catch (InterruptedException success) {}
1389	+	assertFalse(Thread.interrupted());
1390	+
1391	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1392	+	}});
1393	+
1394	+	barrier.await();
1395	+	long startTime = System.nanoTime();
1396	+	assertTrue(q.offerLast(zero, LONG_DELAY_MS, MILLISECONDS));
1397	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1398	+
1399	+	barrier.await();
1400	+	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
1401	+	t.interrupt();
1402	+	awaitTermination(t);
1403	+	}
1404
1405		/**
1406		* element returns next element, or throws NSEE if empty
#	Line 1400 | Line 1408 | public class LinkedBlockingDequeTest ext
1408		public void testElement() {
1409		LinkedBlockingDeque q = populatedDeque(SIZE);
1410		for (int i = 0; i < SIZE; ++i) {
1411	<	assertEquals(i, ((Integer)q.element()).intValue());
1411	>	assertEquals(i, q.element());
1412		q.poll();
1413		}
1414		try {
1415		q.element();
1416		shouldThrow();
1417	<	}
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());
1417	>	} catch (NoSuchElementException success) {}
1418		}
1419
1420		/**
#	Line 1481 | Line 1473 | public class LinkedBlockingDequeTest ext
1473		assertTrue(changed);
1474
1475		assertTrue(q.containsAll(p));
1476	<	assertEquals(SIZE-i, q.size());
1476	>	assertEquals(SIZE - i, q.size());
1477		p.remove();
1478		}
1479		}
#	Line 1494 | Line 1486 | public class LinkedBlockingDequeTest ext
1486		LinkedBlockingDeque q = populatedDeque(SIZE);
1487		LinkedBlockingDeque p = populatedDeque(i);
1488		assertTrue(q.removeAll(p));
1489	<	assertEquals(SIZE-i, q.size());
1489	>	assertEquals(SIZE - i, q.size());
1490		for (int j = 0; j < i; ++j) {
1491	<	Integer I = (Integer)(p.remove());
1492	<	assertFalse(q.contains(I));
1491	>	Integer x = (Integer)(p.remove());
1492	>	assertFalse(q.contains(x));
1493		}
1494		}
1495		}
1496
1497		/**
1498	<	* toArray contains all elements
1498	>	* toArray contains all elements in FIFO order
1499		*/
1500	<	public void testToArray() {
1500	>	public void testToArray() throws InterruptedException {
1501		LinkedBlockingDeque q = populatedDeque(SIZE);
1502	<	Object[] o = q.toArray();
1503	<	try {
1504	<	for(int i = 0; i < o.length; i++)
1513	<	assertEquals(o[i], q.take());
1514	<	} catch (InterruptedException e){
1515	<	unexpectedException();
1516	<	}
1502	>	Object[] o = q.toArray();
1503	>	for (int i = 0; i < o.length; i++)
1504	>	assertSame(o[i], q.poll());
1505		}
1506
1507		/**
1508	<	* toArray(a) contains all elements
1508	>	* toArray(a) contains all elements in FIFO order
1509		*/
1510		public void testToArray2() {
1511	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1512	<	Integer[] ints = new Integer[SIZE];
1513	<	ints = (Integer[])q.toArray(ints);
1514	<	try {
1515	<	for(int i = 0; i < ints.length; i++)
1516	<	assertEquals(ints[i], q.take());
1529	<	} catch (InterruptedException e){
1530	<	unexpectedException();
1531	<	}
1511	>	LinkedBlockingDeque<Integer> q = populatedDeque(SIZE);
1512	>	Integer[] ints = new Integer[SIZE];
1513	>	Integer[] array = q.toArray(ints);
1514	>	assertSame(ints, array);
1515	>	for (int i = 0; i < ints.length; i++)
1516	>	assertSame(ints[i], q.remove());
1517		}
1518
1519		/**
1520	<	* toArray(null) throws NPE
1520	>	* toArray(incompatible array type) throws ArrayStoreException
1521		*/
1522	<	public void testToArray_BadArg() {
1523	<	try {
1524	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1525	<	Object o[] = q.toArray(null);
1526	<	shouldThrow();
1527	<	} catch(NullPointerException success){}
1522	>	public void testToArray1_BadArg() {
1523	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1524	>	try {
1525	>	q.toArray(new String[10]);
1526	>	shouldThrow();
1527	>	} catch (ArrayStoreException success) {}
1528		}
1529
1530		/**
1531	<	* toArray with incompatible array type throws CCE
1531	>	* iterator iterates through all elements
1532		*/
1533	<	public void testToArray1_BadArg() {
1534	<	try {
1535	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1536	<	Object o[] = q.toArray(new String[10] );
1537	<	shouldThrow();
1538	<	} catch(ArrayStoreException  success){}
1539	<	}
1533	>	public void testIterator() throws InterruptedException {
1534	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1535	>	Iterator it = q.iterator();
1536	>	int i;
1537	>	for (i = 0; it.hasNext(); i++)
1538	>	assertTrue(q.contains(it.next()));
1539	>	assertEquals(i, SIZE);
1540	>	assertIteratorExhausted(it);
1541
1542	+	it = q.iterator();
1543	+	for (i = 0; it.hasNext(); i++)
1544	+	assertEquals(it.next(), q.take());
1545	+	assertEquals(i, SIZE);
1546	+	assertIteratorExhausted(it);
1547	+	}
1548
1549		/**
1550	<	* iterator iterates through all elements
1550	>	* iterator of empty collection has no elements
1551		*/
1552	<	public void testIterator() {
1553	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1554	<	Iterator it = q.iterator();
1555	<	try {
1564	<	while(it.hasNext()){
1565	<	assertEquals(it.next(), q.take());
1566	<	}
1567	<	} catch (InterruptedException e){
1568	<	unexpectedException();
1569	<	}
1552	>	public void testEmptyIterator() {
1553	>	Deque c = new LinkedBlockingDeque();
1554	>	assertIteratorExhausted(c.iterator());
1555	>	assertIteratorExhausted(c.descendingIterator());
1556		}
1557
1558		/**
1559		* iterator.remove removes current element
1560		*/
1561	<	public void testIteratorRemove () {
1561	>	public void testIteratorRemove() {
1562		final LinkedBlockingDeque q = new LinkedBlockingDeque(3);
1563		q.add(two);
1564		q.add(one);
#	Line 1583 | Line 1569 | public class LinkedBlockingDequeTest ext
1569		it.remove();
1570
1571		it = q.iterator();
1572	<	assertEquals(it.next(), one);
1573	<	assertEquals(it.next(), three);
1572	>	assertSame(it.next(), one);
1573	>	assertSame(it.next(), three);
1574		assertFalse(it.hasNext());
1575		}
1576
1591	–
1577		/**
1578		* iterator ordering is FIFO
1579		*/
#	Line 1600 | Line 1585 | public class LinkedBlockingDequeTest ext
1585		assertEquals(0, q.remainingCapacity());
1586		int k = 0;
1587		for (Iterator it = q.iterator(); it.hasNext();) {
1588	<	int i = ((Integer)(it.next())).intValue();
1604	<	assertEquals(++k, i);
1588	>	assertEquals(++k, it.next());
1589		}
1590		assertEquals(3, k);
1591		}
#	Line 1609 | Line 1593 | public class LinkedBlockingDequeTest ext
1593		/**
1594		* Modifications do not cause iterators to fail
1595		*/
1596	<	public void testWeaklyConsistentIteration () {
1596	>	public void testWeaklyConsistentIteration() {
1597		final LinkedBlockingDeque q = new LinkedBlockingDeque(3);
1598		q.add(one);
1599		q.add(two);
1600		q.add(three);
1601	<	try {
1602	<	for (Iterator it = q.iterator(); it.hasNext();) {
1603	<	q.remove();
1620	<	it.next();
1621	<	}
1622	<	}
1623	<	catch (ConcurrentModificationException e) {
1624	<	unexpectedException();
1601	>	for (Iterator it = q.iterator(); it.hasNext();) {
1602	>	q.remove();
1603	>	it.next();
1604		}
1605		assertEquals(0, q.size());
1606		}
1607
1629	–
1608		/**
1609	<	*  Descending iterator iterates through all elements
1609	>	* Descending iterator iterates through all elements
1610		*/
1611		public void testDescendingIterator() {
1612		LinkedBlockingDeque q = populatedDeque(SIZE);
1613		int i = 0;
1614	<	Iterator it = q.descendingIterator();
1615	<	while(it.hasNext()) {
1614	>	Iterator it = q.descendingIterator();
1615	>	while (it.hasNext()) {
1616		assertTrue(q.contains(it.next()));
1617		++i;
1618		}
#	Line 1642 | Line 1620 | public class LinkedBlockingDequeTest ext
1620		assertFalse(it.hasNext());
1621		try {
1622		it.next();
1623	<	} catch(NoSuchElementException success) {
1624	<	}
1623	>	shouldThrow();
1624	>	} catch (NoSuchElementException success) {}
1625		}
1626
1627		/**
1628	<	*  Descending iterator ordering is reverse FIFO
1628	>	* Descending iterator ordering is reverse FIFO
1629		*/
1630		public void testDescendingIteratorOrdering() {
1631		final LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 1657 | Line 1635 | public class LinkedBlockingDequeTest ext
1635		q.add(new Integer(1));
1636		int k = 0;
1637		for (Iterator it = q.descendingIterator(); it.hasNext();) {
1638	<	int i = ((Integer)(it.next())).intValue();
1661	<	assertEquals(++k, i);
1638	>	assertEquals(++k, it.next());
1639		}
1640
1641		assertEquals(3, k);
#	Line 1671 | Line 1648 | public class LinkedBlockingDequeTest ext
1648		/**
1649		* descendingIterator.remove removes current element
1650		*/
1651	<	public void testDescendingIteratorRemove () {
1651	>	public void testDescendingIteratorRemove() {
1652		final LinkedBlockingDeque q = new LinkedBlockingDeque();
1653		for (int iters = 0; iters < 100; ++iters) {
1654		q.add(new Integer(3));
#	Line 1690 | Line 1667 | public class LinkedBlockingDequeTest ext
1667		}
1668		}
1669
1693	–
1670		/**
1671		* toString contains toStrings of elements
1672		*/
#	Line 1698 | Line 1674 | public class LinkedBlockingDequeTest ext
1674		LinkedBlockingDeque q = populatedDeque(SIZE);
1675		String s = q.toString();
1676		for (int i = 0; i < SIZE; ++i) {
1677	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
1677	>	assertTrue(s.contains(String.valueOf(i)));
1678		}
1679		}
1680
1705	–
1681		/**
1682		* offer transfers elements across Executor tasks
1683		*/
#	Line 1710 | Line 1685 | public class LinkedBlockingDequeTest ext
1685		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1686		q.add(one);
1687		q.add(two);
1688	<	ExecutorService executor = Executors.newFixedThreadPool(2);
1689	<	executor.execute(new Runnable() {
1690	<	public void run() {
1691	<	threadAssertFalse(q.offer(three));
1692	<	try {
1693	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
1694	<	threadAssertEquals(0, q.remainingCapacity());
1695	<	}
1696	<	catch (InterruptedException e) {
1697	<	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	<	});
1688	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
1689	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
1690	>	try (PoolCleaner cleaner = cleaner(executor)) {
1691	>	executor.execute(new CheckedRunnable() {
1692	>	public void realRun() throws InterruptedException {
1693	>	assertFalse(q.offer(three));
1694	>	threadsStarted.await();
1695	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
1696	>	assertEquals(0, q.remainingCapacity());
1697	>	}});
1698
1699	<	joinPool(executor);
1699	>	executor.execute(new CheckedRunnable() {
1700	>	public void realRun() throws InterruptedException {
1701	>	threadsStarted.await();
1702	>	assertSame(one, q.take());
1703	>	}});
1704	>	}
1705		}
1706
1707		/**
1708	<	* poll retrieves elements across Executor threads
1708	>	* timed poll retrieves elements across Executor threads
1709		*/
1710		public void testPollInExecutor() {
1711		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1712	<	ExecutorService executor = Executors.newFixedThreadPool(2);
1713	<	executor.execute(new Runnable() {
1714	<	public void run() {
1715	<	threadAssertNull(q.poll());
1716	<	try {
1717	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
1718	<	threadAssertTrue(q.isEmpty());
1719	<	}
1720	<	catch (InterruptedException e) {
1721	<	threadUnexpectedException();
1757	<	}
1758	<	}
1759	<	});
1712	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
1713	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
1714	>	try (PoolCleaner cleaner = cleaner(executor)) {
1715	>	executor.execute(new CheckedRunnable() {
1716	>	public void realRun() throws InterruptedException {
1717	>	assertNull(q.poll());
1718	>	threadsStarted.await();
1719	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
1720	>	checkEmpty(q);
1721	>	}});
1722
1723	<	executor.execute(new Runnable() {
1724	<	public void run() {
1725	<	try {
1764	<	Thread.sleep(SMALL_DELAY_MS);
1723	>	executor.execute(new CheckedRunnable() {
1724	>	public void realRun() throws InterruptedException {
1725	>	threadsStarted.await();
1726		q.put(one);
1727	<	}
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) {
1727	>	}});
1728		}
1729		}
1730
1731		/**
1732	<	* drainTo(this) throws IAE
1732	>	* A deserialized serialized deque has same elements in same order
1733		*/
1734	<	public void testDrainToSelf() {
1735	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1736	<	try {
1737	<	q.drainTo(q);
1738	<	shouldThrow();
1739	<	} catch(IllegalArgumentException success) {
1734	>	public void testSerialization() throws Exception {
1735	>	Queue x = populatedDeque(SIZE);
1736	>	Queue y = serialClone(x);
1737	>
1738	>	assertNotSame(y, x);
1739	>	assertEquals(x.size(), y.size());
1740	>	assertEquals(x.toString(), y.toString());
1741	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
1742	>	while (!x.isEmpty()) {
1743	>	assertFalse(y.isEmpty());
1744	>	assertEquals(x.remove(), y.remove());
1745		}
1746	+	assertTrue(y.isEmpty());
1747		}
1748
1749		/**
#	Line 1827 | Line 1753 | public class LinkedBlockingDequeTest ext
1753		LinkedBlockingDeque q = populatedDeque(SIZE);
1754		ArrayList l = new ArrayList();
1755		q.drainTo(l);
1756	<	assertEquals(q.size(), 0);
1757	<	assertEquals(l.size(), SIZE);
1756	>	assertEquals(0, q.size());
1757	>	assertEquals(SIZE, l.size());
1758		for (int i = 0; i < SIZE; ++i)
1759		assertEquals(l.get(i), new Integer(i));
1760		q.add(zero);
#	Line 1838 | Line 1764 | public class LinkedBlockingDequeTest ext
1764		assertTrue(q.contains(one));
1765		l.clear();
1766		q.drainTo(l);
1767	<	assertEquals(q.size(), 0);
1768	<	assertEquals(l.size(), 2);
1767	>	assertEquals(0, q.size());
1768	>	assertEquals(2, l.size());
1769		for (int i = 0; i < 2; ++i)
1770		assertEquals(l.get(i), new Integer(i));
1771		}
#	Line 1847 | Line 1773 | public class LinkedBlockingDequeTest ext
1773		/**
1774		* drainTo empties full deque, unblocking a waiting put.
1775		*/
1776	<	public void testDrainToWithActivePut() {
1776	>	public void testDrainToWithActivePut() throws InterruptedException {
1777		final LinkedBlockingDeque q = populatedDeque(SIZE);
1778	<	Thread t = new Thread(new Runnable() {
1779	<	public void run() {
1780	<	try {
1781	<	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	<	}
1778	>	Thread t = new Thread(new CheckedRunnable() {
1779	>	public void realRun() throws InterruptedException {
1780	>	q.put(new Integer(SIZE + 1));
1781	>	}});
1782
1783	<	/**
1784	<	* drainTo(null, n) throws NPE
1785	<	*/
1786	<	public void testDrainToNullN() {
1787	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1788	<	try {
1789	<	q.drainTo(null, 0);
1790	<	shouldThrow();
1883	<	} catch(NullPointerException success) {
1884	<	}
1885	<	}
1886	<
1887	<	/**
1888	<	* drainTo(this, n) throws IAE
1889	<	*/
1890	<	public void testDrainToSelfN() {
1891	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1892	<	try {
1893	<	q.drainTo(q, 0);
1894	<	shouldThrow();
1895	<	} catch(IllegalArgumentException success) {
1896	<	}
1783	>	t.start();
1784	>	ArrayList l = new ArrayList();
1785	>	q.drainTo(l);
1786	>	assertTrue(l.size() >= SIZE);
1787	>	for (int i = 0; i < SIZE; ++i)
1788	>	assertEquals(l.get(i), new Integer(i));
1789	>	t.join();
1790	>	assertTrue(q.size() + l.size() >= SIZE);
1791		}
1792
1793		/**
1794	<	* drainTo(c, n) empties first max {n, size} elements of deque into c
1794	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
1795		*/
1796		public void testDrainToN() {
1797		LinkedBlockingDeque q = new LinkedBlockingDeque();
1798		for (int i = 0; i < SIZE + 2; ++i) {
1799	<	for(int j = 0; j < SIZE; j++)
1799	>	for (int j = 0; j < SIZE; j++)
1800		assertTrue(q.offer(new Integer(j)));
1801		ArrayList l = new ArrayList();
1802		q.drainTo(l, i);
1803	<	int k = (i < SIZE)? i : SIZE;
1804	<	assertEquals(l.size(), k);
1805	<	assertEquals(q.size(), SIZE-k);
1803	>	int k = (i < SIZE) ? i : SIZE;
1804	>	assertEquals(k, l.size());
1805	>	assertEquals(SIZE - k, q.size());
1806		for (int j = 0; j < k; ++j)
1807		assertEquals(l.get(j), new Integer(j));
1808	<	while (q.poll() != null) ;
1808	>	do {} while (q.poll() != null);
1809	>	}
1810	>	}
1811	>
1812	>	/**
1813	>	* remove(null), contains(null) always return false
1814	>	*/
1815	>	public void testNeverContainsNull() {
1816	>	Deque<?>[] qs = {
1817	>	new LinkedBlockingDeque<Object>(),
1818	>	populatedDeque(2),
1819	>	};
1820	>
1821	>	for (Deque<?> q : qs) {
1822	>	assertFalse(q.contains(null));
1823	>	assertFalse(q.remove(null));
1824	>	assertFalse(q.removeFirstOccurrence(null));
1825	>	assertFalse(q.removeLastOccurrence(null));
1826		}
1827		}
1828

Diff Legend

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