ViewVC Help

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

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

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

Diff Legend

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