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.53 by jsr166, Mon May 30 22:43:20 2011 UTC vs.
Revision 1.78 by jsr166, Sun Oct 16 20:44:18 2016 UTC

#	Line 6 | Line 6
6		* Pat Fisher, Mike Judd.
7		*/
8
9	<	import junit.framework.*;
10	<	import java.util.Arrays;
9	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
10	>
11		import java.util.ArrayList;
12	+	import java.util.Arrays;
13		import java.util.Collection;
14		import java.util.Iterator;
15		import java.util.NoSuchElementException;
#	Line 19 | Line 20 | import java.util.concurrent.DelayQueue;
20		import java.util.concurrent.Executors;
21		import java.util.concurrent.ExecutorService;
22		import java.util.concurrent.TimeUnit;
23	<	import static java.util.concurrent.TimeUnit.MILLISECONDS;
23	>
24	>	import junit.framework.Test;
25
26		public class DelayQueueTest extends JSR166TestCase {
27
#	Line 33 | Line 35 | public class DelayQueueTest extends JSR1
35		}
36
37		public static void main(String[] args) {
38	<	junit.textui.TestRunner.run(suite());
38	>	main(suite(), args);
39		}
40
41		public static Test suite() {
#	Line 41 | Line 43 | public class DelayQueueTest extends JSR1
43		new Generic().testSuite());
44		}
45
44	–	private static final int NOCAP = Integer.MAX_VALUE;
45	–
46		/**
47		* A delayed implementation for testing.
48		* Most tests use Pseudodelays, where delays are all elapsed
#	Line 50 | Line 50 | public class DelayQueueTest extends JSR1
50		*/
51		static class PDelay implements Delayed {
52		int pseudodelay;
53	<	PDelay(int i) { pseudodelay = Integer.MIN_VALUE + i; }
54	<	public int compareTo(PDelay y) {
55	<	int i = pseudodelay;
56	<	int j = y.pseudodelay;
57	<	if (i < j) return -1;
58	<	if (i > j) return 1;
59	<	return 0;
53	>	PDelay(int i) { pseudodelay = i; }
54	>	public int compareTo(PDelay other) {
55	>	int a = this.pseudodelay;
56	>	int b = other.pseudodelay;
57	>	return (a < b) ? -1 : (a > b) ? 1 : 0;
58		}
61	–
59		public int compareTo(Delayed y) {
60		return compareTo((PDelay)y);
61		}
65	–
62		public boolean equals(Object other) {
63	<	return equals((PDelay)other);
64	<	}
69	<	public boolean equals(PDelay other) {
70	<	return other.pseudodelay == pseudodelay;
63	>	return (other instanceof PDelay) &&
64	>	this.pseudodelay == ((PDelay)other).pseudodelay;
65		}
66	<
66	>	// suppress [overrides] javac warning
67	>	public int hashCode() { return pseudodelay; }
68		public long getDelay(TimeUnit ignore) {
69	<	return pseudodelay;
75	<	}
76	<	public int intValue() {
77	<	return pseudodelay;
69	>	return Integer.MIN_VALUE + pseudodelay;
70		}
79	–
71		public String toString() {
72		return String.valueOf(pseudodelay);
73		}
#	Line 103 | Line 94 | public class DelayQueueTest extends JSR1
94		}
95
96		public boolean equals(Object other) {
97	<	return equals((NanoDelay)other);
98	<	}
108	<	public boolean equals(NanoDelay other) {
109	<	return other.trigger == trigger;
97	>	return (other instanceof NanoDelay) &&
98	>	this.trigger == ((NanoDelay)other).trigger;
99		}
100
101	+	// suppress [overrides] javac warning
102	+	public int hashCode() { return (int) trigger; }
103	+
104		public long getDelay(TimeUnit unit) {
105		long n = trigger - System.nanoTime();
106		return unit.convert(n, TimeUnit.NANOSECONDS);
#	Line 124 | Line 116 | public class DelayQueueTest extends JSR1
116		}
117
118		/**
119	<	* Create a queue of given size containing consecutive
120	<	* PDelays 0 ... n.
119	>	* Returns a new queue of given size containing consecutive
120	>	* PDelays 0 ... n - 1.
121		*/
122		private DelayQueue<PDelay> populatedQueue(int n) {
123		DelayQueue<PDelay> q = new DelayQueue<PDelay>();
124		assertTrue(q.isEmpty());
125	<	for (int i = n-1; i >= 0; i-=2)
125	>	for (int i = n - 1; i >= 0; i -= 2)
126		assertTrue(q.offer(new PDelay(i)));
127	<	for (int i = (n & 1); i < n; i+=2)
127	>	for (int i = (n & 1); i < n; i += 2)
128		assertTrue(q.offer(new PDelay(i)));
129		assertFalse(q.isEmpty());
130	<	assertEquals(NOCAP, q.remainingCapacity());
130	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
131		assertEquals(n, q.size());
132	+	assertEquals(new PDelay(0), q.peek());
133		return q;
134		}
135
#	Line 144 | Line 137 | public class DelayQueueTest extends JSR1
137		* A new queue has unbounded capacity
138		*/
139		public void testConstructor1() {
140	<	assertEquals(NOCAP, new DelayQueue().remainingCapacity());
140	>	assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity());
141		}
142
143		/**
#	Line 152 | Line 145 | public class DelayQueueTest extends JSR1
145		*/
146		public void testConstructor3() {
147		try {
148	<	DelayQueue q = new DelayQueue(null);
148	>	new DelayQueue(null);
149		shouldThrow();
150		} catch (NullPointerException success) {}
151		}
#	Line 162 | Line 155 | public class DelayQueueTest extends JSR1
155		*/
156		public void testConstructor4() {
157		try {
158	<	PDelay[] ints = new PDelay[SIZE];
166	<	DelayQueue q = new DelayQueue(Arrays.asList(ints));
158	>	new DelayQueue(Arrays.asList(new PDelay[SIZE]));
159		shouldThrow();
160		} catch (NullPointerException success) {}
161		}
#	Line 172 | Line 164 | public class DelayQueueTest extends JSR1
164		* Initializing from Collection with some null elements throws NPE
165		*/
166		public void testConstructor5() {
167	+	PDelay[] a = new PDelay[SIZE];
168	+	for (int i = 0; i < SIZE - 1; ++i)
169	+	a[i] = new PDelay(i);
170		try {
171	<	PDelay[] ints = new PDelay[SIZE];
177	<	for (int i = 0; i < SIZE-1; ++i)
178	<	ints[i] = new PDelay(i);
179	<	DelayQueue q = new DelayQueue(Arrays.asList(ints));
171	>	new DelayQueue(Arrays.asList(a));
172		shouldThrow();
173		} catch (NullPointerException success) {}
174		}
#	Line 199 | Line 191 | public class DelayQueueTest extends JSR1
191		public void testEmpty() {
192		DelayQueue q = new DelayQueue();
193		assertTrue(q.isEmpty());
194	<	assertEquals(NOCAP, q.remainingCapacity());
194	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
195		q.add(new PDelay(1));
196		assertFalse(q.isEmpty());
197		q.add(new PDelay(2));
#	Line 209 | Line 201 | public class DelayQueueTest extends JSR1
201		}
202
203		/**
204	<	* remainingCapacity does not change when elements added or removed,
213	<	* but size does
204	>	* remainingCapacity() always returns Integer.MAX_VALUE
205		*/
206		public void testRemainingCapacity() {
207	<	DelayQueue q = populatedQueue(SIZE);
207	>	BlockingQueue q = populatedQueue(SIZE);
208		for (int i = 0; i < SIZE; ++i) {
209	<	assertEquals(NOCAP, q.remainingCapacity());
210	<	assertEquals(SIZE-i, q.size());
211	<	q.remove();
209	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
210	>	assertEquals(SIZE - i, q.size());
211	>	assertTrue(q.remove() instanceof PDelay);
212		}
213		for (int i = 0; i < SIZE; ++i) {
214	<	assertEquals(NOCAP, q.remainingCapacity());
214	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
215		assertEquals(i, q.size());
216	<	q.add(new PDelay(i));
216	>	assertTrue(q.add(new PDelay(i)));
217		}
218		}
219
#	Line 250 | Line 241 | public class DelayQueueTest extends JSR1
241		* addAll(this) throws IAE
242		*/
243		public void testAddAllSelf() {
244	+	DelayQueue q = populatedQueue(SIZE);
245		try {
254	–	DelayQueue q = populatedQueue(SIZE);
246		q.addAll(q);
247		shouldThrow();
248		} catch (IllegalArgumentException success) {}
#	Line 262 | Line 253 | public class DelayQueueTest extends JSR1
253		* possibly adding some elements
254		*/
255		public void testAddAll3() {
256	+	DelayQueue q = new DelayQueue();
257	+	PDelay[] a = new PDelay[SIZE];
258	+	for (int i = 0; i < SIZE - 1; ++i)
259	+	a[i] = new PDelay(i);
260		try {
261	<	DelayQueue q = new DelayQueue();
267	<	PDelay[] ints = new PDelay[SIZE];
268	<	for (int i = 0; i < SIZE-1; ++i)
269	<	ints[i] = new PDelay(i);
270	<	q.addAll(Arrays.asList(ints));
261	>	q.addAll(Arrays.asList(a));
262		shouldThrow();
263		} catch (NullPointerException success) {}
264		}
#	Line 278 | Line 269 | public class DelayQueueTest extends JSR1
269		public void testAddAll5() {
270		PDelay[] empty = new PDelay[0];
271		PDelay[] ints = new PDelay[SIZE];
272	<	for (int i = SIZE-1; i >= 0; --i)
272	>	for (int i = SIZE - 1; i >= 0; --i)
273		ints[i] = new PDelay(i);
274		DelayQueue q = new DelayQueue();
275		assertFalse(q.addAll(Arrays.asList(empty)));
#	Line 293 | Line 284 | public class DelayQueueTest extends JSR1
284		public void testPut() {
285		DelayQueue q = new DelayQueue();
286		for (int i = 0; i < SIZE; ++i) {
287	<	PDelay I = new PDelay(i);
288	<	q.put(I);
289	<	assertTrue(q.contains(I));
287	>	PDelay x = new PDelay(i);
288	>	q.put(x);
289	>	assertTrue(q.contains(x));
290		}
291		assertEquals(SIZE, q.size());
292		}
#	Line 339 | Line 330 | public class DelayQueueTest extends JSR1
330		public void testTake() throws InterruptedException {
331		DelayQueue q = populatedQueue(SIZE);
332		for (int i = 0; i < SIZE; ++i) {
333	<	assertEquals(new PDelay(i), ((PDelay)q.take()));
333	>	assertEquals(new PDelay(i), q.take());
334		}
335		}
336
#	Line 382 | Line 373 | public class DelayQueueTest extends JSR1
373		public void testPoll() {
374		DelayQueue q = populatedQueue(SIZE);
375		for (int i = 0; i < SIZE; ++i) {
376	<	assertEquals(new PDelay(i), ((PDelay)q.poll()));
376	>	assertEquals(new PDelay(i), q.poll());
377		}
378		assertNull(q.poll());
379		}
#	Line 393 | Line 384 | public class DelayQueueTest extends JSR1
384		public void testTimedPoll0() throws InterruptedException {
385		DelayQueue q = populatedQueue(SIZE);
386		for (int i = 0; i < SIZE; ++i) {
387	<	assertEquals(new PDelay(i), ((PDelay)q.poll(0, MILLISECONDS)));
387	>	assertEquals(new PDelay(i), q.poll(0, MILLISECONDS));
388		}
389		assertNull(q.poll(0, MILLISECONDS));
390		}
#	Line 405 | Line 396 | public class DelayQueueTest extends JSR1
396		DelayQueue q = populatedQueue(SIZE);
397		for (int i = 0; i < SIZE; ++i) {
398		long startTime = System.nanoTime();
399	<	assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS)));
399	>	assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS));
400		assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
401		}
402		long startTime = System.nanoTime();
#	Line 420 | Line 411 | public class DelayQueueTest extends JSR1
411		*/
412		public void testInterruptedTimedPoll() throws InterruptedException {
413		final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
414	+	final DelayQueue q = populatedQueue(SIZE);
415		Thread t = newStartedThread(new CheckedRunnable() {
416		public void realRun() throws InterruptedException {
417	<	DelayQueue q = populatedQueue(SIZE);
417	>	long startTime = System.nanoTime();
418		for (int i = 0; i < SIZE; ++i) {
419	<	assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS)));
419	>	assertEquals(new PDelay(i),
420	>	((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS)));
421		}
422
423		Thread.currentThread().interrupt();
#	Line 440 | Line 433 | public class DelayQueueTest extends JSR1
433		shouldThrow();
434		} catch (InterruptedException success) {}
435		assertFalse(Thread.interrupted());
436	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
437		}});
438
439		await(pleaseInterrupt);
440		assertThreadStaysAlive(t);
441		t.interrupt();
442		awaitTermination(t);
443	+	checkEmpty(q);
444		}
445
446		/**
#	Line 454 | Line 449 | public class DelayQueueTest extends JSR1
449		public void testPeek() {
450		DelayQueue q = populatedQueue(SIZE);
451		for (int i = 0; i < SIZE; ++i) {
452	<	assertEquals(new PDelay(i), ((PDelay)q.peek()));
453	<	assertEquals(new PDelay(i), ((PDelay)q.poll()));
452	>	assertEquals(new PDelay(i), q.peek());
453	>	assertEquals(new PDelay(i), q.poll());
454		if (q.isEmpty())
455		assertNull(q.peek());
456		else
#	Line 470 | Line 465 | public class DelayQueueTest extends JSR1
465		public void testElement() {
466		DelayQueue q = populatedQueue(SIZE);
467		for (int i = 0; i < SIZE; ++i) {
468	<	assertEquals(new PDelay(i), ((PDelay)q.element()));
468	>	assertEquals(new PDelay(i), q.element());
469		q.poll();
470		}
471		try {
#	Line 485 | Line 480 | public class DelayQueueTest extends JSR1
480		public void testRemove() {
481		DelayQueue q = populatedQueue(SIZE);
482		for (int i = 0; i < SIZE; ++i) {
483	<	assertEquals(new PDelay(i), ((PDelay)q.remove()));
483	>	assertEquals(new PDelay(i), q.remove());
484		}
485		try {
486		q.remove();
#	Line 494 | Line 489 | public class DelayQueueTest extends JSR1
489		}
490
491		/**
497	–	* remove(x) removes x and returns true if present
498	–	*/
499	–	public void testRemoveElement() {
500	–	DelayQueue q = populatedQueue(SIZE);
501	–	for (int i = 1; i < SIZE; i+=2) {
502	–	assertTrue(q.remove(new PDelay(i)));
503	–	}
504	–	for (int i = 0; i < SIZE; i+=2) {
505	–	assertTrue(q.remove(new PDelay(i)));
506	–	assertFalse(q.remove(new PDelay(i+1)));
507	–	}
508	–	assertTrue(q.isEmpty());
509	–	}
510	–
511	–	/**
492		* contains(x) reports true when elements added but not yet removed
493		*/
494		public void testContains() {
#	Line 528 | Line 508 | public class DelayQueueTest extends JSR1
508		q.clear();
509		assertTrue(q.isEmpty());
510		assertEquals(0, q.size());
511	<	assertEquals(NOCAP, q.remainingCapacity());
511	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
512		PDelay x = new PDelay(1);
513		q.add(x);
514		assertFalse(q.isEmpty());
#	Line 565 | Line 545 | public class DelayQueueTest extends JSR1
545		assertTrue(changed);
546
547		assertTrue(q.containsAll(p));
548	<	assertEquals(SIZE-i, q.size());
548	>	assertEquals(SIZE - i, q.size());
549		p.remove();
550		}
551		}
#	Line 578 | Line 558 | public class DelayQueueTest extends JSR1
558		DelayQueue q = populatedQueue(SIZE);
559		DelayQueue p = populatedQueue(i);
560		assertTrue(q.removeAll(p));
561	<	assertEquals(SIZE-i, q.size());
561	>	assertEquals(SIZE - i, q.size());
562		for (int j = 0; j < i; ++j) {
563	<	PDelay I = (PDelay)(p.remove());
564	<	assertFalse(q.contains(I));
563	>	PDelay x = (PDelay)(p.remove());
564	>	assertFalse(q.contains(x));
565		}
566		}
567		}
#	Line 633 | Line 613 | public class DelayQueueTest extends JSR1
613		++i;
614		}
615		assertEquals(i, SIZE);
616	+	assertIteratorExhausted(it);
617	+	}
618	+
619	+	/**
620	+	* iterator of empty collection has no elements
621	+	*/
622	+	public void testEmptyIterator() {
623	+	assertIteratorExhausted(new DelayQueue().iterator());
624		}
625
626		/**
#	Line 647 | Line 635 | public class DelayQueueTest extends JSR1
635		it.next();
636		it.remove();
637		it = q.iterator();
638	<	assertEquals(it.next(), new PDelay(2));
639	<	assertEquals(it.next(), new PDelay(3));
638	>	assertEquals(new PDelay(2), it.next());
639	>	assertEquals(new PDelay(3), it.next());
640		assertFalse(it.hasNext());
641		}
642
#	Line 658 | Line 646 | public class DelayQueueTest extends JSR1
646		public void testToString() {
647		DelayQueue q = populatedQueue(SIZE);
648		String s = q.toString();
649	<	for (int i = 0; i < SIZE; ++i) {
650	<	assertTrue(s.contains(String.valueOf(Integer.MIN_VALUE+i)));
663	<	}
649	>	for (Object e : q)
650	>	assertTrue(s.contains(e.toString()));
651		}
652
653		/**
#	Line 669 | Line 656 | public class DelayQueueTest extends JSR1
656		public void testPollInExecutor() {
657		final DelayQueue q = new DelayQueue();
658		final CheckedBarrier threadsStarted = new CheckedBarrier(2);
659	<	ExecutorService executor = Executors.newFixedThreadPool(2);
660	<	executor.execute(new CheckedRunnable() {
661	<	public void realRun() throws InterruptedException {
662	<	assertNull(q.poll());
663	<	threadsStarted.await();
664	<	assertTrue(null != q.poll(LONG_DELAY_MS, MILLISECONDS));
665	<	checkEmpty(q);
666	<	}});
667	<
668	<	executor.execute(new CheckedRunnable() {
669	<	public void realRun() throws InterruptedException {
670	<	threadsStarted.await();
671	<	q.put(new PDelay(1));
672	<	}});
673	<
674	<	joinPool(executor);
659	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
660	>	try (PoolCleaner cleaner = cleaner(executor)) {
661	>	executor.execute(new CheckedRunnable() {
662	>	public void realRun() throws InterruptedException {
663	>	assertNull(q.poll());
664	>	threadsStarted.await();
665	>	assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS));
666	>	checkEmpty(q);
667	>	}});
668	>
669	>	executor.execute(new CheckedRunnable() {
670	>	public void realRun() throws InterruptedException {
671	>	threadsStarted.await();
672	>	q.put(new PDelay(1));
673	>	}});
674	>	}
675		}
676
677		/**
#	Line 746 | Line 733 | public class DelayQueueTest extends JSR1
733		}
734		ArrayList l = new ArrayList();
735		q.drainTo(l);
736	<	assertEquals(q.size(), 0);
736	>	assertEquals(0, q.size());
737		for (int i = 0; i < SIZE; ++i)
738	<	assertEquals(l.get(i), elems[i]);
738	>	assertEquals(elems[i], l.get(i));
739		q.add(elems[0]);
740		q.add(elems[1]);
741		assertFalse(q.isEmpty());
#	Line 756 | Line 743 | public class DelayQueueTest extends JSR1
743		assertTrue(q.contains(elems[1]));
744		l.clear();
745		q.drainTo(l);
746	<	assertEquals(q.size(), 0);
747	<	assertEquals(l.size(), 2);
746	>	assertEquals(0, q.size());
747	>	assertEquals(2, l.size());
748		for (int i = 0; i < 2; ++i)
749	<	assertEquals(l.get(i), elems[i]);
749	>	assertEquals(elems[i], l.get(i));
750		}
751
752		/**
#	Line 769 | Line 756 | public class DelayQueueTest extends JSR1
756		final DelayQueue q = populatedQueue(SIZE);
757		Thread t = new Thread(new CheckedRunnable() {
758		public void realRun() {
759	<	q.put(new PDelay(SIZE+1));
759	>	q.put(new PDelay(SIZE + 1));
760		}});
761
762		t.start();
#	Line 789 | Line 776 | public class DelayQueueTest extends JSR1
776		ArrayList l = new ArrayList();
777		q.drainTo(l, i);
778		int k = (i < SIZE) ? i : SIZE;
779	<	assertEquals(q.size(), SIZE-k);
780	<	assertEquals(l.size(), k);
779	>	assertEquals(SIZE - k, q.size());
780	>	assertEquals(k, l.size());
781		}
782		}
783
784	+	/**
785	+	* remove(null), contains(null) always return false
786	+	*/
787	+	public void testNeverContainsNull() {
788	+	Collection<?> q = populatedQueue(SIZE);
789	+	assertFalse(q.contains(null));
790	+	assertFalse(q.remove(null));
791	+	}
792		}

Diff Legend

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