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

Diff Legend

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