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.73 by jsr166, Sun May 14 01:30:34 2017 UTC

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

Diff Legend

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