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.72 by jsr166, Sun May 14 00:56:43 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	+	assertThreadBlocks(t, Thread.State.WAITING);
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	+	assertThreadBlocks(t, Thread.State.WAITING);
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	+	assertFalse(Thread.interrupted());
355	+	}});
356	+
357	+	await(pleaseInterrupt);
358	+	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
359	+	t.interrupt();
360	+	awaitTermination(t);
361	+	}
362
363	<	public void testPoll(){
364	<	LinkedBlockingQueue q = fullQueue(N);
365	<	for (int i = 0; i < N; ++i) {
366	<	assertEquals(i, ((Integer)q.poll()).intValue());
363	>	/**
364	>	* take retrieves elements in FIFO order
365	>	*/
366	>	public void testTake() throws InterruptedException {
367	>	LinkedBlockingQueue q = populatedQueue(SIZE);
368	>	for (int i = 0; i < SIZE; ++i) {
369	>	assertEquals(i, q.take());
370		}
373	–	assertNull(q.poll());
371		}
372
373	<	public void testTimedPoll0() {
374	<	try {
375	<	LinkedBlockingQueue q = fullQueue(N);
376	<	for (int i = 0; i < N; ++i) {
377	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
378	<	}
379	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
380	<	} catch (InterruptedException e){
381	<	fail("Unexpected exception");
382	<	}
373	>	/**
374	>	* Take removes existing elements until empty, then blocks interruptibly
375	>	*/
376	>	public void testBlockingTake() throws InterruptedException {
377	>	final BlockingQueue q = populatedQueue(SIZE);
378	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
379	>	Thread t = newStartedThread(new CheckedRunnable() {
380	>	public void realRun() throws InterruptedException {
381	>	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
382	>
383	>	Thread.currentThread().interrupt();
384	>	try {
385	>	q.take();
386	>	shouldThrow();
387	>	} catch (InterruptedException success) {}
388	>	assertFalse(Thread.interrupted());
389	>
390	>	pleaseInterrupt.countDown();
391	>	try {
392	>	q.take();
393	>	shouldThrow();
394	>	} catch (InterruptedException success) {}
395	>	assertFalse(Thread.interrupted());
396	>	}});
397	>
398	>	await(pleaseInterrupt);
399	>	assertThreadBlocks(t, Thread.State.WAITING);
400	>	t.interrupt();
401	>	awaitTermination(t);
402		}
403
404	<	public void testTimedPoll() {
405	<	try {
406	<	LinkedBlockingQueue q = fullQueue(N);
407	<	for (int i = 0; i < N; ++i) {
408	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
409	<	}
410	<	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();
404	>	/**
405	>	* poll succeeds unless empty
406	>	*/
407	>	public void testPoll() {
408	>	LinkedBlockingQueue q = populatedQueue(SIZE);
409	>	for (int i = 0; i < SIZE; ++i) {
410	>	assertEquals(i, q.poll());
411		}
412	<	catch (InterruptedException ie) {
413	<	fail("Unexpected exception");
412	>	assertNull(q.poll());
413	>	}
414	>
415	>	/**
416	>	* timed poll with zero timeout succeeds when non-empty, else times out
417	>	*/
418	>	public void testTimedPoll0() throws InterruptedException {
419	>	LinkedBlockingQueue q = populatedQueue(SIZE);
420	>	for (int i = 0; i < SIZE; ++i) {
421	>	assertEquals(i, q.poll(0, MILLISECONDS));
422		}
423	+	assertNull(q.poll(0, MILLISECONDS));
424		}
425
426	<	public void testTimedPollWithOffer(){
427	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
428	<	Thread t = new Thread(new Runnable() {
429	<	public void run(){
430	<	try {
431	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
432	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
433	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
434	<	fail("Should block");
435	<	} catch (InterruptedException success) { }
426	>	/**
427	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
428	>	*/
429	>	public void testTimedPoll() throws InterruptedException {
430	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
431	>	for (int i = 0; i < SIZE; ++i) {
432	>	long startTime = System.nanoTime();
433	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
434	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
435	>	}
436	>	long startTime = System.nanoTime();
437	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
438	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
439	>	checkEmpty(q);
440	>	}
441	>
442	>	/**
443	>	* Interrupted timed poll throws InterruptedException instead of
444	>	* returning timeout status
445	>	*/
446	>	public void testInterruptedTimedPoll() throws InterruptedException {
447	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
448	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
449	>	Thread t = newStartedThread(new CheckedRunnable() {
450	>	public void realRun() throws InterruptedException {
451	>	long startTime = System.nanoTime();
452	>	for (int i = 0; i < SIZE; ++i) {
453	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
454		}
455	<	});
456	<	try {
457	<	t.start();
458	<	Thread.sleep(SHORT_DELAY_MS * 2);
459	<	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
460	<	t.interrupt();
461	<	t.join();
462	<	} catch (Exception e){
463	<	fail("Unexpected exception");
464	<	}
465	<	}
466	<
467	<
468	<	public void testPeek(){
469	<	LinkedBlockingQueue q = fullQueue(N);
470	<	for (int i = 0; i < N; ++i) {
471	<	assertEquals(i, ((Integer)q.peek()).intValue());
472	<	q.poll();
455	>
456	>	pleaseInterrupt.countDown();
457	>	try {
458	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
459	>	shouldThrow();
460	>	} catch (InterruptedException success) {}
461	>	assertFalse(Thread.interrupted());
462	>
463	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
464	>	}});
465	>
466	>	await(pleaseInterrupt);
467	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
468	>	t.interrupt();
469	>	awaitTermination(t);
470	>	checkEmpty(q);
471	>	}
472	>
473	>	/**
474	>	* peek returns next element, or null if empty
475	>	*/
476	>	public void testPeek() {
477	>	LinkedBlockingQueue q = populatedQueue(SIZE);
478	>	for (int i = 0; i < SIZE; ++i) {
479	>	assertEquals(i, q.peek());
480	>	assertEquals(i, q.poll());
481		assertTrue(q.peek() == null ||
482	<	i != ((Integer)q.peek()).intValue());
482	>	!q.peek().equals(i));
483		}
484	<	assertNull(q.peek());
484	>	assertNull(q.peek());
485		}
486
487	<	public void testElement(){
488	<	LinkedBlockingQueue q = fullQueue(N);
489	<	for (int i = 0; i < N; ++i) {
490	<	assertEquals(i, ((Integer)q.element()).intValue());
491	<	q.poll();
487	>	/**
488	>	* element returns next element, or throws NSEE if empty
489	>	*/
490	>	public void testElement() {
491	>	LinkedBlockingQueue q = populatedQueue(SIZE);
492	>	for (int i = 0; i < SIZE; ++i) {
493	>	assertEquals(i, q.element());
494	>	assertEquals(i, q.poll());
495		}
496		try {
497		q.element();
498	<	fail("no such element");
499	<	}
468	<	catch (NoSuchElementException success) {}
498	>	shouldThrow();
499	>	} catch (NoSuchElementException success) {}
500		}
501
502	<	public void testRemove(){
503	<	LinkedBlockingQueue q = fullQueue(N);
504	<	for (int i = 0; i < N; ++i) {
505	<	assertEquals(i, ((Integer)q.remove()).intValue());
502	>	/**
503	>	* remove removes next element, or throws NSEE if empty
504	>	*/
505	>	public void testRemove() {
506	>	LinkedBlockingQueue q = populatedQueue(SIZE);
507	>	for (int i = 0; i < SIZE; ++i) {
508	>	assertEquals(i, q.remove());
509		}
510		try {
511		q.remove();
512	<	fail("remove should throw");
513	<	} catch (NoSuchElementException success){
480	<	}
512	>	shouldThrow();
513	>	} catch (NoSuchElementException success) {}
514		}
515
516	<	public void testRemoveElement(){
517	<	LinkedBlockingQueue q = fullQueue(N);
518	<	for (int i = 1; i < N; i+=2) {
519	<	assertTrue(q.remove(new Integer(i)));
520	<	}
521	<	for (int i = 0; i < N; i+=2) {
522	<	assertTrue(q.remove(new Integer(i)));
523	<	assertFalse(q.remove(new Integer(i+1)));
524	<	}
525	<	assertTrue(q.isEmpty());
516	>	/**
517	>	* An add following remove(x) succeeds
518	>	*/
519	>	public void testRemoveElementAndAdd() throws InterruptedException {
520	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
521	>	assertTrue(q.add(new Integer(1)));
522	>	assertTrue(q.add(new Integer(2)));
523	>	assertTrue(q.remove(new Integer(1)));
524	>	assertTrue(q.remove(new Integer(2)));
525	>	assertTrue(q.add(new Integer(3)));
526	>	assertNotNull(q.take());
527		}
528	<
529	<	public void testContains(){
530	<	LinkedBlockingQueue q = fullQueue(N);
531	<	for (int i = 0; i < N; ++i) {
528	>
529	>	/**
530	>	* contains(x) reports true when elements added but not yet removed
531	>	*/
532	>	public void testContains() {
533	>	LinkedBlockingQueue q = populatedQueue(SIZE);
534	>	for (int i = 0; i < SIZE; ++i) {
535		assertTrue(q.contains(new Integer(i)));
536		q.poll();
537		assertFalse(q.contains(new Integer(i)));
538		}
539		}
540
541	<	public void testClear(){
542	<	LinkedBlockingQueue q = fullQueue(N);
541	>	/**
542	>	* clear removes all elements
543	>	*/
544	>	public void testClear() {
545	>	LinkedBlockingQueue q = populatedQueue(SIZE);
546		q.clear();
547		assertTrue(q.isEmpty());
548		assertEquals(0, q.size());
549	<	assertEquals(N, q.remainingCapacity());
550	<	q.add(new Integer(1));
549	>	assertEquals(SIZE, q.remainingCapacity());
550	>	q.add(one);
551		assertFalse(q.isEmpty());
552	+	assertTrue(q.contains(one));
553		q.clear();
554		assertTrue(q.isEmpty());
555		}
556
557	<	public void testContainsAll(){
558	<	LinkedBlockingQueue q = fullQueue(N);
559	<	LinkedBlockingQueue p = new LinkedBlockingQueue(N);
560	<	for (int i = 0; i < N; ++i) {
557	>	/**
558	>	* containsAll(c) is true when c contains a subset of elements
559	>	*/
560	>	public void testContainsAll() {
561	>	LinkedBlockingQueue q = populatedQueue(SIZE);
562	>	LinkedBlockingQueue p = new LinkedBlockingQueue(SIZE);
563	>	for (int i = 0; i < SIZE; ++i) {
564		assertTrue(q.containsAll(p));
565		assertFalse(p.containsAll(q));
566		p.add(new Integer(i));
#	Line 524 | Line 568 | public class LinkedBlockingQueueTest ext
568		assertTrue(p.containsAll(q));
569		}
570
571	<	public void testRetainAll(){
572	<	LinkedBlockingQueue q = fullQueue(N);
573	<	LinkedBlockingQueue p = fullQueue(N);
574	<	for (int i = 0; i < N; ++i) {
571	>	/**
572	>	* retainAll(c) retains only those elements of c and reports true if changed
573	>	*/
574	>	public void testRetainAll() {
575	>	LinkedBlockingQueue q = populatedQueue(SIZE);
576	>	LinkedBlockingQueue p = populatedQueue(SIZE);
577	>	for (int i = 0; i < SIZE; ++i) {
578		boolean changed = q.retainAll(p);
579		if (i == 0)
580		assertFalse(changed);
#	Line 535 | Line 582 | public class LinkedBlockingQueueTest ext
582		assertTrue(changed);
583
584		assertTrue(q.containsAll(p));
585	<	assertEquals(N-i, q.size());
585	>	assertEquals(SIZE - i, q.size());
586		p.remove();
587		}
588		}
589
590	<	public void testRemoveAll(){
591	<	for (int i = 1; i < N; ++i) {
592	<	LinkedBlockingQueue q = fullQueue(N);
593	<	LinkedBlockingQueue p = fullQueue(i);
590	>	/**
591	>	* removeAll(c) removes only those elements of c and reports true if changed
592	>	*/
593	>	public void testRemoveAll() {
594	>	for (int i = 1; i < SIZE; ++i) {
595	>	LinkedBlockingQueue q = populatedQueue(SIZE);
596	>	LinkedBlockingQueue p = populatedQueue(i);
597		assertTrue(q.removeAll(p));
598	<	assertEquals(N-i, q.size());
598	>	assertEquals(SIZE - i, q.size());
599		for (int j = 0; j < i; ++j) {
600	<	Integer I = (Integer)(p.remove());
601	<	assertFalse(q.contains(I));
600	>	Integer x = (Integer)(p.remove());
601	>	assertFalse(q.contains(x));
602		}
603		}
604		}
605
606	+	/**
607	+	* toArray contains all elements in FIFO order
608	+	*/
609	+	public void testToArray() {
610	+	LinkedBlockingQueue q = populatedQueue(SIZE);
611	+	Object[] o = q.toArray();
612	+	for (int i = 0; i < o.length; i++)
613	+	assertSame(o[i], q.poll());
614	+	}
615
616	<	public void testToArray(){
617	<	LinkedBlockingQueue q = fullQueue(N);
618	<	Object[] o = q.toArray();
619	<	try {
620	<	for(int i = 0; i < o.length; i++)
621	<	assertEquals(o[i], q.take());
622	<	} catch (InterruptedException e){
623	<	fail("Unexpected exception");
624	<	}
625	<	}
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	<	}
616	>	/**
617	>	* toArray(a) contains all elements in FIFO order
618	>	*/
619	>	public void testToArray2() throws InterruptedException {
620	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
621	>	Integer[] ints = new Integer[SIZE];
622	>	Integer[] array = q.toArray(ints);
623	>	assertSame(ints, array);
624	>	for (int i = 0; i < ints.length; i++)
625	>	assertSame(ints[i], q.poll());
626		}
627
628	<	public void testIteratorOrdering() {
628	>	/**
629	>	* toArray(incompatible array type) throws ArrayStoreException
630	>	*/
631	>	public void testToArray1_BadArg() {
632	>	LinkedBlockingQueue q = populatedQueue(SIZE);
633	>	try {
634	>	q.toArray(new String[10]);
635	>	shouldThrow();
636	>	} catch (ArrayStoreException success) {}
637	>	}
638
639	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
639	>	/**
640	>	* iterator iterates through all elements
641	>	*/
642	>	public void testIterator() throws InterruptedException {
643	>	LinkedBlockingQueue q = populatedQueue(SIZE);
644	>	Iterator it = q.iterator();
645	>	int i;
646	>	for (i = 0; it.hasNext(); i++)
647	>	assertTrue(q.contains(it.next()));
648	>	assertEquals(i, SIZE);
649	>	assertIteratorExhausted(it);
650	>
651	>	it = q.iterator();
652	>	for (i = 0; it.hasNext(); i++)
653	>	assertEquals(it.next(), q.take());
654	>	assertEquals(i, SIZE);
655	>	assertIteratorExhausted(it);
656	>	}
657
658	<	q.add(new Integer(1));
659	<	q.add(new Integer(2));
660	<	q.add(new Integer(3));
658	>	/**
659	>	* iterator of empty collection has no elements
660	>	*/
661	>	public void testEmptyIterator() {
662	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
663	>	}
664
665	<	assertEquals("queue should be full", 0, q.remainingCapacity());
665	>	/**
666	>	* iterator.remove removes current element
667	>	*/
668	>	public void testIteratorRemove() {
669	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
670	>	q.add(two);
671	>	q.add(one);
672	>	q.add(three);
673	>
674	>	Iterator it = q.iterator();
675	>	it.next();
676	>	it.remove();
677	>
678	>	it = q.iterator();
679	>	assertSame(it.next(), one);
680	>	assertSame(it.next(), three);
681	>	assertFalse(it.hasNext());
682	>	}
683
684	+	/**
685	+	* iterator ordering is FIFO
686	+	*/
687	+	public void testIteratorOrdering() {
688	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
689	+	q.add(one);
690	+	q.add(two);
691	+	q.add(three);
692	+	assertEquals(0, q.remainingCapacity());
693		int k = 0;
694		for (Iterator it = q.iterator(); it.hasNext();) {
695	<	int i = ((Integer)(it.next())).intValue();
605	<	assertEquals("items should come out in order", ++k, i);
695	>	assertEquals(++k, it.next());
696		}
697	<
608	<	assertEquals("should go through 3 elements", 3, k);
697	>	assertEquals(3, k);
698		}
699
700	<	public void testWeaklyConsistentIteration () {
701	<
700	>	/**
701	>	* Modifications do not cause iterators to fail
702	>	*/
703	>	public void testWeaklyConsistentIteration() {
704		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
705	<
706	<	q.add(new Integer(1));
707	<	q.add(new Integer(2));
708	<	q.add(new Integer(3));
709	<
710	<	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");
705	>	q.add(one);
706	>	q.add(two);
707	>	q.add(three);
708	>	for (Iterator it = q.iterator(); it.hasNext();) {
709	>	q.remove();
710	>	it.next();
711		}
712	<
629	<	assertEquals("queue should be empty again", 0, q.size());
712	>	assertEquals(0, q.size());
713		}
714
715	<
716	<	public void testToString(){
717	<	LinkedBlockingQueue q = fullQueue(N);
715	>	/**
716	>	* toString contains toStrings of elements
717	>	*/
718	>	public void testToString() {
719	>	LinkedBlockingQueue q = populatedQueue(SIZE);
720		String s = q.toString();
721	<	for (int i = 0; i < N; ++i) {
722	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
721	>	for (int i = 0; i < SIZE; ++i) {
722	>	assertTrue(s.contains(String.valueOf(i)));
723		}
724	<	}
640	<
724	>	}
725
726	+	/**
727	+	* offer transfers elements across Executor tasks
728	+	*/
729		public void testOfferInExecutor() {
643	–
730		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
731	<
732	<	q.add(new Integer(1));
733	<	q.add(new Integer(2));
734	<
735	<	ExecutorService executor = Executors.newFixedThreadPool(2);
736	<
737	<	executor.execute(new Runnable() {
738	<	public void run() {
739	<	assertFalse("offer should be rejected", q.offer(new Integer(3)));
740	<	try {
655	<	assertTrue("offer should be accepted", q.offer(new Integer(3), MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
731	>	q.add(one);
732	>	q.add(two);
733	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
734	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
735	>	try (PoolCleaner cleaner = cleaner(executor)) {
736	>	executor.execute(new CheckedRunnable() {
737	>	public void realRun() throws InterruptedException {
738	>	assertFalse(q.offer(three));
739	>	threadsStarted.await();
740	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
741		assertEquals(0, q.remainingCapacity());
742	<	}
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();
742	>	}});
743
744	+	executor.execute(new CheckedRunnable() {
745	+	public void realRun() throws InterruptedException {
746	+	threadsStarted.await();
747	+	assertSame(one, q.take());
748	+	}});
749	+	}
750		}
751
752	+	/**
753	+	* timed poll retrieves elements across Executor threads
754	+	*/
755		public void testPollInExecutor() {
681	–
756		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
757	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
758	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
759	+	try (PoolCleaner cleaner = cleaner(executor)) {
760	+	executor.execute(new CheckedRunnable() {
761	+	public void realRun() throws InterruptedException {
762	+	assertNull(q.poll());
763	+	threadsStarted.await();
764	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
765	+	checkEmpty(q);
766	+	}});
767
768	<	ExecutorService executor = Executors.newFixedThreadPool(2);
768	>	executor.execute(new CheckedRunnable() {
769	>	public void realRun() throws InterruptedException {
770	>	threadsStarted.await();
771	>	q.put(one);
772	>	}});
773	>	}
774	>	}
775
776	<	executor.execute(new Runnable() {
777	<	public void run() {
778	<	assertNull("poll should fail", q.poll());
779	<	try {
780	<	assertTrue(null != q.poll(MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
781	<	assertTrue(q.isEmpty());
782	<	}
783	<	catch (InterruptedException e) {
784	<	fail("should not be interrupted");
785	<	}
786	<	}
787	<	});
776	>	/**
777	>	* A deserialized serialized queue has same elements in same order
778	>	*/
779	>	public void testSerialization() throws Exception {
780	>	Queue x = populatedQueue(SIZE);
781	>	Queue y = serialClone(x);
782	>
783	>	assertNotSame(x, y);
784	>	assertEquals(x.size(), y.size());
785	>	assertEquals(x.toString(), y.toString());
786	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
787	>	while (!x.isEmpty()) {
788	>	assertFalse(y.isEmpty());
789	>	assertEquals(x.remove(), y.remove());
790	>	}
791	>	assertTrue(y.isEmpty());
792	>	}
793
794	<	executor.execute(new Runnable() {
795	<	public void run() {
796	<	try {
797	<	Thread.sleep(MEDIUM_DELAY_MS);
798	<	q.put(new Integer(1));
799	<	}
800	<	catch (InterruptedException e) {
801	<	fail("should not be interrupted");
802	<	}
803	<	}
804	<	});
805	<
806	<	executor.shutdown();
794	>	/**
795	>	* drainTo(c) empties queue into another collection c
796	>	*/
797	>	public void testDrainTo() {
798	>	LinkedBlockingQueue q = populatedQueue(SIZE);
799	>	ArrayList l = new ArrayList();
800	>	q.drainTo(l);
801	>	assertEquals(0, q.size());
802	>	assertEquals(SIZE, l.size());
803	>	for (int i = 0; i < SIZE; ++i)
804	>	assertEquals(l.get(i), new Integer(i));
805	>	q.add(zero);
806	>	q.add(one);
807	>	assertFalse(q.isEmpty());
808	>	assertTrue(q.contains(zero));
809	>	assertTrue(q.contains(one));
810	>	l.clear();
811	>	q.drainTo(l);
812	>	assertEquals(0, q.size());
813	>	assertEquals(2, l.size());
814	>	for (int i = 0; i < 2; ++i)
815	>	assertEquals(l.get(i), new Integer(i));
816	>	}
817	>
818	>	/**
819	>	* drainTo empties full queue, unblocking a waiting put.
820	>	*/
821	>	public void testDrainToWithActivePut() throws InterruptedException {
822	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
823	>	Thread t = new Thread(new CheckedRunnable() {
824	>	public void realRun() throws InterruptedException {
825	>	q.put(new Integer(SIZE + 1));
826	>	}});
827
828	+	t.start();
829	+	ArrayList l = new ArrayList();
830	+	q.drainTo(l);
831	+	assertTrue(l.size() >= SIZE);
832	+	for (int i = 0; i < SIZE; ++i)
833	+	assertEquals(l.get(i), new Integer(i));
834	+	t.join();
835	+	assertTrue(q.size() + l.size() >= SIZE);
836	+	}
837	+
838	+	/**
839	+	* drainTo(c, n) empties first min(n, size) elements of queue into c
840	+	*/
841	+	public void testDrainToN() {
842	+	LinkedBlockingQueue q = new LinkedBlockingQueue();
843	+	for (int i = 0; i < SIZE + 2; ++i) {
844	+	for (int j = 0; j < SIZE; j++)
845	+	assertTrue(q.offer(new Integer(j)));
846	+	ArrayList l = new ArrayList();
847	+	q.drainTo(l, i);
848	+	int k = (i < SIZE) ? i : SIZE;
849	+	assertEquals(k, l.size());
850	+	assertEquals(SIZE - k, q.size());
851	+	for (int j = 0; j < k; ++j)
852	+	assertEquals(l.get(j), new Integer(j));
853	+	do {} while (q.poll() != null);
854	+	}
855		}
856
857	<	public void testSerialization() {
858	<	LinkedBlockingQueue q = fullQueue(N);
859	<
860	<	try {
861	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
862	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
863	<	out.writeObject(q);
864	<	out.close();
865	<
866	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
867	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
868	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
727	<	assertEquals(q.size(), r.size());
728	<	while (!q.isEmpty())
729	<	assertEquals(q.remove(), r.remove());
730	<	} catch(Exception e){
731	<	e.printStackTrace();
732	<	fail("unexpected exception");
857	>	/**
858	>	* remove(null), contains(null) always return false
859	>	*/
860	>	public void testNeverContainsNull() {
861	>	Collection<?>[] qs = {
862	>	new LinkedBlockingQueue<Object>(),
863	>	populatedQueue(2),
864	>	};
865	>
866	>	for (Collection<?> q : qs) {
867	>	assertFalse(q.contains(null));
868	>	assertFalse(q.remove(null));
869		}
870		}
871

Diff Legend

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