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.15 by jsr166, Sat Nov 21 19:11:53 2009 UTC vs.
Revision 1.44 by jsr166, Wed Dec 31 19:05:43 2014 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	>
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());
33	<	assertFalse(q.offer(zero));
38	>	public static void main(String[] args) {
39	>	junit.textui.TestRunner.run(suite());
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());
57		assertEquals(0, q.remainingCapacity());
#	Line 45 | Line 59 | public class SynchronousQueueTest extend
59		}
60
61		/**
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	–	/**
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() {
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 {
82	–	SynchronousQueue q = new SynchronousQueue();
83	–	assertEquals(0, q.remainingCapacity());
80		q.add(one);
81		shouldThrow();
82		} catch (IllegalStateException success) {}
83		}
84
85		/**
86	<	* addAll(null) throws NPE
86	>	* addAll(this) throws IllegalArgumentException
87		*/
88	<	public void testAddAll1() {
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 {
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();
93		q.addAll(q);
94		shouldThrow();
95		} catch (IllegalArgumentException success) {}
96		}
97
98		/**
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	–	/**
99		* addAll throws ISE if no active taker
100		*/
101	<	public void testAddAll4() {
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();
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));
110	>	q.addAll(coll);
111		shouldThrow();
112		} catch (IllegalStateException success) {}
113		}
114
115		/**
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	–	/**
116		* put blocks interruptibly if no active taker
117		*/
118	<	public void testBlockingPut() throws InterruptedException {
119	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
120	<	public void realRun() throws InterruptedException {
121	<	SynchronousQueue q = new SynchronousQueue();
122	<	q.put(zero);
123	<	}});
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() {
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	<	int added = 0;
125	>	Thread.currentThread().interrupt();
126		try {
127	<	q.put(new Object());
128	<	++added;
129	<	q.put(new Object());
130	<	++added;
176	<	q.put(new Object());
177	<	++added;
178	<	q.put(new Object());
179	<	++added;
180	<	threadShouldThrow();
181	<	} catch (InterruptedException success) {
182	<	assertTrue(added >= 1);
183	<	}
184	<	}});
185	<
186	<	t.start();
187	<	Thread.sleep(SHORT_DELAY_MS);
188	<	q.take();
189	<	Thread.sleep(SHORT_DELAY_MS);
190	<	t.interrupt();
191	<	t.join();
192	<	}
127	>	q.put(99);
128	>	shouldThrow();
129	>	} catch (InterruptedException success) {}
130	>	assertFalse(Thread.interrupted());
131
132	<	/**
133	<	* timed offer times out if elements not taken
134	<	*/
135	<	public void testTimedOffer() throws InterruptedException {
136	<	final SynchronousQueue q = new SynchronousQueue();
137	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
200	<	public void realRun() throws InterruptedException {
201	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS));
202	<	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
132	>	pleaseInterrupt.countDown();
133	>	try {
134	>	q.put(99);
135	>	shouldThrow();
136	>	} catch (InterruptedException success) {}
137	>	assertFalse(Thread.interrupted());
138		}});
139
140	<	t.start();
141	<	Thread.sleep(SMALL_DELAY_MS);
140	>	await(pleaseInterrupt);
141	>	assertThreadStaysAlive(t);
142		t.interrupt();
143	<	t.join();
143	>	awaitTermination(t);
144	>	assertEquals(0, q.remainingCapacity());
145		}
146
211	–
147		/**
148	<	* take blocks interruptibly when empty
148	>	* put blocks interruptibly waiting for take
149		*/
150	<	public void testTakeFromEmpty() throws InterruptedException {
151	<	final SynchronousQueue q = new SynchronousQueue();
152	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
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	<	q.take();
159	<	}});
221	<
222	<	t.start();
223	<	Thread.sleep(SHORT_DELAY_MS);
224	<	t.interrupt();
225	<	t.join();
226	<	}
227	<
158	>	pleaseTake.countDown();
159	>	q.put(one);
160
161	<	/**
162	<	* put blocks interruptibly if no active taker
163	<	*/
164	<	public void testFairBlockingPut() throws InterruptedException {
165	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
166	<	public void realRun() throws InterruptedException {
235	<	SynchronousQueue q = new SynchronousQueue(true);
236	<	q.put(zero);
161	>	pleaseInterrupt.countDown();
162	>	try {
163	>	q.put(99);
164	>	shouldThrow();
165	>	} catch (InterruptedException success) {}
166	>	assertFalse(Thread.interrupted());
167		}});
168
169	<	t.start();
170	<	Thread.sleep(SHORT_DELAY_MS);
171	<	t.interrupt();
172	<	t.join();
243	<	}
169	>	await(pleaseTake);
170	>	assertEquals(0, q.remainingCapacity());
171	>	try { assertSame(one, q.take()); }
172	>	catch (InterruptedException e) { threadUnexpectedException(e); }
173
174	<	/**
175	<	* put blocks waiting for take
247	<	*/
248	<	public void testFairPutWithTake() throws InterruptedException {
249	<	final SynchronousQueue q = new SynchronousQueue(true);
250	<	Thread t = new Thread(new CheckedRunnable() {
251	<	public void realRun() throws InterruptedException {
252	<	int added = 0;
253	<	try {
254	<	q.put(new Object());
255	<	++added;
256	<	q.put(new Object());
257	<	++added;
258	<	q.put(new Object());
259	<	++added;
260	<	q.put(new Object());
261	<	++added;
262	<	threadShouldThrow();
263	<	} catch (InterruptedException success) {
264	<	assertTrue(added >= 1);
265	<	}
266	<	}});
267	<
268	<	t.start();
269	<	Thread.sleep(SHORT_DELAY_MS);
270	<	q.take();
271	<	Thread.sleep(SHORT_DELAY_MS);
174	>	await(pleaseInterrupt);
175	>	assertThreadStaysAlive(t);
176		t.interrupt();
177	<	t.join();
177	>	awaitTermination(t);
178	>	assertEquals(0, q.remainingCapacity());
179		}
180
181		/**
182		* timed offer times out if elements not taken
183		*/
184	<	public void testFairTimedOffer() throws InterruptedException {
185	<	final SynchronousQueue q = new SynchronousQueue(true);
186	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
187	<	public void realRun() throws InterruptedException {
188	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS));
189	<	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
190	<	}});
191	<
192	<	t.start();
193	<	Thread.sleep(SMALL_DELAY_MS);
194	<	t.interrupt();
195	<	t.join();
196	<	}
197	<
198	<
294	<	/**
295	<	* take blocks interruptibly when empty
296	<	*/
297	<	public void testFairTakeFromEmpty() throws InterruptedException {
298	<	final SynchronousQueue q = new SynchronousQueue(true);
299	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
300	<	public void realRun() throws InterruptedException {
301	<	q.take();
184	>	public void testTimedOffer()      { testTimedOffer(false); }
185	>	public void testTimedOffer_fair() { testTimedOffer(true); }
186	>	public void testTimedOffer(boolean fair) {
187	>	final SynchronousQueue q = new SynchronousQueue(fair);
188	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
189	>	Thread t = newStartedThread(new CheckedRunnable() {
190	>	public void realRun() throws InterruptedException {
191	>	long startTime = System.nanoTime();
192	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
193	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
194	>	pleaseInterrupt.countDown();
195	>	try {
196	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
197	>	shouldThrow();
198	>	} catch (InterruptedException success) {}
199		}});
200
201	<	t.start();
202	<	Thread.sleep(SHORT_DELAY_MS);
201	>	await(pleaseInterrupt);
202	>	assertThreadStaysAlive(t);
203		t.interrupt();
204	<	t.join();
204	>	awaitTermination(t);
205		}
206
207		/**
208	<	* poll fails unless active taker
208	>	* poll return null if no active putter
209		*/
210	<	public void testPoll() {
211	<	SynchronousQueue q = new SynchronousQueue();
210	>	public void testPoll()      { testPoll(false); }
211	>	public void testPoll_fair() { testPoll(true); }
212	>	public void testPoll(boolean fair) {
213	>	final SynchronousQueue q = new SynchronousQueue(fair);
214		assertNull(q.poll());
215		}
216
217		/**
218	<	* timed pool with zero timeout times out if no active taker
218	>	* timed poll with zero timeout times out if no active putter
219		*/
220	<	public void testTimedPoll0() throws InterruptedException {
221	<	SynchronousQueue q = new SynchronousQueue();
222	<	assertNull(q.poll(0, MILLISECONDS));
220	>	public void testTimedPoll0()      { testTimedPoll0(false); }
221	>	public void testTimedPoll0_fair() { testTimedPoll0(true); }
222	>	public void testTimedPoll0(boolean fair) {
223	>	final SynchronousQueue q = new SynchronousQueue(fair);
224	>	try { assertNull(q.poll(0, MILLISECONDS)); }
225	>	catch (InterruptedException e) { threadUnexpectedException(e); }
226		}
227
228		/**
229	<	* timed pool with nonzero timeout times out if no active taker
229	>	* timed poll with nonzero timeout times out if no active putter
230		*/
231	<	public void testTimedPoll() throws InterruptedException {
232	<	SynchronousQueue q = new SynchronousQueue();
233	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
231	>	public void testTimedPoll()      { testTimedPoll(false); }
232	>	public void testTimedPoll_fair() { testTimedPoll(true); }
233	>	public void testTimedPoll(boolean fair) {
234	>	final SynchronousQueue q = new SynchronousQueue(fair);
235	>	long startTime = System.nanoTime();
236	>	try { assertNull(q.poll(timeoutMillis(), MILLISECONDS)); }
237	>	catch (InterruptedException e) { threadUnexpectedException(e); }
238	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
239		}
240
241		/**
242	<	* Interrupted timed poll throws InterruptedException instead of
243	<	* returning timeout status
242	>	* timed poll before a delayed offer times out, returning null;
243	>	* after offer succeeds; on interruption throws
244		*/
245	<	public void testInterruptedTimedPoll() throws InterruptedException {
246	<	final SynchronousQueue q = new SynchronousQueue();
247	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
245	>	public void testTimedPollWithOffer()      { testTimedPollWithOffer(false); }
246	>	public void testTimedPollWithOffer_fair() { testTimedPollWithOffer(true); }
247	>	public void testTimedPollWithOffer(boolean fair) {
248	>	final SynchronousQueue q = new SynchronousQueue(fair);
249	>	final CountDownLatch pleaseOffer = new CountDownLatch(1);
250	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
251	>	Thread t = newStartedThread(new CheckedRunnable() {
252		public void realRun() throws InterruptedException {
253	<	q.poll(SMALL_DELAY_MS, MILLISECONDS);
254	<	}});
255	<
345	<	t.start();
346	<	Thread.sleep(SHORT_DELAY_MS);
347	<	t.interrupt();
348	<	t.join();
349	<	}
253	>	long startTime = System.nanoTime();
254	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
255	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
256
257	<	/**
258	<	*  timed poll before a delayed offer fails; after offer succeeds;
353	<	*  on interruption throws
354	<	*/
355	<	public void testTimedPollWithOffer() throws InterruptedException {
356	<	final SynchronousQueue q = new SynchronousQueue();
357	<	Thread t = new Thread(new CheckedRunnable() {
358	<	public void realRun() throws InterruptedException {
359	<	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
257	>	pleaseOffer.countDown();
258	>	startTime = System.nanoTime();
259		assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
260	+	assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS);
261	+
262	+	Thread.currentThread().interrupt();
263		try {
264		q.poll(LONG_DELAY_MS, MILLISECONDS);
265	<	threadShouldThrow();
265	>	shouldThrow();
266		} catch (InterruptedException success) {}
267	<	}});
267	>	assertFalse(Thread.interrupted());
268
269	<	t.start();
368	<	Thread.sleep(SMALL_DELAY_MS);
369	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
370	<	t.interrupt();
371	<	t.join();
372	<	}
373	<
374	<	/**
375	<	* Interrupted timed poll throws InterruptedException instead of
376	<	* returning timeout status
377	<	*/
378	<	public void testFairInterruptedTimedPoll() throws InterruptedException {
379	<	Thread t = new Thread(new CheckedInterruptedRunnable() {
380	<	public void realRun() throws InterruptedException {
381	<	SynchronousQueue q = new SynchronousQueue(true);
382	<	q.poll(SMALL_DELAY_MS, MILLISECONDS);
383	<	}});
384	<
385	<	t.start();
386	<	Thread.sleep(SHORT_DELAY_MS);
387	<	t.interrupt();
388	<	t.join();
389	<	}
390	<
391	<	/**
392	<	*  timed poll before a delayed offer fails; after offer succeeds;
393	<	*  on interruption throws
394	<	*/
395	<	public void testFairTimedPollWithOffer() throws InterruptedException {
396	<	final SynchronousQueue q = new SynchronousQueue(true);
397	<	Thread t = new Thread(new CheckedRunnable() {
398	<	public void realRun() throws InterruptedException {
399	<	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
400	<	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
269	>	pleaseInterrupt.countDown();
270		try {
271		q.poll(LONG_DELAY_MS, MILLISECONDS);
272	<	threadShouldThrow();
272	>	shouldThrow();
273		} catch (InterruptedException success) {}
274	+	assertFalse(Thread.interrupted());
275		}});
276
277	<	t.start();
278	<	Thread.sleep(SMALL_DELAY_MS);
279	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
277	>	await(pleaseOffer);
278	>	long startTime = System.nanoTime();
279	>	try { assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); }
280	>	catch (InterruptedException e) { threadUnexpectedException(e); }
281	>	assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS);
282	>
283	>	await(pleaseInterrupt);
284	>	assertThreadStaysAlive(t);
285		t.interrupt();
286	<	t.join();
286	>	awaitTermination(t);
287		}
288
414	–
289		/**
290	<	* peek returns null
290	>	* peek() returns null if no active putter
291		*/
292	<	public void testPeek() {
293	<	SynchronousQueue q = new SynchronousQueue();
292	>	public void testPeek()      { testPeek(false); }
293	>	public void testPeek_fair() { testPeek(true); }
294	>	public void testPeek(boolean fair) {
295	>	final SynchronousQueue q = new SynchronousQueue(fair);
296		assertNull(q.peek());
297		}
298
299		/**
300	<	* element throws NSEE
300	>	* element() throws NoSuchElementException if no active putter
301		*/
302	<	public void testElement() {
303	<	SynchronousQueue q = new SynchronousQueue();
302	>	public void testElement()      { testElement(false); }
303	>	public void testElement_fair() { testElement(true); }
304	>	public void testElement(boolean fair) {
305	>	final SynchronousQueue q = new SynchronousQueue(fair);
306		try {
307		q.element();
308		shouldThrow();
#	Line 432 | Line 310 | public class SynchronousQueueTest extend
310		}
311
312		/**
313	<	* remove throws NSEE if no active taker
313	>	* remove() throws NoSuchElementException if no active putter
314		*/
315	<	public void testRemove() {
316	<	SynchronousQueue q = new SynchronousQueue();
315	>	public void testRemove()      { testRemove(false); }
316	>	public void testRemove_fair() { testRemove(true); }
317	>	public void testRemove(boolean fair) {
318	>	final SynchronousQueue q = new SynchronousQueue(fair);
319		try {
320		q.remove();
321		shouldThrow();
322	<	} catch (NoSuchElementException success) {
443	<	}
444	<	}
445	<
446	<	/**
447	<	* remove(x) returns false
448	<	*/
449	<	public void testRemoveElement() {
450	<	SynchronousQueue q = new SynchronousQueue();
451	<	assertFalse(q.remove(zero));
452	<	assertTrue(q.isEmpty());
322	>	} catch (NoSuchElementException success) {}
323		}
324
325		/**
326		* contains returns false
327		*/
328	<	public void testContains() {
329	<	SynchronousQueue q = new SynchronousQueue();
328	>	public void testContains()      { testContains(false); }
329	>	public void testContains_fair() { testContains(true); }
330	>	public void testContains(boolean fair) {
331	>	final SynchronousQueue q = new SynchronousQueue(fair);
332		assertFalse(q.contains(zero));
333		}
334
335		/**
336		* clear ensures isEmpty
337		*/
338	<	public void testClear() {
339	<	SynchronousQueue q = new SynchronousQueue();
338	>	public void testClear()      { testClear(false); }
339	>	public void testClear_fair() { testClear(true); }
340	>	public void testClear(boolean fair) {
341	>	final SynchronousQueue q = new SynchronousQueue(fair);
342		q.clear();
343		assertTrue(q.isEmpty());
344		}
#	Line 472 | Line 346 | public class SynchronousQueueTest extend
346		/**
347		* containsAll returns false unless empty
348		*/
349	<	public void testContainsAll() {
350	<	SynchronousQueue q = new SynchronousQueue();
349	>	public void testContainsAll()      { testContainsAll(false); }
350	>	public void testContainsAll_fair() { testContainsAll(true); }
351	>	public void testContainsAll(boolean fair) {
352	>	final SynchronousQueue q = new SynchronousQueue(fair);
353		Integer[] empty = new Integer[0];
354		assertTrue(q.containsAll(Arrays.asList(empty)));
355		Integer[] ints = new Integer[1]; ints[0] = zero;
#	Line 483 | Line 359 | public class SynchronousQueueTest extend
359		/**
360		* retainAll returns false
361		*/
362	<	public void testRetainAll() {
363	<	SynchronousQueue q = new SynchronousQueue();
362	>	public void testRetainAll()      { testRetainAll(false); }
363	>	public void testRetainAll_fair() { testRetainAll(true); }
364	>	public void testRetainAll(boolean fair) {
365	>	final SynchronousQueue q = new SynchronousQueue(fair);
366		Integer[] empty = new Integer[0];
367		assertFalse(q.retainAll(Arrays.asList(empty)));
368		Integer[] ints = new Integer[1]; ints[0] = zero;
#	Line 494 | Line 372 | public class SynchronousQueueTest extend
372		/**
373		* removeAll returns false
374		*/
375	<	public void testRemoveAll() {
376	<	SynchronousQueue q = new SynchronousQueue();
375	>	public void testRemoveAll()      { testRemoveAll(false); }
376	>	public void testRemoveAll_fair() { testRemoveAll(true); }
377	>	public void testRemoveAll(boolean fair) {
378	>	final SynchronousQueue q = new SynchronousQueue(fair);
379		Integer[] empty = new Integer[0];
380		assertFalse(q.removeAll(Arrays.asList(empty)));
381		Integer[] ints = new Integer[1]; ints[0] = zero;
382		assertFalse(q.containsAll(Arrays.asList(ints)));
383		}
384
505	–
385		/**
386		* toArray is empty
387		*/
388	<	public void testToArray() {
389	<	SynchronousQueue q = new SynchronousQueue();
388	>	public void testToArray()      { testToArray(false); }
389	>	public void testToArray_fair() { testToArray(true); }
390	>	public void testToArray(boolean fair) {
391	>	final SynchronousQueue q = new SynchronousQueue(fair);
392		Object[] o = q.toArray();
393	<	assertEquals(o.length, 0);
393	>	assertEquals(0, o.length);
394		}
395
396		/**
397	<	* toArray(a) is nulled at position 0
397	>	* toArray(Integer array) returns its argument with the first
398	>	* element (if present) nulled out
399		*/
400	<	public void testToArray2() {
401	<	SynchronousQueue q = new SynchronousQueue();
402	<	Integer[] ints = new Integer[1];
403	<	assertNull(ints[0]);
400	>	public void testToArray2()      { testToArray2(false); }
401	>	public void testToArray2_fair() { testToArray2(true); }
402	>	public void testToArray2(boolean fair) {
403	>	final SynchronousQueue<Integer> q
404	>	= new SynchronousQueue<Integer>(fair);
405	>	Integer[] a;
406	>
407	>	a = new Integer[0];
408	>	assertSame(a, q.toArray(a));
409	>
410	>	a = new Integer[3];
411	>	Arrays.fill(a, 42);
412	>	assertSame(a, q.toArray(a));
413	>	assertNull(a[0]);
414	>	for (int i = 1; i < a.length; i++)
415	>	assertEquals(42, (int) a[i]);
416		}
417
418		/**
419		* toArray(null) throws NPE
420		*/
421	<	public void testToArray_BadArg() {
421	>	public void testToArray_null()      { testToArray_null(false); }
422	>	public void testToArray_null_fair() { testToArray_null(true); }
423	>	public void testToArray_null(boolean fair) {
424	>	final SynchronousQueue q = new SynchronousQueue(fair);
425		try {
529	–	SynchronousQueue q = new SynchronousQueue();
426		Object o[] = q.toArray(null);
427		shouldThrow();
428		} catch (NullPointerException success) {}
429		}
430
535	–
431		/**
432		* iterator does not traverse any elements
433		*/
434	<	public void testIterator() {
435	<	SynchronousQueue q = new SynchronousQueue();
434	>	public void testIterator()      { testIterator(false); }
435	>	public void testIterator_fair() { testIterator(true); }
436	>	public void testIterator(boolean fair) {
437	>	final SynchronousQueue q = new SynchronousQueue(fair);
438		Iterator it = q.iterator();
439		assertFalse(it.hasNext());
440		try {
#	Line 549 | Line 446 | public class SynchronousQueueTest extend
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 561 | 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
570	–
471		/**
472		* offer transfers elements across Executor tasks
473		*/
474	<	public void testOfferInExecutor() {
475	<	final SynchronousQueue q = new SynchronousQueue();
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		ExecutorService executor = Executors.newFixedThreadPool(2);
479	<	final Integer one = new Integer(1);
479	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
480
481		executor.execute(new CheckedRunnable() {
482		public void realRun() throws InterruptedException {
483	<	threadAssertFalse(q.offer(one));
484	<	threadAssertTrue(q.offer(one, MEDIUM_DELAY_MS, MILLISECONDS));
485	<	threadAssertEquals(0, q.remainingCapacity());
483	>	assertFalse(q.offer(one));
484	>	threadsStarted.await();
485	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
486	>	assertEquals(0, q.remainingCapacity());
487		}});
488
489		executor.execute(new CheckedRunnable() {
490		public void realRun() throws InterruptedException {
491	<	Thread.sleep(SMALL_DELAY_MS);
492	<	threadAssertEquals(one, q.take());
491	>	threadsStarted.await();
492	>	assertSame(one, q.take());
493		}});
494
495		joinPool(executor);
593	–
496		}
497
498		/**
499	<	* poll retrieves elements across Executor threads
499	>	* timed poll retrieves elements across Executor threads
500		*/
501	<	public void testPollInExecutor() {
502	<	final SynchronousQueue q = new SynchronousQueue();
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		ExecutorService executor = Executors.newFixedThreadPool(2);
507		executor.execute(new CheckedRunnable() {
508		public void realRun() throws InterruptedException {
509	<	threadAssertNull(q.poll());
510	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
511	<	threadAssertTrue(q.isEmpty());
509	>	assertNull(q.poll());
510	>	threadsStarted.await();
511	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
512	>	assertTrue(q.isEmpty());
513		}});
514
515		executor.execute(new CheckedRunnable() {
516		public void realRun() throws InterruptedException {
517	<	Thread.sleep(SMALL_DELAY_MS);
518	<	q.put(new Integer(1));
517	>	threadsStarted.await();
518	>	q.put(one);
519		}});
520
521		joinPool(executor);
#	Line 618 | Line 524 | public class SynchronousQueueTest extend
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	<	/**
637	<	* drainTo(null) throws NPE
638	<	*/
639	<	public void testDrainToNull() {
640	<	SynchronousQueue q = new SynchronousQueue();
641	<	try {
642	<	q.drainTo(null);
643	<	shouldThrow();
644	<	} catch (NullPointerException success) {}
645	<	}
646	<
647	<	/**
648	<	* drainTo(this) throws IAE
649	<	*/
650	<	public void testDrainToSelf() {
651	<	SynchronousQueue q = new SynchronousQueue();
652	<	try {
653	<	q.drainTo(q);
654	<	shouldThrow();
655	<	} 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
679	–	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();
687	<	assertTrue(l.size() <= 1);
688	<	}
689	<
690	<	/**
691	<	* drainTo(null, n) throws NPE
692	<	*/
693	<	public void testDrainToNullN() {
694	<	SynchronousQueue q = new SynchronousQueue();
695	<	try {
696	<	q.drainTo(null, 0);
697	<	shouldThrow();
698	<	} catch (NullPointerException success) {}
699	<	}
700	<
701	<	/**
702	<	* drainTo(this, n) throws IAE
703	<	*/
704	<	public void testDrainToSelfN() {
705	<	SynchronousQueue q = new SynchronousQueue();
706	<	try {
707	<	q.drainTo(q, 0);
708	<	shouldThrow();
709	<	} 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	+	assertTrue(l.size() == 1);
579	+	assertSame(one, l.get(0));
580	+	awaitTermination(t);
581		}
582
583		/**
#	Line 715 | 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
728	–	t1.start();
729	–	t2.start();
598		ArrayList l = new ArrayList();
599	<	Thread.sleep(SHORT_DELAY_MS);
599	>	delay(SHORT_DELAY_MS);
600		q.drainTo(l, 1);
601	<	assertTrue(l.size() == 1);
601	>	assertEquals(1, l.size());
602		q.drainTo(l, 1);
603	<	assertTrue(l.size() == 2);
603	>	assertEquals(2, l.size());
604		assertTrue(l.contains(one));
605		assertTrue(l.contains(two));
606	<	t1.join();
607	<	t2.join();
606	>	awaitTermination(t1);
607	>	awaitTermination(t2);
608	>	}
609	>
610	>	/**
611	>	* remove(null), contains(null) always return false
612	>	*/
613	>	public void testNeverContainsNull() {
614	>	Collection<?> q = new SynchronousQueue();
615	>	assertFalse(q.contains(null));
616	>	assertFalse(q.remove(null));
617		}
618
619		}

Diff Legend

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