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

Diff Legend

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