ViewVC Help

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

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

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.2 by jsr166, Fri Jul 31 23:37:31 2009 UTC vs.
Revision 1.55 by jsr166, Wed Dec 31 19:05:43 2014 UTC

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

Diff Legend

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