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.5 by dl, Thu Sep 25 11:02:41 2003 UTC vs.
Revision 1.46 by jsr166, Sat Jan 17 22:55:06 2015 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	>
22	>	import junit.framework.Test;
23
24		public class SynchronousQueueTest extends JSR166TestCase {
25
26	+	public static class Fair extends BlockingQueueTest {
27	+	protected BlockingQueue emptyCollection() {
28	+	return new SynchronousQueue(true);
29	+	}
30	+	}
31	+
32	+	public static class NonFair extends BlockingQueueTest {
33	+	protected BlockingQueue emptyCollection() {
34	+	return new SynchronousQueue(false);
35	+	}
36	+	}
37	+
38		public static void main(String[] args) {
39	<	junit.textui.TestRunner.run (suite());
39	>	junit.textui.TestRunner.run(suite());
40		}
41
42		public static Test suite() {
43	<	return new TestSuite(SynchronousQueueTest.class);
43	>	return newTestSuite(SynchronousQueueTest.class,
44	>	new Fair().testSuite(),
45	>	new NonFair().testSuite());
46		}
47
48		/**
49	<	* A SynchronousQueue is both empty and full
49	>	* Any SynchronousQueue is both empty and full
50		*/
51	<	public void testEmptyFull() {
52	<	SynchronousQueue q = new SynchronousQueue();
51	>	public void testEmptyFull()      { testEmptyFull(false); }
52	>	public void testEmptyFull_fair() { testEmptyFull(true); }
53	>	public void testEmptyFull(boolean fair) {
54	>	final SynchronousQueue q = new SynchronousQueue(fair);
55		assertTrue(q.isEmpty());
56	<	assertEquals(0, q.size());
56	>	assertEquals(0, q.size());
57		assertEquals(0, q.remainingCapacity());
58		assertFalse(q.offer(zero));
59		}
60
61		/**
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	–	/**
62		* offer fails if no active taker
63		*/
64	<	public void testOffer() {
65	<	SynchronousQueue q = new SynchronousQueue();
64	>	public void testOffer()      { testOffer(false); }
65	>	public void testOffer_fair() { testOffer(true); }
66	>	public void testOffer(boolean fair) {
67	>	SynchronousQueue q = new SynchronousQueue(fair);
68		assertFalse(q.offer(one));
69		}
70
71		/**
72	<	* add throws ISE if no active taker
72	>	* add throws IllegalStateException if no active taker
73		*/
74	<	public void testAdd() {
75	<	try {
76	<	SynchronousQueue q = new SynchronousQueue();
77	<	assertEquals(0, q.remainingCapacity());
74	>	public void testAdd()      { testAdd(false); }
75	>	public void testAdd_fair() { testAdd(true); }
76	>	public void testAdd(boolean fair) {
77	>	SynchronousQueue q = new SynchronousQueue(fair);
78	>	assertEquals(0, q.remainingCapacity());
79	>	try {
80		q.add(one);
81		shouldThrow();
82	<	} catch (IllegalStateException success){
63	<	}
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 {
93	<	SynchronousQueue q = new SynchronousQueue();
72	<	q.addAll(null);
93	>	q.addAll(q);
94		shouldThrow();
95	<	}
75	<	catch (NullPointerException success) {}
76	<	}
77	<	/**
78	<	* addAll of a collection with null elements throws NPE
79	<	*/
80	<	public void testAddAll2() {
81	<	try {
82	<	SynchronousQueue q = new SynchronousQueue();
83	<	Integer[] ints = new Integer[1];
84	<	q.addAll(Arrays.asList(ints));
85	<	shouldThrow();
86	<	}
87	<	catch (NullPointerException success) {}
95	>	} catch (IllegalArgumentException success) {}
96		}
97	+
98		/**
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();
95	<	Integer[] ints = new Integer[1];
96	<	for (int i = 0; i < 1; ++i)
97	<	ints[i] = new Integer(i);
98	<	q.addAll(Arrays.asList(ints));
110	>	q.addAll(coll);
111		shouldThrow();
112	<	}
101	<	catch (IllegalStateException success) {}
112	>	} catch (IllegalStateException success) {}
113		}
114
115		/**
105	–	* put(null) throws NPE
106	–	*/
107	–	public void testPutNull() {
108	–	try {
109	–	SynchronousQueue q = new SynchronousQueue();
110	–	q.put(null);
111	–	shouldThrow();
112	–	}
113	–	catch (NullPointerException success){
114	–	}
115	–	catch (InterruptedException ie) {
116	–	unexpectedException();
117	–	}
118	–	}
119	–
120	–	/**
116		* put blocks interruptibly if no active taker
117		*/
118	<	public void testBlockingPut() {
119	<	Thread t = new Thread(new Runnable() {
120	<	public void run() {
121	<	try {
122	<	SynchronousQueue q = new SynchronousQueue();
123	<	q.put(zero);
124	<	threadShouldThrow();
125	<	} catch (InterruptedException ie){
126	<	}
127	<	}});
128	<	t.start();
129	<	try {
130	<	Thread.sleep(SHORT_DELAY_MS);
131	<	t.interrupt();
132	<	t.join();
133	<	}
134	<	catch (InterruptedException ie) {
135	<	unexpectedException();
136	<	}
118	>	public void testBlockingPut()      { testBlockingPut(false); }
119	>	public void testBlockingPut_fair() { testBlockingPut(true); }
120	>	public void testBlockingPut(boolean fair) {
121	>	final SynchronousQueue q = new SynchronousQueue(fair);
122	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
123	>	Thread t = newStartedThread(new CheckedRunnable() {
124	>	public void realRun() throws InterruptedException {
125	>	Thread.currentThread().interrupt();
126	>	try {
127	>	q.put(99);
128	>	shouldThrow();
129	>	} catch (InterruptedException success) {}
130	>	assertFalse(Thread.interrupted());
131	>
132	>	pleaseInterrupt.countDown();
133	>	try {
134	>	q.put(99);
135	>	shouldThrow();
136	>	} catch (InterruptedException success) {}
137	>	assertFalse(Thread.interrupted());
138	>	}});
139	>
140	>	await(pleaseInterrupt);
141	>	assertThreadStaysAlive(t);
142	>	t.interrupt();
143	>	awaitTermination(t);
144	>	assertEquals(0, q.remainingCapacity());
145		}
146
147		/**
148	<	* put blocks waiting for take
148	>	* put blocks interruptibly waiting for take
149		*/
150	<	public void testPutWithTake() {
151	<	final SynchronousQueue q = new SynchronousQueue();
152	<	Thread t = new Thread(new Runnable() {
153	<	public void run() {
154	<	int added = 0;
155	<	try {
156	<	q.put(new Object());
157	<	++added;
158	<	q.put(new Object());
159	<	++added;
160	<	q.put(new Object());
161	<	++added;
162	<	q.put(new Object());
163	<	++added;
164	<	threadShouldThrow();
165	<	} catch (InterruptedException e){
166	<	assertTrue(added >= 1);
167	<	}
168	<	}
169	<	});
170	<	try {
171	<	t.start();
172	<	Thread.sleep(SHORT_DELAY_MS);
173	<	q.take();
174	<	Thread.sleep(SHORT_DELAY_MS);
175	<	t.interrupt();
176	<	t.join();
177	<	} catch (Exception e){
178	<	unexpectedException();
176	<	}
150	>	public void testPutWithTake()      { testPutWithTake(false); }
151	>	public void testPutWithTake_fair() { testPutWithTake(true); }
152	>	public void testPutWithTake(boolean fair) {
153	>	final SynchronousQueue q = new SynchronousQueue(fair);
154	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
155	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
156	>	Thread t = newStartedThread(new CheckedRunnable() {
157	>	public void realRun() throws InterruptedException {
158	>	pleaseTake.countDown();
159	>	q.put(one);
160	>
161	>	pleaseInterrupt.countDown();
162	>	try {
163	>	q.put(99);
164	>	shouldThrow();
165	>	} catch (InterruptedException success) {}
166	>	assertFalse(Thread.interrupted());
167	>	}});
168	>
169	>	await(pleaseTake);
170	>	assertEquals(0, q.remainingCapacity());
171	>	try { assertSame(one, q.take()); }
172	>	catch (InterruptedException e) { threadUnexpectedException(e); }
173	>
174	>	await(pleaseInterrupt);
175	>	assertThreadStaysAlive(t);
176	>	t.interrupt();
177	>	awaitTermination(t);
178	>	assertEquals(0, q.remainingCapacity());
179		}
180
181		/**
182		* timed offer times out if elements not taken
183		*/
184	<	public void testTimedOffer() {
185	<	final SynchronousQueue q = new SynchronousQueue();
186	<	Thread t = new Thread(new Runnable() {
187	<	public void run() {
188	<	try {
189	<
190	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
191	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
192	<	threadShouldThrow();
193	<	} catch (InterruptedException success){}
194	<	}
195	<	});
196	<
197	<	try {
198	<	t.start();
199	<	Thread.sleep(SMALL_DELAY_MS);
198	<	t.interrupt();
199	<	t.join();
200	<	} catch (Exception e){
201	<	unexpectedException();
202	<	}
203	<	}
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	+	await(pleaseInterrupt);
202	+	assertThreadStaysAlive(t);
203	+	t.interrupt();
204	+	awaitTermination(t);
205	+	}
206
207		/**
208	<	* take blocks interruptibly when empty
208	>	* poll return null if no active putter
209		*/
210	<	public void testTakeFromEmpty() {
211	<	final SynchronousQueue q = new SynchronousQueue();
212	<	Thread t = new Thread(new Runnable() {
213	<	public void run() {
214	<	try {
214	<	q.take();
215	<	threadShouldThrow();
216	<	} catch (InterruptedException success){ }
217	<	}
218	<	});
219	<	try {
220	<	t.start();
221	<	Thread.sleep(SHORT_DELAY_MS);
222	<	t.interrupt();
223	<	t.join();
224	<	} catch (Exception e){
225	<	unexpectedException();
226	<	}
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	<	* poll fails unless active taker
218	>	* timed poll with zero timeout times out if no active putter
219		*/
220	<	public void testPoll() {
221	<	SynchronousQueue q = new SynchronousQueue();
222	<	assertNull(q.poll());
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 zero timeout times out if no active taker
229	>	* timed poll with nonzero timeout times out if no active putter
230		*/
231	<	public void testTimedPoll0() {
232	<	try {
233	<	SynchronousQueue q = new SynchronousQueue();
234	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
235	<	} catch (InterruptedException e){
236	<	unexpectedException();
237	<	}
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	<	* timed pool with nonzero timeout times out if no active taker
242	>	* timed poll before a delayed offer times out, returning null;
243	>	* after offer succeeds; on interruption throws
244		*/
245	<	public void testTimedPoll() {
246	<	try {
247	<	SynchronousQueue q = new SynchronousQueue();
248	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
249	<	} catch (InterruptedException e){
250	<	unexpectedException();
251	<	}
252	<	}
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	>	long startTime = System.nanoTime();
254	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
255	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
256
257	<	/**
258	<	* Interrupted timed poll throws InterruptedException instead of
259	<	* returning timeout status
260	<	*/
265	<	public void testInterruptedTimedPoll() {
266	<	Thread t = new Thread(new Runnable() {
267	<	public void run() {
268	<	try {
269	<	SynchronousQueue q = new SynchronousQueue();
270	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
271	<	} catch (InterruptedException success){
272	<	}
273	<	}});
274	<	t.start();
275	<	try {
276	<	Thread.sleep(SHORT_DELAY_MS);
277	<	t.interrupt();
278	<	t.join();
279	<	}
280	<	catch (InterruptedException ie) {
281	<	unexpectedException();
282	<	}
283	<	}
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	<	/**
263	<	*  timed poll before a delayed offer fails; after offer succeeds;
264	<	*  on interruption throws
265	<	*/
266	<	public void testTimedPollWithOffer() {
267	<	final SynchronousQueue q = new SynchronousQueue();
291	<	Thread t = new Thread(new Runnable() {
292	<	public void run() {
293	<	try {
294	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
295	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
296	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
297	<	threadShouldThrow();
298	<	} catch (InterruptedException success) { }
299	<	}
300	<	});
301	<	try {
302	<	t.start();
303	<	Thread.sleep(SMALL_DELAY_MS);
304	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
305	<	t.interrupt();
306	<	t.join();
307	<	} catch (Exception e){
308	<	unexpectedException();
309	<	}
310	<	}
262	>	Thread.currentThread().interrupt();
263	>	try {
264	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
265	>	shouldThrow();
266	>	} catch (InterruptedException success) {}
267	>	assertFalse(Thread.interrupted());
268
269	+	pleaseInterrupt.countDown();
270	+	try {
271	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
272	+	shouldThrow();
273	+	} catch (InterruptedException success) {}
274	+	assertFalse(Thread.interrupted());
275	+	}});
276	+
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	+	awaitTermination(t);
287	+	}
288
289		/**
290	<	* peek returns null
290	>	* peek() returns null if no active putter
291		*/
292	<	public void testPeek() {
293	<	SynchronousQueue q = new SynchronousQueue();
294	<	assertNull(q.peek());
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();
309	<	}
330	<	catch (NoSuchElementException success) {}
309	>	} catch (NoSuchElementException success) {}
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){
342	<	}
322	>	} catch (NoSuchElementException success) {}
323		}
324
325		/**
346	–	* remove(x) returns false
347	–	*/
348	–	public void testRemoveElement() {
349	–	SynchronousQueue q = new SynchronousQueue();
350	–	assertFalse(q.remove(zero));
351	–	assertTrue(q.isEmpty());
352	–	}
353	–
354	–	/**
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 371 | 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 382 | 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 393 | 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
404	–
385		/**
386		* toArray is empty
387		*/
388	<	public void testToArray() {
389	<	SynchronousQueue q = new SynchronousQueue();
390	<	Object[] o = q.toArray();
391	<	assertEquals(o.length, 0);
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(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	<
417	>
418		/**
419	<	* iterator does not traverse any elements
419	>	* toArray(null) throws NPE
420		*/
421	<	public void testIterator() {
422	<	SynchronousQueue q = new SynchronousQueue();
423	<	Iterator it = q.iterator();
424	<	assertFalse(it.hasNext());
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 {
426	<	Object x = it.next();
426	>	Object[] o = q.toArray(null);
427		shouldThrow();
428	<	}
429	<	catch (NoSuchElementException success) {}
428	>	} catch (NullPointerException success) {}
429	>	}
430	>
431	>	/**
432	>	* iterator does not traverse any elements
433	>	*/
434	>	public void testIterator()      { testIterator(false); }
435	>	public void testIterator_fair() { testIterator(true); }
436	>	public void testIterator(boolean fair) {
437	>	assertIteratorExhausted(new SynchronousQueue(fair).iterator());
438		}
439
440		/**
441		* iterator remove throws ISE
442		*/
443	<	public void testIteratorRemove() {
444	<	SynchronousQueue q = new SynchronousQueue();
445	<	Iterator it = q.iterator();
443	>	public void testIteratorRemove()      { testIteratorRemove(false); }
444	>	public void testIteratorRemove_fair() { testIteratorRemove(true); }
445	>	public void testIteratorRemove(boolean fair) {
446	>	final SynchronousQueue q = new SynchronousQueue(fair);
447	>	Iterator it = q.iterator();
448		try {
449		it.remove();
450		shouldThrow();
451	<	}
447	<	catch (IllegalStateException success) {}
451	>	} catch (IllegalStateException success) {}
452		}
453
454		/**
455		* toString returns a non-null string
456		*/
457	<	public void testToString() {
458	<	SynchronousQueue q = new SynchronousQueue();
457	>	public void testToString()      { testToString(false); }
458	>	public void testToString_fair() { testToString(true); }
459	>	public void testToString(boolean fair) {
460	>	final SynchronousQueue q = new SynchronousQueue(fair);
461		String s = q.toString();
462		assertNotNull(s);
463	<	}
458	<
463	>	}
464
465		/**
466		* offer transfers elements across Executor tasks
467		*/
468	<	public void testOfferInExecutor() {
469	<	final SynchronousQueue q = new SynchronousQueue();
468	>	public void testOfferInExecutor()      { testOfferInExecutor(false); }
469	>	public void testOfferInExecutor_fair() { testOfferInExecutor(true); }
470	>	public void testOfferInExecutor(boolean fair) {
471	>	final SynchronousQueue q = new SynchronousQueue(fair);
472		ExecutorService executor = Executors.newFixedThreadPool(2);
473	<	final Integer one = new Integer(1);
473	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
474
475	<	executor.execute(new Runnable() {
476	<	public void run() {
477	<	threadAssertFalse(q.offer(one));
478	<	try {
479	<	threadAssertTrue(q.offer(one, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
480	<	threadAssertEquals(0, q.remainingCapacity());
481	<	}
482	<	catch (InterruptedException e) {
483	<	threadUnexpectedException();
484	<	}
485	<	}
486	<	});
475	>	executor.execute(new CheckedRunnable() {
476	>	public void realRun() throws InterruptedException {
477	>	assertFalse(q.offer(one));
478	>	threadsStarted.await();
479	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
480	>	assertEquals(0, q.remainingCapacity());
481	>	}});
482	>
483	>	executor.execute(new CheckedRunnable() {
484	>	public void realRun() throws InterruptedException {
485	>	threadsStarted.await();
486	>	assertSame(one, q.take());
487	>	}});
488
481	–	executor.execute(new Runnable() {
482	–	public void run() {
483	–	try {
484	–	Thread.sleep(SMALL_DELAY_MS);
485	–	threadAssertEquals(one, q.take());
486	–	}
487	–	catch (InterruptedException e) {
488	–	threadUnexpectedException();
489	–	}
490	–	}
491	–	});
492	–
489		joinPool(executor);
494	–
490		}
491
492		/**
493	<	* poll retrieves elements across Executor threads
493	>	* timed poll retrieves elements across Executor threads
494		*/
495	<	public void testPollInExecutor() {
496	<	final SynchronousQueue q = new SynchronousQueue();
495	>	public void testPollInExecutor()      { testPollInExecutor(false); }
496	>	public void testPollInExecutor_fair() { testPollInExecutor(true); }
497	>	public void testPollInExecutor(boolean fair) {
498	>	final SynchronousQueue q = new SynchronousQueue(fair);
499	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
500		ExecutorService executor = Executors.newFixedThreadPool(2);
501	<	executor.execute(new Runnable() {
502	<	public void run() {
503	<	threadAssertNull(q.poll());
504	<	try {
505	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
506	<	threadAssertTrue(q.isEmpty());
507	<	}
508	<	catch (InterruptedException e) {
509	<	threadUnexpectedException();
510	<	}
511	<	}
512	<	});
501	>	executor.execute(new CheckedRunnable() {
502	>	public void realRun() throws InterruptedException {
503	>	assertNull(q.poll());
504	>	threadsStarted.await();
505	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
506	>	assertTrue(q.isEmpty());
507	>	}});
508	>
509	>	executor.execute(new CheckedRunnable() {
510	>	public void realRun() throws InterruptedException {
511	>	threadsStarted.await();
512	>	q.put(one);
513	>	}});
514
516	–	executor.execute(new Runnable() {
517	–	public void run() {
518	–	try {
519	–	Thread.sleep(SMALL_DELAY_MS);
520	–	q.put(new Integer(1));
521	–	}
522	–	catch (InterruptedException e) {
523	–	threadUnexpectedException();
524	–	}
525	–	}
526	–	});
527	–
515		joinPool(executor);
516		}
517
#	Line 532 | Line 519 | public class SynchronousQueueTest extend
519		* a deserialized serialized queue is usable
520		*/
521		public void testSerialization() {
522	<	SynchronousQueue q = new SynchronousQueue();
523	<	try {
524	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
525	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
526	<	out.writeObject(q);
527	<	out.close();
528	<
529	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
530	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
531	<	SynchronousQueue r = (SynchronousQueue)in.readObject();
532	<	assertEquals(q.size(), r.size());
533	<	while (!q.isEmpty())
534	<	assertEquals(q.remove(), r.remove());
535	<	} catch(Exception e){
536	<	unexpectedException();
522	>	final SynchronousQueue x = new SynchronousQueue();
523	>	final SynchronousQueue y = new SynchronousQueue(false);
524	>	final SynchronousQueue z = new SynchronousQueue(true);
525	>	assertSerialEquals(x, y);
526	>	assertNotSerialEquals(x, z);
527	>	SynchronousQueue[] qs = { x, y, z };
528	>	for (SynchronousQueue q : qs) {
529	>	SynchronousQueue clone = serialClone(q);
530	>	assertNotSame(q, clone);
531	>	assertSerialEquals(q, clone);
532	>	assertTrue(clone.isEmpty());
533	>	assertEquals(0, clone.size());
534	>	assertEquals(0, clone.remainingCapacity());
535	>	assertFalse(clone.offer(zero));
536	>	}
537	>	}
538	>
539	>	/**
540	>	* drainTo(c) of empty queue doesn't transfer elements
541	>	*/
542	>	public void testDrainTo()      { testDrainTo(false); }
543	>	public void testDrainTo_fair() { testDrainTo(true); }
544	>	public void testDrainTo(boolean fair) {
545	>	final SynchronousQueue q = new SynchronousQueue(fair);
546	>	ArrayList l = new ArrayList();
547	>	q.drainTo(l);
548	>	assertEquals(0, q.size());
549	>	assertEquals(0, l.size());
550	>	}
551	>
552	>	/**
553	>	* drainTo empties queue, unblocking a waiting put.
554	>	*/
555	>	public void testDrainToWithActivePut()      { testDrainToWithActivePut(false); }
556	>	public void testDrainToWithActivePut_fair() { testDrainToWithActivePut(true); }
557	>	public void testDrainToWithActivePut(boolean fair) {
558	>	final SynchronousQueue q = new SynchronousQueue(fair);
559	>	Thread t = newStartedThread(new CheckedRunnable() {
560	>	public void realRun() throws InterruptedException {
561	>	q.put(one);
562	>	}});
563	>
564	>	ArrayList l = new ArrayList();
565	>	long startTime = System.nanoTime();
566	>	while (l.isEmpty()) {
567	>	q.drainTo(l);
568	>	if (millisElapsedSince(startTime) > LONG_DELAY_MS)
569	>	fail("timed out");
570	>	Thread.yield();
571		}
572	+	assertTrue(l.size() == 1);
573	+	assertSame(one, l.get(0));
574	+	awaitTermination(t);
575	+	}
576	+
577	+	/**
578	+	* drainTo(c, n) empties up to n elements of queue into c
579	+	*/
580	+	public void testDrainToN() throws InterruptedException {
581	+	final SynchronousQueue q = new SynchronousQueue();
582	+	Thread t1 = newStartedThread(new CheckedRunnable() {
583	+	public void realRun() throws InterruptedException {
584	+	q.put(one);
585	+	}});
586	+
587	+	Thread t2 = newStartedThread(new CheckedRunnable() {
588	+	public void realRun() throws InterruptedException {
589	+	q.put(two);
590	+	}});
591	+
592	+	ArrayList l = new ArrayList();
593	+	delay(SHORT_DELAY_MS);
594	+	q.drainTo(l, 1);
595	+	assertEquals(1, l.size());
596	+	q.drainTo(l, 1);
597	+	assertEquals(2, l.size());
598	+	assertTrue(l.contains(one));
599	+	assertTrue(l.contains(two));
600	+	awaitTermination(t1);
601	+	awaitTermination(t2);
602	+	}
603	+
604	+	/**
605	+	* remove(null), contains(null) always return false
606	+	*/
607	+	public void testNeverContainsNull() {
608	+	Collection<?> q = new SynchronousQueue();
609	+	assertFalse(q.contains(null));
610	+	assertFalse(q.remove(null));
611		}
612
613		}

Diff Legend

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