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

Diff Legend

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