ViewVC Help

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

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

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.1 by dl, Fri Jul 31 23:02:49 2009 UTC vs.
Revision 1.48 by jsr166, Tue May 31 16:16:24 2011 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));
126	>	q.add(i);
127		}
128		}
129
130		/**
131	<	* offer(null) throws NPE
118	<	*/
119	<	public void testOfferNull() {
120	<	try {
121	<	LinkedTransferQueue q = new LinkedTransferQueue();
122	<	q.offer(null);
123	<	shouldThrow();
124	<	} catch (NullPointerException success) {
125	<	}
126	<	}
127	<
128	<	/**
129	<	* add(null) throws NPE
130	<	*/
131	<	public void testAddNull() {
132	<	try {
133	<	LinkedTransferQueue q = new LinkedTransferQueue();
134	<	q.add(null);
135	<	shouldThrow();
136	<	} catch (NullPointerException success) {
137	<	}
138	<	}
139	<
140	<	/**
141	<	* addAll(null) throws NPE
142	<	*/
143	<	public void testAddAll1() {
144	<	try {
145	<	LinkedTransferQueue q = new LinkedTransferQueue();
146	<	q.addAll(null);
147	<	shouldThrow();
148	<	} catch (NullPointerException success) {
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(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) {
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	<	}
366	>	} catch (NoSuchElementException success) {}
367	>	checkEmpty(q);
368		}
369
370		/**
371		* remove(x) removes x and returns true if present
372		*/
373	<	public void testRemoveElement() {
373	>	public void testRemoveElement() throws InterruptedException {
374		LinkedTransferQueue q = populatedQueue(SIZE);
375	<	for (int i = 1; i < SIZE; i += 2) {
376	<	assertTrue(q.remove(new Integer(i)));
377	<	}
378	<	for (int i = 0; i < SIZE; i += 2) {
379	<	assertTrue(q.remove(new Integer(i)));
380	<	assertFalse(q.remove(new Integer(i + 1)));
375	>	for (int i = 1; i < SIZE; i+=2) {
376	>	assertTrue(q.contains(i));
377	>	assertTrue(q.remove(i));
378	>	assertFalse(q.contains(i));
379	>	assertTrue(q.contains(i-1));
380	>	}
381	>	for (int i = 0; i < SIZE; i+=2) {
382	>	assertTrue(q.contains(i));
383	>	assertTrue(q.remove(i));
384	>	assertFalse(q.contains(i));
385	>	assertFalse(q.remove(i+1));
386	>	assertFalse(q.contains(i+1));
387		}
388	<	assertTrue(q.isEmpty());
388	>	checkEmpty(q);
389		}
390
391		/**
392		* An add following remove(x) succeeds
393		*/
394	<	public void testRemoveElementAndAdd() {
395	<	try {
396	<	LinkedTransferQueue q = new LinkedTransferQueue();
397	<	assertTrue(q.add(new Integer(1)));
398	<	assertTrue(q.add(new Integer(2)));
399	<	assertTrue(q.remove(new Integer(1)));
400	<	assertTrue(q.remove(new Integer(2)));
401	<	assertTrue(q.add(new Integer(3)));
480	<	assertTrue(q.take() != null);
481	<	} catch (Exception e) {
482	<	unexpectedException();
483	<	}
394	>	public void testRemoveElementAndAdd() throws InterruptedException {
395	>	LinkedTransferQueue q = new LinkedTransferQueue();
396	>	assertTrue(q.add(one));
397	>	assertTrue(q.add(two));
398	>	assertTrue(q.remove(one));
399	>	assertTrue(q.remove(two));
400	>	assertTrue(q.add(three));
401	>	assertSame(q.take(), three);
402		}
403
404		/**
405		* contains(x) reports true when elements added but not yet removed
406		*/
407		public void testContains() {
408	<	LinkedTransferQueue q = populatedQueue(SIZE);
408	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
409		for (int i = 0; i < SIZE; ++i) {
410	<	assertTrue(q.contains(new Integer(i)));
411	<	q.poll();
412	<	assertFalse(q.contains(new Integer(i)));
410	>	assertTrue(q.contains(i));
411	>	assertEquals(i, (int) q.poll());
412	>	assertFalse(q.contains(i));
413		}
414		}
415
416		/**
417		* clear removes all elements
418		*/
419	<	public void testClear() {
419	>	public void testClear() throws InterruptedException {
420		LinkedTransferQueue q = populatedQueue(SIZE);
503	–	int remainingCapacity = q.remainingCapacity();
421		q.clear();
422	<	assertTrue(q.isEmpty());
423	<	assertEquals(0, q.size());
507	<	assertEquals(remainingCapacity, q.remainingCapacity());
422	>	checkEmpty(q);
423	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
424		q.add(one);
425		assertFalse(q.isEmpty());
426	+	assertEquals(1, q.size());
427		assertTrue(q.contains(one));
428		q.clear();
429	<	assertTrue(q.isEmpty());
429	>	checkEmpty(q);
430		}
431
432		/**
433		* containsAll(c) is true when c contains a subset of elements
434		*/
435		public void testContainsAll() {
436	<	LinkedTransferQueue q = populatedQueue(SIZE);
437	<	LinkedTransferQueue p = new LinkedTransferQueue();
436	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
437	>	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>();
438		for (int i = 0; i < SIZE; ++i) {
439		assertTrue(q.containsAll(p));
440		assertFalse(p.containsAll(q));
441	<	p.add(new Integer(i));
441	>	p.add(i);
442		}
443		assertTrue(p.containsAll(q));
444		}
445
446		/**
447	<	* retainAll(c) retains only those elements of c and reports true if changed
447	>	* retainAll(c) retains only those elements of c and reports true
448	>	* if changed
449		*/
450		public void testRetainAll() {
451		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 546 | Line 464 | public class LinkedTransferQueueTest ext
464		}
465
466		/**
467	<	* removeAll(c) removes only those elements of c and reports true if changed
467	>	* removeAll(c) removes only those elements of c and reports true
468	>	* if changed
469		*/
470		public void testRemoveAll() {
471		for (int i = 1; i < SIZE; ++i) {
#	Line 555 | Line 474 | public class LinkedTransferQueueTest ext
474		assertTrue(q.removeAll(p));
475		assertEquals(SIZE - i, q.size());
476		for (int j = 0; j < i; ++j) {
477	<	Integer I = (Integer) (p.remove());
559	<	assertFalse(q.contains(I));
477	>	assertFalse(q.contains(p.remove()));
478		}
479		}
480		}
481
482		/**
483	<	* toArray contains all elements
483	>	* toArray() contains all elements in FIFO order
484		*/
485		public void testToArray() {
486		LinkedTransferQueue q = populatedQueue(SIZE);
487		Object[] o = q.toArray();
488	<	try {
489	<	for (int i = 0; i < o.length; i++) {
572	<	assertEquals(o[i], q.take());
573	<	}
574	<	} catch (InterruptedException e) {
575	<	unexpectedException();
488	>	for (int i = 0; i < o.length; i++) {
489	>	assertSame(o[i], q.poll());
490		}
491		}
492
493		/**
494	<	* toArray(a) contains all elements
494	>	* toArray(a) contains all elements in FIFO order
495		*/
496		public void testToArray2() {
497	<	LinkedTransferQueue q = populatedQueue(SIZE);
497	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
498		Integer[] ints = new Integer[SIZE];
499	<	ints = (Integer[]) q.toArray(ints);
500	<	try {
501	<	for (int i = 0; i < ints.length; i++) {
502	<	assertEquals(ints[i], q.take());
589	<	}
590	<	} catch (InterruptedException e) {
591	<	unexpectedException();
499	>	Integer[] array = q.toArray(ints);
500	>	assertSame(ints, array);
501	>	for (int i = 0; i < ints.length; i++) {
502	>	assertSame(ints[i], q.poll());
503		}
504		}
505
506		/**
507	<	* 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
507	>	* toArray(incompatible array type) throws ArrayStoreException
508		*/
509		public void testToArray1_BadArg() {
510	+	LinkedTransferQueue q = populatedQueue(SIZE);
511		try {
512	<	LinkedTransferQueue q = populatedQueue(SIZE);
613	<	Object o[] = q.toArray(new String[10]);
512	>	q.toArray(new String[10]);
513		shouldThrow();
514	<	} catch (ArrayStoreException success) {
616	<	}
514	>	} catch (ArrayStoreException success) {}
515		}
516
517		/**
518		* iterator iterates through all elements
519		*/
520	<	public void testIterator() {
520	>	public void testIterator() throws InterruptedException {
521		LinkedTransferQueue q = populatedQueue(SIZE);
522		Iterator it = q.iterator();
523	<	try {
524	<	while (it.hasNext()) {
525	<	assertEquals(it.next(), q.take());
628	<	}
629	<	} catch (InterruptedException e) {
630	<	unexpectedException();
523	>	int i = 0;
524	>	while (it.hasNext()) {
525	>	assertEquals(it.next(), i++);
526		}
527	+	assertEquals(i, SIZE);
528		}
529
530		/**
531	<	* iterator.remove removes current element
531	>	* iterator.remove() removes current element
532		*/
533		public void testIteratorRemove() {
534		final LinkedTransferQueue q = new LinkedTransferQueue();
#	Line 645 | Line 541 | public class LinkedTransferQueueTest ext
541		it.remove();
542
543		it = q.iterator();
544	<	assertEquals(it.next(), one);
545	<	assertEquals(it.next(), three);
544	>	assertSame(it.next(), one);
545	>	assertSame(it.next(), three);
546		assertFalse(it.hasNext());
547		}
548
#	Line 654 | Line 550 | public class LinkedTransferQueueTest ext
550		* iterator ordering is FIFO
551		*/
552		public void testIteratorOrdering() {
553	<	final LinkedTransferQueue q = new LinkedTransferQueue();
554	<	int remainingCapacity = q.remainingCapacity();
553	>	final LinkedTransferQueue<Integer> q
554	>	= new LinkedTransferQueue<Integer>();
555	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
556		q.add(one);
557		q.add(two);
558		q.add(three);
559	<	assertEquals(remainingCapacity, q.remainingCapacity());
559	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
560		int k = 0;
561	<	for (Iterator it = q.iterator(); it.hasNext();) {
562	<	int i = ((Integer) (it.next())).intValue();
666	<	assertEquals(++k, i);
561	>	for (Integer n : q) {
562	>	assertEquals(++k, (int) n);
563		}
564		assertEquals(3, k);
565		}
#	Line 676 | Line 572 | public class LinkedTransferQueueTest ext
572		q.add(one);
573		q.add(two);
574		q.add(three);
575	<	try {
576	<	for (Iterator it = q.iterator(); it.hasNext();) {
577	<	q.remove();
682	<	it.next();
683	<	}
684	<	} catch (ConcurrentModificationException e) {
685	<	unexpectedException();
575	>	for (Iterator it = q.iterator(); it.hasNext();) {
576	>	q.remove();
577	>	it.next();
578		}
579		assertEquals(0, q.size());
580		}
#	Line 694 | Line 586 | public class LinkedTransferQueueTest ext
586		LinkedTransferQueue q = populatedQueue(SIZE);
587		String s = q.toString();
588		for (int i = 0; i < SIZE; ++i) {
589	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
589	>	assertTrue(s.contains(String.valueOf(i)));
590		}
591		}
592
#	Line 703 | Line 595 | public class LinkedTransferQueueTest ext
595		*/
596		public void testOfferInExecutor() {
597		final LinkedTransferQueue q = new LinkedTransferQueue();
598	<	q.add(one);
707	<	q.add(two);
598	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
599		ExecutorService executor = Executors.newFixedThreadPool(2);
709	–	executor.execute(new Runnable() {
710	–
711	–	public void run() {
712	–	try {
713	–	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
714	–	} catch (Exception e) {
715	–	threadUnexpectedException();
716	–	}
717	–	}
718	–	});
600
601	<	executor.execute(new Runnable() {
602	<
603	<	public void run() {
604	<	try {
605	<	Thread.sleep(SMALL_DELAY_MS);
606	<	threadAssertEquals(one, q.take());
607	<	} catch (InterruptedException e) {
608	<	threadUnexpectedException();
609	<	}
610	<	}
611	<	});
601	>	executor.execute(new CheckedRunnable() {
602	>	public void realRun() throws InterruptedException {
603	>	threadsStarted.await();
604	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
605	>	}});
606	>
607	>	executor.execute(new CheckedRunnable() {
608	>	public void realRun() throws InterruptedException {
609	>	threadsStarted.await();
610	>	assertSame(one, q.take());
611	>	checkEmpty(q);
612	>	}});
613
614		joinPool(executor);
615		}
616
617		/**
618	<	* poll retrieves elements across Executor threads
618	>	* timed poll retrieves elements across Executor threads
619		*/
620		public void testPollInExecutor() {
621		final LinkedTransferQueue q = new LinkedTransferQueue();
622	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
623		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	–	});
624
625	<	executor.execute(new Runnable() {
626	<
627	<	public void run() {
628	<	try {
629	<	Thread.sleep(SMALL_DELAY_MS);
630	<	q.put(one);
631	<	} catch (InterruptedException e) {
632	<	threadUnexpectedException();
633	<	}
634	<	}
635	<	});
625	>	executor.execute(new CheckedRunnable() {
626	>	public void realRun() throws InterruptedException {
627	>	assertNull(q.poll());
628	>	threadsStarted.await();
629	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
630	>	checkEmpty(q);
631	>	}});
632	>
633	>	executor.execute(new CheckedRunnable() {
634	>	public void realRun() throws InterruptedException {
635	>	threadsStarted.await();
636	>	q.put(one);
637	>	}});
638
639		joinPool(executor);
640		}
#	Line 769 | Line 642 | public class LinkedTransferQueueTest ext
642		/**
643		* A deserialized serialized queue has same elements in same order
644		*/
645	<	public void testSerialization() {
646	<	LinkedTransferQueue q = populatedQueue(SIZE);
647	<
648	<	try {
649	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
650	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
651	<	out.writeObject(q);
652	<	out.close();
653	<
654	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
655	<	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) {
645	>	public void testSerialization() throws Exception {
646	>	Queue x = populatedQueue(SIZE);
647	>	Queue y = serialClone(x);
648	>
649	>	assertTrue(x != y);
650	>	assertEquals(x.size(), y.size());
651	>	assertEquals(x.toString(), y.toString());
652	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
653	>	while (!x.isEmpty()) {
654	>	assertFalse(y.isEmpty());
655	>	assertEquals(x.remove(), y.remove());
656		}
657	+	assertTrue(y.isEmpty());
658		}
659
660		/**
#	Line 825 | Line 667 | public class LinkedTransferQueueTest ext
667		assertEquals(q.size(), 0);
668		assertEquals(l.size(), SIZE);
669		for (int i = 0; i < SIZE; ++i) {
670	<	assertEquals(l.get(i), new Integer(i));
670	>	assertEquals(l.get(i), i);
671		}
672		q.add(zero);
673		q.add(one);
#	Line 837 | Line 679 | public class LinkedTransferQueueTest ext
679		assertEquals(q.size(), 0);
680		assertEquals(l.size(), 2);
681		for (int i = 0; i < 2; ++i) {
682	<	assertEquals(l.get(i), new Integer(i));
682	>	assertEquals(l.get(i), i);
683		}
684		}
685
686		/**
687	<	* drainTo empties full queue, unblocking a waiting put.
687	>	* drainTo(c) empties full queue, unblocking a waiting put.
688		*/
689	<	public void testDrainToWithActivePut() {
689	>	public void testDrainToWithActivePut() throws InterruptedException {
690		final LinkedTransferQueue q = populatedQueue(SIZE);
691	<	Thread t = new Thread(new Runnable() {
692	<
693	<	public void run() {
694	<	try {
695	<	q.put(new Integer(SIZE + 1));
696	<	} catch (Exception ie) {
697	<	threadUnexpectedException();
698	<	}
699	<	}
858	<	});
859	<	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) {
691	>	Thread t = newStartedThread(new CheckedRunnable() {
692	>	public void realRun() {
693	>	q.put(SIZE + 1);
694	>	}});
695	>	ArrayList l = new ArrayList();
696	>	q.drainTo(l);
697	>	assertTrue(l.size() >= SIZE);
698	>	for (int i = 0; i < SIZE; ++i) {
699	>	assertEquals(l.get(i), i);
700		}
701	+	awaitTermination(t, MEDIUM_DELAY_MS);
702	+	assertTrue(q.size() + l.size() >= SIZE);
703		}
704
705		/**
706	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
706	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
707		*/
708		public void testDrainToN() {
709		LinkedTransferQueue q = new LinkedTransferQueue();
710		for (int i = 0; i < SIZE + 2; ++i) {
711		for (int j = 0; j < SIZE; j++) {
712	<	assertTrue(q.offer(new Integer(j)));
712	>	assertTrue(q.offer(j));
713		}
714		ArrayList l = new ArrayList();
715		q.drainTo(l, i);
#	Line 910 | Line 717 | public class LinkedTransferQueueTest ext
717		assertEquals(l.size(), k);
718		assertEquals(q.size(), SIZE - k);
719		for (int j = 0; j < k; ++j) {
720	<	assertEquals(l.get(j), new Integer(j));
720	>	assertEquals(l.get(j), j);
721		}
722	<	while (q.poll() != null);
722	>	while (q.poll() != null)
723	>	;
724		}
725		}
726
727	<	/*
728	<	* poll and take should decrement the waiting consumer count
727	>	/**
728	>	* timed poll() or take() increments the waiting consumer count;
729	>	* offer(e) decrements the waiting consumer count
730		*/
731	<	public void testWaitingConsumer() {
732	<	try {
733	<	final LinkedTransferQueue q = new LinkedTransferQueue();
734	<	final ConsumerObserver waiting = new ConsumerObserver();
735	<	new Thread(new Runnable() {
731	>	public void testWaitingConsumer() throws InterruptedException {
732	>	final LinkedTransferQueue q = new LinkedTransferQueue();
733	>	assertEquals(q.getWaitingConsumerCount(), 0);
734	>	assertFalse(q.hasWaitingConsumer());
735	>	final CountDownLatch threadStarted = new CountDownLatch(1);
736
737	<	public void run() {
738	<	try {
739	<	threadAssertTrue(q.hasWaitingConsumer());
740	<	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
741	<	threadAssertTrue(q.offer(new Object()));
742	<	} catch (Exception ex) {
743	<	threadUnexpectedException();
935	<	}
737	>	Thread t = newStartedThread(new CheckedRunnable() {
738	>	public void realRun() throws InterruptedException {
739	>	threadStarted.countDown();
740	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
741	>	assertEquals(q.getWaitingConsumerCount(), 0);
742	>	assertFalse(q.hasWaitingConsumer());
743	>	}});
744
745	<	}
746	<	}).start();
747	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
748	<	assertTrue(q.getWaitingConsumerCount() < waiting.getWaitingConsumers());
749	<	} catch (Exception ex) {
750	<	this.unexpectedException();
751	<	}
745	>	threadStarted.await();
746	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
747	>	assertEquals(q.getWaitingConsumerCount(), 1);
748	>	assertTrue(q.hasWaitingConsumer());
749	>
750	>	assertTrue(q.offer(one));
751	>	assertEquals(q.getWaitingConsumerCount(), 0);
752	>	assertFalse(q.hasWaitingConsumer());
753	>
754	>	awaitTermination(t, MEDIUM_DELAY_MS);
755		}
945	–	/*
946	–	* Inserts null into transfer throws NPE
947	–	*/
756
757	<	public void testTransfer1() {
757	>	/**
758	>	* transfer(null) throws NullPointerException
759	>	*/
760	>	public void testTransfer1() throws InterruptedException {
761		try {
762		LinkedTransferQueue q = new LinkedTransferQueue();
763		q.transfer(null);
764		shouldThrow();
765	<	} catch (NullPointerException ex) {
955	<	} catch (Exception ex) {
956	<	this.unexpectedException();
957	<	}
765	>	} catch (NullPointerException success) {}
766		}
767
768	<	/*
769	<	* transfer attempts to insert into the queue then wait until that
770	<	* object is removed via take or poll.
768	>	/**
769	>	* transfer waits until a poll occurs. The transfered element
770	>	* is returned by this associated poll.
771		*/
772	<	public void testTransfer2() {
773	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
774	<	new Thread(new Runnable() {
772	>	public void testTransfer2() throws InterruptedException {
773	>	final LinkedTransferQueue<Integer> q
774	>	= new LinkedTransferQueue<Integer>();
775	>	final CountDownLatch threadStarted = new CountDownLatch(1);
776
777	<	public void run() {
778	<	try {
779	<	q.transfer(new Integer(SIZE));
780	<	threadAssertTrue(q.isEmpty());
781	<	} catch (Exception ex) {
782	<	threadUnexpectedException();
974	<	}
975	<	}
976	<	}).start();
777	>	Thread t = newStartedThread(new CheckedRunnable() {
778	>	public void realRun() throws InterruptedException {
779	>	threadStarted.countDown();
780	>	q.transfer(five);
781	>	checkEmpty(q);
782	>	}});
783
784	<	try {
785	<	Thread.sleep(SHORT_DELAY_MS);
786	<	assertEquals(1, q.size());
787	<	q.poll();
788	<	assertTrue(q.isEmpty());
789	<	} 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	<	}
784	>	threadStarted.await();
785	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
786	>	assertEquals(1, q.size());
787	>	assertSame(five, q.poll());
788	>	checkEmpty(q);
789	>	awaitTermination(t, MEDIUM_DELAY_MS);
790		}
791
792		/**
793	<	* 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
793	>	* transfer waits until a poll occurs, and then transfers in fifo order
794		*/
795	<	public void testTransfer4() {
795	>	public void testTransfer3() throws InterruptedException {
796	>	final LinkedTransferQueue<Integer> q
797	>	= new LinkedTransferQueue<Integer>();
798	>
799	>	Thread first = newStartedThread(new CheckedRunnable() {
800	>	public void realRun() throws InterruptedException {
801	>	q.transfer(four);
802	>	assertTrue(!q.contains(four));
803	>	assertEquals(1, q.size());
804	>	}});
805	>
806	>	Thread interruptedThread = newStartedThread(
807	>	new CheckedInterruptedRunnable() {
808	>	public void realRun() throws InterruptedException {
809	>	while (q.isEmpty())
810	>	Thread.yield();
811	>	q.transfer(five);
812	>	}});
813	>
814	>	while (q.size() < 2)
815	>	Thread.yield();
816	>	assertEquals(2, q.size());
817	>	assertSame(four, q.poll());
818	>	first.join();
819	>	assertEquals(1, q.size());
820	>	interruptedThread.interrupt();
821	>	interruptedThread.join();
822	>	checkEmpty(q);
823	>	}
824	>
825	>	/**
826	>	* transfer waits until a poll occurs, at which point the polling
827	>	* thread returns the element
828	>	*/
829	>	public void testTransfer4() throws InterruptedException {
830		final LinkedTransferQueue q = new LinkedTransferQueue();
1036	–	new Thread(new Runnable() {
831
832	<	public void run() {
833	<	try {
834	<	q.transfer(new Integer(four));
835	<	threadAssertFalse(q.contains(new Integer(four)));
836	<	threadAssertEquals(new Integer(three), q.poll());
837	<	} catch (Exception ex) {
838	<	threadUnexpectedException();
839	<	}
840	<	}
841	<	}).start();
842	<	try {
843	<	Thread.sleep(MEDIUM_DELAY_MS);
844	<	assertTrue(q.offer(three));
845	<	assertEquals(new Integer(four), q.poll());
1052	<	} catch (Exception ex) {
1053	<	this.unexpectedException();
1054	<	}
832	>	Thread t = newStartedThread(new CheckedRunnable() {
833	>	public void realRun() throws InterruptedException {
834	>	q.transfer(four);
835	>	assertFalse(q.contains(four));
836	>	assertSame(three, q.poll());
837	>	}});
838	>
839	>	while (q.isEmpty())
840	>	Thread.yield();
841	>	assertFalse(q.isEmpty());
842	>	assertEquals(1, q.size());
843	>	assertTrue(q.offer(three));
844	>	assertSame(four, q.poll());
845	>	awaitTermination(t, MEDIUM_DELAY_MS);
846		}
847	<	/*
848	<	* Insert null into trTransfer throws NPE
847	>
848	>	/**
849	>	* transfer waits until a take occurs. The transfered element
850	>	* is returned by this associated take.
851		*/
852	+	public void testTransfer5() throws InterruptedException {
853	+	final LinkedTransferQueue<Integer> q
854	+	= new LinkedTransferQueue<Integer>();
855	+
856	+	Thread t = newStartedThread(new CheckedRunnable() {
857	+	public void realRun() throws InterruptedException {
858	+	q.transfer(four);
859	+	checkEmpty(q);
860	+	}});
861
862	+	while (q.isEmpty())
863	+	Thread.yield();
864	+	assertFalse(q.isEmpty());
865	+	assertEquals(1, q.size());
866	+	assertSame(four, q.take());
867	+	checkEmpty(q);
868	+	awaitTermination(t, MEDIUM_DELAY_MS);
869	+	}
870	+
871	+	/**
872	+	* tryTransfer(null) throws NullPointerException
873	+	*/
874		public void testTryTransfer1() {
875		try {
876		final LinkedTransferQueue q = new LinkedTransferQueue();
877		q.tryTransfer(null);
878	<	this.shouldThrow();
879	<	} catch (NullPointerException ex) {
1066	<	} catch (Exception ex) {
1067	<	this.unexpectedException();
1068	<	}
878	>	shouldThrow();
879	>	} catch (NullPointerException success) {}
880		}
1070	–	/*
1071	–	* tryTransfer returns false and does not enqueue if there are no consumers
1072	–	* waiting to poll or take.
1073	–	*/
881
882	<	public void testTryTransfer2() {
883	<	try {
884	<	final LinkedTransferQueue q = new LinkedTransferQueue();
885	<	assertFalse(q.tryTransfer(new Object()));
886	<	assertEquals(0, q.size());
887	<	} catch (Exception ex) {
888	<	this.unexpectedException();
889	<	}
882	>	/**
883	>	* tryTransfer returns false and does not enqueue if there are no
884	>	* consumers waiting to poll or take.
885	>	*/
886	>	public void testTryTransfer2() throws InterruptedException {
887	>	final LinkedTransferQueue q = new LinkedTransferQueue();
888	>	assertFalse(q.tryTransfer(new Object()));
889	>	assertFalse(q.hasWaitingConsumer());
890	>	checkEmpty(q);
891		}
892	<	/*
893	<	* if there is a consumer waiting poll or take tryTransfer returns
894	<	* true while enqueueing object
892	>
893	>	/**
894	>	* If there is a consumer waiting in timed poll, tryTransfer
895	>	* returns true while successfully transfering object.
896		*/
897	+	public void testTryTransfer3() throws InterruptedException {
898	+	final Object hotPotato = new Object();
899	+	final LinkedTransferQueue q = new LinkedTransferQueue();
900
901	<	public void testTryTransfer3() {
902	<	try {
903	<	final LinkedTransferQueue q = new LinkedTransferQueue();
904	<	new Thread(new Runnable() {
901	>	Thread t = newStartedThread(new CheckedRunnable() {
902	>	public void realRun() {
903	>	while (! q.hasWaitingConsumer())
904	>	Thread.yield();
905	>	assertTrue(q.hasWaitingConsumer());
906	>	checkEmpty(q);
907	>	assertTrue(q.tryTransfer(hotPotato));
908	>	}});
909	>
910	>	assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
911	>	checkEmpty(q);
912	>	awaitTermination(t, MEDIUM_DELAY_MS);
913	>	}
914	>
915	>	/**
916	>	* If there is a consumer waiting in take, tryTransfer returns
917	>	* true while successfully transfering object.
918	>	*/
919	>	public void testTryTransfer4() throws InterruptedException {
920	>	final Object hotPotato = new Object();
921	>	final LinkedTransferQueue q = new LinkedTransferQueue();
922
923	<	public void run() {
924	<	try {
925	<	threadAssertTrue(q.hasWaitingConsumer());
926	<	threadAssertTrue(q.tryTransfer(new Object()));
927	<	} catch (Exception ex) {
928	<	threadUnexpectedException();
929	<	}
923	>	Thread t = newStartedThread(new CheckedRunnable() {
924	>	public void realRun() {
925	>	while (! q.hasWaitingConsumer())
926	>	Thread.yield();
927	>	assertTrue(q.hasWaitingConsumer());
928	>	checkEmpty(q);
929	>	assertTrue(q.tryTransfer(hotPotato));
930	>	}});
931
932	<	}
933	<	}).start();
934	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
1105	<	assertTrue(q.isEmpty());
1106	<	} catch (Exception ex) {
1107	<	this.unexpectedException();
1108	<	}
932	>	assertSame(q.take(), hotPotato);
933	>	checkEmpty(q);
934	>	awaitTermination(t, MEDIUM_DELAY_MS);
935		}
936
937	<	/*
938	<	* tryTransfer waits the amount given if interrupted, show an
1113	<	* interrupted exception
937	>	/**
938	>	* tryTransfer blocks interruptibly if no takers
939		*/
940	<	public void testTryTransfer4() {
940	>	public void testTryTransfer5() throws InterruptedException {
941		final LinkedTransferQueue q = new LinkedTransferQueue();
942	<	Thread toInterrupt = new Thread(new Runnable() {
942	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
943	>	assertTrue(q.isEmpty());
944
945	<	public void run() {
945	>	Thread t = newStartedThread(new CheckedRunnable() {
946	>	public void realRun() throws InterruptedException {
947	>	Thread.currentThread().interrupt();
948		try {
949	<	q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
950	<	threadShouldThrow();
951	<	} catch (InterruptedException ex) {
952	<	}
953	<	}
954	<	});
955	<	try {
956	<	toInterrupt.start();
957	<	Thread.sleep(SMALL_DELAY_MS);
958	<	toInterrupt.interrupt();
959	<	} catch (Exception ex) {
960	<	this.unexpectedException();
961	<	}
949	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
950	>	shouldThrow();
951	>	} catch (InterruptedException success) {}
952	>	assertFalse(Thread.interrupted());
953	>
954	>	pleaseInterrupt.countDown();
955	>	try {
956	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
957	>	shouldThrow();
958	>	} catch (InterruptedException success) {}
959	>	assertFalse(Thread.interrupted());
960	>	}});
961	>
962	>	await(pleaseInterrupt);
963	>	assertThreadStaysAlive(t);
964	>	t.interrupt();
965	>	awaitTermination(t);
966	>	checkEmpty(q);
967		}
968
969	<	/*
970	<	* tryTransfer gives up after the timeout and return false
969	>	/**
970	>	* tryTransfer gives up after the timeout and returns false
971		*/
972	<	public void testTryTransfer5() {
972	>	public void testTryTransfer6() throws InterruptedException {
973		final LinkedTransferQueue q = new LinkedTransferQueue();
1141	–	try {
1142	–	new Thread(new Runnable() {
974
975	<	public void run() {
976	<	try {
977	<	threadAssertFalse(q.tryTransfer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
978	<	} catch (InterruptedException ex) {
979	<	threadUnexpectedException();
980	<	}
981	<	}
982	<	}).start();
983	<	Thread.sleep(LONG_DELAY_MS);
984	<	assertTrue(q.isEmpty());
985	<	} catch (Exception ex) {
1155	<	this.unexpectedException();
1156	<	}
975	>	Thread t = newStartedThread(new CheckedRunnable() {
976	>	public void realRun() throws InterruptedException {
977	>	long t0 = System.nanoTime();
978	>	assertFalse(q.tryTransfer(new Object(),
979	>	timeoutMillis(), MILLISECONDS));
980	>	assertTrue(millisElapsedSince(t0) >= timeoutMillis());
981	>	checkEmpty(q);
982	>	}});
983	>
984	>	awaitTermination(t);
985	>	checkEmpty(q);
986		}
987
988	<	/*
988	>	/**
989		* tryTransfer waits for any elements previously in to be removed
990		* before transfering to a poll or take
991		*/
992	<	public void testTryTransfer6() {
992	>	public void testTryTransfer7() throws InterruptedException {
993		final LinkedTransferQueue q = new LinkedTransferQueue();
994	<	q.offer(new Integer(four));
1166	<	new Thread(new Runnable() {
994	>	assertTrue(q.offer(four));
995
996	<	public void run() {
997	<	try {
998	<	threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
999	<	threadAssertTrue(q.isEmpty());
1000	<	} catch (InterruptedException ex) {
1001	<	threadUnexpectedException();
1002	<	}
1003	<	}
1004	<	}).start();
1005	<	try {
1006	<	Thread.sleep(SHORT_DELAY_MS);
1007	<	assertEquals(2, q.size());
1008	<	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	<	}
996	>	Thread t = newStartedThread(new CheckedRunnable() {
997	>	public void realRun() throws InterruptedException {
998	>	assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS));
999	>	checkEmpty(q);
1000	>	}});
1001	>
1002	>	while (q.size() != 2)
1003	>	Thread.yield();
1004	>	assertEquals(2, q.size());
1005	>	assertSame(four, q.poll());
1006	>	assertSame(five, q.poll());
1007	>	checkEmpty(q);
1008	>	awaitTermination(t, MEDIUM_DELAY_MS);
1009		}
1010
1011	<	/*
1012	<	* tryTransfer attempts to enqueue into the q and fails returning false not
1013	<	* enqueueing and the successing poll is null
1011	>	/**
1012	>	* tryTransfer attempts to enqueue into the queue and fails
1013	>	* returning false not enqueueing and the successive poll is null
1014		*/
1015	<	public void testTryTransfer7() {
1015	>	public void testTryTransfer8() throws InterruptedException {
1016		final LinkedTransferQueue q = new LinkedTransferQueue();
1017	<	q.offer(new Integer(four));
1018	<	new Thread(new Runnable() {
1019	<
1020	<	public void run() {
1021	<	try {
1022	<	threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1023	<	threadAssertTrue(q.isEmpty());
1024	<	} catch (InterruptedException ex) {
1025	<	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	<	}
1017	>	assertTrue(q.offer(four));
1018	>	assertEquals(1, q.size());
1019	>	long t0 = System.nanoTime();
1020	>	assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS));
1021	>	assertTrue(millisElapsedSince(t0) >= timeoutMillis());
1022	>	assertEquals(1, q.size());
1023	>	assertSame(four, q.poll());
1024	>	assertNull(q.poll());
1025	>	checkEmpty(q);
1026		}
1027
1028	<	private LinkedTransferQueue populatedQueue(
1029	<	int n) {
1030	<	LinkedTransferQueue q = new LinkedTransferQueue();
1031	<	assertTrue(q.isEmpty());
1032	<	int remainingCapacity = q.remainingCapacity();
1221	<	for (int i = 0; i <
1222	<	n; i++) {
1028	>	private LinkedTransferQueue<Integer> populatedQueue(int n) {
1029	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
1030	>	checkEmpty(q);
1031	>	for (int i = 0; i < n; i++) {
1032	>	assertEquals(i, q.size());
1033		assertTrue(q.offer(i));
1034	+	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
1035		}
1225	–
1036		assertFalse(q.isEmpty());
1227	–	assertEquals(remainingCapacity, q.remainingCapacity());
1228	–	assertEquals(n, q.size());
1037		return q;
1038		}
1231	–
1232	–	private static class ConsumerObserver {
1233	–
1234	–	private int waitingConsumers;
1235	–
1236	–	private ConsumerObserver() {
1237	–	}
1238	–
1239	–	private void setWaitingConsumer(int i) {
1240	–	this.waitingConsumers = i;
1241	–	}
1242	–
1243	–	private int getWaitingConsumers() {
1244	–	return waitingConsumers;
1245	–	}
1246	–	}
1039		}

Diff Legend

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