ViewVC Help

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

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

Comparing jsr166/src/test/tck/PriorityQueueTest.java (file contents):
Revision 1.11 by jsr166, Mon Nov 16 05:30:08 2009 UTC vs.
Revision 1.45 by jsr166, Sun May 6 22:09:42 2018 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.*;
12	<	import java.io.*;
9	>	import java.util.Arrays;
10	>	import java.util.Collection;
11	>	import java.util.Comparator;
12	>	import java.util.Iterator;
13	>	import java.util.NoSuchElementException;
14	>	import java.util.PriorityQueue;
15	>	import java.util.Queue;
16	>
17	>	import junit.framework.Test;
18
19		public class PriorityQueueTest extends JSR166TestCase {
20		public static void main(String[] args) {
21	<	junit.textui.TestRunner.run (suite());
21	>	main(suite(), args);
22		}
23		public static Test suite() {
24	<	return new TestSuite(PriorityQueueTest.class);
24	>	class Implementation implements CollectionImplementation {
25	>	public Class<?> klazz() { return PriorityQueue.class; }
26	>	public Collection emptyCollection() { return new PriorityQueue(); }
27	>	public Object makeElement(int i) { return i; }
28	>	public boolean isConcurrent() { return false; }
29	>	public boolean permitsNulls() { return false; }
30	>	}
31	>	class ComparatorImplementation implements CollectionImplementation {
32	>	public Class<?> klazz() { return PriorityQueue.class; }
33	>	public Collection emptyCollection() { return new PriorityQueue(new MyReverseComparator()); }
34	>	public Object makeElement(int i) { return i; }
35	>	public boolean isConcurrent() { return false; }
36	>	public boolean permitsNulls() { return false; }
37	>	}
38	>	return newTestSuite(PriorityQueueTest.class,
39	>	CollectionTest.testSuite(new Implementation()),
40	>	CollectionTest.testSuite(new ComparatorImplementation()));
41		}
42
43	<	static class MyReverseComparator implements Comparator {
43	>	static class MyReverseComparator implements Comparator, java.io.Serializable {
44		public int compare(Object x, Object y) {
45	<	int i = ((Integer)x).intValue();
25	<	int j = ((Integer)y).intValue();
26	<	if (i < j) return 1;
27	<	if (i > j) return -1;
28	<	return 0;
45	>	return ((Comparable)y).compareTo(x);
46		}
47		}
48
49		/**
50	<	* Create a queue of given size containing consecutive
51	<	* Integers 0 ... n.
50	>	* Returns a new queue of given size containing consecutive
51	>	* Integers 0 ... n - 1.
52		*/
53	<	private PriorityQueue populatedQueue(int n) {
54	<	PriorityQueue q = new PriorityQueue(n);
53	>	private static PriorityQueue<Integer> populatedQueue(int n) {
54	>	PriorityQueue<Integer> q = new PriorityQueue<>(n);
55		assertTrue(q.isEmpty());
56	<	for (int i = n-1; i >= 0; i-=2)
57	<	assertTrue(q.offer(new Integer(i)));
58	<	for (int i = (n & 1); i < n; i+=2)
59	<	assertTrue(q.offer(new Integer(i)));
56	>	for (int i = n - 1; i >= 0; i -= 2)
57	>	assertTrue(q.offer(new Integer(i)));
58	>	for (int i = (n & 1); i < n; i += 2)
59	>	assertTrue(q.offer(new Integer(i)));
60		assertFalse(q.isEmpty());
61	<	assertEquals(n, q.size());
61	>	assertEquals(n, q.size());
62	>	assertEquals((Integer) 0, q.peek());
63		return q;
64		}
65
#	Line 53 | Line 71 | public class PriorityQueueTest extends J
71		}
72
73		/**
74	<	* Constructor throws IAE if  capacity argument nonpositive
74	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
75		*/
76		public void testConstructor2() {
77		try {
78	<	PriorityQueue q = new PriorityQueue(0);
78	>	new PriorityQueue(0);
79		shouldThrow();
80	<	}
63	<	catch (IllegalArgumentException success) {}
80	>	} catch (IllegalArgumentException success) {}
81		}
82
83		/**
#	Line 68 | Line 85 | public class PriorityQueueTest extends J
85		*/
86		public void testConstructor3() {
87		try {
88	<	PriorityQueue q = new PriorityQueue((Collection)null);
88	>	new PriorityQueue((Collection)null);
89		shouldThrow();
90	<	}
74	<	catch (NullPointerException success) {}
90	>	} catch (NullPointerException success) {}
91		}
92
93		/**
#	Line 79 | Line 95 | public class PriorityQueueTest extends J
95		*/
96		public void testConstructor4() {
97		try {
98	<	Integer[] ints = new Integer[SIZE];
83	<	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
98	>	new PriorityQueue(Arrays.asList(new Integer[SIZE]));
99		shouldThrow();
100	<	}
86	<	catch (NullPointerException success) {}
100	>	} catch (NullPointerException success) {}
101		}
102
103		/**
104		* Initializing from Collection with some null elements throws NPE
105		*/
106		public void testConstructor5() {
107	+	Integer[] ints = new Integer[SIZE];
108	+	for (int i = 0; i < SIZE - 1; ++i)
109	+	ints[i] = new Integer(i);
110		try {
111	<	Integer[] ints = new Integer[SIZE];
95	<	for (int i = 0; i < SIZE-1; ++i)
96	<	ints[i] = new Integer(i);
97	<	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
111	>	new PriorityQueue(Arrays.asList(ints));
112		shouldThrow();
113	<	}
100	<	catch (NullPointerException success) {}
113	>	} catch (NullPointerException success) {}
114		}
115
116		/**
117		* Queue contains all elements of collection used to initialize
118		*/
119		public void testConstructor6() {
120	<	try {
121	<	Integer[] ints = new Integer[SIZE];
122	<	for (int i = 0; i < SIZE; ++i)
123	<	ints[i] = new Integer(i);
124	<	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
125	<	for (int i = 0; i < SIZE; ++i)
113	<	assertEquals(ints[i], q.poll());
114	<	}
115	<	finally {}
120	>	Integer[] ints = new Integer[SIZE];
121	>	for (int i = 0; i < SIZE; ++i)
122	>	ints[i] = new Integer(i);
123	>	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
124	>	for (int i = 0; i < SIZE; ++i)
125	>	assertEquals(ints[i], q.poll());
126		}
127
128		/**
129		* The comparator used in constructor is used
130		*/
131		public void testConstructor7() {
132	<	try {
133	<	MyReverseComparator cmp = new MyReverseComparator();
134	<	PriorityQueue q = new PriorityQueue(SIZE, cmp);
135	<	assertEquals(cmp, q.comparator());
136	<	Integer[] ints = new Integer[SIZE];
137	<	for (int i = 0; i < SIZE; ++i)
138	<	ints[i] = new Integer(i);
139	<	q.addAll(Arrays.asList(ints));
140	<	for (int i = SIZE-1; i >= 0; --i)
131	<	assertEquals(ints[i], q.poll());
132	<	}
133	<	finally {}
132	>	MyReverseComparator cmp = new MyReverseComparator();
133	>	PriorityQueue q = new PriorityQueue(SIZE, cmp);
134	>	assertEquals(cmp, q.comparator());
135	>	Integer[] ints = new Integer[SIZE];
136	>	for (int i = 0; i < SIZE; ++i)
137	>	ints[i] = new Integer(i);
138	>	q.addAll(Arrays.asList(ints));
139	>	for (int i = SIZE - 1; i >= 0; --i)
140	>	assertEquals(ints[i], q.poll());
141		}
142
143		/**
#	Line 153 | Line 160 | public class PriorityQueueTest extends J
160		public void testSize() {
161		PriorityQueue q = populatedQueue(SIZE);
162		for (int i = 0; i < SIZE; ++i) {
163	<	assertEquals(SIZE-i, q.size());
163	>	assertEquals(SIZE - i, q.size());
164		q.remove();
165		}
166		for (int i = 0; i < SIZE; ++i) {
#	Line 166 | Line 173 | public class PriorityQueueTest extends J
173		* offer(null) throws NPE
174		*/
175		public void testOfferNull() {
176	<	try {
177	<	PriorityQueue q = new PriorityQueue(1);
176	>	PriorityQueue q = new PriorityQueue(1);
177	>	try {
178		q.offer(null);
179		shouldThrow();
180	<	} catch (NullPointerException success) { }
180	>	} catch (NullPointerException success) {}
181		}
182
183		/**
184		* add(null) throws NPE
185		*/
186		public void testAddNull() {
187	<	try {
188	<	PriorityQueue q = new PriorityQueue(1);
187	>	PriorityQueue q = new PriorityQueue(1);
188	>	try {
189		q.add(null);
190		shouldThrow();
191	<	} catch (NullPointerException success) { }
191	>	} catch (NullPointerException success) {}
192		}
193
194		/**
#	Line 197 | Line 204 | public class PriorityQueueTest extends J
204		* Offer of non-Comparable throws CCE
205		*/
206		public void testOfferNonComparable() {
207	+	PriorityQueue q = new PriorityQueue(1);
208		try {
201	–	PriorityQueue q = new PriorityQueue(1);
202	–	q.offer(new Object());
203	–	q.offer(new Object());
209		q.offer(new Object());
210		shouldThrow();
211	+	} catch (ClassCastException success) {
212	+	assertTrue(q.isEmpty());
213	+	assertEquals(0, q.size());
214	+	assertNull(q.poll());
215		}
207	–	catch (ClassCastException success) {}
216		}
217
218		/**
#	Line 222 | Line 230 | public class PriorityQueueTest extends J
230		* addAll(null) throws NPE
231		*/
232		public void testAddAll1() {
233	+	PriorityQueue q = new PriorityQueue(1);
234		try {
226	–	PriorityQueue q = new PriorityQueue(1);
235		q.addAll(null);
236		shouldThrow();
237	<	}
230	<	catch (NullPointerException success) {}
237	>	} catch (NullPointerException success) {}
238		}
239	+
240		/**
241		* addAll of a collection with null elements throws NPE
242		*/
243		public void testAddAll2() {
244	+	PriorityQueue q = new PriorityQueue(SIZE);
245		try {
246	<	PriorityQueue q = new PriorityQueue(SIZE);
238	<	Integer[] ints = new Integer[SIZE];
239	<	q.addAll(Arrays.asList(ints));
246	>	q.addAll(Arrays.asList(new Integer[SIZE]));
247		shouldThrow();
248	<	}
242	<	catch (NullPointerException success) {}
248	>	} catch (NullPointerException success) {}
249		}
250	+
251		/**
252		* addAll of a collection with any null elements throws NPE after
253		* possibly adding some elements
254		*/
255		public void testAddAll3() {
256	+	PriorityQueue q = new PriorityQueue(SIZE);
257	+	Integer[] ints = new Integer[SIZE];
258	+	for (int i = 0; i < SIZE - 1; ++i)
259	+	ints[i] = new Integer(i);
260		try {
250	–	PriorityQueue q = new PriorityQueue(SIZE);
251	–	Integer[] ints = new Integer[SIZE];
252	–	for (int i = 0; i < SIZE-1; ++i)
253	–	ints[i] = new Integer(i);
261		q.addAll(Arrays.asList(ints));
262		shouldThrow();
263	<	}
257	<	catch (NullPointerException success) {}
263	>	} catch (NullPointerException success) {}
264		}
265
266		/**
267		* Queue contains all elements of successful addAll
268		*/
269		public void testAddAll5() {
270	<	try {
271	<	Integer[] empty = new Integer[0];
272	<	Integer[] ints = new Integer[SIZE];
273	<	for (int i = 0; i < SIZE; ++i)
274	<	ints[i] = new Integer(SIZE-1-i);
275	<	PriorityQueue q = new PriorityQueue(SIZE);
276	<	assertFalse(q.addAll(Arrays.asList(empty)));
277	<	assertTrue(q.addAll(Arrays.asList(ints)));
278	<	for (int i = 0; i < SIZE; ++i)
273	<	assertEquals(new Integer(i), q.poll());
274	<	}
275	<	finally {}
270	>	Integer[] empty = new Integer[0];
271	>	Integer[] ints = new Integer[SIZE];
272	>	for (int i = 0; i < SIZE; ++i)
273	>	ints[i] = new Integer(SIZE - 1 - i);
274	>	PriorityQueue q = new PriorityQueue(SIZE);
275	>	assertFalse(q.addAll(Arrays.asList(empty)));
276	>	assertTrue(q.addAll(Arrays.asList(ints)));
277	>	for (int i = 0; i < SIZE; ++i)
278	>	assertEquals(new Integer(i), q.poll());
279		}
280
281		/**
#	Line 281 | Line 284 | public class PriorityQueueTest extends J
284		public void testPoll() {
285		PriorityQueue q = populatedQueue(SIZE);
286		for (int i = 0; i < SIZE; ++i) {
287	<	assertEquals(i, ((Integer)q.poll()).intValue());
287	>	assertEquals(i, q.poll());
288		}
289	<	assertNull(q.poll());
289	>	assertNull(q.poll());
290		}
291
292		/**
#	Line 292 | Line 295 | public class PriorityQueueTest extends J
295		public void testPeek() {
296		PriorityQueue q = populatedQueue(SIZE);
297		for (int i = 0; i < SIZE; ++i) {
298	<	assertEquals(i, ((Integer)q.peek()).intValue());
299	<	q.poll();
298	>	assertEquals(i, q.peek());
299	>	assertEquals(i, q.poll());
300		assertTrue(q.peek() == null ||
301	<	i != ((Integer)q.peek()).intValue());
301	>	!q.peek().equals(i));
302		}
303	<	assertNull(q.peek());
303	>	assertNull(q.peek());
304		}
305
306		/**
#	Line 306 | Line 309 | public class PriorityQueueTest extends J
309		public void testElement() {
310		PriorityQueue q = populatedQueue(SIZE);
311		for (int i = 0; i < SIZE; ++i) {
312	<	assertEquals(i, ((Integer)q.element()).intValue());
313	<	q.poll();
312	>	assertEquals(i, q.element());
313	>	assertEquals(i, q.poll());
314		}
315		try {
316		q.element();
317		shouldThrow();
318	<	}
316	<	catch (NoSuchElementException success) {}
318	>	} catch (NoSuchElementException success) {}
319		}
320
321		/**
#	Line 322 | Line 324 | public class PriorityQueueTest extends J
324		public void testRemove() {
325		PriorityQueue q = populatedQueue(SIZE);
326		for (int i = 0; i < SIZE; ++i) {
327	<	assertEquals(i, ((Integer)q.remove()).intValue());
327	>	assertEquals(i, q.remove());
328		}
329		try {
330		q.remove();
331		shouldThrow();
332	<	} catch (NoSuchElementException success) {
331	<	}
332	>	} catch (NoSuchElementException success) {}
333		}
334
335		/**
#	Line 336 | Line 337 | public class PriorityQueueTest extends J
337		*/
338		public void testRemoveElement() {
339		PriorityQueue q = populatedQueue(SIZE);
340	<	for (int i = 1; i < SIZE; i+=2) {
341	<	assertTrue(q.remove(new Integer(i)));
342	<	}
343	<	for (int i = 0; i < SIZE; i+=2) {
344	<	assertTrue(q.remove(new Integer(i)));
345	<	assertFalse(q.remove(new Integer(i+1)));
340	>	for (int i = 1; i < SIZE; i += 2) {
341	>	assertTrue(q.contains(i));
342	>	assertTrue(q.remove(i));
343	>	assertFalse(q.contains(i));
344	>	assertTrue(q.contains(i - 1));
345	>	}
346	>	for (int i = 0; i < SIZE; i += 2) {
347	>	assertTrue(q.contains(i));
348	>	assertTrue(q.remove(i));
349	>	assertFalse(q.contains(i));
350	>	assertFalse(q.remove(i + 1));
351	>	assertFalse(q.contains(i + 1));
352		}
353		assertTrue(q.isEmpty());
354		}
#	Line 400 | Line 407 | public class PriorityQueueTest extends J
407		assertTrue(changed);
408
409		assertTrue(q.containsAll(p));
410	<	assertEquals(SIZE-i, q.size());
410	>	assertEquals(SIZE - i, q.size());
411		p.remove();
412		}
413		}
#	Line 413 | Line 420 | public class PriorityQueueTest extends J
420		PriorityQueue q = populatedQueue(SIZE);
421		PriorityQueue p = populatedQueue(i);
422		assertTrue(q.removeAll(p));
423	<	assertEquals(SIZE-i, q.size());
423	>	assertEquals(SIZE - i, q.size());
424		for (int j = 0; j < i; ++j) {
425	<	Integer I = (Integer)(p.remove());
426	<	assertFalse(q.contains(I));
425	>	Integer x = (Integer)(p.remove());
426	>	assertFalse(q.contains(x));
427		}
428		}
429		}
#	Line 426 | Line 433 | public class PriorityQueueTest extends J
433		*/
434		public void testToArray() {
435		PriorityQueue q = populatedQueue(SIZE);
436	<	Object[] o = q.toArray();
436	>	Object[] o = q.toArray();
437		Arrays.sort(o);
438	<	for (int i = 0; i < o.length; i++)
439	<	assertEquals(o[i], q.poll());
438	>	for (int i = 0; i < o.length; i++)
439	>	assertSame(o[i], q.poll());
440		}
441
442		/**
443		* toArray(a) contains all elements
444		*/
445		public void testToArray2() {
446	<	PriorityQueue q = populatedQueue(SIZE);
447	<	Integer[] ints = new Integer[SIZE];
448	<	ints = (Integer[])q.toArray(ints);
446	>	PriorityQueue<Integer> q = populatedQueue(SIZE);
447	>	Integer[] ints = new Integer[SIZE];
448	>	Integer[] array = q.toArray(ints);
449	>	assertSame(ints, array);
450		Arrays.sort(ints);
451		for (int i = 0; i < ints.length; i++)
452	<	assertEquals(ints[i], q.poll());
452	>	assertSame(ints[i], q.poll());
453		}
454
455		/**
#	Line 449 | Line 457 | public class PriorityQueueTest extends J
457		*/
458		public void testIterator() {
459		PriorityQueue q = populatedQueue(SIZE);
460	<	int i = 0;
461	<	Iterator it = q.iterator();
462	<	while (it.hasNext()) {
460	>	Iterator it = q.iterator();
461	>	int i;
462	>	for (i = 0; it.hasNext(); i++)
463		assertTrue(q.contains(it.next()));
456	–	++i;
457	–	}
464		assertEquals(i, SIZE);
465	+	assertIteratorExhausted(it);
466	+	}
467	+
468	+	/**
469	+	* iterator of empty collection has no elements
470	+	*/
471	+	public void testEmptyIterator() {
472	+	assertIteratorExhausted(new PriorityQueue().iterator());
473		}
474
475		/**
476		* iterator.remove removes current element
477		*/
478	<	public void testIteratorRemove () {
478	>	public void testIteratorRemove() {
479		final PriorityQueue q = new PriorityQueue(3);
480		q.add(new Integer(2));
481		q.add(new Integer(1));
#	Line 477 | Line 491 | public class PriorityQueueTest extends J
491		assertFalse(it.hasNext());
492		}
493
480	–
494		/**
495		* toString contains toStrings of elements
496		*/
#	Line 485 | Line 498 | public class PriorityQueueTest extends J
498		PriorityQueue q = populatedQueue(SIZE);
499		String s = q.toString();
500		for (int i = 0; i < SIZE; ++i) {
501	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
501	>	assertTrue(s.contains(String.valueOf(i)));
502		}
503		}
504
505		/**
506	<	* A deserialized serialized queue has same elements
506	>	* A deserialized/reserialized queue has same elements
507		*/
508	<	public void testSerialization() {
509	<	PriorityQueue q = populatedQueue(SIZE);
510	<	try {
498	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
499	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
500	<	out.writeObject(q);
501	<	out.close();
508	>	public void testSerialization() throws Exception {
509	>	Queue x = populatedQueue(SIZE);
510	>	Queue y = serialClone(x);
511
512	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
513	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
514	<	PriorityQueue r = (PriorityQueue)in.readObject();
515	<	assertEquals(q.size(), r.size());
516	<	while (!q.isEmpty())
508	<	assertEquals(q.remove(), r.remove());
509	<	} catch (Exception e) {
510	<	unexpectedException();
512	>	assertNotSame(x, y);
513	>	assertEquals(x.size(), y.size());
514	>	while (!x.isEmpty()) {
515	>	assertFalse(y.isEmpty());
516	>	assertEquals(x.remove(), y.remove());
517		}
518	+	assertTrue(y.isEmpty());
519		}
520		}

Diff Legend

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