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.6 by dl, Sun Oct 5 23:00:40 2003 UTC vs.
Revision 1.74 by jsr166, Sun May 24 01:42:14 2015 UTC

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

Diff Legend

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