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.82 by jsr166, Sun Aug 11 22:29:27 2019 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	<	*/
285	<
286	<	public void testBlockingTake() {
287	<	Thread t = new Thread(new Runnable() {
217	>	shouldThrow();
218	>	} catch (InterruptedException success) {}
219	>	assertFalse(Thread.interrupted());
220
221	<	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	>	if (randomBoolean()) 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	>	Thread.currentThread().interrupt();
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();
303	<	t.join();
304	<	} catch (InterruptedException ie) {
305	<	unexpectedException();
306	<	}
290	>	q.poll(randomTimeout(), randomTimeUnit());
291	>	shouldThrow();
292	>	} catch (InterruptedException success) {}
293	>	assertFalse(Thread.interrupted());
294	>
295	>	pleaseInterrupt.countDown();
296	>	try {
297	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
298	>	shouldThrow();
299	>	} catch (InterruptedException success) {}
300	>	assertFalse(Thread.interrupted());
301	>
302	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
303	>	}});
304	>
305	>	await(pleaseInterrupt);
306	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
307	>	t.interrupt();
308	>	awaitTermination(t);
309	>	checkEmpty(q);
310		}
311
312		/**
313	<	*  timed poll before a delayed offer fails; after offer succeeds;
314	<	*  on interruption throws
315	<	*/
316	<	public void testTimedPollWithOffer() {
317	<	final LinkedTransferQueue q = new LinkedTransferQueue();
318	<	Thread t = new Thread(new Runnable() {
319	<
320	<	public void run() {
313	>	* timed poll after thread interrupted throws InterruptedException
314	>	* instead of returning timeout status
315	>	*/
316	>	public void testTimedPollAfterInterrupt() throws InterruptedException {
317	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
318	>	Thread t = newStartedThread(new CheckedRunnable() {
319	>	public void realRun() throws InterruptedException {
320	>	long startTime = System.nanoTime();
321	>	Thread.currentThread().interrupt();
322	>	for (int i = 0; i < SIZE; ++i)
323	>	assertEquals(i, (int) q.poll(randomTimeout(), randomTimeUnit()));
324		try {
325	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
326	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
327	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
328	<	threadShouldThrow();
329	<	} catch (InterruptedException success) {
330	<	}
331	<	}
332	<	});
333	<	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	<	}
325	>	q.poll(randomTimeout(), randomTimeUnit());
326	>	shouldThrow();
327	>	} catch (InterruptedException success) {}
328	>	assertFalse(Thread.interrupted());
329	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
330	>	}});
331	>
332	>	awaitTermination(t);
333	>	checkEmpty(q);
334		}
335
336		/**
337		* peek returns next element, or null if empty
338		*/
339	<	public void testPeek() {
340	<	LinkedTransferQueue q = populatedQueue(SIZE);
339	>	public void testPeek() throws InterruptedException {
340	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
341		for (int i = 0; i < SIZE; ++i) {
342	<	assertEquals(i, ((Integer) q.peek()).intValue());
343	<	q.poll();
342	>	assertEquals(i, (int) q.peek());
343	>	assertEquals(i, (int) q.poll());
344		assertTrue(q.peek() == null ||
345	<	i != ((Integer) q.peek()).intValue());
345	>	i != (int) q.peek());
346		}
347		assertNull(q.peek());
348	+	checkEmpty(q);
349		}
350
351		/**
352	<	* element returns next element, or throws NSEE if empty
352	>	* element returns next element, or throws NoSuchElementException if empty
353		*/
354	<	public void testElement() {
355	<	LinkedTransferQueue q = populatedQueue(SIZE);
354	>	public void testElement() throws InterruptedException {
355	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
356		for (int i = 0; i < SIZE; ++i) {
357	<	assertEquals(i, ((Integer) q.element()).intValue());
358	<	q.poll();
357	>	assertEquals(i, (int) q.element());
358	>	assertEquals(i, (int) q.poll());
359		}
360		try {
361		q.element();
362		shouldThrow();
363	<	} catch (NoSuchElementException success) {
364	<	}
363	>	} catch (NoSuchElementException success) {}
364	>	checkEmpty(q);
365		}
366
367		/**
368	<	* remove removes next element, or throws NSEE if empty
368	>	* remove removes next element, or throws NoSuchElementException if empty
369		*/
370	<	public void testRemove() {
371	<	LinkedTransferQueue q = populatedQueue(SIZE);
370	>	public void testRemove() throws InterruptedException {
371	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
372		for (int i = 0; i < SIZE; ++i) {
373	<	assertEquals(i, ((Integer) q.remove()).intValue());
373	>	assertEquals(i, (int) q.remove());
374		}
375		try {
376		q.remove();
377		shouldThrow();
378	<	} catch (NoSuchElementException success) {
379	<	}
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());
378	>	} catch (NoSuchElementException success) {}
379	>	checkEmpty(q);
380		}
381
382		/**
383		* An add following remove(x) succeeds
384		*/
385	<	public void testRemoveElementAndAdd() {
386	<	try {
387	<	LinkedTransferQueue q = new LinkedTransferQueue();
388	<	assertTrue(q.add(new Integer(1)));
389	<	assertTrue(q.add(new Integer(2)));
390	<	assertTrue(q.remove(new Integer(1)));
391	<	assertTrue(q.remove(new Integer(2)));
392	<	assertTrue(q.add(new Integer(3)));
480	<	assertTrue(q.take() != null);
481	<	} catch (Exception e) {
482	<	unexpectedException();
483	<	}
385	>	public void testRemoveElementAndAdd() throws InterruptedException {
386	>	LinkedTransferQueue q = new LinkedTransferQueue();
387	>	assertTrue(q.add(one));
388	>	assertTrue(q.add(two));
389	>	assertTrue(q.remove(one));
390	>	assertTrue(q.remove(two));
391	>	assertTrue(q.add(three));
392	>	assertSame(q.take(), three);
393		}
394
395		/**
396		* contains(x) reports true when elements added but not yet removed
397		*/
398		public void testContains() {
399	<	LinkedTransferQueue q = populatedQueue(SIZE);
399	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
400		for (int i = 0; i < SIZE; ++i) {
401	<	assertTrue(q.contains(new Integer(i)));
402	<	q.poll();
403	<	assertFalse(q.contains(new Integer(i)));
401	>	assertTrue(q.contains(i));
402	>	assertEquals(i, (int) q.poll());
403	>	assertFalse(q.contains(i));
404		}
405		}
406
407		/**
408		* clear removes all elements
409		*/
410	<	public void testClear() {
410	>	public void testClear() throws InterruptedException {
411		LinkedTransferQueue q = populatedQueue(SIZE);
503	–	int remainingCapacity = q.remainingCapacity();
412		q.clear();
413	<	assertTrue(q.isEmpty());
414	<	assertEquals(0, q.size());
507	<	assertEquals(remainingCapacity, q.remainingCapacity());
413	>	checkEmpty(q);
414	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
415		q.add(one);
416		assertFalse(q.isEmpty());
417	+	assertEquals(1, q.size());
418		assertTrue(q.contains(one));
419		q.clear();
420	<	assertTrue(q.isEmpty());
420	>	checkEmpty(q);
421		}
422
423		/**
424		* containsAll(c) is true when c contains a subset of elements
425		*/
426		public void testContainsAll() {
427	<	LinkedTransferQueue q = populatedQueue(SIZE);
428	<	LinkedTransferQueue p = new LinkedTransferQueue();
427	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
428	>	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>();
429		for (int i = 0; i < SIZE; ++i) {
430		assertTrue(q.containsAll(p));
431		assertFalse(p.containsAll(q));
432	<	p.add(new Integer(i));
432	>	p.add(i);
433		}
434		assertTrue(p.containsAll(q));
435		}
436
437		/**
438	<	* retainAll(c) retains only those elements of c and reports true if changed
438	>	* retainAll(c) retains only those elements of c and reports true
439	>	* if changed
440		*/
441		public void testRetainAll() {
442		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 546 | Line 455 | public class LinkedTransferQueueTest ext
455		}
456
457		/**
458	<	* removeAll(c) removes only those elements of c and reports true if changed
458	>	* removeAll(c) removes only those elements of c and reports true
459	>	* if changed
460		*/
461		public void testRemoveAll() {
462		for (int i = 1; i < SIZE; ++i) {
#	Line 555 | Line 465 | public class LinkedTransferQueueTest ext
465		assertTrue(q.removeAll(p));
466		assertEquals(SIZE - i, q.size());
467		for (int j = 0; j < i; ++j) {
468	<	Integer I = (Integer) (p.remove());
559	<	assertFalse(q.contains(I));
468	>	assertFalse(q.contains(p.remove()));
469		}
470		}
471		}
472
473		/**
474	<	* toArray contains all elements
474	>	* toArray() contains all elements in FIFO order
475		*/
476		public void testToArray() {
477		LinkedTransferQueue q = populatedQueue(SIZE);
478	<	Object[] o = q.toArray();
479	<	try {
480	<	for (int i = 0; i < o.length; i++) {
481	<	assertEquals(o[i], q.take());
482	<	}
574	<	} catch (InterruptedException e) {
575	<	unexpectedException();
576	<	}
478	>	Object[] a = q.toArray();
479	>	assertSame(Object[].class, a.getClass());
480	>	for (Object o : a)
481	>	assertSame(o, q.poll());
482	>	assertTrue(q.isEmpty());
483		}
484
485		/**
486	<	* toArray(a) contains all elements
486	>	* toArray(a) contains all elements in FIFO order
487		*/
488		public void testToArray2() {
489	<	LinkedTransferQueue q = populatedQueue(SIZE);
489	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
490		Integer[] ints = new Integer[SIZE];
491	<	ints = (Integer[]) q.toArray(ints);
492	<	try {
493	<	for (int i = 0; i < ints.length; i++) {
494	<	assertEquals(ints[i], q.take());
495	<	}
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) {
604	<	}
491	>	Integer[] array = q.toArray(ints);
492	>	assertSame(ints, array);
493	>	for (Integer o : ints)
494	>	assertSame(o, q.poll());
495	>	assertTrue(q.isEmpty());
496		}
497
498		/**
499	<	* toArray with incompatible array type throws CCE
499	>	* toArray(incompatible array type) throws ArrayStoreException
500		*/
501		public void testToArray1_BadArg() {
502	+	LinkedTransferQueue q = populatedQueue(SIZE);
503		try {
504	<	LinkedTransferQueue q = populatedQueue(SIZE);
613	<	Object o[] = q.toArray(new String[10]);
504	>	q.toArray(new String[10]);
505		shouldThrow();
506	<	} catch (ArrayStoreException success) {
616	<	}
506	>	} catch (ArrayStoreException success) {}
507		}
508
509		/**
510		* iterator iterates through all elements
511		*/
512	<	public void testIterator() {
512	>	public void testIterator() throws InterruptedException {
513		LinkedTransferQueue q = populatedQueue(SIZE);
514		Iterator it = q.iterator();
515	<	try {
516	<	while (it.hasNext()) {
517	<	assertEquals(it.next(), q.take());
518	<	}
519	<	} catch (InterruptedException e) {
520	<	unexpectedException();
521	<	}
515	>	int i;
516	>	for (i = 0; it.hasNext(); i++)
517	>	assertTrue(q.contains(it.next()));
518	>	assertEquals(i, SIZE);
519	>	assertIteratorExhausted(it);
520	>
521	>	it = q.iterator();
522	>	for (i = 0; it.hasNext(); i++)
523	>	assertEquals(it.next(), q.take());
524	>	assertEquals(i, SIZE);
525	>	assertIteratorExhausted(it);
526	>	}
527	>
528	>	/**
529	>	* iterator of empty collection has no elements
530	>	*/
531	>	public void testEmptyIterator() {
532	>	assertIteratorExhausted(new LinkedTransferQueue().iterator());
533		}
534
535		/**
536	<	* iterator.remove removes current element
536	>	* iterator.remove() removes current element
537		*/
538		public void testIteratorRemove() {
539		final LinkedTransferQueue q = new LinkedTransferQueue();
#	Line 645 | Line 546 | public class LinkedTransferQueueTest ext
546		it.remove();
547
548		it = q.iterator();
549	<	assertEquals(it.next(), one);
550	<	assertEquals(it.next(), three);
549	>	assertSame(it.next(), one);
550	>	assertSame(it.next(), three);
551		assertFalse(it.hasNext());
552		}
553
#	Line 654 | Line 555 | public class LinkedTransferQueueTest ext
555		* iterator ordering is FIFO
556		*/
557		public void testIteratorOrdering() {
558	<	final LinkedTransferQueue q = new LinkedTransferQueue();
559	<	int remainingCapacity = q.remainingCapacity();
558	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
559	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
560		q.add(one);
561		q.add(two);
562		q.add(three);
563	<	assertEquals(remainingCapacity, q.remainingCapacity());
563	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
564		int k = 0;
565	<	for (Iterator it = q.iterator(); it.hasNext();) {
566	<	int i = ((Integer) (it.next())).intValue();
666	<	assertEquals(++k, i);
565	>	for (Integer n : q) {
566	>	assertEquals(++k, (int) n);
567		}
568		assertEquals(3, k);
569		}
#	Line 676 | Line 576 | public class LinkedTransferQueueTest ext
576		q.add(one);
577		q.add(two);
578		q.add(three);
579	<	try {
580	<	for (Iterator it = q.iterator(); it.hasNext();) {
581	<	q.remove();
682	<	it.next();
683	<	}
684	<	} catch (ConcurrentModificationException e) {
685	<	unexpectedException();
579	>	for (Iterator it = q.iterator(); it.hasNext();) {
580	>	q.remove();
581	>	it.next();
582		}
583		assertEquals(0, q.size());
584		}
#	Line 694 | Line 590 | public class LinkedTransferQueueTest ext
590		LinkedTransferQueue q = populatedQueue(SIZE);
591		String s = q.toString();
592		for (int i = 0; i < SIZE; ++i) {
593	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
593	>	assertTrue(s.contains(String.valueOf(i)));
594		}
595		}
596
#	Line 703 | Line 599 | public class LinkedTransferQueueTest ext
599		*/
600		public void testOfferInExecutor() {
601		final LinkedTransferQueue q = new LinkedTransferQueue();
602	<	q.add(one);
603	<	q.add(two);
604	<	ExecutorService executor = Executors.newFixedThreadPool(2);
709	<	executor.execute(new Runnable() {
710	<
711	<	public void run() {
712	<	try {
713	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
714	<	} catch (Exception e) {
715	<	threadUnexpectedException();
716	<	}
717	<	}
718	<	});
602	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
603	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
604	>	try (PoolCleaner cleaner = cleaner(executor)) {
605
606	<	executor.execute(new Runnable() {
606	>	executor.execute(new CheckedRunnable() {
607	>	public void realRun() throws InterruptedException {
608	>	threadsStarted.await();
609	>	long startTime = System.nanoTime();
610	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
611	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
612	>	}});
613
614	<	public void run() {
615	<	try {
616	<	Thread.sleep(SMALL_DELAY_MS);
617	<	threadAssertEquals(one, q.take());
618	<	} catch (InterruptedException e) {
619	<	threadUnexpectedException();
620	<	}
729	<	}
730	<	});
731	<
732	<	joinPool(executor);
614	>	executor.execute(new CheckedRunnable() {
615	>	public void realRun() throws InterruptedException {
616	>	threadsStarted.await();
617	>	assertSame(one, q.take());
618	>	checkEmpty(q);
619	>	}});
620	>	}
621		}
622
623		/**
624	<	* poll retrieves elements across Executor threads
624	>	* timed poll retrieves elements across Executor threads
625		*/
626		public void testPollInExecutor() {
627		final LinkedTransferQueue q = new LinkedTransferQueue();
628	<	ExecutorService executor = Executors.newFixedThreadPool(2);
629	<	executor.execute(new Runnable() {
630	<
631	<	public void run() {
632	<	threadAssertNull(q.poll());
633	<	try {
634	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
635	<	threadAssertTrue(q.isEmpty());
636	<	} catch (InterruptedException e) {
637	<	threadUnexpectedException();
638	<	}
639	<	}
640	<	});
641	<
642	<	executor.execute(new Runnable() {
643	<
644	<	public void run() {
757	<	try {
758	<	Thread.sleep(SMALL_DELAY_MS);
628	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
629	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
630	>	try (PoolCleaner cleaner = cleaner(executor)) {
631	>
632	>	executor.execute(new CheckedRunnable() {
633	>	public void realRun() throws InterruptedException {
634	>	assertNull(q.poll());
635	>	threadsStarted.await();
636	>	long startTime = System.nanoTime();
637	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
638	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
639	>	checkEmpty(q);
640	>	}});
641	>
642	>	executor.execute(new CheckedRunnable() {
643	>	public void realRun() throws InterruptedException {
644	>	threadsStarted.await();
645		q.put(one);
646	<	} 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();
646	>	}});
647		}
648		}
649
650		/**
651	<	* drainTo(null) throws NPE
651	>	* A deserialized/reserialized queue has same elements in same order
652		*/
653	<	public void testDrainToNull() {
654	<	LinkedTransferQueue q = populatedQueue(SIZE);
655	<	try {
800	<	q.drainTo(null);
801	<	shouldThrow();
802	<	} catch (NullPointerException success) {
803	<	}
804	<	}
653	>	public void testSerialization() throws Exception {
654	>	Queue x = populatedQueue(SIZE);
655	>	Queue y = serialClone(x);
656
657	<	/**
658	<	* drainTo(this) throws IAE
659	<	*/
660	<	public void testDrainToSelf() {
661	<	LinkedTransferQueue q = populatedQueue(SIZE);
662	<	try {
663	<	q.drainTo(q);
813	<	shouldThrow();
814	<	} catch (IllegalArgumentException success) {
657	>	assertNotSame(y, x);
658	>	assertEquals(x.size(), y.size());
659	>	assertEquals(x.toString(), y.toString());
660	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
661	>	while (!x.isEmpty()) {
662	>	assertFalse(y.isEmpty());
663	>	assertEquals(x.remove(), y.remove());
664		}
665	+	assertTrue(y.isEmpty());
666		}
667
668		/**
#	Line 822 | Line 672 | public class LinkedTransferQueueTest ext
672		LinkedTransferQueue q = populatedQueue(SIZE);
673		ArrayList l = new ArrayList();
674		q.drainTo(l);
675	<	assertEquals(q.size(), 0);
676	<	assertEquals(l.size(), SIZE);
675	>	assertEquals(0, q.size());
676	>	assertEquals(SIZE, l.size());
677		for (int i = 0; i < SIZE; ++i) {
678	<	assertEquals(l.get(i), new Integer(i));
678	>	assertEquals(i, l.get(i));
679		}
680		q.add(zero);
681		q.add(one);
#	Line 834 | Line 684 | public class LinkedTransferQueueTest ext
684		assertTrue(q.contains(one));
685		l.clear();
686		q.drainTo(l);
687	<	assertEquals(q.size(), 0);
688	<	assertEquals(l.size(), 2);
687	>	assertEquals(0, q.size());
688	>	assertEquals(2, l.size());
689		for (int i = 0; i < 2; ++i) {
690	<	assertEquals(l.get(i), new Integer(i));
690	>	assertEquals(i, l.get(i));
691		}
692		}
693
694		/**
695	<	* drainTo empties full queue, unblocking a waiting put.
695	>	* drainTo(c) empties full queue, unblocking a waiting put.
696		*/
697	<	public void testDrainToWithActivePut() {
697	>	public void testDrainToWithActivePut() throws InterruptedException {
698		final LinkedTransferQueue q = populatedQueue(SIZE);
699	<	Thread t = new Thread(new Runnable() {
700	<
701	<	public void run() {
702	<	try {
703	<	q.put(new Integer(SIZE + 1));
704	<	} catch (Exception ie) {
705	<	threadUnexpectedException();
706	<	}
707	<	}
708	<	});
709	<	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	<	}
699	>	Thread t = newStartedThread(new CheckedRunnable() {
700	>	public void realRun() {
701	>	q.put(SIZE + 1);
702	>	}});
703	>	ArrayList l = new ArrayList();
704	>	q.drainTo(l);
705	>	assertTrue(l.size() >= SIZE);
706	>	for (int i = 0; i < SIZE; ++i)
707	>	assertEquals(i, l.get(i));
708	>	awaitTermination(t);
709	>	assertTrue(q.size() + l.size() >= SIZE);
710		}
711
712		/**
713	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
713	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
714		*/
715		public void testDrainToN() {
716		LinkedTransferQueue q = new LinkedTransferQueue();
717		for (int i = 0; i < SIZE + 2; ++i) {
718		for (int j = 0; j < SIZE; j++) {
719	<	assertTrue(q.offer(new Integer(j)));
719	>	assertTrue(q.offer(j));
720		}
721		ArrayList l = new ArrayList();
722		q.drainTo(l, i);
723		int k = (i < SIZE) ? i : SIZE;
724	<	assertEquals(l.size(), k);
725	<	assertEquals(q.size(), SIZE - k);
726	<	for (int j = 0; j < k; ++j) {
727	<	assertEquals(l.get(j), new Integer(j));
728	<	}
915	<	while (q.poll() != null);
724	>	assertEquals(k, l.size());
725	>	assertEquals(SIZE - k, q.size());
726	>	for (int j = 0; j < k; ++j)
727	>	assertEquals(j, l.get(j));
728	>	do {} while (q.poll() != null);
729		}
730		}
731
732	<	/*
733	<	* poll and take should decrement the waiting consumer count
732	>	/**
733	>	* timed poll() or take() increments the waiting consumer count;
734	>	* offer(e) decrements the waiting consumer count
735		*/
736	<	public void testWaitingConsumer() {
737	<	try {
738	<	final LinkedTransferQueue q = new LinkedTransferQueue();
739	<	final ConsumerObserver waiting = new ConsumerObserver();
740	<	new Thread(new Runnable() {
741	<
742	<	public void run() {
743	<	try {
744	<	threadAssertTrue(q.hasWaitingConsumer());
745	<	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
746	<	threadAssertTrue(q.offer(new Object()));
747	<	} catch (Exception ex) {
748	<	threadUnexpectedException();
749	<	}
750	<
751	<	}
752	<	}).start();
753	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
754	<	assertTrue(q.getWaitingConsumerCount() < waiting.getWaitingConsumers());
755	<	} catch (Exception ex) {
756	<	this.unexpectedException();
757	<	}
736	>	public void testWaitingConsumer() throws InterruptedException {
737	>	final LinkedTransferQueue q = new LinkedTransferQueue();
738	>	assertEquals(0, q.getWaitingConsumerCount());
739	>	assertFalse(q.hasWaitingConsumer());
740	>	final CountDownLatch threadStarted = new CountDownLatch(1);
741	>
742	>	Thread t = newStartedThread(new CheckedRunnable() {
743	>	public void realRun() throws InterruptedException {
744	>	threadStarted.countDown();
745	>	long startTime = System.nanoTime();
746	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
747	>	assertEquals(0, q.getWaitingConsumerCount());
748	>	assertFalse(q.hasWaitingConsumer());
749	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
750	>	}});
751	>
752	>	threadStarted.await();
753	>	Callable<Boolean> oneConsumer
754	>	= new Callable<Boolean>() { public Boolean call() {
755	>	return q.hasWaitingConsumer()
756	>	&& q.getWaitingConsumerCount() == 1; }};
757	>	waitForThreadToEnterWaitState(t, oneConsumer);
758	>
759	>	assertTrue(q.offer(one));
760	>	assertEquals(0, q.getWaitingConsumerCount());
761	>	assertFalse(q.hasWaitingConsumer());
762	>
763	>	awaitTermination(t);
764		}
945	–	/*
946	–	* Inserts null into transfer throws NPE
947	–	*/
765
766	<	public void testTransfer1() {
766	>	/**
767	>	* transfer(null) throws NullPointerException
768	>	*/
769	>	public void testTransfer1() throws InterruptedException {
770		try {
771		LinkedTransferQueue q = new LinkedTransferQueue();
772		q.transfer(null);
773		shouldThrow();
774	<	} catch (NullPointerException ex) {
955	<	} catch (Exception ex) {
956	<	this.unexpectedException();
957	<	}
774	>	} catch (NullPointerException success) {}
775		}
776
777	<	/*
778	<	* transfer attempts to insert into the queue then wait until that
779	<	* object is removed via take or poll.
777	>	/**
778	>	* transfer waits until a poll occurs. The transferred element
779	>	* is returned by the associated poll.
780		*/
781	<	public void testTransfer2() {
782	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
783	<	new Thread(new Runnable() {
781	>	public void testTransfer2() throws InterruptedException {
782	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
783	>	final CountDownLatch threadStarted = new CountDownLatch(1);
784
785	<	public void run() {
786	<	try {
787	<	q.transfer(new Integer(SIZE));
788	<	threadAssertTrue(q.isEmpty());
789	<	} catch (Exception ex) {
790	<	threadUnexpectedException();
974	<	}
975	<	}
976	<	}).start();
785	>	Thread t = newStartedThread(new CheckedRunnable() {
786	>	public void realRun() throws InterruptedException {
787	>	threadStarted.countDown();
788	>	q.transfer(five);
789	>	checkEmpty(q);
790	>	}});
791
792	<	try {
793	<	Thread.sleep(SHORT_DELAY_MS);
794	<	assertEquals(1, q.size());
795	<	q.poll();
796	<	assertTrue(q.isEmpty());
797	<	} catch (Exception ex) {
798	<	this.unexpectedException();
799	<	}
800	<	}
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	<	}
792	>	threadStarted.await();
793	>	Callable<Boolean> oneElement
794	>	= new Callable<Boolean>() { public Boolean call() {
795	>	return !q.isEmpty() && q.size() == 1; }};
796	>	waitForThreadToEnterWaitState(t, oneElement);
797	>
798	>	assertSame(five, q.poll());
799	>	checkEmpty(q);
800	>	awaitTermination(t);
801		}
802
803		/**
804	<	* 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
804	>	* transfer waits until a poll occurs, and then transfers in fifo order
805		*/
806	<	public void testTransfer4() {
806	>	public void testTransfer3() throws InterruptedException {
807	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
808	>
809	>	Thread first = newStartedThread(new CheckedRunnable() {
810	>	public void realRun() throws InterruptedException {
811	>	q.transfer(four);
812	>	assertFalse(q.contains(four));
813	>	assertEquals(1, q.size());
814	>	}});
815	>
816	>	Thread interruptedThread = newStartedThread(
817	>	new CheckedInterruptedRunnable() {
818	>	public void realRun() throws InterruptedException {
819	>	while (q.isEmpty())
820	>	Thread.yield();
821	>	q.transfer(five);
822	>	}});
823	>
824	>	while (q.size() < 2)
825	>	Thread.yield();
826	>	assertEquals(2, q.size());
827	>	assertSame(four, q.poll());
828	>	first.join();
829	>	assertEquals(1, q.size());
830	>	interruptedThread.interrupt();
831	>	interruptedThread.join();
832	>	checkEmpty(q);
833	>	}
834	>
835	>	/**
836	>	* transfer waits until a poll occurs, at which point the polling
837	>	* thread returns the element
838	>	*/
839	>	public void testTransfer4() throws InterruptedException {
840		final LinkedTransferQueue q = new LinkedTransferQueue();
1036	–	new Thread(new Runnable() {
841
842	<	public void run() {
843	<	try {
844	<	q.transfer(new Integer(four));
845	<	threadAssertFalse(q.contains(new Integer(four)));
846	<	threadAssertEquals(new Integer(three), q.poll());
847	<	} catch (Exception ex) {
848	<	threadUnexpectedException();
849	<	}
850	<	}
851	<	}).start();
852	<	try {
853	<	Thread.sleep(MEDIUM_DELAY_MS);
854	<	assertTrue(q.offer(three));
855	<	assertEquals(new Integer(four), q.poll());
1052	<	} catch (Exception ex) {
1053	<	this.unexpectedException();
1054	<	}
842	>	Thread t = newStartedThread(new CheckedRunnable() {
843	>	public void realRun() throws InterruptedException {
844	>	q.transfer(four);
845	>	assertFalse(q.contains(four));
846	>	assertSame(three, q.poll());
847	>	}});
848	>
849	>	while (q.isEmpty())
850	>	Thread.yield();
851	>	assertFalse(q.isEmpty());
852	>	assertEquals(1, q.size());
853	>	assertTrue(q.offer(three));
854	>	assertSame(four, q.poll());
855	>	awaitTermination(t);
856		}
857	<	/*
858	<	* Insert null into trTransfer throws NPE
857	>
858	>	/**
859	>	* transfer waits until a take occurs. The transferred element
860	>	* is returned by the associated take.
861		*/
862	+	public void testTransfer5() throws InterruptedException {
863	+	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
864	+
865	+	Thread t = newStartedThread(new CheckedRunnable() {
866	+	public void realRun() throws InterruptedException {
867	+	q.transfer(four);
868	+	checkEmpty(q);
869	+	}});
870	+
871	+	while (q.isEmpty())
872	+	Thread.yield();
873	+	assertFalse(q.isEmpty());
874	+	assertEquals(1, q.size());
875	+	assertSame(four, q.take());
876	+	checkEmpty(q);
877	+	awaitTermination(t);
878	+	}
879
880	+	/**
881	+	* tryTransfer(null) throws NullPointerException
882	+	*/
883		public void testTryTransfer1() {
884	+	final LinkedTransferQueue q = new LinkedTransferQueue();
885		try {
1062	–	final LinkedTransferQueue q = new LinkedTransferQueue();
886		q.tryTransfer(null);
887	<	this.shouldThrow();
888	<	} catch (NullPointerException ex) {
1066	<	} catch (Exception ex) {
1067	<	this.unexpectedException();
1068	<	}
887	>	shouldThrow();
888	>	} catch (NullPointerException success) {}
889		}
890	<	/*
891	<	* tryTransfer returns false and does not enqueue if there are no consumers
892	<	* waiting to poll or take.
890	>
891	>	/**
892	>	* tryTransfer returns false and does not enqueue if there are no
893	>	* consumers waiting to poll or take.
894		*/
895	+	public void testTryTransfer2() throws InterruptedException {
896	+	final LinkedTransferQueue q = new LinkedTransferQueue();
897	+	assertFalse(q.tryTransfer(new Object()));
898	+	assertFalse(q.hasWaitingConsumer());
899	+	checkEmpty(q);
900	+	}
901
902	<	public void testTryTransfer2() {
903	<	try {
904	<	final LinkedTransferQueue q = new LinkedTransferQueue();
905	<	assertFalse(q.tryTransfer(new Object()));
906	<	assertEquals(0, q.size());
907	<	} catch (Exception ex) {
908	<	this.unexpectedException();
909	<	}
902	>	/**
903	>	* If there is a consumer waiting in timed poll, tryTransfer
904	>	* returns true while successfully transfering object.
905	>	*/
906	>	public void testTryTransfer3() throws InterruptedException {
907	>	final Object hotPotato = new Object();
908	>	final LinkedTransferQueue q = new LinkedTransferQueue();
909	>
910	>	Thread t = newStartedThread(new CheckedRunnable() {
911	>	public void realRun() {
912	>	while (! q.hasWaitingConsumer())
913	>	Thread.yield();
914	>	assertTrue(q.hasWaitingConsumer());
915	>	checkEmpty(q);
916	>	assertTrue(q.tryTransfer(hotPotato));
917	>	}});
918	>
919	>	long startTime = System.nanoTime();
920	>	assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS));
921	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
922	>	checkEmpty(q);
923	>	awaitTermination(t);
924		}
925	<	/*
926	<	* if there is a consumer waiting poll or take tryTransfer returns
927	<	* true while enqueueing object
925	>
926	>	/**
927	>	* If there is a consumer waiting in take, tryTransfer returns
928	>	* true while successfully transfering object.
929		*/
930	+	public void testTryTransfer4() throws InterruptedException {
931	+	final Object hotPotato = new Object();
932	+	final LinkedTransferQueue q = new LinkedTransferQueue();
933
934	<	public void testTryTransfer3() {
935	<	try {
936	<	final LinkedTransferQueue q = new LinkedTransferQueue();
937	<	new Thread(new Runnable() {
934	>	Thread t = newStartedThread(new CheckedRunnable() {
935	>	public void realRun() {
936	>	while (! q.hasWaitingConsumer())
937	>	Thread.yield();
938	>	assertTrue(q.hasWaitingConsumer());
939	>	checkEmpty(q);
940	>	assertTrue(q.tryTransfer(hotPotato));
941	>	}});
942
943	<	public void run() {
944	<	try {
945	<	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	<	}
943	>	assertSame(q.take(), hotPotato);
944	>	checkEmpty(q);
945	>	awaitTermination(t);
946		}
947
948	<	/*
949	<	* tryTransfer waits the amount given if interrupted, show an
1113	<	* interrupted exception
948	>	/**
949	>	* tryTransfer blocks interruptibly if no takers
950		*/
951	<	public void testTryTransfer4() {
951	>	public void testTryTransfer5() throws InterruptedException {
952		final LinkedTransferQueue q = new LinkedTransferQueue();
953	<	Thread toInterrupt = new Thread(new Runnable() {
953	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
954	>	assertTrue(q.isEmpty());
955
956	<	public void run() {
956	>	Thread t = newStartedThread(new CheckedRunnable() {
957	>	public void realRun() throws InterruptedException {
958	>	long startTime = System.nanoTime();
959	>	Thread.currentThread().interrupt();
960		try {
961	<	q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
962	<	threadShouldThrow();
963	<	} catch (InterruptedException ex) {
964	<	}
965	<	}
966	<	});
967	<	try {
968	<	toInterrupt.start();
969	<	Thread.sleep(SMALL_DELAY_MS);
970	<	toInterrupt.interrupt();
971	<	} catch (Exception ex) {
972	<	this.unexpectedException();
973	<	}
961	>	q.tryTransfer(new Object(), randomTimeout(), randomTimeUnit());
962	>	shouldThrow();
963	>	} catch (InterruptedException success) {}
964	>	assertFalse(Thread.interrupted());
965	>
966	>	pleaseInterrupt.countDown();
967	>	try {
968	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
969	>	shouldThrow();
970	>	} catch (InterruptedException success) {}
971	>	assertFalse(Thread.interrupted());
972	>
973	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
974	>	}});
975	>
976	>	await(pleaseInterrupt);
977	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
978	>	t.interrupt();
979	>	awaitTermination(t);
980	>	checkEmpty(q);
981		}
982
983	<	/*
984	<	* tryTransfer gives up after the timeout and return false
983	>	/**
984	>	* tryTransfer gives up after the timeout and returns false
985		*/
986	<	public void testTryTransfer5() {
986	>	public void testTryTransfer6() throws InterruptedException {
987		final LinkedTransferQueue q = new LinkedTransferQueue();
1141	–	try {
1142	–	new Thread(new Runnable() {
988
989	<	public void run() {
990	<	try {
991	<	threadAssertFalse(q.tryTransfer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
992	<	} catch (InterruptedException ex) {
993	<	threadUnexpectedException();
994	<	}
995	<	}
996	<	}).start();
997	<	Thread.sleep(LONG_DELAY_MS);
998	<	assertTrue(q.isEmpty());
999	<	} catch (Exception ex) {
1155	<	this.unexpectedException();
1156	<	}
989	>	Thread t = newStartedThread(new CheckedRunnable() {
990	>	public void realRun() throws InterruptedException {
991	>	long startTime = System.nanoTime();
992	>	assertFalse(q.tryTransfer(new Object(),
993	>	timeoutMillis(), MILLISECONDS));
994	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
995	>	checkEmpty(q);
996	>	}});
997	>
998	>	awaitTermination(t);
999	>	checkEmpty(q);
1000		}
1001
1002	<	/*
1002	>	/**
1003		* tryTransfer waits for any elements previously in to be removed
1004		* before transfering to a poll or take
1005		*/
1006	<	public void testTryTransfer6() {
1006	>	public void testTryTransfer7() throws InterruptedException {
1007		final LinkedTransferQueue q = new LinkedTransferQueue();
1008	<	q.offer(new Integer(four));
1166	<	new Thread(new Runnable() {
1008	>	assertTrue(q.offer(four));
1009
1010	<	public void run() {
1011	<	try {
1012	<	threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
1013	<	threadAssertTrue(q.isEmpty());
1014	<	} catch (InterruptedException ex) {
1015	<	threadUnexpectedException();
1016	<	}
1017	<	}
1018	<	}).start();
1019	<	try {
1020	<	Thread.sleep(SHORT_DELAY_MS);
1021	<	assertEquals(2, q.size());
1022	<	assertEquals(new Integer(four), q.poll());
1023	<	assertEquals(new Integer(five), q.poll());
1024	<	assertTrue(q.isEmpty());
1183	<	} catch (Exception ex) {
1184	<	this.unexpectedException();
1185	<	}
1010	>	Thread t = newStartedThread(new CheckedRunnable() {
1011	>	public void realRun() throws InterruptedException {
1012	>	long startTime = System.nanoTime();
1013	>	assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS));
1014	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1015	>	checkEmpty(q);
1016	>	}});
1017	>
1018	>	while (q.size() != 2)
1019	>	Thread.yield();
1020	>	assertEquals(2, q.size());
1021	>	assertSame(four, q.poll());
1022	>	assertSame(five, q.poll());
1023	>	checkEmpty(q);
1024	>	awaitTermination(t);
1025		}
1026
1027	<	/*
1028	<	* tryTransfer attempts to enqueue into the q and fails returning false not
1029	<	* enqueueing and the successing poll is null
1027	>	/**
1028	>	* tryTransfer attempts to enqueue into the queue and fails
1029	>	* returning false not enqueueing and the successive poll is null
1030		*/
1031	<	public void testTryTransfer7() {
1031	>	public void testTryTransfer8() throws InterruptedException {
1032		final LinkedTransferQueue q = new LinkedTransferQueue();
1033	<	q.offer(new Integer(four));
1034	<	new Thread(new Runnable() {
1035	<
1036	<	public void run() {
1037	<	try {
1038	<	threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1039	<	threadAssertTrue(q.isEmpty());
1040	<	} catch (InterruptedException ex) {
1041	<	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	<	}
1033	>	assertTrue(q.offer(four));
1034	>	assertEquals(1, q.size());
1035	>	long startTime = System.nanoTime();
1036	>	assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS));
1037	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1038	>	assertEquals(1, q.size());
1039	>	assertSame(four, q.poll());
1040	>	assertNull(q.poll());
1041	>	checkEmpty(q);
1042		}
1043
1044	<	private LinkedTransferQueue populatedQueue(
1045	<	int n) {
1046	<	LinkedTransferQueue q = new LinkedTransferQueue();
1047	<	assertTrue(q.isEmpty());
1048	<	int remainingCapacity = q.remainingCapacity();
1221	<	for (int i = 0; i <
1222	<	n; i++) {
1044	>	private LinkedTransferQueue<Integer> populatedQueue(int n) {
1045	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
1046	>	checkEmpty(q);
1047	>	for (int i = 0; i < n; i++) {
1048	>	assertEquals(i, q.size());
1049		assertTrue(q.offer(i));
1050	+	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
1051		}
1225	–
1052		assertFalse(q.isEmpty());
1227	–	assertEquals(remainingCapacity, q.remainingCapacity());
1228	–	assertEquals(n, q.size());
1053		return q;
1054		}
1055
1056	<	private static class ConsumerObserver {
1057	<
1058	<	private int waitingConsumers;
1059	<
1060	<	private ConsumerObserver() {
1061	<	}
1062	<
1063	<	private void setWaitingConsumer(int i) {
1064	<	this.waitingConsumers = i;
1065	<	}
1066	<
1067	<	private int getWaitingConsumers() {
1244	<	return waitingConsumers;
1056	>	/**
1057	>	* remove(null), contains(null) always return false
1058	>	*/
1059	>	public void testNeverContainsNull() {
1060	>	Collection<?>[] qs = {
1061	>	new LinkedTransferQueue<Object>(),
1062	>	populatedQueue(2),
1063	>	};
1064	>
1065	>	for (Collection<?> q : qs) {
1066	>	assertFalse(q.contains(null));
1067	>	assertFalse(q.remove(null));
1068		}
1069		}
1070		}

Diff Legend

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