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

Diff Legend

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