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.5 by dl, Sat Sep 20 18:20:08 2003 UTC vs.
Revision 1.16 by jsr166, Wed Aug 25 00:07:03 2010 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/licenses/publicdomain
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9		import junit.framework.*;
#	Line 11 | Line 12 | import java.util.concurrent.*;
12		import java.io.*;
13
14		public class PriorityQueueTest extends JSR166TestCase {
14	–
15		public static void main(String[] args) {
16	<	junit.textui.TestRunner.run (suite());
16	>	junit.textui.TestRunner.run(suite());
17		}
18	–
18		public static Test suite() {
19	<	return new TestSuite(PriorityQueueTest.class);
19	>	return new TestSuite(PriorityQueueTest.class);
20		}
21
22	<	static class MyReverseComparator implements Comparator {
22	>	static class MyReverseComparator implements Comparator {
23		public int compare(Object x, Object y) {
24	<	int i = ((Integer)x).intValue();
26	<	int j = ((Integer)y).intValue();
27	<	if (i < j) return 1;
28	<	if (i > j) return -1;
29	<	return 0;
24	>	return ((Comparable)y).compareTo(x);
25		}
26		}
27
33	–
28		/**
29		* Create a queue of given size containing consecutive
30		* Integers 0 ... n.
#	Line 38 | Line 32 | public class PriorityQueueTest extends J
32		private PriorityQueue populatedQueue(int n) {
33		PriorityQueue q = new PriorityQueue(n);
34		assertTrue(q.isEmpty());
35	<	for(int i = n-1; i >= 0; i-=2)
36	<	assertTrue(q.offer(new Integer(i)));
37	<	for(int i = (n & 1); i < n; i+=2)
38	<	assertTrue(q.offer(new Integer(i)));
35	>	for (int i = n-1; i >= 0; i-=2)
36	>	assertTrue(q.offer(new Integer(i)));
37	>	for (int i = (n & 1); i < n; i+=2)
38	>	assertTrue(q.offer(new Integer(i)));
39		assertFalse(q.isEmpty());
40	<	assertEquals(n, q.size());
40	>	assertEquals(n, q.size());
41		return q;
42		}
43	<
43	>
44		/**
45	<	*
45	>	* A new queue has unbounded capacity
46		*/
47		public void testConstructor1() {
48		assertEquals(0, new PriorityQueue(SIZE).size());
49		}
50
51		/**
52	<	*
52	>	* Constructor throws IAE if capacity argument nonpositive
53		*/
54		public void testConstructor2() {
55		try {
56		PriorityQueue q = new PriorityQueue(0);
57		shouldThrow();
58	<	}
65	<	catch (IllegalArgumentException success) {}
58	>	} catch (IllegalArgumentException success) {}
59		}
60
61		/**
62	<	*
62	>	* Initializing from null Collection throws NPE
63		*/
64		public void testConstructor3() {
72	–
65		try {
66		PriorityQueue q = new PriorityQueue((Collection)null);
67		shouldThrow();
68	<	}
77	<	catch (NullPointerException success) {}
68	>	} catch (NullPointerException success) {}
69		}
70
71		/**
72	<	*
72	>	* Initializing from Collection of null elements throws NPE
73		*/
74		public void testConstructor4() {
75		try {
76		Integer[] ints = new Integer[SIZE];
77		PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
78		shouldThrow();
79	<	}
89	<	catch (NullPointerException success) {}
79	>	} catch (NullPointerException success) {}
80		}
81
82		/**
83	<	*
83	>	* Initializing from Collection with some null elements throws NPE
84		*/
85		public void testConstructor5() {
86		try {
#	Line 99 | Line 89 | public class PriorityQueueTest extends J
89		ints[i] = new Integer(i);
90		PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
91		shouldThrow();
92	<	}
103	<	catch (NullPointerException success) {}
92	>	} catch (NullPointerException success) {}
93		}
94
95		/**
96	<	*
96	>	* Queue contains all elements of collection used to initialize
97		*/
98		public void testConstructor6() {
99	<	try {
100	<	Integer[] ints = new Integer[SIZE];
101	<	for (int i = 0; i < SIZE; ++i)
102	<	ints[i] = new Integer(i);
103	<	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
104	<	for (int i = 0; i < SIZE; ++i)
116	<	assertEquals(ints[i], q.poll());
117	<	}
118	<	finally {}
99	>	Integer[] ints = new Integer[SIZE];
100	>	for (int i = 0; i < SIZE; ++i)
101	>	ints[i] = new Integer(i);
102	>	PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
103	>	for (int i = 0; i < SIZE; ++i)
104	>	assertEquals(ints[i], q.poll());
105		}
106
107		/**
108	<	*
108	>	* The comparator used in constructor is used
109		*/
110		public void testConstructor7() {
111	<	try {
112	<	MyReverseComparator cmp = new MyReverseComparator();
113	<	PriorityQueue q = new PriorityQueue(SIZE, cmp);
114	<	assertEquals(cmp, q.comparator());
115	<	Integer[] ints = new Integer[SIZE];
116	<	for (int i = 0; i < SIZE; ++i)
117	<	ints[i] = new Integer(i);
118	<	q.addAll(Arrays.asList(ints));
119	<	for (int i = SIZE-1; i >= 0; --i)
134	<	assertEquals(ints[i], q.poll());
135	<	}
136	<	finally {}
111	>	MyReverseComparator cmp = new MyReverseComparator();
112	>	PriorityQueue q = new PriorityQueue(SIZE, cmp);
113	>	assertEquals(cmp, q.comparator());
114	>	Integer[] ints = new Integer[SIZE];
115	>	for (int i = 0; i < SIZE; ++i)
116	>	ints[i] = new Integer(i);
117	>	q.addAll(Arrays.asList(ints));
118	>	for (int i = SIZE-1; i >= 0; --i)
119	>	assertEquals(ints[i], q.poll());
120		}
121
122		/**
123	<	*
123	>	* isEmpty is true before add, false after
124		*/
125		public void testEmpty() {
126		PriorityQueue q = new PriorityQueue(2);
#	Line 151 | Line 134 | public class PriorityQueueTest extends J
134		}
135
136		/**
137	<	*
137	>	* size changes when elements added and removed
138		*/
139		public void testSize() {
140		PriorityQueue q = populatedQueue(SIZE);
#	Line 166 | Line 149 | public class PriorityQueueTest extends J
149		}
150
151		/**
152	<	*
152	>	* offer(null) throws NPE
153		*/
154		public void testOfferNull() {
155	<	try {
155	>	try {
156		PriorityQueue q = new PriorityQueue(1);
157		q.offer(null);
158		shouldThrow();
159	<	} catch (NullPointerException success) { }
159	>	} catch (NullPointerException success) {}
160	>	}
161	>
162	>	/**
163	>	* add(null) throws NPE
164	>	*/
165	>	public void testAddNull() {
166	>	try {
167	>	PriorityQueue q = new PriorityQueue(1);
168	>	q.add(null);
169	>	shouldThrow();
170	>	} catch (NullPointerException success) {}
171		}
172
173		/**
174	<	*
174	>	* Offer of comparable element succeeds
175		*/
176		public void testOffer() {
177		PriorityQueue q = new PriorityQueue(1);
178	<	assertTrue(q.offer(new Integer(0)));
179	<	assertTrue(q.offer(new Integer(1)));
178	>	assertTrue(q.offer(zero));
179	>	assertTrue(q.offer(one));
180		}
181
182		/**
183	<	*
183	>	* Offer of non-Comparable throws CCE
184		*/
185		public void testOfferNonComparable() {
186		try {
#	Line 195 | Line 189 | public class PriorityQueueTest extends J
189		q.offer(new Object());
190		q.offer(new Object());
191		shouldThrow();
192	<	}
199	<	catch(ClassCastException success) {}
192	>	} catch (ClassCastException success) {}
193		}
194
195		/**
196	<	*
196	>	* add of comparable succeeds
197		*/
198		public void testAdd() {
199		PriorityQueue q = new PriorityQueue(SIZE);
#	Line 211 | Line 204 | public class PriorityQueueTest extends J
204		}
205
206		/**
207	<	*
207	>	* addAll(null) throws NPE
208		*/
209		public void testAddAll1() {
210		try {
211		PriorityQueue q = new PriorityQueue(1);
212		q.addAll(null);
213		shouldThrow();
214	<	}
222	<	catch (NullPointerException success) {}
214	>	} catch (NullPointerException success) {}
215		}
216		/**
217	<	*
217	>	* addAll of a collection with null elements throws NPE
218		*/
219		public void testAddAll2() {
220		try {
#	Line 230 | Line 222 | public class PriorityQueueTest extends J
222		Integer[] ints = new Integer[SIZE];
223		q.addAll(Arrays.asList(ints));
224		shouldThrow();
225	<	}
234	<	catch (NullPointerException success) {}
225	>	} catch (NullPointerException success) {}
226		}
227		/**
228	<	*
228	>	* addAll of a collection with any null elements throws NPE after
229	>	* possibly adding some elements
230		*/
231		public void testAddAll3() {
232		try {
#	Line 244 | Line 236 | public class PriorityQueueTest extends J
236		ints[i] = new Integer(i);
237		q.addAll(Arrays.asList(ints));
238		shouldThrow();
239	<	}
248	<	catch (NullPointerException success) {}
239	>	} catch (NullPointerException success) {}
240		}
241
242		/**
243	<	*
243	>	* Queue contains all elements of successful addAll
244		*/
245		public void testAddAll5() {
246	<	try {
247	<	Integer[] empty = new Integer[0];
248	<	Integer[] ints = new Integer[SIZE];
249	<	for (int i = 0; i < SIZE; ++i)
250	<	ints[i] = new Integer(SIZE-1-i);
251	<	PriorityQueue q = new PriorityQueue(SIZE);
252	<	assertFalse(q.addAll(Arrays.asList(empty)));
253	<	assertTrue(q.addAll(Arrays.asList(ints)));
254	<	for (int i = 0; i < SIZE; ++i)
264	<	assertEquals(new Integer(i), q.poll());
265	<	}
266	<	finally {}
246	>	Integer[] empty = new Integer[0];
247	>	Integer[] ints = new Integer[SIZE];
248	>	for (int i = 0; i < SIZE; ++i)
249	>	ints[i] = new Integer(SIZE-1-i);
250	>	PriorityQueue q = new PriorityQueue(SIZE);
251	>	assertFalse(q.addAll(Arrays.asList(empty)));
252	>	assertTrue(q.addAll(Arrays.asList(ints)));
253	>	for (int i = 0; i < SIZE; ++i)
254	>	assertEquals(new Integer(i), q.poll());
255		}
256
257		/**
258	<	*
258	>	* poll succeeds unless empty
259		*/
260		public void testPoll() {
261		PriorityQueue q = populatedQueue(SIZE);
262		for (int i = 0; i < SIZE; ++i) {
263	<	assertEquals(i, ((Integer)q.poll()).intValue());
263	>	assertEquals(i, q.poll());
264		}
265	<	assertNull(q.poll());
265	>	assertNull(q.poll());
266		}
267
268		/**
269	<	*
269	>	* peek returns next element, or null if empty
270		*/
271		public void testPeek() {
272		PriorityQueue q = populatedQueue(SIZE);
273		for (int i = 0; i < SIZE; ++i) {
274	<	assertEquals(i, ((Integer)q.peek()).intValue());
275	<	q.poll();
274	>	assertEquals(i, q.peek());
275	>	assertEquals(i, q.poll());
276		assertTrue(q.peek() == null ||
277	<	i != ((Integer)q.peek()).intValue());
277	>	!q.peek().equals(i));
278		}
279	<	assertNull(q.peek());
279	>	assertNull(q.peek());
280		}
281
282		/**
283	<	*
283	>	* element returns next element, or throws NSEE if empty
284		*/
285		public void testElement() {
286		PriorityQueue q = populatedQueue(SIZE);
287		for (int i = 0; i < SIZE; ++i) {
288	<	assertEquals(i, ((Integer)q.element()).intValue());
289	<	q.poll();
288	>	assertEquals(i, q.element());
289	>	assertEquals(i, q.poll());
290		}
291		try {
292		q.element();
293		shouldThrow();
294	<	}
307	<	catch (NoSuchElementException success) {}
294	>	} catch (NoSuchElementException success) {}
295		}
296
297		/**
298	<	*
298	>	* remove removes next element, or throws NSEE if empty
299		*/
300		public void testRemove() {
301		PriorityQueue q = populatedQueue(SIZE);
302		for (int i = 0; i < SIZE; ++i) {
303	<	assertEquals(i, ((Integer)q.remove()).intValue());
303	>	assertEquals(i, q.remove());
304		}
305		try {
306		q.remove();
307		shouldThrow();
308	<	} catch (NoSuchElementException success){
322	<	}
308	>	} catch (NoSuchElementException success) {}
309		}
310
311		/**
312	<	*
312	>	* remove(x) removes x and returns true if present
313		*/
314		public void testRemoveElement() {
315		PriorityQueue q = populatedQueue(SIZE);
#	Line 336 | Line 322 | public class PriorityQueueTest extends J
322		}
323		assertTrue(q.isEmpty());
324		}
325	<
325	>
326		/**
327	<	*
327	>	* contains(x) reports true when elements added but not yet removed
328		*/
329		public void testContains() {
330		PriorityQueue q = populatedQueue(SIZE);
#	Line 350 | Line 336 | public class PriorityQueueTest extends J
336		}
337
338		/**
339	<	*
339	>	* clear removes all elements
340		*/
341		public void testClear() {
342		PriorityQueue q = populatedQueue(SIZE);
#	Line 364 | Line 350 | public class PriorityQueueTest extends J
350		}
351
352		/**
353	<	*
353	>	* containsAll(c) is true when c contains a subset of elements
354		*/
355		public void testContainsAll() {
356		PriorityQueue q = populatedQueue(SIZE);
#	Line 378 | Line 364 | public class PriorityQueueTest extends J
364		}
365
366		/**
367	<	*
367	>	* retainAll(c) retains only those elements of c and reports true if changed
368		*/
369		public void testRetainAll() {
370		PriorityQueue q = populatedQueue(SIZE);
#	Line 397 | Line 383 | public class PriorityQueueTest extends J
383		}
384
385		/**
386	<	*
386	>	* removeAll(c) removes only those elements of c and reports true if changed
387		*/
388		public void testRemoveAll() {
389		for (int i = 1; i < SIZE; ++i) {
#	Line 413 | Line 399 | public class PriorityQueueTest extends J
399		}
400
401		/**
402	<	*
402	>	* toArray contains all elements
403		*/
404		public void testToArray() {
405		PriorityQueue q = populatedQueue(SIZE);
406	<	Object[] o = q.toArray();
406	>	Object[] o = q.toArray();
407		Arrays.sort(o);
408	<	for(int i = 0; i < o.length; i++)
409	<	assertEquals(o[i], q.poll());
408	>	for (int i = 0; i < o.length; i++)
409	>	assertEquals(o[i], q.poll());
410		}
411
412		/**
413	<	*
413	>	* toArray(a) contains all elements
414		*/
415		public void testToArray2() {
416		PriorityQueue q = populatedQueue(SIZE);
417	<	Integer[] ints = new Integer[SIZE];
418	<	ints = (Integer[])q.toArray(ints);
417	>	Integer[] ints = new Integer[SIZE];
418	>	ints = (Integer[])q.toArray(ints);
419		Arrays.sort(ints);
420	<	for(int i = 0; i < ints.length; i++)
420	>	for (int i = 0; i < ints.length; i++)
421		assertEquals(ints[i], q.poll());
422		}
423	<
423	>
424		/**
425	<	*
425	>	* iterator iterates through all elements
426		*/
427		public void testIterator() {
428		PriorityQueue q = populatedQueue(SIZE);
429		int i = 0;
430	<	Iterator it = q.iterator();
431	<	while(it.hasNext()) {
430	>	Iterator it = q.iterator();
431	>	while (it.hasNext()) {
432		assertTrue(q.contains(it.next()));
433		++i;
434		}
#	Line 450 | Line 436 | public class PriorityQueueTest extends J
436		}
437
438		/**
439	<	*
439	>	* iterator.remove removes current element
440		*/
441	<	public void testIteratorRemove () {
441	>	public void testIteratorRemove() {
442		final PriorityQueue q = new PriorityQueue(3);
443		q.add(new Integer(2));
444		q.add(new Integer(1));
#	Line 470 | Line 456 | public class PriorityQueueTest extends J
456
457
458		/**
459	<	*
459	>	* toString contains toStrings of elements
460		*/
461		public void testToString() {
462		PriorityQueue q = populatedQueue(SIZE);
#	Line 478 | Line 464 | public class PriorityQueueTest extends J
464		for (int i = 0; i < SIZE; ++i) {
465		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
466		}
467	<	}
467	>	}
468
469		/**
470	<	*
470	>	* A deserialized serialized queue has same elements
471		*/
472	<	public void testSerialization() {
472	>	public void testSerialization() throws Exception {
473		PriorityQueue q = populatedQueue(SIZE);
474	<	try {
475	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
476	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
477	<	out.writeObject(q);
478	<	out.close();
479	<
480	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
481	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
482	<	PriorityQueue r = (PriorityQueue)in.readObject();
483	<	assertEquals(q.size(), r.size());
484	<	while (!q.isEmpty())
499	<	assertEquals(q.remove(), r.remove());
500	<	} catch(Exception e){
501	<	unexpectedException();
502	<	}
474	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
475	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
476	>	out.writeObject(q);
477	>	out.close();
478	>
479	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
480	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
481	>	PriorityQueue r = (PriorityQueue)in.readObject();
482	>	assertEquals(q.size(), r.size());
483	>	while (!q.isEmpty())
484	>	assertEquals(q.remove(), r.remove());
485		}
486		}

Diff Legend

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