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.6 by dl, Sun Oct 5 23:00:40 2003 UTC vs.
Revision 1.20 by jsr166, Sat Nov 21 21:00:34 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		* A new queue has the indicated capacity, or Integer.MAX_VALUE if
43		* none given
#	Line 46 | Line 48 | public class LinkedBlockingQueueTest ext
48		}
49
50		/**
51	<	* Constructor throws IAE if  capacity argument nonpositive
51	>	* Constructor throws IAE if capacity argument nonpositive
52		*/
53		public void testConstructor2() {
54		try {
55		LinkedBlockingQueue q = new LinkedBlockingQueue(0);
56		shouldThrow();
57	<	}
56	<	catch (IllegalArgumentException success) {}
57	>	} catch (IllegalArgumentException success) {}
58		}
59
60		/**
#	Line 63 | Line 64 | public class LinkedBlockingQueueTest ext
64		try {
65		LinkedBlockingQueue q = new LinkedBlockingQueue(null);
66		shouldThrow();
67	<	}
67	<	catch (NullPointerException success) {}
67	>	} catch (NullPointerException success) {}
68		}
69
70		/**
#	Line 75 | Line 75 | public class LinkedBlockingQueueTest ext
75		Integer[] ints = new Integer[SIZE];
76		LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
77		shouldThrow();
78	<	}
79	<	catch (NullPointerException success) {}
78	>	} catch (NullPointerException success) {}
79		}
80
81		/**
#	Line 89 | Line 88 | public class LinkedBlockingQueueTest ext
88		ints[i] = new Integer(i);
89		LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
90		shouldThrow();
91	<	}
93	<	catch (NullPointerException success) {}
91	>	} catch (NullPointerException success) {}
92		}
93
94		/**
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)
106	<	assertEquals(ints[i], q.poll());
107	<	}
108	<	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		/**
#	Line 144 | Line 139 | public class LinkedBlockingQueueTest ext
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		* add(null) throws NPE
151		*/
152		public void testAddNull() {
153	<	try {
153	>	try {
154		LinkedBlockingQueue q = new LinkedBlockingQueue(1);
155		q.add(null);
156		shouldThrow();
157	<	} catch (NullPointerException success) { }
157	>	} catch (NullPointerException success) {}
158		}
159
160		/**
#	Line 175 | Line 170 | public class LinkedBlockingQueueTest ext
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		/**
#	Line 194 | Line 189 | public class LinkedBlockingQueueTest ext
189		LinkedBlockingQueue q = new LinkedBlockingQueue(1);
190		q.addAll(null);
191		shouldThrow();
192	<	}
198	<	catch (NullPointerException success) {}
192	>	} catch (NullPointerException success) {}
193		}
194
195		/**
#	Line 206 | Line 200 | public class LinkedBlockingQueueTest ext
200		LinkedBlockingQueue q = populatedQueue(SIZE);
201		q.addAll(q);
202		shouldThrow();
203	<	}
210	<	catch (IllegalArgumentException success) {}
203	>	} catch (IllegalArgumentException success) {}
204		}
205
206		/**
#	Line 219 | Line 212 | public class LinkedBlockingQueueTest ext
212		Integer[] ints = new Integer[SIZE];
213		q.addAll(Arrays.asList(ints));
214		shouldThrow();
215	<	}
223	<	catch (NullPointerException success) {}
215	>	} catch (NullPointerException success) {}
216		}
217		/**
218		* addAll of a collection with any null elements throws NPE after
#	Line 234 | Line 226 | public class LinkedBlockingQueueTest ext
226		ints[i] = new Integer(i);
227		q.addAll(Arrays.asList(ints));
228		shouldThrow();
229	<	}
238	<	catch (NullPointerException success) {}
229	>	} catch (NullPointerException success) {}
230		}
231		/**
232		* addAll throws ISE if not enough room
#	Line 248 | Line 239 | public class LinkedBlockingQueueTest ext
239		ints[i] = new Integer(i);
240		q.addAll(Arrays.asList(ints));
241		shouldThrow();
242	<	}
252	<	catch (IllegalStateException success) {}
242	>	} catch (IllegalStateException success) {}
243		}
244		/**
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)
267	<	assertEquals(ints[i], q.poll());
268	<	}
269	<	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		* 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	<	}
281	<	catch (NullPointerException success){
282	<	}
283	<	catch (InterruptedException ie) {
284	<	unexpectedException();
285	<	}
267	>	} catch (NullPointerException success) {}
268		}
269
270		/**
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);
297	<	assertTrue(q.contains(I));
298	<	}
299	<	assertEquals(0, q.remainingCapacity());
300	<	}
301	<	catch (InterruptedException ie) {
302	<	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		* put blocks interruptibly if full
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);
300	<	}
301	<	}});
286	>	public void testBlockingPut() throws InterruptedException {
287	>	Thread t = new Thread(new CheckedRunnable() {
288	>	public void realRun() {
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 success) {
299	>	threadAssertEquals(added, SIZE);
300	>	}
301	>	}});
302	>
303		t.start();
304	<	try {
305	<	Thread.sleep(SHORT_DELAY_MS);
306	<	t.interrupt();
329	<	t.join();
330	<	}
331	<	catch (InterruptedException ie) {
332	<	unexpectedException();
333	<	}
304	>	Thread.sleep(SHORT_DELAY_MS);
305	>	t.interrupt();
306	>	t.join();
307		}
308
309		/**
310		* put blocks waiting for take when full
311		*/
312	<	public void testPutWithTake() {
312	>	public void testPutWithTake() throws InterruptedException {
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);
356	<	}
314	>	Thread t = new Thread(new CheckedRunnable() {
315	>	public void realRun() {
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 success) {
328	>	threadAssertTrue(added >= 2);
329		}
330	<	});
331	<	try {
332	<	t.start();
333	<	Thread.sleep(SHORT_DELAY_MS);
334	<	q.take();
335	<	t.interrupt();
336	<	t.join();
365	<	} catch (Exception e){
366	<	unexpectedException();
367	<	}
330	>	}});
331	>
332	>	t.start();
333	>	Thread.sleep(SHORT_DELAY_MS);
334	>	q.take();
335	>	t.interrupt();
336	>	t.join();
337		}
338
339		/**
340		* timed offer times out if full and elements not taken
341		*/
342	<	public void testTimedOffer() {
342	>	public void testTimedOffer() throws InterruptedException {
343		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
344	<	Thread t = new Thread(new Runnable() {
345	<	public void run() {
346	<	try {
347	<	q.put(new Object());
348	<	q.put(new Object());
349	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
350	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
351	<	threadShouldThrow();
352	<	} catch (InterruptedException success){}
353	<	}
354	<	});
355	<
387	<	try {
388	<	t.start();
389	<	Thread.sleep(SMALL_DELAY_MS);
390	<	t.interrupt();
391	<	t.join();
392	<	} catch (Exception e){
393	<	unexpectedException();
394	<	}
344	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
345	>	public void realRun() throws InterruptedException {
346	>	q.put(new Object());
347	>	q.put(new Object());
348	>	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS));
349	>	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
350	>	}};
351	>
352	>	t.start();
353	>	Thread.sleep(SMALL_DELAY_MS);
354	>	t.interrupt();
355	>	t.join();
356		}
357
358		/**
359		* take retrieves elements in FIFO order
360		*/
361	<	public void testTake() {
362	<	try {
363	<	LinkedBlockingQueue q = populatedQueue(SIZE);
364	<	for (int i = 0; i < SIZE; ++i) {
365	<	assertEquals(i, ((Integer)q.take()).intValue());
405	<	}
406	<	} catch (InterruptedException e){
407	<	unexpectedException();
408	<	}
361	>	public void testTake() throws InterruptedException {
362	>	LinkedBlockingQueue q = populatedQueue(SIZE);
363	>	for (int i = 0; i < SIZE; ++i) {
364	>	assertEquals(i, ((Integer)q.take()).intValue());
365	>	}
366		}
367
368		/**
369		* take blocks interruptibly when empty
370		*/
371	<	public void testTakeFromEmpty() {
371	>	public void testTakeFromEmpty() throws InterruptedException {
372		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
373	<	Thread t = new Thread(new Runnable() {
374	<	public void run() {
375	<	try {
376	<	q.take();
377	<	threadShouldThrow();
378	<	} catch (InterruptedException success){ }
379	<	}
380	<	});
381	<	try {
425	<	t.start();
426	<	Thread.sleep(SHORT_DELAY_MS);
427	<	t.interrupt();
428	<	t.join();
429	<	} catch (Exception e){
430	<	unexpectedException();
431	<	}
373	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
374	>	public void realRun() throws InterruptedException {
375	>	q.take();
376	>	}};
377	>
378	>	t.start();
379	>	Thread.sleep(SHORT_DELAY_MS);
380	>	t.interrupt();
381	>	t.join();
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();
447	<	} catch (InterruptedException success){
448	<	}
449	<	}});
387	>	public void testBlockingTake() throws InterruptedException {
388	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
389	>	public void realRun() throws InterruptedException {
390	>	LinkedBlockingQueue q = populatedQueue(SIZE);
391	>	for (int i = 0; i < SIZE; ++i) {
392	>	assertEquals(i, ((Integer)q.take()).intValue());
393	>	}
394	>	q.take();
395	>	}};
396	>
397		t.start();
398	<	try {
399	<	Thread.sleep(SHORT_DELAY_MS);
400	<	t.interrupt();
454	<	t.join();
455	<	}
456	<	catch (InterruptedException ie) {
457	<	unexpectedException();
458	<	}
398	>	Thread.sleep(SHORT_DELAY_MS);
399	>	t.interrupt();
400	>	t.join();
401		}
402
403
#	Line 467 | Line 409 | public class LinkedBlockingQueueTest ext
409		for (int i = 0; i < SIZE; ++i) {
410		assertEquals(i, ((Integer)q.poll()).intValue());
411		}
412	<	assertNull(q.poll());
412	>	assertNull(q.poll());
413		}
414
415		/**
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	<	}
482	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
483	<	} catch (InterruptedException e){
484	<	unexpectedException();
485	<	}
418	>	public void testTimedPoll0() throws InterruptedException {
419	>	LinkedBlockingQueue q = populatedQueue(SIZE);
420	>	for (int i = 0; i < SIZE; ++i) {
421	>	assertEquals(i, ((Integer)q.poll(0, MILLISECONDS)).intValue());
422	>	}
423	>	assertNull(q.poll(0, MILLISECONDS));
424		}
425
426		/**
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	<	}
497	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
498	<	} catch (InterruptedException e){
499	<	unexpectedException();
500	<	}
429	>	public void testTimedPoll() throws InterruptedException {
430	>	LinkedBlockingQueue q = populatedQueue(SIZE);
431	>	for (int i = 0; i < SIZE; ++i) {
432	>	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
433	>	}
434	>	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
435		}
436
437		/**
438		* Interrupted timed poll throws InterruptedException instead of
439		* returning timeout status
440		*/
441	<	public void testInterruptedTimedPoll() {
442	<	Thread t = new Thread(new Runnable() {
443	<	public void run() {
444	<	try {
445	<	LinkedBlockingQueue q = populatedQueue(SIZE);
446	<	for (int i = 0; i < SIZE; ++i) {
447	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
448	<	}
449	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
450	<	} catch (InterruptedException success){
451	<	}
452	<	}});
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, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
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();
523	<	t.join();
524	<	}
525	<	catch (InterruptedException ie) {
526	<	unexpectedException();
527	<	}
455	>	Thread.sleep(SHORT_DELAY_MS);
456	>	t.interrupt();
457	>	t.join();
458		}
459
460		/**
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	<	}
475	<	});
476	<	try {
477	<	t.start();
478	<	Thread.sleep(SMALL_DELAY_MS);
479	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
480	<	t.interrupt();
481	<	t.join();
552	<	} catch (Exception e){
553	<	unexpectedException();
554	<	}
555	<	}
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		* peek returns next element, or null if empty
#	Line 565 | Line 491 | public class LinkedBlockingQueueTest ext
491		assertTrue(q.peek() == null ||
492		i != ((Integer)q.peek()).intValue());
493		}
494	<	assertNull(q.peek());
494	>	assertNull(q.peek());
495		}
496
497		/**
#	Line 580 | Line 506 | public class LinkedBlockingQueueTest ext
506		try {
507		q.element();
508		shouldThrow();
509	<	}
584	<	catch (NoSuchElementException success) {}
509	>	} catch (NoSuchElementException success) {}
510		}
511
512		/**
#	Line 595 | Line 520 | public class LinkedBlockingQueueTest ext
520		try {
521		q.remove();
522		shouldThrow();
523	<	} catch (NoSuchElementException success){
599	<	}
523	>	} catch (NoSuchElementException success) {}
524		}
525
526		/**
#	Line 613 | Line 537 | public class LinkedBlockingQueueTest ext
537		}
538		assertTrue(q.isEmpty());
539		}
540	<
540	>
541	>	/**
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		*/
#	Line 637 | 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		}
#	Line 693 | Line 631 | public class LinkedBlockingQueueTest ext
631		/**
632		* toArray contains all elements
633		*/
634	<	public void testToArray() {
634	>	public void testToArray() throws InterruptedException {
635		LinkedBlockingQueue q = populatedQueue(SIZE);
636	<	Object[] o = q.toArray();
637	<	try {
638	<	for(int i = 0; i < o.length; i++)
701	<	assertEquals(o[i], q.take());
702	<	} catch (InterruptedException e){
703	<	unexpectedException();
704	<	}
636	>	Object[] o = q.toArray();
637	>	for (int i = 0; i < o.length; i++)
638	>	assertEquals(o[i], q.take());
639		}
640
641		/**
642		* toArray(a) contains all elements
643		*/
644	<	public void testToArray2() {
644	>	public void testToArray2() throws InterruptedException {
645		LinkedBlockingQueue q = populatedQueue(SIZE);
646	<	Integer[] ints = new Integer[SIZE];
647	<	ints = (Integer[])q.toArray(ints);
648	<	try {
649	<	for(int i = 0; i < ints.length; i++)
716	<	assertEquals(ints[i], q.take());
717	<	} catch (InterruptedException e){
718	<	unexpectedException();
719	<	}
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		* toArray(null) throws NPE
654		*/
655		public void testToArray_BadArg() {
656	<	try {
656	>	try {
657		LinkedBlockingQueue q = populatedQueue(SIZE);
658	<	Object o[] = q.toArray(null);
659	<	shouldThrow();
660	<	} catch(NullPointerException success){}
658	>	Object o[] = q.toArray(null);
659	>	shouldThrow();
660	>	} catch (NullPointerException success) {}
661		}
662
663		/**
664	<	* toArray with incompatable array type throws CCE
664	>	* toArray with incompatible array type throws CCE
665		*/
666		public void testToArray1_BadArg() {
667	<	try {
667	>	try {
668		LinkedBlockingQueue q = populatedQueue(SIZE);
669	<	Object o[] = q.toArray(new String[10] );
670	<	shouldThrow();
671	<	} catch(ArrayStoreException  success){}
669	>	Object o[] = q.toArray(new String[10] );
670	>	shouldThrow();
671	>	} catch (ArrayStoreException success) {}
672		}
673
674	<
674	>
675		/**
676		* iterator iterates through all elements
677		*/
678	<	public void testIterator() {
678	>	public void testIterator() throws InterruptedException {
679		LinkedBlockingQueue q = populatedQueue(SIZE);
680	<	Iterator it = q.iterator();
681	<	try {
682	<	while(it.hasNext()){
683	<	assertEquals(it.next(), q.take());
754	<	}
755	<	} catch (InterruptedException e){
756	<	unexpectedException();
757	<	}
680	>	Iterator it = q.iterator();
681	>	while (it.hasNext()) {
682	>	assertEquals(it.next(), q.take());
683	>	}
684		}
685
686		/**
#	Line 769 | Line 695 | public class LinkedBlockingQueueTest ext
695		Iterator it = q.iterator();
696		it.next();
697		it.remove();
698	<
698	>
699		it = q.iterator();
700		assertEquals(it.next(), one);
701		assertEquals(it.next(), three);
#	Line 802 | Line 728 | public class LinkedBlockingQueueTest ext
728		q.add(one);
729		q.add(two);
730		q.add(three);
731	<	try {
732	<	for (Iterator it = q.iterator(); it.hasNext();) {
733	<	q.remove();
808	<	it.next();
809	<	}
810	<	}
811	<	catch (ConcurrentModificationException e) {
812	<	unexpectedException();
731	>	for (Iterator it = q.iterator(); it.hasNext();) {
732	>	q.remove();
733	>	it.next();
734		}
735		assertEquals(0, q.size());
736		}
#	Line 824 | Line 745 | public class LinkedBlockingQueueTest ext
745		for (int i = 0; i < SIZE; ++i) {
746		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
747		}
748	<	}
748	>	}
749
750
751		/**
#	Line 835 | Line 756 | public class LinkedBlockingQueueTest ext
756		q.add(one);
757		q.add(two);
758		ExecutorService executor = Executors.newFixedThreadPool(2);
759	<	executor.execute(new Runnable() {
760	<	public void run() {
759	>	executor.execute(new CheckedRunnable() {
760	>	public void realRun() throws InterruptedException {
761		threadAssertFalse(q.offer(three));
762	<	try {
763	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
764	<	threadAssertEquals(0, q.remainingCapacity());
765	<	}
766	<	catch (InterruptedException e) {
767	<	threadUnexpectedException();
768	<	}
769	<	}
770	<	});
762	>	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
763	>	threadAssertEquals(0, q.remainingCapacity());
764	>	}});
765	>
766	>	executor.execute(new CheckedRunnable() {
767	>	public void realRun() throws InterruptedException {
768	>	Thread.sleep(SMALL_DELAY_MS);
769	>	threadAssertEquals(one, q.take());
770	>	}});
771
851	–	executor.execute(new Runnable() {
852	–	public void run() {
853	–	try {
854	–	Thread.sleep(SMALL_DELAY_MS);
855	–	threadAssertEquals(one, q.take());
856	–	}
857	–	catch (InterruptedException e) {
858	–	threadUnexpectedException();
859	–	}
860	–	}
861	–	});
862	–
772		joinPool(executor);
773		}
774
#	Line 869 | Line 778 | public class LinkedBlockingQueueTest ext
778		public void testPollInExecutor() {
779		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
780		ExecutorService executor = Executors.newFixedThreadPool(2);
781	<	executor.execute(new Runnable() {
782	<	public void run() {
781	>	executor.execute(new CheckedRunnable() {
782	>	public void realRun() throws InterruptedException {
783		threadAssertNull(q.poll());
784	<	try {
785	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
786	<	threadAssertTrue(q.isEmpty());
787	<	}
788	<	catch (InterruptedException e) {
789	<	threadUnexpectedException();
790	<	}
791	<	}
792	<	});
784	>	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
785	>	threadAssertTrue(q.isEmpty());
786	>	}});
787	>
788	>	executor.execute(new CheckedRunnable() {
789	>	public void realRun() throws InterruptedException {
790	>	Thread.sleep(SMALL_DELAY_MS);
791	>	q.put(one);
792	>	}});
793
885	–	executor.execute(new Runnable() {
886	–	public void run() {
887	–	try {
888	–	Thread.sleep(SMALL_DELAY_MS);
889	–	q.put(one);
890	–	}
891	–	catch (InterruptedException e) {
892	–	threadUnexpectedException();
893	–	}
894	–	}
895	–	});
896	–
794		joinPool(executor);
795		}
796
797		/**
798		* A deserialized serialized queue has same elements in same order
799		*/
800	<	public void testSerialization() {
800	>	public void testSerialization() throws Exception {
801		LinkedBlockingQueue q = populatedQueue(SIZE);
802
803	<	try {
804	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
805	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
806	<	out.writeObject(q);
807	<	out.close();
808	<
809	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
810	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
811	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
812	<	assertEquals(q.size(), r.size());
813	<	while (!q.isEmpty())
917	<	assertEquals(q.remove(), r.remove());
918	<	} catch(Exception e){
919	<	unexpectedException();
920	<	}
803	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
804	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
805	>	out.writeObject(q);
806	>	out.close();
807	>
808	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
809	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
810	>	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
811	>	assertEquals(q.size(), r.size());
812	>	while (!q.isEmpty())
813	>	assertEquals(q.remove(), r.remove());
814		}
815
816		/**
817		* drainTo(null) throws NPE
818	<	*/
818	>	*/
819		public void testDrainToNull() {
820		LinkedBlockingQueue q = populatedQueue(SIZE);
821		try {
822		q.drainTo(null);
823		shouldThrow();
824	<	} catch(NullPointerException success) {
932	<	}
824	>	} catch (NullPointerException success) {}
825		}
826
827		/**
828		* drainTo(this) throws IAE
829	<	*/
829	>	*/
830		public void testDrainToSelf() {
831		LinkedBlockingQueue q = populatedQueue(SIZE);
832		try {
833		q.drainTo(q);
834		shouldThrow();
835	<	} catch(IllegalArgumentException success) {
944	<	}
835	>	} catch (IllegalArgumentException success) {}
836		}
837
838		/**
839		* drainTo(c) empties queue into another collection c
840	<	*/
840	>	*/
841		public void testDrainTo() {
842		LinkedBlockingQueue q = populatedQueue(SIZE);
843		ArrayList l = new ArrayList();
844		q.drainTo(l);
845		assertEquals(q.size(), 0);
846		assertEquals(l.size(), SIZE);
847	<	for (int i = 0; i < SIZE; ++i)
847	>	for (int i = 0; i < SIZE; ++i)
848	>	assertEquals(l.get(i), new Integer(i));
849	>	q.add(zero);
850	>	q.add(one);
851	>	assertFalse(q.isEmpty());
852	>	assertTrue(q.contains(zero));
853	>	assertTrue(q.contains(one));
854	>	l.clear();
855	>	q.drainTo(l);
856	>	assertEquals(q.size(), 0);
857	>	assertEquals(l.size(), 2);
858	>	for (int i = 0; i < 2; ++i)
859		assertEquals(l.get(i), new Integer(i));
860		}
861
862		/**
863		* drainTo empties full queue, unblocking a waiting put.
864	<	*/
865	<	public void testDrainToWithActivePut() {
864	>	*/
865	>	public void testDrainToWithActivePut() throws InterruptedException {
866		final LinkedBlockingQueue q = populatedQueue(SIZE);
867	<	Thread t = new Thread(new Runnable() {
868	<	public void run() {
869	<	try {
870	<	q.put(new Integer(SIZE+1));
871	<	} catch (InterruptedException ie){
872	<	threadUnexpectedException();
873	<	}
874	<	}
875	<	});
876	<	try {
877	<	t.start();
878	<	ArrayList l = new ArrayList();
879	<	q.drainTo(l);
978	<	assertTrue(l.size() >= SIZE);
979	<	for (int i = 0; i < SIZE; ++i)
980	<	assertEquals(l.get(i), new Integer(i));
981	<	t.join();
982	<	assertTrue(q.size() + l.size() == SIZE+1);
983	<	} catch(Exception e){
984	<	unexpectedException();
985	<	}
867	>	Thread t = new Thread(new CheckedRunnable() {
868	>	public void realRun() throws InterruptedException {
869	>	q.put(new Integer(SIZE+1));
870	>	}});
871	>
872	>	t.start();
873	>	ArrayList l = new ArrayList();
874	>	q.drainTo(l);
875	>	assertTrue(l.size() >= SIZE);
876	>	for (int i = 0; i < SIZE; ++i)
877	>	assertEquals(l.get(i), new Integer(i));
878	>	t.join();
879	>	assertTrue(q.size() + l.size() >= SIZE);
880		}
881
882		/**
883		* drainTo(null, n) throws NPE
884	<	*/
884	>	*/
885		public void testDrainToNullN() {
886		LinkedBlockingQueue q = populatedQueue(SIZE);
887		try {
888		q.drainTo(null, 0);
889		shouldThrow();
890	<	} catch(NullPointerException success) {
997	<	}
890	>	} catch (NullPointerException success) {}
891		}
892
893		/**
894		* drainTo(this, n) throws IAE
895	<	*/
895	>	*/
896		public void testDrainToSelfN() {
897		LinkedBlockingQueue q = populatedQueue(SIZE);
898		try {
899		q.drainTo(q, 0);
900		shouldThrow();
901	<	} catch(IllegalArgumentException success) {
1009	<	}
901	>	} catch (IllegalArgumentException success) {}
902		}
903
904		/**
905		* drainTo(c, n) empties first max {n, size} elements of queue into c
906	<	*/
906	>	*/
907		public void testDrainToN() {
908	+	LinkedBlockingQueue q = new LinkedBlockingQueue();
909		for (int i = 0; i < SIZE + 2; ++i) {
910	<	LinkedBlockingQueue q = populatedQueue(SIZE);
910	>	for (int j = 0; j < SIZE; j++)
911	>	assertTrue(q.offer(new Integer(j)));
912		ArrayList l = new ArrayList();
913		q.drainTo(l, i);
914		int k = (i < SIZE)? i : SIZE;
1021	–	assertEquals(q.size(), SIZE-k);
915		assertEquals(l.size(), k);
916	<	for (int j = 0; j < k; ++j)
916	>	assertEquals(q.size(), SIZE-k);
917	>	for (int j = 0; j < k; ++j)
918		assertEquals(l.get(j), new Integer(j));
919	+	while (q.poll() != null) ;
920		}
921		}
922

Diff Legend

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