ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/LinkedBlockingQueueTest.java

Comparing jsr166/src/test/tck/LinkedBlockingQueueTest.java (file contents):
Revision 1.5 by dl, Thu Sep 25 11:02:41 2003 UTC vs.
Revision 1.40 by jsr166, Tue Mar 15 19:47:06 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		* A new queue has the indicated capacity, or Integer.MAX_VALUE if
58		* none given
#	Line 46 | Line 63 | public class LinkedBlockingQueueTest ext
63		}
64
65		/**
66	<	* Constructor throws IAE if  capacity argument nonpositive
66	>	* Constructor throws IAE if capacity argument nonpositive
67		*/
68		public void testConstructor2() {
69		try {
70		LinkedBlockingQueue q = new LinkedBlockingQueue(0);
71		shouldThrow();
72	<	}
56	<	catch (IllegalArgumentException success) {}
72	>	} catch (IllegalArgumentException success) {}
73		}
74
75		/**
#	Line 63 | Line 79 | public class LinkedBlockingQueueTest ext
79		try {
80		LinkedBlockingQueue q = new LinkedBlockingQueue(null);
81		shouldThrow();
82	<	}
67	<	catch (NullPointerException success) {}
82	>	} catch (NullPointerException success) {}
83		}
84
85		/**
#	Line 75 | Line 90 | public class LinkedBlockingQueueTest ext
90		Integer[] ints = new Integer[SIZE];
91		LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
92		shouldThrow();
93	<	}
79	<	catch (NullPointerException success) {}
93	>	} catch (NullPointerException success) {}
94		}
95
96		/**
#	Line 89 | Line 103 | public class LinkedBlockingQueueTest ext
103		ints[i] = new Integer(i);
104		LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
105		shouldThrow();
106	<	}
93	<	catch (NullPointerException success) {}
106	>	} catch (NullPointerException success) {}
107		}
108
109		/**
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)
106	<	assertEquals(ints[i], q.poll());
107	<	}
108	<	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		/**
#	Line 144 | Line 154 | public class LinkedBlockingQueueTest ext
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		/**
#	Line 164 | Line 185 | public class LinkedBlockingQueueTest ext
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		/**
#	Line 183 | Line 204 | public class LinkedBlockingQueueTest ext
204		LinkedBlockingQueue q = new LinkedBlockingQueue(1);
205		q.addAll(null);
206		shouldThrow();
207	<	}
187	<	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		* addAll of a collection with null elements throws NPE
223		*/
#	Line 195 | Line 227 | public class LinkedBlockingQueueTest ext
227		Integer[] ints = new Integer[SIZE];
228		q.addAll(Arrays.asList(ints));
229		shouldThrow();
230	<	}
199	<	catch (NullPointerException success) {}
230	>	} catch (NullPointerException success) {}
231		}
232	+
233		/**
234		* addAll of a collection with any null elements throws NPE after
235		* possibly adding some elements
#	Line 210 | Line 242 | public class LinkedBlockingQueueTest ext
242		ints[i] = new Integer(i);
243		q.addAll(Arrays.asList(ints));
244		shouldThrow();
245	<	}
214	<	catch (NullPointerException success) {}
245	>	} catch (NullPointerException success) {}
246		}
247	+
248		/**
249		* addAll throws ISE if not enough room
250		*/
#	Line 224 | Line 256 | public class LinkedBlockingQueueTest ext
256		ints[i] = new Integer(i);
257		q.addAll(Arrays.asList(ints));
258		shouldThrow();
259	<	}
228	<	catch (IllegalStateException success) {}
259	>	} catch (IllegalStateException success) {}
260		}
261	+
262		/**
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)
243	<	assertEquals(ints[i], q.poll());
244	<	}
245	<	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		* 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	<	}
257	<	catch (NullPointerException success){
258	<	}
259	<	catch (InterruptedException ie) {
260	<	unexpectedException();
261	<	}
285	>	} catch (NullPointerException success) {}
286		}
287
288		/**
289		* all elements successfully put are contained
290		*/
291	<	public void testPut() {
292	<	try {
293	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
294	<	for (int i = 0; i < SIZE; ++i) {
295	<	Integer I = new Integer(i);
296	<	q.put(I);
273	<	assertTrue(q.contains(I));
274	<	}
275	<	assertEquals(0, q.remainingCapacity());
276	<	}
277	<	catch (InterruptedException ie) {
278	<	unexpectedException();
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		* put blocks interruptibly if full
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);
299	<	}
300	<	}});
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	<	}
307	<	catch (InterruptedException ie) {
308	<	unexpectedException();
309	<	}
319	>	Thread.sleep(SHORT_DELAY_MS);
320	>	t.interrupt();
321	>	t.join();
322	>	assertEquals(SIZE, q.size());
323	>	assertEquals(0, q.remainingCapacity());
324		}
325
326		/**
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	<	});
335	<	try {
336	<	t.start();
337	<	Thread.sleep(SHORT_DELAY_MS);
338	<	q.take();
339	<	t.interrupt();
340	<	t.join();
341	<	} catch (Exception e){
342	<	unexpectedException();
343	<	}
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	>	Thread.sleep(SHORT_DELAY_MS);
344	>	assertEquals(q.remainingCapacity(), 0);
345	>	assertEquals(0, q.take());
346	>	Thread.sleep(SHORT_DELAY_MS);
347	>	t.interrupt();
348	>	t.join();
349	>	assertEquals(q.remainingCapacity(), 0);
350		}
351
352		/**
353		* timed offer times out if full and elements not taken
354		*/
355	<	public void testTimedOffer() {
355	>	public void testTimedOffer() throws InterruptedException {
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	<	}
361	<	});
362	<
363	<	try {
364	<	t.start();
365	<	Thread.sleep(SMALL_DELAY_MS);
366	<	t.interrupt();
367	<	t.join();
368	<	} catch (Exception e){
369	<	unexpectedException();
370	<	}
371	<	}
357	>	Thread t = new Thread(new CheckedRunnable() {
358	>	public void realRun() throws InterruptedException {
359	>	q.put(new Object());
360	>	q.put(new Object());
361	>	assertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS));
362	>	try {
363	>	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
364	>	shouldThrow();
365	>	} catch (InterruptedException success) {}
366	>	}});
367
368	<	/**
369	<	* take retrieves elements in FIFO order
370	<	*/
371	<	public void testTake() {
377	<	try {
378	<	LinkedBlockingQueue q = populatedQueue(SIZE);
379	<	for (int i = 0; i < SIZE; ++i) {
380	<	assertEquals(i, ((Integer)q.take()).intValue());
381	<	}
382	<	} catch (InterruptedException e){
383	<	unexpectedException();
384	<	}
368	>	t.start();
369	>	Thread.sleep(SMALL_DELAY_MS);
370	>	t.interrupt();
371	>	t.join();
372		}
373
374		/**
375	<	* take blocks interruptibly when empty
375	>	* take retrieves elements in FIFO order
376		*/
377	<	public void testTakeFromEmpty() {
378	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
379	<	Thread t = new Thread(new Runnable() {
380	<	public void run() {
394	<	try {
395	<	q.take();
396	<	threadShouldThrow();
397	<	} catch (InterruptedException success){ }
398	<	}
399	<	});
400	<	try {
401	<	t.start();
402	<	Thread.sleep(SHORT_DELAY_MS);
403	<	t.interrupt();
404	<	t.join();
405	<	} catch (Exception e){
406	<	unexpectedException();
377	>	public void testTake() throws InterruptedException {
378	>	LinkedBlockingQueue q = populatedQueue(SIZE);
379	>	for (int i = 0; i < SIZE; ++i) {
380	>	assertEquals(i, q.take());
381		}
382		}
383
384		/**
385		* Take removes existing elements until empty, then blocks interruptibly
386		*/
387	<	public void testBlockingTake() {
388	<	Thread t = new Thread(new Runnable() {
389	<	public void run() {
390	<	try {
391	<	LinkedBlockingQueue q = populatedQueue(SIZE);
392	<	for (int i = 0; i < SIZE; ++i) {
393	<	assertEquals(i, ((Integer)q.take()).intValue());
394	<	}
395	<	q.take();
396	<	threadShouldThrow();
397	<	} catch (InterruptedException success){
398	<	}
399	<	}});
387	>	public void testBlockingTake() throws InterruptedException {
388	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
389	>	Thread t = new Thread(new CheckedRunnable() {
390	>	public void realRun() throws InterruptedException {
391	>	for (int i = 0; i < SIZE; ++i) {
392	>	assertEquals(i, q.take());
393	>	}
394	>	try {
395	>	q.take();
396	>	shouldThrow();
397	>	} catch (InterruptedException success) {}
398	>	}});
399	>
400		t.start();
401	<	try {
402	<	Thread.sleep(SHORT_DELAY_MS);
403	<	t.interrupt();
430	<	t.join();
431	<	}
432	<	catch (InterruptedException ie) {
433	<	unexpectedException();
434	<	}
401	>	Thread.sleep(SHORT_DELAY_MS);
402	>	t.interrupt();
403	>	t.join();
404		}
405
437	–
406		/**
407		* poll succeeds unless empty
408		*/
409		public void testPoll() {
410		LinkedBlockingQueue q = populatedQueue(SIZE);
411		for (int i = 0; i < SIZE; ++i) {
412	<	assertEquals(i, ((Integer)q.poll()).intValue());
412	>	assertEquals(i, q.poll());
413		}
414	<	assertNull(q.poll());
414	>	assertNull(q.poll());
415		}
416
417		/**
418	<	* timed pool with zero timeout succeeds when non-empty, else times out
418	>	* timed poll with zero timeout succeeds when non-empty, else times out
419		*/
420	<	public void testTimedPoll0() {
421	<	try {
422	<	LinkedBlockingQueue q = populatedQueue(SIZE);
423	<	for (int i = 0; i < SIZE; ++i) {
424	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
425	<	}
458	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
459	<	} catch (InterruptedException e){
460	<	unexpectedException();
461	<	}
420	>	public void testTimedPoll0() throws InterruptedException {
421	>	LinkedBlockingQueue q = populatedQueue(SIZE);
422	>	for (int i = 0; i < SIZE; ++i) {
423	>	assertEquals(i, q.poll(0, MILLISECONDS));
424	>	}
425	>	assertNull(q.poll(0, MILLISECONDS));
426		}
427
428		/**
429	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
429	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
430		*/
431	<	public void testTimedPoll() {
432	<	try {
433	<	LinkedBlockingQueue q = populatedQueue(SIZE);
434	<	for (int i = 0; i < SIZE; ++i) {
435	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
436	<	}
473	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
474	<	} catch (InterruptedException e){
475	<	unexpectedException();
476	<	}
431	>	public void testTimedPoll() throws InterruptedException {
432	>	LinkedBlockingQueue q = populatedQueue(SIZE);
433	>	for (int i = 0; i < SIZE; ++i) {
434	>	assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS));
435	>	}
436	>	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
437		}
438
439		/**
440		* Interrupted timed poll throws InterruptedException instead of
441		* returning timeout status
442		*/
443	<	public void testInterruptedTimedPoll() {
444	<	Thread t = new Thread(new Runnable() {
445	<	public void run() {
446	<	try {
447	<	LinkedBlockingQueue q = populatedQueue(SIZE);
448	<	for (int i = 0; i < SIZE; ++i) {
449	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
450	<	}
451	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
492	<	} catch (InterruptedException success){
493	<	}
494	<	}});
495	<	t.start();
496	<	try {
497	<	Thread.sleep(SHORT_DELAY_MS);
498	<	t.interrupt();
499	<	t.join();
500	<	}
501	<	catch (InterruptedException ie) {
502	<	unexpectedException();
503	<	}
504	<	}
505	<
506	<	/**
507	<	*  timed poll before a delayed offer fails; after offer succeeds;
508	<	*  on interruption throws
509	<	*/
510	<	public void testTimedPollWithOffer() {
511	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
512	<	Thread t = new Thread(new Runnable() {
513	<	public void run() {
514	<	try {
515	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
516	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
517	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
518	<	threadShouldThrow();
519	<	} catch (InterruptedException success) { }
443	>	public void testInterruptedTimedPoll() throws InterruptedException {
444	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
445	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
446	>	Thread t = newStartedThread(new CheckedRunnable() {
447	>	public void realRun() throws InterruptedException {
448	>	for (int i = 0; i < SIZE; ++i) {
449	>	long t0 = System.nanoTime();
450	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
451	>	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
452		}
453	<	});
454	<	try {
455	<	t.start();
456	<	Thread.sleep(SMALL_DELAY_MS);
457	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
458	<	t.interrupt();
459	<	t.join();
460	<	} catch (Exception e){
461	<	unexpectedException();
462	<	}
463	<	}
453	>	long t0 = System.nanoTime();
454	>	aboutToWait.countDown();
455	>	try {
456	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
457	>	shouldThrow();
458	>	} catch (InterruptedException success) {
459	>	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
460	>	}
461	>	}});
462	>
463	>	aboutToWait.await();
464	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
465	>	t.interrupt();
466	>	awaitTermination(t, MEDIUM_DELAY_MS);
467	>	checkEmpty(q);
468	>	}
469
470		/**
471		* peek returns next element, or null if empty
#	Line 536 | Line 473 | public class LinkedBlockingQueueTest ext
473		public void testPeek() {
474		LinkedBlockingQueue q = populatedQueue(SIZE);
475		for (int i = 0; i < SIZE; ++i) {
476	<	assertEquals(i, ((Integer)q.peek()).intValue());
477	<	q.poll();
476	>	assertEquals(i, q.peek());
477	>	assertEquals(i, q.poll());
478		assertTrue(q.peek() == null ||
479	<	i != ((Integer)q.peek()).intValue());
479	>	!q.peek().equals(i));
480		}
481	<	assertNull(q.peek());
481	>	assertNull(q.peek());
482		}
483
484		/**
#	Line 550 | Line 487 | public class LinkedBlockingQueueTest ext
487		public void testElement() {
488		LinkedBlockingQueue q = populatedQueue(SIZE);
489		for (int i = 0; i < SIZE; ++i) {
490	<	assertEquals(i, ((Integer)q.element()).intValue());
491	<	q.poll();
490	>	assertEquals(i, q.element());
491	>	assertEquals(i, q.poll());
492		}
493		try {
494		q.element();
495		shouldThrow();
496	<	}
560	<	catch (NoSuchElementException success) {}
496	>	} catch (NoSuchElementException success) {}
497		}
498
499		/**
#	Line 566 | Line 502 | public class LinkedBlockingQueueTest ext
502		public void testRemove() {
503		LinkedBlockingQueue q = populatedQueue(SIZE);
504		for (int i = 0; i < SIZE; ++i) {
505	<	assertEquals(i, ((Integer)q.remove()).intValue());
505	>	assertEquals(i, q.remove());
506		}
507		try {
508		q.remove();
509		shouldThrow();
510	<	} catch (NoSuchElementException success){
575	<	}
510	>	} catch (NoSuchElementException success) {}
511		}
512
513		/**
#	Line 581 | Line 516 | public class LinkedBlockingQueueTest ext
516		public void testRemoveElement() {
517		LinkedBlockingQueue q = populatedQueue(SIZE);
518		for (int i = 1; i < SIZE; i+=2) {
519	<	assertTrue(q.remove(new Integer(i)));
519	>	assertTrue(q.contains(i));
520	>	assertTrue(q.remove(i));
521	>	assertFalse(q.contains(i));
522	>	assertTrue(q.contains(i-1));
523		}
524		for (int i = 0; i < SIZE; i+=2) {
525	<	assertTrue(q.remove(new Integer(i)));
526	<	assertFalse(q.remove(new Integer(i+1)));
525	>	assertTrue(q.contains(i));
526	>	assertTrue(q.remove(i));
527	>	assertFalse(q.contains(i));
528	>	assertFalse(q.remove(i+1));
529	>	assertFalse(q.contains(i+1));
530		}
531		assertTrue(q.isEmpty());
532		}
533	<
533	>
534	>	/**
535	>	* An add following remove(x) succeeds
536	>	*/
537	>	public void testRemoveElementAndAdd() throws InterruptedException {
538	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
539	>	assertTrue(q.add(new Integer(1)));
540	>	assertTrue(q.add(new Integer(2)));
541	>	assertTrue(q.remove(new Integer(1)));
542	>	assertTrue(q.remove(new Integer(2)));
543	>	assertTrue(q.add(new Integer(3)));
544	>	assertTrue(q.take() != null);
545	>	}
546	>
547		/**
548		* contains(x) reports true when elements added but not yet removed
549		*/
#	Line 613 | Line 567 | public class LinkedBlockingQueueTest ext
567		assertEquals(SIZE, q.remainingCapacity());
568		q.add(one);
569		assertFalse(q.isEmpty());
570	+	assertTrue(q.contains(one));
571		q.clear();
572		assertTrue(q.isEmpty());
573		}
#	Line 667 | Line 622 | public class LinkedBlockingQueueTest ext
622		}
623
624		/**
625	<	* toArray contains all elements
625	>	* toArray contains all elements in FIFO order
626		*/
627		public void testToArray() {
628		LinkedBlockingQueue q = populatedQueue(SIZE);
629	<	Object[] o = q.toArray();
630	<	try {
631	<	for(int i = 0; i < o.length; i++)
632	<	assertEquals(o[i], q.take());
633	<	} catch (InterruptedException e){
634	<	unexpectedException();
635	<	}
629	>	Object[] o = q.toArray();
630	>	for (int i = 0; i < o.length; i++)
631	>	assertSame(o[i], q.poll());
632	>	}
633	>
634	>	/**
635	>	* toArray(a) contains all elements in FIFO order
636	>	*/
637	>	public void testToArray2() throws InterruptedException {
638	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
639	>	Integer[] ints = new Integer[SIZE];
640	>	Integer[] array = q.toArray(ints);
641	>	assertSame(ints, array);
642	>	for (int i = 0; i < ints.length; i++)
643	>	assertSame(ints[i], q.poll());
644	>	}
645	>
646	>	/**
647	>	* toArray(null) throws NullPointerException
648	>	*/
649	>	public void testToArray_NullArg() {
650	>	LinkedBlockingQueue q = populatedQueue(SIZE);
651	>	try {
652	>	q.toArray(null);
653	>	shouldThrow();
654	>	} catch (NullPointerException success) {}
655		}
656
657		/**
658	<	* toArray(a) contains all elements
659	<	*/
660	<	public void testToArray2() {
661	<	LinkedBlockingQueue q = populatedQueue(SIZE);
662	<	Integer[] ints = new Integer[SIZE];
663	<	ints = (Integer[])q.toArray(ints);
664	<	try {
665	<	for(int i = 0; i < ints.length; i++)
692	<	assertEquals(ints[i], q.take());
693	<	} catch (InterruptedException e){
694	<	unexpectedException();
695	<	}
658	>	* toArray(incompatible array type) throws ArrayStoreException
659	>	*/
660	>	public void testToArray1_BadArg() {
661	>	LinkedBlockingQueue q = populatedQueue(SIZE);
662	>	try {
663	>	q.toArray(new String[10]);
664	>	shouldThrow();
665	>	} catch (ArrayStoreException success) {}
666		}
667	<
667	>
668	>
669		/**
670		* iterator iterates through all elements
671		*/
672	<	public void testIterator() {
672	>	public void testIterator() throws InterruptedException {
673		LinkedBlockingQueue q = populatedQueue(SIZE);
674	<	Iterator it = q.iterator();
675	<	try {
676	<	while(it.hasNext()){
677	<	assertEquals(it.next(), q.take());
707	<	}
708	<	} catch (InterruptedException e){
709	<	unexpectedException();
710	<	}
674	>	Iterator it = q.iterator();
675	>	while (it.hasNext()) {
676	>	assertEquals(it.next(), q.take());
677	>	}
678		}
679
680		/**
681		* iterator.remove removes current element
682		*/
683	<	public void testIteratorRemove () {
683	>	public void testIteratorRemove() {
684		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
685		q.add(two);
686		q.add(one);
#	Line 722 | Line 689 | public class LinkedBlockingQueueTest ext
689		Iterator it = q.iterator();
690		it.next();
691		it.remove();
692	<
692	>
693		it = q.iterator();
694	<	assertEquals(it.next(), one);
695	<	assertEquals(it.next(), three);
694	>	assertSame(it.next(), one);
695	>	assertSame(it.next(), three);
696		assertFalse(it.hasNext());
697		}
698
#	Line 741 | Line 708 | public class LinkedBlockingQueueTest ext
708		assertEquals(0, q.remainingCapacity());
709		int k = 0;
710		for (Iterator it = q.iterator(); it.hasNext();) {
711	<	int i = ((Integer)(it.next())).intValue();
745	<	assertEquals(++k, i);
711	>	assertEquals(++k, it.next());
712		}
713		assertEquals(3, k);
714		}
#	Line 750 | Line 716 | public class LinkedBlockingQueueTest ext
716		/**
717		* Modifications do not cause iterators to fail
718		*/
719	<	public void testWeaklyConsistentIteration () {
719	>	public void testWeaklyConsistentIteration() {
720		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
721		q.add(one);
722		q.add(two);
723		q.add(three);
724	<	try {
725	<	for (Iterator it = q.iterator(); it.hasNext();) {
726	<	q.remove();
761	<	it.next();
762	<	}
763	<	}
764	<	catch (ConcurrentModificationException e) {
765	<	unexpectedException();
724	>	for (Iterator it = q.iterator(); it.hasNext();) {
725	>	q.remove();
726	>	it.next();
727		}
728		assertEquals(0, q.size());
729		}
#	Line 777 | Line 738 | public class LinkedBlockingQueueTest ext
738		for (int i = 0; i < SIZE; ++i) {
739		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
740		}
741	<	}
741	>	}
742
743
744		/**
#	Line 788 | Line 749 | public class LinkedBlockingQueueTest ext
749		q.add(one);
750		q.add(two);
751		ExecutorService executor = Executors.newFixedThreadPool(2);
752	<	executor.execute(new Runnable() {
753	<	public void run() {
754	<	threadAssertFalse(q.offer(three));
755	<	try {
756	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
757	<	threadAssertEquals(0, q.remainingCapacity());
758	<	}
759	<	catch (InterruptedException e) {
760	<	threadUnexpectedException();
761	<	}
762	<	}
763	<	});
752	>	executor.execute(new CheckedRunnable() {
753	>	public void realRun() throws InterruptedException {
754	>	assertFalse(q.offer(three));
755	>	assertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
756	>	assertEquals(0, q.remainingCapacity());
757	>	}});
758	>
759	>	executor.execute(new CheckedRunnable() {
760	>	public void realRun() throws InterruptedException {
761	>	Thread.sleep(SMALL_DELAY_MS);
762	>	assertSame(one, q.take());
763	>	}});
764
804	–	executor.execute(new Runnable() {
805	–	public void run() {
806	–	try {
807	–	Thread.sleep(SMALL_DELAY_MS);
808	–	threadAssertEquals(one, q.take());
809	–	}
810	–	catch (InterruptedException e) {
811	–	threadUnexpectedException();
812	–	}
813	–	}
814	–	});
815	–
765		joinPool(executor);
766		}
767
#	Line 822 | Line 771 | public class LinkedBlockingQueueTest ext
771		public void testPollInExecutor() {
772		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
773		ExecutorService executor = Executors.newFixedThreadPool(2);
774	<	executor.execute(new Runnable() {
775	<	public void run() {
776	<	threadAssertNull(q.poll());
777	<	try {
778	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
779	<	threadAssertTrue(q.isEmpty());
780	<	}
781	<	catch (InterruptedException e) {
782	<	threadUnexpectedException();
783	<	}
784	<	}
785	<	});
774	>	executor.execute(new CheckedRunnable() {
775	>	public void realRun() throws InterruptedException {
776	>	assertNull(q.poll());
777	>	assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
778	>	assertTrue(q.isEmpty());
779	>	}});
780	>
781	>	executor.execute(new CheckedRunnable() {
782	>	public void realRun() throws InterruptedException {
783	>	Thread.sleep(SMALL_DELAY_MS);
784	>	q.put(one);
785	>	}});
786
838	–	executor.execute(new Runnable() {
839	–	public void run() {
840	–	try {
841	–	Thread.sleep(SMALL_DELAY_MS);
842	–	q.put(one);
843	–	}
844	–	catch (InterruptedException e) {
845	–	threadUnexpectedException();
846	–	}
847	–	}
848	–	});
849	–
787		joinPool(executor);
788		}
789
790		/**
791		* A deserialized serialized queue has same elements in same order
792		*/
793	<	public void testSerialization() {
793	>	public void testSerialization() throws Exception {
794	>	LinkedBlockingQueue q = populatedQueue(SIZE);
795	>
796	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
797	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
798	>	out.writeObject(q);
799	>	out.close();
800	>
801	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
802	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
803	>	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
804	>	assertEquals(q.size(), r.size());
805	>	while (!q.isEmpty())
806	>	assertEquals(q.remove(), r.remove());
807	>	}
808	>
809	>	/**
810	>	* drainTo(null) throws NPE
811	>	*/
812	>	public void testDrainToNull() {
813	>	LinkedBlockingQueue q = populatedQueue(SIZE);
814	>	try {
815	>	q.drainTo(null);
816	>	shouldThrow();
817	>	} catch (NullPointerException success) {}
818	>	}
819	>
820	>	/**
821	>	* drainTo(this) throws IAE
822	>	*/
823	>	public void testDrainToSelf() {
824	>	LinkedBlockingQueue q = populatedQueue(SIZE);
825	>	try {
826	>	q.drainTo(q);
827	>	shouldThrow();
828	>	} catch (IllegalArgumentException success) {}
829	>	}
830	>
831	>	/**
832	>	* drainTo(c) empties queue into another collection c
833	>	*/
834	>	public void testDrainTo() {
835	>	LinkedBlockingQueue q = populatedQueue(SIZE);
836	>	ArrayList l = new ArrayList();
837	>	q.drainTo(l);
838	>	assertEquals(q.size(), 0);
839	>	assertEquals(l.size(), SIZE);
840	>	for (int i = 0; i < SIZE; ++i)
841	>	assertEquals(l.get(i), new Integer(i));
842	>	q.add(zero);
843	>	q.add(one);
844	>	assertFalse(q.isEmpty());
845	>	assertTrue(q.contains(zero));
846	>	assertTrue(q.contains(one));
847	>	l.clear();
848	>	q.drainTo(l);
849	>	assertEquals(q.size(), 0);
850	>	assertEquals(l.size(), 2);
851	>	for (int i = 0; i < 2; ++i)
852	>	assertEquals(l.get(i), new Integer(i));
853	>	}
854	>
855	>	/**
856	>	* drainTo empties full queue, unblocking a waiting put.
857	>	*/
858	>	public void testDrainToWithActivePut() throws InterruptedException {
859	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
860	>	Thread t = new Thread(new CheckedRunnable() {
861	>	public void realRun() throws InterruptedException {
862	>	q.put(new Integer(SIZE+1));
863	>	}});
864	>
865	>	t.start();
866	>	ArrayList l = new ArrayList();
867	>	q.drainTo(l);
868	>	assertTrue(l.size() >= SIZE);
869	>	for (int i = 0; i < SIZE; ++i)
870	>	assertEquals(l.get(i), new Integer(i));
871	>	t.join();
872	>	assertTrue(q.size() + l.size() >= SIZE);
873	>	}
874	>
875	>	/**
876	>	* drainTo(null, n) throws NPE
877	>	*/
878	>	public void testDrainToNullN() {
879		LinkedBlockingQueue q = populatedQueue(SIZE);
880	+	try {
881	+	q.drainTo(null, 0);
882	+	shouldThrow();
883	+	} catch (NullPointerException success) {}
884	+	}
885
886	+	/**
887	+	* drainTo(this, n) throws IAE
888	+	*/
889	+	public void testDrainToSelfN() {
890	+	LinkedBlockingQueue q = populatedQueue(SIZE);
891		try {
892	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
893	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
894	<	out.writeObject(q);
895	<	out.close();
896	<
897	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
898	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
899	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
900	<	assertEquals(q.size(), r.size());
901	<	while (!q.isEmpty())
902	<	assertEquals(q.remove(), r.remove());
903	<	} catch(Exception e){
904	<	unexpectedException();
892	>	q.drainTo(q, 0);
893	>	shouldThrow();
894	>	} catch (IllegalArgumentException success) {}
895	>	}
896	>
897	>	/**
898	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
899	>	*/
900	>	public void testDrainToN() {
901	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
902	>	for (int i = 0; i < SIZE + 2; ++i) {
903	>	for (int j = 0; j < SIZE; j++)
904	>	assertTrue(q.offer(new Integer(j)));
905	>	ArrayList l = new ArrayList();
906	>	q.drainTo(l, i);
907	>	int k = (i < SIZE) ? i : SIZE;
908	>	assertEquals(l.size(), k);
909	>	assertEquals(q.size(), SIZE-k);
910	>	for (int j = 0; j < k; ++j)
911	>	assertEquals(l.get(j), new Integer(j));
912	>	while (q.poll() != null) ;
913		}
914		}
915

Diff Legend

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