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

Diff Legend

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