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

Diff Legend

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