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.67 by jsr166, Sat May 13 21:43:51 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);
126	<	fail("should throw NPE");
127	<	} catch (NullPointerException success) { }
128	<	}
129	<
130	<	public void testOffer(){
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(new Integer(0)));
179	<	assertFalse(q.offer(new Integer(1)));
178	>	assertTrue(q.offer(zero));
179	>	assertFalse(q.offer(one));
180		}
181
182	<	public void testAdd(){
183	<	try {
184	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
185	<	for (int i = 0; i < N; ++i) {
186	<	assertTrue(q.add(new Integer(i)));
187	<	}
188	<	assertEquals(0, q.remainingCapacity());
189	<	q.add(new Integer(N));
190	<	} catch (IllegalStateException success){
191	<	}
192	<	}
193	<
148	<	public void testAddAll1(){
149	<	try {
150	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
151	<	q.addAll(null);
152	<	fail("Cannot add null collection");
153	<	}
154	<	catch (NullPointerException success) {}
155	<	}
156	<	public void testAddAll2(){
157	<	try {
158	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
159	<	Integer[] ints = new Integer[N];
160	<	q.addAll(Arrays.asList(ints));
161	<	fail("Cannot add null elements");
162	<	}
163	<	catch (NullPointerException success) {}
164	<	}
165	<	public void testAddAll3(){
166	<	try {
167	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
168	<	Integer[] ints = new Integer[N];
169	<	for (int i = 0; i < N-1; ++i)
170	<	ints[i] = new Integer(i);
171	<	q.addAll(Arrays.asList(ints));
172	<	fail("Cannot add null elements");
173	<	}
174	<	catch (NullPointerException success) {}
175	<	}
176	<	public void testAddAll4(){
177	<	try {
178	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
179	<	Integer[] ints = new Integer[N];
180	<	for (int i = 0; i < N; ++i)
181	<	ints[i] = new Integer(i);
182	<	q.addAll(Arrays.asList(ints));
183	<	fail("Cannot add with insufficient capacity");
184	<	}
185	<	catch (IllegalStateException success) {}
186	<	}
187	<	public void testAddAll5(){
188	<	try {
189	<	Integer[] empty = new Integer[0];
190	<	Integer[] ints = new Integer[N];
191	<	for (int i = 0; i < N; ++i)
192	<	ints[i] = new Integer(i);
193	<	LinkedBlockingQueue q = new LinkedBlockingQueue(N);
194	<	assertFalse(q.addAll(Arrays.asList(empty)));
195	<	assertTrue(q.addAll(Arrays.asList(ints)));
196	<	for (int i = 0; i < N; ++i)
197	<	assertEquals(ints[i], q.poll());
198	<	}
199	<	finally {}
200	<	}
201	<
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");
254	<	}
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 testPutWithTake() {
197	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
198	<	Thread t = new Thread(new Runnable() {
199	<	public void run(){
200	<	int added = 0;
262	<	try {
263	<	q.put(new Object());
264	<	++added;
265	<	q.put(new Object());
266	<	++added;
267	<	q.put(new Object());
268	<	++added;
269	<	q.put(new Object());
270	<	++added;
271	<	fail("Should block");
272	<	} catch (InterruptedException e){
273	<	assertTrue(added >= 2);
274	<	}
275	<	}
276	<	});
196	>	/**
197	>	* addAll(this) throws IllegalArgumentException
198	>	*/
199	>	public void testAddAllSelf() {
200	>	LinkedBlockingQueue q = populatedQueue(SIZE);
201		try {
202	<	t.start();
203	<	Thread.sleep(SHORT_DELAY_MS);
204	<	q.take();
281	<	t.interrupt();
282	<	t.join();
283	<	} catch (Exception e){
284	<	fail("Unexpected exception");
285	<	}
202	>	q.addAll(q);
203	>	shouldThrow();
204	>	} catch (IllegalArgumentException success) {}
205		}
206
207	<	public void testTimedOffer() {
208	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
209	<	Thread t = new Thread(new Runnable() {
210	<	public void run(){
211	<	try {
212	<	q.put(new Object());
213	<	q.put(new Object());
214	<	assertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
215	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
216	<	fail("Should block");
217	<	} catch (InterruptedException success){}
218	<	}
219	<	});
220	<
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	<	}
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	<	public void testTake(){
224	<	try {
225	<	LinkedBlockingQueue q = fullQueue(N);
226	<	for (int i = 0; i < N; ++i) {
227	<	assertEquals(i, ((Integer)q.take()).intValue());
228	<	}
229	<	} catch (InterruptedException e){
230	<	fail("Unexpected exception");
231	<	}
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	<	public void testTakeFromEmpty() {
239	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
240	<	Thread t = new Thread(new Runnable() {
241	<	public void run(){
242	<	try {
243	<	q.take();
244	<	fail("Should block");
245	<	} catch (InterruptedException success){ }
246	<	}
247	<	});
248	<	try {
249	<	t.start();
250	<	Thread.sleep(SHORT_DELAY_MS);
336	<	t.interrupt();
337	<	t.join();
338	<	} catch (Exception e){
339	<	fail("Unexpected exception");
340	<	}
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	<	public void testBlockingTake(){
254	<	Thread t = new Thread(new Runnable() {
255	<	public void run() {
256	<	try {
257	<	LinkedBlockingQueue q = fullQueue(N);
258	<	for (int i = 0; i < N; ++i) {
259	<	assertEquals(i, ((Integer)q.take()).intValue());
260	<	}
261	<	q.take();
352	<	fail("take should block");
353	<	} catch (InterruptedException success){
354	<	}
355	<	}});
356	<	t.start();
357	<	try {
358	<	Thread.sleep(SHORT_DELAY_MS);
359	<	t.interrupt();
360	<	t.join();
361	<	}
362	<	catch (InterruptedException ie) {
363	<	fail("Unexpected exception");
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	+	assertThreadStaysAlive(t);
296	+	t.interrupt();
297	+	awaitTermination(t);
298	+	assertEquals(SIZE, q.size());
299	+	assertEquals(0, q.remainingCapacity());
300	+	}
301	+
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	+	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	+	pleaseInterrupt.countDown();
318	+	try {
319	+	q.put(99);
320	+	shouldThrow();
321	+	} catch (InterruptedException success) {}
322	+	assertFalse(Thread.interrupted());
323	+	}});
324	+
325	+	await(pleaseTake);
326	+	assertEquals(0, q.remainingCapacity());
327	+	assertEquals(0, q.take());
328	+
329	+	await(pleaseInterrupt);
330	+	assertThreadStaysAlive(t);
331	+	t.interrupt();
332	+	awaitTermination(t);
333	+	assertEquals(0, q.remainingCapacity());
334		}
335
336	+	/**
337	+	* timed offer times out if full and elements not taken
338	+	*/
339	+	public void testTimedOffer() {
340	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
341	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
342	+	Thread t = newStartedThread(new CheckedRunnable() {
343	+	public void realRun() throws InterruptedException {
344	+	q.put(new Object());
345	+	q.put(new Object());
346	+	long startTime = System.nanoTime();
347	+	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
348	+	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
349	+	pleaseInterrupt.countDown();
350	+	try {
351	+	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
352	+	shouldThrow();
353	+	} catch (InterruptedException success) {}
354	+	}});
355	+
356	+	await(pleaseInterrupt);
357	+	assertThreadStaysAlive(t);
358	+	t.interrupt();
359	+	awaitTermination(t);
360	+	}
361
362	<	public void testPoll(){
363	<	LinkedBlockingQueue q = fullQueue(N);
364	<	for (int i = 0; i < N; ++i) {
365	<	assertEquals(i, ((Integer)q.poll()).intValue());
362	>	/**
363	>	* take retrieves elements in FIFO order
364	>	*/
365	>	public void testTake() throws InterruptedException {
366	>	LinkedBlockingQueue q = populatedQueue(SIZE);
367	>	for (int i = 0; i < SIZE; ++i) {
368	>	assertEquals(i, q.take());
369		}
373	–	assertNull(q.poll());
370		}
371
372	<	public void testTimedPoll0() {
373	<	try {
374	<	LinkedBlockingQueue q = fullQueue(N);
375	<	for (int i = 0; i < N; ++i) {
376	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
377	<	}
378	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
379	<	} catch (InterruptedException e){
380	<	fail("Unexpected exception");
381	<	}
372	>	/**
373	>	* Take removes existing elements until empty, then blocks interruptibly
374	>	*/
375	>	public void testBlockingTake() throws InterruptedException {
376	>	final BlockingQueue q = populatedQueue(SIZE);
377	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
378	>	Thread t = newStartedThread(new CheckedRunnable() {
379	>	public void realRun() throws InterruptedException {
380	>	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
381	>
382	>	Thread.currentThread().interrupt();
383	>	try {
384	>	q.take();
385	>	shouldThrow();
386	>	} catch (InterruptedException success) {}
387	>	assertFalse(Thread.interrupted());
388	>
389	>	pleaseInterrupt.countDown();
390	>	try {
391	>	q.take();
392	>	shouldThrow();
393	>	} catch (InterruptedException success) {}
394	>	assertFalse(Thread.interrupted());
395	>	}});
396	>
397	>	await(pleaseInterrupt);
398	>	assertThreadBlocks(t, Thread.State.WAITING);
399	>	t.interrupt();
400	>	awaitTermination(t);
401		}
402
403	<	public void testTimedPoll() {
404	<	try {
405	<	LinkedBlockingQueue q = fullQueue(N);
406	<	for (int i = 0; i < N; ++i) {
407	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
408	<	}
409	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
395	<	} catch (InterruptedException e){
396	<	fail("Unexpected exception");
397	<	}
398	<	}
399	<
400	<	public void testInterruptedTimedPoll(){
401	<	Thread t = new Thread(new Runnable() {
402	<	public void run() {
403	<	try {
404	<	LinkedBlockingQueue q = fullQueue(N);
405	<	for (int i = 0; i < N; ++i) {
406	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
407	<	}
408	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
409	<	} catch (InterruptedException success){
410	<	}
411	<	}});
412	<	t.start();
413	<	try {
414	<	Thread.sleep(SHORT_DELAY_MS);
415	<	t.interrupt();
416	<	t.join();
403	>	/**
404	>	* poll succeeds unless empty
405	>	*/
406	>	public void testPoll() {
407	>	LinkedBlockingQueue q = populatedQueue(SIZE);
408	>	for (int i = 0; i < SIZE; ++i) {
409	>	assertEquals(i, q.poll());
410		}
411	<	catch (InterruptedException ie) {
412	<	fail("Unexpected exception");
411	>	assertNull(q.poll());
412	>	}
413	>
414	>	/**
415	>	* timed poll with zero timeout succeeds when non-empty, else times out
416	>	*/
417	>	public void testTimedPoll0() throws InterruptedException {
418	>	LinkedBlockingQueue q = populatedQueue(SIZE);
419	>	for (int i = 0; i < SIZE; ++i) {
420	>	assertEquals(i, q.poll(0, MILLISECONDS));
421		}
422	+	assertNull(q.poll(0, MILLISECONDS));
423		}
424
425	<	public void testTimedPollWithOffer(){
426	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
427	<	Thread t = new Thread(new Runnable() {
428	<	public void run(){
429	<	try {
430	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
431	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
432	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
433	<	fail("Should block");
434	<	} catch (InterruptedException success) { }
425	>	/**
426	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
427	>	*/
428	>	public void testTimedPoll() throws InterruptedException {
429	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
430	>	for (int i = 0; i < SIZE; ++i) {
431	>	long startTime = System.nanoTime();
432	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
433	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
434	>	}
435	>	long startTime = System.nanoTime();
436	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
437	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
438	>	checkEmpty(q);
439	>	}
440	>
441	>	/**
442	>	* Interrupted timed poll throws InterruptedException instead of
443	>	* returning timeout status
444	>	*/
445	>	public void testInterruptedTimedPoll() throws InterruptedException {
446	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
447	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
448	>	Thread t = newStartedThread(new CheckedRunnable() {
449	>	public void realRun() throws InterruptedException {
450	>	long startTime = System.nanoTime();
451	>	for (int i = 0; i < SIZE; ++i) {
452	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
453		}
454	<	});
455	<	try {
456	<	t.start();
457	<	Thread.sleep(SHORT_DELAY_MS * 2);
458	<	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
459	<	t.interrupt();
460	<	t.join();
461	<	} catch (Exception e){
462	<	fail("Unexpected exception");
463	<	}
464	<	}
465	<
466	<
467	<	public void testPeek(){
468	<	LinkedBlockingQueue q = fullQueue(N);
469	<	for (int i = 0; i < N; ++i) {
470	<	assertEquals(i, ((Integer)q.peek()).intValue());
471	<	q.poll();
454	>	aboutToWait.countDown();
455	>	try {
456	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
457	>	shouldThrow();
458	>	} catch (InterruptedException success) {
459	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
460	>	}
461	>	}});
462	>
463	>	await(aboutToWait);
464	>	waitForThreadToEnterWaitState(t);
465	>	t.interrupt();
466	>	awaitTermination(t);
467	>	checkEmpty(q);
468	>	}
469	>
470	>	/**
471	>	* peek returns next element, or null if empty
472	>	*/
473	>	public void testPeek() {
474	>	LinkedBlockingQueue q = populatedQueue(SIZE);
475	>	for (int i = 0; i < SIZE; ++i) {
476	>	assertEquals(i, q.peek());
477	>	assertEquals(i, q.poll());
478		assertTrue(q.peek() == null ||
479	<	i != ((Integer)q.peek()).intValue());
479	>	!q.peek().equals(i));
480		}
481	<	assertNull(q.peek());
481	>	assertNull(q.peek());
482		}
483
484	<	public void testElement(){
485	<	LinkedBlockingQueue q = fullQueue(N);
486	<	for (int i = 0; i < N; ++i) {
487	<	assertEquals(i, ((Integer)q.element()).intValue());
488	<	q.poll();
484	>	/**
485	>	* element returns next element, or throws NSEE if empty
486	>	*/
487	>	public void testElement() {
488	>	LinkedBlockingQueue q = populatedQueue(SIZE);
489	>	for (int i = 0; i < SIZE; ++i) {
490	>	assertEquals(i, q.element());
491	>	assertEquals(i, q.poll());
492		}
493		try {
494		q.element();
495	<	fail("no such element");
496	<	}
468	<	catch (NoSuchElementException success) {}
495	>	shouldThrow();
496	>	} catch (NoSuchElementException success) {}
497		}
498
499	<	public void testRemove(){
500	<	LinkedBlockingQueue q = fullQueue(N);
501	<	for (int i = 0; i < N; ++i) {
502	<	assertEquals(i, ((Integer)q.remove()).intValue());
499	>	/**
500	>	* remove removes next element, or throws NSEE if empty
501	>	*/
502	>	public void testRemove() {
503	>	LinkedBlockingQueue q = populatedQueue(SIZE);
504	>	for (int i = 0; i < SIZE; ++i) {
505	>	assertEquals(i, q.remove());
506		}
507		try {
508		q.remove();
509	<	fail("remove should throw");
510	<	} catch (NoSuchElementException success){
480	<	}
509	>	shouldThrow();
510	>	} catch (NoSuchElementException success) {}
511		}
512
513	<	public void testRemoveElement(){
514	<	LinkedBlockingQueue q = fullQueue(N);
515	<	for (int i = 1; i < N; i+=2) {
516	<	assertTrue(q.remove(new Integer(i)));
517	<	}
518	<	for (int i = 0; i < N; i+=2) {
519	<	assertTrue(q.remove(new Integer(i)));
520	<	assertFalse(q.remove(new Integer(i+1)));
521	<	}
522	<	assertTrue(q.isEmpty());
513	>	/**
514	>	* An add following remove(x) succeeds
515	>	*/
516	>	public void testRemoveElementAndAdd() throws InterruptedException {
517	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
518	>	assertTrue(q.add(new Integer(1)));
519	>	assertTrue(q.add(new Integer(2)));
520	>	assertTrue(q.remove(new Integer(1)));
521	>	assertTrue(q.remove(new Integer(2)));
522	>	assertTrue(q.add(new Integer(3)));
523	>	assertNotNull(q.take());
524		}
525	<
526	<	public void testContains(){
527	<	LinkedBlockingQueue q = fullQueue(N);
528	<	for (int i = 0; i < N; ++i) {
525	>
526	>	/**
527	>	* contains(x) reports true when elements added but not yet removed
528	>	*/
529	>	public void testContains() {
530	>	LinkedBlockingQueue q = populatedQueue(SIZE);
531	>	for (int i = 0; i < SIZE; ++i) {
532		assertTrue(q.contains(new Integer(i)));
533		q.poll();
534		assertFalse(q.contains(new Integer(i)));
535		}
536		}
537
538	<	public void testClear(){
539	<	LinkedBlockingQueue q = fullQueue(N);
538	>	/**
539	>	* clear removes all elements
540	>	*/
541	>	public void testClear() {
542	>	LinkedBlockingQueue q = populatedQueue(SIZE);
543		q.clear();
544		assertTrue(q.isEmpty());
545		assertEquals(0, q.size());
546	<	assertEquals(N, q.remainingCapacity());
547	<	q.add(new Integer(1));
546	>	assertEquals(SIZE, q.remainingCapacity());
547	>	q.add(one);
548		assertFalse(q.isEmpty());
549	+	assertTrue(q.contains(one));
550		q.clear();
551		assertTrue(q.isEmpty());
552		}
553
554	<	public void testContainsAll(){
555	<	LinkedBlockingQueue q = fullQueue(N);
556	<	LinkedBlockingQueue p = new LinkedBlockingQueue(N);
557	<	for (int i = 0; i < N; ++i) {
554	>	/**
555	>	* containsAll(c) is true when c contains a subset of elements
556	>	*/
557	>	public void testContainsAll() {
558	>	LinkedBlockingQueue q = populatedQueue(SIZE);
559	>	LinkedBlockingQueue p = new LinkedBlockingQueue(SIZE);
560	>	for (int i = 0; i < SIZE; ++i) {
561		assertTrue(q.containsAll(p));
562		assertFalse(p.containsAll(q));
563		p.add(new Integer(i));
#	Line 524 | Line 565 | public class LinkedBlockingQueueTest ext
565		assertTrue(p.containsAll(q));
566		}
567
568	<	public void testRetainAll(){
569	<	LinkedBlockingQueue q = fullQueue(N);
570	<	LinkedBlockingQueue p = fullQueue(N);
571	<	for (int i = 0; i < N; ++i) {
568	>	/**
569	>	* retainAll(c) retains only those elements of c and reports true if changed
570	>	*/
571	>	public void testRetainAll() {
572	>	LinkedBlockingQueue q = populatedQueue(SIZE);
573	>	LinkedBlockingQueue p = populatedQueue(SIZE);
574	>	for (int i = 0; i < SIZE; ++i) {
575		boolean changed = q.retainAll(p);
576		if (i == 0)
577		assertFalse(changed);
#	Line 535 | Line 579 | public class LinkedBlockingQueueTest ext
579		assertTrue(changed);
580
581		assertTrue(q.containsAll(p));
582	<	assertEquals(N-i, q.size());
582	>	assertEquals(SIZE - i, q.size());
583		p.remove();
584		}
585		}
586
587	<	public void testRemoveAll(){
588	<	for (int i = 1; i < N; ++i) {
589	<	LinkedBlockingQueue q = fullQueue(N);
590	<	LinkedBlockingQueue p = fullQueue(i);
587	>	/**
588	>	* removeAll(c) removes only those elements of c and reports true if changed
589	>	*/
590	>	public void testRemoveAll() {
591	>	for (int i = 1; i < SIZE; ++i) {
592	>	LinkedBlockingQueue q = populatedQueue(SIZE);
593	>	LinkedBlockingQueue p = populatedQueue(i);
594		assertTrue(q.removeAll(p));
595	<	assertEquals(N-i, q.size());
595	>	assertEquals(SIZE - i, q.size());
596		for (int j = 0; j < i; ++j) {
597	<	Integer I = (Integer)(p.remove());
598	<	assertFalse(q.contains(I));
597	>	Integer x = (Integer)(p.remove());
598	>	assertFalse(q.contains(x));
599		}
600		}
601		}
602
603	+	/**
604	+	* toArray contains all elements in FIFO order
605	+	*/
606	+	public void testToArray() {
607	+	LinkedBlockingQueue q = populatedQueue(SIZE);
608	+	Object[] o = q.toArray();
609	+	for (int i = 0; i < o.length; i++)
610	+	assertSame(o[i], q.poll());
611	+	}
612
613	<	public void testToArray(){
614	<	LinkedBlockingQueue q = fullQueue(N);
615	<	Object[] o = q.toArray();
616	<	try {
617	<	for(int i = 0; i < o.length; i++)
618	<	assertEquals(o[i], q.take());
619	<	} catch (InterruptedException e){
620	<	fail("Unexpected exception");
621	<	}
622	<	}
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	<	}
613	>	/**
614	>	* toArray(a) contains all elements in FIFO order
615	>	*/
616	>	public void testToArray2() throws InterruptedException {
617	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
618	>	Integer[] ints = new Integer[SIZE];
619	>	Integer[] array = q.toArray(ints);
620	>	assertSame(ints, array);
621	>	for (int i = 0; i < ints.length; i++)
622	>	assertSame(ints[i], q.poll());
623		}
624
625	<	public void testIteratorOrdering() {
625	>	/**
626	>	* toArray(incompatible array type) throws ArrayStoreException
627	>	*/
628	>	public void testToArray1_BadArg() {
629	>	LinkedBlockingQueue q = populatedQueue(SIZE);
630	>	try {
631	>	q.toArray(new String[10]);
632	>	shouldThrow();
633	>	} catch (ArrayStoreException success) {}
634	>	}
635
636	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
636	>	/**
637	>	* iterator iterates through all elements
638	>	*/
639	>	public void testIterator() throws InterruptedException {
640	>	LinkedBlockingQueue q = populatedQueue(SIZE);
641	>	Iterator it = q.iterator();
642	>	int i;
643	>	for (i = 0; it.hasNext(); i++)
644	>	assertTrue(q.contains(it.next()));
645	>	assertEquals(i, SIZE);
646	>	assertIteratorExhausted(it);
647	>
648	>	it = q.iterator();
649	>	for (i = 0; it.hasNext(); i++)
650	>	assertEquals(it.next(), q.take());
651	>	assertEquals(i, SIZE);
652	>	assertIteratorExhausted(it);
653	>	}
654
655	<	q.add(new Integer(1));
656	<	q.add(new Integer(2));
657	<	q.add(new Integer(3));
655	>	/**
656	>	* iterator of empty collection has no elements
657	>	*/
658	>	public void testEmptyIterator() {
659	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
660	>	}
661
662	<	assertEquals("queue should be full", 0, q.remainingCapacity());
662	>	/**
663	>	* iterator.remove removes current element
664	>	*/
665	>	public void testIteratorRemove() {
666	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
667	>	q.add(two);
668	>	q.add(one);
669	>	q.add(three);
670	>
671	>	Iterator it = q.iterator();
672	>	it.next();
673	>	it.remove();
674	>
675	>	it = q.iterator();
676	>	assertSame(it.next(), one);
677	>	assertSame(it.next(), three);
678	>	assertFalse(it.hasNext());
679	>	}
680
681	+	/**
682	+	* iterator ordering is FIFO
683	+	*/
684	+	public void testIteratorOrdering() {
685	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
686	+	q.add(one);
687	+	q.add(two);
688	+	q.add(three);
689	+	assertEquals(0, q.remainingCapacity());
690		int k = 0;
691		for (Iterator it = q.iterator(); it.hasNext();) {
692	<	int i = ((Integer)(it.next())).intValue();
605	<	assertEquals("items should come out in order", ++k, i);
692	>	assertEquals(++k, it.next());
693		}
694	<
608	<	assertEquals("should go through 3 elements", 3, k);
694	>	assertEquals(3, k);
695		}
696
697	<	public void testWeaklyConsistentIteration () {
698	<
697	>	/**
698	>	* Modifications do not cause iterators to fail
699	>	*/
700	>	public void testWeaklyConsistentIteration() {
701		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
702	<
703	<	q.add(new Integer(1));
704	<	q.add(new Integer(2));
705	<	q.add(new Integer(3));
706	<
707	<	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");
702	>	q.add(one);
703	>	q.add(two);
704	>	q.add(three);
705	>	for (Iterator it = q.iterator(); it.hasNext();) {
706	>	q.remove();
707	>	it.next();
708		}
709	<
629	<	assertEquals("queue should be empty again", 0, q.size());
709	>	assertEquals(0, q.size());
710		}
711
712	<
713	<	public void testToString(){
714	<	LinkedBlockingQueue q = fullQueue(N);
712	>	/**
713	>	* toString contains toStrings of elements
714	>	*/
715	>	public void testToString() {
716	>	LinkedBlockingQueue q = populatedQueue(SIZE);
717		String s = q.toString();
718	<	for (int i = 0; i < N; ++i) {
719	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
718	>	for (int i = 0; i < SIZE; ++i) {
719	>	assertTrue(s.contains(String.valueOf(i)));
720		}
721	<	}
640	<
721	>	}
722
723	+	/**
724	+	* offer transfers elements across Executor tasks
725	+	*/
726		public void testOfferInExecutor() {
643	–
727		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
728	<
729	<	q.add(new Integer(1));
730	<	q.add(new Integer(2));
731	<
732	<	ExecutorService executor = Executors.newFixedThreadPool(2);
733	<
734	<	executor.execute(new Runnable() {
735	<	public void run() {
736	<	assertFalse("offer should be rejected", q.offer(new Integer(3)));
737	<	try {
655	<	assertTrue("offer should be accepted", q.offer(new Integer(3), MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
728	>	q.add(one);
729	>	q.add(two);
730	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
731	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
732	>	try (PoolCleaner cleaner = cleaner(executor)) {
733	>	executor.execute(new CheckedRunnable() {
734	>	public void realRun() throws InterruptedException {
735	>	assertFalse(q.offer(three));
736	>	threadsStarted.await();
737	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
738		assertEquals(0, q.remainingCapacity());
739	<	}
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();
739	>	}});
740
741	+	executor.execute(new CheckedRunnable() {
742	+	public void realRun() throws InterruptedException {
743	+	threadsStarted.await();
744	+	assertSame(one, q.take());
745	+	}});
746	+	}
747		}
748
749	+	/**
750	+	* timed poll retrieves elements across Executor threads
751	+	*/
752		public void testPollInExecutor() {
681	–
753		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
754	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
755	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
756	+	try (PoolCleaner cleaner = cleaner(executor)) {
757	+	executor.execute(new CheckedRunnable() {
758	+	public void realRun() throws InterruptedException {
759	+	assertNull(q.poll());
760	+	threadsStarted.await();
761	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
762	+	checkEmpty(q);
763	+	}});
764
765	<	ExecutorService executor = Executors.newFixedThreadPool(2);
765	>	executor.execute(new CheckedRunnable() {
766	>	public void realRun() throws InterruptedException {
767	>	threadsStarted.await();
768	>	q.put(one);
769	>	}});
770	>	}
771	>	}
772
773	<	executor.execute(new Runnable() {
774	<	public void run() {
775	<	assertNull("poll should fail", q.poll());
776	<	try {
777	<	assertTrue(null != q.poll(MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
778	<	assertTrue(q.isEmpty());
779	<	}
780	<	catch (InterruptedException e) {
781	<	fail("should not be interrupted");
782	<	}
783	<	}
784	<	});
773	>	/**
774	>	* A deserialized serialized queue has same elements in same order
775	>	*/
776	>	public void testSerialization() throws Exception {
777	>	Queue x = populatedQueue(SIZE);
778	>	Queue y = serialClone(x);
779	>
780	>	assertNotSame(x, y);
781	>	assertEquals(x.size(), y.size());
782	>	assertEquals(x.toString(), y.toString());
783	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
784	>	while (!x.isEmpty()) {
785	>	assertFalse(y.isEmpty());
786	>	assertEquals(x.remove(), y.remove());
787	>	}
788	>	assertTrue(y.isEmpty());
789	>	}
790
791	<	executor.execute(new Runnable() {
792	<	public void run() {
793	<	try {
794	<	Thread.sleep(MEDIUM_DELAY_MS);
795	<	q.put(new Integer(1));
796	<	}
797	<	catch (InterruptedException e) {
798	<	fail("should not be interrupted");
799	<	}
800	<	}
801	<	});
802	<
803	<	executor.shutdown();
791	>	/**
792	>	* drainTo(c) empties queue into another collection c
793	>	*/
794	>	public void testDrainTo() {
795	>	LinkedBlockingQueue q = populatedQueue(SIZE);
796	>	ArrayList l = new ArrayList();
797	>	q.drainTo(l);
798	>	assertEquals(0, q.size());
799	>	assertEquals(SIZE, l.size());
800	>	for (int i = 0; i < SIZE; ++i)
801	>	assertEquals(l.get(i), new Integer(i));
802	>	q.add(zero);
803	>	q.add(one);
804	>	assertFalse(q.isEmpty());
805	>	assertTrue(q.contains(zero));
806	>	assertTrue(q.contains(one));
807	>	l.clear();
808	>	q.drainTo(l);
809	>	assertEquals(0, q.size());
810	>	assertEquals(2, l.size());
811	>	for (int i = 0; i < 2; ++i)
812	>	assertEquals(l.get(i), new Integer(i));
813	>	}
814
815	+	/**
816	+	* drainTo empties full queue, unblocking a waiting put.
817	+	*/
818	+	public void testDrainToWithActivePut() throws InterruptedException {
819	+	final LinkedBlockingQueue q = populatedQueue(SIZE);
820	+	Thread t = new Thread(new CheckedRunnable() {
821	+	public void realRun() throws InterruptedException {
822	+	q.put(new Integer(SIZE + 1));
823	+	}});
824	+
825	+	t.start();
826	+	ArrayList l = new ArrayList();
827	+	q.drainTo(l);
828	+	assertTrue(l.size() >= SIZE);
829	+	for (int i = 0; i < SIZE; ++i)
830	+	assertEquals(l.get(i), new Integer(i));
831	+	t.join();
832	+	assertTrue(q.size() + l.size() >= SIZE);
833		}
834
835	<	public void testSerialization() {
836	<	LinkedBlockingQueue q = fullQueue(N);
837	<
838	<	try {
839	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
840	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
841	<	out.writeObject(q);
842	<	out.close();
843	<
844	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
845	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
846	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
847	<	assertEquals(q.size(), r.size());
848	<	while (!q.isEmpty())
849	<	assertEquals(q.remove(), r.remove());
850	<	} catch(Exception e){
851	<	e.printStackTrace();
852	<	fail("unexpected exception");
835	>	/**
836	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
837	>	*/
838	>	public void testDrainToN() {
839	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
840	>	for (int i = 0; i < SIZE + 2; ++i) {
841	>	for (int j = 0; j < SIZE; j++)
842	>	assertTrue(q.offer(new Integer(j)));
843	>	ArrayList l = new ArrayList();
844	>	q.drainTo(l, i);
845	>	int k = (i < SIZE) ? i : SIZE;
846	>	assertEquals(k, l.size());
847	>	assertEquals(SIZE - k, q.size());
848	>	for (int j = 0; j < k; ++j)
849	>	assertEquals(l.get(j), new Integer(j));
850	>	do {} while (q.poll() != null);
851	>	}
852	>	}
853	>
854	>	/**
855	>	* remove(null), contains(null) always return false
856	>	*/
857	>	public void testNeverContainsNull() {
858	>	Collection<?>[] qs = {
859	>	new LinkedBlockingQueue<Object>(),
860	>	populatedQueue(2),
861	>	};
862	>
863	>	for (Collection<?> q : qs) {
864	>	assertFalse(q.contains(null));
865	>	assertFalse(q.remove(null));
866		}
867		}
868

Diff Legend

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