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.7 by jsr166, Mon Aug 3 19:07:51 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 18 | Line 17 | import java.util.ConcurrentModificationE
17		import java.util.Iterator;
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
#	Line 31 | Line 31 | public class LinkedTransferQueueTest ext
31		return new TestSuite(LinkedTransferQueueTest.class);
32		}
33
34	<	/*
35	<	*Constructor builds new queue with size being zero and empty being true
34	>	/**
35	>	* Constructor builds new queue with size being zero and empty
36	>	* being true
37		*/
38		public void testConstructor1() {
39		assertEquals(0, new LinkedTransferQueue().size());
40		assertTrue(new LinkedTransferQueue().isEmpty());
41		}
42
43	<	/*
44	<	* Initizialing constructor with null collection throws NPE
43	>	/**
44	>	* Initializing constructor with null collection throws
45	>	* NullPointerException
46		*/
47		public void testConstructor2() {
48		try {
#	Line 51 | Line 53 | public class LinkedTransferQueueTest ext
53		}
54
55		/**
56	<	* Initializing from Collection of null elements throws NPE
56	>	* Initializing from Collection of null elements throws
57	>	* NullPointerException
58		*/
59		public void testConstructor3() {
60		try {
61		Integer[] ints = new Integer[SIZE];
62	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
62	>	new LinkedTransferQueue(Arrays.asList(ints));
63		shouldThrow();
64		} catch (NullPointerException success) {
65		}
66		}
67	<	/*
67	>
68	>	/**
69		* Initializing constructor with a collection containing some null elements
70	<	* throws NPE
70	>	* throws NullPointerException
71		*/
68	–
72		public void testConstructor4() {
73		try {
74		Integer[] ints = new Integer[SIZE];
75		for (int i = 0; i < SIZE - 1; ++i) {
76	<	ints[i] = new Integer(i);
76	>	ints[i] = i;
77		}
78	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
78	>	new LinkedTransferQueue(Arrays.asList(ints));
79		shouldThrow();
80		} catch (NullPointerException success) {
81		}
82		}
83
84	<	/*
84	>	/**
85		* Queue contains all elements of the collection it is initialized by
86		*/
87		public void testConstructor5() {
88		try {
89		Integer[] ints = new Integer[SIZE];
90		for (int i = 0; i < SIZE; ++i) {
91	<	ints[i] = new Integer(i);
91	>	ints[i] = i;
92		}
93	<	LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints));
93	>	LinkedTransferQueue q
94	>	= new LinkedTransferQueue(Arrays.asList(ints));
95		for (int i = 0; i < SIZE; ++i) {
96		assertEquals(ints[i], q.poll());
97		}
#	Line 99 | Line 103 | public class LinkedTransferQueueTest ext
103		* Remaining capacity never decrease nor increase on add or remove
104		*/
105		public void testRemainingCapacity() {
106	<	LinkedTransferQueue q = populatedQueue(SIZE);
103	<	int remainingCapacity = q.remainingCapacity();
106	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
107		for (int i = 0; i < SIZE; ++i) {
108	<	assertEquals(remainingCapacity, q.remainingCapacity());
108	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
109		assertEquals(SIZE - i, q.size());
110		q.remove();
111		}
112		for (int i = 0; i < SIZE; ++i) {
113	<	assertEquals(remainingCapacity, q.remainingCapacity());
113	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
114		assertEquals(i, q.size());
115	<	q.add(new Integer(i));
115	>	q.add(i);
116		}
117		}
118
119		/**
120	<	* offer(null) throws NPE
120	>	* offer(null) throws NullPointerException
121		*/
122		public void testOfferNull() {
123		try {
#	Line 126 | Line 129 | public class LinkedTransferQueueTest ext
129		}
130
131		/**
132	<	* add(null) throws NPE
132	>	* add(null) throws NullPointerException
133		*/
134		public void testAddNull() {
135		try {
#	Line 138 | Line 141 | public class LinkedTransferQueueTest ext
141		}
142
143		/**
144	<	* addAll(null) throws NPE
144	>	* addAll(null) throws NullPointerException
145		*/
146		public void testAddAll1() {
147		try {
#	Line 150 | Line 153 | public class LinkedTransferQueueTest ext
153		}
154
155		/**
156	<	* addAll(this) throws IAE
156	>	* addAll(this) throws IllegalArgumentException
157		*/
158		public void testAddAllSelf() {
159		try {
#	Line 162 | Line 165 | public class LinkedTransferQueueTest ext
165		}
166
167		/**
168	<	* addAll of a collection with null elements throws NPE
168	>	* addAll of a collection with null elements throws NullPointerException
169		*/
170		public void testAddAll2() {
171		try {
#	Line 175 | Line 178 | public class LinkedTransferQueueTest ext
178		}
179
180		/**
181	<	* addAll of a collection with any null elements throws NPE after
182	<	* possibly adding some elements
181	>	* addAll of a collection with any null elements throws
182	>	* NullPointerException after possibly adding some elements
183		*/
184		public void testAddAll3() {
185		try {
186		LinkedTransferQueue q = new LinkedTransferQueue();
187		Integer[] ints = new Integer[SIZE];
188		for (int i = 0; i < SIZE - 1; ++i) {
189	<	ints[i] = new Integer(i);
189	>	ints[i] = i;
190		}
191		q.addAll(Arrays.asList(ints));
192		shouldThrow();
#	Line 195 | Line 198 | public class LinkedTransferQueueTest ext
198		* Queue contains all elements, in traversal order, of successful addAll
199		*/
200		public void testAddAll5() {
201	<	try {
202	<	Integer[] empty = new Integer[0];
203	<	Integer[] ints = new Integer[SIZE];
204	<	for (int i = 0; i < SIZE; ++i) {
205	<	ints[i] = new Integer(i);
206	<	}
207	<	LinkedTransferQueue q = new LinkedTransferQueue();
208	<	assertFalse(q.addAll(Arrays.asList(empty)));
209	<	assertTrue(q.addAll(Arrays.asList(ints)));
210	<	for (int i = 0; i < SIZE; ++i) {
208	<	assertEquals(ints[i], q.poll());
209	<	}
210	<	} finally {
201	>	Integer[] empty = new Integer[0];
202	>	Integer[] ints = new Integer[SIZE];
203	>	for (int i = 0; i < SIZE; ++i) {
204	>	ints[i] = i;
205	>	}
206	>	LinkedTransferQueue q = new LinkedTransferQueue();
207	>	assertFalse(q.addAll(Arrays.asList(empty)));
208	>	assertTrue(q.addAll(Arrays.asList(ints)));
209	>	for (int i = 0; i < SIZE; ++i) {
210	>	assertEquals(ints[i], q.poll());
211		}
212		}
213
214		/**
215	<	* put(null) throws NPE
215	>	* put(null) throws NullPointerException
216		*/
217	<	public void testPutNull() {
217	>	public void testPutNull() throws InterruptedException {
218		try {
219		LinkedTransferQueue q = new LinkedTransferQueue();
220		q.put(null);
221		shouldThrow();
222	<	} catch (NullPointerException success) {
223	<	} catch (Exception ie) {
224	<	unexpectedException();
225	<	}
222	>	} catch (NullPointerException success) {}
223		}
224
225		/**
226		* all elements successfully put are contained
227		*/
228		public void testPut() {
229	<	try {
230	<	LinkedTransferQueue q = new LinkedTransferQueue();
231	<	for (int i = 0; i < SIZE; ++i) {
232	<	Integer I = new Integer(i);
236	<	q.put(I);
237	<	assertTrue(q.contains(I));
238	<	}
239	<	} catch (Exception ie) {
240	<	unexpectedException();
229	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
230	>	for (int i = 0; i < SIZE; ++i) {
231	>	q.put(i);
232	>	assertTrue(q.contains(i));
233		}
234	+	assertEquals(q.size(), SIZE);
235		}
236
237		/**
238		* take retrieves elements in FIFO order
239		*/
240	<	public void testTake() {
241	<	try {
242	<	LinkedTransferQueue q = populatedQueue(SIZE);
243	<	for (int i = 0; i < SIZE; ++i) {
251	<	assertEquals(i, ((Integer) q.take()).intValue());
252	<	}
253	<	} catch (InterruptedException e) {
254	<	unexpectedException();
240	>	public void testTake() throws InterruptedException {
241	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
242	>	for (int i = 0; i < SIZE; ++i) {
243	>	assertEquals(i, (int) q.take());
244		}
245		}
246
247		/**
248		* take blocks interruptibly when empty
249		*/
250	<	public void testTakeFromEmpty() {
250	>	public void testTakeFromEmpty() throws InterruptedException {
251		final LinkedTransferQueue q = new LinkedTransferQueue();
252	<	Thread t = new Thread(new Runnable() {
253	<
254	<	public void run() {
255	<	try {
256	<	q.take();
257	<	threadShouldThrow();
258	<	} catch (InterruptedException success) {
259	<	}
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	<	}
252	>	Thread t = new Thread(new CheckedInterruptedRunnable() {
253	>	void realRun() throws InterruptedException {
254	>	q.take();
255	>	}});
256	>	t.start();
257	>	Thread.sleep(SHORT_DELAY_MS);
258	>	t.interrupt();
259	>	t.join();
260		}
261	<	/*
261	>
262	>	/**
263		* Take removes existing elements until empty, then blocks interruptibly
264		*/
265	<
266	<	public void testBlockingTake() {
267	<	Thread t = new Thread(new Runnable() {
268	<
269	<	public void run() {
270	<	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) {
265	>	public void testBlockingTake() throws InterruptedException {
266	>	Thread t = new Thread(new CheckedInterruptedRunnable() {
267	>	void realRun() throws InterruptedException {
268	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
269	>	for (int i = 0; i < SIZE; ++i) {
270	>	threadAssertEquals(i, (int) q.take());
271		}
272	<	}
273	<	});
272	>	q.take();
273	>	}});
274		t.start();
275	<	try {
276	<	Thread.sleep(SHORT_DELAY_MS);
277	<	t.interrupt();
305	<	t.join();
306	<	} catch (InterruptedException ie) {
307	<	unexpectedException();
308	<	}
275	>	Thread.sleep(SHORT_DELAY_MS);
276	>	t.interrupt();
277	>	t.join();
278		}
279
280		/**
281		* poll succeeds unless empty
282		*/
283		public void testPoll() {
284	<	LinkedTransferQueue q = populatedQueue(SIZE);
284	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
285		for (int i = 0; i < SIZE; ++i) {
286	<	assertEquals(i, ((Integer) q.poll()).intValue());
286	>	assertEquals(i, (int) q.poll());
287		}
288		assertNull(q.poll());
289		}
#	Line 322 | Line 291 | public class LinkedTransferQueueTest ext
291		/**
292		* timed pool with zero timeout succeeds when non-empty, else times out
293		*/
294	<	public void testTimedPoll0() {
295	<	try {
296	<	LinkedTransferQueue q = populatedQueue(SIZE);
297	<	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();
294	>	public void testTimedPoll0() throws InterruptedException {
295	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
296	>	for (int i = 0; i < SIZE; ++i) {
297	>	assertEquals(i, (int) q.poll(0, MILLISECONDS));
298		}
299	+	assertNull(q.poll(0, MILLISECONDS));
300		}
301
302		/**
303		* timed pool with nonzero timeout succeeds when non-empty, else times out
304		*/
305	<	public void testTimedPoll() {
306	<	try {
307	<	LinkedTransferQueue q = populatedQueue(SIZE);
308	<	for (int i = 0; i < SIZE; ++i) {
344	<	assertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
345	<	}
346	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
347	<	} catch (InterruptedException e) {
348	<	unexpectedException();
305	>	public void testTimedPoll() throws InterruptedException {
306	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
307	>	for (int i = 0; i < SIZE; ++i) {
308	>	assertEquals(i, (int) q.poll(SHORT_DELAY_MS, MILLISECONDS));
309		}
310	+	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
311		}
312
313		/**
314		* Interrupted timed poll throws InterruptedException instead of
315		* returning timeout status
316		*/
317	<	public void testInterruptedTimedPoll() {
318	<	Thread t = new Thread(new Runnable() {
319	<
320	<	public void run() {
321	<	try {
322	<	LinkedTransferQueue q = populatedQueue(SIZE);
323	<	for (int i = 0; i < SIZE; ++i) {
363	<	threadAssertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
364	<	}
365	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
366	<	} catch (InterruptedException success) {
317	>	public void testInterruptedTimedPoll() throws InterruptedException {
318	>	Thread t = new Thread(new CheckedInterruptedRunnable() {
319	>	void realRun() throws InterruptedException {
320	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
321	>	for (int i = 0; i < SIZE; ++i) {
322	>	threadAssertEquals(i, (int) q.poll(SHORT_DELAY_MS,
323	>	MILLISECONDS));
324		}
325	<	}
326	<	});
325	>	q.poll(SHORT_DELAY_MS, MILLISECONDS);
326	>	}});
327		t.start();
328	<	try {
329	<	Thread.sleep(SHORT_DELAY_MS);
330	<	t.interrupt();
374	<	t.join();
375	<	} catch (InterruptedException ie) {
376	<	unexpectedException();
377	<	}
328	>	Thread.sleep(SHORT_DELAY_MS);
329	>	t.interrupt();
330	>	t.join();
331		}
332
333		/**
334	<	*  timed poll before a delayed offer fails; after offer succeeds;
335	<	*  on interruption throws
334	>	* timed poll before a delayed offer fails; after offer succeeds;
335	>	* on interruption throws
336		*/
337	<	public void testTimedPollWithOffer() {
337	>	public void testTimedPollWithOffer() throws InterruptedException {
338		final LinkedTransferQueue q = new LinkedTransferQueue();
339	<	Thread t = new Thread(new Runnable() {
340	<
341	<	public void run() {
342	<	try {
343	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
344	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
345	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
346	<	threadShouldThrow();
347	<	} catch (InterruptedException success) {
348	<	}
349	<	}
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	<	}
339	>	Thread t = new Thread(new CheckedInterruptedRunnable() {
340	>	void realRun() throws InterruptedException {
341	>	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
342	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
343	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
344	>	}});
345	>	t.start();
346	>	Thread.sleep(SMALL_DELAY_MS);
347	>	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
348	>	t.interrupt();
349	>	t.join();
350		}
351
352		/**
353		* peek returns next element, or null if empty
354		*/
355		public void testPeek() {
356	<	LinkedTransferQueue q = populatedQueue(SIZE);
356	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
357		for (int i = 0; i < SIZE; ++i) {
358	<	assertEquals(i, ((Integer) q.peek()).intValue());
359	<	q.poll();
358	>	assertEquals(i, (int) q.peek());
359	>	assertEquals(i, (int) q.poll());
360		assertTrue(q.peek() == null ||
361	<	i != ((Integer) q.peek()).intValue());
361	>	i != (int) q.peek());
362		}
363		assertNull(q.peek());
364		}
365
366		/**
367	<	* element returns next element, or throws NSEE if empty
367	>	* element returns next element, or throws NoSuchElementException if empty
368		*/
369		public void testElement() {
370	<	LinkedTransferQueue q = populatedQueue(SIZE);
370	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
371		for (int i = 0; i < SIZE; ++i) {
372	<	assertEquals(i, ((Integer) q.element()).intValue());
373	<	q.poll();
372	>	assertEquals(i, (int) q.element());
373	>	assertEquals(i, (int) q.poll());
374		}
375		try {
376		q.element();
#	Line 437 | Line 380 | public class LinkedTransferQueueTest ext
380		}
381
382		/**
383	<	* remove removes next element, or throws NSEE if empty
383	>	* remove removes next element, or throws NoSuchElementException if empty
384		*/
385		public void testRemove() {
386	<	LinkedTransferQueue q = populatedQueue(SIZE);
386	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
387		for (int i = 0; i < SIZE; ++i) {
388	<	assertEquals(i, ((Integer) q.remove()).intValue());
388	>	assertEquals(i, (int) q.remove());
389		}
390		try {
391		q.remove();
#	Line 457 | Line 400 | public class LinkedTransferQueueTest ext
400		public void testRemoveElement() {
401		LinkedTransferQueue q = populatedQueue(SIZE);
402		for (int i = 1; i < SIZE; i += 2) {
403	<	assertTrue(q.remove(new Integer(i)));
403	>	assertTrue(q.remove(i));
404		}
405		for (int i = 0; i < SIZE; i += 2) {
406	<	assertTrue(q.remove(new Integer(i)));
407	<	assertFalse(q.remove(new Integer(i + 1)));
406	>	assertTrue(q.remove(i));
407	>	assertFalse(q.remove(i + 1));
408		}
409		assertTrue(q.isEmpty());
410		}
#	Line 469 | Line 412 | public class LinkedTransferQueueTest ext
412		/**
413		* An add following remove(x) succeeds
414		*/
415	<	public void testRemoveElementAndAdd() {
416	<	try {
417	<	LinkedTransferQueue q = new LinkedTransferQueue();
418	<	assertTrue(q.add(new Integer(1)));
419	<	assertTrue(q.add(new Integer(2)));
420	<	assertTrue(q.remove(new Integer(1)));
421	<	assertTrue(q.remove(new Integer(2)));
422	<	assertTrue(q.add(new Integer(3)));
480	<	assertTrue(q.take() != null);
481	<	} catch (Exception e) {
482	<	unexpectedException();
483	<	}
415	>	public void testRemoveElementAndAdd() throws InterruptedException {
416	>	LinkedTransferQueue q = new LinkedTransferQueue();
417	>	assertTrue(q.add(one));
418	>	assertTrue(q.add(two));
419	>	assertTrue(q.remove(one));
420	>	assertTrue(q.remove(two));
421	>	assertTrue(q.add(three));
422	>	assertTrue(q.take() != null);
423		}
424
425		/**
426		* contains(x) reports true when elements added but not yet removed
427		*/
428		public void testContains() {
429	<	LinkedTransferQueue q = populatedQueue(SIZE);
429	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
430		for (int i = 0; i < SIZE; ++i) {
431	<	assertTrue(q.contains(new Integer(i)));
432	<	q.poll();
433	<	assertFalse(q.contains(new Integer(i)));
431	>	assertTrue(q.contains(i));
432	>	assertEquals(i, (int) q.poll());
433	>	assertFalse(q.contains(i));
434		}
435		}
436
#	Line 500 | Line 439 | public class LinkedTransferQueueTest ext
439		*/
440		public void testClear() {
441		LinkedTransferQueue q = populatedQueue(SIZE);
503	–	int remainingCapacity = q.remainingCapacity();
442		q.clear();
443		assertTrue(q.isEmpty());
444		assertEquals(0, q.size());
445	<	assertEquals(remainingCapacity, q.remainingCapacity());
445	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
446		q.add(one);
447		assertFalse(q.isEmpty());
448		assertTrue(q.contains(one));
#	Line 516 | Line 454 | public class LinkedTransferQueueTest ext
454		* containsAll(c) is true when c contains a subset of elements
455		*/
456		public void testContainsAll() {
457	<	LinkedTransferQueue q = populatedQueue(SIZE);
458	<	LinkedTransferQueue p = new LinkedTransferQueue();
457	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
458	>	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>();
459		for (int i = 0; i < SIZE; ++i) {
460		assertTrue(q.containsAll(p));
461		assertFalse(p.containsAll(q));
462	<	p.add(new Integer(i));
462	>	p.add(i);
463		}
464		assertTrue(p.containsAll(q));
465		}
466
467		/**
468	<	* retainAll(c) retains only those elements of c and reports true if changed
468	>	* retainAll(c) retains only those elements of c and reports true
469	>	* if changed
470		*/
471		public void testRetainAll() {
472		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 546 | Line 485 | public class LinkedTransferQueueTest ext
485		}
486
487		/**
488	<	* removeAll(c) removes only those elements of c and reports true if changed
488	>	* removeAll(c) removes only those elements of c and reports true
489	>	* if changed
490		*/
491		public void testRemoveAll() {
492		for (int i = 1; i < SIZE; ++i) {
#	Line 555 | Line 495 | public class LinkedTransferQueueTest ext
495		assertTrue(q.removeAll(p));
496		assertEquals(SIZE - i, q.size());
497		for (int j = 0; j < i; ++j) {
498	<	Integer I = (Integer) (p.remove());
559	<	assertFalse(q.contains(I));
498	>	assertFalse(q.contains(p.remove()));
499		}
500		}
501		}
#	Line 564 | Line 503 | public class LinkedTransferQueueTest ext
503		/**
504		* toArray contains all elements
505		*/
506	<	public void testToArray() {
506	>	public void testToArray() throws InterruptedException {
507		LinkedTransferQueue q = populatedQueue(SIZE);
508		Object[] o = q.toArray();
509	<	try {
510	<	for (int i = 0; i < o.length; i++) {
572	<	assertEquals(o[i], q.take());
573	<	}
574	<	} catch (InterruptedException e) {
575	<	unexpectedException();
509	>	for (int i = 0; i < o.length; i++) {
510	>	assertEquals(o[i], q.take());
511		}
512		}
513
514		/**
515		* toArray(a) contains all elements
516		*/
517	<	public void testToArray2() {
518	<	LinkedTransferQueue q = populatedQueue(SIZE);
517	>	public void testToArray2() throws InterruptedException {
518	>	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
519		Integer[] ints = new Integer[SIZE];
520	<	ints = (Integer[]) q.toArray(ints);
521	<	try {
522	<	for (int i = 0; i < ints.length; i++) {
588	<	assertEquals(ints[i], q.take());
589	<	}
590	<	} catch (InterruptedException e) {
591	<	unexpectedException();
520	>	ints = q.toArray(ints);
521	>	for (int i = 0; i < ints.length; i++) {
522	>	assertEquals(ints[i], q.take());
523		}
524		}
525
526		/**
527	<	* toArray(null) throws NPE
527	>	* toArray(null) throws NullPointerException
528		*/
529		public void testToArray_BadArg() {
530		try {
#	Line 619 | Line 550 | public class LinkedTransferQueueTest ext
550		/**
551		* iterator iterates through all elements
552		*/
553	<	public void testIterator() {
553	>	public void testIterator() throws InterruptedException {
554		LinkedTransferQueue q = populatedQueue(SIZE);
555		Iterator it = q.iterator();
556	<	try {
557	<	while (it.hasNext()) {
627	<	assertEquals(it.next(), q.take());
628	<	}
629	<	} catch (InterruptedException e) {
630	<	unexpectedException();
556	>	while (it.hasNext()) {
557	>	assertEquals(it.next(), q.take());
558		}
559		}
560
#	Line 654 | Line 581 | public class LinkedTransferQueueTest ext
581		* iterator ordering is FIFO
582		*/
583		public void testIteratorOrdering() {
584	<	final LinkedTransferQueue q = new LinkedTransferQueue();
585	<	int remainingCapacity = q.remainingCapacity();
584	>	final LinkedTransferQueue<Integer> q
585	>	= new LinkedTransferQueue<Integer>();
586	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
587		q.add(one);
588		q.add(two);
589		q.add(three);
590	<	assertEquals(remainingCapacity, q.remainingCapacity());
590	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
591		int k = 0;
592	<	for (Iterator it = q.iterator(); it.hasNext();) {
593	<	int i = ((Integer) (it.next())).intValue();
666	<	assertEquals(++k, i);
592	>	for (Integer n : q) {
593	>	assertEquals(++k, (int) n);
594		}
595		assertEquals(3, k);
596		}
#	Line 676 | Line 603 | public class LinkedTransferQueueTest ext
603		q.add(one);
604		q.add(two);
605		q.add(three);
606	<	try {
607	<	for (Iterator it = q.iterator(); it.hasNext();) {
608	<	q.remove();
682	<	it.next();
683	<	}
684	<	} catch (ConcurrentModificationException e) {
685	<	unexpectedException();
606	>	for (Iterator it = q.iterator(); it.hasNext();) {
607	>	q.remove();
608	>	it.next();
609		}
610		assertEquals(0, q.size());
611		}
#	Line 706 | Line 629 | public class LinkedTransferQueueTest ext
629		q.add(one);
630		q.add(two);
631		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	–	});
632
633	<	executor.execute(new Runnable() {
634	<
635	<	public void run() {
636	<	try {
637	<	Thread.sleep(SMALL_DELAY_MS);
638	<	threadAssertEquals(one, q.take());
639	<	} catch (InterruptedException e) {
640	<	threadUnexpectedException();
641	<	}
642	<	}
643	<	});
633	>	executor.execute(new CheckedRunnable() {
634	>	void realRun() {
635	>	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS,
636	>	MILLISECONDS));
637	>	}});
638	>
639	>	executor.execute(new CheckedRunnable() {
640	>	void realRun() throws InterruptedException {
641	>	Thread.sleep(SMALL_DELAY_MS);
642	>	threadAssertEquals(one, q.take());
643	>	}});
644
645		joinPool(executor);
646		}
#	Line 738 | Line 651 | public class LinkedTransferQueueTest ext
651		public void testPollInExecutor() {
652		final LinkedTransferQueue q = new LinkedTransferQueue();
653		ExecutorService executor = Executors.newFixedThreadPool(2);
741	–	executor.execute(new Runnable() {
654
655	<	public void run() {
655	>	executor.execute(new CheckedRunnable() {
656	>	void realRun() throws InterruptedException {
657		threadAssertNull(q.poll());
658	<	try {
659	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
660	<	threadAssertTrue(q.isEmpty());
661	<	} catch (InterruptedException e) {
662	<	threadUnexpectedException();
663	<	}
664	<	}
665	<	});
666	<
667	<	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	<	});
658	>	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS,
659	>	MILLISECONDS));
660	>	threadAssertTrue(q.isEmpty());
661	>	}});
662	>
663	>	executor.execute(new CheckedRunnable() {
664	>	void realRun() throws InterruptedException {
665	>	Thread.sleep(SMALL_DELAY_MS);
666	>	q.put(one);
667	>	}});
668
669		joinPool(executor);
670		}
#	Line 769 | Line 672 | public class LinkedTransferQueueTest ext
672		/**
673		* A deserialized serialized queue has same elements in same order
674		*/
675	<	public void testSerialization() {
675	>	public void testSerialization() throws Exception {
676		LinkedTransferQueue q = populatedQueue(SIZE);
677
678	<	try {
679	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
680	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
681	<	out.writeObject(q);
682	<	out.close();
683	<
684	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
685	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
686	<	LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
687	<
688	<	assertEquals(q.size(), r.size());
689	<	while (!q.isEmpty()) {
690	<	assertEquals(q.remove(), r.remove());
691	<	}
692	<	} catch (Exception e) {
790	<	unexpectedException();
678	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
679	>	ObjectOutputStream out
680	>	= new ObjectOutputStream(new BufferedOutputStream(bout));
681	>	out.writeObject(q);
682	>	out.close();
683	>
684	>	ByteArrayInputStream bin
685	>	= new ByteArrayInputStream(bout.toByteArray());
686	>	ObjectInputStream in
687	>	= new ObjectInputStream(new BufferedInputStream(bin));
688	>	LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
689	>
690	>	assertEquals(q.size(), r.size());
691	>	while (!q.isEmpty()) {
692	>	assertEquals(q.remove(), r.remove());
693		}
694		}
695
696		/**
697	<	* drainTo(null) throws NPE
697	>	* drainTo(null) throws NullPointerException
698		*/
699		public void testDrainToNull() {
700		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 804 | Line 706 | public class LinkedTransferQueueTest ext
706		}
707
708		/**
709	<	* drainTo(this) throws IAE
709	>	* drainTo(this) throws IllegalArgumentException
710		*/
711		public void testDrainToSelf() {
712		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 825 | Line 727 | public class LinkedTransferQueueTest ext
727		assertEquals(q.size(), 0);
728		assertEquals(l.size(), SIZE);
729		for (int i = 0; i < SIZE; ++i) {
730	<	assertEquals(l.get(i), new Integer(i));
730	>	assertEquals(l.get(i), i);
731		}
732		q.add(zero);
733		q.add(one);
#	Line 837 | Line 739 | public class LinkedTransferQueueTest ext
739		assertEquals(q.size(), 0);
740		assertEquals(l.size(), 2);
741		for (int i = 0; i < 2; ++i) {
742	<	assertEquals(l.get(i), new Integer(i));
742	>	assertEquals(l.get(i), i);
743		}
744		}
745
746		/**
747		* drainTo empties full queue, unblocking a waiting put.
748		*/
749	<	public void testDrainToWithActivePut() {
749	>	public void testDrainToWithActivePut() throws InterruptedException {
750		final LinkedTransferQueue q = populatedQueue(SIZE);
751	<	Thread t = new Thread(new Runnable() {
752	<
753	<	public void run() {
754	<	try {
755	<	q.put(new Integer(SIZE + 1));
756	<	} catch (Exception ie) {
757	<	threadUnexpectedException();
758	<	}
759	<	}
760	<	});
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();
751	>	Thread t = new Thread(new CheckedRunnable() {
752	>	void realRun() {
753	>	q.put(SIZE + 1);
754	>	}});
755	>	t.start();
756	>	ArrayList l = new ArrayList();
757	>	q.drainTo(l);
758	>	assertTrue(l.size() >= SIZE);
759	>	for (int i = 0; i < SIZE; ++i) {
760	>	assertEquals(l.get(i), i);
761		}
762	+	t.join();
763	+	assertTrue(q.size() + l.size() >= SIZE);
764		}
765
766		/**
767	<	* drainTo(null, n) throws NPE
767	>	* drainTo(null, n) throws NullPointerException
768		*/
769		public void testDrainToNullN() {
770		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 884 | Line 776 | public class LinkedTransferQueueTest ext
776		}
777
778		/**
779	<	* drainTo(this, n) throws IAE
779	>	* drainTo(this, n) throws IllegalArgumentException
780		*/
781		public void testDrainToSelfN() {
782		LinkedTransferQueue q = populatedQueue(SIZE);
#	Line 902 | Line 794 | public class LinkedTransferQueueTest ext
794		LinkedTransferQueue q = new LinkedTransferQueue();
795		for (int i = 0; i < SIZE + 2; ++i) {
796		for (int j = 0; j < SIZE; j++) {
797	<	assertTrue(q.offer(new Integer(j)));
797	>	assertTrue(q.offer(j));
798		}
799		ArrayList l = new ArrayList();
800		q.drainTo(l, i);
#	Line 910 | Line 802 | public class LinkedTransferQueueTest ext
802		assertEquals(l.size(), k);
803		assertEquals(q.size(), SIZE - k);
804		for (int j = 0; j < k; ++j) {
805	<	assertEquals(l.get(j), new Integer(j));
805	>	assertEquals(l.get(j), j);
806		}
807	<	while (q.poll() != null);
807	>	while (q.poll() != null)
808	>	;
809		}
810		}
811
812	<	/*
813	<	* poll and take should decrement the waiting consumer count
812	>	/**
813	>	* poll and take decrement the waiting consumer count
814		*/
815	<	public void testWaitingConsumer() {
816	<	try {
817	<	final LinkedTransferQueue q = new LinkedTransferQueue();
818	<	final ConsumerObserver waiting = new ConsumerObserver();
819	<	new Thread(new Runnable() {
820	<
821	<	public void run() {
822	<	try {
823	<	threadAssertTrue(q.hasWaitingConsumer());
824	<	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
825	<	threadAssertTrue(q.offer(new Object()));
826	<	} catch (Exception ex) {
934	<	threadUnexpectedException();
935	<	}
936	<
937	<	}
938	<	}).start();
939	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
940	<	assertTrue(q.getWaitingConsumerCount() < waiting.getWaitingConsumers());
941	<	} catch (Exception ex) {
942	<	this.unexpectedException();
943	<	}
815	>	public void testWaitingConsumer() throws InterruptedException {
816	>	final LinkedTransferQueue q = new LinkedTransferQueue();
817	>	final ConsumerObserver waiting = new ConsumerObserver();
818	>	new Thread(new CheckedRunnable() {
819	>	void realRun() {
820	>	threadAssertTrue(q.hasWaitingConsumer());
821	>	waiting.setWaitingConsumer(q.getWaitingConsumerCount());
822	>	threadAssertTrue(q.offer(new Object()));
823	>	}}).start();
824	>	assertTrue(q.poll(LONG_DELAY_MS, MILLISECONDS) != null);
825	>	assertTrue(q.getWaitingConsumerCount()
826	>	< waiting.getWaitingConsumers());
827		}
945	–	/*
946	–	* Inserts null into transfer throws NPE
947	–	*/
828
829	<	public void testTransfer1() {
829	>	/**
830	>	* transfer(null) throws NullPointerException
831	>	*/
832	>	public void testTransfer1() throws InterruptedException {
833		try {
834		LinkedTransferQueue q = new LinkedTransferQueue();
835		q.transfer(null);
836		shouldThrow();
837		} catch (NullPointerException ex) {
955	–	} catch (Exception ex) {
956	–	this.unexpectedException();
838		}
839		}
840
841	<	/*
842	<	* transfer attempts to insert into the queue then wait until that
843	<	* object is removed via take or poll.
841	>	/**
842	>	* transfer waits until a poll occurs. The transfered element
843	>	* is returned by this associated poll.
844		*/
845	<	public void testTransfer2() {
846	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
847	<	new Thread(new Runnable() {
848	<
849	<	public void run() {
850	<	try {
851	<	q.transfer(new Integer(SIZE));
852	<	threadAssertTrue(q.isEmpty());
853	<	} catch (Exception ex) {
854	<	threadUnexpectedException();
855	<	}
856	<	}
857	<	}).start();
845	>	public void testTransfer2() throws InterruptedException {
846	>	final LinkedTransferQueue<Integer> q
847	>	= new LinkedTransferQueue<Integer>();
848	>
849	>	new Thread(new CheckedRunnable() {
850	>	void realRun() throws InterruptedException {
851	>	q.transfer(SIZE);
852	>	threadAssertTrue(q.isEmpty());
853	>	}}).start();
854	>
855	>	Thread.sleep(SHORT_DELAY_MS);
856	>	assertEquals(1, q.size());
857	>	assertEquals(SIZE, (int) q.poll());
858	>	assertTrue(q.isEmpty());
859	>	}
860
861	<	try {
862	<	Thread.sleep(SHORT_DELAY_MS);
863	<	assertEquals(1, q.size());
864	<	q.poll();
865	<	assertTrue(q.isEmpty());
866	<	} catch (Exception ex) {
867	<	this.unexpectedException();
868	<	}
869	<	}
870	<	/*
871	<	* transfer will attempt to transfer in fifo order and continue waiting if
872	<	* the element being transfered is not polled or taken
873	<	*/
874	<
875	<	public void testTransfer3() {
876	<	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
877	<	new Thread(new Runnable() {
878	<	public void run() {
879	<	try {
880	<	Integer i;
881	<	q.transfer((i = new Integer(SIZE + 1)));
882	<	threadAssertTrue(!q.contains(i));
1000	<	threadAssertEquals(1, q.size());
1001	<	} catch (Exception ex) {
1002	<	threadUnexpectedException();
1003	<	}
1004	<	}
1005	<	}).start();
1006	<	Thread interruptedThread =
1007	<	new Thread(new Runnable() {
1008	<	public void run() {
1009	<	try {
1010	<	q.transfer(new Integer(SIZE));
1011	<	threadShouldThrow();
1012	<	} catch (InterruptedException ex) {
1013	<	}
1014	<	}
1015	<	});
861	>	/**
862	>	* transfer waits until a poll occurs, and then transfers in fifo order
863	>	*/
864	>	public void testTransfer3() throws InterruptedException {
865	>	final LinkedTransferQueue<Integer> q
866	>	= new LinkedTransferQueue<Integer>();
867	>
868	>	Thread first = new Thread(new CheckedRunnable() {
869	>	void realRun() throws InterruptedException {
870	>	Integer i = SIZE + 1;
871	>	q.transfer(i);
872	>	threadAssertTrue(!q.contains(i));
873	>	threadAssertEquals(1, q.size());
874	>	}});
875	>	first.start();
876	>
877	>	Thread interruptedThread = new Thread(new CheckedInterruptedRunnable() {
878	>	void realRun() throws InterruptedException {
879	>	while (q.size() == 0)
880	>	Thread.yield();
881	>	q.transfer(SIZE);
882	>	}});
883		interruptedThread.start();
884	<	try {
885	<	Thread.sleep(LONG_DELAY_MS);
886	<	assertEquals(2, q.size());
887	<	q.poll();
888	<	Thread.sleep(LONG_DELAY_MS);
889	<	interruptedThread.interrupt();
890	<	assertEquals(1, q.size());
891	<	} catch (Exception ex) {
892	<	this.unexpectedException();
893	<	}
884	>
885	>	while (q.size() < 2)
886	>	Thread.yield();
887	>	assertEquals(2, q.size());
888	>	assertEquals(SIZE + 1, (int) q.poll());
889	>	first.join();
890	>	assertEquals(1, q.size());
891	>	interruptedThread.interrupt();
892	>	interruptedThread.join();
893	>	assertEquals(0, q.size());
894	>	assertTrue(q.isEmpty());
895		}
896
897		/**
898	<	* transfer will wait as long as a poll or take occurs if one does occur
899	<	* the waiting is finished and the thread that tries to poll/take
1032	<	* wins in retrieving the element
898	>	* transfer waits until a poll occurs, at which point the polling
899	>	* thread returns the element
900		*/
901	<	public void testTransfer4() {
901	>	public void testTransfer4() throws InterruptedException {
902		final LinkedTransferQueue q = new LinkedTransferQueue();
903	<	new Thread(new Runnable() {
903	>	new Thread(new CheckedRunnable() {
904	>	void realRun() throws InterruptedException {
905	>	q.transfer(four);
906	>	threadAssertFalse(q.contains(four));
907	>	threadAssertEquals(three, q.poll());
908	>	}}).start();
909	>	Thread.sleep(MEDIUM_DELAY_MS);
910	>	assertTrue(q.offer(three));
911	>	assertEquals(four, q.poll());
912	>	}
913
914	<	public void run() {
915	<	try {
916	<	q.transfer(new Integer(four));
917	<	threadAssertFalse(q.contains(new Integer(four)));
918	<	threadAssertEquals(new Integer(three), q.poll());
919	<	} catch (Exception ex) {
920	<	threadUnexpectedException();
921	<	}
922	<	}
923	<	}).start();
924	<	try {
925	<	Thread.sleep(MEDIUM_DELAY_MS);
926	<	assertTrue(q.offer(three));
927	<	assertEquals(new Integer(four), q.poll());
928	<	} catch (Exception ex) {
929	<	this.unexpectedException();
930	<	}
914	>	/**
915	>	* transfer waits until a take occurs. The transfered element
916	>	* is returned by this associated take.
917	>	*/
918	>	public void testTransfer5() throws InterruptedException {
919	>	final LinkedTransferQueue<Integer> q
920	>	= new LinkedTransferQueue<Integer>();
921	>
922	>	new Thread(new CheckedRunnable() {
923	>	void realRun() throws InterruptedException {
924	>	q.transfer(SIZE);
925	>	threadAssertTrue(q.isEmpty());
926	>	}}).start();
927	>
928	>	Thread.sleep(SHORT_DELAY_MS);
929	>	assertEquals(SIZE, (int) q.take());
930	>	assertTrue(q.isEmpty());
931		}
1056	–	/*
1057	–	* Insert null into trTransfer throws NPE
1058	–	*/
932
933	+	/**
934	+	* tryTransfer(null) throws NullPointerException
935	+	*/
936		public void testTryTransfer1() {
937		try {
938		final LinkedTransferQueue q = new LinkedTransferQueue();
939		q.tryTransfer(null);
940		this.shouldThrow();
941		} catch (NullPointerException ex) {
1066	–	} catch (Exception ex) {
1067	–	this.unexpectedException();
942		}
943		}
1070	–	/*
1071	–	* tryTransfer returns false and does not enqueue if there are no consumers
1072	–	* waiting to poll or take.
1073	–	*/
944
945	+	/**
946	+	* tryTransfer returns false and does not enqueue if there are no
947	+	* consumers waiting to poll or take.
948	+	*/
949		public void testTryTransfer2() {
950	<	try {
951	<	final LinkedTransferQueue q = new LinkedTransferQueue();
952	<	assertFalse(q.tryTransfer(new Object()));
953	<	assertEquals(0, q.size());
954	<	} catch (Exception ex) {
1081	<	this.unexpectedException();
1082	<	}
950	>	final LinkedTransferQueue q = new LinkedTransferQueue();
951	>	assertFalse(q.tryTransfer(new Object()));
952	>	assertFalse(q.hasWaitingConsumer());
953	>	assertTrue(q.isEmpty());
954	>	assertEquals(0, q.size());
955		}
1084	–	/*
1085	–	* if there is a consumer waiting poll or take tryTransfer returns
1086	–	* true while enqueueing object
1087	–	*/
1088	–
1089	–	public void testTryTransfer3() {
1090	–	try {
1091	–	final LinkedTransferQueue q = new LinkedTransferQueue();
1092	–	new Thread(new Runnable() {
1093	–
1094	–	public void run() {
1095	–	try {
1096	–	threadAssertTrue(q.hasWaitingConsumer());
1097	–	threadAssertTrue(q.tryTransfer(new Object()));
1098	–	} catch (Exception ex) {
1099	–	threadUnexpectedException();
1100	–	}
956
957	<	}
958	<	}).start();
959	<	assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null);
960	<	assertTrue(q.isEmpty());
961	<	} catch (Exception ex) {
962	<	this.unexpectedException();
963	<	}
957	>	/**
958	>	* If there is a consumer waiting in timed poll, tryTransfer
959	>	* returns true while successfully transfering object.
960	>	*/
961	>	public void testTryTransfer3() throws InterruptedException {
962	>	final Object hotPotato = new Object();
963	>	final LinkedTransferQueue q = new LinkedTransferQueue();
964	>	new Thread(new CheckedRunnable() {
965	>	void realRun() {
966	>	while (! q.hasWaitingConsumer())
967	>	Thread.yield();
968	>	threadAssertTrue(q.hasWaitingConsumer());
969	>	threadAssertTrue(q.isEmpty());
970	>	threadAssertTrue(q.size() == 0);
971	>	threadAssertTrue(q.tryTransfer(hotPotato));
972	>	}}).start();
973	>	assertTrue(q.poll(LONG_DELAY_MS, MILLISECONDS) == hotPotato);
974	>	assertTrue(q.isEmpty());
975		}
976
977	<	/*
978	<	* tryTransfer waits the amount given if interrupted, show an
979	<	* interrupted exception
977	>	/**
978	>	* If there is a consumer waiting in take, tryTransfer returns
979	>	* true while successfully transfering object.
980		*/
981	<	public void testTryTransfer4() {
981	>	public void testTryTransfer4() throws InterruptedException {
982	>	final Object hotPotato = new Object();
983		final LinkedTransferQueue q = new LinkedTransferQueue();
984	<	Thread toInterrupt = new Thread(new Runnable() {
984	>	new Thread(new CheckedRunnable() {
985	>	void realRun() {
986	>	while (! q.hasWaitingConsumer())
987	>	Thread.yield();
988	>	threadAssertTrue(q.hasWaitingConsumer());
989	>	threadAssertTrue(q.isEmpty());
990	>	threadAssertTrue(q.size() == 0);
991	>	threadAssertTrue(q.tryTransfer(hotPotato));
992	>	}}).start();
993	>	assertTrue(q.take() == hotPotato);
994	>	assertTrue(q.isEmpty());
995	>	}
996
997	<	public void run() {
998	<	try {
999	<	q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
1000	<	threadShouldThrow();
1001	<	} catch (InterruptedException ex) {
1002	<	}
1003	<	}
1004	<	});
1005	<	try {
1006	<	toInterrupt.start();
1007	<	Thread.sleep(SMALL_DELAY_MS);
1008	<	toInterrupt.interrupt();
1009	<	} catch (Exception ex) {
1132	<	this.unexpectedException();
1133	<	}
997	>	/**
998	>	* tryTransfer waits the amount given if interrupted, and
999	>	* throws interrupted exception
1000	>	*/
1001	>	public void testTryTransfer5() throws InterruptedException {
1002	>	final LinkedTransferQueue q = new LinkedTransferQueue();
1003	>	Thread toInterrupt = new Thread(new CheckedInterruptedRunnable() {
1004	>	void realRun() throws InterruptedException {
1005	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
1006	>	}});
1007	>	toInterrupt.start();
1008	>	Thread.sleep(SMALL_DELAY_MS);
1009	>	toInterrupt.interrupt();
1010		}
1011
1012	<	/*
1012	>	/**
1013		* tryTransfer gives up after the timeout and return false
1014		*/
1015	<	public void testTryTransfer5() {
1015	>	public void testTryTransfer6() throws InterruptedException {
1016		final LinkedTransferQueue q = new LinkedTransferQueue();
1017	<	try {
1018	<	new Thread(new Runnable() {
1019	<
1020	<	public void run() {
1021	<	try {
1022	<	threadAssertFalse(q.tryTransfer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1023	<	} catch (InterruptedException ex) {
1024	<	threadUnexpectedException();
1149	<	}
1150	<	}
1151	<	}).start();
1152	<	Thread.sleep(LONG_DELAY_MS);
1153	<	assertTrue(q.isEmpty());
1154	<	} catch (Exception ex) {
1155	<	this.unexpectedException();
1156	<	}
1017	>	new Thread(new CheckedRunnable() {
1018	>	void realRun() throws InterruptedException {
1019	>	threadAssertFalse
1020	>	(q.tryTransfer(new Object(),
1021	>	SHORT_DELAY_MS, MILLISECONDS));
1022	>	}}).start();
1023	>	Thread.sleep(LONG_DELAY_MS);
1024	>	assertTrue(q.isEmpty());
1025		}
1026
1027	<	/*
1027	>	/**
1028		* tryTransfer waits for any elements previously in to be removed
1029		* before transfering to a poll or take
1030		*/
1031	<	public void testTryTransfer6() {
1031	>	public void testTryTransfer7() throws InterruptedException {
1032		final LinkedTransferQueue q = new LinkedTransferQueue();
1033	<	q.offer(new Integer(four));
1034	<	new Thread(new Runnable() {
1035	<
1036	<	public void run() {
1037	<	try {
1038	<	threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
1039	<	threadAssertTrue(q.isEmpty());
1040	<	} catch (InterruptedException ex) {
1041	<	threadUnexpectedException();
1042	<	}
1043	<	}
1044	<	}).start();
1177	<	try {
1178	<	Thread.sleep(SHORT_DELAY_MS);
1179	<	assertEquals(2, q.size());
1180	<	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	<	}
1033	>	assertTrue(q.offer(four));
1034	>	new Thread(new CheckedRunnable() {
1035	>	void realRun() throws InterruptedException {
1036	>	threadAssertTrue(q.tryTransfer(five,
1037	>	LONG_DELAY_MS, MILLISECONDS));
1038	>	threadAssertTrue(q.isEmpty());
1039	>	}}).start();
1040	>	Thread.sleep(SHORT_DELAY_MS);
1041	>	assertEquals(2, q.size());
1042	>	assertEquals(four, q.poll());
1043	>	assertEquals(five, q.poll());
1044	>	assertTrue(q.isEmpty());
1045		}
1046
1047	<	/*
1048	<	* tryTransfer attempts to enqueue into the q and fails returning false not
1049	<	* enqueueing and the successing poll is null
1047	>	/**
1048	>	* tryTransfer attempts to enqueue into the q and fails returning
1049	>	* false not enqueueing and the successive poll is null
1050		*/
1051	<	public void testTryTransfer7() {
1051	>	public void testTryTransfer8() throws InterruptedException {
1052		final LinkedTransferQueue q = new LinkedTransferQueue();
1053	<	q.offer(new Integer(four));
1054	<	new Thread(new Runnable() {
1055	<
1056	<	public void run() {
1057	<	try {
1058	<	threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
1059	<	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	<	}
1053	>	assertTrue(q.offer(four));
1054	>	assertEquals(1, q.size());
1055	>	assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS));
1056	>	assertEquals(1, q.size());
1057	>	assertEquals(four, q.poll());
1058	>	threadAssertTrue(q.isEmpty());
1059	>	assertNull(q.poll());
1060		}
1061
1062	<	private LinkedTransferQueue populatedQueue(
1063	<	int n) {
1218	<	LinkedTransferQueue q = new LinkedTransferQueue();
1062	>	private LinkedTransferQueue<Integer> populatedQueue(int n) {
1063	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
1064		assertTrue(q.isEmpty());
1065	<	int remainingCapacity = q.remainingCapacity();
1066	<	for (int i = 0; i <
1222	<	n; i++) {
1065	>	for (int i = 0; i < n; i++) {
1066	>	assertEquals(i, q.size());
1067		assertTrue(q.offer(i));
1068	+	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
1069		}
1225	–
1070		assertFalse(q.isEmpty());
1227	–	assertEquals(remainingCapacity, q.remainingCapacity());
1228	–	assertEquals(n, q.size());
1071		return q;
1072		}
1073

Diff Legend

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