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

Diff Legend

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