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.*; |
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(); |
25 |
|
int j = ((Integer)y).intValue(); |
29 |
|
} |
30 |
|
} |
31 |
|
|
33 |
– |
|
32 |
|
/** |
33 |
|
* Create a queue of given size containing consecutive |
34 |
|
* Integers 0 ... n. |
36 |
|
private PriorityQueue populatedQueue(int n) { |
37 |
|
PriorityQueue q = new PriorityQueue(n); |
38 |
|
assertTrue(q.isEmpty()); |
39 |
< |
for(int i = n-1; i >= 0; i-=2) |
40 |
< |
assertTrue(q.offer(new Integer(i))); |
41 |
< |
for(int i = (n & 1); i < n; i+=2) |
42 |
< |
assertTrue(q.offer(new Integer(i))); |
39 |
> |
for (int i = n-1; i >= 0; i-=2) |
40 |
> |
assertTrue(q.offer(new Integer(i))); |
41 |
> |
for (int i = (n & 1); i < n; i+=2) |
42 |
> |
assertTrue(q.offer(new Integer(i))); |
43 |
|
assertFalse(q.isEmpty()); |
44 |
< |
assertEquals(n, q.size()); |
44 |
> |
assertEquals(n, q.size()); |
45 |
|
return q; |
46 |
|
} |
47 |
< |
|
47 |
> |
|
48 |
|
/** |
49 |
< |
* |
49 |
> |
* A new queue has unbounded capacity |
50 |
|
*/ |
51 |
|
public void testConstructor1() { |
52 |
|
assertEquals(0, new PriorityQueue(SIZE).size()); |
53 |
|
} |
54 |
|
|
55 |
|
/** |
56 |
< |
* |
56 |
> |
* Constructor throws IAE if capacity argument nonpositive |
57 |
|
*/ |
58 |
|
public void testConstructor2() { |
59 |
|
try { |
64 |
|
} |
65 |
|
|
66 |
|
/** |
67 |
< |
* |
67 |
> |
* Initializing from null Collection throws NPE |
68 |
|
*/ |
69 |
|
public void testConstructor3() { |
72 |
– |
|
70 |
|
try { |
71 |
|
PriorityQueue q = new PriorityQueue((Collection)null); |
72 |
|
shouldThrow(); |
75 |
|
} |
76 |
|
|
77 |
|
/** |
78 |
< |
* |
78 |
> |
* Initializing from Collection of null elements throws NPE |
79 |
|
*/ |
80 |
|
public void testConstructor4() { |
81 |
|
try { |
87 |
|
} |
88 |
|
|
89 |
|
/** |
90 |
< |
* |
90 |
> |
* Initializing from Collection with some null elements throws NPE |
91 |
|
*/ |
92 |
|
public void testConstructor5() { |
93 |
|
try { |
101 |
|
} |
102 |
|
|
103 |
|
/** |
104 |
< |
* |
104 |
> |
* Queue contains all elements of collection used to initialize |
105 |
|
*/ |
106 |
|
public void testConstructor6() { |
107 |
|
try { |
116 |
|
} |
117 |
|
|
118 |
|
/** |
119 |
< |
* |
119 |
> |
* The comparator used in constructor is used |
120 |
|
*/ |
121 |
|
public void testConstructor7() { |
122 |
|
try { |
134 |
|
} |
135 |
|
|
136 |
|
/** |
137 |
< |
* |
137 |
> |
* isEmpty is true before add, false after |
138 |
|
*/ |
139 |
|
public void testEmpty() { |
140 |
|
PriorityQueue q = new PriorityQueue(2); |
148 |
|
} |
149 |
|
|
150 |
|
/** |
151 |
< |
* |
151 |
> |
* size changes when elements added and removed |
152 |
|
*/ |
153 |
|
public void testSize() { |
154 |
|
PriorityQueue q = populatedQueue(SIZE); |
163 |
|
} |
164 |
|
|
165 |
|
/** |
166 |
< |
* |
166 |
> |
* offer(null) throws NPE |
167 |
|
*/ |
168 |
|
public void testOfferNull() { |
169 |
< |
try { |
169 |
> |
try { |
170 |
|
PriorityQueue q = new PriorityQueue(1); |
171 |
|
q.offer(null); |
172 |
|
shouldThrow(); |
173 |
< |
} catch (NullPointerException success) { } |
173 |
> |
} catch (NullPointerException success) { } |
174 |
> |
} |
175 |
> |
|
176 |
> |
/** |
177 |
> |
* add(null) throws NPE |
178 |
> |
*/ |
179 |
> |
public void testAddNull() { |
180 |
> |
try { |
181 |
> |
PriorityQueue q = new PriorityQueue(1); |
182 |
> |
q.add(null); |
183 |
> |
shouldThrow(); |
184 |
> |
} catch (NullPointerException success) { } |
185 |
|
} |
186 |
|
|
187 |
|
/** |
188 |
< |
* |
188 |
> |
* Offer of comparable element succeeds |
189 |
|
*/ |
190 |
|
public void testOffer() { |
191 |
|
PriorityQueue q = new PriorityQueue(1); |
192 |
< |
assertTrue(q.offer(new Integer(0))); |
193 |
< |
assertTrue(q.offer(new Integer(1))); |
192 |
> |
assertTrue(q.offer(zero)); |
193 |
> |
assertTrue(q.offer(one)); |
194 |
|
} |
195 |
|
|
196 |
|
/** |
197 |
< |
* |
197 |
> |
* Offer of non-Comparable throws CCE |
198 |
|
*/ |
199 |
|
public void testOfferNonComparable() { |
200 |
|
try { |
204 |
|
q.offer(new Object()); |
205 |
|
shouldThrow(); |
206 |
|
} |
207 |
< |
catch(ClassCastException success) {} |
207 |
> |
catch (ClassCastException success) {} |
208 |
|
} |
209 |
|
|
210 |
|
/** |
211 |
< |
* |
211 |
> |
* add of comparable succeeds |
212 |
|
*/ |
213 |
|
public void testAdd() { |
214 |
|
PriorityQueue q = new PriorityQueue(SIZE); |
219 |
|
} |
220 |
|
|
221 |
|
/** |
222 |
< |
* |
222 |
> |
* addAll(null) throws NPE |
223 |
|
*/ |
224 |
|
public void testAddAll1() { |
225 |
|
try { |
230 |
|
catch (NullPointerException success) {} |
231 |
|
} |
232 |
|
/** |
233 |
< |
* |
233 |
> |
* addAll of a collection with null elements throws NPE |
234 |
|
*/ |
235 |
|
public void testAddAll2() { |
236 |
|
try { |
242 |
|
catch (NullPointerException success) {} |
243 |
|
} |
244 |
|
/** |
245 |
< |
* |
245 |
> |
* addAll of a collection with any null elements throws NPE after |
246 |
> |
* possibly adding some elements |
247 |
|
*/ |
248 |
|
public void testAddAll3() { |
249 |
|
try { |
258 |
|
} |
259 |
|
|
260 |
|
/** |
261 |
< |
* |
261 |
> |
* Queue contains all elements of successful addAll |
262 |
|
*/ |
263 |
|
public void testAddAll5() { |
264 |
|
try { |
276 |
|
} |
277 |
|
|
278 |
|
/** |
279 |
< |
* |
279 |
> |
* poll succeeds unless empty |
280 |
|
*/ |
281 |
|
public void testPoll() { |
282 |
|
PriorityQueue q = populatedQueue(SIZE); |
283 |
|
for (int i = 0; i < SIZE; ++i) { |
284 |
|
assertEquals(i, ((Integer)q.poll()).intValue()); |
285 |
|
} |
286 |
< |
assertNull(q.poll()); |
286 |
> |
assertNull(q.poll()); |
287 |
|
} |
288 |
|
|
289 |
|
/** |
290 |
< |
* |
290 |
> |
* peek returns next element, or null if empty |
291 |
|
*/ |
292 |
|
public void testPeek() { |
293 |
|
PriorityQueue q = populatedQueue(SIZE); |
297 |
|
assertTrue(q.peek() == null || |
298 |
|
i != ((Integer)q.peek()).intValue()); |
299 |
|
} |
300 |
< |
assertNull(q.peek()); |
300 |
> |
assertNull(q.peek()); |
301 |
|
} |
302 |
|
|
303 |
|
/** |
304 |
< |
* |
304 |
> |
* element returns next element, or throws NSEE if empty |
305 |
|
*/ |
306 |
|
public void testElement() { |
307 |
|
PriorityQueue q = populatedQueue(SIZE); |
317 |
|
} |
318 |
|
|
319 |
|
/** |
320 |
< |
* |
320 |
> |
* remove removes next element, or throws NSEE if empty |
321 |
|
*/ |
322 |
|
public void testRemove() { |
323 |
|
PriorityQueue q = populatedQueue(SIZE); |
327 |
|
try { |
328 |
|
q.remove(); |
329 |
|
shouldThrow(); |
330 |
< |
} catch (NoSuchElementException success){ |
331 |
< |
} |
330 |
> |
} catch (NoSuchElementException success) { |
331 |
> |
} |
332 |
|
} |
333 |
|
|
334 |
|
/** |
335 |
< |
* |
335 |
> |
* remove(x) removes x and returns true if present |
336 |
|
*/ |
337 |
|
public void testRemoveElement() { |
338 |
|
PriorityQueue q = populatedQueue(SIZE); |
345 |
|
} |
346 |
|
assertTrue(q.isEmpty()); |
347 |
|
} |
348 |
< |
|
348 |
> |
|
349 |
|
/** |
350 |
< |
* |
350 |
> |
* contains(x) reports true when elements added but not yet removed |
351 |
|
*/ |
352 |
|
public void testContains() { |
353 |
|
PriorityQueue q = populatedQueue(SIZE); |
359 |
|
} |
360 |
|
|
361 |
|
/** |
362 |
< |
* |
362 |
> |
* clear removes all elements |
363 |
|
*/ |
364 |
|
public void testClear() { |
365 |
|
PriorityQueue q = populatedQueue(SIZE); |
373 |
|
} |
374 |
|
|
375 |
|
/** |
376 |
< |
* |
376 |
> |
* containsAll(c) is true when c contains a subset of elements |
377 |
|
*/ |
378 |
|
public void testContainsAll() { |
379 |
|
PriorityQueue q = populatedQueue(SIZE); |
387 |
|
} |
388 |
|
|
389 |
|
/** |
390 |
< |
* |
390 |
> |
* retainAll(c) retains only those elements of c and reports true if changed |
391 |
|
*/ |
392 |
|
public void testRetainAll() { |
393 |
|
PriorityQueue q = populatedQueue(SIZE); |
406 |
|
} |
407 |
|
|
408 |
|
/** |
409 |
< |
* |
409 |
> |
* removeAll(c) removes only those elements of c and reports true if changed |
410 |
|
*/ |
411 |
|
public void testRemoveAll() { |
412 |
|
for (int i = 1; i < SIZE; ++i) { |
422 |
|
} |
423 |
|
|
424 |
|
/** |
425 |
< |
* |
425 |
> |
* toArray contains all elements |
426 |
|
*/ |
427 |
|
public void testToArray() { |
428 |
|
PriorityQueue q = populatedQueue(SIZE); |
429 |
< |
Object[] o = q.toArray(); |
429 |
> |
Object[] o = q.toArray(); |
430 |
|
Arrays.sort(o); |
431 |
< |
for(int i = 0; i < o.length; i++) |
432 |
< |
assertEquals(o[i], q.poll()); |
431 |
> |
for (int i = 0; i < o.length; i++) |
432 |
> |
assertEquals(o[i], q.poll()); |
433 |
|
} |
434 |
|
|
435 |
|
/** |
436 |
< |
* |
436 |
> |
* toArray(a) contains all elements |
437 |
|
*/ |
438 |
|
public void testToArray2() { |
439 |
|
PriorityQueue q = populatedQueue(SIZE); |
440 |
< |
Integer[] ints = new Integer[SIZE]; |
441 |
< |
ints = (Integer[])q.toArray(ints); |
440 |
> |
Integer[] ints = new Integer[SIZE]; |
441 |
> |
ints = (Integer[])q.toArray(ints); |
442 |
|
Arrays.sort(ints); |
443 |
< |
for(int i = 0; i < ints.length; i++) |
443 |
> |
for (int i = 0; i < ints.length; i++) |
444 |
|
assertEquals(ints[i], q.poll()); |
445 |
|
} |
446 |
< |
|
446 |
> |
|
447 |
|
/** |
448 |
< |
* |
448 |
> |
* iterator iterates through all elements |
449 |
|
*/ |
450 |
|
public void testIterator() { |
451 |
|
PriorityQueue q = populatedQueue(SIZE); |
452 |
|
int i = 0; |
453 |
< |
Iterator it = q.iterator(); |
454 |
< |
while(it.hasNext()) { |
453 |
> |
Iterator it = q.iterator(); |
454 |
> |
while (it.hasNext()) { |
455 |
|
assertTrue(q.contains(it.next())); |
456 |
|
++i; |
457 |
|
} |
459 |
|
} |
460 |
|
|
461 |
|
/** |
462 |
< |
* |
462 |
> |
* iterator.remove removes current element |
463 |
|
*/ |
464 |
|
public void testIteratorRemove () { |
465 |
|
final PriorityQueue q = new PriorityQueue(3); |
479 |
|
|
480 |
|
|
481 |
|
/** |
482 |
< |
* |
482 |
> |
* toString contains toStrings of elements |
483 |
|
*/ |
484 |
|
public void testToString() { |
485 |
|
PriorityQueue q = populatedQueue(SIZE); |
487 |
|
for (int i = 0; i < SIZE; ++i) { |
488 |
|
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
489 |
|
} |
490 |
< |
} |
490 |
> |
} |
491 |
|
|
492 |
|
/** |
493 |
< |
* |
493 |
> |
* A deserialized serialized queue has same elements |
494 |
|
*/ |
495 |
|
public void testSerialization() { |
496 |
|
PriorityQueue q = populatedQueue(SIZE); |
504 |
|
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
505 |
|
PriorityQueue r = (PriorityQueue)in.readObject(); |
506 |
|
assertEquals(q.size(), r.size()); |
507 |
< |
while (!q.isEmpty()) |
507 |
> |
while (!q.isEmpty()) |
508 |
|
assertEquals(q.remove(), r.remove()); |
509 |
< |
} catch(Exception e){ |
509 |
> |
} catch (Exception e) { |
510 |
|
unexpectedException(); |
511 |
|
} |
512 |
|
} |