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

Diff Legend

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