6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
– |
import junit.framework.*; |
9 |
|
import java.util.Arrays; |
10 |
|
import java.util.Collection; |
11 |
|
import java.util.Comparator; |
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()); |
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<Integer> populatedQueue(int n) { |
487 |
|
Queue x = populatedQueue(SIZE); |
488 |
|
Queue y = serialClone(x); |
489 |
|
|
490 |
< |
assertTrue(x != y); |
490 |
> |
assertNotSame(x, y); |
491 |
|
assertEquals(x.size(), y.size()); |
492 |
|
while (!x.isEmpty()) { |
493 |
|
assertFalse(y.isEmpty()); |