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.11 by dl, Sun Oct 31 14:55:14 2004 UTC vs.
Revision 1.77 by jsr166, Thu Sep 15 17:07:16 2016 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
5	<	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	<	* Pat Fisher, Mike Judd.
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9	<	import junit.framework.*;
10	<	import java.util.*;
11	<	import java.util.concurrent.*;
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;
16	>	import java.util.concurrent.BlockingQueue;
17	>	import java.util.concurrent.CountDownLatch;
18	>	import java.util.concurrent.Delayed;
19	>	import java.util.concurrent.DelayQueue;
20	>	import java.util.concurrent.Executors;
21	>	import java.util.concurrent.ExecutorService;
22	>	import java.util.concurrent.TimeUnit;
23	>
24	>	import junit.framework.Test;
25
26		public class DelayQueueTest extends JSR166TestCase {
27	+
28	+	public static class Generic extends BlockingQueueTest {
29	+	protected BlockingQueue emptyCollection() {
30	+	return new DelayQueue();
31	+	}
32	+	protected PDelay makeElement(int i) {
33	+	return new PDelay(i);
34	+	}
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() {
42	<	return new TestSuite(DelayQueueTest.class);
42	>	return newTestSuite(DelayQueueTest.class,
43	>	new Generic().testSuite());
44		}
45
22	–	private static final int NOCAP = Integer.MAX_VALUE;
23	–
46		/**
47		* A delayed implementation for testing.
48	<	* Most  tests use Pseudodelays, where delays are all elapsed
48	>	* Most tests use Pseudodelays, where delays are all elapsed
49		* (so, no blocking solely for delays) but are still ordered
50	<	*/
51	<	static class PDelay implements Delayed {
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 = ((PDelay)y).pseudodelay;
57	<	if (i < j) return -1;
36	<	if (i > j) return 1;
37	<	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		}
39	–
59		public int compareTo(Delayed y) {
60	<	int i = pseudodelay;
42	<	int j = ((PDelay)y).pseudodelay;
43	<	if (i < j) return -1;
44	<	if (i > j) return 1;
45	<	return 0;
60	>	return compareTo((PDelay)y);
61		}
47	–
62		public boolean equals(Object other) {
63	<	return ((PDelay)other).pseudodelay == pseudodelay;
63	>	return (other instanceof PDelay) &&
64	>	this.pseudodelay == ((PDelay)other).pseudodelay;
65		}
66	<	public boolean equals(PDelay other) {
67	<	return ((PDelay)other).pseudodelay == pseudodelay;
53	<	}
54	<
55	<
66	>	// suppress [overrides] javac warning
67	>	public int hashCode() { return pseudodelay; }
68		public long getDelay(TimeUnit ignore) {
69	<	return pseudodelay;
58	<	}
59	<	public int intValue() {
60	<	return pseudodelay;
69	>	return Integer.MIN_VALUE + pseudodelay;
70		}
62	–
71		public String toString() {
72		return String.valueOf(pseudodelay);
73		}
74		}
75
68	–
76		/**
77		* Delayed implementation that actually delays
78		*/
79	<	static class NanoDelay implements Delayed {
79	>	static class NanoDelay implements Delayed {
80		long trigger;
81	<	NanoDelay(long i) {
81	>	NanoDelay(long i) {
82		trigger = System.nanoTime() + i;
83		}
84		public int compareTo(NanoDelay y) {
85		long i = trigger;
86	<	long j = ((NanoDelay)y).trigger;
86	>	long j = y.trigger;
87		if (i < j) return -1;
88		if (i > j) return 1;
89		return 0;
90		}
91
92		public int compareTo(Delayed y) {
93	<	long i = trigger;
87	<	long j = ((NanoDelay)y).trigger;
88	<	if (i < j) return -1;
89	<	if (i > j) return 1;
90	<	return 0;
93	>	return compareTo((NanoDelay)y);
94		}
95
96		public boolean equals(Object other) {
97	<	return ((NanoDelay)other).trigger == trigger;
98	<	}
96	<	public boolean equals(NanoDelay other) {
97	<	return ((NanoDelay)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 111 | Line 115 | public class DelayQueueTest extends JSR1
115		}
116		}
117
114	–
118		/**
119	<	* Create a queue of given size containing consecutive
119	>	* Returns a new queue of given size containing consecutive
120		* PDelays 0 ... n.
121		*/
122	<	private DelayQueue populatedQueue(int n) {
123	<	DelayQueue q = new DelayQueue();
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)
126	<	assertTrue(q.offer(new PDelay(i)));
127	<	for(int i = (n & 1); i < n; i+=2)
128	<	assertTrue(q.offer(new PDelay(i)));
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)
128	>	assertTrue(q.offer(new PDelay(i)));
129		assertFalse(q.isEmpty());
130	<	assertEquals(NOCAP, q.remainingCapacity());
131	<	assertEquals(n, q.size());
130	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
131	>	assertEquals(n, q.size());
132		return q;
133		}
134	<
134	>
135		/**
136		* A new queue has unbounded capacity
137		*/
138		public void testConstructor1() {
139	<	assertEquals(NOCAP, new DelayQueue().remainingCapacity());
139	>	assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity());
140		}
141
142		/**
#	Line 141 | Line 144 | public class DelayQueueTest extends JSR1
144		*/
145		public void testConstructor3() {
146		try {
147	<	DelayQueue q = new DelayQueue(null);
147	>	new DelayQueue(null);
148		shouldThrow();
149	<	}
147	<	catch (NullPointerException success) {}
149	>	} catch (NullPointerException success) {}
150		}
151
152		/**
#	Line 152 | Line 154 | public class DelayQueueTest extends JSR1
154		*/
155		public void testConstructor4() {
156		try {
157	<	PDelay[] ints = new PDelay[SIZE];
156	<	DelayQueue q = new DelayQueue(Arrays.asList(ints));
157	>	new DelayQueue(Arrays.asList(new PDelay[SIZE]));
158		shouldThrow();
159	<	}
159	<	catch (NullPointerException success) {}
159	>	} catch (NullPointerException success) {}
160		}
161
162		/**
163		* Initializing from Collection with some null elements throws NPE
164		*/
165		public void testConstructor5() {
166	+	PDelay[] a = new PDelay[SIZE];
167	+	for (int i = 0; i < SIZE - 1; ++i)
168	+	a[i] = new PDelay(i);
169		try {
170	<	PDelay[] ints = new PDelay[SIZE];
168	<	for (int i = 0; i < SIZE-1; ++i)
169	<	ints[i] = new PDelay(i);
170	<	DelayQueue q = new DelayQueue(Arrays.asList(ints));
170	>	new DelayQueue(Arrays.asList(a));
171		shouldThrow();
172	<	}
173	<	catch (NullPointerException success) {}
172	>	} catch (NullPointerException success) {}
173		}
174
175		/**
176		* Queue contains all elements of collection used to initialize
177		*/
178		public void testConstructor6() {
179	<	try {
180	<	PDelay[] ints = new PDelay[SIZE];
181	<	for (int i = 0; i < SIZE; ++i)
182	<	ints[i] = new PDelay(i);
183	<	DelayQueue q = new DelayQueue(Arrays.asList(ints));
184	<	for (int i = 0; i < SIZE; ++i)
186	<	assertEquals(ints[i], q.poll());
187	<	}
188	<	finally {}
179	>	PDelay[] ints = new PDelay[SIZE];
180	>	for (int i = 0; i < SIZE; ++i)
181	>	ints[i] = new PDelay(i);
182	>	DelayQueue q = new DelayQueue(Arrays.asList(ints));
183	>	for (int i = 0; i < SIZE; ++i)
184	>	assertEquals(ints[i], q.poll());
185		}
186
187		/**
#	Line 194 | Line 190 | public class DelayQueueTest extends JSR1
190		public void testEmpty() {
191		DelayQueue q = new DelayQueue();
192		assertTrue(q.isEmpty());
193	<	assertEquals(NOCAP, q.remainingCapacity());
193	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
194		q.add(new PDelay(1));
195		assertFalse(q.isEmpty());
196		q.add(new PDelay(2));
#	Line 204 | Line 200 | public class DelayQueueTest extends JSR1
200		}
201
202		/**
203	<	* remainingCapacity does not change when elementa added or removed,
208	<	* but size does
203	>	* remainingCapacity() always returns Integer.MAX_VALUE
204		*/
205		public void testRemainingCapacity() {
206	<	DelayQueue q = populatedQueue(SIZE);
206	>	BlockingQueue q = populatedQueue(SIZE);
207		for (int i = 0; i < SIZE; ++i) {
208	<	assertEquals(NOCAP, q.remainingCapacity());
209	<	assertEquals(SIZE-i, q.size());
210	<	q.remove();
208	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
209	>	assertEquals(SIZE - i, q.size());
210	>	assertTrue(q.remove() instanceof PDelay);
211		}
212		for (int i = 0; i < SIZE; ++i) {
213	<	assertEquals(NOCAP, q.remainingCapacity());
213	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
214		assertEquals(i, q.size());
215	<	q.add(new PDelay(i));
215	>	assertTrue(q.add(new PDelay(i)));
216		}
217		}
218
219		/**
225	–	* offer(null) throws NPE
226	–	*/
227	–	public void testOfferNull() {
228	–	try {
229	–	DelayQueue q = new DelayQueue();
230	–	q.offer(null);
231	–	shouldThrow();
232	–	} catch (NullPointerException success) { }
233	–	}
234	–
235	–	/**
236	–	* add(null) throws NPE
237	–	*/
238	–	public void testAddNull() {
239	–	try {
240	–	DelayQueue q = new DelayQueue();
241	–	q.add(null);
242	–	shouldThrow();
243	–	} catch (NullPointerException success) { }
244	–	}
245	–
246	–	/**
220		* offer non-null succeeds
221		*/
222		public void testOffer() {
#	Line 264 | Line 237 | public class DelayQueueTest extends JSR1
237		}
238
239		/**
267	–	* addAll(null) throws NPE
268	–	*/
269	–	public void testAddAll1() {
270	–	try {
271	–	DelayQueue q = new DelayQueue();
272	–	q.addAll(null);
273	–	shouldThrow();
274	–	}
275	–	catch (NullPointerException success) {}
276	–	}
277	–
278	–
279	–	/**
240		* addAll(this) throws IAE
241		*/
242		public void testAddAllSelf() {
243	+	DelayQueue q = populatedQueue(SIZE);
244		try {
284	–	DelayQueue q = populatedQueue(SIZE);
245		q.addAll(q);
246		shouldThrow();
247	<	}
288	<	catch (IllegalArgumentException success) {}
247	>	} catch (IllegalArgumentException success) {}
248		}
249
250		/**
292	–	* addAll of a collection with null elements throws NPE
293	–	*/
294	–	public void testAddAll2() {
295	–	try {
296	–	DelayQueue q = new DelayQueue();
297	–	PDelay[] ints = new PDelay[SIZE];
298	–	q.addAll(Arrays.asList(ints));
299	–	shouldThrow();
300	–	}
301	–	catch (NullPointerException success) {}
302	–	}
303	–	/**
251		* addAll of a collection with any null elements throws NPE after
252		* possibly adding some elements
253		*/
254		public void testAddAll3() {
255	+	DelayQueue q = new DelayQueue();
256	+	PDelay[] a = new PDelay[SIZE];
257	+	for (int i = 0; i < SIZE - 1; ++i)
258	+	a[i] = new PDelay(i);
259		try {
260	<	DelayQueue q = new DelayQueue();
310	<	PDelay[] ints = new PDelay[SIZE];
311	<	for (int i = 0; i < SIZE-1; ++i)
312	<	ints[i] = new PDelay(i);
313	<	q.addAll(Arrays.asList(ints));
260	>	q.addAll(Arrays.asList(a));
261		shouldThrow();
262	<	}
316	<	catch (NullPointerException success) {}
262	>	} catch (NullPointerException success) {}
263		}
264
265		/**
266		* Queue contains all elements of successful addAll
267		*/
268		public void testAddAll5() {
269	<	try {
270	<	PDelay[] empty = new PDelay[0];
271	<	PDelay[] ints = new PDelay[SIZE];
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)));
276	<	assertTrue(q.addAll(Arrays.asList(ints)));
277	<	for (int i = 0; i < SIZE; ++i)
332	<	assertEquals(ints[i], q.poll());
333	<	}
334	<	finally {}
269	>	PDelay[] empty = new PDelay[0];
270	>	PDelay[] ints = new PDelay[SIZE];
271	>	for (int i = SIZE - 1; i >= 0; --i)
272	>	ints[i] = new PDelay(i);
273	>	DelayQueue q = new DelayQueue();
274	>	assertFalse(q.addAll(Arrays.asList(empty)));
275	>	assertTrue(q.addAll(Arrays.asList(ints)));
276	>	for (int i = 0; i < SIZE; ++i)
277	>	assertEquals(ints[i], q.poll());
278		}
279
280		/**
338	–	* put(null) throws NPE
339	–	*/
340	–	public void testPutNull() {
341	–	try {
342	–	DelayQueue q = new DelayQueue();
343	–	q.put(null);
344	–	shouldThrow();
345	–	}
346	–	catch (NullPointerException success){
347	–	}
348	–	}
349	–
350	–	/**
281		* all elements successfully put are contained
282		*/
283	<	public void testPut() {
284	<	try {
285	<	DelayQueue q = new DelayQueue();
286	<	for (int i = 0; i < SIZE; ++i) {
287	<	PDelay I = new PDelay(i);
288	<	q.put(I);
359	<	assertTrue(q.contains(I));
360	<	}
361	<	assertEquals(SIZE, q.size());
362	<	}
363	<	finally {
283	>	public void testPut() {
284	>	DelayQueue q = new DelayQueue();
285	>	for (int i = 0; i < SIZE; ++i) {
286	>	PDelay x = new PDelay(i);
287	>	q.put(x);
288	>	assertTrue(q.contains(x));
289		}
290	+	assertEquals(SIZE, q.size());
291		}
292
293		/**
294		* put doesn't block waiting for take
295		*/
296	<	public void testPutWithTake() {
296	>	public void testPutWithTake() throws InterruptedException {
297		final DelayQueue q = new DelayQueue();
298	<	Thread t = new Thread(new Runnable() {
299	<	public void run() {
300	<	int added = 0;
301	<	try {
302	<	q.put(new PDelay(0));
303	<	++added;
304	<	q.put(new PDelay(0));
305	<	++added;
306	<	q.put(new PDelay(0));
307	<	++added;
382	<	q.put(new PDelay(0));
383	<	++added;
384	<	threadAssertTrue(added == 4);
385	<	} finally {
386	<	}
387	<	}
388	<	});
389	<	try {
390	<	t.start();
391	<	Thread.sleep(SHORT_DELAY_MS);
392	<	q.take();
393	<	t.interrupt();
394	<	t.join();
395	<	} catch (Exception e){
396	<	unexpectedException();
397	<	}
298	>	Thread t = newStartedThread(new CheckedRunnable() {
299	>	public void realRun() {
300	>	q.put(new PDelay(0));
301	>	q.put(new PDelay(0));
302	>	q.put(new PDelay(0));
303	>	q.put(new PDelay(0));
304	>	}});
305	>
306	>	awaitTermination(t);
307	>	assertEquals(4, q.size());
308		}
309
310		/**
311		* timed offer does not time out
312		*/
313	<	public void testTimedOffer() {
313	>	public void testTimedOffer() throws InterruptedException {
314		final DelayQueue q = new DelayQueue();
315	<	Thread t = new Thread(new Runnable() {
316	<	public void run() {
317	<	try {
318	<	q.put(new PDelay(0));
319	<	q.put(new PDelay(0));
320	<	threadAssertTrue(q.offer(new PDelay(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
321	<	threadAssertTrue(q.offer(new PDelay(0), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
412	<	} finally { }
413	<	}
414	<	});
415	<
416	<	try {
417	<	t.start();
418	<	Thread.sleep(SMALL_DELAY_MS);
419	<	t.interrupt();
420	<	t.join();
421	<	} catch (Exception e){
422	<	unexpectedException();
423	<	}
424	<	}
315	>	Thread t = newStartedThread(new CheckedRunnable() {
316	>	public void realRun() throws InterruptedException {
317	>	q.put(new PDelay(0));
318	>	q.put(new PDelay(0));
319	>	assertTrue(q.offer(new PDelay(0), SHORT_DELAY_MS, MILLISECONDS));
320	>	assertTrue(q.offer(new PDelay(0), LONG_DELAY_MS, MILLISECONDS));
321	>	}});
322
323	<	/**
427	<	* take retrieves elements in priority order
428	<	*/
429	<	public void testTake() {
430	<	try {
431	<	DelayQueue q = populatedQueue(SIZE);
432	<	for (int i = 0; i < SIZE; ++i) {
433	<	assertEquals(new PDelay(i), ((PDelay)q.take()));
434	<	}
435	<	} catch (InterruptedException e){
436	<	unexpectedException();
437	<	}
323	>	awaitTermination(t);
324		}
325
326		/**
327	<	* take blocks interruptibly when empty
327	>	* take retrieves elements in priority order
328		*/
329	<	public void testTakeFromEmpty() {
330	<	final DelayQueue q = new DelayQueue();
331	<	Thread t = new Thread(new Runnable() {
332	<	public void run() {
447	<	try {
448	<	q.take();
449	<	threadShouldThrow();
450	<	} catch (InterruptedException success){ }
451	<	}
452	<	});
453	<	try {
454	<	t.start();
455	<	Thread.sleep(SHORT_DELAY_MS);
456	<	t.interrupt();
457	<	t.join();
458	<	} catch (Exception e){
459	<	unexpectedException();
329	>	public void testTake() throws InterruptedException {
330	>	DelayQueue q = populatedQueue(SIZE);
331	>	for (int i = 0; i < SIZE; ++i) {
332	>	assertEquals(new PDelay(i), q.take());
333		}
334		}
335
336		/**
337		* Take removes existing elements until empty, then blocks interruptibly
338		*/
339	<	public void testBlockingTake() {
340	<	Thread t = new Thread(new Runnable() {
341	<	public void run() {
342	<	try {
343	<	DelayQueue q = populatedQueue(SIZE);
344	<	for (int i = 0; i < SIZE; ++i) {
345	<	threadAssertEquals(new PDelay(i), ((PDelay)q.take()));
346	<	}
474	<	q.take();
475	<	threadShouldThrow();
476	<	} catch (InterruptedException success){
477	<	}
478	<	}});
479	<	t.start();
480	<	try {
481	<	Thread.sleep(SHORT_DELAY_MS);
482	<	t.interrupt();
483	<	t.join();
484	<	}
485	<	catch (InterruptedException ie) {
486	<	unexpectedException();
487	<	}
488	<	}
339	>	public void testBlockingTake() throws InterruptedException {
340	>	final DelayQueue q = populatedQueue(SIZE);
341	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
342	>	Thread t = newStartedThread(new CheckedRunnable() {
343	>	public void realRun() throws InterruptedException {
344	>	for (int i = 0; i < SIZE; ++i) {
345	>	assertEquals(new PDelay(i), ((PDelay)q.take()));
346	>	}
347
348	+	Thread.currentThread().interrupt();
349	+	try {
350	+	q.take();
351	+	shouldThrow();
352	+	} catch (InterruptedException success) {}
353	+	assertFalse(Thread.interrupted());
354	+
355	+	pleaseInterrupt.countDown();
356	+	try {
357	+	q.take();
358	+	shouldThrow();
359	+	} catch (InterruptedException success) {}
360	+	assertFalse(Thread.interrupted());
361	+	}});
362	+
363	+	await(pleaseInterrupt);
364	+	assertThreadStaysAlive(t);
365	+	t.interrupt();
366	+	awaitTermination(t);
367	+	}
368
369		/**
370		* poll succeeds unless empty
#	Line 494 | Line 372 | public class DelayQueueTest extends JSR1
372		public void testPoll() {
373		DelayQueue q = populatedQueue(SIZE);
374		for (int i = 0; i < SIZE; ++i) {
375	<	assertEquals(new PDelay(i), ((PDelay)q.poll()));
375	>	assertEquals(new PDelay(i), q.poll());
376		}
377	<	assertNull(q.poll());
377	>	assertNull(q.poll());
378		}
379
380		/**
381	<	* timed pool with zero timeout succeeds when non-empty, else times out
381	>	* timed poll with zero timeout succeeds when non-empty, else times out
382		*/
383	<	public void testTimedPoll0() {
384	<	try {
385	<	DelayQueue q = populatedQueue(SIZE);
386	<	for (int i = 0; i < SIZE; ++i) {
387	<	assertEquals(new PDelay(i), ((PDelay)q.poll(0, TimeUnit.MILLISECONDS)));
388	<	}
511	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
512	<	} catch (InterruptedException e){
513	<	unexpectedException();
514	<	}
383	>	public void testTimedPoll0() throws InterruptedException {
384	>	DelayQueue q = populatedQueue(SIZE);
385	>	for (int i = 0; i < SIZE; ++i) {
386	>	assertEquals(new PDelay(i), q.poll(0, MILLISECONDS));
387	>	}
388	>	assertNull(q.poll(0, MILLISECONDS));
389		}
390
391		/**
392	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
392	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
393		*/
394	<	public void testTimedPoll() {
395	<	try {
396	<	DelayQueue q = populatedQueue(SIZE);
397	<	for (int i = 0; i < SIZE; ++i) {
398	<	assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)));
399	<	}
400	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
401	<	} catch (InterruptedException e){
402	<	unexpectedException();
403	<	}
394	>	public void testTimedPoll() throws InterruptedException {
395	>	DelayQueue q = populatedQueue(SIZE);
396	>	for (int i = 0; i < SIZE; ++i) {
397	>	long startTime = System.nanoTime();
398	>	assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS));
399	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
400	>	}
401	>	long startTime = System.nanoTime();
402	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
403	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
404	>	checkEmpty(q);
405		}
406
407		/**
408		* Interrupted timed poll throws InterruptedException instead of
409		* returning timeout status
410		*/
411	<	public void testInterruptedTimedPoll() {
412	<	Thread t = new Thread(new Runnable() {
413	<	public void run() {
414	<	try {
415	<	DelayQueue q = populatedQueue(SIZE);
416	<	for (int i = 0; i < SIZE; ++i) {
417	<	threadAssertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)));
418	<	}
419	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
545	<	} catch (InterruptedException success){
546	<	}
547	<	}});
548	<	t.start();
549	<	try {
550	<	Thread.sleep(SHORT_DELAY_MS);
551	<	t.interrupt();
552	<	t.join();
553	<	}
554	<	catch (InterruptedException ie) {
555	<	unexpectedException();
556	<	}
557	<	}
558	<
559	<	/**
560	<	*  timed poll before a delayed offer fails; after offer succeeds;
561	<	*  on interruption throws
562	<	*/
563	<	public void testTimedPollWithOffer() {
564	<	final DelayQueue q = new DelayQueue();
565	<	Thread t = new Thread(new Runnable() {
566	<	public void run() {
567	<	try {
568	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
569	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
570	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
571	<	threadFail("Should block");
572	<	} catch (InterruptedException success) { }
411	>	public void testInterruptedTimedPoll() throws InterruptedException {
412	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
413	>	final DelayQueue q = populatedQueue(SIZE);
414	>	Thread t = newStartedThread(new CheckedRunnable() {
415	>	public void realRun() throws InterruptedException {
416	>	long startTime = System.nanoTime();
417	>	for (int i = 0; i < SIZE; ++i) {
418	>	assertEquals(new PDelay(i),
419	>	((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS)));
420		}
574	–	});
575	–	try {
576	–	t.start();
577	–	Thread.sleep(SMALL_DELAY_MS);
578	–	assertTrue(q.offer(new PDelay(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
579	–	t.interrupt();
580	–	t.join();
581	–	} catch (Exception e){
582	–	unexpectedException();
583	–	}
584	–	}
421
422	+	Thread.currentThread().interrupt();
423	+	try {
424	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
425	+	shouldThrow();
426	+	} catch (InterruptedException success) {}
427	+	assertFalse(Thread.interrupted());
428	+
429	+	pleaseInterrupt.countDown();
430	+	try {
431	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
432	+	shouldThrow();
433	+	} catch (InterruptedException success) {}
434	+	assertFalse(Thread.interrupted());
435	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
436	+	}});
437	+
438	+	await(pleaseInterrupt);
439	+	assertThreadStaysAlive(t);
440	+	t.interrupt();
441	+	awaitTermination(t);
442	+	checkEmpty(q);
443	+	}
444
445		/**
446		* peek returns next element, or null if empty
#	Line 590 | Line 448 | public class DelayQueueTest extends JSR1
448		public void testPeek() {
449		DelayQueue q = populatedQueue(SIZE);
450		for (int i = 0; i < SIZE; ++i) {
451	<	assertEquals(new PDelay(i), ((PDelay)q.peek()));
452	<	q.poll();
453	<	assertTrue(q.peek() == null ||
454	<	i != ((PDelay)q.peek()).intValue());
451	>	assertEquals(new PDelay(i), q.peek());
452	>	assertEquals(new PDelay(i), q.poll());
453	>	if (q.isEmpty())
454	>	assertNull(q.peek());
455	>	else
456	>	assertFalse(new PDelay(i).equals(q.peek()));
457		}
458	<	assertNull(q.peek());
458	>	assertNull(q.peek());
459		}
460
461		/**
#	Line 604 | Line 464 | public class DelayQueueTest extends JSR1
464		public void testElement() {
465		DelayQueue q = populatedQueue(SIZE);
466		for (int i = 0; i < SIZE; ++i) {
467	<	assertEquals(new PDelay(i), ((PDelay)q.element()));
467	>	assertEquals(new PDelay(i), q.element());
468		q.poll();
469		}
470		try {
471		q.element();
472		shouldThrow();
473	<	}
614	<	catch (NoSuchElementException success) {}
473	>	} catch (NoSuchElementException success) {}
474		}
475
476		/**
#	Line 620 | Line 479 | public class DelayQueueTest extends JSR1
479		public void testRemove() {
480		DelayQueue q = populatedQueue(SIZE);
481		for (int i = 0; i < SIZE; ++i) {
482	<	assertEquals(new PDelay(i), ((PDelay)q.remove()));
482	>	assertEquals(new PDelay(i), q.remove());
483		}
484		try {
485		q.remove();
486		shouldThrow();
487	<	} catch (NoSuchElementException success){
629	<	}
487	>	} catch (NoSuchElementException success) {}
488		}
489
490		/**
633	–	* remove(x) removes x and returns true if present
634	–	*/
635	–	public void testRemoveElement() {
636	–	DelayQueue q = populatedQueue(SIZE);
637	–	for (int i = 1; i < SIZE; i+=2) {
638	–	assertTrue(q.remove(new PDelay(i)));
639	–	}
640	–	for (int i = 0; i < SIZE; i+=2) {
641	–	assertTrue(q.remove(new PDelay(i)));
642	–	assertFalse(q.remove(new PDelay(i+1)));
643	–	}
644	–	assertTrue(q.isEmpty());
645	–	}
646	–
647	–	/**
491		* contains(x) reports true when elements added but not yet removed
492		*/
493		public void testContains() {
#	Line 664 | Line 507 | public class DelayQueueTest extends JSR1
507		q.clear();
508		assertTrue(q.isEmpty());
509		assertEquals(0, q.size());
510	<	assertEquals(NOCAP, q.remainingCapacity());
510	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
511		PDelay x = new PDelay(1);
512		q.add(x);
513		assertFalse(q.isEmpty());
#	Line 701 | Line 544 | public class DelayQueueTest extends JSR1
544		assertTrue(changed);
545
546		assertTrue(q.containsAll(p));
547	<	assertEquals(SIZE-i, q.size());
547	>	assertEquals(SIZE - i, q.size());
548		p.remove();
549		}
550		}
#	Line 714 | Line 557 | public class DelayQueueTest extends JSR1
557		DelayQueue q = populatedQueue(SIZE);
558		DelayQueue p = populatedQueue(i);
559		assertTrue(q.removeAll(p));
560	<	assertEquals(SIZE-i, q.size());
560	>	assertEquals(SIZE - i, q.size());
561		for (int j = 0; j < i; ++j) {
562	<	PDelay I = (PDelay)(p.remove());
563	<	assertFalse(q.contains(I));
562	>	PDelay x = (PDelay)(p.remove());
563	>	assertFalse(q.contains(x));
564		}
565		}
566		}
#	Line 725 | Line 568 | public class DelayQueueTest extends JSR1
568		/**
569		* toArray contains all elements
570		*/
571	<	public void testToArray() {
571	>	public void testToArray() throws InterruptedException {
572		DelayQueue q = populatedQueue(SIZE);
573	<	Object[] o = q.toArray();
573	>	Object[] o = q.toArray();
574		Arrays.sort(o);
575	<	try {
576	<	for(int i = 0; i < o.length; i++)
734	<	assertEquals(o[i], q.take());
735	<	} catch (InterruptedException e){
736	<	unexpectedException();
737	<	}
575	>	for (int i = 0; i < o.length; i++)
576	>	assertSame(o[i], q.take());
577		}
578
579		/**
580		* toArray(a) contains all elements
581		*/
582		public void testToArray2() {
583	<	DelayQueue q = populatedQueue(SIZE);
584	<	PDelay[] ints = new PDelay[SIZE];
585	<	ints = (PDelay[])q.toArray(ints);
583	>	DelayQueue<PDelay> q = populatedQueue(SIZE);
584	>	PDelay[] ints = new PDelay[SIZE];
585	>	PDelay[] array = q.toArray(ints);
586	>	assertSame(ints, array);
587		Arrays.sort(ints);
588	<	try {
589	<	for(int i = 0; i < ints.length; i++)
750	<	assertEquals(ints[i], q.take());
751	<	} catch (InterruptedException e){
752	<	unexpectedException();
753	<	}
754	<	}
755	<
756	<
757	<	/**
758	<	* toArray(null) throws NPE
759	<	*/
760	<	public void testToArray_BadArg() {
761	<	try {
762	<	DelayQueue q = populatedQueue(SIZE);
763	<	Object o[] = q.toArray(null);
764	<	shouldThrow();
765	<	} catch(NullPointerException success){}
588	>	for (int i = 0; i < ints.length; i++)
589	>	assertSame(ints[i], q.remove());
590		}
591
592		/**
593	<	* toArray with incompatible array type throws CCE
593	>	* toArray(incompatible array type) throws ArrayStoreException
594		*/
595		public void testToArray1_BadArg() {
596	<	try {
597	<	DelayQueue q = populatedQueue(SIZE);
598	<	Object o[] = q.toArray(new String[10] );
599	<	shouldThrow();
600	<	} catch(ArrayStoreException  success){}
596	>	DelayQueue q = populatedQueue(SIZE);
597	>	try {
598	>	q.toArray(new String[10]);
599	>	shouldThrow();
600	>	} catch (ArrayStoreException success) {}
601		}
602	<
602	>
603		/**
604		* iterator iterates through all elements
605		*/
606		public void testIterator() {
607		DelayQueue q = populatedQueue(SIZE);
608		int i = 0;
609	<	Iterator it = q.iterator();
610	<	while(it.hasNext()) {
609	>	Iterator it = q.iterator();
610	>	while (it.hasNext()) {
611		assertTrue(q.contains(it.next()));
612		++i;
613		}
614		assertEquals(i, SIZE);
615	+	assertIteratorExhausted(it);
616	+	}
617	+
618	+	/**
619	+	* iterator of empty collection has no elements
620	+	*/
621	+	public void testEmptyIterator() {
622	+	assertIteratorExhausted(new DelayQueue().iterator());
623		}
624
625		/**
626		* iterator.remove removes current element
627		*/
628	<	public void testIteratorRemove () {
628	>	public void testIteratorRemove() {
629		final DelayQueue q = new DelayQueue();
630		q.add(new PDelay(2));
631		q.add(new PDelay(1));
#	Line 802 | Line 634 | public class DelayQueueTest extends JSR1
634		it.next();
635		it.remove();
636		it = q.iterator();
637	<	assertEquals(it.next(), new PDelay(2));
638	<	assertEquals(it.next(), new PDelay(3));
637	>	assertEquals(new PDelay(2), it.next());
638	>	assertEquals(new PDelay(3), it.next());
639		assertFalse(it.hasNext());
640		}
641
810	–
642		/**
643		* toString contains toStrings of elements
644		*/
645		public void testToString() {
646		DelayQueue q = populatedQueue(SIZE);
647		String s = q.toString();
648	<	for (int i = 0; i < SIZE; ++i) {
649	<	assertTrue(s.indexOf(String.valueOf(Integer.MIN_VALUE+i)) >= 0);
650	<	}
820	<	}
648	>	for (Object e : q)
649	>	assertTrue(s.contains(e.toString()));
650	>	}
651
652		/**
653	<	* offer transfers elements across Executor tasks
653	>	* timed poll transfers elements across Executor tasks
654		*/
655		public void testPollInExecutor() {
656		final DelayQueue q = new DelayQueue();
657	<	ExecutorService executor = Executors.newFixedThreadPool(2);
658	<	executor.execute(new Runnable() {
659	<	public void run() {
660	<	threadAssertNull(q.poll());
661	<	try {
662	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
663	<	threadAssertTrue(q.isEmpty());
664	<	}
665	<	catch (InterruptedException e) {
666	<	threadUnexpectedException();
837	<	}
838	<	}
839	<	});
657	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
658	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
659	>	try (PoolCleaner cleaner = cleaner(executor)) {
660	>	executor.execute(new CheckedRunnable() {
661	>	public void realRun() throws InterruptedException {
662	>	assertNull(q.poll());
663	>	threadsStarted.await();
664	>	assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS));
665	>	checkEmpty(q);
666	>	}});
667
668	<	executor.execute(new Runnable() {
669	<	public void run() {
670	<	try {
844	<	Thread.sleep(SHORT_DELAY_MS);
668	>	executor.execute(new CheckedRunnable() {
669	>	public void realRun() throws InterruptedException {
670	>	threadsStarted.await();
671		q.put(new PDelay(1));
672	<	}
673	<	catch (InterruptedException e) {
848	<	threadUnexpectedException();
849	<	}
850	<	}
851	<	});
852	<	joinPool(executor);
853	<
672	>	}});
673	>	}
674		}
675
856	–
676		/**
677		* Delayed actions do not occur until their delay elapses
678		*/
679	<	public void testDelay() {
680	<	DelayQueue q = new DelayQueue();
681	<	NanoDelay[] elements = new NanoDelay[SIZE];
682	<	for (int i = 0; i < SIZE; ++i) {
683	<	elements[i] = new NanoDelay(1000000000L + 1000000L * (SIZE - i));
684	<	}
685	<	for (int i = 0; i < SIZE; ++i) {
686	<	q.add(elements[i]);
687	<	}
688	<
689	<	try {
690	<	long last = 0;
691	<	for (int i = 0; i < SIZE; ++i) {
873	<	NanoDelay e = (NanoDelay)(q.take());
874	<	long tt = e.getTriggerTime();
875	<	assertTrue(tt <= System.nanoTime());
876	<	if (i != 0)
877	<	assertTrue(tt >= last);
878	<	last = tt;
879	<	}
880	<	}
881	<	catch(InterruptedException ie) {
882	<	unexpectedException();
679	>	public void testDelay() throws InterruptedException {
680	>	DelayQueue<NanoDelay> q = new DelayQueue<NanoDelay>();
681	>	for (int i = 0; i < SIZE; ++i)
682	>	q.add(new NanoDelay(1000000L * (SIZE - i)));
683	>
684	>	long last = 0;
685	>	for (int i = 0; i < SIZE; ++i) {
686	>	NanoDelay e = q.take();
687	>	long tt = e.getTriggerTime();
688	>	assertTrue(System.nanoTime() - tt >= 0);
689	>	if (i != 0)
690	>	assertTrue(tt >= last);
691	>	last = tt;
692		}
693	+	assertTrue(q.isEmpty());
694		}
695
696	+	/**
697	+	* peek of a non-empty queue returns non-null even if not expired
698	+	*/
699	+	public void testPeekDelayed() {
700	+	DelayQueue q = new DelayQueue();
701	+	q.add(new NanoDelay(Long.MAX_VALUE));
702	+	assertNotNull(q.peek());
703	+	}
704
705		/**
706	<	* drainTo(null) throws NPE
707	<	*/
708	<	public void testDrainToNull() {
709	<	DelayQueue q = populatedQueue(SIZE);
710	<	try {
711	<	q.drainTo(null);
894	<	shouldThrow();
895	<	} catch(NullPointerException success) {
896	<	}
706	>	* poll of a non-empty queue returns null if no expired elements.
707	>	*/
708	>	public void testPollDelayed() {
709	>	DelayQueue q = new DelayQueue();
710	>	q.add(new NanoDelay(Long.MAX_VALUE));
711	>	assertNull(q.poll());
712		}
713
714		/**
715	<	* drainTo(this) throws IAE
716	<	*/
717	<	public void testDrainToSelf() {
718	<	DelayQueue q = populatedQueue(SIZE);
719	<	try {
720	<	q.drainTo(q);
906	<	shouldThrow();
907	<	} catch(IllegalArgumentException success) {
908	<	}
715	>	* timed poll of a non-empty queue returns null if no expired elements.
716	>	*/
717	>	public void testTimedPollDelayed() throws InterruptedException {
718	>	DelayQueue q = new DelayQueue();
719	>	q.add(new NanoDelay(LONG_DELAY_MS * 1000000L));
720	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
721		}
722
723		/**
724		* drainTo(c) empties queue into another collection c
725	<	*/
725	>	*/
726		public void testDrainTo() {
727		DelayQueue q = new DelayQueue();
728		PDelay[] elems = new PDelay[SIZE];
#	Line 920 | Line 732 | public class DelayQueueTest extends JSR1
732		}
733		ArrayList l = new ArrayList();
734		q.drainTo(l);
735	<	assertEquals(q.size(), 0);
736	<	for (int i = 0; i < SIZE; ++i)
737	<	assertEquals(l.get(i), elems[i]);
735	>	assertEquals(0, q.size());
736	>	for (int i = 0; i < SIZE; ++i)
737	>	assertEquals(elems[i], l.get(i));
738		q.add(elems[0]);
739		q.add(elems[1]);
740		assertFalse(q.isEmpty());
#	Line 930 | Line 742 | public class DelayQueueTest extends JSR1
742		assertTrue(q.contains(elems[1]));
743		l.clear();
744		q.drainTo(l);
745	<	assertEquals(q.size(), 0);
746	<	assertEquals(l.size(), 2);
747	<	for (int i = 0; i < 2; ++i)
748	<	assertEquals(l.get(i), elems[i]);
745	>	assertEquals(0, q.size());
746	>	assertEquals(2, l.size());
747	>	for (int i = 0; i < 2; ++i)
748	>	assertEquals(elems[i], l.get(i));
749		}
750
751		/**
752		* drainTo empties queue
753	<	*/
754	<	public void testDrainToWithActivePut() {
753	>	*/
754	>	public void testDrainToWithActivePut() throws InterruptedException {
755		final DelayQueue q = populatedQueue(SIZE);
756	<	Thread t = new Thread(new Runnable() {
757	<	public void run() {
758	<	q.put(new PDelay(SIZE+1));
759	<	}
948	<	});
949	<	try {
950	<	t.start();
951	<	ArrayList l = new ArrayList();
952	<	q.drainTo(l);
953	<	assertTrue(l.size() >= SIZE);
954	<	t.join();
955	<	assertTrue(q.size() + l.size() >= SIZE);
956	<	} catch(Exception e){
957	<	unexpectedException();
958	<	}
959	<	}
756	>	Thread t = new Thread(new CheckedRunnable() {
757	>	public void realRun() {
758	>	q.put(new PDelay(SIZE + 1));
759	>	}});
760
761	<	/**
762	<	* drainTo(null, n) throws NPE
763	<	*/
764	<	public void testDrainToNullN() {
765	<	DelayQueue q = populatedQueue(SIZE);
766	<	try {
967	<	q.drainTo(null, 0);
968	<	shouldThrow();
969	<	} catch(NullPointerException success) {
970	<	}
971	<	}
972	<
973	<	/**
974	<	* drainTo(this, n) throws IAE
975	<	*/
976	<	public void testDrainToSelfN() {
977	<	DelayQueue q = populatedQueue(SIZE);
978	<	try {
979	<	q.drainTo(q, 0);
980	<	shouldThrow();
981	<	} catch(IllegalArgumentException success) {
982	<	}
761	>	t.start();
762	>	ArrayList l = new ArrayList();
763	>	q.drainTo(l);
764	>	assertTrue(l.size() >= SIZE);
765	>	t.join();
766	>	assertTrue(q.size() + l.size() >= SIZE);
767		}
768
769		/**
770	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
771	<	*/
770	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
771	>	*/
772		public void testDrainToN() {
773		for (int i = 0; i < SIZE + 2; ++i) {
774		DelayQueue q = populatedQueue(SIZE);
775		ArrayList l = new ArrayList();
776		q.drainTo(l, i);
777	<	int k = (i < SIZE)? i : SIZE;
778	<	assertEquals(q.size(), SIZE-k);
779	<	assertEquals(l.size(), k);
777	>	int k = (i < SIZE) ? i : SIZE;
778	>	assertEquals(SIZE - k, q.size());
779	>	assertEquals(k, l.size());
780		}
781		}
782
783	<
783	>	/**
784	>	* remove(null), contains(null) always return false
785	>	*/
786	>	public void testNeverContainsNull() {
787	>	Collection<?> q = populatedQueue(SIZE);
788	>	assertFalse(q.contains(null));
789	>	assertFalse(q.remove(null));
790	>	}
791		}

Diff Legend

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