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.27 by jsr166, Thu Oct 28 17:22:13 2010 UTC vs.
Revision 1.70 by jsr166, Sat Feb 18 16:37:49 2017 UTC

#	Line 1 | Line 1
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		* Other contributors include John Vint
6		*/
7
8	<	import java.io.BufferedInputStream;
9	<	import java.io.BufferedOutputStream;
10	<	import java.io.ByteArrayInputStream;
11	<	import java.io.ByteArrayOutputStream;
12	<	import java.io.ObjectInputStream;
13	<	import java.io.ObjectOutputStream;
8	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
9	>
10		import java.util.ArrayList;
11		import java.util.Arrays;
12	+	import java.util.Collection;
13		import java.util.Iterator;
14		import java.util.List;
15		import java.util.NoSuchElementException;
16	<	import java.util.concurrent.*;
17	<	import static java.util.concurrent.TimeUnit.MILLISECONDS;
18	<	import static java.util.concurrent.TimeUnit.NANOSECONDS;
16	>	import java.util.Queue;
17	>	import java.util.concurrent.BlockingQueue;
18	>	import java.util.concurrent.Callable;
19	>	import java.util.concurrent.CountDownLatch;
20	>	import java.util.concurrent.Executors;
21	>	import java.util.concurrent.ExecutorService;
22	>	import java.util.concurrent.LinkedTransferQueue;
23	>
24		import junit.framework.Test;
23	–	import junit.framework.TestSuite;
25
26		@SuppressWarnings({"unchecked", "rawtypes"})
27		public class LinkedTransferQueueTest extends JSR166TestCase {
27	–
28		public static class Generic extends BlockingQueueTest {
29		protected BlockingQueue emptyCollection() {
30		return new LinkedTransferQueue();
#	Line 32 | Line 32 | public class LinkedTransferQueueTest ext
32		}
33
34		public static void main(String[] args) {
35	<	junit.textui.TestRunner.run(suite());
35	>	main(suite(), args);
36		}
37
38		public static Test suite() {
39	+	class Implementation implements CollectionImplementation {
40	+	public Class<?> klazz() { return LinkedTransferQueue.class; }
41	+	public Collection emptyCollection() { return new LinkedTransferQueue(); }
42	+	public Object makeElement(int i) { return i; }
43	+	public boolean isConcurrent() { return true; }
44	+	public boolean permitsNulls() { return false; }
45	+	}
46		return newTestSuite(LinkedTransferQueueTest.class,
47	<	new Generic().testSuite());
48	<	}
42	<
43	<	void checkEmpty(LinkedTransferQueue q) throws InterruptedException {
44	<	assertTrue(q.isEmpty());
45	<	assertEquals(0, q.size());
46	<	assertNull(q.peek());
47	<	assertNull(q.poll());
48	<	assertNull(q.poll(0, MILLISECONDS));
49	<	assertEquals(q.toString(), "[]");
50	<	assertTrue(Arrays.equals(q.toArray(), new Object[0]));
51	<	assertFalse(q.iterator().hasNext());
52	<	try {
53	<	q.element();
54	<	shouldThrow();
55	<	} catch (NoSuchElementException success) {}
56	<	try {
57	<	q.iterator().next();
58	<	shouldThrow();
59	<	} catch (NoSuchElementException success) {}
60	<	try {
61	<	q.remove();
62	<	shouldThrow();
63	<	} catch (NoSuchElementException success) {}
47	>	new Generic().testSuite(),
48	>	CollectionTest.testSuite(new Implementation()));
49		}
50
51		/**
#	Line 88 | Line 73 | public class LinkedTransferQueueTest ext
73		* NullPointerException
74		*/
75		public void testConstructor3() {
76	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
77		try {
78	<	Integer[] ints = new Integer[SIZE];
93	<	new LinkedTransferQueue(Arrays.asList(ints));
78	>	new LinkedTransferQueue(elements);
79		shouldThrow();
80		} catch (NullPointerException success) {}
81		}
#	Line 100 | Line 85 | public class LinkedTransferQueueTest ext
85		* throws NullPointerException
86		*/
87		public void testConstructor4() {
88	+	Integer[] ints = new Integer[SIZE];
89	+	for (int i = 0; i < SIZE - 1; ++i)
90	+	ints[i] = i;
91	+	Collection<Integer> elements = Arrays.asList(ints);
92		try {
93	<	Integer[] ints = new Integer[SIZE];
105	<	for (int i = 0; i < SIZE - 1; ++i) {
106	<	ints[i] = i;
107	<	}
108	<	new LinkedTransferQueue(Arrays.asList(ints));
93	>	new LinkedTransferQueue(elements);
94		shouldThrow();
95		} catch (NullPointerException success) {}
96		}
#	Line 138 | Line 123 | public class LinkedTransferQueueTest ext
123		* remainingCapacity() always returns Integer.MAX_VALUE
124		*/
125		public void testRemainingCapacity() {
126	<	LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
126	>	BlockingQueue q = populatedQueue(SIZE);
127		for (int i = 0; i < SIZE; ++i) {
128		assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
129		assertEquals(SIZE - i, q.size());
130	<	q.remove();
130	>	assertEquals(i, q.remove());
131		}
132		for (int i = 0; i < SIZE; ++i) {
133		assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
134		assertEquals(i, q.size());
135	<	q.add(i);
135	>	assertTrue(q.add(i));
136		}
137		}
138
139		/**
155	–	* offer(null) throws NullPointerException
156	–	*/
157	–	public void testOfferNull() {
158	–	try {
159	–	LinkedTransferQueue q = new LinkedTransferQueue();
160	–	q.offer(null);
161	–	shouldThrow();
162	–	} catch (NullPointerException success) {}
163	–	}
164	–
165	–	/**
166	–	* add(null) throws NullPointerException
167	–	*/
168	–	public void testAddNull() {
169	–	try {
170	–	LinkedTransferQueue q = new LinkedTransferQueue();
171	–	q.add(null);
172	–	shouldThrow();
173	–	} catch (NullPointerException success) {}
174	–	}
175	–
176	–	/**
177	–	* addAll(null) throws NullPointerException
178	–	*/
179	–	public void testAddAll1() {
180	–	try {
181	–	LinkedTransferQueue q = new LinkedTransferQueue();
182	–	q.addAll(null);
183	–	shouldThrow();
184	–	} catch (NullPointerException success) {}
185	–	}
186	–
187	–	/**
140		* addAll(this) throws IllegalArgumentException
141		*/
142		public void testAddAllSelf() {
143	+	LinkedTransferQueue q = populatedQueue(SIZE);
144		try {
192	–	LinkedTransferQueue q = populatedQueue(SIZE);
145		q.addAll(q);
146		shouldThrow();
147		} catch (IllegalArgumentException success) {}
148		}
149
150		/**
199	–	* addAll of a collection with null elements throws NullPointerException
200	–	*/
201	–	public void testAddAll2() {
202	–	try {
203	–	LinkedTransferQueue q = new LinkedTransferQueue();
204	–	Integer[] ints = new Integer[SIZE];
205	–	q.addAll(Arrays.asList(ints));
206	–	shouldThrow();
207	–	} catch (NullPointerException success) {}
208	–	}
209	–
210	–	/**
151		* addAll of a collection with any null elements throws
152		* NullPointerException after possibly adding some elements
153		*/
154		public void testAddAll3() {
155	+	LinkedTransferQueue q = new LinkedTransferQueue();
156	+	Integer[] ints = new Integer[SIZE];
157	+	for (int i = 0; i < SIZE - 1; ++i)
158	+	ints[i] = i;
159		try {
216	–	LinkedTransferQueue q = new LinkedTransferQueue();
217	–	Integer[] ints = new Integer[SIZE];
218	–	for (int i = 0; i < SIZE - 1; ++i) {
219	–	ints[i] = i;
220	–	}
160		q.addAll(Arrays.asList(ints));
161		shouldThrow();
162		} catch (NullPointerException success) {}
#	Line 241 | Line 180 | public class LinkedTransferQueueTest ext
180		}
181
182		/**
244	–	* put(null) throws NullPointerException
245	–	*/
246	–	public void testPutNull() throws InterruptedException {
247	–	try {
248	–	LinkedTransferQueue q = new LinkedTransferQueue();
249	–	q.put(null);
250	–	shouldThrow();
251	–	} catch (NullPointerException success) {}
252	–	}
253	–
254	–	/**
183		* all elements successfully put are contained
184		*/
185		public void testPut() {
186	<	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
186	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
187		for (int i = 0; i < SIZE; ++i) {
188	<	assertEquals(q.size(), i);
188	>	assertEquals(i, q.size());
189		q.put(i);
190		assertTrue(q.contains(i));
191		}
#	Line 274 | Line 202 | public class LinkedTransferQueueTest ext
202		}
203
204		/**
205	<	* take blocks interruptibly when empty
278	<	*/
279	<	public void testTakeFromEmpty() throws InterruptedException {
280	<	final LinkedTransferQueue q = new LinkedTransferQueue();
281	<	Thread t = newStartedThread(new CheckedInterruptedRunnable() {
282	<	public void realRun() throws InterruptedException {
283	<	q.take();
284	<	}});
285	<	Thread.sleep(SHORT_DELAY_MS);
286	<	t.interrupt();
287	<	t.join();
288	<	}
289	<
290	<	/**
291	<	* Take removes existing elements until empty, then blocks interruptibly
205	>	* take removes existing elements until empty, then blocks interruptibly
206		*/
207		public void testBlockingTake() throws InterruptedException {
208	<	final LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
209	<	Thread t = new Thread(new CheckedRunnable() {
208	>	final BlockingQueue q = populatedQueue(SIZE);
209	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
210	>	Thread t = newStartedThread(new CheckedRunnable() {
211		public void realRun() throws InterruptedException {
212		for (int i = 0; i < SIZE; ++i) {
213	<	assertEquals(i, (int) q.take());
213	>	assertEquals(i, q.take());
214		}
215	+
216	+	Thread.currentThread().interrupt();
217	+	try {
218	+	q.take();
219	+	shouldThrow();
220	+	} catch (InterruptedException success) {}
221	+	assertFalse(Thread.interrupted());
222	+
223	+	pleaseInterrupt.countDown();
224		try {
225		q.take();
226		shouldThrow();
227		} catch (InterruptedException success) {}
228	+	assertFalse(Thread.interrupted());
229		}});
230
231	<	t.start();
232	<	Thread.sleep(SHORT_DELAY_MS);
231	>	await(pleaseInterrupt);
232	>	assertThreadStaysAlive(t);
233		t.interrupt();
234	<	t.join();
310	<	checkEmpty(q);
234	>	awaitTermination(t);
235		}
236
237		/**
#	Line 323 | Line 247 | public class LinkedTransferQueueTest ext
247		}
248
249		/**
250	<	* timed pool with zero timeout succeeds when non-empty, else times out
250	>	* timed poll with zero timeout succeeds when non-empty, else times out
251		*/
252		public void testTimedPoll0() throws InterruptedException {
253		LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
#	Line 335 | Line 259 | public class LinkedTransferQueueTest ext
259		}
260
261		/**
262	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
262	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
263		*/
264		public void testTimedPoll() throws InterruptedException {
265		LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
266	<	for (int i = 0; i < SIZE; ++i) {
267	<	long t0 = System.nanoTime();
266	>	long startTime = System.nanoTime();
267	>	for (int i = 0; i < SIZE; ++i)
268		assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
269	<	long millisElapsed = (System.nanoTime() - t0)/(1024 * 1024);
270	<	assertTrue(millisElapsed < SMALL_DELAY_MS);
271	<	}
272	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
269	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
270	>
271	>	startTime = System.nanoTime();
272	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
273	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
274		checkEmpty(q);
275		}
276
#	Line 354 | Line 279 | public class LinkedTransferQueueTest ext
279		* returning timeout status
280		*/
281		public void testInterruptedTimedPoll() throws InterruptedException {
282	<	final LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
282	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
283	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
284		Thread t = newStartedThread(new CheckedRunnable() {
285		public void realRun() throws InterruptedException {
286	<	for (int i = 0; i < SIZE; ++i) {
287	<	long t0 = System.nanoTime();
286	>	long startTime = System.nanoTime();
287	>	for (int i = 0; i < SIZE; ++i)
288		assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
289	<	long millisElapsed = (System.nanoTime() - t0)/(1024 * 1024);
364	<	assertTrue(millisElapsed < SMALL_DELAY_MS);
365	<	}
289	>	aboutToWait.countDown();
290		try {
291		q.poll(LONG_DELAY_MS, MILLISECONDS);
292		shouldThrow();
293		} catch (InterruptedException success) {}
294	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
295		}});
296
297	<	Thread.sleep(SMALL_DELAY_MS);
297	>	aboutToWait.await();
298	>	waitForThreadToEnterWaitState(t);
299		t.interrupt();
300	<	t.join();
300	>	awaitTermination(t);
301	>	checkEmpty(q);
302	>	}
303	>
304	>	/**
305	>	* timed poll after thread interrupted throws InterruptedException
306	>	* instead of returning timeout status
307	>	*/
308	>	public void testTimedPollAfterInterrupt() throws InterruptedException {
309	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
310	>	Thread t = newStartedThread(new CheckedRunnable() {
311	>	public void realRun() throws InterruptedException {
312	>	long startTime = System.nanoTime();
313	>	Thread.currentThread().interrupt();
314	>	for (int i = 0; i < SIZE; ++i)
315	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
316	>	try {
317	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
318	>	shouldThrow();
319	>	} catch (InterruptedException success) {}
320	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
321	>	}});
322	>
323	>	awaitTermination(t);
324		checkEmpty(q);
325		}
326
#	Line 422 | Line 371 | public class LinkedTransferQueueTest ext
371		}
372
373		/**
425	–	* remove(x) removes x and returns true if present
426	–	*/
427	–	public void testRemoveElement() throws InterruptedException {
428	–	LinkedTransferQueue q = populatedQueue(SIZE);
429	–	for (int i = 1; i < SIZE; i += 2) {
430	–	assertTrue(q.remove(i));
431	–	}
432	–	for (int i = 0; i < SIZE; i += 2) {
433	–	assertTrue(q.remove(i));
434	–	assertFalse(q.remove(i + 1));
435	–	}
436	–	checkEmpty(q);
437	–	}
438	–
439	–	/**
374		* An add following remove(x) succeeds
375		*/
376		public void testRemoveElementAndAdd() throws InterruptedException {
#	Line 482 | Line 416 | public class LinkedTransferQueueTest ext
416		*/
417		public void testContainsAll() {
418		LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
419	<	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>();
419	>	LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>();
420		for (int i = 0; i < SIZE; ++i) {
421		assertTrue(q.containsAll(p));
422		assertFalse(p.containsAll(q));
#	Line 528 | Line 462 | public class LinkedTransferQueueTest ext
462		}
463
464		/**
465	<	* toArray() contains all elements
465	>	* toArray() contains all elements in FIFO order
466		*/
467	<	public void testToArray() throws InterruptedException {
467	>	public void testToArray() {
468		LinkedTransferQueue q = populatedQueue(SIZE);
469		Object[] o = q.toArray();
470		for (int i = 0; i < o.length; i++) {
471	<	assertEquals(o[i], q.take());
471	>	assertSame(o[i], q.poll());
472		}
473		}
474
475		/**
476	<	* toArray(a) contains all elements
476	>	* toArray(a) contains all elements in FIFO order
477		*/
478	<	public void testToArray2() throws InterruptedException {
478	>	public void testToArray2() {
479		LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
480		Integer[] ints = new Integer[SIZE];
481	<	ints = q.toArray(ints);
481	>	Integer[] array = q.toArray(ints);
482	>	assertSame(ints, array);
483		for (int i = 0; i < ints.length; i++) {
484	<	assertEquals(ints[i], q.take());
484	>	assertSame(ints[i], q.poll());
485		}
486		}
487
488		/**
489	<	* toArray(null) throws NullPointerException
555	<	*/
556	<	public void testToArray_BadArg() {
557	<	LinkedTransferQueue q = populatedQueue(SIZE);
558	<	try {
559	<	Object o[] = q.toArray(null);
560	<	shouldThrow();
561	<	} catch (NullPointerException success) {}
562	<	}
563	<
564	<	/**
565	<	* toArray(incompatible array type) throws CCE
489	>	* toArray(incompatible array type) throws ArrayStoreException
490		*/
491		public void testToArray1_BadArg() {
492		LinkedTransferQueue q = populatedQueue(SIZE);
493		try {
494	<	Object o[] = q.toArray(new String[10]);
494	>	q.toArray(new String[10]);
495		shouldThrow();
496		} catch (ArrayStoreException success) {}
497		}
#	Line 578 | Line 502 | public class LinkedTransferQueueTest ext
502		public void testIterator() throws InterruptedException {
503		LinkedTransferQueue q = populatedQueue(SIZE);
504		Iterator it = q.iterator();
505	<	int i = 0;
506	<	while (it.hasNext()) {
507	<	assertEquals(it.next(), i++);
508	<	}
505	>	int i;
506	>	for (i = 0; it.hasNext(); i++)
507	>	assertTrue(q.contains(it.next()));
508	>	assertEquals(i, SIZE);
509	>	assertIteratorExhausted(it);
510	>
511	>	it = q.iterator();
512	>	for (i = 0; it.hasNext(); i++)
513	>	assertEquals(it.next(), q.take());
514		assertEquals(i, SIZE);
515	+	assertIteratorExhausted(it);
516	+	}
517	+
518	+	/**
519	+	* iterator of empty collection has no elements
520	+	*/
521	+	public void testEmptyIterator() {
522	+	assertIteratorExhausted(new LinkedTransferQueue().iterator());
523		}
524
525		/**
#	Line 608 | Line 545 | public class LinkedTransferQueueTest ext
545		* iterator ordering is FIFO
546		*/
547		public void testIteratorOrdering() {
548	<	final LinkedTransferQueue<Integer> q
612	<	= new LinkedTransferQueue<Integer>();
548	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
549		assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
550		q.add(one);
551		q.add(two);
#	Line 644 | Line 580 | public class LinkedTransferQueueTest ext
580		LinkedTransferQueue q = populatedQueue(SIZE);
581		String s = q.toString();
582		for (int i = 0; i < SIZE; ++i) {
583	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
583	>	assertTrue(s.contains(String.valueOf(i)));
584		}
585		}
586
#	Line 653 | Line 589 | public class LinkedTransferQueueTest ext
589		*/
590		public void testOfferInExecutor() {
591		final LinkedTransferQueue q = new LinkedTransferQueue();
592	<	q.add(one);
593	<	q.add(two);
594	<	ExecutorService executor = Executors.newFixedThreadPool(2);
592	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
593	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
594	>	try (PoolCleaner cleaner = cleaner(executor)) {
595
596	<	executor.execute(new CheckedRunnable() {
597	<	public void realRun() {
598	<	assertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
599	<	}});
600	<
601	<	executor.execute(new CheckedRunnable() {
602	<	public void realRun() throws InterruptedException {
667	<	Thread.sleep(SMALL_DELAY_MS);
668	<	assertSame(one, q.take());
669	<	}});
596	>	executor.execute(new CheckedRunnable() {
597	>	public void realRun() throws InterruptedException {
598	>	threadsStarted.await();
599	>	long startTime = System.nanoTime();
600	>	assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
601	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
602	>	}});
603
604	<	joinPool(executor);
604	>	executor.execute(new CheckedRunnable() {
605	>	public void realRun() throws InterruptedException {
606	>	threadsStarted.await();
607	>	assertSame(one, q.take());
608	>	checkEmpty(q);
609	>	}});
610	>	}
611		}
612
613		/**
#	Line 676 | Line 615 | public class LinkedTransferQueueTest ext
615		*/
616		public void testPollInExecutor() {
617		final LinkedTransferQueue q = new LinkedTransferQueue();
618	<	ExecutorService executor = Executors.newFixedThreadPool(2);
618	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
619	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
620	>	try (PoolCleaner cleaner = cleaner(executor)) {
621
622	<	executor.execute(new CheckedRunnable() {
623	<	public void realRun() throws InterruptedException {
624	<	assertNull(q.poll());
625	<	assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
626	<	assertTrue(q.isEmpty());
627	<	}});
628	<
629	<	executor.execute(new CheckedRunnable() {
630	<	public void realRun() throws InterruptedException {
690	<	Thread.sleep(SMALL_DELAY_MS);
691	<	q.put(one);
692	<	}});
622	>	executor.execute(new CheckedRunnable() {
623	>	public void realRun() throws InterruptedException {
624	>	assertNull(q.poll());
625	>	threadsStarted.await();
626	>	long startTime = System.nanoTime();
627	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
628	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
629	>	checkEmpty(q);
630	>	}});
631
632	<	joinPool(executor);
632	>	executor.execute(new CheckedRunnable() {
633	>	public void realRun() throws InterruptedException {
634	>	threadsStarted.await();
635	>	q.put(one);
636	>	}});
637	>	}
638		}
639
640		/**
641		* A deserialized serialized queue has same elements in same order
642		*/
643		public void testSerialization() throws Exception {
644	<	LinkedTransferQueue q = populatedQueue(SIZE);
645	<
703	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
704	<	ObjectOutputStream out
705	<	= new ObjectOutputStream(new BufferedOutputStream(bout));
706	<	out.writeObject(q);
707	<	out.close();
708	<
709	<	ByteArrayInputStream bin
710	<	= new ByteArrayInputStream(bout.toByteArray());
711	<	ObjectInputStream in
712	<	= new ObjectInputStream(new BufferedInputStream(bin));
713	<	LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
644	>	Queue x = populatedQueue(SIZE);
645	>	Queue y = serialClone(x);
646
647	<	assertEquals(q.size(), r.size());
648	<	while (!q.isEmpty()) {
649	<	assertEquals(q.remove(), r.remove());
647	>	assertNotSame(y, x);
648	>	assertEquals(x.size(), y.size());
649	>	assertEquals(x.toString(), y.toString());
650	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
651	>	while (!x.isEmpty()) {
652	>	assertFalse(y.isEmpty());
653	>	assertEquals(x.remove(), y.remove());
654		}
655	<	}
720	<
721	<	/**
722	<	* drainTo(null) throws NullPointerException
723	<	*/
724	<	public void testDrainToNull() {
725	<	LinkedTransferQueue q = populatedQueue(SIZE);
726	<	try {
727	<	q.drainTo(null);
728	<	shouldThrow();
729	<	} catch (NullPointerException success) {}
730	<	}
731	<
732	<	/**
733	<	* drainTo(this) throws IllegalArgumentException
734	<	*/
735	<	public void testDrainToSelf() {
736	<	LinkedTransferQueue q = populatedQueue(SIZE);
737	<	try {
738	<	q.drainTo(q);
739	<	shouldThrow();
740	<	} catch (IllegalArgumentException success) {}
655	>	assertTrue(y.isEmpty());
656		}
657
658		/**
#	Line 747 | Line 662 | public class LinkedTransferQueueTest ext
662		LinkedTransferQueue q = populatedQueue(SIZE);
663		ArrayList l = new ArrayList();
664		q.drainTo(l);
665	<	assertEquals(q.size(), 0);
666	<	assertEquals(l.size(), SIZE);
665	>	assertEquals(0, q.size());
666	>	assertEquals(SIZE, l.size());
667		for (int i = 0; i < SIZE; ++i) {
668	<	assertEquals(l.get(i), i);
668	>	assertEquals(i, l.get(i));
669		}
670		q.add(zero);
671		q.add(one);
#	Line 759 | Line 674 | public class LinkedTransferQueueTest ext
674		assertTrue(q.contains(one));
675		l.clear();
676		q.drainTo(l);
677	<	assertEquals(q.size(), 0);
678	<	assertEquals(l.size(), 2);
677	>	assertEquals(0, q.size());
678	>	assertEquals(2, l.size());
679		for (int i = 0; i < 2; ++i) {
680	<	assertEquals(l.get(i), i);
680	>	assertEquals(i, l.get(i));
681		}
682		}
683
#	Line 778 | Line 693 | public class LinkedTransferQueueTest ext
693		ArrayList l = new ArrayList();
694		q.drainTo(l);
695		assertTrue(l.size() >= SIZE);
696	<	for (int i = 0; i < SIZE; ++i) {
697	<	assertEquals(l.get(i), i);
698	<	}
784	<	t.join();
696	>	for (int i = 0; i < SIZE; ++i)
697	>	assertEquals(i, l.get(i));
698	>	awaitTermination(t);
699		assertTrue(q.size() + l.size() >= SIZE);
700		}
701
702		/**
789	–	* drainTo(null, n) throws NullPointerException
790	–	*/
791	–	public void testDrainToNullN() {
792	–	LinkedTransferQueue q = populatedQueue(SIZE);
793	–	try {
794	–	q.drainTo(null, SIZE);
795	–	shouldThrow();
796	–	} catch (NullPointerException success) {}
797	–	}
798	–
799	–	/**
800	–	* drainTo(this, n) throws IllegalArgumentException
801	–	*/
802	–	public void testDrainToSelfN() {
803	–	LinkedTransferQueue q = populatedQueue(SIZE);
804	–	try {
805	–	q.drainTo(q, SIZE);
806	–	shouldThrow();
807	–	} catch (IllegalArgumentException success) {}
808	–	}
809	–
810	–	/**
703		* drainTo(c, n) empties first min(n, size) elements of queue into c
704		*/
705		public void testDrainToN() {
#	Line 819 | Line 711 | public class LinkedTransferQueueTest ext
711		ArrayList l = new ArrayList();
712		q.drainTo(l, i);
713		int k = (i < SIZE) ? i : SIZE;
714	<	assertEquals(l.size(), k);
715	<	assertEquals(q.size(), SIZE - k);
716	<	for (int j = 0; j < k; ++j) {
717	<	assertEquals(l.get(j), j);
718	<	}
827	<	while (q.poll() != null)
828	<	;
714	>	assertEquals(k, l.size());
715	>	assertEquals(SIZE - k, q.size());
716	>	for (int j = 0; j < k; ++j)
717	>	assertEquals(j, l.get(j));
718	>	do {} while (q.poll() != null);
719		}
720		}
721
#	Line 835 | Line 725 | public class LinkedTransferQueueTest ext
725		*/
726		public void testWaitingConsumer() throws InterruptedException {
727		final LinkedTransferQueue q = new LinkedTransferQueue();
728	<	assertEquals(q.getWaitingConsumerCount(), 0);
728	>	assertEquals(0, q.getWaitingConsumerCount());
729		assertFalse(q.hasWaitingConsumer());
730	+	final CountDownLatch threadStarted = new CountDownLatch(1);
731
732		Thread t = newStartedThread(new CheckedRunnable() {
733		public void realRun() throws InterruptedException {
734	<	Thread.sleep(SMALL_DELAY_MS);
735	<	assertTrue(q.hasWaitingConsumer());
736	<	assertEquals(q.getWaitingConsumerCount(), 1);
737	<	assertTrue(q.offer(one));
734	>	threadStarted.countDown();
735	>	long startTime = System.nanoTime();
736	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
737	>	assertEquals(0, q.getWaitingConsumerCount());
738		assertFalse(q.hasWaitingConsumer());
739	<	assertEquals(q.getWaitingConsumerCount(), 0);
739	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
740		}});
741
742	<	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
743	<	assertEquals(q.getWaitingConsumerCount(), 0);
742	>	threadStarted.await();
743	>	Callable<Boolean> oneConsumer
744	>	= new Callable<Boolean>() { public Boolean call() {
745	>	return q.hasWaitingConsumer()
746	>	&& q.getWaitingConsumerCount() == 1; }};
747	>	waitForThreadToEnterWaitState(t, oneConsumer);
748	>
749	>	assertTrue(q.offer(one));
750	>	assertEquals(0, q.getWaitingConsumerCount());
751		assertFalse(q.hasWaitingConsumer());
752	<	t.join();
752	>
753	>	awaitTermination(t);
754		}
755
756		/**
#	Line 867 | Line 766 | public class LinkedTransferQueueTest ext
766
767		/**
768		* transfer waits until a poll occurs. The transfered element
769	<	* is returned by this associated poll.
769	>	* is returned by the associated poll.
770		*/
771		public void testTransfer2() throws InterruptedException {
772	<	final LinkedTransferQueue<Integer> q
773	<	= new LinkedTransferQueue<Integer>();
772	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
773	>	final CountDownLatch threadStarted = new CountDownLatch(1);
774
775		Thread t = newStartedThread(new CheckedRunnable() {
776		public void realRun() throws InterruptedException {
777	<	q.transfer(SIZE);
778	<	assertTrue(q.isEmpty());
777	>	threadStarted.countDown();
778	>	q.transfer(five);
779	>	checkEmpty(q);
780		}});
781
782	<	Thread.sleep(SHORT_DELAY_MS);
783	<	assertEquals(1, q.size());
784	<	assertEquals(SIZE, (int) q.poll());
785	<	assertTrue(q.isEmpty());
786	<	t.join();
782	>	threadStarted.await();
783	>	Callable<Boolean> oneElement
784	>	= new Callable<Boolean>() { public Boolean call() {
785	>	return !q.isEmpty() && q.size() == 1; }};
786	>	waitForThreadToEnterWaitState(t, oneElement);
787	>
788	>	assertSame(five, q.poll());
789	>	checkEmpty(q);
790	>	awaitTermination(t);
791		}
792
793		/**
794		* transfer waits until a poll occurs, and then transfers in fifo order
795		*/
796		public void testTransfer3() throws InterruptedException {
797	<	final LinkedTransferQueue<Integer> q
894	<	= new LinkedTransferQueue<Integer>();
797	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
798
799		Thread first = newStartedThread(new CheckedRunnable() {
800		public void realRun() throws InterruptedException {
801	<	Integer i = SIZE + 1;
802	<	q.transfer(i);
900	<	assertTrue(!q.contains(i));
801	>	q.transfer(four);
802	>	assertTrue(!q.contains(four));
803		assertEquals(1, q.size());
804		}});
805
806		Thread interruptedThread = newStartedThread(
807		new CheckedInterruptedRunnable() {
808		public void realRun() throws InterruptedException {
809	<	while (q.size() == 0)
809	>	while (q.isEmpty())
810		Thread.yield();
811	<	q.transfer(SIZE);
811	>	q.transfer(five);
812		}});
813
814		while (q.size() < 2)
815		Thread.yield();
816		assertEquals(2, q.size());
817	<	assertEquals(SIZE + 1, (int) q.poll());
817	>	assertSame(four, q.poll());
818		first.join();
819		assertEquals(1, q.size());
820		interruptedThread.interrupt();
821		interruptedThread.join();
822	<	assertEquals(0, q.size());
921	<	assertTrue(q.isEmpty());
822	>	checkEmpty(q);
823		}
824
825		/**
#	Line 935 | Line 836 | public class LinkedTransferQueueTest ext
836		assertSame(three, q.poll());
837		}});
838
839	<	Thread.sleep(SHORT_DELAY_MS);
839	>	while (q.isEmpty())
840	>	Thread.yield();
841	>	assertFalse(q.isEmpty());
842	>	assertEquals(1, q.size());
843		assertTrue(q.offer(three));
844		assertSame(four, q.poll());
845	<	t.join();
845	>	awaitTermination(t);
846		}
847
848		/**
849		* transfer waits until a take occurs. The transfered element
850	<	* is returned by this associated take.
850	>	* is returned by the associated take.
851		*/
852		public void testTransfer5() throws InterruptedException {
853	<	final LinkedTransferQueue<Integer> q
950	<	= new LinkedTransferQueue<Integer>();
853	>	final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
854
855		Thread t = newStartedThread(new CheckedRunnable() {
856		public void realRun() throws InterruptedException {
857	<	q.transfer(SIZE);
857	>	q.transfer(four);
858		checkEmpty(q);
859		}});
860
861	<	Thread.sleep(SHORT_DELAY_MS);
862	<	assertEquals(SIZE, (int) q.take());
861	>	while (q.isEmpty())
862	>	Thread.yield();
863	>	assertFalse(q.isEmpty());
864	>	assertEquals(1, q.size());
865	>	assertSame(four, q.take());
866		checkEmpty(q);
867	<	t.join();
867	>	awaitTermination(t);
868		}
869
870		/**
871		* tryTransfer(null) throws NullPointerException
872		*/
873		public void testTryTransfer1() {
874	+	final LinkedTransferQueue q = new LinkedTransferQueue();
875		try {
969	–	final LinkedTransferQueue q = new LinkedTransferQueue();
876		q.tryTransfer(null);
877		shouldThrow();
878		} catch (NullPointerException success) {}
#	Line 996 | Line 902 | public class LinkedTransferQueueTest ext
902		while (! q.hasWaitingConsumer())
903		Thread.yield();
904		assertTrue(q.hasWaitingConsumer());
905	<	assertTrue(q.isEmpty());
1000	<	assertEquals(q.size(), 0);
905	>	checkEmpty(q);
906		assertTrue(q.tryTransfer(hotPotato));
907		}});
908
909	<	assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
909	>	long startTime = System.nanoTime();
910	>	assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS));
911	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
912		checkEmpty(q);
913	<	t.join();
913	>	awaitTermination(t);
914		}
915
916		/**
#	Line 1019 | Line 926 | public class LinkedTransferQueueTest ext
926		while (! q.hasWaitingConsumer())
927		Thread.yield();
928		assertTrue(q.hasWaitingConsumer());
929	<	assertTrue(q.isEmpty());
1023	<	assertEquals(q.size(), 0);
929	>	checkEmpty(q);
930		assertTrue(q.tryTransfer(hotPotato));
931		}});
932
933		assertSame(q.take(), hotPotato);
934		checkEmpty(q);
935	<	t.join();
935	>	awaitTermination(t);
936		}
937
938		/**
939	<	* tryTransfer waits the amount given if interrupted, and
1034	<	* throws interrupted exception
939	>	* tryTransfer blocks interruptibly if no takers
940		*/
941		public void testTryTransfer5() throws InterruptedException {
942		final LinkedTransferQueue q = new LinkedTransferQueue();
943	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
944	+	assertTrue(q.isEmpty());
945
946	<	Thread toInterrupt = newStartedThread(new CheckedInterruptedRunnable() {
946	>	Thread t = newStartedThread(new CheckedRunnable() {
947		public void realRun() throws InterruptedException {
948	<	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
948	>	long startTime = System.nanoTime();
949	>	Thread.currentThread().interrupt();
950	>	try {
951	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
952	>	shouldThrow();
953	>	} catch (InterruptedException success) {}
954	>	assertFalse(Thread.interrupted());
955	>
956	>	pleaseInterrupt.countDown();
957	>	try {
958	>	q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
959	>	shouldThrow();
960	>	} catch (InterruptedException success) {}
961	>	assertFalse(Thread.interrupted());
962	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
963		}});
964
965	<	Thread.sleep(SMALL_DELAY_MS);
966	<	toInterrupt.interrupt();
967	<	toInterrupt.join();
965	>	await(pleaseInterrupt);
966	>	assertThreadStaysAlive(t);
967	>	t.interrupt();
968	>	awaitTermination(t);
969	>	checkEmpty(q);
970		}
971
972		/**
973	<	* tryTransfer gives up after the timeout and return false
973	>	* tryTransfer gives up after the timeout and returns false
974		*/
975		public void testTryTransfer6() throws InterruptedException {
976		final LinkedTransferQueue q = new LinkedTransferQueue();
977
978		Thread t = newStartedThread(new CheckedRunnable() {
979		public void realRun() throws InterruptedException {
980	<	long t0 = System.nanoTime();
980	>	long startTime = System.nanoTime();
981		assertFalse(q.tryTransfer(new Object(),
982	<	SHORT_DELAY_MS, MILLISECONDS));
983	<	long elapsed = NANOSECONDS.toMillis(System.nanoTime() - t0);
984	<	assertTrue(elapsed >= SHORT_DELAY_MS);
982	>	timeoutMillis(), MILLISECONDS));
983	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
984	>	checkEmpty(q);
985		}});
986
987	<	checkEmpty(q);
1065	<	awaitTermination(t, MEDIUM_DELAY_MS);
987	>	awaitTermination(t);
988		checkEmpty(q);
989		}
990
#	Line 1076 | Line 998 | public class LinkedTransferQueueTest ext
998
999		Thread t = newStartedThread(new CheckedRunnable() {
1000		public void realRun() throws InterruptedException {
1001	<	assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS));
1002	<	assertTrue(q.isEmpty());
1001	>	long startTime = System.nanoTime();
1002	>	assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS));
1003	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1004	>	checkEmpty(q);
1005		}});
1006
1007	<	Thread.sleep(SHORT_DELAY_MS);
1007	>	while (q.size() != 2)
1008	>	Thread.yield();
1009		assertEquals(2, q.size());
1010		assertSame(four, q.poll());
1011		assertSame(five, q.poll());
1012		checkEmpty(q);
1013	<	t.join();
1013	>	awaitTermination(t);
1014		}
1015
1016		/**
1017	<	* tryTransfer attempts to enqueue into the q and fails returning
1018	<	* false not enqueueing and the successive poll is null
1017	>	* tryTransfer attempts to enqueue into the queue and fails
1018	>	* returning false not enqueueing and the successive poll is null
1019		*/
1020		public void testTryTransfer8() throws InterruptedException {
1021		final LinkedTransferQueue q = new LinkedTransferQueue();
1022		assertTrue(q.offer(four));
1023		assertEquals(1, q.size());
1024	<	assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS));
1024	>	long startTime = System.nanoTime();
1025	>	assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS));
1026	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
1027		assertEquals(1, q.size());
1028		assertSame(four, q.poll());
1029		assertNull(q.poll());
#	Line 1104 | Line 1031 | public class LinkedTransferQueueTest ext
1031		}
1032
1033		private LinkedTransferQueue<Integer> populatedQueue(int n) {
1034	<	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
1035	<	assertTrue(q.isEmpty());
1034	>	LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>();
1035	>	checkEmpty(q);
1036		for (int i = 0; i < n; i++) {
1037		assertEquals(i, q.size());
1038		assertTrue(q.offer(i));
#	Line 1114 | Line 1041 | public class LinkedTransferQueueTest ext
1041		assertFalse(q.isEmpty());
1042		return q;
1043		}
1044	+
1045	+	/**
1046	+	* remove(null), contains(null) always return false
1047	+	*/
1048	+	public void testNeverContainsNull() {
1049	+	Collection<?>[] qs = {
1050	+	new LinkedTransferQueue<Object>(),
1051	+	populatedQueue(2),
1052	+	};
1053	+
1054	+	for (Collection<?> q : qs) {
1055	+	assertFalse(q.contains(null));
1056	+	assertFalse(q.remove(null));
1057	+	}
1058	+	}
1059		}

Diff Legend

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