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.1 by dl, Fri Jul 31 23:02:49 2009 UTC vs.
Revision 1.87 by jsr166, Wed Jan 27 01:57:24 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) {
128	>	mustEqual(Integer.MAX_VALUE, q.remainingCapacity());
129	>	mustEqual(i, q.size());
130	>	mustAdd(q, i);
131		}
132		}
133
134		/**
135	<	* 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
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	<	*/
285	<
286	<	public void testBlockingTake() {
287	<	Thread t = new Thread(new Runnable() {
208	>	shouldThrow();
209	>	} catch (InterruptedException success) {}
210	>	assertFalse(Thread.interrupted());
211
212	<	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	>	public void testToArray1_BadArg() {
488	>	LinkedTransferQueue<Item> q = populatedQueue(SIZE);
489		try {
490	<	LinkedTransferQueue q = populatedQueue(SIZE);
601	<	Object o[] = q.toArray(null);
490	>	q.toArray(new String[10]);
491		shouldThrow();
492	<	} catch (NullPointerException success) {
604	<	}
492	>	} catch (ArrayStoreException success) {}
493		}
494
495		/**
496	<	* toArray with incompatible array type throws CCE
496	>	* iterator iterates through all elements
497		*/
498	<	public void testToArray1_BadArg() {
499	<	try {
500	<	LinkedTransferQueue q = populatedQueue(SIZE);
501	<	Object o[] = q.toArray(new String[10]);
502	<	shouldThrow();
503	<	} catch (ArrayStoreException success) {
504	<	}
498	>	public void testIterator() throws InterruptedException {
499	>	LinkedTransferQueue<Item> q = populatedQueue(SIZE);
500	>	Iterator<? extends Item> it = q.iterator();
501	>	int i;
502	>	for (i = 0; it.hasNext(); i++)
503	>	mustContain(q, it.next());
504	>	mustEqual(i, SIZE);
505	>	assertIteratorExhausted(it);
506	>
507	>	it = q.iterator();
508	>	for (i = 0; it.hasNext(); i++)
509	>	mustEqual(it.next(), q.take());
510	>	mustEqual(i, SIZE);
511	>	assertIteratorExhausted(it);
512		}
513
514		/**
515	<	* iterator iterates through all elements
515	>	* iterator of empty collection has no elements
516		*/
517	<	public void testIterator() {
518	<	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	<	}
517	>	public void testEmptyIterator() {
518	>	assertIteratorExhausted(new LinkedTransferQueue().iterator());
519		}
520
521		/**
522	<	* iterator.remove removes current element
522	>	* iterator.remove() removes current element
523		*/
524		public void testIteratorRemove() {
525	<	final LinkedTransferQueue q = new LinkedTransferQueue();
525	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
526		q.add(two);
527		q.add(one);
528		q.add(three);
529
530	<	Iterator it = q.iterator();
530	>	Iterator<? extends Item> it = q.iterator();
531		it.next();
532		it.remove();
533
534		it = q.iterator();
535	<	assertEquals(it.next(), one);
536	<	assertEquals(it.next(), three);
535	>	assertSame(it.next(), one);
536	>	assertSame(it.next(), three);
537		assertFalse(it.hasNext());
538		}
539
#	Line 654 | Line 541 | public class LinkedTransferQueueTest ext
541		* iterator ordering is FIFO
542		*/
543		public void testIteratorOrdering() {
544	<	final LinkedTransferQueue q = new LinkedTransferQueue();
545	<	int remainingCapacity = q.remainingCapacity();
544	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
545	>	mustEqual(Integer.MAX_VALUE, q.remainingCapacity());
546		q.add(one);
547		q.add(two);
548		q.add(three);
549	<	assertEquals(remainingCapacity, q.remainingCapacity());
549	>	mustEqual(Integer.MAX_VALUE, q.remainingCapacity());
550		int k = 0;
551	<	for (Iterator it = q.iterator(); it.hasNext();) {
552	<	int i = ((Integer) (it.next())).intValue();
666	<	assertEquals(++k, i);
551	>	for (Item n : q) {
552	>	mustEqual(++k, n);
553		}
554	<	assertEquals(3, k);
554	>	mustEqual(3, k);
555		}
556
557		/**
558		* Modifications do not cause iterators to fail
559		*/
560		public void testWeaklyConsistentIteration() {
561	<	final LinkedTransferQueue q = new LinkedTransferQueue();
561	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
562		q.add(one);
563		q.add(two);
564		q.add(three);
565	<	try {
566	<	for (Iterator it = q.iterator(); it.hasNext();) {
567	<	q.remove();
682	<	it.next();
683	<	}
684	<	} catch (ConcurrentModificationException e) {
685	<	unexpectedException();
565	>	for (Iterator<? extends Item> it = q.iterator(); it.hasNext();) {
566	>	q.remove();
567	>	it.next();
568		}
569	<	assertEquals(0, q.size());
569	>	mustEqual(0, q.size());
570		}
571
572		/**
573		* toString contains toStrings of elements
574		*/
575		public void testToString() {
576	<	LinkedTransferQueue q = populatedQueue(SIZE);
576	>	LinkedTransferQueue<Item> q = populatedQueue(SIZE);
577		String s = q.toString();
578		for (int i = 0; i < SIZE; ++i) {
579	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
579	>	assertTrue(s.contains(String.valueOf(i)));
580		}
581		}
582
#	Line 702 | Line 584 | public class LinkedTransferQueueTest ext
584		* offer transfers elements across Executor tasks
585		*/
586		public void testOfferInExecutor() {
587	<	final LinkedTransferQueue q = new LinkedTransferQueue();
588	<	q.add(one);
589	<	q.add(two);
590	<	ExecutorService executor = Executors.newFixedThreadPool(2);
591	<	executor.execute(new Runnable() {
592	<
593	<	public void run() {
594	<	try {
595	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
596	<	} catch (Exception e) {
597	<	threadUnexpectedException();
598	<	}
599	<	}
600	<	});
601	<
602	<	executor.execute(new Runnable() {
603	<
604	<	public void run() {
605	<	try {
606	<	Thread.sleep(SMALL_DELAY_MS);
725	<	threadAssertEquals(one, q.take());
726	<	} catch (InterruptedException e) {
727	<	threadUnexpectedException();
728	<	}
729	<	}
730	<	});
731	<
732	<	joinPool(executor);
587	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
588	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
589	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
590	>	try (PoolCleaner cleaner = cleaner(executor)) {
591	>
592	>	executor.execute(new CheckedRunnable() {
593	>	public void realRun() throws InterruptedException {
594	>	threadsStarted.await();
595	>	long startTime = System.nanoTime();
596	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
597	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
598	>	}});
599	>
600	>	executor.execute(new CheckedRunnable() {
601	>	public void realRun() throws InterruptedException {
602	>	threadsStarted.await();
603	>	assertSame(one, q.take());
604	>	checkEmpty(q);
605	>	}});
606	>	}
607		}
608
609		/**
610	<	* poll retrieves elements across Executor threads
610	>	* timed poll retrieves elements across Executor threads
611		*/
612		public void testPollInExecutor() {
613	<	final LinkedTransferQueue q = new LinkedTransferQueue();
614	<	ExecutorService executor = Executors.newFixedThreadPool(2);
615	<	executor.execute(new Runnable() {
616	<
617	<	public void run() {
618	<	threadAssertNull(q.poll());
619	<	try {
620	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
621	<	threadAssertTrue(q.isEmpty());
622	<	} catch (InterruptedException e) {
623	<	threadUnexpectedException();
624	<	}
625	<	}
626	<	});
627	<
628	<	executor.execute(new Runnable() {
629	<
630	<	public void run() {
757	<	try {
758	<	Thread.sleep(SMALL_DELAY_MS);
613	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
614	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
615	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
616	>	try (PoolCleaner cleaner = cleaner(executor)) {
617	>
618	>	executor.execute(new CheckedRunnable() {
619	>	public void realRun() throws InterruptedException {
620	>	assertNull(q.poll());
621	>	threadsStarted.await();
622	>	long startTime = System.nanoTime();
623	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
624	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
625	>	checkEmpty(q);
626	>	}});
627	>
628	>	executor.execute(new CheckedRunnable() {
629	>	public void realRun() throws InterruptedException {
630	>	threadsStarted.await();
631		q.put(one);
632	<	} 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();
632	>	}});
633		}
634		}
635
636		/**
637	<	* drainTo(null) throws NPE
637	>	* A deserialized/reserialized queue has same elements in same order
638		*/
639	<	public void testDrainToNull() {
640	<	LinkedTransferQueue q = populatedQueue(SIZE);
641	<	try {
800	<	q.drainTo(null);
801	<	shouldThrow();
802	<	} catch (NullPointerException success) {
803	<	}
804	<	}
639	>	public void testSerialization() throws Exception {
640	>	Queue<Item> x = populatedQueue(SIZE);
641	>	Queue<Item> y = serialClone(x);
642
643	<	/**
644	<	* drainTo(this) throws IAE
645	<	*/
646	<	public void testDrainToSelf() {
647	<	LinkedTransferQueue q = populatedQueue(SIZE);
648	<	try {
649	<	q.drainTo(q);
813	<	shouldThrow();
814	<	} catch (IllegalArgumentException success) {
643	>	assertNotSame(y, x);
644	>	mustEqual(x.size(), y.size());
645	>	mustEqual(x.toString(), y.toString());
646	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
647	>	while (!x.isEmpty()) {
648	>	assertFalse(y.isEmpty());
649	>	mustEqual(x.remove(), y.remove());
650		}
651	+	assertTrue(y.isEmpty());
652		}
653
654		/**
655		* drainTo(c) empties queue into another collection c
656		*/
657		public void testDrainTo() {
658	<	LinkedTransferQueue q = populatedQueue(SIZE);
658	>	LinkedTransferQueue<Item> q = populatedQueue(SIZE);
659		ArrayList l = new ArrayList();
660		q.drainTo(l);
661	<	assertEquals(q.size(), 0);
662	<	assertEquals(l.size(), SIZE);
661	>	mustEqual(0, q.size());
662	>	mustEqual(SIZE, l.size());
663		for (int i = 0; i < SIZE; ++i) {
664	<	assertEquals(l.get(i), new Integer(i));
664	>	mustEqual(i, l.get(i));
665		}
666		q.add(zero);
667		q.add(one);
668		assertFalse(q.isEmpty());
669	<	assertTrue(q.contains(zero));
670	<	assertTrue(q.contains(one));
669	>	mustContain(q, zero);
670	>	mustContain(q, one);
671		l.clear();
672		q.drainTo(l);
673	<	assertEquals(q.size(), 0);
674	<	assertEquals(l.size(), 2);
673	>	mustEqual(0, q.size());
674	>	mustEqual(2, l.size());
675		for (int i = 0; i < 2; ++i) {
676	<	assertEquals(l.get(i), new Integer(i));
676	>	mustEqual(i, l.get(i));
677		}
678		}
679
680		/**
681	<	* drainTo empties full queue, unblocking a waiting put.
681	>	* drainTo(c) empties full queue, unblocking a waiting put.
682		*/
683	<	public void testDrainToWithActivePut() {
684	<	final LinkedTransferQueue q = populatedQueue(SIZE);
685	<	Thread t = new Thread(new Runnable() {
683	>	public void testDrainToWithActivePut() throws InterruptedException {
684	>	final LinkedTransferQueue<Item> q = populatedQueue(SIZE);
685	>	Thread t = newStartedThread(new CheckedRunnable() {
686	>	public void realRun() {
687	>	q.put(new Item(SIZE + 1));
688	>	}});
689	>	ArrayList l = new ArrayList();
690	>	q.drainTo(l);
691	>	assertTrue(l.size() >= SIZE);
692	>	for (int i = 0; i < SIZE; ++i)
693	>	mustEqual(i, l.get(i));
694	>	awaitTermination(t);
695	>	assertTrue(q.size() + l.size() >= SIZE);
696	>	}
697
698	<	public void run() {
699	<	try {
700	<	q.put(new Integer(SIZE + 1));
701	<	} catch (Exception ie) {
702	<	threadUnexpectedException();
703	<	}
698	>	/**
699	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
700	>	*/
701	>	public void testDrainToN() {
702	>	LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
703	>	for (int i = 0; i < SIZE + 2; ++i) {
704	>	for (int j = 0; j < SIZE; j++) {
705	>	mustOffer(q, j);
706		}
858	–	});
859	–	try {
860	–	t.start();
707		ArrayList l = new ArrayList();
708	<	q.drainTo(l);
709	<	assertTrue(l.size() >= SIZE);
710	<	for (int i = 0; i < SIZE; ++i) {
711	<	assertEquals(l.get(i), new Integer(i));
712	<	}
713	<	t.join();
714	<	assertTrue(q.size() + l.size() >= SIZE);
869	<	} catch (Exception e) {
870	<	unexpectedException();
708	>	q.drainTo(l, i);
709	>	int k = (i < SIZE) ? i : SIZE;
710	>	mustEqual(k, l.size());
711	>	mustEqual(SIZE - k, q.size());
712	>	for (int j = 0; j < k; ++j)
713	>	mustEqual(j, l.get(j));
714	>	do {} while (q.poll() != null);
715		}
716		}
717
718		/**
719	<	* drainTo(null, n) throws NPE
719	>	* timed poll() or take() increments the waiting consumer count;
720	>	* offer(e) decrements the waiting consumer count
721		*/
722	<	public void testDrainToNullN() {
723	<	LinkedTransferQueue q = populatedQueue(SIZE);
724	<	try {
725	<	q.drainTo(null, 0);
726	<	shouldThrow();
727	<	} catch (NullPointerException success) {
728	<	}
722	>	public void testWaitingConsumer() throws InterruptedException {
723	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
724	>	mustEqual(0, q.getWaitingConsumerCount());
725	>	assertFalse(q.hasWaitingConsumer());
726	>	final CountDownLatch threadStarted = new CountDownLatch(1);
727	>
728	>	Thread t = newStartedThread(new CheckedRunnable() {
729	>	public void realRun() throws InterruptedException {
730	>	threadStarted.countDown();
731	>	long startTime = System.nanoTime();
732	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
733	>	mustEqual(0, q.getWaitingConsumerCount());
734	>	assertFalse(q.hasWaitingConsumer());
735	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
736	>	}});
737	>
738	>	threadStarted.await();
739	>	Callable<Boolean> oneConsumer = new Callable<>() {
740	>	public Boolean call() {
741	>	return q.hasWaitingConsumer()
742	>	&& q.getWaitingConsumerCount() == 1; }};
743	>	waitForThreadToEnterWaitState(t, oneConsumer);
744	>
745	>	assertTrue(q.offer(one));
746	>	mustEqual(0, q.getWaitingConsumerCount());
747	>	assertFalse(q.hasWaitingConsumer());
748	>
749	>	awaitTermination(t);
750		}
751
752		/**
753	<	* drainTo(this, n) throws IAE
753	>	* transfer(null) throws NullPointerException
754		*/
755	<	public void testDrainToSelfN() {
890	<	LinkedTransferQueue q = populatedQueue(SIZE);
755	>	public void testTransfer1() throws InterruptedException {
756		try {
757	<	q.drainTo(q, 0);
757	>	LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
758	>	q.transfer(null);
759		shouldThrow();
760	<	} catch (IllegalArgumentException success) {
895	<	}
760	>	} catch (NullPointerException success) {}
761		}
762
763		/**
764	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
764	>	* transfer waits until a poll occurs. The transferred element
765	>	* is returned by the associated poll.
766		*/
767	<	public void testDrainToN() {
768	<	LinkedTransferQueue q = new LinkedTransferQueue();
769	<	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	<	}
767	>	public void testTransfer2() throws InterruptedException {
768	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
769	>	final CountDownLatch threadStarted = new CountDownLatch(1);
770
771	<	/*
772	<	* poll and take should decrement the waiting consumer count
773	<	*/
774	<	public void testWaitingConsumer() {
775	<	try {
776	<	final LinkedTransferQueue q = new LinkedTransferQueue();
777	<	final ConsumerObserver waiting = new ConsumerObserver();
778	<	new Thread(new Runnable() {
779	<
780	<	public void run() {
781	<	try {
782	<	threadAssertTrue(q.hasWaitingConsumer());
783	<	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
784	<	threadAssertTrue(q.offer(new Object()));
785	<	} catch (Exception ex) {
786	<	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	<	}
771	>	Thread t = newStartedThread(new CheckedRunnable() {
772	>	public void realRun() throws InterruptedException {
773	>	threadStarted.countDown();
774	>	q.transfer(five);
775	>	checkEmpty(q);
776	>	}});
777	>
778	>	threadStarted.await();
779	>	Callable<Boolean> oneElement = new Callable<>() {
780	>	public Boolean call() {
781	>	return !q.isEmpty() && q.size() == 1; }};
782	>	waitForThreadToEnterWaitState(t, oneElement);
783	>
784	>	assertSame(five, q.poll());
785	>	checkEmpty(q);
786	>	awaitTermination(t);
787		}
788	<	/*
789	<	* Inserts null into transfer throws NPE
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<Item> q = new LinkedTransferQueue<>();
794
795	<	public void testTransfer1() {
796	<	try {
797	<	LinkedTransferQueue q = new LinkedTransferQueue();
798	<	q.transfer(null);
799	<	shouldThrow();
800	<	} catch (NullPointerException ex) {
801	<	} catch (Exception ex) {
802	<	this.unexpectedException();
803	<	}
795	>	Thread first = newStartedThread(new CheckedRunnable() {
796	>	public void realRun() throws InterruptedException {
797	>	q.transfer(four);
798	>	mustNotContain(q, four);
799	>	mustEqual(1, q.size());
800	>	}});
801	>
802	>	Thread interruptedThread = newStartedThread(
803	>	new CheckedInterruptedRunnable() {
804	>	public void realRun() throws InterruptedException {
805	>	while (q.isEmpty())
806	>	Thread.yield();
807	>	q.transfer(five);
808	>	}});
809	>
810	>	while (q.size() < 2)
811	>	Thread.yield();
812	>	mustEqual(2, q.size());
813	>	assertSame(four, q.poll());
814	>	first.join();
815	>	mustEqual(1, q.size());
816	>	interruptedThread.interrupt();
817	>	interruptedThread.join();
818	>	checkEmpty(q);
819		}
820
821	<	/*
822	<	* transfer attempts to insert into the queue then wait until that
823	<	* object is removed via take or poll.
821	>	/**
822	>	* transfer waits until a poll occurs, at which point the polling
823	>	* thread returns the element
824		*/
825	<	public void testTransfer2() {
826	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
966	<	new Thread(new Runnable() {
825	>	public void testTransfer4() throws InterruptedException {
826	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
827
828	<	public void run() {
829	<	try {
830	<	q.transfer(new Integer(SIZE));
831	<	threadAssertTrue(q.isEmpty());
832	<	} catch (Exception ex) {
833	<	threadUnexpectedException();
974	<	}
975	<	}
976	<	}).start();
828	>	Thread t = newStartedThread(new CheckedRunnable() {
829	>	public void realRun() throws InterruptedException {
830	>	q.transfer(four);
831	>	mustNotContain(q, four);
832	>	assertSame(three, q.poll());
833	>	}});
834
835	<	try {
836	<	Thread.sleep(SHORT_DELAY_MS);
837	<	assertEquals(1, q.size());
838	<	q.poll();
839	<	assertTrue(q.isEmpty());
840	<	} catch (Exception ex) {
841	<	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	<	}
835	>	while (q.isEmpty())
836	>	Thread.yield();
837	>	assertFalse(q.isEmpty());
838	>	mustEqual(1, q.size());
839	>	assertTrue(q.offer(three));
840	>	assertSame(four, q.poll());
841	>	awaitTermination(t);
842		}
843
844		/**
845	<	* transfer will wait as long as a poll or take occurs if one does occur
846	<	* the waiting is finished and the thread that tries to poll/take
1032	<	* wins in retrieving the element
845	>	* transfer waits until a take occurs. The transferred element
846	>	* is returned by the associated take.
847		*/
848	<	public void testTransfer4() {
849	<	final LinkedTransferQueue q = new LinkedTransferQueue();
1036	<	new Thread(new Runnable() {
848	>	public void testTransfer5() throws InterruptedException {
849	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
850
851	<	public void run() {
852	<	try {
853	<	q.transfer(new Integer(four));
854	<	threadAssertFalse(q.contains(new Integer(four)));
855	<	threadAssertEquals(new Integer(three), q.poll());
856	<	} catch (Exception ex) {
857	<	threadUnexpectedException();
858	<	}
859	<	}
860	<	}).start();
861	<	try {
862	<	Thread.sleep(MEDIUM_DELAY_MS);
863	<	assertTrue(q.offer(three));
1051	<	assertEquals(new Integer(four), q.poll());
1052	<	} catch (Exception ex) {
1053	<	this.unexpectedException();
1054	<	}
851	>	Thread t = newStartedThread(new CheckedRunnable() {
852	>	public void realRun() throws InterruptedException {
853	>	q.transfer(four);
854	>	checkEmpty(q);
855	>	}});
856	>
857	>	while (q.isEmpty())
858	>	Thread.yield();
859	>	assertFalse(q.isEmpty());
860	>	mustEqual(1, q.size());
861	>	assertSame(four, q.take());
862	>	checkEmpty(q);
863	>	awaitTermination(t);
864		}
1056	–	/*
1057	–	* Insert null into trTransfer throws NPE
1058	–	*/
865
866	+	/**
867	+	* tryTransfer(null) throws NullPointerException
868	+	*/
869		public void testTryTransfer1() {
870	+	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
871		try {
1062	–	final LinkedTransferQueue q = new LinkedTransferQueue();
872		q.tryTransfer(null);
873	<	this.shouldThrow();
874	<	} catch (NullPointerException ex) {
1066	<	} catch (Exception ex) {
1067	<	this.unexpectedException();
1068	<	}
873	>	shouldThrow();
874	>	} catch (NullPointerException success) {}
875		}
876	<	/*
877	<	* tryTransfer returns false and does not enqueue if there are no consumers
878	<	* waiting to poll or take.
876	>
877	>	/**
878	>	* tryTransfer returns false and does not enqueue if there are no
879	>	* consumers waiting to poll or take.
880		*/
881	+	public void testTryTransfer2() throws InterruptedException {
882	+	final LinkedTransferQueue<Object> q = new LinkedTransferQueue<>();
883	+	assertFalse(q.tryTransfer(new Object()));
884	+	assertFalse(q.hasWaitingConsumer());
885	+	checkEmpty(q);
886	+	}
887
888	<	public void testTryTransfer2() {
889	<	try {
890	<	final LinkedTransferQueue q = new LinkedTransferQueue();
891	<	assertFalse(q.tryTransfer(new Object()));
892	<	assertEquals(0, q.size());
893	<	} catch (Exception ex) {
894	<	this.unexpectedException();
895	<	}
888	>	/**
889	>	* If there is a consumer waiting in timed poll, tryTransfer
890	>	* returns true while successfully transfering object.
891	>	*/
892	>	public void testTryTransfer3() throws InterruptedException {
893	>	final Object hotPotato = new Object();
894	>	final LinkedTransferQueue<Object> q = new LinkedTransferQueue<>();
895	>
896	>	Thread t = newStartedThread(new CheckedRunnable() {
897	>	public void realRun() {
898	>	while (! q.hasWaitingConsumer())
899	>	Thread.yield();
900	>	assertTrue(q.hasWaitingConsumer());
901	>	checkEmpty(q);
902	>	assertTrue(q.tryTransfer(hotPotato));
903	>	}});
904	>
905	>	long startTime = System.nanoTime();
906	>	assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS));
907	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
908	>	checkEmpty(q);
909	>	awaitTermination(t);
910		}
911	<	/*
912	<	* if there is a consumer waiting poll or take tryTransfer returns
913	<	* true while enqueueing object
911	>
912	>	/**
913	>	* If there is a consumer waiting in take, tryTransfer returns
914	>	* true while successfully transfering object.
915		*/
916	+	public void testTryTransfer4() throws InterruptedException {
917	+	final Object hotPotato = new Object();
918	+	final LinkedTransferQueue<Object> q = new LinkedTransferQueue<>();
919
920	<	public void testTryTransfer3() {
921	<	try {
922	<	final LinkedTransferQueue q = new LinkedTransferQueue();
923	<	new Thread(new Runnable() {
920	>	Thread t = newStartedThread(new CheckedRunnable() {
921	>	public void realRun() {
922	>	while (! q.hasWaitingConsumer())
923	>	Thread.yield();
924	>	assertTrue(q.hasWaitingConsumer());
925	>	checkEmpty(q);
926	>	assertTrue(q.tryTransfer(hotPotato));
927	>	}});
928
929	<	public void run() {
930	<	try {
931	<	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	<	}
929	>	assertSame(q.take(), hotPotato);
930	>	checkEmpty(q);
931	>	awaitTermination(t);
932		}
933
934	<	/*
935	<	* tryTransfer waits the amount given if interrupted, show an
936	<	* interrupted exception
937	<	*/
938	<	public void testTryTransfer4() {
939	<	final LinkedTransferQueue q = new LinkedTransferQueue();
940	<	Thread toInterrupt = new Thread(new Runnable() {
934	>	/**
935	>	* tryTransfer blocks interruptibly if no takers
936	>	*/
937	>	public void testTryTransfer5() throws InterruptedException {
938	>	final LinkedTransferQueue<Object> q = new LinkedTransferQueue<>();
939	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
940	>	assertTrue(q.isEmpty());
941	>
942	>	Thread t = newStartedThread(new CheckedRunnable() {
943	>	public void realRun() throws InterruptedException {
944	>	Thread.currentThread().interrupt();
945	>	try {
946	>	q.tryTransfer(new Object(), randomTimeout(), randomTimeUnit());
947	>	shouldThrow();
948	>	} catch (InterruptedException success) {}
949	>	assertFalse(Thread.interrupted());
950
951	<	public void run() {
951	>	pleaseInterrupt.countDown();
952		try {
953	<	q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
954	<	threadShouldThrow();
955	<	} catch (InterruptedException ex) {
956	<	}
957	<	}
958	<	});
959	<	try {
960	<	toInterrupt.start();
961	<	Thread.sleep(SMALL_DELAY_MS);
962	<	toInterrupt.interrupt();
963	<	} catch (Exception ex) {
1132	<	this.unexpectedException();
1133	<	}
953	>	q.tryTransfer(new Object(), LONGER_DELAY_MS, MILLISECONDS);
954	>	shouldThrow();
955	>	} catch (InterruptedException success) {}
956	>	assertFalse(Thread.interrupted());
957	>	}});
958	>
959	>	await(pleaseInterrupt);
960	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
961	>	t.interrupt();
962	>	awaitTermination(t);
963	>	checkEmpty(q);
964		}
965
966	<	/*
967	<	* tryTransfer gives up after the timeout and return false
968	<	*/
969	<	public void testTryTransfer5() {
970	<	final LinkedTransferQueue q = new LinkedTransferQueue();
971	<	try {
972	<	new Thread(new Runnable() {
966	>	/**
967	>	* tryTransfer gives up after the timeout and returns false
968	>	*/
969	>	public void testTryTransfer6() throws InterruptedException {
970	>	final LinkedTransferQueue<Object> q = new LinkedTransferQueue<>();
971	>
972	>	Thread t = newStartedThread(new CheckedRunnable() {
973	>	public void realRun() throws InterruptedException {
974	>	long startTime = System.nanoTime();
975	>	assertFalse(q.tryTransfer(new Object(),
976	>	timeoutMillis(), MILLISECONDS));
977	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
978	>	checkEmpty(q);
979	>	}});
980
981	<	public void run() {
982	<	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	<	}
981	>	awaitTermination(t);
982	>	checkEmpty(q);
983		}
984
985	<	/*
985	>	/**
986		* tryTransfer waits for any elements previously in to be removed
987		* before transfering to a poll or take
988		*/
989	<	public void testTryTransfer6() {
990	<	final LinkedTransferQueue q = new LinkedTransferQueue();
991	<	q.offer(new Integer(four));
992	<	new Thread(new Runnable() {
993	<
994	<	public void run() {
995	<	try {
996	<	threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
997	<	threadAssertTrue(q.isEmpty());
998	<	} catch (InterruptedException ex) {
999	<	threadUnexpectedException();
1000	<	}
1001	<	}
1002	<	}).start();
1003	<	try {
1004	<	Thread.sleep(SHORT_DELAY_MS);
1005	<	assertEquals(2, q.size());
1006	<	assertEquals(new Integer(four), q.poll());
1007	<	assertEquals(new Integer(five), q.poll());
1182	<	assertTrue(q.isEmpty());
1183	<	} catch (Exception ex) {
1184	<	this.unexpectedException();
1185	<	}
989	>	public void testTryTransfer7() throws InterruptedException {
990	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
991	>	assertTrue(q.offer(four));
992	>
993	>	Thread t = newStartedThread(new CheckedRunnable() {
994	>	public void realRun() throws InterruptedException {
995	>	long startTime = System.nanoTime();
996	>	assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS));
997	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
998	>	checkEmpty(q);
999	>	}});
1000	>
1001	>	while (q.size() != 2)
1002	>	Thread.yield();
1003	>	mustEqual(2, q.size());
1004	>	assertSame(four, q.poll());
1005	>	assertSame(five, q.poll());
1006	>	checkEmpty(q);
1007	>	awaitTermination(t);
1008		}
1009
1010	<	/*
1011	<	* tryTransfer attempts to enqueue into the q and fails returning false not
1012	<	* enqueueing and the successing poll is null
1013	<	*/
1014	<	public void testTryTransfer7() {
1015	<	final LinkedTransferQueue q = new LinkedTransferQueue();
1016	<	q.offer(new Integer(four));
1017	<	new Thread(new Runnable() {
1018	<
1019	<	public void run() {
1020	<	try {
1021	<	threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1022	<	threadAssertTrue(q.isEmpty());
1023	<	} catch (InterruptedException ex) {
1024	<	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	<	}
1010	>	/**
1011	>	* tryTransfer attempts to enqueue into the queue and fails
1012	>	* returning false not enqueueing and the successive poll is null
1013	>	*/
1014	>	public void testTryTransfer8() throws InterruptedException {
1015	>	final LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
1016	>	assertTrue(q.offer(four));
1017	>	mustEqual(1, q.size());
1018	>	long startTime = System.nanoTime();
1019	>	assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS));
1020	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1021	>	mustEqual(1, q.size());
1022	>	assertSame(four, q.poll());
1023	>	assertNull(q.poll());
1024	>	checkEmpty(q);
1025		}
1026
1027	<	private LinkedTransferQueue populatedQueue(
1028	<	int n) {
1029	<	LinkedTransferQueue q = new LinkedTransferQueue();
1030	<	assertTrue(q.isEmpty());
1031	<	int remainingCapacity = q.remainingCapacity();
1032	<	for (int i = 0; i <
1033	<	n; i++) {
1223	<	assertTrue(q.offer(i));
1027	>	private LinkedTransferQueue<Item> populatedQueue(int n) {
1028	>	LinkedTransferQueue<Item> q = new LinkedTransferQueue<>();
1029	>	checkEmpty(q);
1030	>	for (int i = 0; i < n; i++) {
1031	>	mustEqual(i, q.size());
1032	>	mustOffer(q, i);
1033	>	mustEqual(Integer.MAX_VALUE, q.remainingCapacity());
1034		}
1225	–
1035		assertFalse(q.isEmpty());
1227	–	assertEquals(remainingCapacity, q.remainingCapacity());
1228	–	assertEquals(n, q.size());
1036		return q;
1037		}
1038
1039	<	private static class ConsumerObserver {
1040	<
1041	<	private int waitingConsumers;
1042	<
1043	<	private ConsumerObserver() {
1044	<	}
1045	<
1046	<	private void setWaitingConsumer(int i) {
1047	<	this.waitingConsumers = i;
1048	<	}
1049	<
1050	<	private int getWaitingConsumers() {
1244	<	return waitingConsumers;
1039	>	/**
1040	>	* remove(null), contains(null) always return false
1041	>	*/
1042	>	public void testNeverContainsNull() {
1043	>	Collection<?>[] qs = {
1044	>	new LinkedTransferQueue<>(),
1045	>	populatedQueue(2),
1046	>	};
1047	>
1048	>	for (Collection<?> q : qs) {
1049	>	assertFalse(q.contains(null));
1050	>	assertFalse(q.remove(null));
1051		}
1052		}
1053		}

Diff Legend

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