ViewVC Help

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

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

Comparing jsr166/src/test/tck/DelayQueueTest.java (file contents):
Revision 1.50 by jsr166, Fri May 27 20:07:24 2011 UTC vs.
Revision 1.60 by jsr166, Tue Feb 21 02:04:17 2012 UTC

#	Line 7 | Line 7
7		*/
8
9		import junit.framework.*;
10	<	import java.util.*;
10	>	import java.util.Arrays;
11	>	import java.util.ArrayList;
12	>	import java.util.Iterator;
13	>	import java.util.NoSuchElementException;
14	>	import java.util.concurrent.BlockingQueue;
15	>	import java.util.concurrent.CountDownLatch;
16	>	import java.util.concurrent.Delayed;
17	>	import java.util.concurrent.DelayQueue;
18	>	import java.util.concurrent.Executors;
19	>	import java.util.concurrent.ExecutorService;
20	>	import java.util.concurrent.TimeUnit;
21		import static java.util.concurrent.TimeUnit.MILLISECONDS;
12	–	import java.util.concurrent.*;
22
23		public class DelayQueueTest extends JSR166TestCase {
24	+
25	+	public static class Generic extends BlockingQueueTest {
26	+	protected BlockingQueue emptyCollection() {
27	+	return new DelayQueue();
28	+	}
29	+	protected PDelay makeElement(int i) {
30	+	return new PDelay(i);
31	+	}
32	+	}
33	+
34		public static void main(String[] args) {
35		junit.textui.TestRunner.run(suite());
36		}
37
38		public static Test suite() {
39	<	return new TestSuite(DelayQueueTest.class);
39	>	return newTestSuite(DelayQueueTest.class,
40	>	new Generic().testSuite());
41		}
42
43		private static final int NOCAP = Integer.MAX_VALUE;
#	Line 29 | Line 49 | public class DelayQueueTest extends JSR1
49		*/
50		static class PDelay implements Delayed {
51		int pseudodelay;
52	<	PDelay(int i) { pseudodelay = Integer.MIN_VALUE + i; }
53	<	public int compareTo(PDelay y) {
54	<	int i = pseudodelay;
55	<	int j = y.pseudodelay;
56	<	if (i < j) return -1;
37	<	if (i > j) return 1;
38	<	return 0;
52	>	PDelay(int i) { pseudodelay = i; }
53	>	public int compareTo(PDelay other) {
54	>	int a = this.pseudodelay;
55	>	int b = other.pseudodelay;
56	>	return (a < b) ? -1 : (a > b) ? 1 : 0;
57		}
40	–
58		public int compareTo(Delayed y) {
59		return compareTo((PDelay)y);
60		}
44	–
61		public boolean equals(Object other) {
62	<	return equals((PDelay)other);
62	>	return (other instanceof PDelay) &&
63	>	this.pseudodelay == ((PDelay)other).pseudodelay;
64		}
48	–	public boolean equals(PDelay other) {
49	–	return other.pseudodelay == pseudodelay;
50	–	}
51	–
65		public long getDelay(TimeUnit ignore) {
66	<	return pseudodelay;
54	<	}
55	<	public int intValue() {
56	<	return pseudodelay;
66	>	return Integer.MIN_VALUE + pseudodelay;
67		}
58	–
68		public String toString() {
69		return String.valueOf(pseudodelay);
70		}
#	Line 103 | Line 112 | public class DelayQueueTest extends JSR1
112		}
113
114		/**
115	<	* Create a queue of given size containing consecutive
115	>	* Returns a new queue of given size containing consecutive
116		* PDelays 0 ... n.
117		*/
118		private DelayQueue<PDelay> populatedQueue(int n) {
#	Line 206 | Line 215 | public class DelayQueueTest extends JSR1
215		}
216
217		/**
209	–	* offer(null) throws NPE
210	–	*/
211	–	public void testOfferNull() {
212	–	try {
213	–	DelayQueue q = new DelayQueue();
214	–	q.offer(null);
215	–	shouldThrow();
216	–	} catch (NullPointerException success) {}
217	–	}
218	–
219	–	/**
220	–	* add(null) throws NPE
221	–	*/
222	–	public void testAddNull() {
223	–	try {
224	–	DelayQueue q = new DelayQueue();
225	–	q.add(null);
226	–	shouldThrow();
227	–	} catch (NullPointerException success) {}
228	–	}
229	–
230	–	/**
218		* offer non-null succeeds
219		*/
220		public void testOffer() {
#	Line 248 | Line 235 | public class DelayQueueTest extends JSR1
235		}
236
237		/**
251	–	* addAll(null) throws NPE
252	–	*/
253	–	public void testAddAll1() {
254	–	try {
255	–	DelayQueue q = new DelayQueue();
256	–	q.addAll(null);
257	–	shouldThrow();
258	–	} catch (NullPointerException success) {}
259	–	}
260	–
261	–	/**
238		* addAll(this) throws IAE
239		*/
240		public void testAddAllSelf() {
#	Line 270 | Line 246 | public class DelayQueueTest extends JSR1
246		}
247
248		/**
273	–	* addAll of a collection with null elements throws NPE
274	–	*/
275	–	public void testAddAll2() {
276	–	try {
277	–	DelayQueue q = new DelayQueue();
278	–	PDelay[] ints = new PDelay[SIZE];
279	–	q.addAll(Arrays.asList(ints));
280	–	shouldThrow();
281	–	} catch (NullPointerException success) {}
282	–	}
283	–
284	–	/**
249		* addAll of a collection with any null elements throws NPE after
250		* possibly adding some elements
251		*/
#	Line 312 | Line 276 | public class DelayQueueTest extends JSR1
276		}
277
278		/**
315	–	* put(null) throws NPE
316	–	*/
317	–	public void testPutNull() {
318	–	try {
319	–	DelayQueue q = new DelayQueue();
320	–	q.put(null);
321	–	shouldThrow();
322	–	} catch (NullPointerException success) {}
323	–	}
324	–
325	–	/**
279		* all elements successfully put are contained
280		*/
281		public void testPut() {
#	Line 379 | Line 332 | public class DelayQueueTest extends JSR1
332		}
333
334		/**
382	–	* take blocks interruptibly when empty
383	–	*/
384	–	public void testTakeFromEmptyBlocksInterruptibly()
385	–	throws InterruptedException {
386	–	final BlockingQueue q = new DelayQueue();
387	–	final CountDownLatch threadStarted = new CountDownLatch(1);
388	–	Thread t = newStartedThread(new CheckedRunnable() {
389	–	public void realRun() {
390	–	threadStarted.countDown();
391	–	try {
392	–	q.take();
393	–	shouldThrow();
394	–	} catch (InterruptedException success) {}
395	–	assertFalse(Thread.interrupted());
396	–	}});
397	–
398	–	await(threadStarted);
399	–	assertThreadStaysAlive(t);
400	–	t.interrupt();
401	–	awaitTermination(t);
402	–	}
403	–
404	–	/**
335		* Take removes existing elements until empty, then blocks interruptibly
336		*/
337		public void testBlockingTake() throws InterruptedException {
#	Line 462 | Line 392 | public class DelayQueueTest extends JSR1
392		public void testTimedPoll() throws InterruptedException {
393		DelayQueue q = populatedQueue(SIZE);
394		for (int i = 0; i < SIZE; ++i) {
395	<	assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS)));
395	>	long startTime = System.nanoTime();
396	>	assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS)));
397	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
398		}
399	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
399	>	long startTime = System.nanoTime();
400	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
401	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
402	>	checkEmpty(q);
403		}
404
405		/**
#	Line 502 | Line 437 | public class DelayQueueTest extends JSR1
437		}
438
439		/**
505	–	* timed poll before a delayed offer fails; after offer succeeds;
506	–	* on interruption throws
507	–	*/
508	–	public void testTimedPollWithOffer() throws InterruptedException {
509	–	final DelayQueue q = new DelayQueue();
510	–	final PDelay pdelay = new PDelay(0);
511	–	final CheckedBarrier barrier = new CheckedBarrier(2);
512	–	Thread t = newStartedThread(new CheckedRunnable() {
513	–	public void realRun() throws InterruptedException {
514	–	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
515	–
516	–	barrier.await();
517	–	assertSame(pdelay, q.poll(LONG_DELAY_MS, MILLISECONDS));
518	–
519	–	Thread.currentThread().interrupt();
520	–	try {
521	–	q.poll(LONG_DELAY_MS, MILLISECONDS);
522	–	shouldThrow();
523	–	} catch (InterruptedException success) {}
524	–	assertFalse(Thread.interrupted());
525	–
526	–	barrier.await();
527	–	try {
528	–	q.poll(LONG_DELAY_MS, MILLISECONDS);
529	–	shouldThrow();
530	–	} catch (InterruptedException success) {}
531	–	assertFalse(Thread.interrupted());
532	–	}});
533	–
534	–	barrier.await();
535	–	long startTime = System.nanoTime();
536	–	assertTrue(q.offer(pdelay, LONG_DELAY_MS, MILLISECONDS));
537	–	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
538	–
539	–	barrier.await();
540	–	assertThreadStaysAlive(t);
541	–	t.interrupt();
542	–	awaitTermination(t);
543	–	}
544	–
545	–	/**
440		* peek returns next element, or null if empty
441		*/
442		public void testPeek() {
#	Line 588 | Line 482 | public class DelayQueueTest extends JSR1
482		}
483
484		/**
591	–	* remove(x) removes x and returns true if present
592	–	*/
593	–	public void testRemoveElement() {
594	–	DelayQueue q = populatedQueue(SIZE);
595	–	for (int i = 1; i < SIZE; i+=2) {
596	–	assertTrue(q.remove(new PDelay(i)));
597	–	}
598	–	for (int i = 0; i < SIZE; i+=2) {
599	–	assertTrue(q.remove(new PDelay(i)));
600	–	assertFalse(q.remove(new PDelay(i+1)));
601	–	}
602	–	assertTrue(q.isEmpty());
603	–	}
604	–
605	–	/**
485		* contains(x) reports true when elements added but not yet removed
486		*/
487		public void testContains() {
#	Line 705 | Line 584 | public class DelayQueueTest extends JSR1
584		}
585
586		/**
708	–	* toArray(null) throws NullPointerException
709	–	*/
710	–	public void testToArray_NullArg() {
711	–	DelayQueue q = populatedQueue(SIZE);
712	–	try {
713	–	q.toArray(null);
714	–	shouldThrow();
715	–	} catch (NullPointerException success) {}
716	–	}
717	–
718	–	/**
587		* toArray(incompatible array type) throws ArrayStoreException
588		*/
589		public void testToArray1_BadArg() {
#	Line 752 | Line 620 | public class DelayQueueTest extends JSR1
620		it.next();
621		it.remove();
622		it = q.iterator();
623	<	assertEquals(it.next(), new PDelay(2));
624	<	assertEquals(it.next(), new PDelay(3));
623	>	assertEquals(new PDelay(2), it.next());
624	>	assertEquals(new PDelay(3), it.next());
625		assertFalse(it.hasNext());
626		}
627
#	Line 763 | Line 631 | public class DelayQueueTest extends JSR1
631		public void testToString() {
632		DelayQueue q = populatedQueue(SIZE);
633		String s = q.toString();
634	<	for (int i = 0; i < SIZE; ++i) {
635	<	assertTrue(s.contains(String.valueOf(Integer.MIN_VALUE+i)));
768	<	}
634	>	for (Object e : q)
635	>	assertTrue(s.contains(e.toString()));
636		}
637
638		/**
#	Line 836 | Line 703 | public class DelayQueueTest extends JSR1
703		public void testTimedPollDelayed() throws InterruptedException {
704		DelayQueue q = new DelayQueue();
705		q.add(new NanoDelay(LONG_DELAY_MS * 1000000L));
706	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
840	<	}
841	<
842	<	/**
843	<	* drainTo(null) throws NPE
844	<	*/
845	<	public void testDrainToNull() {
846	<	DelayQueue q = populatedQueue(SIZE);
847	<	try {
848	<	q.drainTo(null);
849	<	shouldThrow();
850	<	} catch (NullPointerException success) {}
851	<	}
852	<
853	<	/**
854	<	* drainTo(this) throws IAE
855	<	*/
856	<	public void testDrainToSelf() {
857	<	DelayQueue q = populatedQueue(SIZE);
858	<	try {
859	<	q.drainTo(q);
860	<	shouldThrow();
861	<	} catch (IllegalArgumentException success) {}
706	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
707		}
708
709		/**
#	Line 873 | Line 718 | public class DelayQueueTest extends JSR1
718		}
719		ArrayList l = new ArrayList();
720		q.drainTo(l);
721	<	assertEquals(q.size(), 0);
721	>	assertEquals(0, q.size());
722		for (int i = 0; i < SIZE; ++i)
723	<	assertEquals(l.get(i), elems[i]);
723	>	assertEquals(elems[i], l.get(i));
724		q.add(elems[0]);
725		q.add(elems[1]);
726		assertFalse(q.isEmpty());
#	Line 883 | Line 728 | public class DelayQueueTest extends JSR1
728		assertTrue(q.contains(elems[1]));
729		l.clear();
730		q.drainTo(l);
731	<	assertEquals(q.size(), 0);
732	<	assertEquals(l.size(), 2);
731	>	assertEquals(0, q.size());
732	>	assertEquals(2, l.size());
733		for (int i = 0; i < 2; ++i)
734	<	assertEquals(l.get(i), elems[i]);
734	>	assertEquals(elems[i], l.get(i));
735		}
736
737		/**
#	Line 908 | Line 753 | public class DelayQueueTest extends JSR1
753		}
754
755		/**
911	–	* drainTo(null, n) throws NPE
912	–	*/
913	–	public void testDrainToNullN() {
914	–	DelayQueue q = populatedQueue(SIZE);
915	–	try {
916	–	q.drainTo(null, 0);
917	–	shouldThrow();
918	–	} catch (NullPointerException success) {}
919	–	}
920	–
921	–	/**
922	–	* drainTo(this, n) throws IAE
923	–	*/
924	–	public void testDrainToSelfN() {
925	–	DelayQueue q = populatedQueue(SIZE);
926	–	try {
927	–	q.drainTo(q, 0);
928	–	shouldThrow();
929	–	} catch (IllegalArgumentException success) {}
930	–	}
931	–
932	–	/**
756		* drainTo(c, n) empties first min(n, size) elements of queue into c
757		*/
758		public void testDrainToN() {
#	Line 938 | Line 761 | public class DelayQueueTest extends JSR1
761		ArrayList l = new ArrayList();
762		q.drainTo(l, i);
763		int k = (i < SIZE) ? i : SIZE;
764	<	assertEquals(q.size(), SIZE-k);
765	<	assertEquals(l.size(), k);
764	>	assertEquals(SIZE-k, q.size());
765	>	assertEquals(k, l.size());
766		}
767		}
768

Diff Legend

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