ViewVC Help

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

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

Comparing jsr166/src/test/tck/SynchronousQueueTest.java (file contents):
Revision 1.11 by jsr166, Mon Nov 16 04:57:10 2009 UTC vs.
Revision 1.65 by jsr166, Tue Aug 13 23:06:39 2019 UTC

#	Line 1 | Line 1
1		/*
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
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 java.io.*;
9	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
10	>
11	>	import java.util.ArrayList;
12	>	import java.util.Arrays;
13	>	import java.util.Collection;
14	>	import java.util.Iterator;
15	>	import java.util.NoSuchElementException;
16	>	import java.util.concurrent.BlockingQueue;
17	>	import java.util.concurrent.CountDownLatch;
18	>	import java.util.concurrent.Executors;
19	>	import java.util.concurrent.ExecutorService;
20	>	import java.util.concurrent.SynchronousQueue;
21	>
22	>	import junit.framework.Test;
23
24		public class SynchronousQueueTest extends JSR166TestCase {
25
26	<	public static void main(String[] args) {
27	<	junit.textui.TestRunner.run (suite());
26	>	public static class Fair extends BlockingQueueTest {
27	>	protected BlockingQueue emptyCollection() {
28	>	return new SynchronousQueue(true);
29	>	}
30		}
31
32	<	public static Test suite() {
33	<	return new TestSuite(SynchronousQueueTest.class);
32	>	public static class NonFair extends BlockingQueueTest {
33	>	protected BlockingQueue emptyCollection() {
34	>	return new SynchronousQueue(false);
35	>	}
36		}
37
38	<	/**
39	<	* A SynchronousQueue is both empty and full
40	<	*/
41	<	public void testEmptyFull() {
42	<	SynchronousQueue q = new SynchronousQueue();
43	<	assertTrue(q.isEmpty());
44	<	assertEquals(0, q.size());
45	<	assertEquals(0, q.remainingCapacity());
32	<	assertFalse(q.offer(zero));
38	>	public static void main(String[] args) {
39	>	main(suite(), args);
40	>	}
41	>
42	>	public static Test suite() {
43	>	return newTestSuite(SynchronousQueueTest.class,
44	>	new Fair().testSuite(),
45	>	new NonFair().testSuite());
46		}
47
48		/**
49	<	* A fair SynchronousQueue is both empty and full
49	>	* Any SynchronousQueue is both empty and full
50		*/
51	<	public void testFairEmptyFull() {
52	<	SynchronousQueue q = new SynchronousQueue(true);
51	>	public void testEmptyFull()      { testEmptyFull(false); }
52	>	public void testEmptyFull_fair() { testEmptyFull(true); }
53	>	public void testEmptyFull(boolean fair) {
54	>	final SynchronousQueue q = new SynchronousQueue(fair);
55		assertTrue(q.isEmpty());
56	<	assertEquals(0, q.size());
56	>	assertEquals(0, q.size());
57		assertEquals(0, q.remainingCapacity());
58		assertFalse(q.offer(zero));
59		}
60
61		/**
47	–	* offer(null) throws NPE
48	–	*/
49	–	public void testOfferNull() {
50	–	try {
51	–	SynchronousQueue q = new SynchronousQueue();
52	–	q.offer(null);
53	–	shouldThrow();
54	–	} catch (NullPointerException success) { }
55	–	}
56	–
57	–	/**
58	–	* add(null) throws NPE
59	–	*/
60	–	public void testAddNull() {
61	–	try {
62	–	SynchronousQueue q = new SynchronousQueue();
63	–	q.add(null);
64	–	shouldThrow();
65	–	} catch (NullPointerException success) { }
66	–	}
67	–
68	–	/**
62		* offer fails if no active taker
63		*/
64	<	public void testOffer() {
65	<	SynchronousQueue q = new SynchronousQueue();
64	>	public void testOffer()      { testOffer(false); }
65	>	public void testOffer_fair() { testOffer(true); }
66	>	public void testOffer(boolean fair) {
67	>	SynchronousQueue q = new SynchronousQueue(fair);
68		assertFalse(q.offer(one));
69		}
70
71		/**
72	<	* add throws ISE if no active taker
72	>	* add throws IllegalStateException if no active taker
73		*/
74	<	public void testAdd() {
75	<	try {
76	<	SynchronousQueue q = new SynchronousQueue();
77	<	assertEquals(0, q.remainingCapacity());
78	<	q.add(one);
84	<	shouldThrow();
85	<	} catch (IllegalStateException success){
86	<	}
87	<	}
88	<
89	<	/**
90	<	* addAll(null) throws NPE
91	<	*/
92	<	public void testAddAll1() {
74	>	public void testAdd()      { testAdd(false); }
75	>	public void testAdd_fair() { testAdd(true); }
76	>	public void testAdd(boolean fair) {
77	>	SynchronousQueue q = new SynchronousQueue(fair);
78	>	assertEquals(0, q.remainingCapacity());
79		try {
80	<	SynchronousQueue q = new SynchronousQueue();
95	<	q.addAll(null);
80	>	q.add(one);
81		shouldThrow();
82	<	}
98	<	catch (NullPointerException success) {}
82	>	} catch (IllegalStateException success) {}
83		}
84
85		/**
86	<	* addAll(this) throws IAE
86	>	* addAll(this) throws IllegalArgumentException
87		*/
88	<	public void testAddAllSelf() {
88	>	public void testAddAll_self()      { testAddAll_self(false); }
89	>	public void testAddAll_self_fair() { testAddAll_self(true); }
90	>	public void testAddAll_self(boolean fair) {
91	>	SynchronousQueue q = new SynchronousQueue(fair);
92		try {
106	–	SynchronousQueue q = new SynchronousQueue();
93		q.addAll(q);
94		shouldThrow();
95	<	}
110	<	catch (IllegalArgumentException success) {}
95	>	} catch (IllegalArgumentException success) {}
96		}
97
98		/**
99	<	* addAll of a collection with null elements throws NPE
99	>	* addAll throws IllegalStateException if no active taker
100		*/
101	<	public void testAddAll2() {
101	>	public void testAddAll_ISE()      { testAddAll_ISE(false); }
102	>	public void testAddAll_ISE_fair() { testAddAll_ISE(true); }
103	>	public void testAddAll_ISE(boolean fair) {
104	>	SynchronousQueue q = new SynchronousQueue(fair);
105	>	Integer[] ints = new Integer[1];
106	>	for (int i = 0; i < ints.length; i++)
107	>	ints[i] = i;
108	>	Collection<Integer> coll = Arrays.asList(ints);
109		try {
110	<	SynchronousQueue q = new SynchronousQueue();
119	<	Integer[] ints = new Integer[1];
120	<	q.addAll(Arrays.asList(ints));
110	>	q.addAll(coll);
111		shouldThrow();
112	<	}
123	<	catch (NullPointerException success) {}
112	>	} catch (IllegalStateException success) {}
113		}
125	–	/**
126	–	* addAll throws ISE if no active taker
127	–	*/
128	–	public void testAddAll4() {
129	–	try {
130	–	SynchronousQueue q = new SynchronousQueue();
131	–	Integer[] ints = new Integer[1];
132	–	for (int i = 0; i < 1; ++i)
133	–	ints[i] = new Integer(i);
134	–	q.addAll(Arrays.asList(ints));
135	–	shouldThrow();
136	–	}
137	–	catch (IllegalStateException success) {}
138	–	}
139	–
140	–	/**
141	–	* put(null) throws NPE
142	–	*/
143	–	public void testPutNull() {
144	–	try {
145	–	SynchronousQueue q = new SynchronousQueue();
146	–	q.put(null);
147	–	shouldThrow();
148	–	}
149	–	catch (NullPointerException success){
150	–	}
151	–	catch (InterruptedException ie) {
152	–	unexpectedException();
153	–	}
154	–	}
114
115		/**
116		* put blocks interruptibly if no active taker
117		*/
118	<	public void testBlockingPut() {
119	<	Thread t = new Thread(new Runnable() {
120	<	public void run() {
121	<	try {
122	<	SynchronousQueue q = new SynchronousQueue();
123	<	q.put(zero);
124	<	threadShouldThrow();
125	<	} catch (InterruptedException ie){
126	<	}
127	<	}});
128	<	t.start();
129	<	try {
130	<	Thread.sleep(SHORT_DELAY_MS);
172	<	t.interrupt();
173	<	t.join();
174	<	}
175	<	catch (InterruptedException ie) {
176	<	unexpectedException();
177	<	}
178	<	}
118	>	public void testBlockingPut()      { testBlockingPut(false); }
119	>	public void testBlockingPut_fair() { testBlockingPut(true); }
120	>	public void testBlockingPut(boolean fair) {
121	>	final SynchronousQueue q = new SynchronousQueue(fair);
122	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
123	>	Thread t = newStartedThread(new CheckedRunnable() {
124	>	public void realRun() throws InterruptedException {
125	>	Thread.currentThread().interrupt();
126	>	try {
127	>	q.put(99);
128	>	shouldThrow();
129	>	} catch (InterruptedException success) {}
130	>	assertFalse(Thread.interrupted());
131
132	<	/**
133	<	* put blocks waiting for take
134	<	*/
135	<	public void testPutWithTake() {
136	<	final SynchronousQueue q = new SynchronousQueue();
137	<	Thread t = new Thread(new Runnable() {
138	<	public void run() {
139	<	int added = 0;
140	<	try {
141	<	q.put(new Object());
142	<	++added;
143	<	q.put(new Object());
144	<	++added;
193	<	q.put(new Object());
194	<	++added;
195	<	q.put(new Object());
196	<	++added;
197	<	threadShouldThrow();
198	<	} catch (InterruptedException e){
199	<	assertTrue(added >= 1);
200	<	}
201	<	}
202	<	});
203	<	try {
204	<	t.start();
205	<	Thread.sleep(SHORT_DELAY_MS);
206	<	q.take();
207	<	Thread.sleep(SHORT_DELAY_MS);
208	<	t.interrupt();
209	<	t.join();
210	<	} catch (Exception e){
211	<	unexpectedException();
212	<	}
132	>	pleaseInterrupt.countDown();
133	>	try {
134	>	q.put(99);
135	>	shouldThrow();
136	>	} catch (InterruptedException success) {}
137	>	assertFalse(Thread.interrupted());
138	>	}});
139	>
140	>	await(pleaseInterrupt);
141	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
142	>	t.interrupt();
143	>	awaitTermination(t);
144	>	assertEquals(0, q.remainingCapacity());
145		}
146
147		/**
148	<	* timed offer times out if elements not taken
148	>	* put blocks interruptibly waiting for take
149		*/
150	<	public void testTimedOffer() {
151	<	final SynchronousQueue q = new SynchronousQueue();
152	<	Thread t = new Thread(new Runnable() {
153	<	public void run() {
154	<	try {
155	<
156	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
157	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
158	<	threadShouldThrow();
159	<	} catch (InterruptedException success){}
228	<	}
229	<	});
150	>	public void testPutWithTake()      { testPutWithTake(false); }
151	>	public void testPutWithTake_fair() { testPutWithTake(true); }
152	>	public void testPutWithTake(boolean fair) {
153	>	final SynchronousQueue q = new SynchronousQueue(fair);
154	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
155	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
156	>	Thread t = newStartedThread(new CheckedRunnable() {
157	>	public void realRun() throws InterruptedException {
158	>	pleaseTake.countDown();
159	>	q.put(one);
160
161	<	try {
162	<	t.start();
163	<	Thread.sleep(SMALL_DELAY_MS);
164	<	t.interrupt();
165	<	t.join();
166	<	} catch (Exception e){
237	<	unexpectedException();
238	<	}
239	<	}
240	<
241	<
242	<	/**
243	<	* take blocks interruptibly when empty
244	<	*/
245	<	public void testTakeFromEmpty() {
246	<	final SynchronousQueue q = new SynchronousQueue();
247	<	Thread t = new Thread(new Runnable() {
248	<	public void run() {
249	<	try {
250	<	q.take();
251	<	threadShouldThrow();
252	<	} catch (InterruptedException success){ }
253	<	}
254	<	});
255	<	try {
256	<	t.start();
257	<	Thread.sleep(SHORT_DELAY_MS);
258	<	t.interrupt();
259	<	t.join();
260	<	} catch (Exception e){
261	<	unexpectedException();
262	<	}
263	<	}
161	>	Thread.currentThread().interrupt();
162	>	try {
163	>	q.put(99);
164	>	shouldThrow();
165	>	} catch (InterruptedException success) {}
166	>	assertFalse(Thread.interrupted());
167
168	+	pleaseInterrupt.countDown();
169	+	try {
170	+	q.put(99);
171	+	shouldThrow();
172	+	} catch (InterruptedException success) {}
173	+	assertFalse(Thread.interrupted());
174	+	}});
175
176	<	/**
177	<	* put blocks interruptibly if no active taker
178	<	*/
179	<	public void testFairBlockingPut() {
270	<	Thread t = new Thread(new Runnable() {
271	<	public void run() {
272	<	try {
273	<	SynchronousQueue q = new SynchronousQueue(true);
274	<	q.put(zero);
275	<	threadShouldThrow();
276	<	} catch (InterruptedException ie){
277	<	}
278	<	}});
279	<	t.start();
280	<	try {
281	<	Thread.sleep(SHORT_DELAY_MS);
282	<	t.interrupt();
283	<	t.join();
284	<	}
285	<	catch (InterruptedException ie) {
286	<	unexpectedException();
287	<	}
288	<	}
176	>	await(pleaseTake);
177	>	assertEquals(0, q.remainingCapacity());
178	>	try { assertSame(one, q.take()); }
179	>	catch (InterruptedException e) { threadUnexpectedException(e); }
180
181	<	/**
182	<	* put blocks waiting for take
183	<	*/
184	<	public void testFairPutWithTake() {
185	<	final SynchronousQueue q = new SynchronousQueue(true);
295	<	Thread t = new Thread(new Runnable() {
296	<	public void run() {
297	<	int added = 0;
298	<	try {
299	<	q.put(new Object());
300	<	++added;
301	<	q.put(new Object());
302	<	++added;
303	<	q.put(new Object());
304	<	++added;
305	<	q.put(new Object());
306	<	++added;
307	<	threadShouldThrow();
308	<	} catch (InterruptedException e){
309	<	assertTrue(added >= 1);
310	<	}
311	<	}
312	<	});
313	<	try {
314	<	t.start();
315	<	Thread.sleep(SHORT_DELAY_MS);
316	<	q.take();
317	<	Thread.sleep(SHORT_DELAY_MS);
318	<	t.interrupt();
319	<	t.join();
320	<	} catch (Exception e){
321	<	unexpectedException();
322	<	}
181	>	await(pleaseInterrupt);
182	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
183	>	t.interrupt();
184	>	awaitTermination(t);
185	>	assertEquals(0, q.remainingCapacity());
186		}
187
188		/**
189		* timed offer times out if elements not taken
190		*/
191	<	public void testFairTimedOffer() {
192	<	final SynchronousQueue q = new SynchronousQueue(true);
193	<	Thread t = new Thread(new Runnable() {
194	<	public void run() {
195	<	try {
196	<
197	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
335	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
336	<	threadShouldThrow();
337	<	} catch (InterruptedException success){}
338	<	}
339	<	});
191	>	public void testTimedOffer() {
192	>	final boolean fair = randomBoolean();
193	>	final SynchronousQueue q = new SynchronousQueue(fair);
194	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
195	>	Thread t = newStartedThread(new CheckedRunnable() {
196	>	public void realRun() throws InterruptedException {
197	>	long startTime = System.nanoTime();
198
199	<	try {
200	<	t.start();
201	<	Thread.sleep(SMALL_DELAY_MS);
202	<	t.interrupt();
203	<	t.join();
204	<	} catch (Exception e){
205	<	unexpectedException();
206	<	}
207	<	}
199	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
200	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
201	>
202	>	Thread.currentThread().interrupt();
203	>	try {
204	>	q.offer(new Object(), randomTimeout(), randomTimeUnit());
205	>	shouldThrow();
206	>	} catch (InterruptedException success) {}
207	>	assertFalse(Thread.interrupted());
208
209	+	pleaseInterrupt.countDown();
210	+	try {
211	+	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
212	+	shouldThrow();
213	+	} catch (InterruptedException success) {}
214	+	assertFalse(Thread.interrupted());
215
216	<	/**
217	<	* take blocks interruptibly when empty
218	<	*/
219	<	public void testFairTakeFromEmpty() {
220	<	final SynchronousQueue q = new SynchronousQueue(true);
221	<	Thread t = new Thread(new Runnable() {
222	<	public void run() {
359	<	try {
360	<	q.take();
361	<	threadShouldThrow();
362	<	} catch (InterruptedException success){ }
363	<	}
364	<	});
365	<	try {
366	<	t.start();
367	<	Thread.sleep(SHORT_DELAY_MS);
368	<	t.interrupt();
369	<	t.join();
370	<	} catch (Exception e){
371	<	unexpectedException();
372	<	}
216	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
217	>	}});
218	>
219	>	await(pleaseInterrupt);
220	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
221	>	t.interrupt();
222	>	awaitTermination(t);
223		}
224
225		/**
226	<	* poll fails unless active taker
226	>	* poll return null if no active putter
227		*/
228	<	public void testPoll() {
229	<	SynchronousQueue q = new SynchronousQueue();
230	<	assertNull(q.poll());
228	>	public void testPoll()      { testPoll(false); }
229	>	public void testPoll_fair() { testPoll(true); }
230	>	public void testPoll(boolean fair) {
231	>	final SynchronousQueue q = new SynchronousQueue(fair);
232	>	assertNull(q.poll());
233		}
234
235		/**
236	<	* timed pool with zero timeout times out if no active taker
236	>	* timed poll with zero timeout times out if no active putter
237		*/
238	<	public void testTimedPoll0() {
239	<	try {
240	<	SynchronousQueue q = new SynchronousQueue();
241	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
242	<	} catch (InterruptedException e){
243	<	unexpectedException();
392	<	}
238	>	public void testTimedPoll0()      { testTimedPoll0(false); }
239	>	public void testTimedPoll0_fair() { testTimedPoll0(true); }
240	>	public void testTimedPoll0(boolean fair) {
241	>	final SynchronousQueue q = new SynchronousQueue(fair);
242	>	try { assertNull(q.poll(0, MILLISECONDS)); }
243	>	catch (InterruptedException e) { threadUnexpectedException(e); }
244		}
245
246		/**
247	<	* timed pool with nonzero timeout times out if no active taker
247	>	* timed poll with nonzero timeout times out if no active putter
248		*/
249		public void testTimedPoll() {
250	<	try {
251	<	SynchronousQueue q = new SynchronousQueue();
252	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
253	<	} catch (InterruptedException e){
254	<	unexpectedException();
255	<	}
250	>	final boolean fair = randomBoolean();
251	>	final SynchronousQueue q = new SynchronousQueue(fair);
252	>	final long startTime = System.nanoTime();
253	>	try { assertNull(q.poll(timeoutMillis(), MILLISECONDS)); }
254	>	catch (InterruptedException e) { threadUnexpectedException(e); }
255	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
256		}
257
258		/**
259	<	* Interrupted timed poll throws InterruptedException instead of
260	<	* returning timeout status
410	<	*/
411	<	public void testInterruptedTimedPoll() {
412	<	Thread t = new Thread(new Runnable() {
413	<	public void run() {
414	<	try {
415	<	SynchronousQueue q = new SynchronousQueue();
416	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
417	<	} catch (InterruptedException success){
418	<	}
419	<	}});
420	<	t.start();
421	<	try {
422	<	Thread.sleep(SHORT_DELAY_MS);
423	<	t.interrupt();
424	<	t.join();
425	<	}
426	<	catch (InterruptedException ie) {
427	<	unexpectedException();
428	<	}
429	<	}
430	<
431	<	/**
432	<	*  timed poll before a delayed offer fails; after offer succeeds;
433	<	*  on interruption throws
259	>	* timed poll before a delayed offer times out, returning null;
260	>	* after offer succeeds; on interruption throws
261		*/
262		public void testTimedPollWithOffer() {
263	<	final SynchronousQueue q = new SynchronousQueue();
264	<	Thread t = new Thread(new Runnable() {
265	<	public void run() {
266	<	try {
267	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
268	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
269	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
270	<	threadShouldThrow();
271	<	} catch (InterruptedException success) { }
272	<	}
273	<	});
274	<	try {
275	<	t.start();
449	<	Thread.sleep(SMALL_DELAY_MS);
450	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
451	<	t.interrupt();
452	<	t.join();
453	<	} catch (Exception e){
454	<	unexpectedException();
455	<	}
456	<	}
263	>	final boolean fair = randomBoolean();
264	>	final SynchronousQueue q = new SynchronousQueue(fair);
265	>	final CountDownLatch pleaseOffer = new CountDownLatch(1);
266	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
267	>	Thread t = newStartedThread(new CheckedRunnable() {
268	>	public void realRun() throws InterruptedException {
269	>	long startTime = System.nanoTime();
270	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
271	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
272	>
273	>	pleaseOffer.countDown();
274	>	startTime = System.nanoTime();
275	>	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
276
277	<	/**
278	<	* Interrupted timed poll throws InterruptedException instead of
279	<	* returning timeout status
280	<	*/
281	<	public void testFairInterruptedTimedPoll() {
282	<	Thread t = new Thread(new Runnable() {
464	<	public void run() {
465	<	try {
466	<	SynchronousQueue q = new SynchronousQueue(true);
467	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
468	<	} catch (InterruptedException success){
469	<	}
470	<	}});
471	<	t.start();
472	<	try {
473	<	Thread.sleep(SHORT_DELAY_MS);
474	<	t.interrupt();
475	<	t.join();
476	<	}
477	<	catch (InterruptedException ie) {
478	<	unexpectedException();
479	<	}
480	<	}
277	>	Thread.currentThread().interrupt();
278	>	try {
279	>	q.poll(randomTimeout(), randomTimeUnit());
280	>	shouldThrow();
281	>	} catch (InterruptedException success) {}
282	>	assertFalse(Thread.interrupted());
283
284	<	/**
285	<	*  timed poll before a delayed offer fails; after offer succeeds;
286	<	*  on interruption throws
287	<	*/
288	<	public void testFairTimedPollWithOffer() {
289	<	final SynchronousQueue q = new SynchronousQueue(true);
488	<	Thread t = new Thread(new Runnable() {
489	<	public void run() {
490	<	try {
491	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
492	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
493	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
494	<	threadShouldThrow();
495	<	} catch (InterruptedException success) { }
496	<	}
497	<	});
498	<	try {
499	<	t.start();
500	<	Thread.sleep(SMALL_DELAY_MS);
501	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
502	<	t.interrupt();
503	<	t.join();
504	<	} catch (Exception e){
505	<	unexpectedException();
506	<	}
507	<	}
284	>	pleaseInterrupt.countDown();
285	>	try {
286	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
287	>	shouldThrow();
288	>	} catch (InterruptedException success) {}
289	>	assertFalse(Thread.interrupted());
290
291	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
292	+	}});
293	+
294	+	await(pleaseOffer);
295	+	long startTime = System.nanoTime();
296	+	try { assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); }
297	+	catch (InterruptedException e) { threadUnexpectedException(e); }
298	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
299	+
300	+	await(pleaseInterrupt);
301	+	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
302	+	t.interrupt();
303	+	awaitTermination(t);
304	+	}
305
306		/**
307	<	* peek returns null
307	>	* peek() returns null if no active putter
308		*/
309	<	public void testPeek() {
310	<	SynchronousQueue q = new SynchronousQueue();
311	<	assertNull(q.peek());
309	>	public void testPeek()      { testPeek(false); }
310	>	public void testPeek_fair() { testPeek(true); }
311	>	public void testPeek(boolean fair) {
312	>	final SynchronousQueue q = new SynchronousQueue(fair);
313	>	assertNull(q.peek());
314		}
315
316		/**
317	<	* element throws NSEE
317	>	* element() throws NoSuchElementException if no active putter
318		*/
319	<	public void testElement() {
320	<	SynchronousQueue q = new SynchronousQueue();
319	>	public void testElement()      { testElement(false); }
320	>	public void testElement_fair() { testElement(true); }
321	>	public void testElement(boolean fair) {
322	>	final SynchronousQueue q = new SynchronousQueue(fair);
323		try {
324		q.element();
325		shouldThrow();
326	<	}
527	<	catch (NoSuchElementException success) {}
326	>	} catch (NoSuchElementException success) {}
327		}
328
329		/**
330	<	* remove throws NSEE if no active taker
330	>	* remove() throws NoSuchElementException if no active putter
331		*/
332	<	public void testRemove() {
333	<	SynchronousQueue q = new SynchronousQueue();
332	>	public void testRemove()      { testRemove(false); }
333	>	public void testRemove_fair() { testRemove(true); }
334	>	public void testRemove(boolean fair) {
335	>	final SynchronousQueue q = new SynchronousQueue(fair);
336		try {
337		q.remove();
338		shouldThrow();
339	<	} catch (NoSuchElementException success){
539	<	}
540	<	}
541	<
542	<	/**
543	<	* remove(x) returns false
544	<	*/
545	<	public void testRemoveElement() {
546	<	SynchronousQueue q = new SynchronousQueue();
547	<	assertFalse(q.remove(zero));
548	<	assertTrue(q.isEmpty());
339	>	} catch (NoSuchElementException success) {}
340		}
341
342		/**
343		* contains returns false
344		*/
345	<	public void testContains() {
346	<	SynchronousQueue q = new SynchronousQueue();
345	>	public void testContains()      { testContains(false); }
346	>	public void testContains_fair() { testContains(true); }
347	>	public void testContains(boolean fair) {
348	>	final SynchronousQueue q = new SynchronousQueue(fair);
349		assertFalse(q.contains(zero));
350		}
351
352		/**
353		* clear ensures isEmpty
354		*/
355	<	public void testClear() {
356	<	SynchronousQueue q = new SynchronousQueue();
355	>	public void testClear()      { testClear(false); }
356	>	public void testClear_fair() { testClear(true); }
357	>	public void testClear(boolean fair) {
358	>	final SynchronousQueue q = new SynchronousQueue(fair);
359		q.clear();
360		assertTrue(q.isEmpty());
361		}
#	Line 568 | Line 363 | public class SynchronousQueueTest extend
363		/**
364		* containsAll returns false unless empty
365		*/
366	<	public void testContainsAll() {
367	<	SynchronousQueue q = new SynchronousQueue();
366	>	public void testContainsAll()      { testContainsAll(false); }
367	>	public void testContainsAll_fair() { testContainsAll(true); }
368	>	public void testContainsAll(boolean fair) {
369	>	final SynchronousQueue q = new SynchronousQueue(fair);
370		Integer[] empty = new Integer[0];
371		assertTrue(q.containsAll(Arrays.asList(empty)));
372		Integer[] ints = new Integer[1]; ints[0] = zero;
#	Line 579 | Line 376 | public class SynchronousQueueTest extend
376		/**
377		* retainAll returns false
378		*/
379	<	public void testRetainAll() {
380	<	SynchronousQueue q = new SynchronousQueue();
379	>	public void testRetainAll()      { testRetainAll(false); }
380	>	public void testRetainAll_fair() { testRetainAll(true); }
381	>	public void testRetainAll(boolean fair) {
382	>	final SynchronousQueue q = new SynchronousQueue(fair);
383		Integer[] empty = new Integer[0];
384		assertFalse(q.retainAll(Arrays.asList(empty)));
385		Integer[] ints = new Integer[1]; ints[0] = zero;
#	Line 590 | Line 389 | public class SynchronousQueueTest extend
389		/**
390		* removeAll returns false
391		*/
392	<	public void testRemoveAll() {
393	<	SynchronousQueue q = new SynchronousQueue();
392	>	public void testRemoveAll()      { testRemoveAll(false); }
393	>	public void testRemoveAll_fair() { testRemoveAll(true); }
394	>	public void testRemoveAll(boolean fair) {
395	>	final SynchronousQueue q = new SynchronousQueue(fair);
396		Integer[] empty = new Integer[0];
397		assertFalse(q.removeAll(Arrays.asList(empty)));
398		Integer[] ints = new Integer[1]; ints[0] = zero;
399		assertFalse(q.containsAll(Arrays.asList(ints)));
400		}
401
601	–
402		/**
403		* toArray is empty
404		*/
405	<	public void testToArray() {
406	<	SynchronousQueue q = new SynchronousQueue();
407	<	Object[] o = q.toArray();
408	<	assertEquals(o.length, 0);
405	>	public void testToArray()      { testToArray(false); }
406	>	public void testToArray_fair() { testToArray(true); }
407	>	public void testToArray(boolean fair) {
408	>	final SynchronousQueue q = new SynchronousQueue(fair);
409	>	Object[] o = q.toArray();
410	>	assertEquals(0, o.length);
411		}
412
413		/**
414	<	* toArray(a) is nulled at position 0
415	<	*/
416	<	public void testToArray2() {
417	<	SynchronousQueue q = new SynchronousQueue();
418	<	Integer[] ints = new Integer[1];
419	<	assertNull(ints[0]);
414	>	* toArray(Integer array) returns its argument with the first
415	>	* element (if present) nulled out
416	>	*/
417	>	public void testToArray2()      { testToArray2(false); }
418	>	public void testToArray2_fair() { testToArray2(true); }
419	>	public void testToArray2(boolean fair) {
420	>	final SynchronousQueue<Integer> q = new SynchronousQueue<>(fair);
421	>	Integer[] a;
422	>
423	>	a = new Integer[0];
424	>	assertSame(a, q.toArray(a));
425	>
426	>	a = new Integer[3];
427	>	Arrays.fill(a, 42);
428	>	assertSame(a, q.toArray(a));
429	>	assertNull(a[0]);
430	>	for (int i = 1; i < a.length; i++)
431	>	assertEquals(42, (int) a[i]);
432		}
433
434		/**
435		* toArray(null) throws NPE
436		*/
437	<	public void testToArray_BadArg() {
438	<	try {
439	<	SynchronousQueue q = new SynchronousQueue();
440	<	Object o[] = q.toArray(null);
441	<	shouldThrow();
442	<	} catch (NullPointerException success){}
437	>	public void testToArray_null()      { testToArray_null(false); }
438	>	public void testToArray_null_fair() { testToArray_null(true); }
439	>	public void testToArray_null(boolean fair) {
440	>	final SynchronousQueue q = new SynchronousQueue(fair);
441	>	try {
442	>	Object[] o = q.toArray((Object[])null);
443	>	shouldThrow();
444	>	} catch (NullPointerException success) {}
445		}
446
631	–
447		/**
448		* iterator does not traverse any elements
449		*/
450	<	public void testIterator() {
451	<	SynchronousQueue q = new SynchronousQueue();
452	<	Iterator it = q.iterator();
453	<	assertFalse(it.hasNext());
639	<	try {
640	<	Object x = it.next();
641	<	shouldThrow();
642	<	}
643	<	catch (NoSuchElementException success) {}
450	>	public void testIterator()      { testIterator(false); }
451	>	public void testIterator_fair() { testIterator(true); }
452	>	public void testIterator(boolean fair) {
453	>	assertIteratorExhausted(new SynchronousQueue(fair).iterator());
454		}
455
456		/**
457	<	* iterator remove throws ISE
457	>	* iterator remove throws IllegalStateException
458		*/
459	<	public void testIteratorRemove() {
460	<	SynchronousQueue q = new SynchronousQueue();
461	<	Iterator it = q.iterator();
459	>	public void testIteratorRemove()      { testIteratorRemove(false); }
460	>	public void testIteratorRemove_fair() { testIteratorRemove(true); }
461	>	public void testIteratorRemove(boolean fair) {
462	>	final SynchronousQueue q = new SynchronousQueue(fair);
463	>	Iterator it = q.iterator();
464		try {
465		it.remove();
466		shouldThrow();
467	<	}
656	<	catch (IllegalStateException success) {}
467	>	} catch (IllegalStateException success) {}
468		}
469
470		/**
471		* toString returns a non-null string
472		*/
473	<	public void testToString() {
474	<	SynchronousQueue q = new SynchronousQueue();
473	>	public void testToString()      { testToString(false); }
474	>	public void testToString_fair() { testToString(true); }
475	>	public void testToString(boolean fair) {
476	>	final SynchronousQueue q = new SynchronousQueue(fair);
477		String s = q.toString();
478		assertNotNull(s);
479		}
480
668	–
481		/**
482		* offer transfers elements across Executor tasks
483		*/
484	<	public void testOfferInExecutor() {
485	<	final SynchronousQueue q = new SynchronousQueue();
486	<	ExecutorService executor = Executors.newFixedThreadPool(2);
487	<	final Integer one = new Integer(1);
488	<
489	<	executor.execute(new Runnable() {
490	<	public void run() {
491	<	threadAssertFalse(q.offer(one));
492	<	try {
493	<	threadAssertTrue(q.offer(one, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
494	<	threadAssertEquals(0, q.remainingCapacity());
495	<	}
496	<	catch (InterruptedException e) {
497	<	threadUnexpectedException();
498	<	}
687	<	}
688	<	});
689	<
690	<	executor.execute(new Runnable() {
691	<	public void run() {
692	<	try {
693	<	Thread.sleep(SMALL_DELAY_MS);
694	<	threadAssertEquals(one, q.take());
695	<	}
696	<	catch (InterruptedException e) {
697	<	threadUnexpectedException();
698	<	}
699	<	}
700	<	});
701	<
702	<	joinPool(executor);
703	<
704	<	}
705	<
706	<	/**
707	<	* poll retrieves elements across Executor threads
708	<	*/
709	<	public void testPollInExecutor() {
710	<	final SynchronousQueue q = new SynchronousQueue();
711	<	ExecutorService executor = Executors.newFixedThreadPool(2);
712	<	executor.execute(new Runnable() {
713	<	public void run() {
714	<	threadAssertNull(q.poll());
715	<	try {
716	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
717	<	threadAssertTrue(q.isEmpty());
718	<	}
719	<	catch (InterruptedException e) {
720	<	threadUnexpectedException();
721	<	}
722	<	}
723	<	});
724	<
725	<	executor.execute(new Runnable() {
726	<	public void run() {
727	<	try {
728	<	Thread.sleep(SMALL_DELAY_MS);
729	<	q.put(new Integer(1));
730	<	}
731	<	catch (InterruptedException e) {
732	<	threadUnexpectedException();
733	<	}
734	<	}
735	<	});
736	<
737	<	joinPool(executor);
738	<	}
484	>	public void testOfferInExecutor()      { testOfferInExecutor(false); }
485	>	public void testOfferInExecutor_fair() { testOfferInExecutor(true); }
486	>	public void testOfferInExecutor(boolean fair) {
487	>	final SynchronousQueue q = new SynchronousQueue(fair);
488	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
489	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
490	>	try (PoolCleaner cleaner = cleaner(executor)) {
491	>
492	>	executor.execute(new CheckedRunnable() {
493	>	public void realRun() throws InterruptedException {
494	>	assertFalse(q.offer(one));
495	>	threadsStarted.await();
496	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
497	>	assertEquals(0, q.remainingCapacity());
498	>	}});
499
500	<	/**
501	<	* a deserialized serialized queue is usable
502	<	*/
503	<	public void testSerialization() {
504	<	SynchronousQueue q = new SynchronousQueue();
745	<	try {
746	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
747	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
748	<	out.writeObject(q);
749	<	out.close();
750	<
751	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
752	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
753	<	SynchronousQueue r = (SynchronousQueue)in.readObject();
754	<	assertEquals(q.size(), r.size());
755	<	while (!q.isEmpty())
756	<	assertEquals(q.remove(), r.remove());
757	<	} catch (Exception e){
758	<	e.printStackTrace();
759	<	unexpectedException();
500	>	executor.execute(new CheckedRunnable() {
501	>	public void realRun() throws InterruptedException {
502	>	threadsStarted.await();
503	>	assertSame(one, q.take());
504	>	}});
505		}
506		}
507
508		/**
509	<	* drainTo(null) throws NPE
509	>	* timed poll retrieves elements across Executor threads
510		*/
511	<	public void testDrainToNull() {
512	<	SynchronousQueue q = new SynchronousQueue();
513	<	try {
514	<	q.drainTo(null);
515	<	shouldThrow();
516	<	} catch (NullPointerException success) {
511	>	public void testPollInExecutor()      { testPollInExecutor(false); }
512	>	public void testPollInExecutor_fair() { testPollInExecutor(true); }
513	>	public void testPollInExecutor(boolean fair) {
514	>	final SynchronousQueue q = new SynchronousQueue(fair);
515	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
516	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
517	>	try (PoolCleaner cleaner = cleaner(executor)) {
518	>	executor.execute(new CheckedRunnable() {
519	>	public void realRun() throws InterruptedException {
520	>	assertNull(q.poll());
521	>	threadsStarted.await();
522	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
523	>	assertTrue(q.isEmpty());
524	>	}});
525	>
526	>	executor.execute(new CheckedRunnable() {
527	>	public void realRun() throws InterruptedException {
528	>	threadsStarted.await();
529	>	q.put(one);
530	>	}});
531		}
532		}
533
534		/**
535	<	* drainTo(this) throws IAE
535	>	* a deserialized/reserialized queue is usable
536		*/
537	<	public void testDrainToSelf() {
538	<	SynchronousQueue q = new SynchronousQueue();
539	<	try {
540	<	q.drainTo(q);
541	<	shouldThrow();
542	<	} catch (IllegalArgumentException success) {
537	>	public void testSerialization() {
538	>	final SynchronousQueue x = new SynchronousQueue();
539	>	final SynchronousQueue y = new SynchronousQueue(false);
540	>	final SynchronousQueue z = new SynchronousQueue(true);
541	>	assertSerialEquals(x, y);
542	>	assertNotSerialEquals(x, z);
543	>	SynchronousQueue[] qs = { x, y, z };
544	>	for (SynchronousQueue q : qs) {
545	>	SynchronousQueue clone = serialClone(q);
546	>	assertNotSame(q, clone);
547	>	assertSerialEquals(q, clone);
548	>	assertTrue(clone.isEmpty());
549	>	assertEquals(0, clone.size());
550	>	assertEquals(0, clone.remainingCapacity());
551	>	assertFalse(clone.offer(zero));
552		}
553		}
554
555		/**
556		* drainTo(c) of empty queue doesn't transfer elements
557		*/
558	<	public void testDrainTo() {
559	<	SynchronousQueue q = new SynchronousQueue();
558	>	public void testDrainTo()      { testDrainTo(false); }
559	>	public void testDrainTo_fair() { testDrainTo(true); }
560	>	public void testDrainTo(boolean fair) {
561	>	final SynchronousQueue q = new SynchronousQueue(fair);
562		ArrayList l = new ArrayList();
563		q.drainTo(l);
564	<	assertEquals(q.size(), 0);
565	<	assertEquals(l.size(), 0);
564	>	assertEquals(0, q.size());
565	>	assertEquals(0, l.size());
566		}
567
568		/**
569		* drainTo empties queue, unblocking a waiting put.
570		*/
571	<	public void testDrainToWithActivePut() {
572	<	final SynchronousQueue q = new SynchronousQueue();
573	<	Thread t = new Thread(new Runnable() {
574	<	public void run() {
575	<	try {
576	<	q.put(new Integer(1));
577	<	} catch (InterruptedException ie){
578	<	threadUnexpectedException();
809	<	}
810	<	}
811	<	});
812	<	try {
813	<	t.start();
814	<	ArrayList l = new ArrayList();
815	<	Thread.sleep(SHORT_DELAY_MS);
816	<	q.drainTo(l);
817	<	assertTrue(l.size() <= 1);
818	<	if (l.size() > 0)
819	<	assertEquals(l.get(0), new Integer(1));
820	<	t.join();
821	<	assertTrue(l.size() <= 1);
822	<	} catch (Exception e){
823	<	unexpectedException();
824	<	}
825	<	}
826	<
827	<	/**
828	<	* drainTo(null, n) throws NPE
829	<	*/
830	<	public void testDrainToNullN() {
831	<	SynchronousQueue q = new SynchronousQueue();
832	<	try {
833	<	q.drainTo(null, 0);
834	<	shouldThrow();
835	<	} catch (NullPointerException success) {
836	<	}
837	<	}
571	>	public void testDrainToWithActivePut()      { testDrainToWithActivePut(false); }
572	>	public void testDrainToWithActivePut_fair() { testDrainToWithActivePut(true); }
573	>	public void testDrainToWithActivePut(boolean fair) {
574	>	final SynchronousQueue q = new SynchronousQueue(fair);
575	>	Thread t = newStartedThread(new CheckedRunnable() {
576	>	public void realRun() throws InterruptedException {
577	>	q.put(one);
578	>	}});
579
580	<	/**
581	<	* drainTo(this, n) throws IAE
582	<	*/
583	<	public void testDrainToSelfN() {
584	<	SynchronousQueue q = new SynchronousQueue();
585	<	try {
586	<	q.drainTo(q, 0);
587	<	shouldThrow();
588	<	} catch (IllegalArgumentException success) {
589	<	}
580	>	ArrayList l = new ArrayList();
581	>	long startTime = System.nanoTime();
582	>	while (l.isEmpty()) {
583	>	q.drainTo(l);
584	>	if (millisElapsedSince(startTime) > LONG_DELAY_MS)
585	>	fail("timed out");
586	>	Thread.yield();
587	>	}
588	>	assertEquals(1, l.size());
589	>	assertSame(one, l.get(0));
590	>	awaitTermination(t);
591		}
592
593		/**
594		* drainTo(c, n) empties up to n elements of queue into c
595		*/
596	<	public void testDrainToN() {
596	>	public void testDrainToN() throws InterruptedException {
597		final SynchronousQueue q = new SynchronousQueue();
598	<	Thread t1 = new Thread(new Runnable() {
599	<	public void run() {
600	<	try {
601	<	q.put(one);
602	<	} catch (InterruptedException ie){
603	<	threadUnexpectedException();
604	<	}
605	<	}
606	<	});
865	<	Thread t2 = new Thread(new Runnable() {
866	<	public void run() {
867	<	try {
868	<	q.put(two);
869	<	} catch (InterruptedException ie){
870	<	threadUnexpectedException();
871	<	}
872	<	}
873	<	});
598	>	Thread t1 = newStartedThread(new CheckedRunnable() {
599	>	public void realRun() throws InterruptedException {
600	>	q.put(one);
601	>	}});
602	>
603	>	Thread t2 = newStartedThread(new CheckedRunnable() {
604	>	public void realRun() throws InterruptedException {
605	>	q.put(two);
606	>	}});
607
608	<	try {
609	<	t1.start();
610	<	t2.start();
611	<	ArrayList l = new ArrayList();
612	<	Thread.sleep(SHORT_DELAY_MS);
613	<	q.drainTo(l, 1);
614	<	assertTrue(l.size() == 1);
615	<	q.drainTo(l, 1);
616	<	assertTrue(l.size() == 2);
617	<	assertTrue(l.contains(one));
618	<	assertTrue(l.contains(two));
619	<	t1.join();
887	<	t2.join();
888	<	} catch (Exception e){
889	<	unexpectedException();
890	<	}
608	>	ArrayList l = new ArrayList();
609	>	int drained;
610	>	while ((drained = q.drainTo(l, 1)) == 0) Thread.yield();
611	>	assertEquals(1, drained);
612	>	assertEquals(1, l.size());
613	>	while ((drained = q.drainTo(l, 1)) == 0) Thread.yield();
614	>	assertEquals(1, drained);
615	>	assertEquals(2, l.size());
616	>	assertTrue(l.contains(one));
617	>	assertTrue(l.contains(two));
618	>	awaitTermination(t1);
619	>	awaitTermination(t2);
620		}
621
622	+	/**
623	+	* remove(null), contains(null) always return false
624	+	*/
625	+	public void testNeverContainsNull() {
626	+	Collection<?> q = new SynchronousQueue();
627	+	assertFalse(q.contains(null));
628	+	assertFalse(q.remove(null));
629	+	}
630
631		}

Diff Legend

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