ViewVC Help

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

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

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.2 by jsr166, Fri Jul 31 23:37:31 2009 UTC vs.
Revision 1.53 by jsr166, Sun Nov 23 22:27:06 2014 UTC

#	Line 1 | Line 1
1	–
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		* Other contributors include John Vint
6		*/
7
8	<	import java.io.BufferedInputStream;
10	<	import java.io.BufferedOutputStream;
11	<	import java.io.ByteArrayInputStream;
12	<	import java.io.ByteArrayOutputStream;
13	<	import java.io.ObjectInputStream;
14	<	import java.io.ObjectOutputStream;
15	<	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
42	>	/**
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());
48		assertTrue(new LinkedTransferQueue().isEmpty());
49		}
50
51	<	/*
52	<	* Initizialing constructor with null collection throws NPE
51	>	/**
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) {
50	<	}
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];
59	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
69	>	new LinkedTransferQueue(elements);
70		shouldThrow();
71	<	} catch (NullPointerException success) {
62	<	}
71	>	} catch (NullPointerException success) {}
72		}
73	<	/*
73	>
74	>	/**
75		* Initializing constructor with a collection containing some null elements
76	<	* throws NPE
76	>	* throws NullPointerException
77		*/
68	–
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];
72	<	for (int i = 0; i < SIZE - 1; ++i) {
73	<	ints[i] = new Integer(i);
74	<	}
75	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
84	>	new LinkedTransferQueue(elements);
85		shouldThrow();
86	<	} catch (NullPointerException success) {
78	<	}
86	>	} catch (NullPointerException success) {}
87		}
88
89	<	/*
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);
103	<	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));
113	<	}
114	<	}
115	<
116	<	/**
117	<	* offer(null) throws NPE
118	<	*/
119	<	public void testOfferNull() {
120	<	try {
121	<	LinkedTransferQueue q = new LinkedTransferQueue();
122	<	q.offer(null);
123	<	shouldThrow();
124	<	} catch (NullPointerException success) {
126	>	q.add(i);
127		}
128		}
129
130		/**
131	<	* add(null) throws NPE
130	<	*/
131	<	public void testAddNull() {
132	<	try {
133	<	LinkedTransferQueue q = new LinkedTransferQueue();
134	<	q.add(null);
135	<	shouldThrow();
136	<	} catch (NullPointerException success) {
137	<	}
138	<	}
139	<
140	<	/**
141	<	* addAll(null) throws NPE
142	<	*/
143	<	public void testAddAll1() {
144	<	try {
145	<	LinkedTransferQueue q = new LinkedTransferQueue();
146	<	q.addAll(null);
147	<	shouldThrow();
148	<	} catch (NullPointerException success) {
149	<	}
150	<	}
151	<
152	<	/**
153	<	* 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) {
161	<	}
162	<	}
163	<
164	<	/**
165	<	* addAll of a collection with null elements throws NPE
166	<	*/
167	<	public void testAddAll2() {
168	<	try {
169	<	LinkedTransferQueue q = new LinkedTransferQueue();
170	<	Integer[] ints = new Integer[SIZE];
171	<	q.addAll(Arrays.asList(ints));
172	<	shouldThrow();
173	<	} catch (NullPointerException success) {
174	<	}
138	>	} catch (IllegalArgumentException success) {}
139		}
140
141		/**
142	<	* addAll of a collection with any null elements throws NPE after
143	<	* 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) {
191	<	}
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) {
202	<	ints[i] = new Integer(i);
203	<	}
204	<	LinkedTransferQueue q = new LinkedTransferQueue();
205	<	assertFalse(q.addAll(Arrays.asList(empty)));
206	<	assertTrue(q.addAll(Arrays.asList(ints)));
207	<	for (int i = 0; i < SIZE; ++i) {
208	<	assertEquals(ints[i], q.poll());
209	<	}
210	<	} finally {
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	<	*/
217	<	public void testPutNull() {
218	<	try {
219	<	LinkedTransferQueue q = new LinkedTransferQueue();
220	<	q.put(null);
221	<	shouldThrow();
222	<	} catch (NullPointerException success) {
223	<	} catch (Exception ie) {
224	<	unexpectedException();
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 229 | 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);
237	<	assertTrue(q.contains(I));
238	<	}
239	<	} catch (Exception ie) {
240	<	unexpectedException();
178	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
179	>	for (int i = 0; i < SIZE; ++i) {
180	>	assertEquals(i, q.size());
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) {
251	<	assertEquals(i, ((Integer) q.take()).intValue());
252	<	}
253	<	} catch (InterruptedException e) {
254	<	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	<	}
271	<	}
272	<	});
273	<	try {
274	<	t.start();
275	<	Thread.sleep(SHORT_DELAY_MS);
276	<	t.interrupt();
277	<	t.join();
278	<	} catch (Exception e) {
279	<	unexpectedException();
280	<	}
281	<	}
282	<	/*
283	<	* Take removes existing elements until empty, then blocks interruptibly
284	<	*/
285	<
286	<	public void testBlockingTake() {
287	<	Thread t = new Thread(new Runnable() {
211	>	shouldThrow();
212	>	} catch (InterruptedException success) {}
213	>	assertFalse(Thread.interrupted());
214
215	<	public void run() {
215	>	pleaseInterrupt.countDown();
216		try {
291	–	LinkedTransferQueue q = populatedQueue(SIZE);
292	–	for (int i = 0; i < SIZE; ++i) {
293	–	assertEquals(i, ((Integer) q.take()).intValue());
294	–	}
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();
305	<	t.join();
306	<	} catch (InterruptedException ie) {
307	<	unexpectedException();
308	<	}
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) {
329	<	assertEquals(i, ((Integer) q.poll(0, TimeUnit.MILLISECONDS)).intValue());
330	<	}
331	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
332	<	} catch (InterruptedException e) {
333	<	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	<	}
262	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
263	<	} catch (InterruptedException e) {
264	<	unexpectedException();
265	<	}
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) {
363	<	threadAssertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
364	<	}
365	<	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();
375	<	} catch (InterruptedException ie) {
376	<	unexpectedException();
377	<	}
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
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);
393	<	threadShouldThrow();
394	<	} catch (InterruptedException success) {
301	>	* timed poll after thread interrupted throws InterruptedException
302	>	* instead of returning timeout status
303	>	*/
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();
404	<	} catch (Exception e) {
405	<	unexpectedException();
406	<	}
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	<	}
452	<	}
453	<
454	<	/**
455	<	* remove(x) removes x and returns true if present
456	<	*/
457	<	public void testRemoveElement() {
458	<	LinkedTransferQueue q = populatedQueue(SIZE);
459	<	for (int i = 1; i < SIZE; i += 2) {
460	<	assertTrue(q.remove(new Integer(i)));
461	<	}
462	<	for (int i = 0; i < SIZE; i += 2) {
463	<	assertTrue(q.remove(new Integer(i)));
464	<	assertFalse(q.remove(new Integer(i + 1)));
465	<	}
466	<	assertTrue(q.isEmpty());
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)));
480	<	assertTrue(q.take() != null);
481	<	} catch (Exception e) {
482	<	unexpectedException();
483	<	}
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);
503	–	int remainingCapacity = q.remainingCapacity();
400		q.clear();
401	<	assertTrue(q.isEmpty());
402	<	assertEquals(0, q.size());
507	<	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 546 | 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 555 | 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());
559	<	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++) {
572	<	assertEquals(o[i], q.take());
573	<	}
574	<	} catch (InterruptedException e) {
575	<	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());
589	<	}
590	<	} catch (InterruptedException e) {
591	<	unexpectedException();
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(null) throws NPE
597	<	*/
598	<	public void testToArray_BadArg() {
599	<	try {
600	<	LinkedTransferQueue q = populatedQueue(SIZE);
601	<	Object o[] = q.toArray(null);
602	<	shouldThrow();
603	<	} catch (NullPointerException success) {
604	<	}
605	<	}
606	<
607	<	/**
608	<	* toArray with incompatible array type throws CCE
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);
613	<	Object o[] = q.toArray(new String[10]);
491	>	q.toArray(new String[10]);
492		shouldThrow();
493	<	} catch (ArrayStoreException success) {
616	<	}
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());
628	<	}
629	<	} catch (InterruptedException e) {
630	<	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 645 | 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 654 | 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();
666	<	assertEquals(++k, i);
540	>	for (Integer n : q) {
541	>	assertEquals(++k, (int) n);
542		}
543		assertEquals(3, k);
544		}
#	Line 676 | 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();
682	<	it.next();
683	<	}
684	<	} catch (ConcurrentModificationException e) {
685	<	unexpectedException();
554	>	for (Iterator it = q.iterator(); it.hasNext();) {
555	>	q.remove();
556	>	it.next();
557		}
558		assertEquals(0, q.size());
559		}
#	Line 694 | 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 703 | Line 574 | public class LinkedTransferQueueTest ext
574		*/
575		public void testOfferInExecutor() {
576		final LinkedTransferQueue q = new LinkedTransferQueue();
577	<	q.add(one);
707	<	q.add(two);
577	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
578		ExecutorService executor = Executors.newFixedThreadPool(2);
709	–	executor.execute(new Runnable() {
579
580	<	public void run() {
581	<	try {
582	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
583	<	} catch (Exception e) {
584	<	threadUnexpectedException();
585	<	}
586	<	}
587	<	});
588	<
589	<	executor.execute(new Runnable() {
590	<
591	<	public void run() {
723	<	try {
724	<	Thread.sleep(SMALL_DELAY_MS);
725	<	threadAssertEquals(one, q.take());
726	<	} catch (InterruptedException e) {
727	<	threadUnexpectedException();
728	<	}
729	<	}
730	<	});
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);
741	–	executor.execute(new Runnable() {
742	–
743	–	public void run() {
744	–	threadAssertNull(q.poll());
745	–	try {
746	–	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
747	–	threadAssertTrue(q.isEmpty());
748	–	} catch (InterruptedException e) {
749	–	threadUnexpectedException();
750	–	}
751	–	}
752	–	});
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 769 | 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));
783	<	LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
784	<
785	<	assertEquals(q.size(), r.size());
786	<	while (!q.isEmpty()) {
787	<	assertEquals(q.remove(), r.remove());
788	<	}
789	<	} catch (Exception e) {
790	<	unexpectedException();
791	<	}
792	<	}
793	<
794	<	/**
795	<	* drainTo(null) throws NPE
796	<	*/
797	<	public void testDrainToNull() {
798	<	LinkedTransferQueue q = populatedQueue(SIZE);
799	<	try {
800	<	q.drainTo(null);
801	<	shouldThrow();
802	<	} catch (NullPointerException success) {
803	<	}
804	<	}
805	<
806	<	/**
807	<	* drainTo(this) throws IAE
808	<	*/
809	<	public void testDrainToSelf() {
810	<	LinkedTransferQueue q = populatedQueue(SIZE);
811	<	try {
812	<	q.drainTo(q);
813	<	shouldThrow();
814	<	} catch (IllegalArgumentException success) {
624	>	public void testSerialization() throws Exception {
625	>	Queue x = populatedQueue(SIZE);
626	>	Queue y = serialClone(x);
627	>
628	>	assertNotSame(y, x);
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 822 | 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(i, l.get(i));
650		}
651		q.add(zero);
652		q.add(one);
#	Line 834 | 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(i, l.get(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	<	}
679	<	});
680	<	try {
860	<	t.start();
861	<	ArrayList l = new ArrayList();
862	<	q.drainTo(l);
863	<	assertTrue(l.size() >= SIZE);
864	<	for (int i = 0; i < SIZE; ++i) {
865	<	assertEquals(l.get(i), new Integer(i));
866	<	}
867	<	t.join();
868	<	assertTrue(q.size() + l.size() >= SIZE);
869	<	} catch (Exception e) {
870	<	unexpectedException();
871	<	}
872	<	}
873	<
874	<	/**
875	<	* drainTo(null, n) throws NPE
876	<	*/
877	<	public void testDrainToNullN() {
878	<	LinkedTransferQueue q = populatedQueue(SIZE);
879	<	try {
880	<	q.drainTo(null, 0);
881	<	shouldThrow();
882	<	} catch (NullPointerException success) {
883	<	}
884	<	}
885	<
886	<	/**
887	<	* drainTo(this, n) throws IAE
888	<	*/
889	<	public void testDrainToSelfN() {
890	<	LinkedTransferQueue q = populatedQueue(SIZE);
891	<	try {
892	<	q.drainTo(q, 0);
893	<	shouldThrow();
894	<	} catch (IllegalArgumentException success) {
895	<	}
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(i, l.get(i));
679	>	awaitTermination(t, MEDIUM_DELAY_MS);
680	>	assertTrue(q.size() + l.size() >= SIZE);
681		}
682
683		/**
684	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
684	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
685		*/
686		public void testDrainToN() {
687		LinkedTransferQueue q = new LinkedTransferQueue();
688		for (int i = 0; i < SIZE + 2; ++i) {
689		for (int j = 0; j < SIZE; j++) {
690	<	assertTrue(q.offer(new Integer(j)));
690	>	assertTrue(q.offer(j));
691		}
692		ArrayList l = new ArrayList();
693		q.drainTo(l, i);
694		int k = (i < SIZE) ? i : SIZE;
695	<	assertEquals(l.size(), k);
696	<	assertEquals(q.size(), SIZE - k);
697	<	for (int j = 0; j < k; ++j) {
698	<	assertEquals(l.get(j), new Integer(j));
699	<	}
700	<	while (q.poll() != null);
695	>	assertEquals(k, l.size());
696	>	assertEquals(SIZE - k, q.size());
697	>	for (int j = 0; j < k; ++j)
698	>	assertEquals(j, l.get(j));
699	>	while (q.poll() != null)
700	>	;
701		}
702		}
703
704	<	/*
705	<	* poll and take should decrement the waiting consumer count
704	>	/**
705	>	* timed poll() or take() increments the waiting consumer count;
706	>	* offer(e) decrements the waiting consumer count
707		*/
708	<	public void testWaitingConsumer() {
709	<	try {
710	<	final LinkedTransferQueue q = new LinkedTransferQueue();
711	<	final ConsumerObserver waiting = new ConsumerObserver();
712	<	new Thread(new Runnable() {
708	>	public void testWaitingConsumer() throws InterruptedException {
709	>	final LinkedTransferQueue q = new LinkedTransferQueue();
710	>	assertEquals(0, q.getWaitingConsumerCount());
711	>	assertFalse(q.hasWaitingConsumer());
712	>	final CountDownLatch threadStarted = new CountDownLatch(1);
713
714	<	public void run() {
715	<	try {
716	<	threadAssertTrue(q.hasWaitingConsumer());
717	<	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
718	<	threadAssertTrue(q.offer(new Object()));
719	<	} catch (Exception ex) {
720	<	threadUnexpectedException();
935	<	}
714	>	Thread t = newStartedThread(new CheckedRunnable() {
715	>	public void realRun() throws InterruptedException {
716	>	threadStarted.countDown();
717	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
718	>	assertEquals(0, q.getWaitingConsumerCount());
719	>	assertFalse(q.hasWaitingConsumer());
720	>	}});
721
722	<	}
723	<	}).start();
724	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
725	<	assertTrue(q.getWaitingConsumerCount() < waiting.getWaitingConsumers());
726	<	} catch (Exception ex) {
727	<	this.unexpectedException();
728	<	}
722	>	threadStarted.await();
723	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
724	>	assertEquals(1, q.getWaitingConsumerCount());
725	>	assertTrue(q.hasWaitingConsumer());
726	>
727	>	assertTrue(q.offer(one));
728	>	assertEquals(0, q.getWaitingConsumerCount());
729	>	assertFalse(q.hasWaitingConsumer());
730	>
731	>	awaitTermination(t, MEDIUM_DELAY_MS);
732		}
945	–	/*
946	–	* Inserts null into transfer throws NPE
947	–	*/
733
734	<	public void testTransfer1() {
734	>	/**
735	>	* transfer(null) throws NullPointerException
736	>	*/
737	>	public void testTransfer1() throws InterruptedException {
738		try {
739		LinkedTransferQueue q = new LinkedTransferQueue();
740		q.transfer(null);
741		shouldThrow();
742	<	} catch (NullPointerException ex) {
955	<	} catch (Exception ex) {
956	<	this.unexpectedException();
957	<	}
742	>	} catch (NullPointerException success) {}
743		}
744
745	<	/*
746	<	* transfer attempts to insert into the queue then wait until that
747	<	* object is removed via take or poll.
745	>	/**
746	>	* transfer waits until a poll occurs. The transfered element
747	>	* is returned by this associated poll.
748		*/
749	<	public void testTransfer2() {
750	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
751	<	new Thread(new Runnable() {
749	>	public void testTransfer2() throws InterruptedException {
750	>	final LinkedTransferQueue<Integer> q
751	>	= new LinkedTransferQueue<Integer>();
752	>	final CountDownLatch threadStarted = new CountDownLatch(1);
753
754	<	public void run() {
755	<	try {
756	<	q.transfer(new Integer(SIZE));
757	<	threadAssertTrue(q.isEmpty());
758	<	} catch (Exception ex) {
759	<	threadUnexpectedException();
974	<	}
975	<	}
976	<	}).start();
754	>	Thread t = newStartedThread(new CheckedRunnable() {
755	>	public void realRun() throws InterruptedException {
756	>	threadStarted.countDown();
757	>	q.transfer(five);
758	>	checkEmpty(q);
759	>	}});
760
761	<	try {
762	<	Thread.sleep(SHORT_DELAY_MS);
763	<	assertEquals(1, q.size());
764	<	q.poll();
765	<	assertTrue(q.isEmpty());
766	<	} catch (Exception ex) {
984	<	this.unexpectedException();
985	<	}
986	<	}
987	<	/*
988	<	* transfer will attempt to transfer in fifo order and continue waiting if
989	<	* the element being transfered is not polled or taken
990	<	*/
991	<
992	<	public void testTransfer3() {
993	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
994	<	new Thread(new Runnable() {
995	<	public void run() {
996	<	try {
997	<	Integer i;
998	<	q.transfer((i = new Integer(SIZE + 1)));
999	<	threadAssertTrue(!q.contains(i));
1000	<	threadAssertEquals(1, q.size());
1001	<	} catch (Exception ex) {
1002	<	threadUnexpectedException();
1003	<	}
1004	<	}
1005	<	}).start();
1006	<	Thread interruptedThread =
1007	<	new Thread(new Runnable() {
1008	<	public void run() {
1009	<	try {
1010	<	q.transfer(new Integer(SIZE));
1011	<	threadShouldThrow();
1012	<	} catch (InterruptedException ex) {
1013	<	}
1014	<	}
1015	<	});
1016	<	interruptedThread.start();
1017	<	try {
1018	<	Thread.sleep(LONG_DELAY_MS);
1019	<	assertEquals(2, q.size());
1020	<	q.poll();
1021	<	Thread.sleep(LONG_DELAY_MS);
1022	<	interruptedThread.interrupt();
1023	<	assertEquals(1, q.size());
1024	<	} catch (Exception ex) {
1025	<	this.unexpectedException();
1026	<	}
761	>	threadStarted.await();
762	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
763	>	assertEquals(1, q.size());
764	>	assertSame(five, q.poll());
765	>	checkEmpty(q);
766	>	awaitTermination(t, MEDIUM_DELAY_MS);
767		}
768
769		/**
770	<	* transfer will wait as long as a poll or take occurs if one does occur
1031	<	* the waiting is finished and the thread that tries to poll/take
1032	<	* wins in retrieving the element
770	>	* transfer waits until a poll occurs, and then transfers in fifo order
771		*/
772	<	public void testTransfer4() {
772	>	public void testTransfer3() throws InterruptedException {
773	>	final LinkedTransferQueue<Integer> q
774	>	= new LinkedTransferQueue<Integer>();
775	>
776	>	Thread first = newStartedThread(new CheckedRunnable() {
777	>	public void realRun() throws InterruptedException {
778	>	q.transfer(four);
779	>	assertTrue(!q.contains(four));
780	>	assertEquals(1, q.size());
781	>	}});
782	>
783	>	Thread interruptedThread = newStartedThread(
784	>	new CheckedInterruptedRunnable() {
785	>	public void realRun() throws InterruptedException {
786	>	while (q.isEmpty())
787	>	Thread.yield();
788	>	q.transfer(five);
789	>	}});
790	>
791	>	while (q.size() < 2)
792	>	Thread.yield();
793	>	assertEquals(2, q.size());
794	>	assertSame(four, q.poll());
795	>	first.join();
796	>	assertEquals(1, q.size());
797	>	interruptedThread.interrupt();
798	>	interruptedThread.join();
799	>	checkEmpty(q);
800	>	}
801	>
802	>	/**
803	>	* transfer waits until a poll occurs, at which point the polling
804	>	* thread returns the element
805	>	*/
806	>	public void testTransfer4() throws InterruptedException {
807		final LinkedTransferQueue q = new LinkedTransferQueue();
1036	–	new Thread(new Runnable() {
808
809	<	public void run() {
810	<	try {
811	<	q.transfer(new Integer(four));
812	<	threadAssertFalse(q.contains(new Integer(four)));
813	<	threadAssertEquals(new Integer(three), q.poll());
814	<	} catch (Exception ex) {
815	<	threadUnexpectedException();
816	<	}
817	<	}
818	<	}).start();
819	<	try {
820	<	Thread.sleep(MEDIUM_DELAY_MS);
821	<	assertTrue(q.offer(three));
822	<	assertEquals(new Integer(four), q.poll());
1052	<	} catch (Exception ex) {
1053	<	this.unexpectedException();
1054	<	}
809	>	Thread t = newStartedThread(new CheckedRunnable() {
810	>	public void realRun() throws InterruptedException {
811	>	q.transfer(four);
812	>	assertFalse(q.contains(four));
813	>	assertSame(three, q.poll());
814	>	}});
815	>
816	>	while (q.isEmpty())
817	>	Thread.yield();
818	>	assertFalse(q.isEmpty());
819	>	assertEquals(1, q.size());
820	>	assertTrue(q.offer(three));
821	>	assertSame(four, q.poll());
822	>	awaitTermination(t, MEDIUM_DELAY_MS);
823		}
824	<	/*
825	<	* Insert null into trTransfer throws NPE
824	>
825	>	/**
826	>	* transfer waits until a take occurs. The transfered element
827	>	* is returned by this associated take.
828		*/
829	+	public void testTransfer5() throws InterruptedException {
830	+	final LinkedTransferQueue<Integer> q
831	+	= new LinkedTransferQueue<Integer>();
832	+
833	+	Thread t = newStartedThread(new CheckedRunnable() {
834	+	public void realRun() throws InterruptedException {
835	+	q.transfer(four);
836	+	checkEmpty(q);
837	+	}});
838	+
839	+	while (q.isEmpty())
840	+	Thread.yield();
841	+	assertFalse(q.isEmpty());
842	+	assertEquals(1, q.size());
843	+	assertSame(four, q.take());
844	+	checkEmpty(q);
845	+	awaitTermination(t, MEDIUM_DELAY_MS);
846	+	}
847
848	+	/**
849	+	* tryTransfer(null) throws NullPointerException
850	+	*/
851		public void testTryTransfer1() {
852		try {
853		final LinkedTransferQueue q = new LinkedTransferQueue();
854		q.tryTransfer(null);
855	<	this.shouldThrow();
856	<	} catch (NullPointerException ex) {
1066	<	} catch (Exception ex) {
1067	<	this.unexpectedException();
1068	<	}
855	>	shouldThrow();
856	>	} catch (NullPointerException success) {}
857		}
1070	–	/*
1071	–	* tryTransfer returns false and does not enqueue if there are no consumers
1072	–	* waiting to poll or take.
1073	–	*/
858
859	<	public void testTryTransfer2() {
860	<	try {
861	<	final LinkedTransferQueue q = new LinkedTransferQueue();
862	<	assertFalse(q.tryTransfer(new Object()));
863	<	assertEquals(0, q.size());
864	<	} catch (Exception ex) {
865	<	this.unexpectedException();
866	<	}
859	>	/**
860	>	* tryTransfer returns false and does not enqueue if there are no
861	>	* consumers waiting to poll or take.
862	>	*/
863	>	public void testTryTransfer2() throws InterruptedException {
864	>	final LinkedTransferQueue q = new LinkedTransferQueue();
865	>	assertFalse(q.tryTransfer(new Object()));
866	>	assertFalse(q.hasWaitingConsumer());
867	>	checkEmpty(q);
868		}
869	<	/*
870	<	* if there is a consumer waiting poll or take tryTransfer returns
871	<	* true while enqueueing object
869	>
870	>	/**
871	>	* If there is a consumer waiting in timed poll, tryTransfer
872	>	* returns true while successfully transfering object.
873		*/
874	+	public void testTryTransfer3() throws InterruptedException {
875	+	final Object hotPotato = new Object();
876	+	final LinkedTransferQueue q = new LinkedTransferQueue();
877
878	<	public void testTryTransfer3() {
879	<	try {
880	<	final LinkedTransferQueue q = new LinkedTransferQueue();
881	<	new Thread(new Runnable() {
878	>	Thread t = newStartedThread(new CheckedRunnable() {
879	>	public void realRun() {
880	>	while (! q.hasWaitingConsumer())
881	>	Thread.yield();
882	>	assertTrue(q.hasWaitingConsumer());
883	>	checkEmpty(q);
884	>	assertTrue(q.tryTransfer(hotPotato));
885	>	}});
886	>
887	>	assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
888	>	checkEmpty(q);
889	>	awaitTermination(t, MEDIUM_DELAY_MS);
890	>	}
891
892	<	public void run() {
893	<	try {
894	<	threadAssertTrue(q.hasWaitingConsumer());
895	<	threadAssertTrue(q.tryTransfer(new Object()));
896	<	} catch (Exception ex) {
897	<	threadUnexpectedException();
898	<	}
892	>	/**
893	>	* If there is a consumer waiting in take, tryTransfer returns
894	>	* true while successfully transfering object.
895	>	*/
896	>	public void testTryTransfer4() throws InterruptedException {
897	>	final Object hotPotato = new Object();
898	>	final LinkedTransferQueue q = new LinkedTransferQueue();
899
900	<	}
901	<	}).start();
902	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
903	<	assertTrue(q.isEmpty());
904	<	} catch (Exception ex) {
905	<	this.unexpectedException();
906	<	}
900	>	Thread t = newStartedThread(new CheckedRunnable() {
901	>	public void realRun() {
902	>	while (! q.hasWaitingConsumer())
903	>	Thread.yield();
904	>	assertTrue(q.hasWaitingConsumer());
905	>	checkEmpty(q);
906	>	assertTrue(q.tryTransfer(hotPotato));
907	>	}});
908	>
909	>	assertSame(q.take(), hotPotato);
910	>	checkEmpty(q);
911	>	awaitTermination(t, MEDIUM_DELAY_MS);
912		}
913
914	<	/*
915	<	* tryTransfer waits the amount given if interrupted, show an
1113	<	* interrupted exception
914	>	/**
915	>	* tryTransfer blocks interruptibly if no takers
916		*/
917	<	public void testTryTransfer4() {
917	>	public void testTryTransfer5() throws InterruptedException {
918		final LinkedTransferQueue q = new LinkedTransferQueue();
919	<	Thread toInterrupt = new Thread(new Runnable() {
919	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
920	>	assertTrue(q.isEmpty());
921
922	<	public void run() {
922	>	Thread t = newStartedThread(new CheckedRunnable() {
923	>	public void realRun() throws InterruptedException {
924	>	Thread.currentThread().interrupt();
925		try {
926	<	q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
927	<	threadShouldThrow();
928	<	} catch (InterruptedException ex) {
929	<	}
930	<	}
931	<	});
932	<	try {
933	<	toInterrupt.start();
934	<	Thread.sleep(SMALL_DELAY_MS);
935	<	toInterrupt.interrupt();
936	<	} catch (Exception ex) {
937	<	this.unexpectedException();
938	<	}
926	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
927	>	shouldThrow();
928	>	} catch (InterruptedException success) {}
929	>	assertFalse(Thread.interrupted());
930	>
931	>	pleaseInterrupt.countDown();
932	>	try {
933	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
934	>	shouldThrow();
935	>	} catch (InterruptedException success) {}
936	>	assertFalse(Thread.interrupted());
937	>	}});
938	>
939	>	await(pleaseInterrupt);
940	>	assertThreadStaysAlive(t);
941	>	t.interrupt();
942	>	awaitTermination(t);
943	>	checkEmpty(q);
944		}
945
946	<	/*
947	<	* tryTransfer gives up after the timeout and return false
946	>	/**
947	>	* tryTransfer gives up after the timeout and returns false
948		*/
949	<	public void testTryTransfer5() {
949	>	public void testTryTransfer6() throws InterruptedException {
950		final LinkedTransferQueue q = new LinkedTransferQueue();
1141	–	try {
1142	–	new Thread(new Runnable() {
951
952	<	public void run() {
953	<	try {
954	<	threadAssertFalse(q.tryTransfer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
955	<	} catch (InterruptedException ex) {
956	<	threadUnexpectedException();
957	<	}
958	<	}
959	<	}).start();
960	<	Thread.sleep(LONG_DELAY_MS);
961	<	assertTrue(q.isEmpty());
962	<	} catch (Exception ex) {
1155	<	this.unexpectedException();
1156	<	}
952	>	Thread t = newStartedThread(new CheckedRunnable() {
953	>	public void realRun() throws InterruptedException {
954	>	long t0 = System.nanoTime();
955	>	assertFalse(q.tryTransfer(new Object(),
956	>	timeoutMillis(), MILLISECONDS));
957	>	assertTrue(millisElapsedSince(t0) >= timeoutMillis());
958	>	checkEmpty(q);
959	>	}});
960	>
961	>	awaitTermination(t);
962	>	checkEmpty(q);
963		}
964
965	<	/*
965	>	/**
966		* tryTransfer waits for any elements previously in to be removed
967		* before transfering to a poll or take
968		*/
969	<	public void testTryTransfer6() {
969	>	public void testTryTransfer7() throws InterruptedException {
970		final LinkedTransferQueue q = new LinkedTransferQueue();
971	<	q.offer(new Integer(four));
1166	<	new Thread(new Runnable() {
971	>	assertTrue(q.offer(four));
972
973	<	public void run() {
974	<	try {
975	<	threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
976	<	threadAssertTrue(q.isEmpty());
977	<	} catch (InterruptedException ex) {
978	<	threadUnexpectedException();
979	<	}
980	<	}
981	<	}).start();
982	<	try {
983	<	Thread.sleep(SHORT_DELAY_MS);
984	<	assertEquals(2, q.size());
985	<	assertEquals(new Integer(four), q.poll());
1181	<	assertEquals(new Integer(five), q.poll());
1182	<	assertTrue(q.isEmpty());
1183	<	} catch (Exception ex) {
1184	<	this.unexpectedException();
1185	<	}
973	>	Thread t = newStartedThread(new CheckedRunnable() {
974	>	public void realRun() throws InterruptedException {
975	>	assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS));
976	>	checkEmpty(q);
977	>	}});
978	>
979	>	while (q.size() != 2)
980	>	Thread.yield();
981	>	assertEquals(2, q.size());
982	>	assertSame(four, q.poll());
983	>	assertSame(five, q.poll());
984	>	checkEmpty(q);
985	>	awaitTermination(t, MEDIUM_DELAY_MS);
986		}
987
988	<	/*
989	<	* tryTransfer attempts to enqueue into the q and fails returning false not
990	<	* enqueueing and the successing poll is null
988	>	/**
989	>	* tryTransfer attempts to enqueue into the queue and fails
990	>	* returning false not enqueueing and the successive poll is null
991		*/
992	<	public void testTryTransfer7() {
992	>	public void testTryTransfer8() throws InterruptedException {
993		final LinkedTransferQueue q = new LinkedTransferQueue();
994	<	q.offer(new Integer(four));
995	<	new Thread(new Runnable() {
996	<
997	<	public void run() {
998	<	try {
999	<	threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1000	<	threadAssertTrue(q.isEmpty());
1001	<	} catch (InterruptedException ex) {
1002	<	threadUnexpectedException();
1203	<	}
1204	<	}
1205	<	}).start();
1206	<	try {
1207	<	assertEquals(1, q.size());
1208	<	assertEquals(new Integer(four), q.poll());
1209	<	Thread.sleep(MEDIUM_DELAY_MS);
1210	<	assertNull(q.poll());
1211	<	} catch (Exception ex) {
1212	<	this.unexpectedException();
1213	<	}
994	>	assertTrue(q.offer(four));
995	>	assertEquals(1, q.size());
996	>	long t0 = System.nanoTime();
997	>	assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS));
998	>	assertTrue(millisElapsedSince(t0) >= timeoutMillis());
999	>	assertEquals(1, q.size());
1000	>	assertSame(four, q.poll());
1001	>	assertNull(q.poll());
1002	>	checkEmpty(q);
1003		}
1004
1005	<	private LinkedTransferQueue populatedQueue(
1006	<	int n) {
1007	<	LinkedTransferQueue q = new LinkedTransferQueue();
1008	<	assertTrue(q.isEmpty());
1009	<	int remainingCapacity = q.remainingCapacity();
1221	<	for (int i = 0; i <
1222	<	n; i++) {
1005	>	private LinkedTransferQueue<Integer> populatedQueue(int n) {
1006	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
1007	>	checkEmpty(q);
1008	>	for (int i = 0; i < n; i++) {
1009	>	assertEquals(i, q.size());
1010		assertTrue(q.offer(i));
1011	+	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
1012		}
1225	–
1013		assertFalse(q.isEmpty());
1227	–	assertEquals(remainingCapacity, q.remainingCapacity());
1228	–	assertEquals(n, q.size());
1014		return q;
1015		}
1016
1017	<	private static class ConsumerObserver {
1018	<
1019	<	private int waitingConsumers;
1020	<
1021	<	private ConsumerObserver() {
1022	<	}
1023	<
1024	<	private void setWaitingConsumer(int i) {
1025	<	this.waitingConsumers = i;
1026	<	}
1027	<
1028	<	private int getWaitingConsumers() {
1244	<	return waitingConsumers;
1017	>	/**
1018	>	* remove(null), contains(null) always return false
1019	>	*/
1020	>	public void testNeverContainsNull() {
1021	>	Collection<?>[] qs = {
1022	>	new LinkedTransferQueue<Object>(),
1023	>	populatedQueue(2),
1024	>	};
1025	>
1026	>	for (Collection<?> q : qs) {
1027	>	assertFalse(q.contains(null));
1028	>	assertFalse(q.remove(null));
1029		}
1030		}
1031		}

Diff Legend

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