ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/LinkedBlockingQueueTest.java

Comparing jsr166/src/test/tck/LinkedBlockingQueueTest.java (file contents):
Revision 1.2 by dl, Sun Sep 7 20:39:11 2003 UTC vs.
Revision 1.76 by jsr166, Fri Aug 4 03:30:21 2017 UTC

#	Line 1 | Line 1
1		/*
2	<	* Written by members of JCP JSR-166 Expert Group and released to the
3	<	* public domain. Use, modify, and redistribute this code in any way
4	<	* without acknowledgement. Other contributors include Andrew Wright,
5	<	* Jeffrey Hayes, Pat Fischer, Mike Judd.
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/publicdomain/zero/1.0/
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9	<	import junit.framework.*;
10	<	import java.util.*;
11	<	import java.util.concurrent.*;
12	<	import java.io.*;
13	<
14	<	public class LinkedBlockingQueueTest extends TestCase {
15	<
16	<	private static int N = 10;
17	<	private static long SHORT_DELAY_MS = 100;
18	<	private static long MEDIUM_DELAY_MS = 1000;
19	<	private static long LONG_DELAY_MS = 10000;
9	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
10	>
11	>	import java.util.ArrayList;
12	>	import java.util.Arrays;
13	>	import java.util.Collection;
14	>	import java.util.Iterator;
15	>	import java.util.NoSuchElementException;
16	>	import java.util.Queue;
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.LinkedBlockingQueue;
22	>
23	>	import junit.framework.Test;
24	>
25	>	public class LinkedBlockingQueueTest extends JSR166TestCase {
26	>
27	>	public static class Unbounded extends BlockingQueueTest {
28	>	protected BlockingQueue emptyCollection() {
29	>	return new LinkedBlockingQueue();
30	>	}
31	>	}
32	>
33	>	public static class Bounded extends BlockingQueueTest {
34	>	protected BlockingQueue emptyCollection() {
35	>	return new LinkedBlockingQueue(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(LinkedBlockingQueueTest.class);
44	>	class Implementation implements CollectionImplementation {
45	>	public Class<?> klazz() { return LinkedBlockingQueue.class; }
46	>	public Collection emptyCollection() { return new LinkedBlockingQueue(); }
47	>	public Object makeElement(int i) { return i; }
48	>	public boolean isConcurrent() { return true; }
49	>	public boolean permitsNulls() { return false; }
50	>	}
51	>	return newTestSuite(LinkedBlockingQueueTest.class,
52	>	new Unbounded().testSuite(),
53	>	new Bounded().testSuite(),
54	>	CollectionTest.testSuite(new Implementation()));
55		}
56
57		/**
58	<	* Create a queue of given size containing consecutive
59	<	* Integers 0 ... n.
58	>	* Returns a new queue of given size containing consecutive
59	>	* Integers 0 ... n - 1.
60		*/
61	<	private LinkedBlockingQueue fullQueue(int n) {
62	<	LinkedBlockingQueue q = new LinkedBlockingQueue(n);
61	>	private static LinkedBlockingQueue<Integer> populatedQueue(int n) {
62	>	LinkedBlockingQueue<Integer> q =
63	>	new LinkedBlockingQueue<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.peek());
71		return q;
72		}
73	<
74	<	public void testConstructor1(){
75	<	assertEquals(N, new LinkedBlockingQueue(N).remainingCapacity());
73	>
74	>	/**
75	>	* A new queue has the indicated capacity, or Integer.MAX_VALUE if
76	>	* none given
77	>	*/
78	>	public void testConstructor1() {
79	>	assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity());
80	>	assertEquals(Integer.MAX_VALUE, new LinkedBlockingQueue().remainingCapacity());
81		}
82
83	<	public void testConstructor2(){
83	>	/**
84	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
85	>	*/
86	>	public void testConstructor2() {
87		try {
88	<	LinkedBlockingQueue q = new LinkedBlockingQueue(0);
89	<	fail("Cannot make zero-sized");
90	<	}
52	<	catch (IllegalArgumentException success) {}
88	>	new LinkedBlockingQueue(0);
89	>	shouldThrow();
90	>	} catch (IllegalArgumentException success) {}
91		}
92
93	<	public void testConstructor3(){
94	<
93	>	/**
94	>	* Initializing from null Collection throws NullPointerException
95	>	*/
96	>	public void testConstructor3() {
97		try {
98	<	LinkedBlockingQueue q = new LinkedBlockingQueue(null);
99	<	fail("Cannot make from null collection");
100	<	}
61	<	catch (NullPointerException success) {}
98	>	new LinkedBlockingQueue(null);
99	>	shouldThrow();
100	>	} catch (NullPointerException success) {}
101		}
102
103	<	public void testConstructor4(){
103	>	/**
104	>	* Initializing from Collection of null elements throws NullPointerException
105	>	*/
106	>	public void testConstructor4() {
107	>	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
108		try {
109	<	Integer[] ints = new Integer[N];
110	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
111	<	fail("Cannot make with null elements");
69	<	}
70	<	catch (NullPointerException success) {}
109	>	new LinkedBlockingQueue(elements);
110	>	shouldThrow();
111	>	} catch (NullPointerException success) {}
112		}
113
114	<	public void testConstructor5(){
115	<	try {
116	<	Integer[] ints = new Integer[N];
117	<	for (int i = 0; i < N-1; ++i)
118	<	ints[i] = new Integer(i);
119	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
120	<	fail("Cannot make with null elements");
121	<	}
122	<	catch (NullPointerException success) {}
114	>	/**
115	>	* Initializing from Collection with some null elements throws
116	>	* NullPointerException
117	>	*/
118	>	public void testConstructor5() {
119	>	Integer[] ints = new Integer[SIZE];
120	>	for (int i = 0; i < SIZE - 1; ++i)
121	>	ints[i] = new Integer(i);
122	>	Collection<Integer> elements = Arrays.asList(ints);
123	>	try {
124	>	new LinkedBlockingQueue(elements);
125	>	shouldThrow();
126	>	} catch (NullPointerException success) {}
127		}
128
129	<	public void testConstructor6(){
130	<	try {
131	<	Integer[] ints = new Integer[N];
132	<	for (int i = 0; i < N; ++i)
133	<	ints[i] = new Integer(i);
134	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
135	<	for (int i = 0; i < N; ++i)
136	<	assertEquals(ints[i], q.poll());
137	<	}
138	<	finally {}
129	>	/**
130	>	* Queue contains all elements of collection used to initialize
131	>	*/
132	>	public void testConstructor6() {
133	>	Integer[] ints = new Integer[SIZE];
134	>	for (int i = 0; i < SIZE; ++i)
135	>	ints[i] = new Integer(i);
136	>	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
137	>	for (int i = 0; i < SIZE; ++i)
138	>	assertEquals(ints[i], q.poll());
139		}
140
141	+	/**
142	+	* Queue transitions from empty to full when elements added
143	+	*/
144		public void testEmptyFull() {
145		LinkedBlockingQueue q = new LinkedBlockingQueue(2);
146		assertTrue(q.isEmpty());
147		assertEquals("should have room for 2", 2, q.remainingCapacity());
148	<	q.add(new Integer(1));
148	>	q.add(one);
149		assertFalse(q.isEmpty());
150	<	q.add(new Integer(2));
150	>	q.add(two);
151		assertFalse(q.isEmpty());
152	<	assertEquals("queue should be full", 0, q.remainingCapacity());
153	<	assertFalse("offer should be rejected", q.offer(new Integer(3)));
152	>	assertEquals(0, q.remainingCapacity());
153	>	assertFalse(q.offer(three));
154		}
155
156	<	public void testRemainingCapacity(){
157	<	LinkedBlockingQueue q = fullQueue(N);
158	<	for (int i = 0; i < N; ++i) {
156	>	/**
157	>	* remainingCapacity decreases on add, increases on remove
158	>	*/
159	>	public void testRemainingCapacity() {
160	>	BlockingQueue q = populatedQueue(SIZE);
161	>	for (int i = 0; i < SIZE; ++i) {
162		assertEquals(i, q.remainingCapacity());
163	<	assertEquals(N-i, q.size());
164	<	q.remove();
163	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
164	>	assertEquals(i, q.remove());
165		}
166	<	for (int i = 0; i < N; ++i) {
167	<	assertEquals(N-i, q.remainingCapacity());
168	<	assertEquals(i, q.size());
169	<	q.add(new Integer(i));
166	>	for (int i = 0; i < SIZE; ++i) {
167	>	assertEquals(SIZE - i, q.remainingCapacity());
168	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
169	>	assertTrue(q.add(i));
170		}
171		}
172
173	<	public void testOfferNull(){
174	<	try {
175	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
176	<	q.offer(null);
177	<	fail("should throw NPE");
178	<	} catch (NullPointerException success) { }
173	>	/**
174	>	* Offer succeeds if not full; fails if full
175	>	*/
176	>	public void testOffer() {
177	>	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
178	>	assertTrue(q.offer(zero));
179	>	assertFalse(q.offer(one));
180		}
181
182	<	public void testOffer(){
183	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
184	<	assertTrue(q.offer(new Integer(0)));
185	<	assertFalse(q.offer(new Integer(1)));
182	>	/**
183	>	* add succeeds if not full; throws IllegalStateException if full
184	>	*/
185	>	public void testAdd() {
186	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
187	>	for (int i = 0; i < SIZE; ++i)
188	>	assertTrue(q.add(new Integer(i)));
189	>	assertEquals(0, q.remainingCapacity());
190	>	try {
191	>	q.add(new Integer(SIZE));
192	>	shouldThrow();
193	>	} catch (IllegalStateException success) {}
194		}
195
196	<	public void testAdd(){
197	<	try {
198	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
199	<	for (int i = 0; i < N; ++i) {
200	<	assertTrue(q.add(new Integer(i)));
201	<	}
202	<	assertEquals(0, q.remainingCapacity());
203	<	q.add(new Integer(N));
204	<	} catch (IllegalStateException success){
205	<	}
206	<	}
207	<
208	<	public void testAddAll1(){
209	<	try {
210	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
211	<	q.addAll(null);
212	<	fail("Cannot add null collection");
213	<	}
214	<	catch (NullPointerException success) {}
215	<	}
216	<	public void testAddAll2(){
217	<	try {
218	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
219	<	Integer[] ints = new Integer[N];
220	<	q.addAll(Arrays.asList(ints));
221	<	fail("Cannot add null elements");
222	<	}
223	<	catch (NullPointerException success) {}
224	<	}
225	<	public void testAddAll3(){
226	<	try {
227	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
228	<	Integer[] ints = new Integer[N];
229	<	for (int i = 0; i < N-1; ++i)
230	<	ints[i] = new Integer(i);
231	<	q.addAll(Arrays.asList(ints));
232	<	fail("Cannot add null elements");
233	<	}
234	<	catch (NullPointerException success) {}
235	<	}
236	<	public void testAddAll4(){
237	<	try {
238	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
239	<	Integer[] ints = new Integer[N];
240	<	for (int i = 0; i < N; ++i)
241	<	ints[i] = new Integer(i);
242	<	q.addAll(Arrays.asList(ints));
243	<	fail("Cannot add with insufficient capacity");
244	<	}
245	<	catch (IllegalStateException success) {}
246	<	}
247	<	public void testAddAll5(){
248	<	try {
249	<	Integer[] empty = new Integer[0];
250	<	Integer[] ints = new Integer[N];
251	<	for (int i = 0; i < N; ++i)
252	<	ints[i] = new Integer(i);
253	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
254	<	assertFalse(q.addAll(Arrays.asList(empty)));
255	<	assertTrue(q.addAll(Arrays.asList(ints)));
256	<	for (int i = 0; i < N; ++i)
257	<	assertEquals(ints[i], q.poll());
258	<	}
259	<	finally {}
260	<	}
261	<
202	<	public void testPutNull() {
203	<	try {
204	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
205	<	q.put(null);
206	<	fail("put should throw NPE");
207	<	}
208	<	catch (NullPointerException success){
209	<	}
210	<	catch (InterruptedException ie) {
211	<	fail("Unexpected exception");
212	<	}
213	<	}
214	<
215	<	public void testPut() {
216	<	try {
217	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
218	<	for (int i = 0; i < N; ++i) {
219	<	Integer I = new Integer(i);
220	<	q.put(I);
221	<	assertTrue(q.contains(I));
222	<	}
223	<	assertEquals(0, q.remainingCapacity());
224	<	}
225	<	catch (InterruptedException ie) {
226	<	fail("Unexpected exception");
227	<	}
228	<	}
229	<
230	<	public void testBlockingPut(){
231	<	Thread t = new Thread(new Runnable() {
232	<	public void run() {
233	<	int added = 0;
234	<	try {
235	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
236	<	for (int i = 0; i < N; ++i) {
237	<	q.put(new Integer(i));
238	<	++added;
239	<	}
240	<	q.put(new Integer(N));
241	<	fail("put should block");
242	<	} catch (InterruptedException ie){
243	<	assertEquals(added, N);
244	<	}
245	<	}});
246	<	t.start();
247	<	try {
248	<	Thread.sleep(SHORT_DELAY_MS);
249	<	t.interrupt();
250	<	t.join();
251	<	}
252	<	catch (InterruptedException ie) {
253	<	fail("Unexpected exception");
196	>	/**
197	>	* addAll(this) throws IllegalArgumentException
198	>	*/
199	>	public void testAddAllSelf() {
200	>	LinkedBlockingQueue q = populatedQueue(SIZE);
201	>	try {
202	>	q.addAll(q);
203	>	shouldThrow();
204	>	} catch (IllegalArgumentException success) {}
205	>	}
206	>
207	>	/**
208	>	* addAll of a collection with any null elements throws NPE after
209	>	* possibly adding some elements
210	>	*/
211	>	public void testAddAll3() {
212	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
213	>	Integer[] ints = new Integer[SIZE];
214	>	for (int i = 0; i < SIZE - 1; ++i)
215	>	ints[i] = new Integer(i);
216	>	Collection<Integer> elements = Arrays.asList(ints);
217	>	try {
218	>	q.addAll(elements);
219	>	shouldThrow();
220	>	} catch (NullPointerException success) {}
221	>	}
222	>
223	>	/**
224	>	* addAll throws IllegalStateException if not enough room
225	>	*/
226	>	public void testAddAll4() {
227	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1);
228	>	Integer[] ints = new Integer[SIZE];
229	>	for (int i = 0; i < SIZE; ++i)
230	>	ints[i] = new Integer(i);
231	>	Collection<Integer> elements = Arrays.asList(ints);
232	>	try {
233	>	q.addAll(elements);
234	>	shouldThrow();
235	>	} catch (IllegalStateException success) {}
236	>	}
237	>
238	>	/**
239	>	* Queue contains all elements, in traversal order, of successful addAll
240	>	*/
241	>	public void testAddAll5() {
242	>	Integer[] empty = new Integer[0];
243	>	Integer[] ints = new Integer[SIZE];
244	>	for (int i = 0; i < SIZE; ++i)
245	>	ints[i] = new Integer(i);
246	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
247	>	assertFalse(q.addAll(Arrays.asList(empty)));
248	>	assertTrue(q.addAll(Arrays.asList(ints)));
249	>	for (int i = 0; i < SIZE; ++i)
250	>	assertEquals(ints[i], q.poll());
251	>	}
252	>
253	>	/**
254	>	* all elements successfully put are contained
255	>	*/
256	>	public void testPut() throws InterruptedException {
257	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
258	>	for (int i = 0; i < SIZE; ++i) {
259	>	Integer x = new Integer(i);
260	>	q.put(x);
261	>	assertTrue(q.contains(x));
262		}
263	+	assertEquals(0, q.remainingCapacity());
264	+	}
265	+
266	+	/**
267	+	* put blocks interruptibly if full
268	+	*/
269	+	public void testBlockingPut() throws InterruptedException {
270	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
271	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
272	+	Thread t = newStartedThread(new CheckedRunnable() {
273	+	public void realRun() throws InterruptedException {
274	+	for (int i = 0; i < SIZE; ++i)
275	+	q.put(i);
276	+	assertEquals(SIZE, q.size());
277	+	assertEquals(0, q.remainingCapacity());
278	+
279	+	Thread.currentThread().interrupt();
280	+	try {
281	+	q.put(99);
282	+	shouldThrow();
283	+	} catch (InterruptedException success) {}
284	+	assertFalse(Thread.interrupted());
285	+
286	+	pleaseInterrupt.countDown();
287	+	try {
288	+	q.put(99);
289	+	shouldThrow();
290	+	} catch (InterruptedException success) {}
291	+	assertFalse(Thread.interrupted());
292	+	}});
293	+
294	+	await(pleaseInterrupt);
295	+	assertThreadBlocks(t, Thread.State.WAITING);
296	+	t.interrupt();
297	+	awaitTermination(t);
298	+	assertEquals(SIZE, q.size());
299	+	assertEquals(0, q.remainingCapacity());
300		}
301
302	<	public void testPutWithTake() {
302	>	/**
303	>	* put blocks interruptibly waiting for take when full
304	>	*/
305	>	public void testPutWithTake() throws InterruptedException {
306	>	final int capacity = 2;
307		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
308	<	Thread t = new Thread(new Runnable() {
309	<	public void run(){
310	<	int added = 0;
311	<	try {
312	<	q.put(new Object());
313	<	++added;
314	<	q.put(new Object());
315	<	++added;
316	<	q.put(new Object());
317	<	++added;
318	<	q.put(new Object());
319	<	++added;
320	<	fail("Should block");
321	<	} catch (InterruptedException e){
322	<	assertTrue(added >= 2);
323	<	}
324	<	}
325	<	});
326	<	try {
327	<	t.start();
328	<	Thread.sleep(SHORT_DELAY_MS);
329	<	q.take();
330	<	t.interrupt();
331	<	t.join();
332	<	} catch (Exception e){
333	<	fail("Unexpected exception");
334	<	}
308	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
309	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
310	>	Thread t = newStartedThread(new CheckedRunnable() {
311	>	public void realRun() throws InterruptedException {
312	>	for (int i = 0; i < capacity; i++)
313	>	q.put(i);
314	>	pleaseTake.countDown();
315	>	q.put(86);
316	>
317	>	Thread.currentThread().interrupt();
318	>	try {
319	>	q.put(99);
320	>	shouldThrow();
321	>	} catch (InterruptedException success) {}
322	>	assertFalse(Thread.interrupted());
323	>
324	>	pleaseInterrupt.countDown();
325	>	try {
326	>	q.put(99);
327	>	shouldThrow();
328	>	} catch (InterruptedException success) {}
329	>	assertFalse(Thread.interrupted());
330	>	}});
331	>
332	>	await(pleaseTake);
333	>	assertEquals(0, q.remainingCapacity());
334	>	assertEquals(0, q.take());
335	>
336	>	await(pleaseInterrupt);
337	>	assertThreadBlocks(t, Thread.State.WAITING);
338	>	t.interrupt();
339	>	awaitTermination(t);
340	>	assertEquals(0, q.remainingCapacity());
341		}
342
343	+	/**
344	+	* timed offer times out if full and elements not taken
345	+	*/
346		public void testTimedOffer() {
347		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
348	<	Thread t = new Thread(new Runnable() {
349	<	public void run(){
350	<	try {
351	<	q.put(new Object());
352	<	q.put(new Object());
353	<	assertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
354	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
355	<	fail("Should block");
356	<	} catch (InterruptedException success){}
299	<	}
300	<	});
301	<
302	<	try {
303	<	t.start();
304	<	Thread.sleep(SHORT_DELAY_MS);
305	<	t.interrupt();
306	<	t.join();
307	<	} catch (Exception e){
308	<	fail("Unexpected exception");
309	<	}
310	<	}
348	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
349	>	Thread t = newStartedThread(new CheckedRunnable() {
350	>	public void realRun() throws InterruptedException {
351	>	q.put(new Object());
352	>	q.put(new Object());
353	>
354	>	long startTime = System.nanoTime();
355	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
356	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
357
358	<	public void testTake(){
359	<	try {
360	<	LinkedBlockingQueue q = fullQueue(N);
361	<	for (int i = 0; i < N; ++i) {
362	<	assertEquals(i, ((Integer)q.take()).intValue());
363	<	}
364	<	} catch (InterruptedException e){
365	<	fail("Unexpected exception");
366	<	}
358	>	Thread.currentThread().interrupt();
359	>	try {
360	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
361	>	shouldThrow();
362	>	} catch (InterruptedException success) {}
363	>	assertFalse(Thread.interrupted());
364	>
365	>	pleaseInterrupt.countDown();
366	>	try {
367	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
368	>	shouldThrow();
369	>	} catch (InterruptedException success) {}
370	>	assertFalse(Thread.interrupted());
371	>	}});
372	>
373	>	await(pleaseInterrupt);
374	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
375	>	t.interrupt();
376	>	awaitTermination(t);
377		}
378
379	<	public void testTakeFromEmpty() {
380	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
381	<	Thread t = new Thread(new Runnable() {
382	<	public void run(){
383	<	try {
384	<	q.take();
385	<	fail("Should block");
330	<	} catch (InterruptedException success){ }
331	<	}
332	<	});
333	<	try {
334	<	t.start();
335	<	Thread.sleep(SHORT_DELAY_MS);
336	<	t.interrupt();
337	<	t.join();
338	<	} catch (Exception e){
339	<	fail("Unexpected exception");
379	>	/**
380	>	* take retrieves elements in FIFO order
381	>	*/
382	>	public void testTake() throws InterruptedException {
383	>	LinkedBlockingQueue q = populatedQueue(SIZE);
384	>	for (int i = 0; i < SIZE; ++i) {
385	>	assertEquals(i, q.take());
386		}
387		}
388
389	<	public void testBlockingTake(){
390	<	Thread t = new Thread(new Runnable() {
391	<	public void run() {
392	<	try {
393	<	LinkedBlockingQueue q = fullQueue(N);
394	<	for (int i = 0; i < N; ++i) {
395	<	assertEquals(i, ((Integer)q.take()).intValue());
396	<	}
397	<	q.take();
398	<	fail("take should block");
399	<	} catch (InterruptedException success){
400	<	}
401	<	}});
402	<	t.start();
403	<	try {
404	<	Thread.sleep(SHORT_DELAY_MS);
405	<	t.interrupt();
406	<	t.join();
407	<	}
408	<	catch (InterruptedException ie) {
409	<	fail("Unexpected exception");
410	<	}
389	>	/**
390	>	* Take removes existing elements until empty, then blocks interruptibly
391	>	*/
392	>	public void testBlockingTake() throws InterruptedException {
393	>	final BlockingQueue q = populatedQueue(SIZE);
394	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
395	>	Thread t = newStartedThread(new CheckedRunnable() {
396	>	public void realRun() throws InterruptedException {
397	>	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
398	>
399	>	Thread.currentThread().interrupt();
400	>	try {
401	>	q.take();
402	>	shouldThrow();
403	>	} catch (InterruptedException success) {}
404	>	assertFalse(Thread.interrupted());
405	>
406	>	pleaseInterrupt.countDown();
407	>	try {
408	>	q.take();
409	>	shouldThrow();
410	>	} catch (InterruptedException success) {}
411	>	assertFalse(Thread.interrupted());
412	>	}});
413	>
414	>	await(pleaseInterrupt);
415	>	assertThreadBlocks(t, Thread.State.WAITING);
416	>	t.interrupt();
417	>	awaitTermination(t);
418		}
419
420	+	/**
421	+	* poll succeeds unless empty
422	+	*/
423	+	public void testPoll() {
424	+	LinkedBlockingQueue q = populatedQueue(SIZE);
425	+	for (int i = 0; i < SIZE; ++i) {
426	+	assertEquals(i, q.poll());
427	+	}
428	+	assertNull(q.poll());
429	+	}
430
431	<	public void testPoll(){
432	<	LinkedBlockingQueue q = fullQueue(N);
433	<	for (int i = 0; i < N; ++i) {
434	<	assertEquals(i, ((Integer)q.poll()).intValue());
431	>	/**
432	>	* timed poll with zero timeout succeeds when non-empty, else times out
433	>	*/
434	>	public void testTimedPoll0() throws InterruptedException {
435	>	LinkedBlockingQueue q = populatedQueue(SIZE);
436	>	for (int i = 0; i < SIZE; ++i) {
437	>	assertEquals(i, q.poll(0, MILLISECONDS));
438		}
439	<	assertNull(q.poll());
439	>	assertNull(q.poll(0, MILLISECONDS));
440		}
441
442	<	public void testTimedPoll0() {
443	<	try {
444	<	LinkedBlockingQueue q = fullQueue(N);
445	<	for (int i = 0; i < N; ++i) {
446	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
447	<	}
448	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
449	<	} catch (InterruptedException e){
450	<	fail("Unexpected exception");
451	<	}
442	>	/**
443	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
444	>	*/
445	>	public void testTimedPoll() throws InterruptedException {
446	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
447	>	for (int i = 0; i < SIZE; ++i) {
448	>	long startTime = System.nanoTime();
449	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
450	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
451	>	}
452	>	long startTime = System.nanoTime();
453	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
454	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
455	>	checkEmpty(q);
456		}
457
458	<	public void testTimedPoll() {
459	<	try {
460	<	LinkedBlockingQueue q = fullQueue(N);
461	<	for (int i = 0; i < N; ++i) {
462	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
463	<	}
464	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
465	<	} catch (InterruptedException e){
466	<	fail("Unexpected exception");
467	<	}
468	<	}
469	<
470	<	public void testInterruptedTimedPoll(){
471	<	Thread t = new Thread(new Runnable() {
472	<	public void run() {
473	<	try {
474	<	LinkedBlockingQueue q = fullQueue(N);
475	<	for (int i = 0; i < N; ++i) {
476	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
477	<	}
478	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
479	<	} catch (InterruptedException success){
480	<	}
481	<	}});
482	<	t.start();
483	<	try {
484	<	Thread.sleep(SHORT_DELAY_MS);
485	<	t.interrupt();
486	<	t.join();
487	<	}
488	<	catch (InterruptedException ie) {
489	<	fail("Unexpected exception");
490	<	}
458	>	/**
459	>	* Interrupted timed poll throws InterruptedException instead of
460	>	* returning timeout status
461	>	*/
462	>	public void testInterruptedTimedPoll() throws InterruptedException {
463	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
464	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
465	>	Thread t = newStartedThread(new CheckedRunnable() {
466	>	public void realRun() throws InterruptedException {
467	>	long startTime = System.nanoTime();
468	>	for (int i = 0; i < SIZE; i++)
469	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
470	>
471	>	Thread.currentThread().interrupt();
472	>	try {
473	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
474	>	shouldThrow();
475	>	} catch (InterruptedException success) {}
476	>	assertFalse(Thread.interrupted());
477	>
478	>	pleaseInterrupt.countDown();
479	>	try {
480	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
481	>	shouldThrow();
482	>	} catch (InterruptedException success) {}
483	>	assertFalse(Thread.interrupted());
484	>
485	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
486	>	}});
487	>
488	>	await(pleaseInterrupt);
489	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
490	>	t.interrupt();
491	>	awaitTermination(t);
492	>	checkEmpty(q);
493		}
494
495	<	public void testTimedPollWithOffer(){
496	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
497	<	Thread t = new Thread(new Runnable() {
498	<	public void run(){
499	<	try {
500	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
501	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
502	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
431	<	fail("Should block");
432	<	} catch (InterruptedException success) { }
433	<	}
434	<	});
435	<	try {
436	<	t.start();
437	<	Thread.sleep(SHORT_DELAY_MS * 2);
438	<	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
439	<	t.interrupt();
440	<	t.join();
441	<	} catch (Exception e){
442	<	fail("Unexpected exception");
443	<	}
444	<	}
445	<
446	<
447	<	public void testPeek(){
448	<	LinkedBlockingQueue q = fullQueue(N);
449	<	for (int i = 0; i < N; ++i) {
450	<	assertEquals(i, ((Integer)q.peek()).intValue());
451	<	q.poll();
495	>	/**
496	>	* peek returns next element, or null if empty
497	>	*/
498	>	public void testPeek() {
499	>	LinkedBlockingQueue q = populatedQueue(SIZE);
500	>	for (int i = 0; i < SIZE; ++i) {
501	>	assertEquals(i, q.peek());
502	>	assertEquals(i, q.poll());
503		assertTrue(q.peek() == null ||
504	<	i != ((Integer)q.peek()).intValue());
504	>	!q.peek().equals(i));
505		}
506	<	assertNull(q.peek());
506	>	assertNull(q.peek());
507		}
508
509	<	public void testElement(){
510	<	LinkedBlockingQueue q = fullQueue(N);
511	<	for (int i = 0; i < N; ++i) {
512	<	assertEquals(i, ((Integer)q.element()).intValue());
513	<	q.poll();
509	>	/**
510	>	* element returns next element, or throws NSEE if empty
511	>	*/
512	>	public void testElement() {
513	>	LinkedBlockingQueue q = populatedQueue(SIZE);
514	>	for (int i = 0; i < SIZE; ++i) {
515	>	assertEquals(i, q.element());
516	>	assertEquals(i, q.poll());
517		}
518		try {
519		q.element();
520	<	fail("no such element");
521	<	}
468	<	catch (NoSuchElementException success) {}
520	>	shouldThrow();
521	>	} catch (NoSuchElementException success) {}
522		}
523
524	<	public void testRemove(){
525	<	LinkedBlockingQueue q = fullQueue(N);
526	<	for (int i = 0; i < N; ++i) {
527	<	assertEquals(i, ((Integer)q.remove()).intValue());
524	>	/**
525	>	* remove removes next element, or throws NSEE if empty
526	>	*/
527	>	public void testRemove() {
528	>	LinkedBlockingQueue q = populatedQueue(SIZE);
529	>	for (int i = 0; i < SIZE; ++i) {
530	>	assertEquals(i, q.remove());
531		}
532		try {
533		q.remove();
534	<	fail("remove should throw");
535	<	} catch (NoSuchElementException success){
480	<	}
534	>	shouldThrow();
535	>	} catch (NoSuchElementException success) {}
536		}
537
538	<	public void testRemoveElement(){
539	<	LinkedBlockingQueue q = fullQueue(N);
540	<	for (int i = 1; i < N; i+=2) {
541	<	assertTrue(q.remove(new Integer(i)));
542	<	}
543	<	for (int i = 0; i < N; i+=2) {
544	<	assertTrue(q.remove(new Integer(i)));
545	<	assertFalse(q.remove(new Integer(i+1)));
546	<	}
547	<	assertTrue(q.isEmpty());
538	>	/**
539	>	* An add following remove(x) succeeds
540	>	*/
541	>	public void testRemoveElementAndAdd() throws InterruptedException {
542	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
543	>	assertTrue(q.add(new Integer(1)));
544	>	assertTrue(q.add(new Integer(2)));
545	>	assertTrue(q.remove(new Integer(1)));
546	>	assertTrue(q.remove(new Integer(2)));
547	>	assertTrue(q.add(new Integer(3)));
548	>	assertNotNull(q.take());
549		}
550	<
551	<	public void testContains(){
552	<	LinkedBlockingQueue q = fullQueue(N);
553	<	for (int i = 0; i < N; ++i) {
550	>
551	>	/**
552	>	* contains(x) reports true when elements added but not yet removed
553	>	*/
554	>	public void testContains() {
555	>	LinkedBlockingQueue q = populatedQueue(SIZE);
556	>	for (int i = 0; i < SIZE; ++i) {
557		assertTrue(q.contains(new Integer(i)));
558		q.poll();
559		assertFalse(q.contains(new Integer(i)));
560		}
561		}
562
563	<	public void testClear(){
564	<	LinkedBlockingQueue q = fullQueue(N);
563	>	/**
564	>	* clear removes all elements
565	>	*/
566	>	public void testClear() {
567	>	LinkedBlockingQueue q = populatedQueue(SIZE);
568		q.clear();
569		assertTrue(q.isEmpty());
570		assertEquals(0, q.size());
571	<	assertEquals(N, q.remainingCapacity());
572	<	q.add(new Integer(1));
571	>	assertEquals(SIZE, q.remainingCapacity());
572	>	q.add(one);
573		assertFalse(q.isEmpty());
574	+	assertTrue(q.contains(one));
575		q.clear();
576		assertTrue(q.isEmpty());
577		}
578
579	<	public void testContainsAll(){
580	<	LinkedBlockingQueue q = fullQueue(N);
581	<	LinkedBlockingQueue p = new LinkedBlockingQueue(N);
582	<	for (int i = 0; i < N; ++i) {
579	>	/**
580	>	* containsAll(c) is true when c contains a subset of elements
581	>	*/
582	>	public void testContainsAll() {
583	>	LinkedBlockingQueue q = populatedQueue(SIZE);
584	>	LinkedBlockingQueue p = new LinkedBlockingQueue(SIZE);
585	>	for (int i = 0; i < SIZE; ++i) {
586		assertTrue(q.containsAll(p));
587		assertFalse(p.containsAll(q));
588		p.add(new Integer(i));
#	Line 524 | Line 590 | public class LinkedBlockingQueueTest ext
590		assertTrue(p.containsAll(q));
591		}
592
593	<	public void testRetainAll(){
594	<	LinkedBlockingQueue q = fullQueue(N);
595	<	LinkedBlockingQueue p = fullQueue(N);
596	<	for (int i = 0; i < N; ++i) {
593	>	/**
594	>	* retainAll(c) retains only those elements of c and reports true if changed
595	>	*/
596	>	public void testRetainAll() {
597	>	LinkedBlockingQueue q = populatedQueue(SIZE);
598	>	LinkedBlockingQueue p = populatedQueue(SIZE);
599	>	for (int i = 0; i < SIZE; ++i) {
600		boolean changed = q.retainAll(p);
601		if (i == 0)
602		assertFalse(changed);
#	Line 535 | Line 604 | public class LinkedBlockingQueueTest ext
604		assertTrue(changed);
605
606		assertTrue(q.containsAll(p));
607	<	assertEquals(N-i, q.size());
607	>	assertEquals(SIZE - i, q.size());
608		p.remove();
609		}
610		}
611
612	<	public void testRemoveAll(){
613	<	for (int i = 1; i < N; ++i) {
614	<	LinkedBlockingQueue q = fullQueue(N);
615	<	LinkedBlockingQueue p = fullQueue(i);
612	>	/**
613	>	* removeAll(c) removes only those elements of c and reports true if changed
614	>	*/
615	>	public void testRemoveAll() {
616	>	for (int i = 1; i < SIZE; ++i) {
617	>	LinkedBlockingQueue q = populatedQueue(SIZE);
618	>	LinkedBlockingQueue p = populatedQueue(i);
619		assertTrue(q.removeAll(p));
620	<	assertEquals(N-i, q.size());
620	>	assertEquals(SIZE - i, q.size());
621		for (int j = 0; j < i; ++j) {
622	<	Integer I = (Integer)(p.remove());
623	<	assertFalse(q.contains(I));
622	>	Integer x = (Integer)(p.remove());
623	>	assertFalse(q.contains(x));
624		}
625		}
626		}
627
628	+	/**
629	+	* toArray contains all elements in FIFO order
630	+	*/
631	+	public void testToArray() {
632	+	LinkedBlockingQueue q = populatedQueue(SIZE);
633	+	Object[] o = q.toArray();
634	+	for (int i = 0; i < o.length; i++)
635	+	assertSame(o[i], q.poll());
636	+	}
637
638	<	public void testToArray(){
639	<	LinkedBlockingQueue q = fullQueue(N);
640	<	Object[] o = q.toArray();
641	<	try {
642	<	for(int i = 0; i < o.length; i++)
643	<	assertEquals(o[i], q.take());
644	<	} catch (InterruptedException e){
645	<	fail("Unexpected exception");
646	<	}
647	<	}
567	<
568	<	public void testToArray2(){
569	<	LinkedBlockingQueue q = fullQueue(N);
570	<	Integer[] ints = new Integer[N];
571	<	ints = (Integer[])q.toArray(ints);
572	<	try {
573	<	for(int i = 0; i < ints.length; i++)
574	<	assertEquals(ints[i], q.take());
575	<	} catch (InterruptedException e){
576	<	fail("Unexpected exception");
577	<	}
578	<	}
579	<
580	<	public void testIterator(){
581	<	LinkedBlockingQueue q = fullQueue(N);
582	<	Iterator it = q.iterator();
583	<	try {
584	<	while(it.hasNext()){
585	<	assertEquals(it.next(), q.take());
586	<	}
587	<	} catch (InterruptedException e){
588	<	fail("Unexpected exception");
589	<	}
638	>	/**
639	>	* toArray(a) contains all elements in FIFO order
640	>	*/
641	>	public void testToArray2() throws InterruptedException {
642	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
643	>	Integer[] ints = new Integer[SIZE];
644	>	Integer[] array = q.toArray(ints);
645	>	assertSame(ints, array);
646	>	for (int i = 0; i < ints.length; i++)
647	>	assertSame(ints[i], q.poll());
648		}
649
650	<	public void testIteratorOrdering() {
650	>	/**
651	>	* toArray(incompatible array type) throws ArrayStoreException
652	>	*/
653	>	public void testToArray1_BadArg() {
654	>	LinkedBlockingQueue q = populatedQueue(SIZE);
655	>	try {
656	>	q.toArray(new String[10]);
657	>	shouldThrow();
658	>	} catch (ArrayStoreException success) {}
659	>	}
660
661	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
661	>	/**
662	>	* iterator iterates through all elements
663	>	*/
664	>	public void testIterator() throws InterruptedException {
665	>	LinkedBlockingQueue q = populatedQueue(SIZE);
666	>	Iterator it = q.iterator();
667	>	int i;
668	>	for (i = 0; it.hasNext(); i++)
669	>	assertTrue(q.contains(it.next()));
670	>	assertEquals(i, SIZE);
671	>	assertIteratorExhausted(it);
672	>
673	>	it = q.iterator();
674	>	for (i = 0; it.hasNext(); i++)
675	>	assertEquals(it.next(), q.take());
676	>	assertEquals(i, SIZE);
677	>	assertIteratorExhausted(it);
678	>	}
679
680	<	q.add(new Integer(1));
681	<	q.add(new Integer(2));
682	<	q.add(new Integer(3));
680	>	/**
681	>	* iterator of empty collection has no elements
682	>	*/
683	>	public void testEmptyIterator() {
684	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
685	>	}
686
687	<	assertEquals("queue should be full", 0, q.remainingCapacity());
687	>	/**
688	>	* iterator.remove removes current element
689	>	*/
690	>	public void testIteratorRemove() {
691	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
692	>	q.add(two);
693	>	q.add(one);
694	>	q.add(three);
695	>
696	>	Iterator it = q.iterator();
697	>	it.next();
698	>	it.remove();
699	>
700	>	it = q.iterator();
701	>	assertSame(it.next(), one);
702	>	assertSame(it.next(), three);
703	>	assertFalse(it.hasNext());
704	>	}
705
706	+	/**
707	+	* iterator ordering is FIFO
708	+	*/
709	+	public void testIteratorOrdering() {
710	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
711	+	q.add(one);
712	+	q.add(two);
713	+	q.add(three);
714	+	assertEquals(0, q.remainingCapacity());
715		int k = 0;
716		for (Iterator it = q.iterator(); it.hasNext();) {
717	<	int i = ((Integer)(it.next())).intValue();
605	<	assertEquals("items should come out in order", ++k, i);
717	>	assertEquals(++k, it.next());
718		}
719	<
608	<	assertEquals("should go through 3 elements", 3, k);
719	>	assertEquals(3, k);
720		}
721
722	<	public void testWeaklyConsistentIteration () {
723	<
722	>	/**
723	>	* Modifications do not cause iterators to fail
724	>	*/
725	>	public void testWeaklyConsistentIteration() {
726		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
727	<
728	<	q.add(new Integer(1));
729	<	q.add(new Integer(2));
730	<	q.add(new Integer(3));
731	<
732	<	try {
620	<	for (Iterator it = q.iterator(); it.hasNext();) {
621	<	q.remove();
622	<	it.next();
623	<	}
624	<	}
625	<	catch (ConcurrentModificationException e) {
626	<	fail("weakly consistent iterator; should not get CME");
727	>	q.add(one);
728	>	q.add(two);
729	>	q.add(three);
730	>	for (Iterator it = q.iterator(); it.hasNext();) {
731	>	q.remove();
732	>	it.next();
733		}
734	<
629	<	assertEquals("queue should be empty again", 0, q.size());
734	>	assertEquals(0, q.size());
735		}
736
737	<
738	<	public void testToString(){
739	<	LinkedBlockingQueue q = fullQueue(N);
737	>	/**
738	>	* toString contains toStrings of elements
739	>	*/
740	>	public void testToString() {
741	>	LinkedBlockingQueue q = populatedQueue(SIZE);
742		String s = q.toString();
743	<	for (int i = 0; i < N; ++i) {
744	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
743	>	for (int i = 0; i < SIZE; ++i) {
744	>	assertTrue(s.contains(String.valueOf(i)));
745		}
746	<	}
640	<
746	>	}
747
748	+	/**
749	+	* offer transfers elements across Executor tasks
750	+	*/
751		public void testOfferInExecutor() {
643	–
752		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
753	<
754	<	q.add(new Integer(1));
755	<	q.add(new Integer(2));
756	<
757	<	ExecutorService executor = Executors.newFixedThreadPool(2);
758	<
759	<	executor.execute(new Runnable() {
760	<	public void run() {
761	<	assertFalse("offer should be rejected", q.offer(new Integer(3)));
762	<	try {
655	<	assertTrue("offer should be accepted", q.offer(new Integer(3), MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
753	>	q.add(one);
754	>	q.add(two);
755	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
756	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
757	>	try (PoolCleaner cleaner = cleaner(executor)) {
758	>	executor.execute(new CheckedRunnable() {
759	>	public void realRun() throws InterruptedException {
760	>	assertFalse(q.offer(three));
761	>	threadsStarted.await();
762	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
763		assertEquals(0, q.remainingCapacity());
764	<	}
658	<	catch (InterruptedException e) {
659	<	fail("should not be interrupted");
660	<	}
661	<	}
662	<	});
663	<
664	<	executor.execute(new Runnable() {
665	<	public void run() {
666	<	try {
667	<	Thread.sleep(MEDIUM_DELAY_MS);
668	<	assertEquals("first item in queue should be 1", new Integer(1), q.take());
669	<	}
670	<	catch (InterruptedException e) {
671	<	fail("should not be interrupted");
672	<	}
673	<	}
674	<	});
675	<
676	<	executor.shutdown();
764	>	}});
765
766	+	executor.execute(new CheckedRunnable() {
767	+	public void realRun() throws InterruptedException {
768	+	threadsStarted.await();
769	+	assertSame(one, q.take());
770	+	}});
771	+	}
772		}
773
774	+	/**
775	+	* timed poll retrieves elements across Executor threads
776	+	*/
777		public void testPollInExecutor() {
681	–
778		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
779	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
780	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
781	+	try (PoolCleaner cleaner = cleaner(executor)) {
782	+	executor.execute(new CheckedRunnable() {
783	+	public void realRun() throws InterruptedException {
784	+	assertNull(q.poll());
785	+	threadsStarted.await();
786	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
787	+	checkEmpty(q);
788	+	}});
789
790	<	ExecutorService executor = Executors.newFixedThreadPool(2);
790	>	executor.execute(new CheckedRunnable() {
791	>	public void realRun() throws InterruptedException {
792	>	threadsStarted.await();
793	>	q.put(one);
794	>	}});
795	>	}
796	>	}
797
798	<	executor.execute(new Runnable() {
799	<	public void run() {
800	<	assertNull("poll should fail", q.poll());
801	<	try {
802	<	assertTrue(null != q.poll(MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
803	<	assertTrue(q.isEmpty());
804	<	}
805	<	catch (InterruptedException e) {
806	<	fail("should not be interrupted");
807	<	}
808	<	}
809	<	});
798	>	/**
799	>	* A deserialized/reserialized queue has same elements in same order
800	>	*/
801	>	public void testSerialization() throws Exception {
802	>	Queue x = populatedQueue(SIZE);
803	>	Queue y = serialClone(x);
804	>
805	>	assertNotSame(x, y);
806	>	assertEquals(x.size(), y.size());
807	>	assertEquals(x.toString(), y.toString());
808	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
809	>	while (!x.isEmpty()) {
810	>	assertFalse(y.isEmpty());
811	>	assertEquals(x.remove(), y.remove());
812	>	}
813	>	assertTrue(y.isEmpty());
814	>	}
815
816	<	executor.execute(new Runnable() {
817	<	public void run() {
818	<	try {
819	<	Thread.sleep(MEDIUM_DELAY_MS);
820	<	q.put(new Integer(1));
821	<	}
822	<	catch (InterruptedException e) {
823	<	fail("should not be interrupted");
824	<	}
825	<	}
826	<	});
827	<
828	<	executor.shutdown();
816	>	/**
817	>	* drainTo(c) empties queue into another collection c
818	>	*/
819	>	public void testDrainTo() {
820	>	LinkedBlockingQueue q = populatedQueue(SIZE);
821	>	ArrayList l = new ArrayList();
822	>	q.drainTo(l);
823	>	assertEquals(0, q.size());
824	>	assertEquals(SIZE, l.size());
825	>	for (int i = 0; i < SIZE; ++i)
826	>	assertEquals(l.get(i), new Integer(i));
827	>	q.add(zero);
828	>	q.add(one);
829	>	assertFalse(q.isEmpty());
830	>	assertTrue(q.contains(zero));
831	>	assertTrue(q.contains(one));
832	>	l.clear();
833	>	q.drainTo(l);
834	>	assertEquals(0, q.size());
835	>	assertEquals(2, l.size());
836	>	for (int i = 0; i < 2; ++i)
837	>	assertEquals(l.get(i), new Integer(i));
838	>	}
839
840	+	/**
841	+	* drainTo empties full queue, unblocking a waiting put.
842	+	*/
843	+	public void testDrainToWithActivePut() throws InterruptedException {
844	+	final LinkedBlockingQueue q = populatedQueue(SIZE);
845	+	Thread t = new Thread(new CheckedRunnable() {
846	+	public void realRun() throws InterruptedException {
847	+	q.put(new Integer(SIZE + 1));
848	+	}});
849	+
850	+	t.start();
851	+	ArrayList l = new ArrayList();
852	+	q.drainTo(l);
853	+	assertTrue(l.size() >= SIZE);
854	+	for (int i = 0; i < SIZE; ++i)
855	+	assertEquals(l.get(i), new Integer(i));
856	+	t.join();
857	+	assertTrue(q.size() + l.size() >= SIZE);
858		}
859
860	<	public void testSerialization() {
861	<	LinkedBlockingQueue q = fullQueue(N);
862	<
863	<	try {
864	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
865	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
866	<	out.writeObject(q);
867	<	out.close();
868	<
869	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
870	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
871	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
872	<	assertEquals(q.size(), r.size());
873	<	while (!q.isEmpty())
874	<	assertEquals(q.remove(), r.remove());
875	<	} catch(Exception e){
876	<	e.printStackTrace();
877	<	fail("unexpected exception");
860	>	/**
861	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
862	>	*/
863	>	public void testDrainToN() {
864	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
865	>	for (int i = 0; i < SIZE + 2; ++i) {
866	>	for (int j = 0; j < SIZE; j++)
867	>	assertTrue(q.offer(new Integer(j)));
868	>	ArrayList l = new ArrayList();
869	>	q.drainTo(l, i);
870	>	int k = (i < SIZE) ? i : SIZE;
871	>	assertEquals(k, l.size());
872	>	assertEquals(SIZE - k, q.size());
873	>	for (int j = 0; j < k; ++j)
874	>	assertEquals(l.get(j), new Integer(j));
875	>	do {} while (q.poll() != null);
876	>	}
877	>	}
878	>
879	>	/**
880	>	* remove(null), contains(null) always return false
881	>	*/
882	>	public void testNeverContainsNull() {
883	>	Collection<?>[] qs = {
884	>	new LinkedBlockingQueue<Object>(),
885	>	populatedQueue(2),
886	>	};
887	>
888	>	for (Collection<?> q : qs) {
889	>	assertFalse(q.contains(null));
890	>	assertFalse(q.remove(null));
891		}
892		}
893

Diff Legend

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