ViewVC Help

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

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

Comparing jsr166/src/test/tck/PriorityBlockingQueueTest.java (file contents):
Revision 1.23 by jsr166, Sun Nov 22 00:17:37 2009 UTC vs.
Revision 1.74 by jsr166, Sat May 13 22:49:01 2017 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
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	<	import java.io.*;
10	>
11	>	import java.util.ArrayList;
12	>	import java.util.Arrays;
13	>	import java.util.Collection;
14	>	import java.util.Comparator;
15	>	import java.util.Iterator;
16	>	import java.util.NoSuchElementException;
17	>	import java.util.Queue;
18	>	import java.util.concurrent.BlockingQueue;
19	>	import java.util.concurrent.CountDownLatch;
20	>	import java.util.concurrent.Executors;
21	>	import java.util.concurrent.ExecutorService;
22	>	import java.util.concurrent.PriorityBlockingQueue;
23	>
24	>	import junit.framework.Test;
25
26		public class PriorityBlockingQueueTest extends JSR166TestCase {
27	+
28	+	public static class Generic extends BlockingQueueTest {
29	+	protected BlockingQueue emptyCollection() {
30	+	return new PriorityBlockingQueue();
31	+	}
32	+	}
33	+
34	+	public static class InitialCapacity extends BlockingQueueTest {
35	+	protected BlockingQueue emptyCollection() {
36	+	return new PriorityBlockingQueue(SIZE);
37	+	}
38	+	}
39	+
40		public static void main(String[] args) {
41	<	junit.textui.TestRunner.run (suite());
41	>	main(suite(), args);
42		}
43	+
44		public static Test suite() {
45	<	return new TestSuite(PriorityBlockingQueueTest.class);
45	>	class Implementation implements CollectionImplementation {
46	>	public Class<?> klazz() { return PriorityBlockingQueue.class; }
47	>	public Collection emptyCollection() { return new PriorityBlockingQueue(); }
48	>	public Object makeElement(int i) { return i; }
49	>	public boolean isConcurrent() { return true; }
50	>	public boolean permitsNulls() { return false; }
51	>	}
52	>	return newTestSuite(PriorityBlockingQueueTest.class,
53	>	new Generic().testSuite(),
54	>	new InitialCapacity().testSuite(),
55	>	CollectionTest.testSuite(new Implementation()));
56		}
57
23	–	private static final int NOCAP = Integer.MAX_VALUE;
24	–
58		/** Sample Comparator */
59		static class MyReverseComparator implements Comparator {
60		public int compare(Object x, Object y) {
61	<	int i = ((Integer)x).intValue();
29	<	int j = ((Integer)y).intValue();
30	<	if (i < j) return 1;
31	<	if (i > j) return -1;
32	<	return 0;
61	>	return ((Comparable)y).compareTo(x);
62		}
63		}
64
65		/**
66	<	* Create a queue of given size containing consecutive
67	<	* Integers 0 ... n.
66	>	* Returns a new queue of given size containing consecutive
67	>	* Integers 0 ... n - 1.
68		*/
69	<	private PriorityBlockingQueue populatedQueue(int n) {
70	<	PriorityBlockingQueue q = new PriorityBlockingQueue(n);
69	>	private static PriorityBlockingQueue<Integer> populatedQueue(int n) {
70	>	PriorityBlockingQueue<Integer> q =
71	>	new PriorityBlockingQueue<Integer>(n);
72		assertTrue(q.isEmpty());
73	<	for (int i = n-1; i >= 0; i-=2)
73	>	for (int i = n - 1; i >= 0; i -= 2)
74		assertTrue(q.offer(new Integer(i)));
75	<	for (int i = (n & 1); i < n; i+=2)
75	>	for (int i = (n & 1); i < n; i += 2)
76		assertTrue(q.offer(new Integer(i)));
77		assertFalse(q.isEmpty());
78	<	assertEquals(NOCAP, q.remainingCapacity());
78	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
79		assertEquals(n, q.size());
80	+	assertEquals((Integer) 0, q.peek());
81		return q;
82		}
83
#	Line 54 | Line 85 | public class PriorityBlockingQueueTest e
85		* A new queue has unbounded capacity
86		*/
87		public void testConstructor1() {
88	<	assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity());
88	>	assertEquals(Integer.MAX_VALUE,
89	>	new PriorityBlockingQueue(SIZE).remainingCapacity());
90		}
91
92		/**
#	Line 62 | Line 94 | public class PriorityBlockingQueueTest e
94		*/
95		public void testConstructor2() {
96		try {
97	<	PriorityBlockingQueue q = new PriorityBlockingQueue(0);
97	>	new PriorityBlockingQueue(0);
98		shouldThrow();
99		} catch (IllegalArgumentException success) {}
100		}
#	Line 72 | Line 104 | public class PriorityBlockingQueueTest e
104		*/
105		public void testConstructor3() {
106		try {
107	<	PriorityBlockingQueue q = new PriorityBlockingQueue(null);
107	>	new PriorityBlockingQueue(null);
108		shouldThrow();
109		} catch (NullPointerException success) {}
110		}
#	Line 81 | Line 113 | public class PriorityBlockingQueueTest e
113		* Initializing from Collection of null elements throws NPE
114		*/
115		public void testConstructor4() {
116	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
117		try {
118	<	Integer[] ints = new Integer[SIZE];
86	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
118	>	new PriorityBlockingQueue(elements);
119		shouldThrow();
120		} catch (NullPointerException success) {}
121		}
#	Line 92 | Line 124 | public class PriorityBlockingQueueTest e
124		* Initializing from Collection with some null elements throws NPE
125		*/
126		public void testConstructor5() {
127	+	Integer[] ints = new Integer[SIZE];
128	+	for (int i = 0; i < SIZE - 1; ++i)
129	+	ints[i] = i;
130	+	Collection<Integer> elements = Arrays.asList(ints);
131		try {
132	<	Integer[] ints = new Integer[SIZE];
97	<	for (int i = 0; i < SIZE-1; ++i)
98	<	ints[i] = new Integer(i);
99	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
132	>	new PriorityBlockingQueue(elements);
133		shouldThrow();
134		} catch (NullPointerException success) {}
135		}
#	Line 107 | Line 140 | public class PriorityBlockingQueueTest e
140		public void testConstructor6() {
141		Integer[] ints = new Integer[SIZE];
142		for (int i = 0; i < SIZE; ++i)
143	<	ints[i] = new Integer(i);
143	>	ints[i] = i;
144		PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
145		for (int i = 0; i < SIZE; ++i)
146		assertEquals(ints[i], q.poll());
#	Line 124 | Line 157 | public class PriorityBlockingQueueTest e
157		for (int i = 0; i < SIZE; ++i)
158		ints[i] = new Integer(i);
159		q.addAll(Arrays.asList(ints));
160	<	for (int i = SIZE-1; i >= 0; --i)
160	>	for (int i = SIZE - 1; i >= 0; --i)
161		assertEquals(ints[i], q.poll());
162		}
163
#	Line 134 | Line 167 | public class PriorityBlockingQueueTest e
167		public void testEmpty() {
168		PriorityBlockingQueue q = new PriorityBlockingQueue(2);
169		assertTrue(q.isEmpty());
170	<	assertEquals(NOCAP, q.remainingCapacity());
170	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
171		q.add(one);
172		assertFalse(q.isEmpty());
173		q.add(two);
#	Line 144 | Line 177 | public class PriorityBlockingQueueTest e
177		}
178
179		/**
180	<	* remainingCapacity does not change when elements added or removed,
148	<	* but size does
180	>	* remainingCapacity() always returns Integer.MAX_VALUE
181		*/
182		public void testRemainingCapacity() {
183	<	PriorityBlockingQueue q = populatedQueue(SIZE);
183	>	BlockingQueue q = populatedQueue(SIZE);
184		for (int i = 0; i < SIZE; ++i) {
185	<	assertEquals(NOCAP, q.remainingCapacity());
186	<	assertEquals(SIZE-i, q.size());
187	<	q.remove();
185	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
186	>	assertEquals(SIZE - i, q.size());
187	>	assertEquals(i, q.remove());
188		}
189		for (int i = 0; i < SIZE; ++i) {
190	<	assertEquals(NOCAP, q.remainingCapacity());
190	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
191		assertEquals(i, q.size());
192	<	q.add(new Integer(i));
192	>	assertTrue(q.add(i));
193		}
194		}
195
196		/**
165	–	* offer(null) throws NPE
166	–	*/
167	–	public void testOfferNull() {
168	–	try {
169	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
170	–	q.offer(null);
171	–	shouldThrow();
172	–	} catch (NullPointerException success) {}
173	–	}
174	–
175	–	/**
176	–	* add(null) throws NPE
177	–	*/
178	–	public void testAddNull() {
179	–	try {
180	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
181	–	q.add(null);
182	–	shouldThrow();
183	–	} catch (NullPointerException success) {}
184	–	}
185	–
186	–	/**
197		* Offer of comparable element succeeds
198		*/
199		public void testOffer() {
#	Line 196 | Line 206 | public class PriorityBlockingQueueTest e
206		* Offer of non-Comparable throws CCE
207		*/
208		public void testOfferNonComparable() {
209	+	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
210		try {
200	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
201	–	q.offer(new Object());
202	–	q.offer(new Object());
211		q.offer(new Object());
212		shouldThrow();
213	<	} catch (ClassCastException success) {}
213	>	} catch (ClassCastException success) {
214	>	assertTrue(q.isEmpty());
215	>	assertEquals(0, q.size());
216	>	assertNull(q.poll());
217	>	}
218		}
219
220		/**
#	Line 217 | Line 229 | public class PriorityBlockingQueueTest e
229		}
230
231		/**
220	–	* addAll(null) throws NPE
221	–	*/
222	–	public void testAddAll1() {
223	–	try {
224	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
225	–	q.addAll(null);
226	–	shouldThrow();
227	–	} catch (NullPointerException success) {}
228	–	}
229	–
230	–	/**
232		* addAll(this) throws IAE
233		*/
234		public void testAddAllSelf() {
235	+	PriorityBlockingQueue q = populatedQueue(SIZE);
236		try {
235	–	PriorityBlockingQueue q = populatedQueue(SIZE);
237		q.addAll(q);
238		shouldThrow();
239		} catch (IllegalArgumentException success) {}
240		}
241
242		/**
242	–	* addAll of a collection with null elements throws NPE
243	–	*/
244	–	public void testAddAll2() {
245	–	try {
246	–	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
247	–	Integer[] ints = new Integer[SIZE];
248	–	q.addAll(Arrays.asList(ints));
249	–	shouldThrow();
250	–	} catch (NullPointerException success) {}
251	–	}
252	–	/**
243		* addAll of a collection with any null elements throws NPE after
244		* possibly adding some elements
245		*/
246		public void testAddAll3() {
247	+	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
248	+	Integer[] ints = new Integer[SIZE];
249	+	for (int i = 0; i < SIZE - 1; ++i)
250	+	ints[i] = new Integer(i);
251		try {
258	–	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
259	–	Integer[] ints = new Integer[SIZE];
260	–	for (int i = 0; i < SIZE-1; ++i)
261	–	ints[i] = new Integer(i);
252		q.addAll(Arrays.asList(ints));
253		shouldThrow();
254		} catch (NullPointerException success) {}
#	Line 270 | Line 260 | public class PriorityBlockingQueueTest e
260		public void testAddAll5() {
261		Integer[] empty = new Integer[0];
262		Integer[] ints = new Integer[SIZE];
263	<	for (int i = SIZE-1; i >= 0; --i)
263	>	for (int i = SIZE - 1; i >= 0; --i)
264		ints[i] = new Integer(i);
265		PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
266		assertFalse(q.addAll(Arrays.asList(empty)));
#	Line 280 | Line 270 | public class PriorityBlockingQueueTest e
270		}
271
272		/**
283	–	* put(null) throws NPE
284	–	*/
285	–	public void testPutNull() {
286	–	try {
287	–	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
288	–	q.put(null);
289	–	shouldThrow();
290	–	} catch (NullPointerException success) {}
291	–	}
292	–
293	–	/**
273		* all elements successfully put are contained
274		*/
275	<	public void testPut() {
276	<	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
277	<	for (int i = 0; i < SIZE; ++i) {
278	<	Integer I = new Integer(i);
279	<	q.put(I);
280	<	assertTrue(q.contains(I));
281	<	}
282	<	assertEquals(SIZE, q.size());
275	>	public void testPut() {
276	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
277	>	for (int i = 0; i < SIZE; ++i) {
278	>	Integer x = new Integer(i);
279	>	q.put(x);
280	>	assertTrue(q.contains(x));
281	>	}
282	>	assertEquals(SIZE, q.size());
283		}
284
285		/**
#	Line 309 | Line 288 | public class PriorityBlockingQueueTest e
288		public void testPutWithTake() throws InterruptedException {
289		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
290		final int size = 4;
291	<	Thread t = new Thread(new CheckedRunnable() {
291	>	Thread t = newStartedThread(new CheckedRunnable() {
292		public void realRun() {
293		for (int i = 0; i < size; i++)
294		q.put(new Integer(0));
295		}});
296
297	<	t.start();
298	<	Thread.sleep(SHORT_DELAY_MS);
320	<	assertEquals(q.size(), size);
297	>	awaitTermination(t);
298	>	assertEquals(size, q.size());
299		q.take();
322	–	t.interrupt();
323	–	t.join();
300		}
301
302		/**
#	Line 328 | Line 304 | public class PriorityBlockingQueueTest e
304		*/
305		public void testTimedOffer() throws InterruptedException {
306		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
307	<	Thread t = new Thread(new CheckedRunnable() {
307	>	Thread t = newStartedThread(new CheckedRunnable() {
308		public void realRun() {
309		q.put(new Integer(0));
310		q.put(new Integer(0));
#	Line 336 | Line 312 | public class PriorityBlockingQueueTest e
312		assertTrue(q.offer(new Integer(0), LONG_DELAY_MS, MILLISECONDS));
313		}});
314
315	<	t.start();
340	<	Thread.sleep(SMALL_DELAY_MS);
341	<	t.interrupt();
342	<	t.join();
315	>	awaitTermination(t);
316		}
317
318		/**
#	Line 348 | Line 321 | public class PriorityBlockingQueueTest e
321		public void testTake() throws InterruptedException {
322		PriorityBlockingQueue q = populatedQueue(SIZE);
323		for (int i = 0; i < SIZE; ++i) {
324	<	assertEquals(i, ((Integer)q.take()).intValue());
324	>	assertEquals(i, q.take());
325		}
326		}
327
328		/**
356	–	* take blocks interruptibly when empty
357	–	*/
358	–	public void testTakeFromEmpty() throws InterruptedException {
359	–	final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
360	–	Thread t = new Thread(new CheckedInterruptedRunnable() {
361	–	public void realRun() throws InterruptedException {
362	–	q.take();
363	–	}});
364	–
365	–	t.start();
366	–	Thread.sleep(SHORT_DELAY_MS);
367	–	t.interrupt();
368	–	t.join();
369	–	}
370	–
371	–	/**
329		* Take removes existing elements until empty, then blocks interruptibly
330		*/
331		public void testBlockingTake() throws InterruptedException {
332		final PriorityBlockingQueue q = populatedQueue(SIZE);
333	<	Thread t = new Thread(new CheckedRunnable() {
333	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
334	>	Thread t = newStartedThread(new CheckedRunnable() {
335		public void realRun() throws InterruptedException {
336	<	for (int i = 0; i < SIZE; ++i) {
337	<	assertEquals(i, q.take());
338	<	}
336	>	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
337	>
338	>	Thread.currentThread().interrupt();
339		try {
340		q.take();
341		shouldThrow();
342		} catch (InterruptedException success) {}
343	+	assertFalse(Thread.interrupted());
344	+
345	+	pleaseInterrupt.countDown();
346	+	try {
347	+	q.take();
348	+	shouldThrow();
349	+	} catch (InterruptedException success) {}
350	+	assertFalse(Thread.interrupted());
351		}});
352
353	<	t.start();
354	<	Thread.sleep(SHORT_DELAY_MS);
353	>	await(pleaseInterrupt);
354	>	assertThreadBlocks(t, Thread.State.WAITING);
355		t.interrupt();
356	<	t.join();
356	>	awaitTermination(t);
357		}
358
393	–
359		/**
360		* poll succeeds unless empty
361		*/
362		public void testPoll() {
363		PriorityBlockingQueue q = populatedQueue(SIZE);
364		for (int i = 0; i < SIZE; ++i) {
365	<	assertEquals(i, ((Integer)q.poll()).intValue());
365	>	assertEquals(i, q.poll());
366		}
367		assertNull(q.poll());
368		}
369
370		/**
371	<	* timed pool with zero timeout succeeds when non-empty, else times out
371	>	* timed poll with zero timeout succeeds when non-empty, else times out
372		*/
373		public void testTimedPoll0() throws InterruptedException {
374		PriorityBlockingQueue q = populatedQueue(SIZE);
375		for (int i = 0; i < SIZE; ++i) {
376	<	assertEquals(i, ((Integer)q.poll(0, MILLISECONDS)).intValue());
376	>	assertEquals(i, q.poll(0, MILLISECONDS));
377		}
378		assertNull(q.poll(0, MILLISECONDS));
379		}
380
381		/**
382	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
382	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
383		*/
384		public void testTimedPoll() throws InterruptedException {
385	<	PriorityBlockingQueue q = populatedQueue(SIZE);
385	>	PriorityBlockingQueue<Integer> q = populatedQueue(SIZE);
386		for (int i = 0; i < SIZE; ++i) {
387	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
388	<	}
389	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
387	>	long startTime = System.nanoTime();
388	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
389	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
390	>	}
391	>	long startTime = System.nanoTime();
392	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
393	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
394	>	checkEmpty(q);
395		}
396
397		/**
#	Line 429 | Line 399 | public class PriorityBlockingQueueTest e
399		* returning timeout status
400		*/
401		public void testInterruptedTimedPoll() throws InterruptedException {
402	<	Thread t = new Thread(new CheckedRunnable() {
402	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
403	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
404	>	Thread t = newStartedThread(new CheckedRunnable() {
405		public void realRun() throws InterruptedException {
406	<	PriorityBlockingQueue q = populatedQueue(SIZE);
406	>	long startTime = System.nanoTime();
407		for (int i = 0; i < SIZE; ++i) {
408	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
408	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
409		}
410	<	try {
439	<	q.poll(SMALL_DELAY_MS, MILLISECONDS);
440	<	shouldThrow();
441	<	} catch (InterruptedException success) {}
442	<	}});
443	<
444	<	t.start();
445	<	Thread.sleep(SHORT_DELAY_MS);
446	<	t.interrupt();
447	<	t.join();
448	<	}
449	<
450	<	/**
451	<	*  timed poll before a delayed offer fails; after offer succeeds;
452	<	*  on interruption throws
453	<	*/
454	<	public void testTimedPollWithOffer() throws InterruptedException {
455	<	final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
456	<	Thread t = new Thread(new CheckedRunnable() {
457	<	public void realRun() throws InterruptedException {
458	<	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
459	<	assertSame(zero, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
410	>	aboutToWait.countDown();
411		try {
412		q.poll(LONG_DELAY_MS, MILLISECONDS);
413		shouldThrow();
414	<	} catch (InterruptedException success) {}
414	>	} catch (InterruptedException success) {
415	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
416	>	}
417		}});
418
419	<	t.start();
420	<	Thread.sleep(SMALL_DELAY_MS);
468	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
419	>	await(aboutToWait);
420	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
421		t.interrupt();
422	<	t.join();
422	>	awaitTermination(t);
423		}
424
473	–
425		/**
426		* peek returns next element, or null if empty
427		*/
428		public void testPeek() {
429		PriorityBlockingQueue q = populatedQueue(SIZE);
430		for (int i = 0; i < SIZE; ++i) {
431	<	assertEquals(i, ((Integer)q.peek()).intValue());
432	<	q.poll();
431	>	assertEquals(i, q.peek());
432	>	assertEquals(i, q.poll());
433		assertTrue(q.peek() == null ||
434	<	i != ((Integer)q.peek()).intValue());
434	>	!q.peek().equals(i));
435		}
436		assertNull(q.peek());
437		}
#	Line 491 | Line 442 | public class PriorityBlockingQueueTest e
442		public void testElement() {
443		PriorityBlockingQueue q = populatedQueue(SIZE);
444		for (int i = 0; i < SIZE; ++i) {
445	<	assertEquals(i, ((Integer)q.element()).intValue());
446	<	q.poll();
445	>	assertEquals(i, q.element());
446	>	assertEquals(i, q.poll());
447		}
448		try {
449		q.element();
#	Line 506 | Line 457 | public class PriorityBlockingQueueTest e
457		public void testRemove() {
458		PriorityBlockingQueue q = populatedQueue(SIZE);
459		for (int i = 0; i < SIZE; ++i) {
460	<	assertEquals(i, ((Integer)q.remove()).intValue());
460	>	assertEquals(i, q.remove());
461		}
462		try {
463		q.remove();
#	Line 515 | Line 466 | public class PriorityBlockingQueueTest e
466		}
467
468		/**
518	–	* remove(x) removes x and returns true if present
519	–	*/
520	–	public void testRemoveElement() {
521	–	PriorityBlockingQueue q = populatedQueue(SIZE);
522	–	for (int i = 1; i < SIZE; i+=2) {
523	–	assertTrue(q.remove(new Integer(i)));
524	–	}
525	–	for (int i = 0; i < SIZE; i+=2) {
526	–	assertTrue(q.remove(new Integer(i)));
527	–	assertFalse(q.remove(new Integer(i+1)));
528	–	}
529	–	assertTrue(q.isEmpty());
530	–	}
531	–
532	–	/**
469		* contains(x) reports true when elements added but not yet removed
470		*/
471		public void testContains() {
#	Line 584 | Line 520 | public class PriorityBlockingQueueTest e
520		assertTrue(changed);
521
522		assertTrue(q.containsAll(p));
523	<	assertEquals(SIZE-i, q.size());
523	>	assertEquals(SIZE - i, q.size());
524		p.remove();
525		}
526		}
#	Line 597 | Line 533 | public class PriorityBlockingQueueTest e
533		PriorityBlockingQueue q = populatedQueue(SIZE);
534		PriorityBlockingQueue p = populatedQueue(i);
535		assertTrue(q.removeAll(p));
536	<	assertEquals(SIZE-i, q.size());
536	>	assertEquals(SIZE - i, q.size());
537		for (int j = 0; j < i; ++j) {
538	<	Integer I = (Integer)(p.remove());
539	<	assertFalse(q.contains(I));
538	>	Integer x = (Integer)(p.remove());
539	>	assertFalse(q.contains(x));
540		}
541		}
542		}
543
544		/**
545	<	*  toArray contains all elements
545	>	* toArray contains all elements
546		*/
547		public void testToArray() throws InterruptedException {
548		PriorityBlockingQueue q = populatedQueue(SIZE);
549		Object[] o = q.toArray();
550		Arrays.sort(o);
551		for (int i = 0; i < o.length; i++)
552	<	assertEquals(o[i], q.take());
552	>	assertSame(o[i], q.take());
553		}
554
555		/**
556		* toArray(a) contains all elements
557		*/
558		public void testToArray2() throws InterruptedException {
559	<	PriorityBlockingQueue q = populatedQueue(SIZE);
559	>	PriorityBlockingQueue<Integer> q = populatedQueue(SIZE);
560		Integer[] ints = new Integer[SIZE];
561	<	ints = (Integer[])q.toArray(ints);
561	>	Integer[] array = q.toArray(ints);
562	>	assertSame(ints, array);
563		Arrays.sort(ints);
564		for (int i = 0; i < ints.length; i++)
565	<	assertEquals(ints[i], q.take());
629	<	}
630	<
631	<	/**
632	<	* toArray(null) throws NPE
633	<	*/
634	<	public void testToArray_BadArg() {
635	<	try {
636	<	PriorityBlockingQueue q = populatedQueue(SIZE);
637	<	Object o[] = q.toArray(null);
638	<	shouldThrow();
639	<	} catch (NullPointerException success) {}
565	>	assertSame(ints[i], q.take());
566		}
567
568		/**
569	<	* toArray with incompatible array type throws CCE
569	>	* toArray(incompatible array type) throws ArrayStoreException
570		*/
571		public void testToArray1_BadArg() {
572	+	PriorityBlockingQueue q = populatedQueue(SIZE);
573		try {
574	<	PriorityBlockingQueue q = populatedQueue(SIZE);
648	<	Object o[] = q.toArray(new String[10] );
574	>	q.toArray(new String[10]);
575		shouldThrow();
576		} catch (ArrayStoreException success) {}
577		}
#	Line 655 | Line 581 | public class PriorityBlockingQueueTest e
581		*/
582		public void testIterator() {
583		PriorityBlockingQueue q = populatedQueue(SIZE);
658	–	int i = 0;
584		Iterator it = q.iterator();
585	<	while (it.hasNext()) {
585	>	int i;
586	>	for (i = 0; it.hasNext(); i++)
587		assertTrue(q.contains(it.next()));
662	–	++i;
663	–	}
588		assertEquals(i, SIZE);
589	+	assertIteratorExhausted(it);
590	+	}
591	+
592	+	/**
593	+	* iterator of empty collection has no elements
594	+	*/
595	+	public void testEmptyIterator() {
596	+	assertIteratorExhausted(new PriorityBlockingQueue().iterator());
597		}
598
599		/**
600		* iterator.remove removes current element
601		*/
602	<	public void testIteratorRemove () {
602	>	public void testIteratorRemove() {
603		final PriorityBlockingQueue q = new PriorityBlockingQueue(3);
604		q.add(new Integer(2));
605		q.add(new Integer(1));
#	Line 683 | Line 615 | public class PriorityBlockingQueueTest e
615		assertFalse(it.hasNext());
616		}
617
686	–
618		/**
619		* toString contains toStrings of elements
620		*/
#	Line 691 | Line 622 | public class PriorityBlockingQueueTest e
622		PriorityBlockingQueue q = populatedQueue(SIZE);
623		String s = q.toString();
624		for (int i = 0; i < SIZE; ++i) {
625	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
625	>	assertTrue(s.contains(String.valueOf(i)));
626		}
627		}
628
629		/**
630	<	* offer transfers elements across Executor tasks
630	>	* timed poll transfers elements across Executor tasks
631		*/
632		public void testPollInExecutor() {
633		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
634	<	ExecutorService executor = Executors.newFixedThreadPool(2);
635	<	executor.execute(new CheckedRunnable() {
636	<	public void realRun() throws InterruptedException {
637	<	threadAssertNull(q.poll());
638	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
639	<	threadAssertTrue(q.isEmpty());
640	<	}});
641	<
642	<	executor.execute(new CheckedRunnable() {
643	<	public void realRun() throws InterruptedException {
644	<	Thread.sleep(SMALL_DELAY_MS);
645	<	q.put(new Integer(1));
646	<	}});
647	<
648	<	joinPool(executor);
634	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
635	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
636	>	try (PoolCleaner cleaner = cleaner(executor)) {
637	>	executor.execute(new CheckedRunnable() {
638	>	public void realRun() throws InterruptedException {
639	>	assertNull(q.poll());
640	>	threadsStarted.await();
641	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
642	>	checkEmpty(q);
643	>	}});
644	>
645	>	executor.execute(new CheckedRunnable() {
646	>	public void realRun() throws InterruptedException {
647	>	threadsStarted.await();
648	>	q.put(one);
649	>	}});
650	>	}
651		}
652
653		/**
654		* A deserialized serialized queue has same elements
655		*/
656		public void testSerialization() throws Exception {
657	<	PriorityBlockingQueue q = populatedQueue(SIZE);
658	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
726	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
727	<	out.writeObject(q);
728	<	out.close();
729	<
730	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
731	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
732	<	PriorityBlockingQueue r = (PriorityBlockingQueue)in.readObject();
733	<	assertEquals(q.size(), r.size());
734	<	while (!q.isEmpty())
735	<	assertEquals(q.remove(), r.remove());
736	<	}
737	<
738	<	/**
739	<	* drainTo(null) throws NPE
740	<	*/
741	<	public void testDrainToNull() {
742	<	PriorityBlockingQueue q = populatedQueue(SIZE);
743	<	try {
744	<	q.drainTo(null);
745	<	shouldThrow();
746	<	} catch (NullPointerException success) {}
747	<	}
657	>	Queue x = populatedQueue(SIZE);
658	>	Queue y = serialClone(x);
659
660	<	/**
661	<	* drainTo(this) throws IAE
662	<	*/
663	<	public void testDrainToSelf() {
664	<	PriorityBlockingQueue q = populatedQueue(SIZE);
665	<	try {
666	<	q.drainTo(q);
756	<	shouldThrow();
757	<	} catch (IllegalArgumentException success) {}
660	>	assertNotSame(x, y);
661	>	assertEquals(x.size(), y.size());
662	>	while (!x.isEmpty()) {
663	>	assertFalse(y.isEmpty());
664	>	assertEquals(x.remove(), y.remove());
665	>	}
666	>	assertTrue(y.isEmpty());
667		}
668
669		/**
#	Line 764 | Line 673 | public class PriorityBlockingQueueTest e
673		PriorityBlockingQueue q = populatedQueue(SIZE);
674		ArrayList l = new ArrayList();
675		q.drainTo(l);
676	<	assertEquals(q.size(), 0);
677	<	assertEquals(l.size(), SIZE);
676	>	assertEquals(0, q.size());
677	>	assertEquals(SIZE, l.size());
678		for (int i = 0; i < SIZE; ++i)
679		assertEquals(l.get(i), new Integer(i));
680		q.add(zero);
#	Line 775 | Line 684 | public class PriorityBlockingQueueTest e
684		assertTrue(q.contains(one));
685		l.clear();
686		q.drainTo(l);
687	<	assertEquals(q.size(), 0);
688	<	assertEquals(l.size(), 2);
687	>	assertEquals(0, q.size());
688	>	assertEquals(2, l.size());
689		for (int i = 0; i < 2; ++i)
690		assertEquals(l.get(i), new Integer(i));
691		}
#	Line 788 | Line 697 | public class PriorityBlockingQueueTest e
697		final PriorityBlockingQueue q = populatedQueue(SIZE);
698		Thread t = new Thread(new CheckedRunnable() {
699		public void realRun() {
700	<	q.put(new Integer(SIZE+1));
700	>	q.put(new Integer(SIZE + 1));
701		}});
702
703		t.start();
#	Line 802 | Line 711 | public class PriorityBlockingQueueTest e
711		}
712
713		/**
714	<	* drainTo(null, n) throws NPE
806	<	*/
807	<	public void testDrainToNullN() {
808	<	PriorityBlockingQueue q = populatedQueue(SIZE);
809	<	try {
810	<	q.drainTo(null, 0);
811	<	shouldThrow();
812	<	} catch (NullPointerException success) {}
813	<	}
814	<
815	<	/**
816	<	* drainTo(this, n) throws IAE
817	<	*/
818	<	public void testDrainToSelfN() {
819	<	PriorityBlockingQueue q = populatedQueue(SIZE);
820	<	try {
821	<	q.drainTo(q, 0);
822	<	shouldThrow();
823	<	} catch (IllegalArgumentException success) {}
824	<	}
825	<
826	<	/**
827	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
714	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
715		*/
716		public void testDrainToN() {
717	<	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2);
717	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE * 2);
718		for (int i = 0; i < SIZE + 2; ++i) {
719		for (int j = 0; j < SIZE; j++)
720		assertTrue(q.offer(new Integer(j)));
721		ArrayList l = new ArrayList();
722		q.drainTo(l, i);
723	<	int k = (i < SIZE)? i : SIZE;
724	<	assertEquals(l.size(), k);
725	<	assertEquals(q.size(), SIZE-k);
723	>	int k = (i < SIZE) ? i : SIZE;
724	>	assertEquals(k, l.size());
725	>	assertEquals(SIZE - k, q.size());
726		for (int j = 0; j < k; ++j)
727		assertEquals(l.get(j), new Integer(j));
728	<	while (q.poll() != null) ;
728	>	do {} while (q.poll() != null);
729	>	}
730	>	}
731	>
732	>	/**
733	>	* remove(null), contains(null) always return false
734	>	*/
735	>	public void testNeverContainsNull() {
736	>	Collection<?>[] qs = {
737	>	new PriorityBlockingQueue<Object>(),
738	>	populatedQueue(2),
739	>	};
740	>
741	>	for (Collection<?> q : qs) {
742	>	assertFalse(q.contains(null));
743	>	assertFalse(q.remove(null));
744		}
745		}
746

Diff Legend

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