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.5 by dl, Thu Sep 25 11:02:41 2003 UTC vs.
Revision 1.51 by jsr166, Tue Feb 21 02:04:17 2012 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.*;
10	>	import java.util.Arrays;
11	>	import java.util.ArrayList;
12	>	import java.util.Collection;
13	>	import java.util.Iterator;
14	>	import java.util.NoSuchElementException;
15	>	import java.util.Queue;
16	>	import java.util.concurrent.BlockingQueue;
17	>	import java.util.concurrent.CountDownLatch;
18	>	import java.util.concurrent.LinkedBlockingQueue;
19	>	import java.util.concurrent.Executors;
20	>	import java.util.concurrent.ExecutorService;
21	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
22
23		public class LinkedBlockingQueueTest extends JSR166TestCase {
24
25	+	public static class Unbounded extends BlockingQueueTest {
26	+	protected BlockingQueue emptyCollection() {
27	+	return new LinkedBlockingQueue();
28	+	}
29	+	}
30	+
31	+	public static class Bounded extends BlockingQueueTest {
32	+	protected BlockingQueue emptyCollection() {
33	+	return new LinkedBlockingQueue(SIZE);
34	+	}
35	+	}
36	+
37		public static void main(String[] args) {
38	<	junit.textui.TestRunner.run (suite());
38	>	junit.textui.TestRunner.run(suite());
39		}
40
41		public static Test suite() {
42	<	return new TestSuite(LinkedBlockingQueueTest.class);
42	>	return newTestSuite(LinkedBlockingQueueTest.class,
43	>	new Unbounded().testSuite(),
44	>	new Bounded().testSuite());
45		}
46
23	–
47		/**
48	<	* Create a queue of given size containing consecutive
48	>	* Returns a new queue of given size containing consecutive
49		* Integers 0 ... n.
50		*/
51	<	private LinkedBlockingQueue populatedQueue(int n) {
52	<	LinkedBlockingQueue q = new LinkedBlockingQueue(n);
51	>	private LinkedBlockingQueue<Integer> populatedQueue(int n) {
52	>	LinkedBlockingQueue<Integer> q =
53	>	new LinkedBlockingQueue<Integer>(n);
54		assertTrue(q.isEmpty());
55	<	for(int i = 0; i < n; i++)
56	<	assertTrue(q.offer(new Integer(i)));
55	>	for (int i = 0; i < n; i++)
56	>	assertTrue(q.offer(new Integer(i)));
57		assertFalse(q.isEmpty());
58		assertEquals(0, q.remainingCapacity());
59	<	assertEquals(n, q.size());
59	>	assertEquals(n, q.size());
60		return q;
61		}
62	<
62	>
63		/**
64		* A new queue has the indicated capacity, or Integer.MAX_VALUE if
65		* none given
#	Line 46 | Line 70 | public class LinkedBlockingQueueTest ext
70		}
71
72		/**
73	<	* Constructor throws IAE if  capacity argument nonpositive
73	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
74		*/
75		public void testConstructor2() {
76		try {
77	<	LinkedBlockingQueue q = new LinkedBlockingQueue(0);
77	>	new LinkedBlockingQueue(0);
78		shouldThrow();
79	<	}
56	<	catch (IllegalArgumentException success) {}
79	>	} catch (IllegalArgumentException success) {}
80		}
81
82		/**
83	<	* Initializing from null Collection throws NPE
83	>	* Initializing from null Collection throws NullPointerException
84		*/
85		public void testConstructor3() {
86		try {
87	<	LinkedBlockingQueue q = new LinkedBlockingQueue(null);
87	>	new LinkedBlockingQueue(null);
88		shouldThrow();
89	<	}
67	<	catch (NullPointerException success) {}
89	>	} catch (NullPointerException success) {}
90		}
91
92		/**
93	<	* Initializing from Collection of null elements throws NPE
93	>	* Initializing from Collection of null elements throws NullPointerException
94		*/
95		public void testConstructor4() {
96	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
97		try {
98	<	Integer[] ints = new Integer[SIZE];
76	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
98	>	new LinkedBlockingQueue(elements);
99		shouldThrow();
100	<	}
79	<	catch (NullPointerException success) {}
100	>	} catch (NullPointerException success) {}
101		}
102
103		/**
104	<	* Initializing from Collection with some null elements throws NPE
104	>	* Initializing from Collection with some null elements throws
105	>	* NullPointerException
106		*/
107		public void testConstructor5() {
108	+	Integer[] ints = new Integer[SIZE];
109	+	for (int i = 0; i < SIZE-1; ++i)
110	+	ints[i] = new Integer(i);
111	+	Collection<Integer> elements = Arrays.asList(ints);
112		try {
113	<	Integer[] ints = new Integer[SIZE];
88	<	for (int i = 0; i < SIZE-1; ++i)
89	<	ints[i] = new Integer(i);
90	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
113	>	new LinkedBlockingQueue(elements);
114		shouldThrow();
115	<	}
93	<	catch (NullPointerException success) {}
115	>	} catch (NullPointerException success) {}
116		}
117
118		/**
119		* Queue contains all elements of collection used to initialize
120		*/
121		public void testConstructor6() {
122	<	try {
123	<	Integer[] ints = new Integer[SIZE];
124	<	for (int i = 0; i < SIZE; ++i)
125	<	ints[i] = new Integer(i);
126	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
127	<	for (int i = 0; i < SIZE; ++i)
106	<	assertEquals(ints[i], q.poll());
107	<	}
108	<	finally {}
122	>	Integer[] ints = new Integer[SIZE];
123	>	for (int i = 0; i < SIZE; ++i)
124	>	ints[i] = new Integer(i);
125	>	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
126	>	for (int i = 0; i < SIZE; ++i)
127	>	assertEquals(ints[i], q.poll());
128		}
129
130		/**
#	Line 141 | Line 160 | public class LinkedBlockingQueueTest ext
160		}
161
162		/**
144	–	* offer(null) throws NPE
145	–	*/
146	–	public void testOfferNull() {
147	–	try {
148	–	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
149	–	q.offer(null);
150	–	shouldThrow();
151	–	} catch (NullPointerException success) { }
152	–	}
153	–
154	–	/**
163		* Offer succeeds if not full; fails if full
164		*/
165		public void testOffer() {
#	Line 161 | Line 169 | public class LinkedBlockingQueueTest ext
169		}
170
171		/**
172	<	* add succeeds if not full; throws ISE if full
172	>	* add succeeds if not full; throws IllegalStateException if full
173		*/
174		public void testAdd() {
175	<	try {
176	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
177	<	for (int i = 0; i < SIZE; ++i) {
178	<	assertTrue(q.add(new Integer(i)));
171	<	}
172	<	assertEquals(0, q.remainingCapacity());
173	<	q.add(new Integer(SIZE));
174	<	} catch (IllegalStateException success){
175	<	}
176	<	}
177	<
178	<	/**
179	<	* addAll(null) throws NPE
180	<	*/
181	<	public void testAddAll1() {
175	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
176	>	for (int i = 0; i < SIZE; ++i)
177	>	assertTrue(q.add(new Integer(i)));
178	>	assertEquals(0, q.remainingCapacity());
179		try {
180	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
184	<	q.addAll(null);
180	>	q.add(new Integer(SIZE));
181		shouldThrow();
182	<	}
187	<	catch (NullPointerException success) {}
182	>	} catch (IllegalStateException success) {}
183		}
184	+
185		/**
186	<	* addAll of a collection with null elements throws NPE
186	>	* addAll(this) throws IllegalArgumentException
187		*/
188	<	public void testAddAll2() {
188	>	public void testAddAllSelf() {
189	>	LinkedBlockingQueue q = populatedQueue(SIZE);
190		try {
191	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
195	<	Integer[] ints = new Integer[SIZE];
196	<	q.addAll(Arrays.asList(ints));
191	>	q.addAll(q);
192		shouldThrow();
193	<	}
199	<	catch (NullPointerException success) {}
193	>	} catch (IllegalArgumentException success) {}
194		}
195	+
196		/**
197		* addAll of a collection with any null elements throws NPE after
198		* possibly adding some elements
199		*/
200		public void testAddAll3() {
201	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
202	+	Integer[] ints = new Integer[SIZE];
203	+	for (int i = 0; i < SIZE-1; ++i)
204	+	ints[i] = new Integer(i);
205	+	Collection<Integer> elements = Arrays.asList(ints);
206		try {
207	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
208	<	Integer[] ints = new Integer[SIZE];
209	<	for (int i = 0; i < SIZE-1; ++i)
210	<	ints[i] = new Integer(i);
211	<	q.addAll(Arrays.asList(ints));
207	>	q.addAll(elements);
208		shouldThrow();
209	<	}
214	<	catch (NullPointerException success) {}
209	>	} catch (NullPointerException success) {}
210		}
211	+
212		/**
213	<	* addAll throws ISE if not enough room
213	>	* addAll throws IllegalStateException if not enough room
214		*/
215		public void testAddAll4() {
216	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1);
217	+	Integer[] ints = new Integer[SIZE];
218	+	for (int i = 0; i < SIZE; ++i)
219	+	ints[i] = new Integer(i);
220	+	Collection<Integer> elements = Arrays.asList(ints);
221		try {
222	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
222	<	Integer[] ints = new Integer[SIZE];
223	<	for (int i = 0; i < SIZE; ++i)
224	<	ints[i] = new Integer(i);
225	<	q.addAll(Arrays.asList(ints));
222	>	q.addAll(elements);
223		shouldThrow();
224	<	}
228	<	catch (IllegalStateException success) {}
224	>	} catch (IllegalStateException success) {}
225		}
226	+
227		/**
228		* Queue contains all elements, in traversal order, of successful addAll
229		*/
230		public void testAddAll5() {
231	<	try {
232	<	Integer[] empty = new Integer[0];
233	<	Integer[] ints = new Integer[SIZE];
234	<	for (int i = 0; i < SIZE; ++i)
235	<	ints[i] = new Integer(i);
236	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
237	<	assertFalse(q.addAll(Arrays.asList(empty)));
238	<	assertTrue(q.addAll(Arrays.asList(ints)));
239	<	for (int i = 0; i < SIZE; ++i)
243	<	assertEquals(ints[i], q.poll());
244	<	}
245	<	finally {}
231	>	Integer[] empty = new Integer[0];
232	>	Integer[] ints = new Integer[SIZE];
233	>	for (int i = 0; i < SIZE; ++i)
234	>	ints[i] = new Integer(i);
235	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
236	>	assertFalse(q.addAll(Arrays.asList(empty)));
237	>	assertTrue(q.addAll(Arrays.asList(ints)));
238	>	for (int i = 0; i < SIZE; ++i)
239	>	assertEquals(ints[i], q.poll());
240		}
241
242		/**
249	–	* put(null) throws NPE
250	–	*/
251	–	public void testPutNull() {
252	–	try {
253	–	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
254	–	q.put(null);
255	–	shouldThrow();
256	–	}
257	–	catch (NullPointerException success){
258	–	}
259	–	catch (InterruptedException ie) {
260	–	unexpectedException();
261	–	}
262	–	}
263	–
264	–	/**
243		* all elements successfully put are contained
244		*/
245	<	public void testPut() {
246	<	try {
247	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
248	<	for (int i = 0; i < SIZE; ++i) {
249	<	Integer I = new Integer(i);
250	<	q.put(I);
273	<	assertTrue(q.contains(I));
274	<	}
275	<	assertEquals(0, q.remainingCapacity());
276	<	}
277	<	catch (InterruptedException ie) {
278	<	unexpectedException();
245	>	public void testPut() throws InterruptedException {
246	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
247	>	for (int i = 0; i < SIZE; ++i) {
248	>	Integer I = new Integer(i);
249	>	q.put(I);
250	>	assertTrue(q.contains(I));
251		}
252	+	assertEquals(0, q.remainingCapacity());
253		}
254
255		/**
256		* put blocks interruptibly if full
257		*/
258	<	public void testBlockingPut() {
259	<	Thread t = new Thread(new Runnable() {
260	<	public void run() {
261	<	int added = 0;
262	<	try {
263	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
264	<	for (int i = 0; i < SIZE; ++i) {
265	<	q.put(new Integer(i));
266	<	++added;
267	<	}
268	<	q.put(new Integer(SIZE));
269	<	threadShouldThrow();
270	<	} catch (InterruptedException ie){
271	<	threadAssertEquals(added, SIZE);
272	<	}
273	<	}});
274	<	t.start();
275	<	try {
276	<	Thread.sleep(SHORT_DELAY_MS);
277	<	t.interrupt();
278	<	t.join();
279	<	}
280	<	catch (InterruptedException ie) {
281	<	unexpectedException();
282	<	}
258	>	public void testBlockingPut() throws InterruptedException {
259	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
260	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
261	>	Thread t = newStartedThread(new CheckedRunnable() {
262	>	public void realRun() throws InterruptedException {
263	>	for (int i = 0; i < SIZE; ++i)
264	>	q.put(i);
265	>	assertEquals(SIZE, q.size());
266	>	assertEquals(0, q.remainingCapacity());
267	>
268	>	Thread.currentThread().interrupt();
269	>	try {
270	>	q.put(99);
271	>	shouldThrow();
272	>	} catch (InterruptedException success) {}
273	>	assertFalse(Thread.interrupted());
274	>
275	>	pleaseInterrupt.countDown();
276	>	try {
277	>	q.put(99);
278	>	shouldThrow();
279	>	} catch (InterruptedException success) {}
280	>	assertFalse(Thread.interrupted());
281	>	}});
282	>
283	>	await(pleaseInterrupt);
284	>	assertThreadStaysAlive(t);
285	>	t.interrupt();
286	>	awaitTermination(t);
287	>	assertEquals(SIZE, q.size());
288	>	assertEquals(0, q.remainingCapacity());
289		}
290
291		/**
292	<	* put blocks waiting for take when full
292	>	* put blocks interruptibly waiting for take when full
293		*/
294	<	public void testPutWithTake() {
294	>	public void testPutWithTake() throws InterruptedException {
295	>	final int capacity = 2;
296		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
297	<	Thread t = new Thread(new Runnable() {
298	<	public void run() {
299	<	int added = 0;
300	<	try {
301	<	q.put(new Object());
302	<	++added;
303	<	q.put(new Object());
304	<	++added;
305	<	q.put(new Object());
306	<	++added;
307	<	q.put(new Object());
308	<	++added;
309	<	threadShouldThrow();
310	<	} catch (InterruptedException e){
311	<	threadAssertTrue(added >= 2);
312	<	}
313	<	}
314	<	});
315	<	try {
316	<	t.start();
317	<	Thread.sleep(SHORT_DELAY_MS);
318	<	q.take();
319	<	t.interrupt();
320	<	t.join();
321	<	} catch (Exception e){
322	<	unexpectedException();
343	<	}
297	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
298	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
299	>	Thread t = newStartedThread(new CheckedRunnable() {
300	>	public void realRun() throws InterruptedException {
301	>	for (int i = 0; i < capacity; i++)
302	>	q.put(i);
303	>	pleaseTake.countDown();
304	>	q.put(86);
305	>
306	>	pleaseInterrupt.countDown();
307	>	try {
308	>	q.put(99);
309	>	shouldThrow();
310	>	} catch (InterruptedException success) {}
311	>	assertFalse(Thread.interrupted());
312	>	}});
313	>
314	>	await(pleaseTake);
315	>	assertEquals(0, q.remainingCapacity());
316	>	assertEquals(0, q.take());
317	>
318	>	await(pleaseInterrupt);
319	>	assertThreadStaysAlive(t);
320	>	t.interrupt();
321	>	awaitTermination(t);
322	>	assertEquals(0, q.remainingCapacity());
323		}
324
325		/**
#	Line 348 | Line 327 | public class LinkedBlockingQueueTest ext
327		*/
328		public void testTimedOffer() {
329		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
330	<	Thread t = new Thread(new Runnable() {
331	<	public void run() {
332	<	try {
333	<	q.put(new Object());
334	<	q.put(new Object());
335	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
336	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
337	<	threadShouldThrow();
338	<	} catch (InterruptedException success){}
339	<	}
340	<	});
341	<
342	<	try {
343	<	t.start();
344	<	Thread.sleep(SMALL_DELAY_MS);
345	<	t.interrupt();
346	<	t.join();
347	<	} catch (Exception e){
348	<	unexpectedException();
370	<	}
330	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
331	>	Thread t = newStartedThread(new CheckedRunnable() {
332	>	public void realRun() throws InterruptedException {
333	>	q.put(new Object());
334	>	q.put(new Object());
335	>	long startTime = System.nanoTime();
336	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
337	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
338	>	pleaseInterrupt.countDown();
339	>	try {
340	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
341	>	shouldThrow();
342	>	} catch (InterruptedException success) {}
343	>	}});
344	>
345	>	await(pleaseInterrupt);
346	>	assertThreadStaysAlive(t);
347	>	t.interrupt();
348	>	awaitTermination(t);
349		}
350
351		/**
352		* take retrieves elements in FIFO order
353		*/
354	<	public void testTake() {
355	<	try {
356	<	LinkedBlockingQueue q = populatedQueue(SIZE);
357	<	for (int i = 0; i < SIZE; ++i) {
380	<	assertEquals(i, ((Integer)q.take()).intValue());
381	<	}
382	<	} catch (InterruptedException e){
383	<	unexpectedException();
384	<	}
385	<	}
386	<
387	<	/**
388	<	* take blocks interruptibly when empty
389	<	*/
390	<	public void testTakeFromEmpty() {
391	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
392	<	Thread t = new Thread(new Runnable() {
393	<	public void run() {
394	<	try {
395	<	q.take();
396	<	threadShouldThrow();
397	<	} catch (InterruptedException success){ }
398	<	}
399	<	});
400	<	try {
401	<	t.start();
402	<	Thread.sleep(SHORT_DELAY_MS);
403	<	t.interrupt();
404	<	t.join();
405	<	} catch (Exception e){
406	<	unexpectedException();
354	>	public void testTake() throws InterruptedException {
355	>	LinkedBlockingQueue q = populatedQueue(SIZE);
356	>	for (int i = 0; i < SIZE; ++i) {
357	>	assertEquals(i, q.take());
358		}
359		}
360
361		/**
362		* Take removes existing elements until empty, then blocks interruptibly
363		*/
364	<	public void testBlockingTake() {
365	<	Thread t = new Thread(new Runnable() {
366	<	public void run() {
367	<	try {
368	<	LinkedBlockingQueue q = populatedQueue(SIZE);
369	<	for (int i = 0; i < SIZE; ++i) {
370	<	assertEquals(i, ((Integer)q.take()).intValue());
371	<	}
372	<	q.take();
373	<	threadShouldThrow();
374	<	} catch (InterruptedException success){
375	<	}
376	<	}});
377	<	t.start();
378	<	try {
428	<	Thread.sleep(SHORT_DELAY_MS);
429	<	t.interrupt();
430	<	t.join();
431	<	}
432	<	catch (InterruptedException ie) {
433	<	unexpectedException();
434	<	}
435	<	}
364	>	public void testBlockingTake() throws InterruptedException {
365	>	final BlockingQueue q = populatedQueue(SIZE);
366	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
367	>	Thread t = newStartedThread(new CheckedRunnable() {
368	>	public void realRun() throws InterruptedException {
369	>	for (int i = 0; i < SIZE; ++i) {
370	>	assertEquals(i, q.take());
371	>	}
372	>
373	>	Thread.currentThread().interrupt();
374	>	try {
375	>	q.take();
376	>	shouldThrow();
377	>	} catch (InterruptedException success) {}
378	>	assertFalse(Thread.interrupted());
379
380	+	pleaseInterrupt.countDown();
381	+	try {
382	+	q.take();
383	+	shouldThrow();
384	+	} catch (InterruptedException success) {}
385	+	assertFalse(Thread.interrupted());
386	+	}});
387	+
388	+	await(pleaseInterrupt);
389	+	assertThreadStaysAlive(t);
390	+	t.interrupt();
391	+	awaitTermination(t);
392	+	}
393
394		/**
395		* poll succeeds unless empty
#	Line 441 | Line 397 | public class LinkedBlockingQueueTest ext
397		public void testPoll() {
398		LinkedBlockingQueue q = populatedQueue(SIZE);
399		for (int i = 0; i < SIZE; ++i) {
400	<	assertEquals(i, ((Integer)q.poll()).intValue());
400	>	assertEquals(i, q.poll());
401		}
402	<	assertNull(q.poll());
402	>	assertNull(q.poll());
403		}
404
405		/**
406	<	* timed pool with zero timeout succeeds when non-empty, else times out
406	>	* timed poll with zero timeout succeeds when non-empty, else times out
407		*/
408	<	public void testTimedPoll0() {
409	<	try {
410	<	LinkedBlockingQueue q = populatedQueue(SIZE);
411	<	for (int i = 0; i < SIZE; ++i) {
412	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
413	<	}
458	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
459	<	} catch (InterruptedException e){
460	<	unexpectedException();
461	<	}
408	>	public void testTimedPoll0() throws InterruptedException {
409	>	LinkedBlockingQueue q = populatedQueue(SIZE);
410	>	for (int i = 0; i < SIZE; ++i) {
411	>	assertEquals(i, q.poll(0, MILLISECONDS));
412	>	}
413	>	assertNull(q.poll(0, MILLISECONDS));
414		}
415
416		/**
417	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
417	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
418		*/
419	<	public void testTimedPoll() {
420	<	try {
421	<	LinkedBlockingQueue q = populatedQueue(SIZE);
422	<	for (int i = 0; i < SIZE; ++i) {
423	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
424	<	}
425	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
426	<	} catch (InterruptedException e){
427	<	unexpectedException();
428	<	}
419	>	public void testTimedPoll() throws InterruptedException {
420	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
421	>	for (int i = 0; i < SIZE; ++i) {
422	>	long startTime = System.nanoTime();
423	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
424	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
425	>	}
426	>	long startTime = System.nanoTime();
427	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
428	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
429	>	checkEmpty(q);
430		}
431
432		/**
433		* Interrupted timed poll throws InterruptedException instead of
434		* returning timeout status
435		*/
436	<	public void testInterruptedTimedPoll() {
437	<	Thread t = new Thread(new Runnable() {
438	<	public void run() {
439	<	try {
440	<	LinkedBlockingQueue q = populatedQueue(SIZE);
441	<	for (int i = 0; i < SIZE; ++i) {
442	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
443	<	}
444	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
492	<	} catch (InterruptedException success){
493	<	}
494	<	}});
495	<	t.start();
496	<	try {
497	<	Thread.sleep(SHORT_DELAY_MS);
498	<	t.interrupt();
499	<	t.join();
500	<	}
501	<	catch (InterruptedException ie) {
502	<	unexpectedException();
503	<	}
504	<	}
505	<
506	<	/**
507	<	*  timed poll before a delayed offer fails; after offer succeeds;
508	<	*  on interruption throws
509	<	*/
510	<	public void testTimedPollWithOffer() {
511	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
512	<	Thread t = new Thread(new Runnable() {
513	<	public void run() {
514	<	try {
515	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
516	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
517	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
518	<	threadShouldThrow();
519	<	} catch (InterruptedException success) { }
436	>	public void testInterruptedTimedPoll() throws InterruptedException {
437	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
438	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
439	>	Thread t = newStartedThread(new CheckedRunnable() {
440	>	public void realRun() throws InterruptedException {
441	>	for (int i = 0; i < SIZE; ++i) {
442	>	long t0 = System.nanoTime();
443	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
444	>	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
445		}
446	<	});
447	<	try {
448	<	t.start();
449	<	Thread.sleep(SMALL_DELAY_MS);
450	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
451	<	t.interrupt();
452	<	t.join();
453	<	} catch (Exception e){
454	<	unexpectedException();
455	<	}
456	<	}
446	>	long t0 = System.nanoTime();
447	>	aboutToWait.countDown();
448	>	try {
449	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
450	>	shouldThrow();
451	>	} catch (InterruptedException success) {
452	>	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
453	>	}
454	>	}});
455	>
456	>	aboutToWait.await();
457	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
458	>	t.interrupt();
459	>	awaitTermination(t, MEDIUM_DELAY_MS);
460	>	checkEmpty(q);
461	>	}
462
463		/**
464		* peek returns next element, or null if empty
#	Line 536 | Line 466 | public class LinkedBlockingQueueTest ext
466		public void testPeek() {
467		LinkedBlockingQueue q = populatedQueue(SIZE);
468		for (int i = 0; i < SIZE; ++i) {
469	<	assertEquals(i, ((Integer)q.peek()).intValue());
470	<	q.poll();
469	>	assertEquals(i, q.peek());
470	>	assertEquals(i, q.poll());
471		assertTrue(q.peek() == null ||
472	<	i != ((Integer)q.peek()).intValue());
472	>	!q.peek().equals(i));
473		}
474	<	assertNull(q.peek());
474	>	assertNull(q.peek());
475		}
476
477		/**
#	Line 550 | Line 480 | public class LinkedBlockingQueueTest ext
480		public void testElement() {
481		LinkedBlockingQueue q = populatedQueue(SIZE);
482		for (int i = 0; i < SIZE; ++i) {
483	<	assertEquals(i, ((Integer)q.element()).intValue());
484	<	q.poll();
483	>	assertEquals(i, q.element());
484	>	assertEquals(i, q.poll());
485		}
486		try {
487		q.element();
488		shouldThrow();
489	<	}
560	<	catch (NoSuchElementException success) {}
489	>	} catch (NoSuchElementException success) {}
490		}
491
492		/**
#	Line 566 | Line 495 | public class LinkedBlockingQueueTest ext
495		public void testRemove() {
496		LinkedBlockingQueue q = populatedQueue(SIZE);
497		for (int i = 0; i < SIZE; ++i) {
498	<	assertEquals(i, ((Integer)q.remove()).intValue());
498	>	assertEquals(i, q.remove());
499		}
500		try {
501		q.remove();
502		shouldThrow();
503	<	} catch (NoSuchElementException success){
575	<	}
503	>	} catch (NoSuchElementException success) {}
504		}
505
506		/**
507	<	* remove(x) removes x and returns true if present
507	>	* An add following remove(x) succeeds
508		*/
509	<	public void testRemoveElement() {
510	<	LinkedBlockingQueue q = populatedQueue(SIZE);
511	<	for (int i = 1; i < SIZE; i+=2) {
512	<	assertTrue(q.remove(new Integer(i)));
513	<	}
514	<	for (int i = 0; i < SIZE; i+=2) {
515	<	assertTrue(q.remove(new Integer(i)));
516	<	assertFalse(q.remove(new Integer(i+1)));
589	<	}
590	<	assertTrue(q.isEmpty());
509	>	public void testRemoveElementAndAdd() throws InterruptedException {
510	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
511	>	assertTrue(q.add(new Integer(1)));
512	>	assertTrue(q.add(new Integer(2)));
513	>	assertTrue(q.remove(new Integer(1)));
514	>	assertTrue(q.remove(new Integer(2)));
515	>	assertTrue(q.add(new Integer(3)));
516	>	assertTrue(q.take() != null);
517		}
518	<
518	>
519		/**
520		* contains(x) reports true when elements added but not yet removed
521		*/
#	Line 613 | Line 539 | public class LinkedBlockingQueueTest ext
539		assertEquals(SIZE, q.remainingCapacity());
540		q.add(one);
541		assertFalse(q.isEmpty());
542	+	assertTrue(q.contains(one));
543		q.clear();
544		assertTrue(q.isEmpty());
545		}
#	Line 667 | Line 594 | public class LinkedBlockingQueueTest ext
594		}
595
596		/**
597	<	* toArray contains all elements
597	>	* toArray contains all elements in FIFO order
598		*/
599		public void testToArray() {
600		LinkedBlockingQueue q = populatedQueue(SIZE);
601	<	Object[] o = q.toArray();
602	<	try {
603	<	for(int i = 0; i < o.length; i++)
677	<	assertEquals(o[i], q.take());
678	<	} catch (InterruptedException e){
679	<	unexpectedException();
680	<	}
601	>	Object[] o = q.toArray();
602	>	for (int i = 0; i < o.length; i++)
603	>	assertSame(o[i], q.poll());
604		}
605
606		/**
607	<	* toArray(a) contains all elements
608	<	*/
609	<	public void testToArray2() {
610	<	LinkedBlockingQueue q = populatedQueue(SIZE);
611	<	Integer[] ints = new Integer[SIZE];
612	<	ints = (Integer[])q.toArray(ints);
613	<	try {
614	<	for(int i = 0; i < ints.length; i++)
615	<	assertEquals(ints[i], q.take());
693	<	} catch (InterruptedException e){
694	<	unexpectedException();
695	<	}
607	>	* toArray(a) contains all elements in FIFO order
608	>	*/
609	>	public void testToArray2() throws InterruptedException {
610	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
611	>	Integer[] ints = new Integer[SIZE];
612	>	Integer[] array = q.toArray(ints);
613	>	assertSame(ints, array);
614	>	for (int i = 0; i < ints.length; i++)
615	>	assertSame(ints[i], q.poll());
616		}
617	<
617	>
618	>	/**
619	>	* toArray(incompatible array type) throws ArrayStoreException
620	>	*/
621	>	public void testToArray1_BadArg() {
622	>	LinkedBlockingQueue q = populatedQueue(SIZE);
623	>	try {
624	>	q.toArray(new String[10]);
625	>	shouldThrow();
626	>	} catch (ArrayStoreException success) {}
627	>	}
628	>
629		/**
630		* iterator iterates through all elements
631		*/
632	<	public void testIterator() {
632	>	public void testIterator() throws InterruptedException {
633		LinkedBlockingQueue q = populatedQueue(SIZE);
634	<	Iterator it = q.iterator();
635	<	try {
636	<	while(it.hasNext()){
637	<	assertEquals(it.next(), q.take());
707	<	}
708	<	} catch (InterruptedException e){
709	<	unexpectedException();
710	<	}
634	>	Iterator it = q.iterator();
635	>	while (it.hasNext()) {
636	>	assertEquals(it.next(), q.take());
637	>	}
638		}
639
640		/**
641		* iterator.remove removes current element
642		*/
643	<	public void testIteratorRemove () {
643	>	public void testIteratorRemove() {
644		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
645		q.add(two);
646		q.add(one);
#	Line 722 | Line 649 | public class LinkedBlockingQueueTest ext
649		Iterator it = q.iterator();
650		it.next();
651		it.remove();
652	<
652	>
653		it = q.iterator();
654	<	assertEquals(it.next(), one);
655	<	assertEquals(it.next(), three);
654	>	assertSame(it.next(), one);
655	>	assertSame(it.next(), three);
656		assertFalse(it.hasNext());
657		}
658
732	–
659		/**
660		* iterator ordering is FIFO
661		*/
#	Line 741 | Line 667 | public class LinkedBlockingQueueTest ext
667		assertEquals(0, q.remainingCapacity());
668		int k = 0;
669		for (Iterator it = q.iterator(); it.hasNext();) {
670	<	int i = ((Integer)(it.next())).intValue();
745	<	assertEquals(++k, i);
670	>	assertEquals(++k, it.next());
671		}
672		assertEquals(3, k);
673		}
#	Line 750 | Line 675 | public class LinkedBlockingQueueTest ext
675		/**
676		* Modifications do not cause iterators to fail
677		*/
678	<	public void testWeaklyConsistentIteration () {
678	>	public void testWeaklyConsistentIteration() {
679		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
680		q.add(one);
681		q.add(two);
682		q.add(three);
683	<	try {
684	<	for (Iterator it = q.iterator(); it.hasNext();) {
685	<	q.remove();
761	<	it.next();
762	<	}
763	<	}
764	<	catch (ConcurrentModificationException e) {
765	<	unexpectedException();
683	>	for (Iterator it = q.iterator(); it.hasNext();) {
684	>	q.remove();
685	>	it.next();
686		}
687		assertEquals(0, q.size());
688		}
689
770	–
690		/**
691		* toString contains toStrings of elements
692		*/
#	Line 775 | Line 694 | public class LinkedBlockingQueueTest ext
694		LinkedBlockingQueue q = populatedQueue(SIZE);
695		String s = q.toString();
696		for (int i = 0; i < SIZE; ++i) {
697	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
697	>	assertTrue(s.contains(String.valueOf(i)));
698		}
699	<	}
781	<
699	>	}
700
701		/**
702		* offer transfers elements across Executor tasks
#	Line 788 | Line 706 | public class LinkedBlockingQueueTest ext
706		q.add(one);
707		q.add(two);
708		ExecutorService executor = Executors.newFixedThreadPool(2);
709	<	executor.execute(new Runnable() {
710	<	public void run() {
711	<	threadAssertFalse(q.offer(three));
712	<	try {
713	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
714	<	threadAssertEquals(0, q.remainingCapacity());
715	<	}
716	<	catch (InterruptedException e) {
717	<	threadUnexpectedException();
718	<	}
719	<	}
720	<	});
709	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
710	>	executor.execute(new CheckedRunnable() {
711	>	public void realRun() throws InterruptedException {
712	>	assertFalse(q.offer(three));
713	>	threadsStarted.await();
714	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
715	>	assertEquals(0, q.remainingCapacity());
716	>	}});
717	>
718	>	executor.execute(new CheckedRunnable() {
719	>	public void realRun() throws InterruptedException {
720	>	threadsStarted.await();
721	>	assertSame(one, q.take());
722	>	}});
723
804	–	executor.execute(new Runnable() {
805	–	public void run() {
806	–	try {
807	–	Thread.sleep(SMALL_DELAY_MS);
808	–	threadAssertEquals(one, q.take());
809	–	}
810	–	catch (InterruptedException e) {
811	–	threadUnexpectedException();
812	–	}
813	–	}
814	–	});
815	–
724		joinPool(executor);
725		}
726
727		/**
728	<	* poll retrieves elements across Executor threads
728	>	* timed poll retrieves elements across Executor threads
729		*/
730		public void testPollInExecutor() {
731		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
732	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
733		ExecutorService executor = Executors.newFixedThreadPool(2);
734	<	executor.execute(new Runnable() {
735	<	public void run() {
736	<	threadAssertNull(q.poll());
737	<	try {
738	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
739	<	threadAssertTrue(q.isEmpty());
740	<	}
741	<	catch (InterruptedException e) {
742	<	threadUnexpectedException();
743	<	}
744	<	}
745	<	});
734	>	executor.execute(new CheckedRunnable() {
735	>	public void realRun() throws InterruptedException {
736	>	assertNull(q.poll());
737	>	threadsStarted.await();
738	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
739	>	checkEmpty(q);
740	>	}});
741	>
742	>	executor.execute(new CheckedRunnable() {
743	>	public void realRun() throws InterruptedException {
744	>	threadsStarted.await();
745	>	q.put(one);
746	>	}});
747
838	–	executor.execute(new Runnable() {
839	–	public void run() {
840	–	try {
841	–	Thread.sleep(SMALL_DELAY_MS);
842	–	q.put(one);
843	–	}
844	–	catch (InterruptedException e) {
845	–	threadUnexpectedException();
846	–	}
847	–	}
848	–	});
849	–
748		joinPool(executor);
749		}
750
751		/**
752		* A deserialized serialized queue has same elements in same order
753		*/
754	<	public void testSerialization() {
754	>	public void testSerialization() throws Exception {
755	>	Queue x = populatedQueue(SIZE);
756	>	Queue y = serialClone(x);
757	>
758	>	assertTrue(x != y);
759	>	assertEquals(x.size(), y.size());
760	>	assertEquals(x.toString(), y.toString());
761	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
762	>	while (!x.isEmpty()) {
763	>	assertFalse(y.isEmpty());
764	>	assertEquals(x.remove(), y.remove());
765	>	}
766	>	assertTrue(y.isEmpty());
767	>	}
768	>
769	>	/**
770	>	* drainTo(c) empties queue into another collection c
771	>	*/
772	>	public void testDrainTo() {
773		LinkedBlockingQueue q = populatedQueue(SIZE);
774	+	ArrayList l = new ArrayList();
775	+	q.drainTo(l);
776	+	assertEquals(0, q.size());
777	+	assertEquals(SIZE, l.size());
778	+	for (int i = 0; i < SIZE; ++i)
779	+	assertEquals(l.get(i), new Integer(i));
780	+	q.add(zero);
781	+	q.add(one);
782	+	assertFalse(q.isEmpty());
783	+	assertTrue(q.contains(zero));
784	+	assertTrue(q.contains(one));
785	+	l.clear();
786	+	q.drainTo(l);
787	+	assertEquals(0, q.size());
788	+	assertEquals(2, l.size());
789	+	for (int i = 0; i < 2; ++i)
790	+	assertEquals(l.get(i), new Integer(i));
791	+	}
792
793	<	try {
794	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
795	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
796	<	out.writeObject(q);
797	<	out.close();
798	<
799	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
800	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
801	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
802	<	assertEquals(q.size(), r.size());
803	<	while (!q.isEmpty())
804	<	assertEquals(q.remove(), r.remove());
805	<	} catch(Exception e){
806	<	unexpectedException();
793	>	/**
794	>	* drainTo empties full queue, unblocking a waiting put.
795	>	*/
796	>	public void testDrainToWithActivePut() throws InterruptedException {
797	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
798	>	Thread t = new Thread(new CheckedRunnable() {
799	>	public void realRun() throws InterruptedException {
800	>	q.put(new Integer(SIZE+1));
801	>	}});
802	>
803	>	t.start();
804	>	ArrayList l = new ArrayList();
805	>	q.drainTo(l);
806	>	assertTrue(l.size() >= SIZE);
807	>	for (int i = 0; i < SIZE; ++i)
808	>	assertEquals(l.get(i), new Integer(i));
809	>	t.join();
810	>	assertTrue(q.size() + l.size() >= SIZE);
811	>	}
812	>
813	>	/**
814	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
815	>	*/
816	>	public void testDrainToN() {
817	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
818	>	for (int i = 0; i < SIZE + 2; ++i) {
819	>	for (int j = 0; j < SIZE; j++)
820	>	assertTrue(q.offer(new Integer(j)));
821	>	ArrayList l = new ArrayList();
822	>	q.drainTo(l, i);
823	>	int k = (i < SIZE) ? i : SIZE;
824	>	assertEquals(k, l.size());
825	>	assertEquals(SIZE-k, q.size());
826	>	for (int j = 0; j < k; ++j)
827	>	assertEquals(l.get(j), new Integer(j));
828	>	while (q.poll() != null) ;
829		}
830		}
831

Diff Legend

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