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.12 by jsr166, Sat Nov 21 02:07:27 2009 UTC vs.
Revision 1.35 by jsr166, Sat May 23 00:53:08 2015 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	>	import junit.framework.TestSuite;
19
20		public class PriorityQueueTest extends JSR166TestCase {
21		public static void main(String[] args) {
22	<	junit.textui.TestRunner.run (suite());
22	>	main(suite(), args);
23		}
24		public static Test suite() {
25		return new TestSuite(PriorityQueueTest.class);
#	Line 21 | Line 27 | public class PriorityQueueTest extends J
27
28		static class MyReverseComparator implements Comparator {
29		public int compare(Object x, Object y) {
30	<	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;
30	>	return ((Comparable)y).compareTo(x);
31		}
32		}
33
34		/**
35	<	* Create a queue of given size containing consecutive
35	>	* Returns a new queue of given size containing consecutive
36		* Integers 0 ... n.
37		*/
38	<	private PriorityQueue populatedQueue(int n) {
39	<	PriorityQueue q = new PriorityQueue(n);
38	>	private PriorityQueue<Integer> populatedQueue(int n) {
39	>	PriorityQueue<Integer> q = new PriorityQueue<Integer>(n);
40		assertTrue(q.isEmpty());
41	<	for (int i = n-1; i >= 0; i-=2)
41	>	for (int i = n-1; i >= 0; i -= 2)
42		assertTrue(q.offer(new Integer(i)));
43	<	for (int i = (n & 1); i < n; i+=2)
43	>	for (int i = (n & 1); i < n; i += 2)
44		assertTrue(q.offer(new Integer(i)));
45		assertFalse(q.isEmpty());
46		assertEquals(n, q.size());
#	Line 53 | Line 55 | public class PriorityQueueTest extends J
55		}
56
57		/**
58	<	* Constructor throws IAE if  capacity argument nonpositive
58	>	* Constructor throws IAE if capacity argument nonpositive
59		*/
60		public void testConstructor2() {
61		try {
62	<	PriorityQueue q = new PriorityQueue(0);
62	>	new PriorityQueue(0);
63		shouldThrow();
64	<	}
63	<	catch (IllegalArgumentException success) {}
64	>	} catch (IllegalArgumentException success) {}
65		}
66
67		/**
#	Line 68 | Line 69 | public class PriorityQueueTest extends J
69		*/
70		public void testConstructor3() {
71		try {
72	<	PriorityQueue q = new PriorityQueue((Collection)null);
72	>	new PriorityQueue((Collection)null);
73		shouldThrow();
74	<	}
74	<	catch (NullPointerException success) {}
74	>	} catch (NullPointerException success) {}
75		}
76
77		/**
#	Line 79 | Line 79 | public class PriorityQueueTest extends J
79		*/
80		public void testConstructor4() {
81		try {
82	<	Integer[] ints = new Integer[SIZE];
83	<	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
82	>	new PriorityQueue(Arrays.asList(new Integer[SIZE]));
83		shouldThrow();
84	<	}
86	<	catch (NullPointerException success) {}
84	>	} catch (NullPointerException success) {}
85		}
86
87		/**
88		* Initializing from Collection with some null elements throws NPE
89		*/
90		public void testConstructor5() {
91	+	Integer[] ints = new Integer[SIZE];
92	+	for (int i = 0; i < SIZE - 1; ++i)
93	+	ints[i] = new Integer(i);
94		try {
95	<	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));
95	>	new PriorityQueue(Arrays.asList(ints));
96		shouldThrow();
97	<	}
100	<	catch (NullPointerException success) {}
97	>	} catch (NullPointerException success) {}
98		}
99
100		/**
101		* Queue contains all elements of collection used to initialize
102		*/
103		public void testConstructor6() {
104	<	try {
105	<	Integer[] ints = new Integer[SIZE];
106	<	for (int i = 0; i < SIZE; ++i)
107	<	ints[i] = new Integer(i);
108	<	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
109	<	for (int i = 0; i < SIZE; ++i)
113	<	assertEquals(ints[i], q.poll());
114	<	}
115	<	finally {}
104	>	Integer[] ints = new Integer[SIZE];
105	>	for (int i = 0; i < SIZE; ++i)
106	>	ints[i] = new Integer(i);
107	>	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
108	>	for (int i = 0; i < SIZE; ++i)
109	>	assertEquals(ints[i], q.poll());
110		}
111
112		/**
113		* The comparator used in constructor is used
114		*/
115		public void testConstructor7() {
116	<	try {
117	<	MyReverseComparator cmp = new MyReverseComparator();
118	<	PriorityQueue q = new PriorityQueue(SIZE, cmp);
119	<	assertEquals(cmp, q.comparator());
120	<	Integer[] ints = new Integer[SIZE];
121	<	for (int i = 0; i < SIZE; ++i)
122	<	ints[i] = new Integer(i);
123	<	q.addAll(Arrays.asList(ints));
124	<	for (int i = SIZE-1; i >= 0; --i)
131	<	assertEquals(ints[i], q.poll());
132	<	}
133	<	finally {}
116	>	MyReverseComparator cmp = new MyReverseComparator();
117	>	PriorityQueue q = new PriorityQueue(SIZE, cmp);
118	>	assertEquals(cmp, q.comparator());
119	>	Integer[] ints = new Integer[SIZE];
120	>	for (int i = 0; i < SIZE; ++i)
121	>	ints[i] = new Integer(i);
122	>	q.addAll(Arrays.asList(ints));
123	>	for (int i = SIZE - 1; i >= 0; --i)
124	>	assertEquals(ints[i], q.poll());
125		}
126
127		/**
#	Line 153 | Line 144 | public class PriorityQueueTest extends J
144		public void testSize() {
145		PriorityQueue q = populatedQueue(SIZE);
146		for (int i = 0; i < SIZE; ++i) {
147	<	assertEquals(SIZE-i, q.size());
147	>	assertEquals(SIZE - i, q.size());
148		q.remove();
149		}
150		for (int i = 0; i < SIZE; ++i) {
#	Line 166 | Line 157 | public class PriorityQueueTest extends J
157		* offer(null) throws NPE
158		*/
159		public void testOfferNull() {
160	+	PriorityQueue q = new PriorityQueue(1);
161		try {
170	–	PriorityQueue q = new PriorityQueue(1);
162		q.offer(null);
163		shouldThrow();
164	<	} catch (NullPointerException success) { }
164	>	} catch (NullPointerException success) {}
165		}
166
167		/**
168		* add(null) throws NPE
169		*/
170		public void testAddNull() {
171	+	PriorityQueue q = new PriorityQueue(1);
172		try {
181	–	PriorityQueue q = new PriorityQueue(1);
173		q.add(null);
174		shouldThrow();
175	<	} catch (NullPointerException success) { }
175	>	} catch (NullPointerException success) {}
176		}
177
178		/**
#	Line 197 | Line 188 | public class PriorityQueueTest extends J
188		* Offer of non-Comparable throws CCE
189		*/
190		public void testOfferNonComparable() {
191	+	PriorityQueue q = new PriorityQueue(1);
192		try {
201	–	PriorityQueue q = new PriorityQueue(1);
202	–	q.offer(new Object());
193		q.offer(new Object());
194		q.offer(new Object());
195		shouldThrow();
196	<	}
207	<	catch (ClassCastException success) {}
196	>	} catch (ClassCastException success) {}
197		}
198
199		/**
#	Line 222 | Line 211 | public class PriorityQueueTest extends J
211		* addAll(null) throws NPE
212		*/
213		public void testAddAll1() {
214	+	PriorityQueue q = new PriorityQueue(1);
215		try {
226	–	PriorityQueue q = new PriorityQueue(1);
216		q.addAll(null);
217		shouldThrow();
218	<	}
230	<	catch (NullPointerException success) {}
218	>	} catch (NullPointerException success) {}
219		}
220	+
221		/**
222		* addAll of a collection with null elements throws NPE
223		*/
224		public void testAddAll2() {
225	+	PriorityQueue q = new PriorityQueue(SIZE);
226		try {
227	<	PriorityQueue q = new PriorityQueue(SIZE);
238	<	Integer[] ints = new Integer[SIZE];
239	<	q.addAll(Arrays.asList(ints));
227	>	q.addAll(Arrays.asList(new Integer[SIZE]));
228		shouldThrow();
229	<	}
242	<	catch (NullPointerException success) {}
229	>	} catch (NullPointerException success) {}
230		}
231	+
232		/**
233		* addAll of a collection with any null elements throws NPE after
234		* possibly adding some elements
235		*/
236		public void testAddAll3() {
237	+	PriorityQueue q = new PriorityQueue(SIZE);
238	+	Integer[] ints = new Integer[SIZE];
239	+	for (int i = 0; i < SIZE - 1; ++i)
240	+	ints[i] = new Integer(i);
241		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);
242		q.addAll(Arrays.asList(ints));
243		shouldThrow();
244	<	}
257	<	catch (NullPointerException success) {}
244	>	} catch (NullPointerException success) {}
245		}
246
247		/**
248		* Queue contains all elements of successful addAll
249		*/
250		public void testAddAll5() {
251	<	try {
252	<	Integer[] empty = new Integer[0];
253	<	Integer[] ints = new Integer[SIZE];
254	<	for (int i = 0; i < SIZE; ++i)
255	<	ints[i] = new Integer(SIZE-1-i);
256	<	PriorityQueue q = new PriorityQueue(SIZE);
257	<	assertFalse(q.addAll(Arrays.asList(empty)));
258	<	assertTrue(q.addAll(Arrays.asList(ints)));
259	<	for (int i = 0; i < SIZE; ++i)
273	<	assertEquals(new Integer(i), q.poll());
274	<	}
275	<	finally {}
251	>	Integer[] empty = new Integer[0];
252	>	Integer[] ints = new Integer[SIZE];
253	>	for (int i = 0; i < SIZE; ++i)
254	>	ints[i] = new Integer(SIZE - 1 - i);
255	>	PriorityQueue q = new PriorityQueue(SIZE);
256	>	assertFalse(q.addAll(Arrays.asList(empty)));
257	>	assertTrue(q.addAll(Arrays.asList(ints)));
258	>	for (int i = 0; i < SIZE; ++i)
259	>	assertEquals(new Integer(i), q.poll());
260		}
261
262		/**
#	Line 281 | Line 265 | public class PriorityQueueTest extends J
265		public void testPoll() {
266		PriorityQueue q = populatedQueue(SIZE);
267		for (int i = 0; i < SIZE; ++i) {
268	<	assertEquals(i, ((Integer)q.poll()).intValue());
268	>	assertEquals(i, q.poll());
269		}
270		assertNull(q.poll());
271		}
#	Line 292 | Line 276 | public class PriorityQueueTest extends J
276		public void testPeek() {
277		PriorityQueue q = populatedQueue(SIZE);
278		for (int i = 0; i < SIZE; ++i) {
279	<	assertEquals(i, ((Integer)q.peek()).intValue());
280	<	q.poll();
279	>	assertEquals(i, q.peek());
280	>	assertEquals(i, q.poll());
281		assertTrue(q.peek() == null ||
282	<	i != ((Integer)q.peek()).intValue());
282	>	!q.peek().equals(i));
283		}
284		assertNull(q.peek());
285		}
#	Line 306 | Line 290 | public class PriorityQueueTest extends J
290		public void testElement() {
291		PriorityQueue q = populatedQueue(SIZE);
292		for (int i = 0; i < SIZE; ++i) {
293	<	assertEquals(i, ((Integer)q.element()).intValue());
294	<	q.poll();
293	>	assertEquals(i, q.element());
294	>	assertEquals(i, q.poll());
295		}
296		try {
297		q.element();
298		shouldThrow();
299	<	}
316	<	catch (NoSuchElementException success) {}
299	>	} catch (NoSuchElementException success) {}
300		}
301
302		/**
#	Line 322 | Line 305 | public class PriorityQueueTest extends J
305		public void testRemove() {
306		PriorityQueue q = populatedQueue(SIZE);
307		for (int i = 0; i < SIZE; ++i) {
308	<	assertEquals(i, ((Integer)q.remove()).intValue());
308	>	assertEquals(i, q.remove());
309		}
310		try {
311		q.remove();
312		shouldThrow();
313	<	} catch (NoSuchElementException success) {
331	<	}
313	>	} catch (NoSuchElementException success) {}
314		}
315
316		/**
#	Line 336 | Line 318 | public class PriorityQueueTest extends J
318		*/
319		public void testRemoveElement() {
320		PriorityQueue q = populatedQueue(SIZE);
321	<	for (int i = 1; i < SIZE; i+=2) {
322	<	assertTrue(q.remove(new Integer(i)));
323	<	}
324	<	for (int i = 0; i < SIZE; i+=2) {
325	<	assertTrue(q.remove(new Integer(i)));
326	<	assertFalse(q.remove(new Integer(i+1)));
321	>	for (int i = 1; i < SIZE; i += 2) {
322	>	assertTrue(q.contains(i));
323	>	assertTrue(q.remove(i));
324	>	assertFalse(q.contains(i));
325	>	assertTrue(q.contains(i-1));
326	>	}
327	>	for (int i = 0; i < SIZE; i += 2) {
328	>	assertTrue(q.contains(i));
329	>	assertTrue(q.remove(i));
330	>	assertFalse(q.contains(i));
331	>	assertFalse(q.remove(i+1));
332	>	assertFalse(q.contains(i+1));
333		}
334		assertTrue(q.isEmpty());
335		}
#	Line 400 | Line 388 | public class PriorityQueueTest extends J
388		assertTrue(changed);
389
390		assertTrue(q.containsAll(p));
391	<	assertEquals(SIZE-i, q.size());
391	>	assertEquals(SIZE - i, q.size());
392		p.remove();
393		}
394		}
#	Line 413 | Line 401 | public class PriorityQueueTest extends J
401		PriorityQueue q = populatedQueue(SIZE);
402		PriorityQueue p = populatedQueue(i);
403		assertTrue(q.removeAll(p));
404	<	assertEquals(SIZE-i, q.size());
404	>	assertEquals(SIZE - i, q.size());
405		for (int j = 0; j < i; ++j) {
406	<	Integer I = (Integer)(p.remove());
407	<	assertFalse(q.contains(I));
406	>	Integer x = (Integer)(p.remove());
407	>	assertFalse(q.contains(x));
408		}
409		}
410		}
#	Line 429 | Line 417 | public class PriorityQueueTest extends J
417		Object[] o = q.toArray();
418		Arrays.sort(o);
419		for (int i = 0; i < o.length; i++)
420	<	assertEquals(o[i], q.poll());
420	>	assertSame(o[i], q.poll());
421		}
422
423		/**
424		* toArray(a) contains all elements
425		*/
426		public void testToArray2() {
427	<	PriorityQueue q = populatedQueue(SIZE);
427	>	PriorityQueue<Integer> q = populatedQueue(SIZE);
428		Integer[] ints = new Integer[SIZE];
429	<	ints = (Integer[])q.toArray(ints);
429	>	Integer[] array = q.toArray(ints);
430	>	assertSame(ints, array);
431		Arrays.sort(ints);
432		for (int i = 0; i < ints.length; i++)
433	<	assertEquals(ints[i], q.poll());
433	>	assertSame(ints[i], q.poll());
434		}
435
436		/**
#	Line 449 | Line 438 | public class PriorityQueueTest extends J
438		*/
439		public void testIterator() {
440		PriorityQueue q = populatedQueue(SIZE);
452	–	int i = 0;
441		Iterator it = q.iterator();
442	<	while (it.hasNext()) {
442	>	int i;
443	>	for (i = 0; it.hasNext(); i++)
444		assertTrue(q.contains(it.next()));
456	–	++i;
457	–	}
445		assertEquals(i, SIZE);
446	+	assertIteratorExhausted(it);
447	+	}
448	+
449	+	/**
450	+	* iterator of empty collection has no elements
451	+	*/
452	+	public void testEmptyIterator() {
453	+	assertIteratorExhausted(new PriorityQueue().iterator());
454		}
455
456		/**
457		* iterator.remove removes current element
458		*/
459	<	public void testIteratorRemove () {
459	>	public void testIteratorRemove() {
460		final PriorityQueue q = new PriorityQueue(3);
461		q.add(new Integer(2));
462		q.add(new Integer(1));
#	Line 477 | Line 472 | public class PriorityQueueTest extends J
472		assertFalse(it.hasNext());
473		}
474
480	–
475		/**
476		* toString contains toStrings of elements
477		*/
#	Line 485 | Line 479 | public class PriorityQueueTest extends J
479		PriorityQueue q = populatedQueue(SIZE);
480		String s = q.toString();
481		for (int i = 0; i < SIZE; ++i) {
482	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
482	>	assertTrue(s.contains(String.valueOf(i)));
483		}
484		}
485
486		/**
487		* A deserialized serialized queue has same elements
488		*/
489	<	public void testSerialization() {
490	<	PriorityQueue q = populatedQueue(SIZE);
491	<	try {
492	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
493	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
494	<	out.writeObject(q);
495	<	out.close();
496	<
497	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
504	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
505	<	PriorityQueue r = (PriorityQueue)in.readObject();
506	<	assertEquals(q.size(), r.size());
507	<	while (!q.isEmpty())
508	<	assertEquals(q.remove(), r.remove());
509	<	} catch (Exception e) {
510	<	unexpectedException();
489	>	public void testSerialization() throws Exception {
490	>	Queue x = populatedQueue(SIZE);
491	>	Queue y = serialClone(x);
492	>
493	>	assertNotSame(x, y);
494	>	assertEquals(x.size(), y.size());
495	>	while (!x.isEmpty()) {
496	>	assertFalse(y.isEmpty());
497	>	assertEquals(x.remove(), y.remove());
498		}
499	+	assertTrue(y.isEmpty());
500		}
501		}

Diff Legend

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