ViewVC Help

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

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

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.4 by jsr166, Sat Aug 1 22:09:13 2009 UTC vs.
Revision 1.56 by jsr166, Wed Dec 31 19:21:20 2014 UTC

#	Line 1 | Line 1
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		* Other contributors include John Vint
6		*/
7
8	<	import java.io.BufferedInputStream;
9	<	import java.io.BufferedOutputStream;
10	<	import java.io.ByteArrayInputStream;
11	<	import java.io.ByteArrayOutputStream;
12	<	import java.io.ObjectInputStream;
13	<	import java.io.ObjectOutputStream;
8	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
9	>
10		import java.util.ArrayList;
11		import java.util.Arrays;
12	<	import java.util.ConcurrentModificationException;
12	>	import java.util.Collection;
13		import java.util.Iterator;
14	+	import java.util.List;
15		import java.util.NoSuchElementException;
16	<	import java.util.concurrent.*;
16	>	import java.util.Queue;
17	>	import java.util.concurrent.BlockingQueue;
18	>	import java.util.concurrent.CountDownLatch;
19	>	import java.util.concurrent.Executors;
20	>	import java.util.concurrent.ExecutorService;
21	>	import java.util.concurrent.LinkedTransferQueue;
22	>
23		import junit.framework.Test;
21	–	import junit.framework.TestSuite;
24
25	+	@SuppressWarnings({"unchecked", "rawtypes"})
26		public class LinkedTransferQueueTest extends JSR166TestCase {
27
28	+	public static class Generic extends BlockingQueueTest {
29	+	protected BlockingQueue emptyCollection() {
30	+	return new LinkedTransferQueue();
31	+	}
32	+	}
33	+
34		public static void main(String[] args) {
35		junit.textui.TestRunner.run(suite());
36		}
37
38		public static Test suite() {
39	<	return new TestSuite(LinkedTransferQueueTest.class);
39	>	return newTestSuite(LinkedTransferQueueTest.class,
40	>	new Generic().testSuite());
41		}
42
43		/**
44	<	* Constructor builds new queue with size being zero and empty being true
44	>	* Constructor builds new queue with size being zero and empty
45	>	* being true
46		*/
47		public void testConstructor1() {
48		assertEquals(0, new LinkedTransferQueue().size());
#	Line 39 | Line 50 | public class LinkedTransferQueueTest ext
50		}
51
52		/**
53	<	* Initializing constructor with null collection throws NPE
53	>	* Initializing constructor with null collection throws
54	>	* NullPointerException
55		*/
56		public void testConstructor2() {
57		try {
58		new LinkedTransferQueue(null);
59		shouldThrow();
60	<	} catch (NullPointerException success) {
49	<	}
60	>	} catch (NullPointerException success) {}
61		}
62
63		/**
64	<	* Initializing from Collection of null elements throws NPE
64	>	* Initializing from Collection of null elements throws
65	>	* NullPointerException
66		*/
67		public void testConstructor3() {
68	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
69		try {
70	<	Integer[] ints = new Integer[SIZE];
58	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
70	>	new LinkedTransferQueue(elements);
71		shouldThrow();
72	<	} catch (NullPointerException success) {
61	<	}
72	>	} catch (NullPointerException success) {}
73		}
74
75		/**
76		* Initializing constructor with a collection containing some null elements
77	<	* throws NPE
77	>	* throws NullPointerException
78		*/
79		public void testConstructor4() {
80	+	Integer[] ints = new Integer[SIZE];
81	+	for (int i = 0; i < SIZE-1; ++i)
82	+	ints[i] = i;
83	+	Collection<Integer> elements = Arrays.asList(ints);
84		try {
85	<	Integer[] ints = new Integer[SIZE];
71	<	for (int i = 0; i < SIZE - 1; ++i) {
72	<	ints[i] = new Integer(i);
73	<	}
74	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
85	>	new LinkedTransferQueue(elements);
86		shouldThrow();
87	<	} catch (NullPointerException success) {
77	<	}
87	>	} catch (NullPointerException success) {}
88		}
89
90		/**
91		* Queue contains all elements of the collection it is initialized by
92		*/
93		public void testConstructor5() {
94	<	try {
95	<	Integer[] ints = new Integer[SIZE];
96	<	for (int i = 0; i < SIZE; ++i) {
97	<	ints[i] = new Integer(i);
98	<	}
99	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
100	<	for (int i = 0; i < SIZE; ++i) {
101	<	assertEquals(ints[i], q.poll());
102	<	}
103	<	} finally {
94	>	Integer[] ints = new Integer[SIZE];
95	>	for (int i = 0; i < SIZE; ++i) {
96	>	ints[i] = i;
97	>	}
98	>	List intList = Arrays.asList(ints);
99	>	LinkedTransferQueue q
100	>	= new LinkedTransferQueue(intList);
101	>	assertEquals(q.size(), intList.size());
102	>	assertEquals(q.toString(), intList.toString());
103	>	assertTrue(Arrays.equals(q.toArray(),
104	>	intList.toArray()));
105	>	assertTrue(Arrays.equals(q.toArray(new Object[0]),
106	>	intList.toArray(new Object[0])));
107	>	assertTrue(Arrays.equals(q.toArray(new Object[SIZE]),
108	>	intList.toArray(new Object[SIZE])));
109	>	for (int i = 0; i < SIZE; ++i) {
110	>	assertEquals(ints[i], q.poll());
111		}
112		}
113
114		/**
115	<	* Remaining capacity never decrease nor increase on add or remove
115	>	* remainingCapacity() always returns Integer.MAX_VALUE
116		*/
117		public void testRemainingCapacity() {
118	<	LinkedTransferQueue q = populatedQueue(SIZE);
102	<	int remainingCapacity = q.remainingCapacity();
118	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
119		for (int i = 0; i < SIZE; ++i) {
120	<	assertEquals(remainingCapacity, q.remainingCapacity());
120	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
121		assertEquals(SIZE - i, q.size());
122		q.remove();
123		}
124		for (int i = 0; i < SIZE; ++i) {
125	<	assertEquals(remainingCapacity, q.remainingCapacity());
125	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
126		assertEquals(i, q.size());
127	<	q.add(new Integer(i));
112	<	}
113	<	}
114	<
115	<	/**
116	<	* offer(null) throws NPE
117	<	*/
118	<	public void testOfferNull() {
119	<	try {
120	<	LinkedTransferQueue q = new LinkedTransferQueue();
121	<	q.offer(null);
122	<	shouldThrow();
123	<	} catch (NullPointerException success) {
124	<	}
125	<	}
126	<
127	<	/**
128	<	* add(null) throws NPE
129	<	*/
130	<	public void testAddNull() {
131	<	try {
132	<	LinkedTransferQueue q = new LinkedTransferQueue();
133	<	q.add(null);
134	<	shouldThrow();
135	<	} catch (NullPointerException success) {
136	<	}
137	<	}
138	<
139	<	/**
140	<	* addAll(null) throws NPE
141	<	*/
142	<	public void testAddAll1() {
143	<	try {
144	<	LinkedTransferQueue q = new LinkedTransferQueue();
145	<	q.addAll(null);
146	<	shouldThrow();
147	<	} catch (NullPointerException success) {
127	>	q.add(i);
128		}
129		}
130
131		/**
132	<	* addAll(this) throws IAE
132	>	* addAll(this) throws IllegalArgumentException
133		*/
134		public void testAddAllSelf() {
135		try {
136		LinkedTransferQueue q = populatedQueue(SIZE);
137		q.addAll(q);
138		shouldThrow();
139	<	} catch (IllegalArgumentException success) {
160	<	}
139	>	} catch (IllegalArgumentException success) {}
140		}
141
142		/**
143	<	* addAll of a collection with null elements throws NPE
144	<	*/
166	<	public void testAddAll2() {
167	<	try {
168	<	LinkedTransferQueue q = new LinkedTransferQueue();
169	<	Integer[] ints = new Integer[SIZE];
170	<	q.addAll(Arrays.asList(ints));
171	<	shouldThrow();
172	<	} catch (NullPointerException success) {
173	<	}
174	<	}
175	<
176	<	/**
177	<	* addAll of a collection with any null elements throws NPE after
178	<	* possibly adding some elements
143	>	* addAll of a collection with any null elements throws
144	>	* NullPointerException after possibly adding some elements
145		*/
146		public void testAddAll3() {
147		try {
148		LinkedTransferQueue q = new LinkedTransferQueue();
149		Integer[] ints = new Integer[SIZE];
150		for (int i = 0; i < SIZE - 1; ++i) {
151	<	ints[i] = new Integer(i);
151	>	ints[i] = i;
152		}
153		q.addAll(Arrays.asList(ints));
154		shouldThrow();
155	<	} catch (NullPointerException success) {
190	<	}
155	>	} catch (NullPointerException success) {}
156		}
157
158		/**
159		* Queue contains all elements, in traversal order, of successful addAll
160		*/
161		public void testAddAll5() {
162	<	try {
163	<	Integer[] empty = new Integer[0];
164	<	Integer[] ints = new Integer[SIZE];
165	<	for (int i = 0; i < SIZE; ++i) {
201	<	ints[i] = new Integer(i);
202	<	}
203	<	LinkedTransferQueue q = new LinkedTransferQueue();
204	<	assertFalse(q.addAll(Arrays.asList(empty)));
205	<	assertTrue(q.addAll(Arrays.asList(ints)));
206	<	for (int i = 0; i < SIZE; ++i) {
207	<	assertEquals(ints[i], q.poll());
208	<	}
209	<	} finally {
162	>	Integer[] empty = new Integer[0];
163	>	Integer[] ints = new Integer[SIZE];
164	>	for (int i = 0; i < SIZE; ++i) {
165	>	ints[i] = i;
166		}
167	<	}
168	<
169	<	/**
170	<	* put(null) throws NPE
171	<	*/
216	<	public void testPutNull() {
217	<	try {
218	<	LinkedTransferQueue q = new LinkedTransferQueue();
219	<	q.put(null);
220	<	shouldThrow();
221	<	} catch (NullPointerException success) {
222	<	} catch (Exception ie) {
223	<	unexpectedException();
167	>	LinkedTransferQueue q = new LinkedTransferQueue();
168	>	assertFalse(q.addAll(Arrays.asList(empty)));
169	>	assertTrue(q.addAll(Arrays.asList(ints)));
170	>	for (int i = 0; i < SIZE; ++i) {
171	>	assertEquals(ints[i], q.poll());
172		}
173		}
174
#	Line 228 | Line 176 | public class LinkedTransferQueueTest ext
176		* all elements successfully put are contained
177		*/
178		public void testPut() {
179	<	try {
180	<	LinkedTransferQueue q = new LinkedTransferQueue();
181	<	for (int i = 0; i < SIZE; ++i) {
182	<	Integer I = new Integer(i);
183	<	q.put(I);
236	<	assertTrue(q.contains(I));
237	<	}
238	<	} catch (Exception ie) {
239	<	unexpectedException();
179	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
180	>	for (int i = 0; i < SIZE; ++i) {
181	>	assertEquals(i, q.size());
182	>	q.put(i);
183	>	assertTrue(q.contains(i));
184		}
185		}
186
187		/**
188		* take retrieves elements in FIFO order
189		*/
190	<	public void testTake() {
191	<	try {
192	<	LinkedTransferQueue q = populatedQueue(SIZE);
193	<	for (int i = 0; i < SIZE; ++i) {
250	<	assertEquals(i, ((Integer) q.take()).intValue());
251	<	}
252	<	} catch (InterruptedException e) {
253	<	unexpectedException();
190	>	public void testTake() throws InterruptedException {
191	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
192	>	for (int i = 0; i < SIZE; ++i) {
193	>	assertEquals(i, (int) q.take());
194		}
195		}
196
197		/**
198	<	* take blocks interruptibly when empty
198	>	* take removes existing elements until empty, then blocks interruptibly
199		*/
200	<	public void testTakeFromEmpty() {
201	<	final LinkedTransferQueue q = new LinkedTransferQueue();
202	<	Thread t = new Thread(new Runnable() {
200	>	public void testBlockingTake() throws InterruptedException {
201	>	final BlockingQueue q = populatedQueue(SIZE);
202	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
203	>	Thread t = newStartedThread(new CheckedRunnable() {
204	>	public void realRun() throws InterruptedException {
205	>	for (int i = 0; i < SIZE; ++i) {
206	>	assertEquals(i, q.take());
207	>	}
208
209	<	public void run() {
209	>	Thread.currentThread().interrupt();
210		try {
211		q.take();
212	<	threadShouldThrow();
213	<	} catch (InterruptedException success) {
214	<	}
270	<	}
271	<	});
272	<	try {
273	<	t.start();
274	<	Thread.sleep(SHORT_DELAY_MS);
275	<	t.interrupt();
276	<	t.join();
277	<	} catch (Exception e) {
278	<	unexpectedException();
279	<	}
280	<	}
212	>	shouldThrow();
213	>	} catch (InterruptedException success) {}
214	>	assertFalse(Thread.interrupted());
215
216	<	/**
283	<	* Take removes existing elements until empty, then blocks interruptibly
284	<	*/
285	<	public void testBlockingTake() {
286	<	Thread t = new Thread(new Runnable() {
287	<
288	<	public void run() {
216	>	pleaseInterrupt.countDown();
217		try {
290	–	LinkedTransferQueue q = populatedQueue(SIZE);
291	–	for (int i = 0; i < SIZE; ++i) {
292	–	assertEquals(i, ((Integer) q.take()).intValue());
293	–	}
218		q.take();
219	<	threadShouldThrow();
220	<	} catch (InterruptedException success) {
221	<	}
222	<	}
223	<	});
224	<	t.start();
225	<	try {
226	<	Thread.sleep(SHORT_DELAY_MS);
227	<	t.interrupt();
304	<	t.join();
305	<	} catch (InterruptedException ie) {
306	<	unexpectedException();
307	<	}
219	>	shouldThrow();
220	>	} catch (InterruptedException success) {}
221	>	assertFalse(Thread.interrupted());
222	>	}});
223	>
224	>	await(pleaseInterrupt);
225	>	assertThreadStaysAlive(t);
226	>	t.interrupt();
227	>	awaitTermination(t);
228		}
229
230		/**
231		* poll succeeds unless empty
232		*/
233	<	public void testPoll() {
234	<	LinkedTransferQueue q = populatedQueue(SIZE);
233	>	public void testPoll() throws InterruptedException {
234	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
235		for (int i = 0; i < SIZE; ++i) {
236	<	assertEquals(i, ((Integer) q.poll()).intValue());
236	>	assertEquals(i, (int) q.poll());
237		}
238		assertNull(q.poll());
239	+	checkEmpty(q);
240		}
241
242		/**
243	<	* timed pool with zero timeout succeeds when non-empty, else times out
243	>	* timed poll with zero timeout succeeds when non-empty, else times out
244		*/
245	<	public void testTimedPoll0() {
246	<	try {
247	<	LinkedTransferQueue q = populatedQueue(SIZE);
248	<	for (int i = 0; i < SIZE; ++i) {
328	<	assertEquals(i, ((Integer) q.poll(0, TimeUnit.MILLISECONDS)).intValue());
329	<	}
330	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
331	<	} catch (InterruptedException e) {
332	<	unexpectedException();
245	>	public void testTimedPoll0() throws InterruptedException {
246	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
247	>	for (int i = 0; i < SIZE; ++i) {
248	>	assertEquals(i, (int) q.poll(0, MILLISECONDS));
249		}
250	+	assertNull(q.poll(0, MILLISECONDS));
251	+	checkEmpty(q);
252		}
253
254		/**
255	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
255	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
256		*/
257	<	public void testTimedPoll() {
258	<	try {
259	<	LinkedTransferQueue q = populatedQueue(SIZE);
260	<	for (int i = 0; i < SIZE; ++i) {
261	<	assertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
262	<	}
263	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
264	<	} catch (InterruptedException e) {
265	<	unexpectedException();
266	<	}
257	>	public void testTimedPoll() throws InterruptedException {
258	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
259	>	for (int i = 0; i < SIZE; ++i) {
260	>	long startTime = System.nanoTime();
261	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
262	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
263	>	}
264	>	long startTime = System.nanoTime();
265	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
266	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
267	>	checkEmpty(q);
268		}
269
270		/**
271		* Interrupted timed poll throws InterruptedException instead of
272		* returning timeout status
273		*/
274	<	public void testInterruptedTimedPoll() {
275	<	Thread t = new Thread(new Runnable() {
276	<
277	<	public void run() {
274	>	public void testInterruptedTimedPoll() throws InterruptedException {
275	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
276	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
277	>	Thread t = newStartedThread(new CheckedRunnable() {
278	>	public void realRun() throws InterruptedException {
279	>	for (int i = 0; i < SIZE; ++i) {
280	>	long t0 = System.nanoTime();
281	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
282	>	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
283	>	}
284	>	long t0 = System.nanoTime();
285	>	aboutToWait.countDown();
286		try {
287	<	LinkedTransferQueue q = populatedQueue(SIZE);
288	<	for (int i = 0; i < SIZE; ++i) {
362	<	threadAssertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
363	<	}
364	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
287	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
288	>	shouldThrow();
289		} catch (InterruptedException success) {
290	+	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
291		}
292	<	}
293	<	});
294	<	t.start();
295	<	try {
296	<	Thread.sleep(SHORT_DELAY_MS);
297	<	t.interrupt();
298	<	t.join();
374	<	} catch (InterruptedException ie) {
375	<	unexpectedException();
376	<	}
292	>	}});
293	>
294	>	aboutToWait.await();
295	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
296	>	t.interrupt();
297	>	awaitTermination(t, MEDIUM_DELAY_MS);
298	>	checkEmpty(q);
299		}
300
301		/**
302	<	* timed poll before a delayed offer fails; after offer succeeds;
303	<	* on interruption throws
304	<	*/
305	<	public void testTimedPollWithOffer() {
306	<	final LinkedTransferQueue q = new LinkedTransferQueue();
307	<	Thread t = new Thread(new Runnable() {
308	<
309	<	public void run() {
310	<	try {
311	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
312	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
313	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
392	<	threadShouldThrow();
393	<	} catch (InterruptedException success) {
302	>	* timed poll after thread interrupted throws InterruptedException
303	>	* instead of returning timeout status
304	>	*/
305	>	public void testTimedPollAfterInterrupt() throws InterruptedException {
306	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
307	>	Thread t = newStartedThread(new CheckedRunnable() {
308	>	public void realRun() throws InterruptedException {
309	>	Thread.currentThread().interrupt();
310	>	for (int i = 0; i < SIZE; ++i) {
311	>	long t0 = System.nanoTime();
312	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
313	>	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
314		}
315	<	}
316	<	});
317	<	try {
318	<	t.start();
319	<	Thread.sleep(SMALL_DELAY_MS);
320	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
321	<	t.interrupt();
322	<	t.join();
403	<	} catch (Exception e) {
404	<	unexpectedException();
405	<	}
315	>	try {
316	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
317	>	shouldThrow();
318	>	} catch (InterruptedException success) {}
319	>	}});
320	>
321	>	awaitTermination(t, MEDIUM_DELAY_MS);
322	>	checkEmpty(q);
323		}
324
325		/**
326		* peek returns next element, or null if empty
327		*/
328	<	public void testPeek() {
329	<	LinkedTransferQueue q = populatedQueue(SIZE);
328	>	public void testPeek() throws InterruptedException {
329	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
330		for (int i = 0; i < SIZE; ++i) {
331	<	assertEquals(i, ((Integer) q.peek()).intValue());
332	<	q.poll();
331	>	assertEquals(i, (int) q.peek());
332	>	assertEquals(i, (int) q.poll());
333		assertTrue(q.peek() == null ||
334	<	i != ((Integer) q.peek()).intValue());
334	>	i != (int) q.peek());
335		}
336		assertNull(q.peek());
337	+	checkEmpty(q);
338		}
339
340		/**
341	<	* element returns next element, or throws NSEE if empty
341	>	* element returns next element, or throws NoSuchElementException if empty
342		*/
343	<	public void testElement() {
344	<	LinkedTransferQueue q = populatedQueue(SIZE);
343	>	public void testElement() throws InterruptedException {
344	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
345		for (int i = 0; i < SIZE; ++i) {
346	<	assertEquals(i, ((Integer) q.element()).intValue());
347	<	q.poll();
346	>	assertEquals(i, (int) q.element());
347	>	assertEquals(i, (int) q.poll());
348		}
349		try {
350		q.element();
351		shouldThrow();
352	<	} catch (NoSuchElementException success) {
353	<	}
352	>	} catch (NoSuchElementException success) {}
353	>	checkEmpty(q);
354		}
355
356		/**
357	<	* remove removes next element, or throws NSEE if empty
357	>	* remove removes next element, or throws NoSuchElementException if empty
358		*/
359	<	public void testRemove() {
360	<	LinkedTransferQueue q = populatedQueue(SIZE);
359	>	public void testRemove() throws InterruptedException {
360	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
361		for (int i = 0; i < SIZE; ++i) {
362	<	assertEquals(i, ((Integer) q.remove()).intValue());
362	>	assertEquals(i, (int) q.remove());
363		}
364		try {
365		q.remove();
366		shouldThrow();
367	<	} catch (NoSuchElementException success) {
368	<	}
451	<	}
452	<
453	<	/**
454	<	* remove(x) removes x and returns true if present
455	<	*/
456	<	public void testRemoveElement() {
457	<	LinkedTransferQueue q = populatedQueue(SIZE);
458	<	for (int i = 1; i < SIZE; i += 2) {
459	<	assertTrue(q.remove(new Integer(i)));
460	<	}
461	<	for (int i = 0; i < SIZE; i += 2) {
462	<	assertTrue(q.remove(new Integer(i)));
463	<	assertFalse(q.remove(new Integer(i + 1)));
464	<	}
465	<	assertTrue(q.isEmpty());
367	>	} catch (NoSuchElementException success) {}
368	>	checkEmpty(q);
369		}
370
371		/**
372		* An add following remove(x) succeeds
373		*/
374	<	public void testRemoveElementAndAdd() {
375	<	try {
376	<	LinkedTransferQueue q = new LinkedTransferQueue();
377	<	assertTrue(q.add(new Integer(1)));
378	<	assertTrue(q.add(new Integer(2)));
379	<	assertTrue(q.remove(new Integer(1)));
380	<	assertTrue(q.remove(new Integer(2)));
381	<	assertTrue(q.add(new Integer(3)));
479	<	assertTrue(q.take() != null);
480	<	} catch (Exception e) {
481	<	unexpectedException();
482	<	}
374	>	public void testRemoveElementAndAdd() throws InterruptedException {
375	>	LinkedTransferQueue q = new LinkedTransferQueue();
376	>	assertTrue(q.add(one));
377	>	assertTrue(q.add(two));
378	>	assertTrue(q.remove(one));
379	>	assertTrue(q.remove(two));
380	>	assertTrue(q.add(three));
381	>	assertSame(q.take(), three);
382		}
383
384		/**
385		* contains(x) reports true when elements added but not yet removed
386		*/
387		public void testContains() {
388	<	LinkedTransferQueue q = populatedQueue(SIZE);
388	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
389		for (int i = 0; i < SIZE; ++i) {
390	<	assertTrue(q.contains(new Integer(i)));
391	<	q.poll();
392	<	assertFalse(q.contains(new Integer(i)));
390	>	assertTrue(q.contains(i));
391	>	assertEquals(i, (int) q.poll());
392	>	assertFalse(q.contains(i));
393		}
394		}
395
396		/**
397		* clear removes all elements
398		*/
399	<	public void testClear() {
399	>	public void testClear() throws InterruptedException {
400		LinkedTransferQueue q = populatedQueue(SIZE);
502	–	int remainingCapacity = q.remainingCapacity();
401		q.clear();
402	<	assertTrue(q.isEmpty());
403	<	assertEquals(0, q.size());
506	<	assertEquals(remainingCapacity, q.remainingCapacity());
402	>	checkEmpty(q);
403	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
404		q.add(one);
405		assertFalse(q.isEmpty());
406	+	assertEquals(1, q.size());
407		assertTrue(q.contains(one));
408		q.clear();
409	<	assertTrue(q.isEmpty());
409	>	checkEmpty(q);
410		}
411
412		/**
413		* containsAll(c) is true when c contains a subset of elements
414		*/
415		public void testContainsAll() {
416	<	LinkedTransferQueue q = populatedQueue(SIZE);
417	<	LinkedTransferQueue p = new LinkedTransferQueue();
416	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
417	>	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>();
418		for (int i = 0; i < SIZE; ++i) {
419		assertTrue(q.containsAll(p));
420		assertFalse(p.containsAll(q));
421	<	p.add(new Integer(i));
421	>	p.add(i);
422		}
423		assertTrue(p.containsAll(q));
424		}
425
426		/**
427	<	* retainAll(c) retains only those elements of c and reports true if changed
427	>	* retainAll(c) retains only those elements of c and reports true
428	>	* if changed
429		*/
430		public void testRetainAll() {
431		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 545 | Line 444 | public class LinkedTransferQueueTest ext
444		}
445
446		/**
447	<	* removeAll(c) removes only those elements of c and reports true if changed
447	>	* removeAll(c) removes only those elements of c and reports true
448	>	* if changed
449		*/
450		public void testRemoveAll() {
451		for (int i = 1; i < SIZE; ++i) {
#	Line 554 | Line 454 | public class LinkedTransferQueueTest ext
454		assertTrue(q.removeAll(p));
455		assertEquals(SIZE - i, q.size());
456		for (int j = 0; j < i; ++j) {
457	<	Integer I = (Integer) (p.remove());
558	<	assertFalse(q.contains(I));
457	>	assertFalse(q.contains(p.remove()));
458		}
459		}
460		}
461
462		/**
463	<	* toArray contains all elements
463	>	* toArray() contains all elements in FIFO order
464		*/
465		public void testToArray() {
466		LinkedTransferQueue q = populatedQueue(SIZE);
467		Object[] o = q.toArray();
468	<	try {
469	<	for (int i = 0; i < o.length; i++) {
571	<	assertEquals(o[i], q.take());
572	<	}
573	<	} catch (InterruptedException e) {
574	<	unexpectedException();
468	>	for (int i = 0; i < o.length; i++) {
469	>	assertSame(o[i], q.poll());
470		}
471		}
472
473		/**
474	<	* toArray(a) contains all elements
474	>	* toArray(a) contains all elements in FIFO order
475		*/
476		public void testToArray2() {
477	<	LinkedTransferQueue q = populatedQueue(SIZE);
477	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
478		Integer[] ints = new Integer[SIZE];
479	<	ints = (Integer[]) q.toArray(ints);
480	<	try {
481	<	for (int i = 0; i < ints.length; i++) {
482	<	assertEquals(ints[i], q.take());
588	<	}
589	<	} catch (InterruptedException e) {
590	<	unexpectedException();
591	<	}
592	<	}
593	<
594	<	/**
595	<	* toArray(null) throws NPE
596	<	*/
597	<	public void testToArray_BadArg() {
598	<	try {
599	<	LinkedTransferQueue q = populatedQueue(SIZE);
600	<	Object o[] = q.toArray(null);
601	<	shouldThrow();
602	<	} catch (NullPointerException success) {
479	>	Integer[] array = q.toArray(ints);
480	>	assertSame(ints, array);
481	>	for (int i = 0; i < ints.length; i++) {
482	>	assertSame(ints[i], q.poll());
483		}
484		}
485
486		/**
487	<	* toArray with incompatible array type throws CCE
487	>	* toArray(incompatible array type) throws ArrayStoreException
488		*/
489		public void testToArray1_BadArg() {
490	+	LinkedTransferQueue q = populatedQueue(SIZE);
491		try {
492	<	LinkedTransferQueue q = populatedQueue(SIZE);
612	<	Object o[] = q.toArray(new String[10]);
492	>	q.toArray(new String[10]);
493		shouldThrow();
494	<	} catch (ArrayStoreException success) {
615	<	}
494	>	} catch (ArrayStoreException success) {}
495		}
496
497		/**
498		* iterator iterates through all elements
499		*/
500	<	public void testIterator() {
500	>	public void testIterator() throws InterruptedException {
501		LinkedTransferQueue q = populatedQueue(SIZE);
502		Iterator it = q.iterator();
503	<	try {
504	<	while (it.hasNext()) {
505	<	assertEquals(it.next(), q.take());
627	<	}
628	<	} catch (InterruptedException e) {
629	<	unexpectedException();
503	>	int i = 0;
504	>	while (it.hasNext()) {
505	>	assertEquals(it.next(), i++);
506		}
507	+	assertEquals(i, SIZE);
508		}
509
510		/**
511	<	* iterator.remove removes current element
511	>	* iterator.remove() removes current element
512		*/
513		public void testIteratorRemove() {
514		final LinkedTransferQueue q = new LinkedTransferQueue();
#	Line 644 | Line 521 | public class LinkedTransferQueueTest ext
521		it.remove();
522
523		it = q.iterator();
524	<	assertEquals(it.next(), one);
525	<	assertEquals(it.next(), three);
524	>	assertSame(it.next(), one);
525	>	assertSame(it.next(), three);
526		assertFalse(it.hasNext());
527		}
528
#	Line 653 | Line 530 | public class LinkedTransferQueueTest ext
530		* iterator ordering is FIFO
531		*/
532		public void testIteratorOrdering() {
533	<	final LinkedTransferQueue q = new LinkedTransferQueue();
534	<	int remainingCapacity = q.remainingCapacity();
533	>	final LinkedTransferQueue<Integer> q
534	>	= new LinkedTransferQueue<Integer>();
535	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
536		q.add(one);
537		q.add(two);
538		q.add(three);
539	<	assertEquals(remainingCapacity, q.remainingCapacity());
539	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
540		int k = 0;
541	<	for (Iterator it = q.iterator(); it.hasNext();) {
542	<	int i = ((Integer) (it.next())).intValue();
665	<	assertEquals(++k, i);
541	>	for (Integer n : q) {
542	>	assertEquals(++k, (int) n);
543		}
544		assertEquals(3, k);
545		}
#	Line 675 | Line 552 | public class LinkedTransferQueueTest ext
552		q.add(one);
553		q.add(two);
554		q.add(three);
555	<	try {
556	<	for (Iterator it = q.iterator(); it.hasNext();) {
557	<	q.remove();
681	<	it.next();
682	<	}
683	<	} catch (ConcurrentModificationException e) {
684	<	unexpectedException();
555	>	for (Iterator it = q.iterator(); it.hasNext();) {
556	>	q.remove();
557	>	it.next();
558		}
559		assertEquals(0, q.size());
560		}
#	Line 693 | Line 566 | public class LinkedTransferQueueTest ext
566		LinkedTransferQueue q = populatedQueue(SIZE);
567		String s = q.toString();
568		for (int i = 0; i < SIZE; ++i) {
569	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
569	>	assertTrue(s.contains(String.valueOf(i)));
570		}
571		}
572
#	Line 702 | Line 575 | public class LinkedTransferQueueTest ext
575		*/
576		public void testOfferInExecutor() {
577		final LinkedTransferQueue q = new LinkedTransferQueue();
578	<	q.add(one);
706	<	q.add(two);
578	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
579		ExecutorService executor = Executors.newFixedThreadPool(2);
708	–	executor.execute(new Runnable() {
580
581	<	public void run() {
582	<	try {
583	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
584	<	} catch (Exception e) {
585	<	threadUnexpectedException();
586	<	}
587	<	}
588	<	});
589	<
590	<	executor.execute(new Runnable() {
591	<
592	<	public void run() {
722	<	try {
723	<	Thread.sleep(SMALL_DELAY_MS);
724	<	threadAssertEquals(one, q.take());
725	<	} catch (InterruptedException e) {
726	<	threadUnexpectedException();
727	<	}
728	<	}
729	<	});
581	>	executor.execute(new CheckedRunnable() {
582	>	public void realRun() throws InterruptedException {
583	>	threadsStarted.await();
584	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
585	>	}});
586	>
587	>	executor.execute(new CheckedRunnable() {
588	>	public void realRun() throws InterruptedException {
589	>	threadsStarted.await();
590	>	assertSame(one, q.take());
591	>	checkEmpty(q);
592	>	}});
593
594		joinPool(executor);
595		}
596
597		/**
598	<	* poll retrieves elements across Executor threads
598	>	* timed poll retrieves elements across Executor threads
599		*/
600		public void testPollInExecutor() {
601		final LinkedTransferQueue q = new LinkedTransferQueue();
602	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
603		ExecutorService executor = Executors.newFixedThreadPool(2);
740	–	executor.execute(new Runnable() {
604
605	<	public void run() {
606	<	threadAssertNull(q.poll());
607	<	try {
608	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
609	<	threadAssertTrue(q.isEmpty());
610	<	} catch (InterruptedException e) {
611	<	threadUnexpectedException();
612	<	}
613	<	}
614	<	});
615	<
616	<	executor.execute(new Runnable() {
617	<
755	<	public void run() {
756	<	try {
757	<	Thread.sleep(SMALL_DELAY_MS);
758	<	q.put(one);
759	<	} catch (InterruptedException e) {
760	<	threadUnexpectedException();
761	<	}
762	<	}
763	<	});
605	>	executor.execute(new CheckedRunnable() {
606	>	public void realRun() throws InterruptedException {
607	>	assertNull(q.poll());
608	>	threadsStarted.await();
609	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
610	>	checkEmpty(q);
611	>	}});
612	>
613	>	executor.execute(new CheckedRunnable() {
614	>	public void realRun() throws InterruptedException {
615	>	threadsStarted.await();
616	>	q.put(one);
617	>	}});
618
619		joinPool(executor);
620		}
#	Line 768 | Line 622 | public class LinkedTransferQueueTest ext
622		/**
623		* A deserialized serialized queue has same elements in same order
624		*/
625	<	public void testSerialization() {
626	<	LinkedTransferQueue q = populatedQueue(SIZE);
627	<
628	<	try {
629	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
630	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
631	<	out.writeObject(q);
632	<	out.close();
633	<
634	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
635	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
782	<	LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
783	<
784	<	assertEquals(q.size(), r.size());
785	<	while (!q.isEmpty()) {
786	<	assertEquals(q.remove(), r.remove());
787	<	}
788	<	} catch (Exception e) {
789	<	unexpectedException();
790	<	}
791	<	}
792	<
793	<	/**
794	<	* drainTo(null) throws NPE
795	<	*/
796	<	public void testDrainToNull() {
797	<	LinkedTransferQueue q = populatedQueue(SIZE);
798	<	try {
799	<	q.drainTo(null);
800	<	shouldThrow();
801	<	} catch (NullPointerException success) {
802	<	}
803	<	}
804	<
805	<	/**
806	<	* drainTo(this) throws IAE
807	<	*/
808	<	public void testDrainToSelf() {
809	<	LinkedTransferQueue q = populatedQueue(SIZE);
810	<	try {
811	<	q.drainTo(q);
812	<	shouldThrow();
813	<	} catch (IllegalArgumentException success) {
625	>	public void testSerialization() throws Exception {
626	>	Queue x = populatedQueue(SIZE);
627	>	Queue y = serialClone(x);
628	>
629	>	assertNotSame(y, x);
630	>	assertEquals(x.size(), y.size());
631	>	assertEquals(x.toString(), y.toString());
632	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
633	>	while (!x.isEmpty()) {
634	>	assertFalse(y.isEmpty());
635	>	assertEquals(x.remove(), y.remove());
636		}
637	+	assertTrue(y.isEmpty());
638		}
639
640		/**
#	Line 821 | Line 644 | public class LinkedTransferQueueTest ext
644		LinkedTransferQueue q = populatedQueue(SIZE);
645		ArrayList l = new ArrayList();
646		q.drainTo(l);
647	<	assertEquals(q.size(), 0);
648	<	assertEquals(l.size(), SIZE);
647	>	assertEquals(0, q.size());
648	>	assertEquals(SIZE, l.size());
649		for (int i = 0; i < SIZE; ++i) {
650	<	assertEquals(l.get(i), new Integer(i));
650	>	assertEquals(i, l.get(i));
651		}
652		q.add(zero);
653		q.add(one);
#	Line 833 | Line 656 | public class LinkedTransferQueueTest ext
656		assertTrue(q.contains(one));
657		l.clear();
658		q.drainTo(l);
659	<	assertEquals(q.size(), 0);
660	<	assertEquals(l.size(), 2);
659	>	assertEquals(0, q.size());
660	>	assertEquals(2, l.size());
661		for (int i = 0; i < 2; ++i) {
662	<	assertEquals(l.get(i), new Integer(i));
662	>	assertEquals(i, l.get(i));
663		}
664		}
665
666		/**
667	<	* drainTo empties full queue, unblocking a waiting put.
667	>	* drainTo(c) empties full queue, unblocking a waiting put.
668		*/
669	<	public void testDrainToWithActivePut() {
669	>	public void testDrainToWithActivePut() throws InterruptedException {
670		final LinkedTransferQueue q = populatedQueue(SIZE);
671	<	Thread t = new Thread(new Runnable() {
672	<
673	<	public void run() {
674	<	try {
675	<	q.put(new Integer(SIZE + 1));
676	<	} catch (Exception ie) {
677	<	threadUnexpectedException();
678	<	}
679	<	}
680	<	});
681	<	try {
859	<	t.start();
860	<	ArrayList l = new ArrayList();
861	<	q.drainTo(l);
862	<	assertTrue(l.size() >= SIZE);
863	<	for (int i = 0; i < SIZE; ++i) {
864	<	assertEquals(l.get(i), new Integer(i));
865	<	}
866	<	t.join();
867	<	assertTrue(q.size() + l.size() >= SIZE);
868	<	} catch (Exception e) {
869	<	unexpectedException();
870	<	}
871	<	}
872	<
873	<	/**
874	<	* drainTo(null, n) throws NPE
875	<	*/
876	<	public void testDrainToNullN() {
877	<	LinkedTransferQueue q = populatedQueue(SIZE);
878	<	try {
879	<	q.drainTo(null, 0);
880	<	shouldThrow();
881	<	} catch (NullPointerException success) {
882	<	}
883	<	}
884	<
885	<	/**
886	<	* drainTo(this, n) throws IAE
887	<	*/
888	<	public void testDrainToSelfN() {
889	<	LinkedTransferQueue q = populatedQueue(SIZE);
890	<	try {
891	<	q.drainTo(q, 0);
892	<	shouldThrow();
893	<	} catch (IllegalArgumentException success) {
894	<	}
671	>	Thread t = newStartedThread(new CheckedRunnable() {
672	>	public void realRun() {
673	>	q.put(SIZE + 1);
674	>	}});
675	>	ArrayList l = new ArrayList();
676	>	q.drainTo(l);
677	>	assertTrue(l.size() >= SIZE);
678	>	for (int i = 0; i < SIZE; ++i)
679	>	assertEquals(i, l.get(i));
680	>	awaitTermination(t, MEDIUM_DELAY_MS);
681	>	assertTrue(q.size() + l.size() >= SIZE);
682		}
683
684		/**
685	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
685	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
686		*/
687		public void testDrainToN() {
688		LinkedTransferQueue q = new LinkedTransferQueue();
689		for (int i = 0; i < SIZE + 2; ++i) {
690		for (int j = 0; j < SIZE; j++) {
691	<	assertTrue(q.offer(new Integer(j)));
691	>	assertTrue(q.offer(j));
692		}
693		ArrayList l = new ArrayList();
694		q.drainTo(l, i);
695		int k = (i < SIZE) ? i : SIZE;
696	<	assertEquals(l.size(), k);
697	<	assertEquals(q.size(), SIZE - k);
698	<	for (int j = 0; j < k; ++j) {
699	<	assertEquals(l.get(j), new Integer(j));
700	<	}
914	<	while (q.poll() != null);
696	>	assertEquals(k, l.size());
697	>	assertEquals(SIZE - k, q.size());
698	>	for (int j = 0; j < k; ++j)
699	>	assertEquals(j, l.get(j));
700	>	do {} while (q.poll() != null);
701		}
702		}
703
704		/**
705	<	* poll and take should decrement the waiting consumer count
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();
934	<	}
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		}
733
734		/**
735	<	* Inserts null into transfer throws NPE
735	>	* transfer(null) throws NullPointerException
736		*/
737	<	public void testTransfer1() {
737	>	public void testTransfer1() throws InterruptedException {
738		try {
739		LinkedTransferQueue q = new LinkedTransferQueue();
740		q.transfer(null);
741		shouldThrow();
742	<	} catch (NullPointerException ex) {
954	<	} catch (Exception ex) {
955	<	this.unexpectedException();
956	<	}
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.
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();
973	<	}
974	<	}
975	<	}).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) {
983	<	this.unexpectedException();
984	<	}
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 attempt to transfer in fifo order and continue
771	<	* waiting if the element being transfered is not polled or taken
772	<	*/
773	<	public void testTransfer3() {
774	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
775	<	new Thread(new Runnable() {
776	<	public void run() {
777	<	try {
778	<	Integer i;
779	<	q.transfer((i = new Integer(SIZE + 1)));
780	<	threadAssertTrue(!q.contains(i));
781	<	threadAssertEquals(1, q.size());
782	<	} catch (Exception ex) {
783	<	threadUnexpectedException();
784	<	}
785	<	}
786	<	}).start();
787	<	Thread interruptedThread =
788	<	new Thread(new Runnable() {
789	<	public void run() {
790	<	try {
791	<	q.transfer(new Integer(SIZE));
792	<	threadShouldThrow();
793	<	} catch (InterruptedException ex) {
794	<	}
795	<	}
796	<	});
797	<	interruptedThread.start();
798	<	try {
799	<	Thread.sleep(LONG_DELAY_MS);
1018	<	assertEquals(2, q.size());
1019	<	q.poll();
1020	<	Thread.sleep(LONG_DELAY_MS);
1021	<	interruptedThread.interrupt();
1022	<	assertEquals(1, q.size());
1023	<	} catch (Exception ex) {
1024	<	this.unexpectedException();
1025	<	}
770	>	* transfer waits until a poll occurs, and then transfers in fifo order
771	>	*/
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 will wait as long as a poll or take occurs if one does occur
804	<	* the waiting is finished and the thread that tries to poll/take
1031	<	* wins in retrieving the element
803	>	* transfer waits until a poll occurs, at which point the polling
804	>	* thread returns the element
805		*/
806	<	public void testTransfer4() {
806	>	public void testTransfer4() throws InterruptedException {
807		final LinkedTransferQueue q = new LinkedTransferQueue();
1035	–	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());
1051	<	} catch (Exception ex) {
1052	<	this.unexpectedException();
1053	<	}
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		/**
826	<	* Insert null into tryTransfer throws NPE
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) {
1065	<	} catch (Exception ex) {
1066	<	this.unexpectedException();
1067	<	}
855	>	shouldThrow();
856	>	} catch (NullPointerException success) {}
857		}
858
859		/**
860	<	* tryTransfer returns false and does not enqueue if there are no consumers
861	<	* waiting to poll or take.
860	>	* tryTransfer returns false and does not enqueue if there are no
861	>	* consumers waiting to poll or take.
862		*/
863	<	public void testTryTransfer2() {
864	<	try {
865	<	final LinkedTransferQueue q = new LinkedTransferQueue();
866	<	assertFalse(q.tryTransfer(new Object()));
867	<	assertEquals(0, q.size());
1079	<	} catch (Exception ex) {
1080	<	this.unexpectedException();
1081	<	}
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		/**
871	<	* if there is a consumer waiting poll or take tryTransfer returns
872	<	* true while enqueueing object
871	>	* If there is a consumer waiting in timed poll, tryTransfer
872	>	* returns true while successfully transfering object.
873		*/
874	<	public void testTryTransfer3() {
875	<	try {
876	<	final LinkedTransferQueue q = new LinkedTransferQueue();
1091	<	new Thread(new Runnable() {
874	>	public void testTryTransfer3() throws InterruptedException {
875	>	final Object hotPotato = new Object();
876	>	final LinkedTransferQueue q = new LinkedTransferQueue();
877
878	<	public void run() {
879	<	try {
880	<	threadAssertTrue(q.hasWaitingConsumer());
881	<	threadAssertTrue(q.tryTransfer(new Object()));
882	<	} catch (Exception ex) {
883	<	threadUnexpectedException();
884	<	}
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	<	}
893	<	}).start();
894	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
895	<	assertTrue(q.isEmpty());
896	<	} catch (Exception ex) {
897	<	this.unexpectedException();
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	>	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
1112	<	* interrupted exception
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
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();
1140	–	try {
1141	–	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) {
1154	<	this.unexpectedException();
1155	<	}
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		/**
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));
1165	<	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());
1180	<	assertEquals(new Integer(five), q.poll());
1181	<	assertTrue(q.isEmpty());
1182	<	} catch (Exception ex) {
1183	<	this.unexpectedException();
1184	<	}
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 successive poll is null
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();
1202	<	}
1203	<	}
1204	<	}).start();
1205	<	try {
1206	<	assertEquals(1, q.size());
1207	<	assertEquals(new Integer(four), q.poll());
1208	<	Thread.sleep(MEDIUM_DELAY_MS);
1209	<	assertNull(q.poll());
1210	<	} catch (Exception ex) {
1211	<	this.unexpectedException();
1212	<	}
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();
1220	<	for (int i = 0; i <
1221	<	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		}
1224	–
1013		assertFalse(q.isEmpty());
1226	–	assertEquals(remainingCapacity, q.remainingCapacity());
1227	–	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() {
1243	<	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