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

Diff Legend

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