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.3 by dl, Fri Sep 16 11:16:03 2005 UTC vs.
Revision 1.66 by jsr166, Mon Oct 17 01:31:30 2016 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 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) {
74	<	}
112	>	} catch (NullPointerException success) {}
113		}
114
115		/**
116	<	* OfferFirst succeeds
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	>	/**
127	>	* OfferFirst succeeds
128		*/
129		public void testOfferFirst() {
130		LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 84 | Line 133 | public class LinkedBlockingDequeTest ext
133		}
134
135		/**
136	<	* OfferLast succeeds
136	>	* OfferLast succeeds
137		*/
138		public void testOfferLast() {
139		LinkedBlockingDeque q = new LinkedBlockingDeque();
#	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());
322	<	}
320	>	q.addFirst(four);
321	>	assertSame(four, q.peekFirst());
322	>	}
323
324		/**
325		* peekLast returns element inserted with addLast
#	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());
332	<	}
271	<
330	>	q.addLast(four);
331	>	assertSame(four, q.peekLast());
332	>	}
333
334		/**
335		* A new deque has the indicated capacity, or Integer.MAX_VALUE if
#	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());
469	<	}
436	<
467	>	q.push(four);
468	>	assertSame(four, q.peekFirst());
469	>	}
470
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	>	assertThreadStaysAlive(t);
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	>	assertThreadStaysAlive(t);
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	>	assertThreadStaysAlive(t);
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();
693	<	threadShouldThrow();
711	<	} catch (InterruptedException success){ }
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) {
693	>	assertEquals(i, q.take());
694		}
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	–	}
695
696	<	/**
697	<	* Take removes existing elements until empty, then blocks interruptibly
698	<	*/
699	<	public void testBlockingTake() {
700	<	Thread t = new Thread(new Runnable() {
701	<	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	<	}
696	>	Thread.currentThread().interrupt();
697	>	try {
698	>	q.take();
699	>	shouldThrow();
700	>	} catch (InterruptedException success) {}
701	>	assertFalse(Thread.interrupted());
702
703	+	pleaseInterrupt.countDown();
704	+	try {
705	+	q.take();
706	+	shouldThrow();
707	+	} catch (InterruptedException success) {}
708	+	assertFalse(Thread.interrupted());
709	+	}});
710	+
711	+	await(pleaseInterrupt);
712	+	assertThreadStaysAlive(t);
713	+	t.interrupt();
714	+	awaitTermination(t);
715	+	}
716
717		/**
718		* poll succeeds unless empty
#	Line 755 | Line 720 | public class LinkedBlockingDequeTest ext
720		public void testPoll() {
721		LinkedBlockingDeque q = populatedDeque(SIZE);
722		for (int i = 0; i < SIZE; ++i) {
723	<	assertEquals(i, ((Integer)q.poll()).intValue());
723	>	assertEquals(i, q.poll());
724		}
725	<	assertNull(q.poll());
725	>	assertNull(q.poll());
726		}
727
728		/**
729		* timed poll with zero timeout succeeds when non-empty, else times out
730		*/
731	<	public void testTimedPoll0() {
732	<	try {
733	<	LinkedBlockingDeque q = populatedDeque(SIZE);
734	<	for (int i = 0; i < SIZE; ++i) {
735	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
736	<	}
772	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
773	<	} catch (InterruptedException e){
774	<	unexpectedException();
775	<	}
731	>	public void testTimedPoll0() throws InterruptedException {
732	>	LinkedBlockingDeque q = populatedDeque(SIZE);
733	>	for (int i = 0; i < SIZE; ++i) {
734	>	assertEquals(i, q.poll(0, MILLISECONDS));
735	>	}
736	>	assertNull(q.poll(0, MILLISECONDS));
737		}
738
739		/**
740		* timed poll with nonzero timeout succeeds when non-empty, else times out
741		*/
742	<	public void testTimedPoll() {
743	<	try {
744	<	LinkedBlockingDeque q = populatedDeque(SIZE);
745	<	for (int i = 0; i < SIZE; ++i) {
746	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
747	<	}
748	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
749	<	} catch (InterruptedException e){
750	<	unexpectedException();
751	<	}
742	>	public void testTimedPoll() throws InterruptedException {
743	>	LinkedBlockingDeque q = populatedDeque(SIZE);
744	>	for (int i = 0; i < SIZE; ++i) {
745	>	long startTime = System.nanoTime();
746	>	assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
747	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
748	>	}
749	>	long startTime = System.nanoTime();
750	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
751	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
752	>	checkEmpty(q);
753		}
754
755		/**
756		* Interrupted timed poll throws InterruptedException instead of
757		* returning timeout status
758		*/
759	<	public void testInterruptedTimedPoll() {
760	<	Thread t = new Thread(new Runnable() {
761	<	public void run() {
762	<	try {
763	<	LinkedBlockingDeque q = populatedDeque(SIZE);
764	<	for (int i = 0; i < SIZE; ++i) {
765	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
766	<	}
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) { }
759	>	public void testInterruptedTimedPoll() throws InterruptedException {
760	>	final BlockingQueue<Integer> q = populatedDeque(SIZE);
761	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
762	>	Thread t = newStartedThread(new CheckedRunnable() {
763	>	public void realRun() throws InterruptedException {
764	>	long startTime = System.nanoTime();
765	>	for (int i = 0; i < SIZE; ++i) {
766	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
767		}
768	<	});
769	<	try {
770	<	t.start();
771	<	Thread.sleep(SMALL_DELAY_MS);
772	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
773	<	t.interrupt();
774	<	t.join();
775	<	} catch (Exception e){
776	<	unexpectedException();
777	<	}
778	<	}
779	<
768	>	aboutToWait.countDown();
769	>	try {
770	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
771	>	shouldThrow();
772	>	} catch (InterruptedException success) {
773	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
774	>	}
775	>	}});
776	>
777	>	aboutToWait.await();
778	>	waitForThreadToEnterWaitState(t);
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	>	assertThreadStaysAlive(t);
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	>	assertThreadStaysAlive(t);
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	<	});
894	<
895	<	try {
896	<	t.start();
897	<	Thread.sleep(SMALL_DELAY_MS);
898	<	t.interrupt();
899	<	t.join();
900	<	} catch (Exception e){
901	<	unexpectedException();
970	<	}
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	>	assertThreadStaysAlive(t);
900	>	t.interrupt();
901	>	awaitTermination(t);
902		}
903
904		/**
905		* take retrieves elements in FIFO order
906		*/
907	<	public void testTakeFirst() {
908	<	try {
909	<	LinkedBlockingDeque q = populatedDeque(SIZE);
910	<	for (int i = 0; i < SIZE; ++i) {
911	<	assertEquals(i, ((Integer)q.takeFirst()).intValue());
981	<	}
982	<	} catch (InterruptedException e){
983	<	unexpectedException();
984	<	}
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	<	* takeFirst blocks interruptibly when empty
915	>	* takeFirst() blocks interruptibly when empty
916		*/
917	<	public void testTakeFirstFromEmpty() {
918	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
919	<	Thread t = new Thread(new Runnable() {
920	<	public void run() {
921	<	try {
922	<	q.takeFirst();
923	<	threadShouldThrow();
924	<	} catch (InterruptedException success){ }
925	<	}
926	<	});
927	<	try {
928	<	t.start();
929	<	Thread.sleep(SHORT_DELAY_MS);
930	<	t.interrupt();
931	<	t.join();
932	<	} catch (Exception e){
933	<	unexpectedException();
1007	<	}
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	>	assertThreadStaysAlive(t);
932	>	t.interrupt();
933	>	awaitTermination(t);
934		}
935
936		/**
937	<	* TakeFirst removes existing elements until empty, then blocks interruptibly
938	<	*/
939	<	public void testBlockingTakeFirst() {
940	<	Thread t = new Thread(new Runnable() {
941	<	public void run() {
942	<	try {
943	<	LinkedBlockingDeque q = populatedDeque(SIZE);
944	<	for (int i = 0; i < SIZE; ++i) {
945	<	assertEquals(i, ((Integer)q.takeFirst()).intValue());
946	<	}
947	<	q.takeFirst();
948	<	threadShouldThrow();
949	<	} catch (InterruptedException success){
950	<	}
951	<	}});
952	<	t.start();
953	<	try {
954	<	Thread.sleep(SHORT_DELAY_MS);
955	<	t.interrupt();
956	<	t.join();
957	<	}
958	<	catch (InterruptedException ie) {
959	<	unexpectedException();
960	<	}
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 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	>	assertThreadStaysAlive(t);
973	>	t.interrupt();
974	>	awaitTermination(t);
975		}
976
977	+	/**
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) {
1005	+	assertEquals(i, q.takeFirst());
1006	+	}
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	+	assertThreadStaysAlive(t);
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) {
1036	<	assertEquals(i, ((Integer)q.pollFirst(0, TimeUnit.MILLISECONDS)).intValue());
1037	<	}
1047	<	assertNull(q.pollFirst(0, TimeUnit.MILLISECONDS));
1048	<	} catch (InterruptedException e){
1049	<	unexpectedException();
1050	<	}
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	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1084	>	}});
1085	>
1086	>	await(pleaseInterrupt);
1087	>	assertThreadStaysAlive(t);
1088	>	t.interrupt();
1089	>	awaitTermination(t);
1090		}
1091
1092		/**
1093	<	*  timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
1094	<	*  on interruption throws
1093	>	* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds;
1094	>	* on interruption throws
1095		*/
1096	<	public void testTimedPollFirstWithOfferFirst() {
1096	>	public void testTimedPollFirstWithOfferFirst() throws InterruptedException {
1097		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1098	<	Thread t = new Thread(new Runnable() {
1099	<	public void run() {
1100	<	try {
1101	<	threadAssertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1102	<	q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1103	<	q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1104	<	threadShouldThrow();
1105	<	} catch (InterruptedException success) { }
1106	<	}
1107	<	});
1108	<	try {
1109	<	t.start();
1110	<	Thread.sleep(SMALL_DELAY_MS);
1111	<	assertTrue(q.offerFirst(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1112	<	t.interrupt();
1113	<	t.join();
1114	<	} catch (Exception e){
1115	<	unexpectedException();
1116	<	}
1117	<	}
1098	>	final CheckedBarrier barrier = new CheckedBarrier(2);
1099	>	Thread t = newStartedThread(new CheckedRunnable() {
1100	>	public void realRun() throws InterruptedException {
1101	>	long startTime = System.nanoTime();
1102	>	assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS));
1103	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1104	>
1105	>	barrier.await();
1106	>
1107	>	assertSame(zero, q.pollFirst(LONG_DELAY_MS, MILLISECONDS));
1108	>
1109	>	Thread.currentThread().interrupt();
1110	>	try {
1111	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1112	>	shouldThrow();
1113	>	} catch (InterruptedException success) {}
1114	>
1115	>	barrier.await();
1116	>	try {
1117	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1118	>	shouldThrow();
1119	>	} catch (InterruptedException success) {}
1120	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1121	>	}});
1122	>
1123	>	barrier.await();
1124	>	long startTime = System.nanoTime();
1125	>	assertTrue(q.offerFirst(zero, LONG_DELAY_MS, MILLISECONDS));
1126	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1127	>	barrier.await();
1128	>	assertThreadStaysAlive(t);
1129	>	t.interrupt();
1130	>	awaitTermination(t);
1131	>	}
1132
1133		/**
1134		* putLast(null) throws NPE
1135		*/
1136	<	public void testPutLastNull() {
1137	<	try {
1138	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1136	>	public void testPutLastNull() throws InterruptedException {
1137	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1138	>	try {
1139		q.putLast(null);
1140		shouldThrow();
1141	<	}
1142	<	catch (NullPointerException success){
1132	<	}
1133	<	catch (InterruptedException ie) {
1134	<	unexpectedException();
1135	<	}
1136	<	}
1141	>	} catch (NullPointerException success) {}
1142	>	}
1143
1144		/**
1145		* all elements successfully putLast are contained
1146		*/
1147	<	public void testPutLast() {
1148	<	try {
1149	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1150	<	for (int i = 0; i < SIZE; ++i) {
1151	<	Integer I = new Integer(i);
1152	<	q.putLast(I);
1147	<	assertTrue(q.contains(I));
1148	<	}
1149	<	assertEquals(0, q.remainingCapacity());
1150	<	}
1151	<	catch (InterruptedException ie) {
1152	<	unexpectedException();
1147	>	public void testPutLast() throws InterruptedException {
1148	>	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1149	>	for (int i = 0; i < SIZE; ++i) {
1150	>	Integer x = new Integer(i);
1151	>	q.putLast(x);
1152	>	assertTrue(q.contains(x));
1153		}
1154	+	assertEquals(0, q.remainingCapacity());
1155		}
1156
1157		/**
1158		* putLast blocks interruptibly if full
1159		*/
1160	<	public void testBlockingPutLast() {
1161	<	Thread t = new Thread(new Runnable() {
1162	<	public void run() {
1163	<	int added = 0;
1164	<	try {
1165	<	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1166	<	for (int i = 0; i < SIZE; ++i) {
1167	<	q.putLast(new Integer(i));
1168	<	++added;
1169	<	}
1170	<	q.putLast(new Integer(SIZE));
1171	<	threadShouldThrow();
1172	<	} catch (InterruptedException ie){
1173	<	threadAssertEquals(added, SIZE);
1174	<	}
1175	<	}});
1176	<	t.start();
1177	<	try {
1178	<	Thread.sleep(SHORT_DELAY_MS);
1179	<	t.interrupt();
1180	<	t.join();
1181	<	}
1182	<	catch (InterruptedException ie) {
1183	<	unexpectedException();
1184	<	}
1160	>	public void testBlockingPutLast() throws InterruptedException {
1161	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1162	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1163	>	Thread t = newStartedThread(new CheckedRunnable() {
1164	>	public void realRun() throws InterruptedException {
1165	>	for (int i = 0; i < SIZE; ++i)
1166	>	q.putLast(i);
1167	>	assertEquals(SIZE, q.size());
1168	>	assertEquals(0, q.remainingCapacity());
1169	>
1170	>	Thread.currentThread().interrupt();
1171	>	try {
1172	>	q.putLast(99);
1173	>	shouldThrow();
1174	>	} catch (InterruptedException success) {}
1175	>	assertFalse(Thread.interrupted());
1176	>
1177	>	pleaseInterrupt.countDown();
1178	>	try {
1179	>	q.putLast(99);
1180	>	shouldThrow();
1181	>	} catch (InterruptedException success) {}
1182	>	assertFalse(Thread.interrupted());
1183	>	}});
1184	>
1185	>	await(pleaseInterrupt);
1186	>	assertThreadStaysAlive(t);
1187	>	t.interrupt();
1188	>	awaitTermination(t);
1189	>	assertEquals(SIZE, q.size());
1190	>	assertEquals(0, q.remainingCapacity());
1191		}
1192
1193		/**
1194	<	* putLast blocks waiting for take when full
1194	>	* putLast blocks interruptibly waiting for take when full
1195		*/
1196	<	public void testPutLastWithTake() {
1197	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1198	<	Thread t = new Thread(new Runnable() {
1199	<	public void run() {
1200	<	int added = 0;
1201	<	try {
1202	<	q.putLast(new Object());
1203	<	++added;
1204	<	q.putLast(new Object());
1205	<	++added;
1206	<	q.putLast(new Object());
1207	<	++added;
1208	<	q.putLast(new Object());
1209	<	++added;
1210	<	threadShouldThrow();
1211	<	} catch (InterruptedException e){
1212	<	threadAssertTrue(added >= 2);
1213	<	}
1214	<	}
1215	<	});
1216	<	try {
1217	<	t.start();
1218	<	Thread.sleep(SHORT_DELAY_MS);
1219	<	q.take();
1220	<	t.interrupt();
1221	<	t.join();
1222	<	} catch (Exception e){
1223	<	unexpectedException();
1224	<	}
1196	>	public void testPutLastWithTake() throws InterruptedException {
1197	>	final int capacity = 2;
1198	>	final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity);
1199	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
1200	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1201	>	Thread t = newStartedThread(new CheckedRunnable() {
1202	>	public void realRun() throws InterruptedException {
1203	>	for (int i = 0; i < capacity; i++)
1204	>	q.putLast(i);
1205	>	pleaseTake.countDown();
1206	>	q.putLast(86);
1207	>
1208	>	pleaseInterrupt.countDown();
1209	>	try {
1210	>	q.putLast(99);
1211	>	shouldThrow();
1212	>	} catch (InterruptedException success) {}
1213	>	assertFalse(Thread.interrupted());
1214	>	}});
1215	>
1216	>	await(pleaseTake);
1217	>	assertEquals(0, q.remainingCapacity());
1218	>	assertEquals(0, q.take());
1219	>
1220	>	await(pleaseInterrupt);
1221	>	assertThreadStaysAlive(t);
1222	>	t.interrupt();
1223	>	awaitTermination(t);
1224	>	assertEquals(0, q.remainingCapacity());
1225		}
1226
1227		/**
1228		* timed offerLast times out if full and elements not taken
1229		*/
1230	<	public void testTimedOfferLast() {
1230	>	public void testTimedOfferLast() throws InterruptedException {
1231		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1232	<	Thread t = new Thread(new Runnable() {
1233	<	public void run() {
1234	<	try {
1235	<	q.putLast(new Object());
1236	<	q.putLast(new Object());
1237	<	threadAssertFalse(q.offerLast(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1238	<	q.offerLast(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1239	<	threadShouldThrow();
1240	<	} catch (InterruptedException success){}
1241	<	}
1242	<	});
1243	<
1244	<	try {
1245	<	t.start();
1246	<	Thread.sleep(SMALL_DELAY_MS);
1247	<	t.interrupt();
1248	<	t.join();
1249	<	} catch (Exception e){
1250	<	unexpectedException();
1244	<	}
1232	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1233	>	Thread t = newStartedThread(new CheckedRunnable() {
1234	>	public void realRun() throws InterruptedException {
1235	>	q.putLast(new Object());
1236	>	q.putLast(new Object());
1237	>	long startTime = System.nanoTime();
1238	>	assertFalse(q.offerLast(new Object(), timeoutMillis(), MILLISECONDS));
1239	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1240	>	pleaseInterrupt.countDown();
1241	>	try {
1242	>	q.offerLast(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
1243	>	shouldThrow();
1244	>	} catch (InterruptedException success) {}
1245	>	}});
1246	>
1247	>	await(pleaseInterrupt);
1248	>	assertThreadStaysAlive(t);
1249	>	t.interrupt();
1250	>	awaitTermination(t);
1251		}
1252
1253		/**
1254		* takeLast retrieves elements in FIFO order
1255		*/
1256	<	public void testTakeLast() {
1257	<	try {
1258	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1259	<	for (int i = 0; i < SIZE; ++i) {
1260	<	assertEquals(SIZE-i-1, ((Integer)q.takeLast()).intValue());
1255	<	}
1256	<	} catch (InterruptedException e){
1257	<	unexpectedException();
1258	<	}
1256	>	public void testTakeLast() throws InterruptedException {
1257	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1258	>	for (int i = 0; i < SIZE; ++i) {
1259	>	assertEquals(SIZE - i - 1, q.takeLast());
1260	>	}
1261		}
1262
1263		/**
1264	<	* takeLast blocks interruptibly when empty
1264	>	* takeLast removes existing elements until empty, then blocks interruptibly
1265		*/
1266	<	public void testTakeLastFromEmpty() {
1267	<	final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1268	<	Thread t = new Thread(new Runnable() {
1269	<	public void run() {
1270	<	try {
1271	<	q.takeLast();
1272	<	threadShouldThrow();
1271	<	} catch (InterruptedException success){ }
1266	>	public void testBlockingTakeLast() throws InterruptedException {
1267	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1268	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1269	>	Thread t = newStartedThread(new CheckedRunnable() {
1270	>	public void realRun() throws InterruptedException {
1271	>	for (int i = 0; i < SIZE; ++i) {
1272	>	assertEquals(SIZE - i - 1, q.takeLast());
1273		}
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	–	}
1274
1275	<	/**
1276	<	* TakeLast removes existing elements until empty, then blocks interruptibly
1277	<	*/
1278	<	public void testBlockingTakeLast() {
1279	<	Thread t = new Thread(new Runnable() {
1280	<	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	<	}
1275	>	Thread.currentThread().interrupt();
1276	>	try {
1277	>	q.takeLast();
1278	>	shouldThrow();
1279	>	} catch (InterruptedException success) {}
1280	>	assertFalse(Thread.interrupted());
1281
1282	+	pleaseInterrupt.countDown();
1283	+	try {
1284	+	q.takeLast();
1285	+	shouldThrow();
1286	+	} catch (InterruptedException success) {}
1287	+	assertFalse(Thread.interrupted());
1288	+	}});
1289	+
1290	+	await(pleaseInterrupt);
1291	+	assertThreadStaysAlive(t);
1292	+	t.interrupt();
1293	+	awaitTermination(t);
1294	+	}
1295
1296		/**
1297		* timed pollLast with zero timeout succeeds when non-empty, else times out
1298		*/
1299	<	public void testTimedPollLast0() {
1300	<	try {
1301	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1302	<	for (int i = 0; i < SIZE; ++i) {
1303	<	assertEquals(SIZE-i-1, ((Integer)q.pollLast(0, TimeUnit.MILLISECONDS)).intValue());
1304	<	}
1321	<	assertNull(q.pollLast(0, TimeUnit.MILLISECONDS));
1322	<	} catch (InterruptedException e){
1323	<	unexpectedException();
1324	<	}
1299	>	public void testTimedPollLast0() throws InterruptedException {
1300	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1301	>	for (int i = 0; i < SIZE; ++i) {
1302	>	assertEquals(SIZE - i - 1, q.pollLast(0, MILLISECONDS));
1303	>	}
1304	>	assertNull(q.pollLast(0, MILLISECONDS));
1305		}
1306
1307		/**
1308		* timed pollLast with nonzero timeout succeeds when non-empty, else times out
1309		*/
1310	<	public void testTimedPollLast() {
1311	<	try {
1312	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1313	<	for (int i = 0; i < SIZE; ++i) {
1314	<	assertEquals(SIZE-i-1, ((Integer)q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1315	<	}
1316	<	assertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1317	<	} catch (InterruptedException e){
1318	<	unexpectedException();
1319	<	}
1310	>	public void testTimedPollLast() throws InterruptedException {
1311	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1312	>	for (int i = 0; i < SIZE; ++i) {
1313	>	long startTime = System.nanoTime();
1314	>	assertEquals(SIZE - i - 1, q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1315	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1316	>	}
1317	>	long startTime = System.nanoTime();
1318	>	assertNull(q.pollLast(timeoutMillis(), MILLISECONDS));
1319	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1320	>	checkEmpty(q);
1321		}
1322
1323		/**
1324		* Interrupted timed pollLast throws InterruptedException instead of
1325		* returning timeout status
1326		*/
1327	<	public void testInterruptedTimedPollLast() {
1328	<	Thread t = new Thread(new Runnable() {
1329	<	public void run() {
1330	<	try {
1331	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1332	<	for (int i = 0; i < SIZE; ++i) {
1333	<	threadAssertEquals(SIZE-i-1, ((Integer)q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
1334	<	}
1335	<	threadAssertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1336	<	} catch (InterruptedException success){
1337	<	}
1338	<	}});
1339	<	t.start();
1340	<	try {
1341	<	Thread.sleep(SHORT_DELAY_MS);
1342	<	t.interrupt();
1343	<	t.join();
1344	<	}
1345	<	catch (InterruptedException ie) {
1346	<	unexpectedException();
1347	<	}
1327	>	public void testInterruptedTimedPollLast() throws InterruptedException {
1328	>	final LinkedBlockingDeque q = populatedDeque(SIZE);
1329	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
1330	>	Thread t = newStartedThread(new CheckedRunnable() {
1331	>	public void realRun() throws InterruptedException {
1332	>	long startTime = System.nanoTime();
1333	>	for (int i = 0; i < SIZE; ++i) {
1334	>	assertEquals(SIZE - i - 1,
1335	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1336	>	}
1337	>
1338	>	Thread.currentThread().interrupt();
1339	>	try {
1340	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS);
1341	>	shouldThrow();
1342	>	} catch (InterruptedException success) {}
1343	>	assertFalse(Thread.interrupted());
1344	>
1345	>	pleaseInterrupt.countDown();
1346	>	try {
1347	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS);
1348	>	shouldThrow();
1349	>	} catch (InterruptedException success) {}
1350	>	assertFalse(Thread.interrupted());
1351	>
1352	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1353	>	}});
1354	>
1355	>	await(pleaseInterrupt);
1356	>	assertThreadStaysAlive(t);
1357	>	t.interrupt();
1358	>	awaitTermination(t);
1359	>	checkEmpty(q);
1360		}
1361
1362		/**
1363	<	*  timed poll before a delayed offerLast fails; after offerLast succeeds;
1364	<	*  on interruption throws
1363	>	* timed poll before a delayed offerLast fails; after offerLast succeeds;
1364	>	* on interruption throws
1365		*/
1366	<	public void testTimedPollWithOfferLast() {
1366	>	public void testTimedPollWithOfferLast() throws InterruptedException {
1367		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1368	<	Thread t = new Thread(new Runnable() {
1369	<	public void run() {
1370	<	try {
1371	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1372	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1373	<	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	<	}
1368	>	final CheckedBarrier barrier = new CheckedBarrier(2);
1369	>	Thread t = newStartedThread(new CheckedRunnable() {
1370	>	public void realRun() throws InterruptedException {
1371	>	long startTime = System.nanoTime();
1372	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
1373	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1374
1375	+	barrier.await();
1376	+
1377	+	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
1378	+
1379	+	Thread.currentThread().interrupt();
1380	+	try {
1381	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
1382	+	shouldThrow();
1383	+	} catch (InterruptedException success) {}
1384	+	assertFalse(Thread.interrupted());
1385	+
1386	+	barrier.await();
1387	+	try {
1388	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
1389	+	shouldThrow();
1390	+	} catch (InterruptedException success) {}
1391	+	assertFalse(Thread.interrupted());
1392	+
1393	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1394	+	}});
1395	+
1396	+	barrier.await();
1397	+	long startTime = System.nanoTime();
1398	+	assertTrue(q.offerLast(zero, LONG_DELAY_MS, MILLISECONDS));
1399	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1400	+
1401	+	barrier.await();
1402	+	assertThreadStaysAlive(t);
1403	+	t.interrupt();
1404	+	awaitTermination(t);
1405	+	}
1406
1407		/**
1408		* element returns next element, or throws NSEE if empty
#	Line 1400 | Line 1410 | public class LinkedBlockingDequeTest ext
1410		public void testElement() {
1411		LinkedBlockingDeque q = populatedDeque(SIZE);
1412		for (int i = 0; i < SIZE; ++i) {
1413	<	assertEquals(i, ((Integer)q.element()).intValue());
1413	>	assertEquals(i, q.element());
1414		q.poll();
1415		}
1416		try {
1417		q.element();
1418		shouldThrow();
1419	<	}
1410	<	catch (NoSuchElementException success) {}
1419	>	} catch (NoSuchElementException success) {}
1420		}
1421
1422		/**
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());
1426	–	}
1427	–
1428	–	/**
1423		* contains(x) reports true when elements added but not yet removed
1424		*/
1425		public void testContains() {
#	Line 1481 | Line 1475 | public class LinkedBlockingDequeTest ext
1475		assertTrue(changed);
1476
1477		assertTrue(q.containsAll(p));
1478	<	assertEquals(SIZE-i, q.size());
1478	>	assertEquals(SIZE - i, q.size());
1479		p.remove();
1480		}
1481		}
#	Line 1494 | Line 1488 | public class LinkedBlockingDequeTest ext
1488		LinkedBlockingDeque q = populatedDeque(SIZE);
1489		LinkedBlockingDeque p = populatedDeque(i);
1490		assertTrue(q.removeAll(p));
1491	<	assertEquals(SIZE-i, q.size());
1491	>	assertEquals(SIZE - i, q.size());
1492		for (int j = 0; j < i; ++j) {
1493	<	Integer I = (Integer)(p.remove());
1494	<	assertFalse(q.contains(I));
1493	>	Integer x = (Integer)(p.remove());
1494	>	assertFalse(q.contains(x));
1495		}
1496		}
1497		}
1498
1499		/**
1500	<	* toArray contains all elements
1500	>	* toArray contains all elements in FIFO order
1501		*/
1502	<	public void testToArray() {
1502	>	public void testToArray() throws InterruptedException {
1503		LinkedBlockingDeque q = populatedDeque(SIZE);
1504	<	Object[] o = q.toArray();
1505	<	try {
1506	<	for(int i = 0; i < o.length; i++)
1513	<	assertEquals(o[i], q.take());
1514	<	} catch (InterruptedException e){
1515	<	unexpectedException();
1516	<	}
1504	>	Object[] o = q.toArray();
1505	>	for (int i = 0; i < o.length; i++)
1506	>	assertSame(o[i], q.poll());
1507		}
1508
1509		/**
1510	<	* toArray(a) contains all elements
1510	>	* toArray(a) contains all elements in FIFO order
1511		*/
1512		public void testToArray2() {
1513	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1514	<	Integer[] ints = new Integer[SIZE];
1515	<	ints = (Integer[])q.toArray(ints);
1516	<	try {
1517	<	for(int i = 0; i < ints.length; i++)
1518	<	assertEquals(ints[i], q.take());
1529	<	} catch (InterruptedException e){
1530	<	unexpectedException();
1531	<	}
1513	>	LinkedBlockingDeque<Integer> q = populatedDeque(SIZE);
1514	>	Integer[] ints = new Integer[SIZE];
1515	>	Integer[] array = q.toArray(ints);
1516	>	assertSame(ints, array);
1517	>	for (int i = 0; i < ints.length; i++)
1518	>	assertSame(ints[i], q.remove());
1519		}
1520
1521		/**
1522	<	* toArray(null) throws NPE
1522	>	* toArray(incompatible array type) throws ArrayStoreException
1523		*/
1524	<	public void testToArray_BadArg() {
1525	<	try {
1526	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1527	<	Object o[] = q.toArray(null);
1528	<	shouldThrow();
1529	<	} catch(NullPointerException success){}
1524	>	public void testToArray1_BadArg() {
1525	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1526	>	try {
1527	>	q.toArray(new String[10]);
1528	>	shouldThrow();
1529	>	} catch (ArrayStoreException success) {}
1530		}
1531
1532		/**
1533	<	* toArray with incompatible array type throws CCE
1533	>	* iterator iterates through all elements
1534		*/
1535	<	public void testToArray1_BadArg() {
1536	<	try {
1537	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1538	<	Object o[] = q.toArray(new String[10] );
1539	<	shouldThrow();
1540	<	} catch(ArrayStoreException  success){}
1535	>	public void testIterator() throws InterruptedException {
1536	>	LinkedBlockingDeque q = populatedDeque(SIZE);
1537	>	Iterator it = q.iterator();
1538	>	int i;
1539	>	for (i = 0; it.hasNext(); i++)
1540	>	assertTrue(q.contains(it.next()));
1541	>	assertEquals(i, SIZE);
1542	>	assertIteratorExhausted(it);
1543	>
1544	>	it = q.iterator();
1545	>	for (i = 0; it.hasNext(); i++)
1546	>	assertEquals(it.next(), q.take());
1547	>	assertEquals(i, SIZE);
1548	>	assertIteratorExhausted(it);
1549		}
1550
1556	–
1551		/**
1552	<	* iterator iterates through all elements
1552	>	* iterator of empty collection has no elements
1553		*/
1554	<	public void testIterator() {
1555	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1556	<	Iterator it = q.iterator();
1557	<	try {
1564	<	while(it.hasNext()){
1565	<	assertEquals(it.next(), q.take());
1566	<	}
1567	<	} catch (InterruptedException e){
1568	<	unexpectedException();
1569	<	}
1554	>	public void testEmptyIterator() {
1555	>	Deque c = new LinkedBlockingDeque();
1556	>	assertIteratorExhausted(c.iterator());
1557	>	assertIteratorExhausted(c.descendingIterator());
1558		}
1559
1560		/**
1561		* iterator.remove removes current element
1562		*/
1563	<	public void testIteratorRemove () {
1563	>	public void testIteratorRemove() {
1564		final LinkedBlockingDeque q = new LinkedBlockingDeque(3);
1565		q.add(two);
1566		q.add(one);
#	Line 1581 | Line 1569 | public class LinkedBlockingDequeTest ext
1569		Iterator it = q.iterator();
1570		it.next();
1571		it.remove();
1572	<
1572	>
1573		it = q.iterator();
1574	<	assertEquals(it.next(), one);
1575	<	assertEquals(it.next(), three);
1574	>	assertSame(it.next(), one);
1575	>	assertSame(it.next(), three);
1576		assertFalse(it.hasNext());
1577		}
1578
1591	–
1579		/**
1580		* iterator ordering is FIFO
1581		*/
#	Line 1600 | Line 1587 | public class LinkedBlockingDequeTest ext
1587		assertEquals(0, q.remainingCapacity());
1588		int k = 0;
1589		for (Iterator it = q.iterator(); it.hasNext();) {
1590	<	int i = ((Integer)(it.next())).intValue();
1604	<	assertEquals(++k, i);
1590	>	assertEquals(++k, it.next());
1591		}
1592		assertEquals(3, k);
1593		}
#	Line 1609 | Line 1595 | public class LinkedBlockingDequeTest ext
1595		/**
1596		* Modifications do not cause iterators to fail
1597		*/
1598	<	public void testWeaklyConsistentIteration () {
1598	>	public void testWeaklyConsistentIteration() {
1599		final LinkedBlockingDeque q = new LinkedBlockingDeque(3);
1600		q.add(one);
1601		q.add(two);
1602		q.add(three);
1603	<	try {
1604	<	for (Iterator it = q.iterator(); it.hasNext();) {
1605	<	q.remove();
1620	<	it.next();
1621	<	}
1622	<	}
1623	<	catch (ConcurrentModificationException e) {
1624	<	unexpectedException();
1603	>	for (Iterator it = q.iterator(); it.hasNext();) {
1604	>	q.remove();
1605	>	it.next();
1606		}
1607		assertEquals(0, q.size());
1608		}
1609
1629	–
1610		/**
1611	<	*  Descending iterator iterates through all elements
1611	>	* Descending iterator iterates through all elements
1612		*/
1613		public void testDescendingIterator() {
1614		LinkedBlockingDeque q = populatedDeque(SIZE);
1615		int i = 0;
1616	<	Iterator it = q.descendingIterator();
1617	<	while(it.hasNext()) {
1616	>	Iterator it = q.descendingIterator();
1617	>	while (it.hasNext()) {
1618		assertTrue(q.contains(it.next()));
1619		++i;
1620		}
#	Line 1642 | Line 1622 | public class LinkedBlockingDequeTest ext
1622		assertFalse(it.hasNext());
1623		try {
1624		it.next();
1625	<	} catch(NoSuchElementException success) {
1626	<	}
1625	>	shouldThrow();
1626	>	} catch (NoSuchElementException success) {}
1627		}
1628
1629		/**
1630	<	*  Descending iterator ordering is reverse FIFO
1630	>	* Descending iterator ordering is reverse FIFO
1631		*/
1632		public void testDescendingIteratorOrdering() {
1633		final LinkedBlockingDeque q = new LinkedBlockingDeque();
#	Line 1657 | Line 1637 | public class LinkedBlockingDequeTest ext
1637		q.add(new Integer(1));
1638		int k = 0;
1639		for (Iterator it = q.descendingIterator(); it.hasNext();) {
1640	<	int i = ((Integer)(it.next())).intValue();
1661	<	assertEquals(++k, i);
1640	>	assertEquals(++k, it.next());
1641		}
1642	<
1642	>
1643		assertEquals(3, k);
1644		q.remove();
1645		q.remove();
#	Line 1671 | Line 1650 | public class LinkedBlockingDequeTest ext
1650		/**
1651		* descendingIterator.remove removes current element
1652		*/
1653	<	public void testDescendingIteratorRemove () {
1653	>	public void testDescendingIteratorRemove() {
1654		final LinkedBlockingDeque q = new LinkedBlockingDeque();
1655		for (int iters = 0; iters < 100; ++iters) {
1656		q.add(new Integer(3));
#	Line 1690 | Line 1669 | public class LinkedBlockingDequeTest ext
1669		}
1670		}
1671
1693	–
1672		/**
1673		* toString contains toStrings of elements
1674		*/
#	Line 1698 | Line 1676 | public class LinkedBlockingDequeTest ext
1676		LinkedBlockingDeque q = populatedDeque(SIZE);
1677		String s = q.toString();
1678		for (int i = 0; i < SIZE; ++i) {
1679	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
1679	>	assertTrue(s.contains(String.valueOf(i)));
1680		}
1681	<	}
1704	<
1681	>	}
1682
1683		/**
1684		* offer transfers elements across Executor tasks
#	Line 1710 | Line 1687 | public class LinkedBlockingDequeTest ext
1687		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1688		q.add(one);
1689		q.add(two);
1690	<	ExecutorService executor = Executors.newFixedThreadPool(2);
1691	<	executor.execute(new Runnable() {
1692	<	public void run() {
1693	<	threadAssertFalse(q.offer(three));
1694	<	try {
1695	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
1696	<	threadAssertEquals(0, q.remainingCapacity());
1697	<	}
1698	<	catch (InterruptedException e) {
1699	<	threadUnexpectedException();
1723	<	}
1724	<	}
1725	<	});
1690	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
1691	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
1692	>	try (PoolCleaner cleaner = cleaner(executor)) {
1693	>	executor.execute(new CheckedRunnable() {
1694	>	public void realRun() throws InterruptedException {
1695	>	assertFalse(q.offer(three));
1696	>	threadsStarted.await();
1697	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
1698	>	assertEquals(0, q.remainingCapacity());
1699	>	}});
1700
1701	<	executor.execute(new Runnable() {
1702	<	public void run() {
1703	<	try {
1704	<	Thread.sleep(SMALL_DELAY_MS);
1705	<	threadAssertEquals(one, q.take());
1706	<	}
1733	<	catch (InterruptedException e) {
1734	<	threadUnexpectedException();
1735	<	}
1736	<	}
1737	<	});
1738	<
1739	<	joinPool(executor);
1701	>	executor.execute(new CheckedRunnable() {
1702	>	public void realRun() throws InterruptedException {
1703	>	threadsStarted.await();
1704	>	assertSame(one, q.take());
1705	>	}});
1706	>	}
1707		}
1708
1709		/**
1710	<	* poll retrieves elements across Executor threads
1710	>	* timed poll retrieves elements across Executor threads
1711		*/
1712		public void testPollInExecutor() {
1713		final LinkedBlockingDeque q = new LinkedBlockingDeque(2);
1714	<	ExecutorService executor = Executors.newFixedThreadPool(2);
1715	<	executor.execute(new Runnable() {
1716	<	public void run() {
1717	<	threadAssertNull(q.poll());
1718	<	try {
1719	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
1720	<	threadAssertTrue(q.isEmpty());
1721	<	}
1722	<	catch (InterruptedException e) {
1723	<	threadUnexpectedException();
1757	<	}
1758	<	}
1759	<	});
1714	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
1715	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
1716	>	try (PoolCleaner cleaner = cleaner(executor)) {
1717	>	executor.execute(new CheckedRunnable() {
1718	>	public void realRun() throws InterruptedException {
1719	>	assertNull(q.poll());
1720	>	threadsStarted.await();
1721	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
1722	>	checkEmpty(q);
1723	>	}});
1724
1725	<	executor.execute(new Runnable() {
1726	<	public void run() {
1727	<	try {
1764	<	Thread.sleep(SMALL_DELAY_MS);
1725	>	executor.execute(new CheckedRunnable() {
1726	>	public void realRun() throws InterruptedException {
1727	>	threadsStarted.await();
1728		q.put(one);
1729	<	}
1730	<	catch (InterruptedException e) {
1768	<	threadUnexpectedException();
1769	<	}
1770	<	}
1771	<	});
1772	<
1773	<	joinPool(executor);
1729	>	}});
1730	>	}
1731		}
1732
1733		/**
1734		* A deserialized serialized deque has same elements in same order
1735		*/
1736	<	public void testSerialization() {
1737	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1738	<
1739	<	try {
1740	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
1741	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
1742	<	out.writeObject(q);
1743	<	out.close();
1744	<
1745	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
1746	<	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) {
1808	<	}
1809	<	}
1810	<
1811	<	/**
1812	<	* drainTo(this) throws IAE
1813	<	*/
1814	<	public void testDrainToSelf() {
1815	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1816	<	try {
1817	<	q.drainTo(q);
1818	<	shouldThrow();
1819	<	} catch(IllegalArgumentException success) {
1736	>	public void testSerialization() throws Exception {
1737	>	Queue x = populatedDeque(SIZE);
1738	>	Queue y = serialClone(x);
1739	>
1740	>	assertNotSame(y, x);
1741	>	assertEquals(x.size(), y.size());
1742	>	assertEquals(x.toString(), y.toString());
1743	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
1744	>	while (!x.isEmpty()) {
1745	>	assertFalse(y.isEmpty());
1746	>	assertEquals(x.remove(), y.remove());
1747		}
1748	+	assertTrue(y.isEmpty());
1749		}
1750
1751		/**
1752		* drainTo(c) empties deque into another collection c
1753	<	*/
1753	>	*/
1754		public void testDrainTo() {
1755		LinkedBlockingDeque q = populatedDeque(SIZE);
1756		ArrayList l = new ArrayList();
1757		q.drainTo(l);
1758	<	assertEquals(q.size(), 0);
1759	<	assertEquals(l.size(), SIZE);
1760	<	for (int i = 0; i < SIZE; ++i)
1758	>	assertEquals(0, q.size());
1759	>	assertEquals(SIZE, l.size());
1760	>	for (int i = 0; i < SIZE; ++i)
1761		assertEquals(l.get(i), new Integer(i));
1762		q.add(zero);
1763		q.add(one);
#	Line 1838 | Line 1766 | public class LinkedBlockingDequeTest ext
1766		assertTrue(q.contains(one));
1767		l.clear();
1768		q.drainTo(l);
1769	<	assertEquals(q.size(), 0);
1770	<	assertEquals(l.size(), 2);
1771	<	for (int i = 0; i < 2; ++i)
1769	>	assertEquals(0, q.size());
1770	>	assertEquals(2, l.size());
1771	>	for (int i = 0; i < 2; ++i)
1772		assertEquals(l.get(i), new Integer(i));
1773		}
1774
1775		/**
1776		* drainTo empties full deque, unblocking a waiting put.
1777	<	*/
1778	<	public void testDrainToWithActivePut() {
1777	>	*/
1778	>	public void testDrainToWithActivePut() throws InterruptedException {
1779		final LinkedBlockingDeque q = populatedDeque(SIZE);
1780	<	Thread t = new Thread(new Runnable() {
1781	<	public void run() {
1782	<	try {
1783	<	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	<	}
1780	>	Thread t = new Thread(new CheckedRunnable() {
1781	>	public void realRun() throws InterruptedException {
1782	>	q.put(new Integer(SIZE + 1));
1783	>	}});
1784
1785	<	/**
1786	<	* drainTo(this, n) throws IAE
1787	<	*/
1788	<	public void testDrainToSelfN() {
1789	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1790	<	try {
1791	<	q.drainTo(q, 0);
1792	<	shouldThrow();
1895	<	} catch(IllegalArgumentException success) {
1896	<	}
1785	>	t.start();
1786	>	ArrayList l = new ArrayList();
1787	>	q.drainTo(l);
1788	>	assertTrue(l.size() >= SIZE);
1789	>	for (int i = 0; i < SIZE; ++i)
1790	>	assertEquals(l.get(i), new Integer(i));
1791	>	t.join();
1792	>	assertTrue(q.size() + l.size() >= SIZE);
1793		}
1794
1795		/**
1796	<	* drainTo(c, n) empties first max {n, size} elements of deque into c
1797	<	*/
1796	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
1797	>	*/
1798		public void testDrainToN() {
1799		LinkedBlockingDeque q = new LinkedBlockingDeque();
1800		for (int i = 0; i < SIZE + 2; ++i) {
1801	<	for(int j = 0; j < SIZE; j++)
1801	>	for (int j = 0; j < SIZE; j++)
1802		assertTrue(q.offer(new Integer(j)));
1803		ArrayList l = new ArrayList();
1804		q.drainTo(l, i);
1805	<	int k = (i < SIZE)? i : SIZE;
1806	<	assertEquals(l.size(), k);
1807	<	assertEquals(q.size(), SIZE-k);
1808	<	for (int j = 0; j < k; ++j)
1805	>	int k = (i < SIZE) ? i : SIZE;
1806	>	assertEquals(k, l.size());
1807	>	assertEquals(SIZE - k, q.size());
1808	>	for (int j = 0; j < k; ++j)
1809		assertEquals(l.get(j), new Integer(j));
1810	<	while (q.poll() != null) ;
1810	>	do {} while (q.poll() != null);
1811	>	}
1812	>	}
1813	>
1814	>	/**
1815	>	* remove(null), contains(null) always return false
1816	>	*/
1817	>	public void testNeverContainsNull() {
1818	>	Deque<?>[] qs = {
1819	>	new LinkedBlockingDeque<Object>(),
1820	>	populatedDeque(2),
1821	>	};
1822	>
1823	>	for (Deque<?> q : qs) {
1824	>	assertFalse(q.contains(null));
1825	>	assertFalse(q.remove(null));
1826	>	assertFalse(q.removeFirstOccurrence(null));
1827	>	assertFalse(q.removeLastOccurrence(null));
1828		}
1829		}
1830

Diff Legend

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