ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/LinkedTransferQueueTest.java

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.1 by dl, Fri Jul 31 23:02:49 2009 UTC vs.
Revision 1.70 by jsr166, Sat Feb 18 16:37:49 2017 UTC

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

Diff Legend

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