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.4 by jsr166, Sat Aug 1 22:09:13 2009 UTC vs.
Revision 1.76 by jsr166, Sun May 14 00:48:20 2017 UTC

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

Diff Legend

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