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

Diff Legend

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