--- jsr166/src/test/tck/PriorityQueueTest.java 2017/01/04 06:09:58 1.40 +++ jsr166/src/test/tck/PriorityQueueTest.java 2017/05/29 22:44:27 1.43 @@ -15,7 +15,6 @@ import java.util.PriorityQueue; import java.util.Queue; import junit.framework.Test; -import junit.framework.TestSuite; public class PriorityQueueTest extends JSR166TestCase { public static void main(String[] args) { @@ -43,7 +42,7 @@ public class PriorityQueueTest extends J * Returns a new queue of given size containing consecutive * Integers 0 ... n - 1. */ - private PriorityQueue populatedQueue(int n) { + private static PriorityQueue populatedQueue(int n) { PriorityQueue q = new PriorityQueue<>(n); assertTrue(q.isEmpty()); for (int i = n - 1; i >= 0; i -= 2) @@ -64,7 +63,7 @@ public class PriorityQueueTest extends J } /** - * Constructor throws IAE if capacity argument nonpositive + * Constructor throws IllegalArgumentException if capacity argument nonpositive */ public void testConstructor2() { try {