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.16 by jsr166, Sat Nov 21 02:33:20 2009 UTC vs.
Revision 1.56 by jsr166, Wed Dec 31 20:17:39 2014 UTC

#	Line 1 | Line 1
1		/*
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/licenses/publicdomain
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.*;
9		import static java.util.concurrent.TimeUnit.MILLISECONDS;
10	<	import java.io.*;
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	>	junit.textui.TestRunner.run(suite());
41		}
42
43		public static Test suite() {
44	<	return new TestSuite(LinkedBlockingQueueTest.class);
44	>	return newTestSuite(LinkedBlockingQueueTest.class,
45	>	new Unbounded().testSuite(),
46	>	new Bounded().testSuite());
47		}
48
25	–
49		/**
50	<	* Create a queue of given size containing consecutive
50	>	* Returns a new queue of given size containing consecutive
51		* Integers 0 ... n.
52		*/
53	<	private LinkedBlockingQueue populatedQueue(int n) {
54	<	LinkedBlockingQueue q = new LinkedBlockingQueue(n);
53	>	private LinkedBlockingQueue<Integer> populatedQueue(int n) {
54	>	LinkedBlockingQueue<Integer> q =
55	>	new LinkedBlockingQueue<Integer>(n);
56		assertTrue(q.isEmpty());
57		for (int i = 0; i < n; i++)
58		assertTrue(q.offer(new Integer(i)));
#	Line 48 | Line 72 | public class LinkedBlockingQueueTest ext
72		}
73
74		/**
75	<	* Constructor throws IAE if  capacity argument nonpositive
75	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
76		*/
77		public void testConstructor2() {
78		try {
79	<	LinkedBlockingQueue q = new LinkedBlockingQueue(0);
79	>	new LinkedBlockingQueue(0);
80		shouldThrow();
81	<	}
58	<	catch (IllegalArgumentException success) {}
81	>	} catch (IllegalArgumentException success) {}
82		}
83
84		/**
85	<	* Initializing from null Collection throws NPE
85	>	* Initializing from null Collection throws NullPointerException
86		*/
87		public void testConstructor3() {
88		try {
89	<	LinkedBlockingQueue q = new LinkedBlockingQueue(null);
89	>	new LinkedBlockingQueue(null);
90		shouldThrow();
91	<	}
69	<	catch (NullPointerException success) {}
91	>	} catch (NullPointerException success) {}
92		}
93
94		/**
95	<	* Initializing from Collection of null elements throws NPE
95	>	* Initializing from Collection of null elements throws NullPointerException
96		*/
97		public void testConstructor4() {
98	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
99		try {
100	<	Integer[] ints = new Integer[SIZE];
78	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
100	>	new LinkedBlockingQueue(elements);
101		shouldThrow();
102	<	}
81	<	catch (NullPointerException success) {}
102	>	} catch (NullPointerException success) {}
103		}
104
105		/**
106	<	* Initializing from Collection with some null elements throws NPE
106	>	* Initializing from Collection with some null elements throws
107	>	* NullPointerException
108		*/
109		public void testConstructor5() {
110	+	Integer[] ints = new Integer[SIZE];
111	+	for (int i = 0; i < SIZE-1; ++i)
112	+	ints[i] = new Integer(i);
113	+	Collection<Integer> elements = Arrays.asList(ints);
114		try {
115	<	Integer[] ints = new Integer[SIZE];
90	<	for (int i = 0; i < SIZE-1; ++i)
91	<	ints[i] = new Integer(i);
92	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
115	>	new LinkedBlockingQueue(elements);
116		shouldThrow();
117	<	}
95	<	catch (NullPointerException success) {}
117	>	} catch (NullPointerException success) {}
118		}
119
120		/**
121		* Queue contains all elements of collection used to initialize
122		*/
123		public void testConstructor6() {
124	<	try {
125	<	Integer[] ints = new Integer[SIZE];
126	<	for (int i = 0; i < SIZE; ++i)
127	<	ints[i] = new Integer(i);
128	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
129	<	for (int i = 0; i < SIZE; ++i)
108	<	assertEquals(ints[i], q.poll());
109	<	}
110	<	finally {}
124	>	Integer[] ints = new Integer[SIZE];
125	>	for (int i = 0; i < SIZE; ++i)
126	>	ints[i] = new Integer(i);
127	>	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
128	>	for (int i = 0; i < SIZE; ++i)
129	>	assertEquals(ints[i], q.poll());
130		}
131
132		/**
#	Line 143 | Line 162 | public class LinkedBlockingQueueTest ext
162		}
163
164		/**
146	–	* offer(null) throws NPE
147	–	*/
148	–	public void testOfferNull() {
149	–	try {
150	–	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
151	–	q.offer(null);
152	–	shouldThrow();
153	–	} catch (NullPointerException success) { }
154	–	}
155	–
156	–	/**
157	–	* add(null) throws NPE
158	–	*/
159	–	public void testAddNull() {
160	–	try {
161	–	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
162	–	q.add(null);
163	–	shouldThrow();
164	–	} catch (NullPointerException success) { }
165	–	}
166	–
167	–	/**
165		* Offer succeeds if not full; fails if full
166		*/
167		public void testOffer() {
#	Line 174 | Line 171 | public class LinkedBlockingQueueTest ext
171		}
172
173		/**
174	<	* add succeeds if not full; throws ISE if full
174	>	* add succeeds if not full; throws IllegalStateException if full
175		*/
176		public void testAdd() {
177	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
178	+	for (int i = 0; i < SIZE; ++i)
179	+	assertTrue(q.add(new Integer(i)));
180	+	assertEquals(0, q.remainingCapacity());
181		try {
181	–	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
182	–	for (int i = 0; i < SIZE; ++i) {
183	–	assertTrue(q.add(new Integer(i)));
184	–	}
185	–	assertEquals(0, q.remainingCapacity());
182		q.add(new Integer(SIZE));
187	–	} catch (IllegalStateException success) {
188	–	}
189	–	}
190	–
191	–	/**
192	–	* addAll(null) throws NPE
193	–	*/
194	–	public void testAddAll1() {
195	–	try {
196	–	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
197	–	q.addAll(null);
183		shouldThrow();
184	<	}
200	<	catch (NullPointerException success) {}
184	>	} catch (IllegalStateException success) {}
185		}
186
187		/**
188	<	* addAll(this) throws IAE
188	>	* addAll(this) throws IllegalArgumentException
189		*/
190		public void testAddAllSelf() {
191	+	LinkedBlockingQueue q = populatedQueue(SIZE);
192		try {
208	–	LinkedBlockingQueue q = populatedQueue(SIZE);
193		q.addAll(q);
194		shouldThrow();
195	<	}
212	<	catch (IllegalArgumentException success) {}
195	>	} catch (IllegalArgumentException success) {}
196		}
197
198		/**
216	–	* addAll of a collection with null elements throws NPE
217	–	*/
218	–	public void testAddAll2() {
219	–	try {
220	–	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
221	–	Integer[] ints = new Integer[SIZE];
222	–	q.addAll(Arrays.asList(ints));
223	–	shouldThrow();
224	–	}
225	–	catch (NullPointerException success) {}
226	–	}
227	–	/**
199		* addAll of a collection with any null elements throws NPE after
200		* possibly adding some elements
201		*/
202		public void testAddAll3() {
203	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
204	+	Integer[] ints = new Integer[SIZE];
205	+	for (int i = 0; i < SIZE-1; ++i)
206	+	ints[i] = new Integer(i);
207	+	Collection<Integer> elements = Arrays.asList(ints);
208		try {
209	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
234	<	Integer[] ints = new Integer[SIZE];
235	<	for (int i = 0; i < SIZE-1; ++i)
236	<	ints[i] = new Integer(i);
237	<	q.addAll(Arrays.asList(ints));
209	>	q.addAll(elements);
210		shouldThrow();
211	<	}
240	<	catch (NullPointerException success) {}
211	>	} catch (NullPointerException success) {}
212		}
213	+
214		/**
215	<	* addAll throws ISE if not enough room
215	>	* addAll throws IllegalStateException if not enough room
216		*/
217		public void testAddAll4() {
218	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1);
219	+	Integer[] ints = new Integer[SIZE];
220	+	for (int i = 0; i < SIZE; ++i)
221	+	ints[i] = new Integer(i);
222	+	Collection<Integer> elements = Arrays.asList(ints);
223		try {
224	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
248	<	Integer[] ints = new Integer[SIZE];
249	<	for (int i = 0; i < SIZE; ++i)
250	<	ints[i] = new Integer(i);
251	<	q.addAll(Arrays.asList(ints));
224	>	q.addAll(elements);
225		shouldThrow();
226	<	}
254	<	catch (IllegalStateException success) {}
226	>	} catch (IllegalStateException success) {}
227		}
228	+
229		/**
230		* Queue contains all elements, in traversal order, of successful addAll
231		*/
232		public void testAddAll5() {
233	<	try {
234	<	Integer[] empty = new Integer[0];
235	<	Integer[] ints = new Integer[SIZE];
236	<	for (int i = 0; i < SIZE; ++i)
237	<	ints[i] = new Integer(i);
238	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
239	<	assertFalse(q.addAll(Arrays.asList(empty)));
240	<	assertTrue(q.addAll(Arrays.asList(ints)));
241	<	for (int i = 0; i < SIZE; ++i)
269	<	assertEquals(ints[i], q.poll());
270	<	}
271	<	finally {}
233	>	Integer[] empty = new Integer[0];
234	>	Integer[] ints = new Integer[SIZE];
235	>	for (int i = 0; i < SIZE; ++i)
236	>	ints[i] = new Integer(i);
237	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
238	>	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
244		/**
275	–	* put(null) throws NPE
276	–	*/
277	–	public void testPutNull() {
278	–	try {
279	–	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
280	–	q.put(null);
281	–	shouldThrow();
282	–	}
283	–	catch (NullPointerException success) {
284	–	}
285	–	catch (InterruptedException ie) {
286	–	unexpectedException();
287	–	}
288	–	}
289	–
290	–	/**
245		* all elements successfully put are contained
246		*/
247	<	public void testPut() {
248	<	try {
249	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
250	<	for (int i = 0; i < SIZE; ++i) {
251	<	Integer I = new Integer(i);
252	<	q.put(I);
299	<	assertTrue(q.contains(I));
300	<	}
301	<	assertEquals(0, q.remainingCapacity());
302	<	}
303	<	catch (InterruptedException ie) {
304	<	unexpectedException();
247	>	public void testPut() throws InterruptedException {
248	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
249	>	for (int i = 0; i < SIZE; ++i) {
250	>	Integer x = new Integer(i);
251	>	q.put(x);
252	>	assertTrue(q.contains(x));
253		}
254	+	assertEquals(0, q.remainingCapacity());
255		}
256
257		/**
258		* put blocks interruptibly if full
259		*/
260	<	public void testBlockingPut() {
261	<	Thread t = new Thread(new Runnable() {
262	<	public void run() {
263	<	int added = 0;
264	<	try {
265	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
266	<	for (int i = 0; i < SIZE; ++i) {
267	<	q.put(new Integer(i));
268	<	++added;
269	<	}
270	<	q.put(new Integer(SIZE));
271	<	threadShouldThrow();
272	<	} catch (InterruptedException ie) {
273	<	threadAssertEquals(added, SIZE);
274	<	}
275	<	}});
276	<	t.start();
277	<	try {
278	<	Thread.sleep(SHORT_DELAY_MS);
279	<	t.interrupt();
280	<	t.join();
281	<	}
282	<	catch (InterruptedException ie) {
283	<	unexpectedException();
284	<	}
260	>	public void testBlockingPut() throws InterruptedException {
261	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
262	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
263	>	Thread t = newStartedThread(new CheckedRunnable() {
264	>	public void realRun() throws InterruptedException {
265	>	for (int i = 0; i < SIZE; ++i)
266	>	q.put(i);
267	>	assertEquals(SIZE, q.size());
268	>	assertEquals(0, q.remainingCapacity());
269	>
270	>	Thread.currentThread().interrupt();
271	>	try {
272	>	q.put(99);
273	>	shouldThrow();
274	>	} catch (InterruptedException success) {}
275	>	assertFalse(Thread.interrupted());
276	>
277	>	pleaseInterrupt.countDown();
278	>	try {
279	>	q.put(99);
280	>	shouldThrow();
281	>	} catch (InterruptedException success) {}
282	>	assertFalse(Thread.interrupted());
283	>	}});
284	>
285	>	await(pleaseInterrupt);
286	>	assertThreadStaysAlive(t);
287	>	t.interrupt();
288	>	awaitTermination(t);
289	>	assertEquals(SIZE, q.size());
290	>	assertEquals(0, q.remainingCapacity());
291		}
292
293		/**
294	<	* put blocks waiting for take when full
294	>	* put blocks interruptibly waiting for take when full
295		*/
296	<	public void testPutWithTake() {
296	>	public void testPutWithTake() throws InterruptedException {
297	>	final int capacity = 2;
298		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
299	<	Thread t = new Thread(new Runnable() {
300	<	public void run() {
301	<	int added = 0;
302	<	try {
303	<	q.put(new Object());
304	<	++added;
305	<	q.put(new Object());
306	<	++added;
307	<	q.put(new Object());
308	<	++added;
309	<	q.put(new Object());
310	<	++added;
311	<	threadShouldThrow();
312	<	} catch (InterruptedException e) {
313	<	threadAssertTrue(added >= 2);
314	<	}
315	<	}
316	<	});
317	<	try {
318	<	t.start();
319	<	Thread.sleep(SHORT_DELAY_MS);
320	<	q.take();
321	<	t.interrupt();
322	<	t.join();
323	<	} catch (Exception e) {
324	<	unexpectedException();
369	<	}
299	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
300	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
301	>	Thread t = newStartedThread(new CheckedRunnable() {
302	>	public void realRun() throws InterruptedException {
303	>	for (int i = 0; i < capacity; i++)
304	>	q.put(i);
305	>	pleaseTake.countDown();
306	>	q.put(86);
307	>
308	>	pleaseInterrupt.countDown();
309	>	try {
310	>	q.put(99);
311	>	shouldThrow();
312	>	} catch (InterruptedException success) {}
313	>	assertFalse(Thread.interrupted());
314	>	}});
315	>
316	>	await(pleaseTake);
317	>	assertEquals(0, q.remainingCapacity());
318	>	assertEquals(0, q.take());
319	>
320	>	await(pleaseInterrupt);
321	>	assertThreadStaysAlive(t);
322	>	t.interrupt();
323	>	awaitTermination(t);
324	>	assertEquals(0, q.remainingCapacity());
325		}
326
327		/**
#	Line 374 | Line 329 | public class LinkedBlockingQueueTest ext
329		*/
330		public void testTimedOffer() {
331		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
332	<	Thread t = new Thread(new Runnable() {
333	<	public void run() {
334	<	try {
335	<	q.put(new Object());
336	<	q.put(new Object());
337	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS));
338	<	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
339	<	threadShouldThrow();
340	<	} catch (InterruptedException success) {}
341	<	}
342	<	});
343	<
344	<	try {
345	<	t.start();
346	<	Thread.sleep(SMALL_DELAY_MS);
347	<	t.interrupt();
348	<	t.join();
349	<	} catch (Exception e) {
350	<	unexpectedException();
396	<	}
332	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
333	>	Thread t = newStartedThread(new CheckedRunnable() {
334	>	public void realRun() throws InterruptedException {
335	>	q.put(new Object());
336	>	q.put(new Object());
337	>	long startTime = System.nanoTime();
338	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
339	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
340	>	pleaseInterrupt.countDown();
341	>	try {
342	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
343	>	shouldThrow();
344	>	} catch (InterruptedException success) {}
345	>	}});
346	>
347	>	await(pleaseInterrupt);
348	>	assertThreadStaysAlive(t);
349	>	t.interrupt();
350	>	awaitTermination(t);
351		}
352
353		/**
354		* take retrieves elements in FIFO order
355		*/
356	<	public void testTake() {
357	<	try {
358	<	LinkedBlockingQueue q = populatedQueue(SIZE);
359	<	for (int i = 0; i < SIZE; ++i) {
406	<	assertEquals(i, ((Integer)q.take()).intValue());
407	<	}
408	<	} catch (InterruptedException e) {
409	<	unexpectedException();
356	>	public void testTake() throws InterruptedException {
357	>	LinkedBlockingQueue q = populatedQueue(SIZE);
358	>	for (int i = 0; i < SIZE; ++i) {
359	>	assertEquals(i, q.take());
360		}
361		}
362
363		/**
364	<	* take blocks interruptibly when empty
364	>	* Take removes existing elements until empty, then blocks interruptibly
365		*/
366	<	public void testTakeFromEmpty() {
367	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
368	<	Thread t = new Thread(new Runnable() {
369	<	public void run() {
370	<	try {
371	<	q.take();
372	<	threadShouldThrow();
423	<	} catch (InterruptedException success) { }
366	>	public void testBlockingTake() throws InterruptedException {
367	>	final BlockingQueue q = populatedQueue(SIZE);
368	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
369	>	Thread t = newStartedThread(new CheckedRunnable() {
370	>	public void realRun() throws InterruptedException {
371	>	for (int i = 0; i < SIZE; ++i) {
372	>	assertEquals(i, q.take());
373		}
425	–	});
426	–	try {
427	–	t.start();
428	–	Thread.sleep(SHORT_DELAY_MS);
429	–	t.interrupt();
430	–	t.join();
431	–	} catch (Exception e) {
432	–	unexpectedException();
433	–	}
434	–	}
374
375	<	/**
376	<	* Take removes existing elements until empty, then blocks interruptibly
377	<	*/
378	<	public void testBlockingTake() {
379	<	Thread t = new Thread(new Runnable() {
380	<	public void run() {
442	<	try {
443	<	LinkedBlockingQueue q = populatedQueue(SIZE);
444	<	for (int i = 0; i < SIZE; ++i) {
445	<	assertEquals(i, ((Integer)q.take()).intValue());
446	<	}
447	<	q.take();
448	<	threadShouldThrow();
449	<	} catch (InterruptedException success) {
450	<	}
451	<	}});
452	<	t.start();
453	<	try {
454	<	Thread.sleep(SHORT_DELAY_MS);
455	<	t.interrupt();
456	<	t.join();
457	<	}
458	<	catch (InterruptedException ie) {
459	<	unexpectedException();
460	<	}
461	<	}
375	>	Thread.currentThread().interrupt();
376	>	try {
377	>	q.take();
378	>	shouldThrow();
379	>	} catch (InterruptedException success) {}
380	>	assertFalse(Thread.interrupted());
381
382	+	pleaseInterrupt.countDown();
383	+	try {
384	+	q.take();
385	+	shouldThrow();
386	+	} catch (InterruptedException success) {}
387	+	assertFalse(Thread.interrupted());
388	+	}});
389	+
390	+	await(pleaseInterrupt);
391	+	assertThreadStaysAlive(t);
392	+	t.interrupt();
393	+	awaitTermination(t);
394	+	}
395
396		/**
397		* poll succeeds unless empty
#	Line 467 | Line 399 | public class LinkedBlockingQueueTest ext
399		public void testPoll() {
400		LinkedBlockingQueue q = populatedQueue(SIZE);
401		for (int i = 0; i < SIZE; ++i) {
402	<	assertEquals(i, ((Integer)q.poll()).intValue());
402	>	assertEquals(i, q.poll());
403		}
404		assertNull(q.poll());
405		}
406
407		/**
408	<	* timed pool with zero timeout succeeds when non-empty, else times out
408	>	* timed poll with zero timeout succeeds when non-empty, else times out
409		*/
410	<	public void testTimedPoll0() {
411	<	try {
412	<	LinkedBlockingQueue q = populatedQueue(SIZE);
413	<	for (int i = 0; i < SIZE; ++i) {
482	<	assertEquals(i, ((Integer)q.poll(0, MILLISECONDS)).intValue());
483	<	}
484	<	assertNull(q.poll(0, MILLISECONDS));
485	<	} catch (InterruptedException e) {
486	<	unexpectedException();
410	>	public void testTimedPoll0() throws InterruptedException {
411	>	LinkedBlockingQueue q = populatedQueue(SIZE);
412	>	for (int i = 0; i < SIZE; ++i) {
413	>	assertEquals(i, q.poll(0, MILLISECONDS));
414		}
415	+	assertNull(q.poll(0, MILLISECONDS));
416		}
417
418		/**
419	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
419	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
420		*/
421	<	public void testTimedPoll() {
422	<	try {
423	<	LinkedBlockingQueue q = populatedQueue(SIZE);
424	<	for (int i = 0; i < SIZE; ++i) {
425	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
426	<	}
427	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
428	<	} catch (InterruptedException e) {
429	<	unexpectedException();
430	<	}
421	>	public void testTimedPoll() throws InterruptedException {
422	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
423	>	for (int i = 0; i < SIZE; ++i) {
424	>	long startTime = System.nanoTime();
425	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
426	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
427	>	}
428	>	long startTime = System.nanoTime();
429	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
430	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
431	>	checkEmpty(q);
432		}
433
434		/**
435		* Interrupted timed poll throws InterruptedException instead of
436		* returning timeout status
437		*/
438	<	public void testInterruptedTimedPoll() {
439	<	Thread t = new Thread(new Runnable() {
440	<	public void run() {
441	<	try {
442	<	LinkedBlockingQueue q = populatedQueue(SIZE);
443	<	for (int i = 0; i < SIZE; ++i) {
444	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
445	<	}
446	<	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
518	<	} catch (InterruptedException success) {
519	<	}
520	<	}});
521	<	t.start();
522	<	try {
523	<	Thread.sleep(SHORT_DELAY_MS);
524	<	t.interrupt();
525	<	t.join();
526	<	}
527	<	catch (InterruptedException ie) {
528	<	unexpectedException();
529	<	}
530	<	}
531	<
532	<	/**
533	<	*  timed poll before a delayed offer fails; after offer succeeds;
534	<	*  on interruption throws
535	<	*/
536	<	public void testTimedPollWithOffer() {
537	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
538	<	Thread t = new Thread(new Runnable() {
539	<	public void run() {
540	<	try {
541	<	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
542	<	q.poll(LONG_DELAY_MS, MILLISECONDS);
543	<	q.poll(LONG_DELAY_MS, MILLISECONDS);
544	<	threadShouldThrow();
545	<	} catch (InterruptedException success) { }
438	>	public void testInterruptedTimedPoll() throws InterruptedException {
439	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
440	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
441	>	Thread t = newStartedThread(new CheckedRunnable() {
442	>	public void realRun() throws InterruptedException {
443	>	for (int i = 0; i < SIZE; ++i) {
444	>	long t0 = System.nanoTime();
445	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
446	>	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
447		}
448	<	});
449	<	try {
450	<	t.start();
451	<	Thread.sleep(SMALL_DELAY_MS);
452	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
453	<	t.interrupt();
454	<	t.join();
455	<	} catch (Exception e) {
456	<	unexpectedException();
457	<	}
448	>	long t0 = System.nanoTime();
449	>	aboutToWait.countDown();
450	>	try {
451	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
452	>	shouldThrow();
453	>	} catch (InterruptedException success) {
454	>	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
455	>	}
456	>	}});
457	>
458	>	aboutToWait.await();
459	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
460	>	t.interrupt();
461	>	awaitTermination(t, MEDIUM_DELAY_MS);
462	>	checkEmpty(q);
463		}
464
465		/**
#	Line 562 | Line 468 | public class LinkedBlockingQueueTest ext
468		public void testPeek() {
469		LinkedBlockingQueue q = populatedQueue(SIZE);
470		for (int i = 0; i < SIZE; ++i) {
471	<	assertEquals(i, ((Integer)q.peek()).intValue());
472	<	q.poll();
471	>	assertEquals(i, q.peek());
472	>	assertEquals(i, q.poll());
473		assertTrue(q.peek() == null ||
474	<	i != ((Integer)q.peek()).intValue());
474	>	!q.peek().equals(i));
475		}
476		assertNull(q.peek());
477		}
#	Line 576 | Line 482 | public class LinkedBlockingQueueTest ext
482		public void testElement() {
483		LinkedBlockingQueue q = populatedQueue(SIZE);
484		for (int i = 0; i < SIZE; ++i) {
485	<	assertEquals(i, ((Integer)q.element()).intValue());
486	<	q.poll();
485	>	assertEquals(i, q.element());
486	>	assertEquals(i, q.poll());
487		}
488		try {
489		q.element();
490		shouldThrow();
491	<	}
586	<	catch (NoSuchElementException success) {}
491	>	} catch (NoSuchElementException success) {}
492		}
493
494		/**
#	Line 592 | Line 497 | public class LinkedBlockingQueueTest ext
497		public void testRemove() {
498		LinkedBlockingQueue q = populatedQueue(SIZE);
499		for (int i = 0; i < SIZE; ++i) {
500	<	assertEquals(i, ((Integer)q.remove()).intValue());
500	>	assertEquals(i, q.remove());
501		}
502		try {
503		q.remove();
504		shouldThrow();
505	<	} catch (NoSuchElementException success) {
601	<	}
602	<	}
603	<
604	<	/**
605	<	* remove(x) removes x and returns true if present
606	<	*/
607	<	public void testRemoveElement() {
608	<	LinkedBlockingQueue q = populatedQueue(SIZE);
609	<	for (int i = 1; i < SIZE; i+=2) {
610	<	assertTrue(q.remove(new Integer(i)));
611	<	}
612	<	for (int i = 0; i < SIZE; i+=2) {
613	<	assertTrue(q.remove(new Integer(i)));
614	<	assertFalse(q.remove(new Integer(i+1)));
615	<	}
616	<	assertTrue(q.isEmpty());
505	>	} catch (NoSuchElementException success) {}
506		}
507
508		/**
509		* An add following remove(x) succeeds
510		*/
511	<	public void testRemoveElementAndAdd() {
512	<	try {
513	<	LinkedBlockingQueue q = new LinkedBlockingQueue();
514	<	assertTrue(q.add(new Integer(1)));
515	<	assertTrue(q.add(new Integer(2)));
516	<	assertTrue(q.remove(new Integer(1)));
517	<	assertTrue(q.remove(new Integer(2)));
518	<	assertTrue(q.add(new Integer(3)));
630	<	assertTrue(q.take() != null);
631	<	} catch (Exception e) {
632	<	unexpectedException();
633	<	}
511	>	public void testRemoveElementAndAdd() throws InterruptedException {
512	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
513	>	assertTrue(q.add(new Integer(1)));
514	>	assertTrue(q.add(new Integer(2)));
515	>	assertTrue(q.remove(new Integer(1)));
516	>	assertTrue(q.remove(new Integer(2)));
517	>	assertTrue(q.add(new Integer(3)));
518	>	assertNotNull(q.take());
519		}
520
521		/**
#	Line 704 | Line 589 | public class LinkedBlockingQueueTest ext
589		assertTrue(q.removeAll(p));
590		assertEquals(SIZE-i, q.size());
591		for (int j = 0; j < i; ++j) {
592	<	Integer I = (Integer)(p.remove());
593	<	assertFalse(q.contains(I));
592	>	Integer x = (Integer)(p.remove());
593	>	assertFalse(q.contains(x));
594		}
595		}
596		}
597
598		/**
599	<	* toArray contains all elements
599	>	* toArray contains all elements in FIFO order
600		*/
601		public void testToArray() {
602		LinkedBlockingQueue q = populatedQueue(SIZE);
603		Object[] o = q.toArray();
719	–	try {
604		for (int i = 0; i < o.length; i++)
605	<	assertEquals(o[i], q.take());
722	<	} catch (InterruptedException e) {
723	<	unexpectedException();
724	<	}
605	>	assertSame(o[i], q.poll());
606		}
607
608		/**
609	<	* toArray(a) contains all elements
609	>	* toArray(a) contains all elements in FIFO order
610		*/
611	<	public void testToArray2() {
612	<	LinkedBlockingQueue q = populatedQueue(SIZE);
611	>	public void testToArray2() throws InterruptedException {
612	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
613		Integer[] ints = new Integer[SIZE];
614	<	ints = (Integer[])q.toArray(ints);
615	<	try {
616	<	for (int i = 0; i < ints.length; i++)
617	<	assertEquals(ints[i], q.take());
737	<	} catch (InterruptedException e) {
738	<	unexpectedException();
739	<	}
740	<	}
741	<
742	<	/**
743	<	* toArray(null) throws NPE
744	<	*/
745	<	public void testToArray_BadArg() {
746	<	try {
747	<	LinkedBlockingQueue q = populatedQueue(SIZE);
748	<	Object o[] = q.toArray(null);
749	<	shouldThrow();
750	<	} catch (NullPointerException success) {}
614	>	Integer[] array = q.toArray(ints);
615	>	assertSame(ints, array);
616	>	for (int i = 0; i < ints.length; i++)
617	>	assertSame(ints[i], q.poll());
618		}
619
620		/**
621	<	* toArray with incompatible array type throws CCE
621	>	* toArray(incompatible array type) throws ArrayStoreException
622		*/
623		public void testToArray1_BadArg() {
624	+	LinkedBlockingQueue q = populatedQueue(SIZE);
625		try {
626	<	LinkedBlockingQueue q = populatedQueue(SIZE);
759	<	Object o[] = q.toArray(new String[10] );
626	>	q.toArray(new String[10]);
627		shouldThrow();
628	<	} catch (ArrayStoreException  success) {}
628	>	} catch (ArrayStoreException success) {}
629		}
630
764	–
631		/**
632		* iterator iterates through all elements
633		*/
634	<	public void testIterator() {
634	>	public void testIterator() throws InterruptedException {
635		LinkedBlockingQueue q = populatedQueue(SIZE);
636		Iterator it = q.iterator();
637	<	try {
638	<	while (it.hasNext()) {
773	<	assertEquals(it.next(), q.take());
774	<	}
775	<	} catch (InterruptedException e) {
776	<	unexpectedException();
637	>	while (it.hasNext()) {
638	>	assertEquals(it.next(), q.take());
639		}
640		}
641
642		/**
643		* iterator.remove removes current element
644		*/
645	<	public void testIteratorRemove () {
645	>	public void testIteratorRemove() {
646		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
647		q.add(two);
648		q.add(one);
#	Line 791 | Line 653 | public class LinkedBlockingQueueTest ext
653		it.remove();
654
655		it = q.iterator();
656	<	assertEquals(it.next(), one);
657	<	assertEquals(it.next(), three);
656	>	assertSame(it.next(), one);
657	>	assertSame(it.next(), three);
658		assertFalse(it.hasNext());
659		}
660
799	–
661		/**
662		* iterator ordering is FIFO
663		*/
#	Line 808 | Line 669 | public class LinkedBlockingQueueTest ext
669		assertEquals(0, q.remainingCapacity());
670		int k = 0;
671		for (Iterator it = q.iterator(); it.hasNext();) {
672	<	int i = ((Integer)(it.next())).intValue();
812	<	assertEquals(++k, i);
672	>	assertEquals(++k, it.next());
673		}
674		assertEquals(3, k);
675		}
#	Line 817 | Line 677 | public class LinkedBlockingQueueTest ext
677		/**
678		* Modifications do not cause iterators to fail
679		*/
680	<	public void testWeaklyConsistentIteration () {
680	>	public void testWeaklyConsistentIteration() {
681		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
682		q.add(one);
683		q.add(two);
684		q.add(three);
685	<	try {
686	<	for (Iterator it = q.iterator(); it.hasNext();) {
687	<	q.remove();
828	<	it.next();
829	<	}
830	<	}
831	<	catch (ConcurrentModificationException e) {
832	<	unexpectedException();
685	>	for (Iterator it = q.iterator(); it.hasNext();) {
686	>	q.remove();
687	>	it.next();
688		}
689		assertEquals(0, q.size());
690		}
691
837	–
692		/**
693		* toString contains toStrings of elements
694		*/
#	Line 842 | Line 696 | public class LinkedBlockingQueueTest ext
696		LinkedBlockingQueue q = populatedQueue(SIZE);
697		String s = q.toString();
698		for (int i = 0; i < SIZE; ++i) {
699	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
699	>	assertTrue(s.contains(String.valueOf(i)));
700		}
701		}
702
849	–
703		/**
704		* offer transfers elements across Executor tasks
705		*/
#	Line 855 | Line 708 | public class LinkedBlockingQueueTest ext
708		q.add(one);
709		q.add(two);
710		ExecutorService executor = Executors.newFixedThreadPool(2);
711	<	executor.execute(new Runnable() {
712	<	public void run() {
713	<	threadAssertFalse(q.offer(three));
714	<	try {
715	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
716	<	threadAssertEquals(0, q.remainingCapacity());
717	<	}
718	<	catch (InterruptedException e) {
719	<	threadUnexpectedException();
720	<	}
721	<	}
722	<	});
723	<
724	<	executor.execute(new Runnable() {
872	<	public void run() {
873	<	try {
874	<	Thread.sleep(SMALL_DELAY_MS);
875	<	threadAssertEquals(one, q.take());
876	<	}
877	<	catch (InterruptedException e) {
878	<	threadUnexpectedException();
879	<	}
880	<	}
881	<	});
711	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
712	>	executor.execute(new CheckedRunnable() {
713	>	public void realRun() throws InterruptedException {
714	>	assertFalse(q.offer(three));
715	>	threadsStarted.await();
716	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
717	>	assertEquals(0, q.remainingCapacity());
718	>	}});
719	>
720	>	executor.execute(new CheckedRunnable() {
721	>	public void realRun() throws InterruptedException {
722	>	threadsStarted.await();
723	>	assertSame(one, q.take());
724	>	}});
725
726		joinPool(executor);
727		}
728
729		/**
730	<	* poll retrieves elements across Executor threads
730	>	* timed poll retrieves elements across Executor threads
731		*/
732		public void testPollInExecutor() {
733		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
734	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
735		ExecutorService executor = Executors.newFixedThreadPool(2);
736	<	executor.execute(new Runnable() {
737	<	public void run() {
738	<	threadAssertNull(q.poll());
739	<	try {
740	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
741	<	threadAssertTrue(q.isEmpty());
742	<	}
743	<	catch (InterruptedException e) {
744	<	threadUnexpectedException();
745	<	}
746	<	}
747	<	});
748	<
905	<	executor.execute(new Runnable() {
906	<	public void run() {
907	<	try {
908	<	Thread.sleep(SMALL_DELAY_MS);
909	<	q.put(one);
910	<	}
911	<	catch (InterruptedException e) {
912	<	threadUnexpectedException();
913	<	}
914	<	}
915	<	});
736	>	executor.execute(new CheckedRunnable() {
737	>	public void realRun() throws InterruptedException {
738	>	assertNull(q.poll());
739	>	threadsStarted.await();
740	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
741	>	checkEmpty(q);
742	>	}});
743	>
744	>	executor.execute(new CheckedRunnable() {
745	>	public void realRun() throws InterruptedException {
746	>	threadsStarted.await();
747	>	q.put(one);
748	>	}});
749
750		joinPool(executor);
751		}
#	Line 920 | Line 753 | public class LinkedBlockingQueueTest ext
753		/**
754		* A deserialized serialized queue has same elements in same order
755		*/
756	<	public void testSerialization() {
757	<	LinkedBlockingQueue q = populatedQueue(SIZE);
758	<
759	<	try {
760	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
761	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
762	<	out.writeObject(q);
763	<	out.close();
764	<
765	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
766	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
934	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
935	<	assertEquals(q.size(), r.size());
936	<	while (!q.isEmpty())
937	<	assertEquals(q.remove(), r.remove());
938	<	} catch (Exception e) {
939	<	unexpectedException();
940	<	}
941	<	}
942	<
943	<	/**
944	<	* drainTo(null) throws NPE
945	<	*/
946	<	public void testDrainToNull() {
947	<	LinkedBlockingQueue q = populatedQueue(SIZE);
948	<	try {
949	<	q.drainTo(null);
950	<	shouldThrow();
951	<	} catch (NullPointerException success) {
952	<	}
953	<	}
954	<
955	<	/**
956	<	* drainTo(this) throws IAE
957	<	*/
958	<	public void testDrainToSelf() {
959	<	LinkedBlockingQueue q = populatedQueue(SIZE);
960	<	try {
961	<	q.drainTo(q);
962	<	shouldThrow();
963	<	} catch (IllegalArgumentException success) {
756	>	public void testSerialization() throws Exception {
757	>	Queue x = populatedQueue(SIZE);
758	>	Queue y = serialClone(x);
759	>
760	>	assertNotSame(x, y);
761	>	assertEquals(x.size(), y.size());
762	>	assertEquals(x.toString(), y.toString());
763	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
764	>	while (!x.isEmpty()) {
765	>	assertFalse(y.isEmpty());
766	>	assertEquals(x.remove(), y.remove());
767		}
768	+	assertTrue(y.isEmpty());
769		}
770
771		/**
#	Line 971 | Line 775 | public class LinkedBlockingQueueTest ext
775		LinkedBlockingQueue q = populatedQueue(SIZE);
776		ArrayList l = new ArrayList();
777		q.drainTo(l);
778	<	assertEquals(q.size(), 0);
779	<	assertEquals(l.size(), SIZE);
778	>	assertEquals(0, q.size());
779	>	assertEquals(SIZE, l.size());
780		for (int i = 0; i < SIZE; ++i)
781		assertEquals(l.get(i), new Integer(i));
782		q.add(zero);
#	Line 982 | Line 786 | public class LinkedBlockingQueueTest ext
786		assertTrue(q.contains(one));
787		l.clear();
788		q.drainTo(l);
789	<	assertEquals(q.size(), 0);
790	<	assertEquals(l.size(), 2);
789	>	assertEquals(0, q.size());
790	>	assertEquals(2, l.size());
791		for (int i = 0; i < 2; ++i)
792		assertEquals(l.get(i), new Integer(i));
793		}
#	Line 991 | Line 795 | public class LinkedBlockingQueueTest ext
795		/**
796		* drainTo empties full queue, unblocking a waiting put.
797		*/
798	<	public void testDrainToWithActivePut() {
798	>	public void testDrainToWithActivePut() throws InterruptedException {
799		final LinkedBlockingQueue q = populatedQueue(SIZE);
800	<	Thread t = new Thread(new Runnable() {
801	<	public void run() {
802	<	try {
803	<	q.put(new Integer(SIZE+1));
1000	<	} catch (InterruptedException ie) {
1001	<	threadUnexpectedException();
1002	<	}
1003	<	}
1004	<	});
1005	<	try {
1006	<	t.start();
1007	<	ArrayList l = new ArrayList();
1008	<	q.drainTo(l);
1009	<	assertTrue(l.size() >= SIZE);
1010	<	for (int i = 0; i < SIZE; ++i)
1011	<	assertEquals(l.get(i), new Integer(i));
1012	<	t.join();
1013	<	assertTrue(q.size() + l.size() >= SIZE);
1014	<	} catch (Exception e) {
1015	<	unexpectedException();
1016	<	}
1017	<	}
1018	<
1019	<	/**
1020	<	* drainTo(null, n) throws NPE
1021	<	*/
1022	<	public void testDrainToNullN() {
1023	<	LinkedBlockingQueue q = populatedQueue(SIZE);
1024	<	try {
1025	<	q.drainTo(null, 0);
1026	<	shouldThrow();
1027	<	} catch (NullPointerException success) {
1028	<	}
1029	<	}
800	>	Thread t = new Thread(new CheckedRunnable() {
801	>	public void realRun() throws InterruptedException {
802	>	q.put(new Integer(SIZE+1));
803	>	}});
804
805	<	/**
806	<	* drainTo(this, n) throws IAE
807	<	*/
808	<	public void testDrainToSelfN() {
809	<	LinkedBlockingQueue q = populatedQueue(SIZE);
810	<	try {
811	<	q.drainTo(q, 0);
812	<	shouldThrow();
1039	<	} catch (IllegalArgumentException success) {
1040	<	}
805	>	t.start();
806	>	ArrayList l = new ArrayList();
807	>	q.drainTo(l);
808	>	assertTrue(l.size() >= SIZE);
809	>	for (int i = 0; i < SIZE; ++i)
810	>	assertEquals(l.get(i), new Integer(i));
811	>	t.join();
812	>	assertTrue(q.size() + l.size() >= SIZE);
813		}
814
815		/**
816	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
816	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
817		*/
818		public void testDrainToN() {
819		LinkedBlockingQueue q = new LinkedBlockingQueue();
#	Line 1050 | Line 822 | public class LinkedBlockingQueueTest ext
822		assertTrue(q.offer(new Integer(j)));
823		ArrayList l = new ArrayList();
824		q.drainTo(l, i);
825	<	int k = (i < SIZE)? i : SIZE;
826	<	assertEquals(l.size(), k);
827	<	assertEquals(q.size(), SIZE-k);
825	>	int k = (i < SIZE) ? i : SIZE;
826	>	assertEquals(k, l.size());
827	>	assertEquals(SIZE-k, q.size());
828		for (int j = 0; j < k; ++j)
829		assertEquals(l.get(j), new Integer(j));
830	<	while (q.poll() != null) ;
830	>	do {} while (q.poll() != null);
831	>	}
832	>	}
833	>
834	>	/**
835	>	* remove(null), contains(null) always return false
836	>	*/
837	>	public void testNeverContainsNull() {
838	>	Collection<?>[] qs = {
839	>	new LinkedBlockingQueue<Object>(),
840	>	populatedQueue(2),
841	>	};
842	>
843	>	for (Collection<?> q : qs) {
844	>	assertFalse(q.contains(null));
845	>	assertFalse(q.remove(null));
846		}
847		}
848

Diff Legend

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