| 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) { |
| 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()); |
| 321 |
|
*/ |
| 322 |
|
public void testRemoveElement() { |
| 323 |
|
PriorityQueue q = populatedQueue(SIZE); |
| 324 |
< |
for (int i = 1; i < SIZE; i+=2) { |
| 325 |
< |
assertTrue(q.remove(new Integer(i))); |
| 326 |
< |
} |
| 327 |
< |
for (int i = 0; i < SIZE; i+=2) { |
| 328 |
< |
assertTrue(q.remove(new Integer(i))); |
| 329 |
< |
assertFalse(q.remove(new Integer(i+1))); |
| 324 |
> |
for (int i = 1; i < SIZE; i += 2) { |
| 325 |
> |
assertTrue(q.contains(i)); |
| 326 |
> |
assertTrue(q.remove(i)); |
| 327 |
> |
assertFalse(q.contains(i)); |
| 328 |
> |
assertTrue(q.contains(i-1)); |
| 329 |
> |
} |
| 330 |
> |
for (int i = 0; i < SIZE; i += 2) { |
| 331 |
> |
assertTrue(q.contains(i)); |
| 332 |
> |
assertTrue(q.remove(i)); |
| 333 |
> |
assertFalse(q.contains(i)); |
| 334 |
> |
assertFalse(q.remove(i+1)); |
| 335 |
> |
assertFalse(q.contains(i+1)); |
| 336 |
|
} |
| 337 |
|
assertTrue(q.isEmpty()); |
| 338 |
|
} |
| 406 |
|
assertTrue(q.removeAll(p)); |
| 407 |
|
assertEquals(SIZE-i, q.size()); |
| 408 |
|
for (int j = 0; j < i; ++j) { |
| 409 |
< |
Integer I = (Integer)(p.remove()); |
| 410 |
< |
assertFalse(q.contains(I)); |
| 409 |
> |
Integer x = (Integer)(p.remove()); |
| 410 |
> |
assertFalse(q.contains(x)); |
| 411 |
|
} |
| 412 |
|
} |
| 413 |
|
} |
| 427 |
|
* toArray(a) contains all elements |
| 428 |
|
*/ |
| 429 |
|
public void testToArray2() { |
| 430 |
< |
PriorityQueue q = populatedQueue(SIZE); |
| 430 |
> |
PriorityQueue<Integer> q = populatedQueue(SIZE); |
| 431 |
|
Integer[] ints = new Integer[SIZE]; |
| 432 |
< |
assertSame(ints, q.toArray(ints)); |
| 432 |
> |
Integer[] array = q.toArray(ints); |
| 433 |
> |
assertSame(ints, array); |
| 434 |
|
Arrays.sort(ints); |
| 435 |
|
for (int i = 0; i < ints.length; i++) |
| 436 |
|
assertSame(ints[i], q.poll()); |
| 469 |
|
assertFalse(it.hasNext()); |
| 470 |
|
} |
| 471 |
|
|
| 459 |
– |
|
| 472 |
|
/** |
| 473 |
|
* toString contains toStrings of elements |
| 474 |
|
*/ |
| 476 |
|
PriorityQueue q = populatedQueue(SIZE); |
| 477 |
|
String s = q.toString(); |
| 478 |
|
for (int i = 0; i < SIZE; ++i) { |
| 479 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
| 479 |
> |
assertTrue(s.contains(String.valueOf(i))); |
| 480 |
|
} |
| 481 |
|
} |
| 482 |
|
|
| 484 |
|
* A deserialized serialized queue has same elements |
| 485 |
|
*/ |
| 486 |
|
public void testSerialization() throws Exception { |
| 487 |
< |
PriorityQueue q = populatedQueue(SIZE); |
| 488 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
| 489 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
| 490 |
< |
out.writeObject(q); |
| 491 |
< |
out.close(); |
| 492 |
< |
|
| 493 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
| 494 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
| 495 |
< |
PriorityQueue r = (PriorityQueue)in.readObject(); |
| 496 |
< |
assertEquals(q.size(), r.size()); |
| 485 |
< |
while (!q.isEmpty()) |
| 486 |
< |
assertEquals(q.remove(), r.remove()); |
| 487 |
> |
Queue x = populatedQueue(SIZE); |
| 488 |
> |
Queue y = serialClone(x); |
| 489 |
> |
|
| 490 |
> |
assertNotSame(x, y); |
| 491 |
> |
assertEquals(x.size(), y.size()); |
| 492 |
> |
while (!x.isEmpty()) { |
| 493 |
> |
assertFalse(y.isEmpty()); |
| 494 |
> |
assertEquals(x.remove(), y.remove()); |
| 495 |
> |
} |
| 496 |
> |
assertTrue(y.isEmpty()); |
| 497 |
|
} |
| 498 |
|
} |
