ViewVC Help

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

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

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.2 by jsr166, Fri Jul 31 23:37:31 2009 UTC vs.
Revision 1.67 by jsr166, Sun Oct 16 20:16:36 2016 UTC

#	Line 1 | Line 1
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 John Vint
6		*/
7
8	<	import java.io.BufferedInputStream;
9	<	import java.io.BufferedOutputStream;
11	<	import java.io.ByteArrayInputStream;
12	<	import java.io.ByteArrayOutputStream;
13	<	import java.io.ObjectInputStream;
14	<	import java.io.ObjectOutputStream;
8	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
9	>
10		import java.util.ArrayList;
11		import java.util.Arrays;
12	<	import java.util.ConcurrentModificationException;
12	>	import java.util.Collection;
13		import java.util.Iterator;
14	+	import java.util.List;
15		import java.util.NoSuchElementException;
16	<	import java.util.concurrent.*;
16	>	import java.util.Queue;
17	>	import java.util.concurrent.BlockingQueue;
18	>	import java.util.concurrent.CountDownLatch;
19	>	import java.util.concurrent.Executors;
20	>	import java.util.concurrent.ExecutorService;
21	>	import java.util.concurrent.LinkedTransferQueue;
22	>
23		import junit.framework.Test;
22	–	import junit.framework.TestSuite;
24
25	+	@SuppressWarnings({"unchecked", "rawtypes"})
26		public class LinkedTransferQueueTest extends JSR166TestCase {
27	+	public static class Generic extends BlockingQueueTest {
28	+	protected BlockingQueue emptyCollection() {
29	+	return new LinkedTransferQueue();
30	+	}
31	+	}
32
33		public static void main(String[] args) {
34	<	junit.textui.TestRunner.run(suite());
34	>	main(suite(), args);
35		}
36
37		public static Test suite() {
38	<	return new TestSuite(LinkedTransferQueueTest.class);
38	>	class Implementation implements CollectionImplementation {
39	>	public Class<?> klazz() { return LinkedTransferQueue.class; }
40	>	public Collection emptyCollection() { return new LinkedTransferQueue(); }
41	>	public Object makeElement(int i) { return i; }
42	>	public boolean isConcurrent() { return true; }
43	>	public boolean permitsNulls() { return false; }
44	>	}
45	>	return newTestSuite(LinkedTransferQueueTest.class,
46	>	new Generic().testSuite(),
47	>	CollectionTest.testSuite(new Implementation()));
48		}
49
50	<	/*
51	<	*Constructor builds new queue with size being zero and empty being true
50	>	/**
51	>	* Constructor builds new queue with size being zero and empty
52	>	* being true
53		*/
54		public void testConstructor1() {
55		assertEquals(0, new LinkedTransferQueue().size());
56		assertTrue(new LinkedTransferQueue().isEmpty());
57		}
58
59	<	/*
60	<	* Initizialing constructor with null collection throws NPE
59	>	/**
60	>	* Initializing constructor with null collection throws
61	>	* NullPointerException
62		*/
63		public void testConstructor2() {
64		try {
65		new LinkedTransferQueue(null);
66		shouldThrow();
67	<	} catch (NullPointerException success) {
50	<	}
67	>	} catch (NullPointerException success) {}
68		}
69
70		/**
71	<	* Initializing from Collection of null elements throws NPE
71	>	* Initializing from Collection of null elements throws
72	>	* NullPointerException
73		*/
74		public void testConstructor3() {
75	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
76		try {
77	<	Integer[] ints = new Integer[SIZE];
59	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
77	>	new LinkedTransferQueue(elements);
78		shouldThrow();
79	<	} catch (NullPointerException success) {
62	<	}
79	>	} catch (NullPointerException success) {}
80		}
81	<	/*
81	>
82	>	/**
83		* Initializing constructor with a collection containing some null elements
84	<	* throws NPE
84	>	* throws NullPointerException
85		*/
68	–
86		public void testConstructor4() {
87	+	Integer[] ints = new Integer[SIZE];
88	+	for (int i = 0; i < SIZE - 1; ++i)
89	+	ints[i] = i;
90	+	Collection<Integer> elements = Arrays.asList(ints);
91		try {
92	<	Integer[] ints = new Integer[SIZE];
72	<	for (int i = 0; i < SIZE - 1; ++i) {
73	<	ints[i] = new Integer(i);
74	<	}
75	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
92	>	new LinkedTransferQueue(elements);
93		shouldThrow();
94	<	} catch (NullPointerException success) {
78	<	}
94	>	} catch (NullPointerException success) {}
95		}
96
97	<	/*
97	>	/**
98		* Queue contains all elements of the collection it is initialized by
99		*/
100		public void testConstructor5() {
101	<	try {
102	<	Integer[] ints = new Integer[SIZE];
103	<	for (int i = 0; i < SIZE; ++i) {
104	<	ints[i] = new Integer(i);
105	<	}
106	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
107	<	for (int i = 0; i < SIZE; ++i) {
108	<	assertEquals(ints[i], q.poll());
109	<	}
110	<	} finally {
101	>	Integer[] ints = new Integer[SIZE];
102	>	for (int i = 0; i < SIZE; ++i) {
103	>	ints[i] = i;
104	>	}
105	>	List intList = Arrays.asList(ints);
106	>	LinkedTransferQueue q
107	>	= new LinkedTransferQueue(intList);
108	>	assertEquals(q.size(), intList.size());
109	>	assertEquals(q.toString(), intList.toString());
110	>	assertTrue(Arrays.equals(q.toArray(),
111	>	intList.toArray()));
112	>	assertTrue(Arrays.equals(q.toArray(new Object[0]),
113	>	intList.toArray(new Object[0])));
114	>	assertTrue(Arrays.equals(q.toArray(new Object[SIZE]),
115	>	intList.toArray(new Object[SIZE])));
116	>	for (int i = 0; i < SIZE; ++i) {
117	>	assertEquals(ints[i], q.poll());
118		}
119		}
120
121		/**
122	<	* Remaining capacity never decrease nor increase on add or remove
122	>	* remainingCapacity() always returns Integer.MAX_VALUE
123		*/
124		public void testRemainingCapacity() {
125	<	LinkedTransferQueue q = populatedQueue(SIZE);
103	<	int remainingCapacity = q.remainingCapacity();
125	>	BlockingQueue q = populatedQueue(SIZE);
126		for (int i = 0; i < SIZE; ++i) {
127	<	assertEquals(remainingCapacity, q.remainingCapacity());
127	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
128		assertEquals(SIZE - i, q.size());
129	<	q.remove();
129	>	assertEquals(i, q.remove());
130		}
131		for (int i = 0; i < SIZE; ++i) {
132	<	assertEquals(remainingCapacity, q.remainingCapacity());
132	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
133		assertEquals(i, q.size());
134	<	q.add(new Integer(i));
113	<	}
114	<	}
115	<
116	<	/**
117	<	* offer(null) throws NPE
118	<	*/
119	<	public void testOfferNull() {
120	<	try {
121	<	LinkedTransferQueue q = new LinkedTransferQueue();
122	<	q.offer(null);
123	<	shouldThrow();
124	<	} catch (NullPointerException success) {
134	>	assertTrue(q.add(i));
135		}
136		}
137
138		/**
139	<	* add(null) throws NPE
130	<	*/
131	<	public void testAddNull() {
132	<	try {
133	<	LinkedTransferQueue q = new LinkedTransferQueue();
134	<	q.add(null);
135	<	shouldThrow();
136	<	} catch (NullPointerException success) {
137	<	}
138	<	}
139	<
140	<	/**
141	<	* addAll(null) throws NPE
142	<	*/
143	<	public void testAddAll1() {
144	<	try {
145	<	LinkedTransferQueue q = new LinkedTransferQueue();
146	<	q.addAll(null);
147	<	shouldThrow();
148	<	} catch (NullPointerException success) {
149	<	}
150	<	}
151	<
152	<	/**
153	<	* addAll(this) throws IAE
139	>	* addAll(this) throws IllegalArgumentException
140		*/
141		public void testAddAllSelf() {
142	+	LinkedTransferQueue q = populatedQueue(SIZE);
143		try {
157	–	LinkedTransferQueue q = populatedQueue(SIZE);
144		q.addAll(q);
145		shouldThrow();
146	<	} catch (IllegalArgumentException success) {
161	<	}
162	<	}
163	<
164	<	/**
165	<	* addAll of a collection with null elements throws NPE
166	<	*/
167	<	public void testAddAll2() {
168	<	try {
169	<	LinkedTransferQueue q = new LinkedTransferQueue();
170	<	Integer[] ints = new Integer[SIZE];
171	<	q.addAll(Arrays.asList(ints));
172	<	shouldThrow();
173	<	} catch (NullPointerException success) {
174	<	}
146	>	} catch (IllegalArgumentException success) {}
147		}
148
149		/**
150	<	* addAll of a collection with any null elements throws NPE after
151	<	* possibly adding some elements
150	>	* addAll of a collection with any null elements throws
151	>	* NullPointerException after possibly adding some elements
152		*/
153		public void testAddAll3() {
154	+	LinkedTransferQueue q = new LinkedTransferQueue();
155	+	Integer[] ints = new Integer[SIZE];
156	+	for (int i = 0; i < SIZE - 1; ++i)
157	+	ints[i] = i;
158		try {
183	–	LinkedTransferQueue q = new LinkedTransferQueue();
184	–	Integer[] ints = new Integer[SIZE];
185	–	for (int i = 0; i < SIZE - 1; ++i) {
186	–	ints[i] = new Integer(i);
187	–	}
159		q.addAll(Arrays.asList(ints));
160		shouldThrow();
161	<	} catch (NullPointerException success) {
191	<	}
161	>	} catch (NullPointerException success) {}
162		}
163
164		/**
165		* Queue contains all elements, in traversal order, of successful addAll
166		*/
167		public void testAddAll5() {
168	<	try {
169	<	Integer[] empty = new Integer[0];
170	<	Integer[] ints = new Integer[SIZE];
171	<	for (int i = 0; i < SIZE; ++i) {
202	<	ints[i] = new Integer(i);
203	<	}
204	<	LinkedTransferQueue q = new LinkedTransferQueue();
205	<	assertFalse(q.addAll(Arrays.asList(empty)));
206	<	assertTrue(q.addAll(Arrays.asList(ints)));
207	<	for (int i = 0; i < SIZE; ++i) {
208	<	assertEquals(ints[i], q.poll());
209	<	}
210	<	} finally {
168	>	Integer[] empty = new Integer[0];
169	>	Integer[] ints = new Integer[SIZE];
170	>	for (int i = 0; i < SIZE; ++i) {
171	>	ints[i] = i;
172		}
173	<	}
174	<
175	<	/**
176	<	* put(null) throws NPE
177	<	*/
217	<	public void testPutNull() {
218	<	try {
219	<	LinkedTransferQueue q = new LinkedTransferQueue();
220	<	q.put(null);
221	<	shouldThrow();
222	<	} catch (NullPointerException success) {
223	<	} catch (Exception ie) {
224	<	unexpectedException();
173	>	LinkedTransferQueue q = new LinkedTransferQueue();
174	>	assertFalse(q.addAll(Arrays.asList(empty)));
175	>	assertTrue(q.addAll(Arrays.asList(ints)));
176	>	for (int i = 0; i < SIZE; ++i) {
177	>	assertEquals(ints[i], q.poll());
178		}
179		}
180
#	Line 229 | Line 182 | public class LinkedTransferQueueTest ext
182		* all elements successfully put are contained
183		*/
184		public void testPut() {
185	<	try {
186	<	LinkedTransferQueue q = new LinkedTransferQueue();
187	<	for (int i = 0; i < SIZE; ++i) {
188	<	Integer I = new Integer(i);
189	<	q.put(I);
237	<	assertTrue(q.contains(I));
238	<	}
239	<	} catch (Exception ie) {
240	<	unexpectedException();
185	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
186	>	for (int i = 0; i < SIZE; ++i) {
187	>	assertEquals(i, q.size());
188	>	q.put(i);
189	>	assertTrue(q.contains(i));
190		}
191		}
192
193		/**
194		* take retrieves elements in FIFO order
195		*/
196	<	public void testTake() {
197	<	try {
198	<	LinkedTransferQueue q = populatedQueue(SIZE);
199	<	for (int i = 0; i < SIZE; ++i) {
251	<	assertEquals(i, ((Integer) q.take()).intValue());
252	<	}
253	<	} catch (InterruptedException e) {
254	<	unexpectedException();
196	>	public void testTake() throws InterruptedException {
197	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
198	>	for (int i = 0; i < SIZE; ++i) {
199	>	assertEquals(i, (int) q.take());
200		}
201		}
202
203		/**
204	<	* take blocks interruptibly when empty
204	>	* take removes existing elements until empty, then blocks interruptibly
205		*/
206	<	public void testTakeFromEmpty() {
207	<	final LinkedTransferQueue q = new LinkedTransferQueue();
208	<	Thread t = new Thread(new Runnable() {
206	>	public void testBlockingTake() throws InterruptedException {
207	>	final BlockingQueue q = populatedQueue(SIZE);
208	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
209	>	Thread t = newStartedThread(new CheckedRunnable() {
210	>	public void realRun() throws InterruptedException {
211	>	for (int i = 0; i < SIZE; ++i) {
212	>	assertEquals(i, q.take());
213	>	}
214
215	<	public void run() {
215	>	Thread.currentThread().interrupt();
216		try {
217		q.take();
218	<	threadShouldThrow();
219	<	} catch (InterruptedException success) {
220	<	}
271	<	}
272	<	});
273	<	try {
274	<	t.start();
275	<	Thread.sleep(SHORT_DELAY_MS);
276	<	t.interrupt();
277	<	t.join();
278	<	} catch (Exception e) {
279	<	unexpectedException();
280	<	}
281	<	}
282	<	/*
283	<	* Take removes existing elements until empty, then blocks interruptibly
284	<	*/
285	<
286	<	public void testBlockingTake() {
287	<	Thread t = new Thread(new Runnable() {
218	>	shouldThrow();
219	>	} catch (InterruptedException success) {}
220	>	assertFalse(Thread.interrupted());
221
222	<	public void run() {
222	>	pleaseInterrupt.countDown();
223		try {
291	–	LinkedTransferQueue q = populatedQueue(SIZE);
292	–	for (int i = 0; i < SIZE; ++i) {
293	–	assertEquals(i, ((Integer) q.take()).intValue());
294	–	}
224		q.take();
225	<	threadShouldThrow();
226	<	} catch (InterruptedException success) {
227	<	}
228	<	}
229	<	});
230	<	t.start();
231	<	try {
232	<	Thread.sleep(SHORT_DELAY_MS);
233	<	t.interrupt();
305	<	t.join();
306	<	} catch (InterruptedException ie) {
307	<	unexpectedException();
308	<	}
225	>	shouldThrow();
226	>	} catch (InterruptedException success) {}
227	>	assertFalse(Thread.interrupted());
228	>	}});
229	>
230	>	await(pleaseInterrupt);
231	>	assertThreadStaysAlive(t);
232	>	t.interrupt();
233	>	awaitTermination(t);
234		}
235
236		/**
237		* poll succeeds unless empty
238		*/
239	<	public void testPoll() {
240	<	LinkedTransferQueue q = populatedQueue(SIZE);
239	>	public void testPoll() throws InterruptedException {
240	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
241		for (int i = 0; i < SIZE; ++i) {
242	<	assertEquals(i, ((Integer) q.poll()).intValue());
242	>	assertEquals(i, (int) q.poll());
243		}
244		assertNull(q.poll());
245	+	checkEmpty(q);
246		}
247
248		/**
249	<	* timed pool with zero timeout succeeds when non-empty, else times out
249	>	* timed poll with zero timeout succeeds when non-empty, else times out
250		*/
251	<	public void testTimedPoll0() {
252	<	try {
253	<	LinkedTransferQueue q = populatedQueue(SIZE);
254	<	for (int i = 0; i < SIZE; ++i) {
329	<	assertEquals(i, ((Integer) q.poll(0, TimeUnit.MILLISECONDS)).intValue());
330	<	}
331	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
332	<	} catch (InterruptedException e) {
333	<	unexpectedException();
251	>	public void testTimedPoll0() throws InterruptedException {
252	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
253	>	for (int i = 0; i < SIZE; ++i) {
254	>	assertEquals(i, (int) q.poll(0, MILLISECONDS));
255		}
256	+	assertNull(q.poll(0, MILLISECONDS));
257	+	checkEmpty(q);
258		}
259
260		/**
261	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
261	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
262		*/
263	<	public void testTimedPoll() {
264	<	try {
265	<	LinkedTransferQueue q = populatedQueue(SIZE);
266	<	for (int i = 0; i < SIZE; ++i) {
267	<	assertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
268	<	}
269	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
270	<	} catch (InterruptedException e) {
271	<	unexpectedException();
272	<	}
263	>	public void testTimedPoll() throws InterruptedException {
264	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
265	>	long startTime = System.nanoTime();
266	>	for (int i = 0; i < SIZE; ++i)
267	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
268	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
269	>
270	>	startTime = System.nanoTime();
271	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
272	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
273	>	checkEmpty(q);
274		}
275
276		/**
277		* Interrupted timed poll throws InterruptedException instead of
278		* returning timeout status
279		*/
280	<	public void testInterruptedTimedPoll() {
281	<	Thread t = new Thread(new Runnable() {
282	<
283	<	public void run() {
280	>	public void testInterruptedTimedPoll() throws InterruptedException {
281	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
282	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
283	>	Thread t = newStartedThread(new CheckedRunnable() {
284	>	public void realRun() throws InterruptedException {
285	>	long startTime = System.nanoTime();
286	>	for (int i = 0; i < SIZE; ++i)
287	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
288	>	aboutToWait.countDown();
289		try {
290	<	LinkedTransferQueue q = populatedQueue(SIZE);
291	<	for (int i = 0; i < SIZE; ++i) {
292	<	threadAssertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
293	<	}
294	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
295	<	} catch (InterruptedException success) {
296	<	}
297	<	}
298	<	});
299	<	t.start();
300	<	try {
372	<	Thread.sleep(SHORT_DELAY_MS);
373	<	t.interrupt();
374	<	t.join();
375	<	} catch (InterruptedException ie) {
376	<	unexpectedException();
377	<	}
290	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
291	>	shouldThrow();
292	>	} catch (InterruptedException success) {}
293	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
294	>	}});
295	>
296	>	aboutToWait.await();
297	>	waitForThreadToEnterWaitState(t);
298	>	t.interrupt();
299	>	awaitTermination(t);
300	>	checkEmpty(q);
301		}
302
303		/**
304	<	*  timed poll before a delayed offer fails; after offer succeeds;
305	<	*  on interruption throws
306	<	*/
307	<	public void testTimedPollWithOffer() {
308	<	final LinkedTransferQueue q = new LinkedTransferQueue();
309	<	Thread t = new Thread(new Runnable() {
310	<
311	<	public void run() {
304	>	* timed poll after thread interrupted throws InterruptedException
305	>	* instead of returning timeout status
306	>	*/
307	>	public void testTimedPollAfterInterrupt() throws InterruptedException {
308	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
309	>	Thread t = newStartedThread(new CheckedRunnable() {
310	>	public void realRun() throws InterruptedException {
311	>	long startTime = System.nanoTime();
312	>	Thread.currentThread().interrupt();
313	>	for (int i = 0; i < SIZE; ++i)
314	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
315		try {
316	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
317	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
318	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
319	<	threadShouldThrow();
320	<	} catch (InterruptedException success) {
321	<	}
322	<	}
323	<	});
398	<	try {
399	<	t.start();
400	<	Thread.sleep(SMALL_DELAY_MS);
401	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
402	<	t.interrupt();
403	<	t.join();
404	<	} catch (Exception e) {
405	<	unexpectedException();
406	<	}
316	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
317	>	shouldThrow();
318	>	} catch (InterruptedException success) {}
319	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
320	>	}});
321	>
322	>	awaitTermination(t);
323	>	checkEmpty(q);
324		}
325
326		/**
327		* peek returns next element, or null if empty
328		*/
329	<	public void testPeek() {
330	<	LinkedTransferQueue q = populatedQueue(SIZE);
329	>	public void testPeek() throws InterruptedException {
330	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
331		for (int i = 0; i < SIZE; ++i) {
332	<	assertEquals(i, ((Integer) q.peek()).intValue());
333	<	q.poll();
332	>	assertEquals(i, (int) q.peek());
333	>	assertEquals(i, (int) q.poll());
334		assertTrue(q.peek() == null ||
335	<	i != ((Integer) q.peek()).intValue());
335	>	i != (int) q.peek());
336		}
337		assertNull(q.peek());
338	+	checkEmpty(q);
339		}
340
341		/**
342	<	* element returns next element, or throws NSEE if empty
342	>	* element returns next element, or throws NoSuchElementException if empty
343		*/
344	<	public void testElement() {
345	<	LinkedTransferQueue q = populatedQueue(SIZE);
344	>	public void testElement() throws InterruptedException {
345	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
346		for (int i = 0; i < SIZE; ++i) {
347	<	assertEquals(i, ((Integer) q.element()).intValue());
348	<	q.poll();
347	>	assertEquals(i, (int) q.element());
348	>	assertEquals(i, (int) q.poll());
349		}
350		try {
351		q.element();
352		shouldThrow();
353	<	} catch (NoSuchElementException success) {
354	<	}
353	>	} catch (NoSuchElementException success) {}
354	>	checkEmpty(q);
355		}
356
357		/**
358	<	* remove removes next element, or throws NSEE if empty
358	>	* remove removes next element, or throws NoSuchElementException if empty
359		*/
360	<	public void testRemove() {
361	<	LinkedTransferQueue q = populatedQueue(SIZE);
360	>	public void testRemove() throws InterruptedException {
361	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
362		for (int i = 0; i < SIZE; ++i) {
363	<	assertEquals(i, ((Integer) q.remove()).intValue());
363	>	assertEquals(i, (int) q.remove());
364		}
365		try {
366		q.remove();
367		shouldThrow();
368	<	} catch (NoSuchElementException success) {
369	<	}
452	<	}
453	<
454	<	/**
455	<	* remove(x) removes x and returns true if present
456	<	*/
457	<	public void testRemoveElement() {
458	<	LinkedTransferQueue q = populatedQueue(SIZE);
459	<	for (int i = 1; i < SIZE; i += 2) {
460	<	assertTrue(q.remove(new Integer(i)));
461	<	}
462	<	for (int i = 0; i < SIZE; i += 2) {
463	<	assertTrue(q.remove(new Integer(i)));
464	<	assertFalse(q.remove(new Integer(i + 1)));
465	<	}
466	<	assertTrue(q.isEmpty());
368	>	} catch (NoSuchElementException success) {}
369	>	checkEmpty(q);
370		}
371
372		/**
373		* An add following remove(x) succeeds
374		*/
375	<	public void testRemoveElementAndAdd() {
376	<	try {
377	<	LinkedTransferQueue q = new LinkedTransferQueue();
378	<	assertTrue(q.add(new Integer(1)));
379	<	assertTrue(q.add(new Integer(2)));
380	<	assertTrue(q.remove(new Integer(1)));
381	<	assertTrue(q.remove(new Integer(2)));
382	<	assertTrue(q.add(new Integer(3)));
480	<	assertTrue(q.take() != null);
481	<	} catch (Exception e) {
482	<	unexpectedException();
483	<	}
375	>	public void testRemoveElementAndAdd() throws InterruptedException {
376	>	LinkedTransferQueue q = new LinkedTransferQueue();
377	>	assertTrue(q.add(one));
378	>	assertTrue(q.add(two));
379	>	assertTrue(q.remove(one));
380	>	assertTrue(q.remove(two));
381	>	assertTrue(q.add(three));
382	>	assertSame(q.take(), three);
383		}
384
385		/**
386		* contains(x) reports true when elements added but not yet removed
387		*/
388		public void testContains() {
389	<	LinkedTransferQueue q = populatedQueue(SIZE);
389	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
390		for (int i = 0; i < SIZE; ++i) {
391	<	assertTrue(q.contains(new Integer(i)));
392	<	q.poll();
393	<	assertFalse(q.contains(new Integer(i)));
391	>	assertTrue(q.contains(i));
392	>	assertEquals(i, (int) q.poll());
393	>	assertFalse(q.contains(i));
394		}
395		}
396
397		/**
398		* clear removes all elements
399		*/
400	<	public void testClear() {
400	>	public void testClear() throws InterruptedException {
401		LinkedTransferQueue q = populatedQueue(SIZE);
503	–	int remainingCapacity = q.remainingCapacity();
402		q.clear();
403	<	assertTrue(q.isEmpty());
404	<	assertEquals(0, q.size());
507	<	assertEquals(remainingCapacity, q.remainingCapacity());
403	>	checkEmpty(q);
404	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
405		q.add(one);
406		assertFalse(q.isEmpty());
407	+	assertEquals(1, q.size());
408		assertTrue(q.contains(one));
409		q.clear();
410	<	assertTrue(q.isEmpty());
410	>	checkEmpty(q);
411		}
412
413		/**
414		* containsAll(c) is true when c contains a subset of elements
415		*/
416		public void testContainsAll() {
417	<	LinkedTransferQueue q = populatedQueue(SIZE);
418	<	LinkedTransferQueue p = new LinkedTransferQueue();
417	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
418	>	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>();
419		for (int i = 0; i < SIZE; ++i) {
420		assertTrue(q.containsAll(p));
421		assertFalse(p.containsAll(q));
422	<	p.add(new Integer(i));
422	>	p.add(i);
423		}
424		assertTrue(p.containsAll(q));
425		}
426
427		/**
428	<	* retainAll(c) retains only those elements of c and reports true if changed
428	>	* retainAll(c) retains only those elements of c and reports true
429	>	* if changed
430		*/
431		public void testRetainAll() {
432		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 546 | Line 445 | public class LinkedTransferQueueTest ext
445		}
446
447		/**
448	<	* removeAll(c) removes only those elements of c and reports true if changed
448	>	* removeAll(c) removes only those elements of c and reports true
449	>	* if changed
450		*/
451		public void testRemoveAll() {
452		for (int i = 1; i < SIZE; ++i) {
#	Line 555 | Line 455 | public class LinkedTransferQueueTest ext
455		assertTrue(q.removeAll(p));
456		assertEquals(SIZE - i, q.size());
457		for (int j = 0; j < i; ++j) {
458	<	Integer I = (Integer) (p.remove());
559	<	assertFalse(q.contains(I));
458	>	assertFalse(q.contains(p.remove()));
459		}
460		}
461		}
462
463		/**
464	<	* toArray contains all elements
464	>	* toArray() contains all elements in FIFO order
465		*/
466		public void testToArray() {
467		LinkedTransferQueue q = populatedQueue(SIZE);
468		Object[] o = q.toArray();
469	<	try {
470	<	for (int i = 0; i < o.length; i++) {
572	<	assertEquals(o[i], q.take());
573	<	}
574	<	} catch (InterruptedException e) {
575	<	unexpectedException();
469	>	for (int i = 0; i < o.length; i++) {
470	>	assertSame(o[i], q.poll());
471		}
472		}
473
474		/**
475	<	* toArray(a) contains all elements
475	>	* toArray(a) contains all elements in FIFO order
476		*/
477		public void testToArray2() {
478	<	LinkedTransferQueue q = populatedQueue(SIZE);
478	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
479		Integer[] ints = new Integer[SIZE];
480	<	ints = (Integer[]) q.toArray(ints);
481	<	try {
482	<	for (int i = 0; i < ints.length; i++) {
483	<	assertEquals(ints[i], q.take());
589	<	}
590	<	} catch (InterruptedException e) {
591	<	unexpectedException();
592	<	}
593	<	}
594	<
595	<	/**
596	<	* toArray(null) throws NPE
597	<	*/
598	<	public void testToArray_BadArg() {
599	<	try {
600	<	LinkedTransferQueue q = populatedQueue(SIZE);
601	<	Object o[] = q.toArray(null);
602	<	shouldThrow();
603	<	} catch (NullPointerException success) {
480	>	Integer[] array = q.toArray(ints);
481	>	assertSame(ints, array);
482	>	for (int i = 0; i < ints.length; i++) {
483	>	assertSame(ints[i], q.poll());
484		}
485		}
486
487		/**
488	<	* toArray with incompatible array type throws CCE
488	>	* toArray(incompatible array type) throws ArrayStoreException
489		*/
490		public void testToArray1_BadArg() {
491	+	LinkedTransferQueue q = populatedQueue(SIZE);
492		try {
493	<	LinkedTransferQueue q = populatedQueue(SIZE);
613	<	Object o[] = q.toArray(new String[10]);
493	>	q.toArray(new String[10]);
494		shouldThrow();
495	<	} catch (ArrayStoreException success) {
616	<	}
495	>	} catch (ArrayStoreException success) {}
496		}
497
498		/**
499		* iterator iterates through all elements
500		*/
501	<	public void testIterator() {
501	>	public void testIterator() throws InterruptedException {
502		LinkedTransferQueue q = populatedQueue(SIZE);
503		Iterator it = q.iterator();
504	<	try {
505	<	while (it.hasNext()) {
506	<	assertEquals(it.next(), q.take());
507	<	}
508	<	} catch (InterruptedException e) {
509	<	unexpectedException();
510	<	}
504	>	int i;
505	>	for (i = 0; it.hasNext(); i++)
506	>	assertTrue(q.contains(it.next()));
507	>	assertEquals(i, SIZE);
508	>	assertIteratorExhausted(it);
509	>
510	>	it = q.iterator();
511	>	for (i = 0; it.hasNext(); i++)
512	>	assertEquals(it.next(), q.take());
513	>	assertEquals(i, SIZE);
514	>	assertIteratorExhausted(it);
515		}
516
517		/**
518	<	* iterator.remove removes current element
518	>	* iterator of empty collection has no elements
519	>	*/
520	>	public void testEmptyIterator() {
521	>	assertIteratorExhausted(new LinkedTransferQueue().iterator());
522	>	}
523	>
524	>	/**
525	>	* iterator.remove() removes current element
526		*/
527		public void testIteratorRemove() {
528		final LinkedTransferQueue q = new LinkedTransferQueue();
#	Line 645 | Line 535 | public class LinkedTransferQueueTest ext
535		it.remove();
536
537		it = q.iterator();
538	<	assertEquals(it.next(), one);
539	<	assertEquals(it.next(), three);
538	>	assertSame(it.next(), one);
539	>	assertSame(it.next(), three);
540		assertFalse(it.hasNext());
541		}
542
#	Line 654 | Line 544 | public class LinkedTransferQueueTest ext
544		* iterator ordering is FIFO
545		*/
546		public void testIteratorOrdering() {
547	<	final LinkedTransferQueue q = new LinkedTransferQueue();
548	<	int remainingCapacity = q.remainingCapacity();
547	>	final LinkedTransferQueue<Integer> q
548	>	= new LinkedTransferQueue<Integer>();
549	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
550		q.add(one);
551		q.add(two);
552		q.add(three);
553	<	assertEquals(remainingCapacity, q.remainingCapacity());
553	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
554		int k = 0;
555	<	for (Iterator it = q.iterator(); it.hasNext();) {
556	<	int i = ((Integer) (it.next())).intValue();
666	<	assertEquals(++k, i);
555	>	for (Integer n : q) {
556	>	assertEquals(++k, (int) n);
557		}
558		assertEquals(3, k);
559		}
#	Line 676 | Line 566 | public class LinkedTransferQueueTest ext
566		q.add(one);
567		q.add(two);
568		q.add(three);
569	<	try {
570	<	for (Iterator it = q.iterator(); it.hasNext();) {
571	<	q.remove();
682	<	it.next();
683	<	}
684	<	} catch (ConcurrentModificationException e) {
685	<	unexpectedException();
569	>	for (Iterator it = q.iterator(); it.hasNext();) {
570	>	q.remove();
571	>	it.next();
572		}
573		assertEquals(0, q.size());
574		}
#	Line 694 | Line 580 | public class LinkedTransferQueueTest ext
580		LinkedTransferQueue q = populatedQueue(SIZE);
581		String s = q.toString();
582		for (int i = 0; i < SIZE; ++i) {
583	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
583	>	assertTrue(s.contains(String.valueOf(i)));
584		}
585		}
586
#	Line 703 | Line 589 | public class LinkedTransferQueueTest ext
589		*/
590		public void testOfferInExecutor() {
591		final LinkedTransferQueue q = new LinkedTransferQueue();
592	<	q.add(one);
593	<	q.add(two);
594	<	ExecutorService executor = Executors.newFixedThreadPool(2);
709	<	executor.execute(new Runnable() {
592	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
593	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
594	>	try (PoolCleaner cleaner = cleaner(executor)) {
595
596	<	public void run() {
597	<	try {
598	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
599	<	} catch (Exception e) {
600	<	threadUnexpectedException();
601	<	}
602	<	}
718	<	});
719	<
720	<	executor.execute(new Runnable() {
721	<
722	<	public void run() {
723	<	try {
724	<	Thread.sleep(SMALL_DELAY_MS);
725	<	threadAssertEquals(one, q.take());
726	<	} catch (InterruptedException e) {
727	<	threadUnexpectedException();
728	<	}
729	<	}
730	<	});
596	>	executor.execute(new CheckedRunnable() {
597	>	public void realRun() throws InterruptedException {
598	>	threadsStarted.await();
599	>	long startTime = System.nanoTime();
600	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
601	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
602	>	}});
603
604	<	joinPool(executor);
604	>	executor.execute(new CheckedRunnable() {
605	>	public void realRun() throws InterruptedException {
606	>	threadsStarted.await();
607	>	assertSame(one, q.take());
608	>	checkEmpty(q);
609	>	}});
610	>	}
611		}
612
613		/**
614	<	* poll retrieves elements across Executor threads
614	>	* timed poll retrieves elements across Executor threads
615		*/
616		public void testPollInExecutor() {
617		final LinkedTransferQueue q = new LinkedTransferQueue();
618	<	ExecutorService executor = Executors.newFixedThreadPool(2);
619	<	executor.execute(new Runnable() {
620	<
621	<	public void run() {
622	<	threadAssertNull(q.poll());
623	<	try {
624	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
625	<	threadAssertTrue(q.isEmpty());
626	<	} catch (InterruptedException e) {
627	<	threadUnexpectedException();
628	<	}
629	<	}
630	<	});
631	<
632	<	executor.execute(new Runnable() {
633	<
634	<	public void run() {
757	<	try {
758	<	Thread.sleep(SMALL_DELAY_MS);
618	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
619	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
620	>	try (PoolCleaner cleaner = cleaner(executor)) {
621	>
622	>	executor.execute(new CheckedRunnable() {
623	>	public void realRun() throws InterruptedException {
624	>	assertNull(q.poll());
625	>	threadsStarted.await();
626	>	long startTime = System.nanoTime();
627	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
628	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
629	>	checkEmpty(q);
630	>	}});
631	>
632	>	executor.execute(new CheckedRunnable() {
633	>	public void realRun() throws InterruptedException {
634	>	threadsStarted.await();
635		q.put(one);
636	<	} catch (InterruptedException e) {
761	<	threadUnexpectedException();
762	<	}
763	<	}
764	<	});
765	<
766	<	joinPool(executor);
767	<	}
768	<
769	<	/**
770	<	* A deserialized serialized queue has same elements in same order
771	<	*/
772	<	public void testSerialization() {
773	<	LinkedTransferQueue q = populatedQueue(SIZE);
774	<
775	<	try {
776	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
777	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
778	<	out.writeObject(q);
779	<	out.close();
780	<
781	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
782	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
783	<	LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
784	<
785	<	assertEquals(q.size(), r.size());
786	<	while (!q.isEmpty()) {
787	<	assertEquals(q.remove(), r.remove());
788	<	}
789	<	} catch (Exception e) {
790	<	unexpectedException();
636	>	}});
637		}
638		}
639
640		/**
641	<	* drainTo(null) throws NPE
796	<	*/
797	<	public void testDrainToNull() {
798	<	LinkedTransferQueue q = populatedQueue(SIZE);
799	<	try {
800	<	q.drainTo(null);
801	<	shouldThrow();
802	<	} catch (NullPointerException success) {
803	<	}
804	<	}
805	<
806	<	/**
807	<	* drainTo(this) throws IAE
641	>	* A deserialized serialized queue has same elements in same order
642		*/
643	<	public void testDrainToSelf() {
644	<	LinkedTransferQueue q = populatedQueue(SIZE);
645	<	try {
646	<	q.drainTo(q);
647	<	shouldThrow();
648	<	} catch (IllegalArgumentException success) {
643	>	public void testSerialization() throws Exception {
644	>	Queue x = populatedQueue(SIZE);
645	>	Queue y = serialClone(x);
646	>
647	>	assertNotSame(y, x);
648	>	assertEquals(x.size(), y.size());
649	>	assertEquals(x.toString(), y.toString());
650	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
651	>	while (!x.isEmpty()) {
652	>	assertFalse(y.isEmpty());
653	>	assertEquals(x.remove(), y.remove());
654		}
655	+	assertTrue(y.isEmpty());
656		}
657
658		/**
#	Line 822 | Line 662 | public class LinkedTransferQueueTest ext
662		LinkedTransferQueue q = populatedQueue(SIZE);
663		ArrayList l = new ArrayList();
664		q.drainTo(l);
665	<	assertEquals(q.size(), 0);
666	<	assertEquals(l.size(), SIZE);
665	>	assertEquals(0, q.size());
666	>	assertEquals(SIZE, l.size());
667		for (int i = 0; i < SIZE; ++i) {
668	<	assertEquals(l.get(i), new Integer(i));
668	>	assertEquals(i, l.get(i));
669		}
670		q.add(zero);
671		q.add(one);
#	Line 834 | Line 674 | public class LinkedTransferQueueTest ext
674		assertTrue(q.contains(one));
675		l.clear();
676		q.drainTo(l);
677	<	assertEquals(q.size(), 0);
678	<	assertEquals(l.size(), 2);
677	>	assertEquals(0, q.size());
678	>	assertEquals(2, l.size());
679		for (int i = 0; i < 2; ++i) {
680	<	assertEquals(l.get(i), new Integer(i));
680	>	assertEquals(i, l.get(i));
681		}
682		}
683
684		/**
685	<	* drainTo empties full queue, unblocking a waiting put.
685	>	* drainTo(c) empties full queue, unblocking a waiting put.
686		*/
687	<	public void testDrainToWithActivePut() {
687	>	public void testDrainToWithActivePut() throws InterruptedException {
688		final LinkedTransferQueue q = populatedQueue(SIZE);
689	<	Thread t = new Thread(new Runnable() {
690	<
691	<	public void run() {
692	<	try {
693	<	q.put(new Integer(SIZE + 1));
694	<	} catch (Exception ie) {
695	<	threadUnexpectedException();
696	<	}
697	<	}
698	<	});
699	<	try {
860	<	t.start();
861	<	ArrayList l = new ArrayList();
862	<	q.drainTo(l);
863	<	assertTrue(l.size() >= SIZE);
864	<	for (int i = 0; i < SIZE; ++i) {
865	<	assertEquals(l.get(i), new Integer(i));
866	<	}
867	<	t.join();
868	<	assertTrue(q.size() + l.size() >= SIZE);
869	<	} catch (Exception e) {
870	<	unexpectedException();
871	<	}
872	<	}
873	<
874	<	/**
875	<	* drainTo(null, n) throws NPE
876	<	*/
877	<	public void testDrainToNullN() {
878	<	LinkedTransferQueue q = populatedQueue(SIZE);
879	<	try {
880	<	q.drainTo(null, 0);
881	<	shouldThrow();
882	<	} catch (NullPointerException success) {
883	<	}
884	<	}
885	<
886	<	/**
887	<	* drainTo(this, n) throws IAE
888	<	*/
889	<	public void testDrainToSelfN() {
890	<	LinkedTransferQueue q = populatedQueue(SIZE);
891	<	try {
892	<	q.drainTo(q, 0);
893	<	shouldThrow();
894	<	} catch (IllegalArgumentException success) {
895	<	}
689	>	Thread t = newStartedThread(new CheckedRunnable() {
690	>	public void realRun() {
691	>	q.put(SIZE + 1);
692	>	}});
693	>	ArrayList l = new ArrayList();
694	>	q.drainTo(l);
695	>	assertTrue(l.size() >= SIZE);
696	>	for (int i = 0; i < SIZE; ++i)
697	>	assertEquals(i, l.get(i));
698	>	awaitTermination(t);
699	>	assertTrue(q.size() + l.size() >= SIZE);
700		}
701
702		/**
703	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
703	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
704		*/
705		public void testDrainToN() {
706		LinkedTransferQueue q = new LinkedTransferQueue();
707		for (int i = 0; i < SIZE + 2; ++i) {
708		for (int j = 0; j < SIZE; j++) {
709	<	assertTrue(q.offer(new Integer(j)));
709	>	assertTrue(q.offer(j));
710		}
711		ArrayList l = new ArrayList();
712		q.drainTo(l, i);
713		int k = (i < SIZE) ? i : SIZE;
714	<	assertEquals(l.size(), k);
715	<	assertEquals(q.size(), SIZE - k);
716	<	for (int j = 0; j < k; ++j) {
717	<	assertEquals(l.get(j), new Integer(j));
718	<	}
915	<	while (q.poll() != null);
714	>	assertEquals(k, l.size());
715	>	assertEquals(SIZE - k, q.size());
716	>	for (int j = 0; j < k; ++j)
717	>	assertEquals(j, l.get(j));
718	>	do {} while (q.poll() != null);
719		}
720		}
721
722	<	/*
723	<	* poll and take should decrement the waiting consumer count
722	>	/**
723	>	* timed poll() or take() increments the waiting consumer count;
724	>	* offer(e) decrements the waiting consumer count
725		*/
726	<	public void testWaitingConsumer() {
727	<	try {
728	<	final LinkedTransferQueue q = new LinkedTransferQueue();
729	<	final ConsumerObserver waiting = new ConsumerObserver();
730	<	new Thread(new Runnable() {
927	<
928	<	public void run() {
929	<	try {
930	<	threadAssertTrue(q.hasWaitingConsumer());
931	<	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
932	<	threadAssertTrue(q.offer(new Object()));
933	<	} catch (Exception ex) {
934	<	threadUnexpectedException();
935	<	}
726	>	public void testWaitingConsumer() throws InterruptedException {
727	>	final LinkedTransferQueue q = new LinkedTransferQueue();
728	>	assertEquals(0, q.getWaitingConsumerCount());
729	>	assertFalse(q.hasWaitingConsumer());
730	>	final CountDownLatch threadStarted = new CountDownLatch(1);
731
732	<	}
733	<	}).start();
734	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
735	<	assertTrue(q.getWaitingConsumerCount() < waiting.getWaitingConsumers());
736	<	} catch (Exception ex) {
737	<	this.unexpectedException();
738	<	}
732	>	Thread t = newStartedThread(new CheckedRunnable() {
733	>	public void realRun() throws InterruptedException {
734	>	threadStarted.countDown();
735	>	long startTime = System.nanoTime();
736	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
737	>	assertEquals(0, q.getWaitingConsumerCount());
738	>	assertFalse(q.hasWaitingConsumer());
739	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
740	>	}});
741	>
742	>	threadStarted.await();
743	>	waitForThreadToEnterWaitState(t);
744	>	assertEquals(1, q.getWaitingConsumerCount());
745	>	assertTrue(q.hasWaitingConsumer());
746	>
747	>	assertTrue(q.offer(one));
748	>	assertEquals(0, q.getWaitingConsumerCount());
749	>	assertFalse(q.hasWaitingConsumer());
750	>
751	>	awaitTermination(t);
752		}
945	–	/*
946	–	* Inserts null into transfer throws NPE
947	–	*/
753
754	<	public void testTransfer1() {
754	>	/**
755	>	* transfer(null) throws NullPointerException
756	>	*/
757	>	public void testTransfer1() throws InterruptedException {
758		try {
759		LinkedTransferQueue q = new LinkedTransferQueue();
760		q.transfer(null);
761		shouldThrow();
762	<	} catch (NullPointerException ex) {
955	<	} catch (Exception ex) {
956	<	this.unexpectedException();
957	<	}
762	>	} catch (NullPointerException success) {}
763		}
764
765	<	/*
766	<	* transfer attempts to insert into the queue then wait until that
767	<	* object is removed via take or poll.
765	>	/**
766	>	* transfer waits until a poll occurs. The transfered element
767	>	* is returned by this associated poll.
768		*/
769	<	public void testTransfer2() {
770	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
771	<	new Thread(new Runnable() {
769	>	public void testTransfer2() throws InterruptedException {
770	>	final LinkedTransferQueue<Integer> q
771	>	= new LinkedTransferQueue<Integer>();
772	>	final CountDownLatch threadStarted = new CountDownLatch(1);
773
774	<	public void run() {
775	<	try {
776	<	q.transfer(new Integer(SIZE));
777	<	threadAssertTrue(q.isEmpty());
778	<	} catch (Exception ex) {
779	<	threadUnexpectedException();
974	<	}
975	<	}
976	<	}).start();
774	>	Thread t = newStartedThread(new CheckedRunnable() {
775	>	public void realRun() throws InterruptedException {
776	>	threadStarted.countDown();
777	>	q.transfer(five);
778	>	checkEmpty(q);
779	>	}});
780
781	<	try {
782	<	Thread.sleep(SHORT_DELAY_MS);
783	<	assertEquals(1, q.size());
784	<	q.poll();
785	<	assertTrue(q.isEmpty());
786	<	} catch (Exception ex) {
787	<	this.unexpectedException();
788	<	}
789	<	}
790	<	/*
791	<	* transfer will attempt to transfer in fifo order and continue waiting if
792	<	* the element being transfered is not polled or taken
793	<	*/
794	<
795	<	public void testTransfer3() {
796	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
797	<	new Thread(new Runnable() {
798	<	public void run() {
799	<	try {
800	<	Integer i;
801	<	q.transfer((i = new Integer(SIZE + 1)));
802	<	threadAssertTrue(!q.contains(i));
803	<	threadAssertEquals(1, q.size());
804	<	} catch (Exception ex) {
805	<	threadUnexpectedException();
806	<	}
807	<	}
808	<	}).start();
809	<	Thread interruptedThread =
810	<	new Thread(new Runnable() {
811	<	public void run() {
812	<	try {
813	<	q.transfer(new Integer(SIZE));
814	<	threadShouldThrow();
815	<	} catch (InterruptedException ex) {
816	<	}
817	<	}
818	<	});
819	<	interruptedThread.start();
1017	<	try {
1018	<	Thread.sleep(LONG_DELAY_MS);
1019	<	assertEquals(2, q.size());
1020	<	q.poll();
1021	<	Thread.sleep(LONG_DELAY_MS);
1022	<	interruptedThread.interrupt();
1023	<	assertEquals(1, q.size());
1024	<	} catch (Exception ex) {
1025	<	this.unexpectedException();
1026	<	}
781	>	threadStarted.await();
782	>	waitForThreadToEnterWaitState(t);
783	>	assertEquals(1, q.size());
784	>	assertSame(five, q.poll());
785	>	checkEmpty(q);
786	>	awaitTermination(t);
787	>	}
788	>
789	>	/**
790	>	* transfer waits until a poll occurs, and then transfers in fifo order
791	>	*/
792	>	public void testTransfer3() throws InterruptedException {
793	>	final LinkedTransferQueue<Integer> q
794	>	= new LinkedTransferQueue<Integer>();
795	>
796	>	Thread first = newStartedThread(new CheckedRunnable() {
797	>	public void realRun() throws InterruptedException {
798	>	q.transfer(four);
799	>	assertTrue(!q.contains(four));
800	>	assertEquals(1, q.size());
801	>	}});
802	>
803	>	Thread interruptedThread = newStartedThread(
804	>	new CheckedInterruptedRunnable() {
805	>	public void realRun() throws InterruptedException {
806	>	while (q.isEmpty())
807	>	Thread.yield();
808	>	q.transfer(five);
809	>	}});
810	>
811	>	while (q.size() < 2)
812	>	Thread.yield();
813	>	assertEquals(2, q.size());
814	>	assertSame(four, q.poll());
815	>	first.join();
816	>	assertEquals(1, q.size());
817	>	interruptedThread.interrupt();
818	>	interruptedThread.join();
819	>	checkEmpty(q);
820		}
821
822		/**
823	<	* transfer will wait as long as a poll or take occurs if one does occur
824	<	* the waiting is finished and the thread that tries to poll/take
1032	<	* wins in retrieving the element
823	>	* transfer waits until a poll occurs, at which point the polling
824	>	* thread returns the element
825		*/
826	<	public void testTransfer4() {
826	>	public void testTransfer4() throws InterruptedException {
827		final LinkedTransferQueue q = new LinkedTransferQueue();
1036	–	new Thread(new Runnable() {
828
829	<	public void run() {
830	<	try {
831	<	q.transfer(new Integer(four));
832	<	threadAssertFalse(q.contains(new Integer(four)));
833	<	threadAssertEquals(new Integer(three), q.poll());
834	<	} catch (Exception ex) {
835	<	threadUnexpectedException();
836	<	}
837	<	}
838	<	}).start();
839	<	try {
840	<	Thread.sleep(MEDIUM_DELAY_MS);
841	<	assertTrue(q.offer(three));
842	<	assertEquals(new Integer(four), q.poll());
1052	<	} catch (Exception ex) {
1053	<	this.unexpectedException();
1054	<	}
829	>	Thread t = newStartedThread(new CheckedRunnable() {
830	>	public void realRun() throws InterruptedException {
831	>	q.transfer(four);
832	>	assertFalse(q.contains(four));
833	>	assertSame(three, q.poll());
834	>	}});
835	>
836	>	while (q.isEmpty())
837	>	Thread.yield();
838	>	assertFalse(q.isEmpty());
839	>	assertEquals(1, q.size());
840	>	assertTrue(q.offer(three));
841	>	assertSame(four, q.poll());
842	>	awaitTermination(t);
843		}
844	<	/*
845	<	* Insert null into trTransfer throws NPE
844	>
845	>	/**
846	>	* transfer waits until a take occurs. The transfered element
847	>	* is returned by this associated take.
848		*/
849	+	public void testTransfer5() throws InterruptedException {
850	+	final LinkedTransferQueue<Integer> q
851	+	= new LinkedTransferQueue<Integer>();
852
853	+	Thread t = newStartedThread(new CheckedRunnable() {
854	+	public void realRun() throws InterruptedException {
855	+	q.transfer(four);
856	+	checkEmpty(q);
857	+	}});
858	+
859	+	while (q.isEmpty())
860	+	Thread.yield();
861	+	assertFalse(q.isEmpty());
862	+	assertEquals(1, q.size());
863	+	assertSame(four, q.take());
864	+	checkEmpty(q);
865	+	awaitTermination(t);
866	+	}
867	+
868	+	/**
869	+	* tryTransfer(null) throws NullPointerException
870	+	*/
871		public void testTryTransfer1() {
872	+	final LinkedTransferQueue q = new LinkedTransferQueue();
873		try {
1062	–	final LinkedTransferQueue q = new LinkedTransferQueue();
874		q.tryTransfer(null);
875	<	this.shouldThrow();
876	<	} catch (NullPointerException ex) {
1066	<	} catch (Exception ex) {
1067	<	this.unexpectedException();
1068	<	}
875	>	shouldThrow();
876	>	} catch (NullPointerException success) {}
877		}
1070	–	/*
1071	–	* tryTransfer returns false and does not enqueue if there are no consumers
1072	–	* waiting to poll or take.
1073	–	*/
878
879	<	public void testTryTransfer2() {
880	<	try {
881	<	final LinkedTransferQueue q = new LinkedTransferQueue();
882	<	assertFalse(q.tryTransfer(new Object()));
883	<	assertEquals(0, q.size());
884	<	} catch (Exception ex) {
885	<	this.unexpectedException();
886	<	}
879	>	/**
880	>	* tryTransfer returns false and does not enqueue if there are no
881	>	* consumers waiting to poll or take.
882	>	*/
883	>	public void testTryTransfer2() throws InterruptedException {
884	>	final LinkedTransferQueue q = new LinkedTransferQueue();
885	>	assertFalse(q.tryTransfer(new Object()));
886	>	assertFalse(q.hasWaitingConsumer());
887	>	checkEmpty(q);
888		}
889	<	/*
890	<	* if there is a consumer waiting poll or take tryTransfer returns
891	<	* true while enqueueing object
889	>
890	>	/**
891	>	* If there is a consumer waiting in timed poll, tryTransfer
892	>	* returns true while successfully transfering object.
893		*/
894	+	public void testTryTransfer3() throws InterruptedException {
895	+	final Object hotPotato = new Object();
896	+	final LinkedTransferQueue q = new LinkedTransferQueue();
897
898	<	public void testTryTransfer3() {
899	<	try {
900	<	final LinkedTransferQueue q = new LinkedTransferQueue();
901	<	new Thread(new Runnable() {
898	>	Thread t = newStartedThread(new CheckedRunnable() {
899	>	public void realRun() {
900	>	while (! q.hasWaitingConsumer())
901	>	Thread.yield();
902	>	assertTrue(q.hasWaitingConsumer());
903	>	checkEmpty(q);
904	>	assertTrue(q.tryTransfer(hotPotato));
905	>	}});
906	>
907	>	long startTime = System.nanoTime();
908	>	assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS));
909	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
910	>	checkEmpty(q);
911	>	awaitTermination(t);
912	>	}
913	>
914	>	/**
915	>	* If there is a consumer waiting in take, tryTransfer returns
916	>	* true while successfully transfering object.
917	>	*/
918	>	public void testTryTransfer4() throws InterruptedException {
919	>	final Object hotPotato = new Object();
920	>	final LinkedTransferQueue q = new LinkedTransferQueue();
921
922	<	public void run() {
923	<	try {
924	<	threadAssertTrue(q.hasWaitingConsumer());
925	<	threadAssertTrue(q.tryTransfer(new Object()));
926	<	} catch (Exception ex) {
927	<	threadUnexpectedException();
928	<	}
922	>	Thread t = newStartedThread(new CheckedRunnable() {
923	>	public void realRun() {
924	>	while (! q.hasWaitingConsumer())
925	>	Thread.yield();
926	>	assertTrue(q.hasWaitingConsumer());
927	>	checkEmpty(q);
928	>	assertTrue(q.tryTransfer(hotPotato));
929	>	}});
930
931	<	}
932	<	}).start();
933	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
1105	<	assertTrue(q.isEmpty());
1106	<	} catch (Exception ex) {
1107	<	this.unexpectedException();
1108	<	}
931	>	assertSame(q.take(), hotPotato);
932	>	checkEmpty(q);
933	>	awaitTermination(t);
934		}
935
936	<	/*
937	<	* tryTransfer waits the amount given if interrupted, show an
1113	<	* interrupted exception
936	>	/**
937	>	* tryTransfer blocks interruptibly if no takers
938		*/
939	<	public void testTryTransfer4() {
939	>	public void testTryTransfer5() throws InterruptedException {
940		final LinkedTransferQueue q = new LinkedTransferQueue();
941	<	Thread toInterrupt = new Thread(new Runnable() {
941	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
942	>	assertTrue(q.isEmpty());
943
944	<	public void run() {
944	>	Thread t = newStartedThread(new CheckedRunnable() {
945	>	public void realRun() throws InterruptedException {
946	>	long startTime = System.nanoTime();
947	>	Thread.currentThread().interrupt();
948		try {
949	<	q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
950	<	threadShouldThrow();
951	<	} catch (InterruptedException ex) {
952	<	}
953	<	}
954	<	});
955	<	try {
956	<	toInterrupt.start();
957	<	Thread.sleep(SMALL_DELAY_MS);
958	<	toInterrupt.interrupt();
959	<	} catch (Exception ex) {
960	<	this.unexpectedException();
961	<	}
949	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
950	>	shouldThrow();
951	>	} catch (InterruptedException success) {}
952	>	assertFalse(Thread.interrupted());
953	>
954	>	pleaseInterrupt.countDown();
955	>	try {
956	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
957	>	shouldThrow();
958	>	} catch (InterruptedException success) {}
959	>	assertFalse(Thread.interrupted());
960	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
961	>	}});
962	>
963	>	await(pleaseInterrupt);
964	>	assertThreadStaysAlive(t);
965	>	t.interrupt();
966	>	awaitTermination(t);
967	>	checkEmpty(q);
968		}
969
970	<	/*
971	<	* tryTransfer gives up after the timeout and return false
970	>	/**
971	>	* tryTransfer gives up after the timeout and returns false
972		*/
973	<	public void testTryTransfer5() {
973	>	public void testTryTransfer6() throws InterruptedException {
974		final LinkedTransferQueue q = new LinkedTransferQueue();
1141	–	try {
1142	–	new Thread(new Runnable() {
975
976	<	public void run() {
977	<	try {
978	<	threadAssertFalse(q.tryTransfer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
979	<	} catch (InterruptedException ex) {
980	<	threadUnexpectedException();
981	<	}
982	<	}
983	<	}).start();
984	<	Thread.sleep(LONG_DELAY_MS);
985	<	assertTrue(q.isEmpty());
986	<	} catch (Exception ex) {
1155	<	this.unexpectedException();
1156	<	}
976	>	Thread t = newStartedThread(new CheckedRunnable() {
977	>	public void realRun() throws InterruptedException {
978	>	long startTime = System.nanoTime();
979	>	assertFalse(q.tryTransfer(new Object(),
980	>	timeoutMillis(), MILLISECONDS));
981	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
982	>	checkEmpty(q);
983	>	}});
984	>
985	>	awaitTermination(t);
986	>	checkEmpty(q);
987		}
988
989	<	/*
989	>	/**
990		* tryTransfer waits for any elements previously in to be removed
991		* before transfering to a poll or take
992		*/
993	<	public void testTryTransfer6() {
993	>	public void testTryTransfer7() throws InterruptedException {
994		final LinkedTransferQueue q = new LinkedTransferQueue();
995	<	q.offer(new Integer(four));
1166	<	new Thread(new Runnable() {
995	>	assertTrue(q.offer(four));
996
997	<	public void run() {
998	<	try {
999	<	threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
1000	<	threadAssertTrue(q.isEmpty());
1001	<	} catch (InterruptedException ex) {
1002	<	threadUnexpectedException();
1003	<	}
1004	<	}
1005	<	}).start();
1006	<	try {
1007	<	Thread.sleep(SHORT_DELAY_MS);
1008	<	assertEquals(2, q.size());
1009	<	assertEquals(new Integer(four), q.poll());
1010	<	assertEquals(new Integer(five), q.poll());
1011	<	assertTrue(q.isEmpty());
1183	<	} catch (Exception ex) {
1184	<	this.unexpectedException();
1185	<	}
997	>	Thread t = newStartedThread(new CheckedRunnable() {
998	>	public void realRun() throws InterruptedException {
999	>	long startTime = System.nanoTime();
1000	>	assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS));
1001	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1002	>	checkEmpty(q);
1003	>	}});
1004	>
1005	>	while (q.size() != 2)
1006	>	Thread.yield();
1007	>	assertEquals(2, q.size());
1008	>	assertSame(four, q.poll());
1009	>	assertSame(five, q.poll());
1010	>	checkEmpty(q);
1011	>	awaitTermination(t);
1012		}
1013
1014	<	/*
1015	<	* tryTransfer attempts to enqueue into the q and fails returning false not
1016	<	* enqueueing and the successing poll is null
1014	>	/**
1015	>	* tryTransfer attempts to enqueue into the queue and fails
1016	>	* returning false not enqueueing and the successive poll is null
1017		*/
1018	<	public void testTryTransfer7() {
1018	>	public void testTryTransfer8() throws InterruptedException {
1019		final LinkedTransferQueue q = new LinkedTransferQueue();
1020	<	q.offer(new Integer(four));
1021	<	new Thread(new Runnable() {
1022	<
1023	<	public void run() {
1024	<	try {
1025	<	threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1026	<	threadAssertTrue(q.isEmpty());
1027	<	} catch (InterruptedException ex) {
1028	<	threadUnexpectedException();
1203	<	}
1204	<	}
1205	<	}).start();
1206	<	try {
1207	<	assertEquals(1, q.size());
1208	<	assertEquals(new Integer(four), q.poll());
1209	<	Thread.sleep(MEDIUM_DELAY_MS);
1210	<	assertNull(q.poll());
1211	<	} catch (Exception ex) {
1212	<	this.unexpectedException();
1213	<	}
1020	>	assertTrue(q.offer(four));
1021	>	assertEquals(1, q.size());
1022	>	long startTime = System.nanoTime();
1023	>	assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS));
1024	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1025	>	assertEquals(1, q.size());
1026	>	assertSame(four, q.poll());
1027	>	assertNull(q.poll());
1028	>	checkEmpty(q);
1029		}
1030
1031	<	private LinkedTransferQueue populatedQueue(
1032	<	int n) {
1033	<	LinkedTransferQueue q = new LinkedTransferQueue();
1034	<	assertTrue(q.isEmpty());
1035	<	int remainingCapacity = q.remainingCapacity();
1221	<	for (int i = 0; i <
1222	<	n; i++) {
1031	>	private LinkedTransferQueue<Integer> populatedQueue(int n) {
1032	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
1033	>	checkEmpty(q);
1034	>	for (int i = 0; i < n; i++) {
1035	>	assertEquals(i, q.size());
1036		assertTrue(q.offer(i));
1037	+	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
1038		}
1225	–
1039		assertFalse(q.isEmpty());
1227	–	assertEquals(remainingCapacity, q.remainingCapacity());
1228	–	assertEquals(n, q.size());
1040		return q;
1041		}
1042
1043	<	private static class ConsumerObserver {
1044	<
1045	<	private int waitingConsumers;
1046	<
1047	<	private ConsumerObserver() {
1048	<	}
1049	<
1050	<	private void setWaitingConsumer(int i) {
1051	<	this.waitingConsumers = i;
1052	<	}
1053	<
1054	<	private int getWaitingConsumers() {
1244	<	return waitingConsumers;
1043	>	/**
1044	>	* remove(null), contains(null) always return false
1045	>	*/
1046	>	public void testNeverContainsNull() {
1047	>	Collection<?>[] qs = {
1048	>	new LinkedTransferQueue<Object>(),
1049	>	populatedQueue(2),
1050	>	};
1051	>
1052	>	for (Collection<?> q : qs) {
1053	>	assertFalse(q.contains(null));
1054	>	assertFalse(q.remove(null));
1055		}
1056		}
1057		}

Diff Legend

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