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

Diff Legend

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