13 |
|
|
14 |
|
public class PriorityQueueTest extends JSR166TestCase { |
15 |
|
public static void main(String[] args) { |
16 |
< |
junit.textui.TestRunner.run (suite()); |
16 |
> |
junit.textui.TestRunner.run(suite()); |
17 |
|
} |
18 |
|
public static Test suite() { |
19 |
|
return new TestSuite(PriorityQueueTest.class); |
21 |
|
|
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(); |
26 |
< |
if (i < j) return 1; |
27 |
< |
if (i > j) return -1; |
28 |
< |
return 0; |
24 |
> |
return ((Comparable)y).compareTo(x); |
25 |
|
} |
26 |
|
} |
27 |
|
|
29 |
|
* Create a queue of given size containing consecutive |
30 |
|
* Integers 0 ... n. |
31 |
|
*/ |
32 |
< |
private PriorityQueue populatedQueue(int n) { |
33 |
< |
PriorityQueue q = new PriorityQueue(n); |
32 |
> |
private PriorityQueue<Integer> populatedQueue(int n) { |
33 |
> |
PriorityQueue<Integer> q = new PriorityQueue<Integer>(n); |
34 |
|
assertTrue(q.isEmpty()); |
35 |
|
for (int i = n-1; i >= 0; i-=2) |
36 |
|
assertTrue(q.offer(new Integer(i))); |
213 |
|
shouldThrow(); |
214 |
|
} catch (NullPointerException success) {} |
215 |
|
} |
216 |
+ |
|
217 |
|
/** |
218 |
|
* addAll of a collection with null elements throws NPE |
219 |
|
*/ |
225 |
|
shouldThrow(); |
226 |
|
} catch (NullPointerException success) {} |
227 |
|
} |
228 |
+ |
|
229 |
|
/** |
230 |
|
* addAll of a collection with any null elements throws NPE after |
231 |
|
* possibly adding some elements |
262 |
|
public void testPoll() { |
263 |
|
PriorityQueue q = populatedQueue(SIZE); |
264 |
|
for (int i = 0; i < SIZE; ++i) { |
265 |
< |
assertEquals(i, ((Integer)q.poll()).intValue()); |
265 |
> |
assertEquals(i, q.poll()); |
266 |
|
} |
267 |
|
assertNull(q.poll()); |
268 |
|
} |
273 |
|
public void testPeek() { |
274 |
|
PriorityQueue q = populatedQueue(SIZE); |
275 |
|
for (int i = 0; i < SIZE; ++i) { |
276 |
< |
assertEquals(i, ((Integer)q.peek()).intValue()); |
277 |
< |
q.poll(); |
276 |
> |
assertEquals(i, q.peek()); |
277 |
> |
assertEquals(i, q.poll()); |
278 |
|
assertTrue(q.peek() == null || |
279 |
< |
i != ((Integer)q.peek()).intValue()); |
279 |
> |
!q.peek().equals(i)); |
280 |
|
} |
281 |
|
assertNull(q.peek()); |
282 |
|
} |
287 |
|
public void testElement() { |
288 |
|
PriorityQueue q = populatedQueue(SIZE); |
289 |
|
for (int i = 0; i < SIZE; ++i) { |
290 |
< |
assertEquals(i, ((Integer)q.element()).intValue()); |
291 |
< |
q.poll(); |
290 |
> |
assertEquals(i, q.element()); |
291 |
> |
assertEquals(i, q.poll()); |
292 |
|
} |
293 |
|
try { |
294 |
|
q.element(); |
302 |
|
public void testRemove() { |
303 |
|
PriorityQueue q = populatedQueue(SIZE); |
304 |
|
for (int i = 0; i < SIZE; ++i) { |
305 |
< |
assertEquals(i, ((Integer)q.remove()).intValue()); |
305 |
> |
assertEquals(i, q.remove()); |
306 |
|
} |
307 |
|
try { |
308 |
|
q.remove(); |
316 |
|
public void testRemoveElement() { |
317 |
|
PriorityQueue q = populatedQueue(SIZE); |
318 |
|
for (int i = 1; i < SIZE; i+=2) { |
319 |
< |
assertTrue(q.remove(new Integer(i))); |
319 |
> |
assertTrue(q.contains(i)); |
320 |
> |
assertTrue(q.remove(i)); |
321 |
> |
assertFalse(q.contains(i)); |
322 |
> |
assertTrue(q.contains(i-1)); |
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))); |
325 |
> |
assertTrue(q.contains(i)); |
326 |
> |
assertTrue(q.remove(i)); |
327 |
> |
assertFalse(q.contains(i)); |
328 |
> |
assertFalse(q.remove(i+1)); |
329 |
> |
assertFalse(q.contains(i+1)); |
330 |
|
} |
331 |
|
assertTrue(q.isEmpty()); |
332 |
|
} |
414 |
|
Object[] o = q.toArray(); |
415 |
|
Arrays.sort(o); |
416 |
|
for (int i = 0; i < o.length; i++) |
417 |
< |
assertEquals(o[i], q.poll()); |
417 |
> |
assertSame(o[i], q.poll()); |
418 |
|
} |
419 |
|
|
420 |
|
/** |
421 |
|
* toArray(a) contains all elements |
422 |
|
*/ |
423 |
|
public void testToArray2() { |
424 |
< |
PriorityQueue q = populatedQueue(SIZE); |
424 |
> |
PriorityQueue<Integer> q = populatedQueue(SIZE); |
425 |
|
Integer[] ints = new Integer[SIZE]; |
426 |
< |
ints = (Integer[])q.toArray(ints); |
426 |
> |
Integer[] array = q.toArray(ints); |
427 |
> |
assertSame(ints, array); |
428 |
|
Arrays.sort(ints); |
429 |
|
for (int i = 0; i < ints.length; i++) |
430 |
< |
assertEquals(ints[i], q.poll()); |
430 |
> |
assertSame(ints[i], q.poll()); |
431 |
|
} |
432 |
|
|
433 |
|
/** |
447 |
|
/** |
448 |
|
* iterator.remove removes current element |
449 |
|
*/ |
450 |
< |
public void testIteratorRemove () { |
450 |
> |
public void testIteratorRemove() { |
451 |
|
final PriorityQueue q = new PriorityQueue(3); |
452 |
|
q.add(new Integer(2)); |
453 |
|
q.add(new Integer(1)); |