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

Diff Legend

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