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

Diff Legend

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