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

Diff Legend

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