ViewVC Help

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

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

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

Diff Legend

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