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

Diff Legend

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