--- jsr166/src/test/jtreg/util/PriorityQueue/PriorityQueueSort.java	2003/09/01 04:28:03	1.2
+++ jsr166/src/test/jtreg/util/PriorityQueue/PriorityQueueSort.java	2009/02/17 00:40:01	1.8
@@ -1,20 +1,23 @@
 /*
- * @test %I% %E%
+ * Written by Doug Lea with assistance from members of JCP JSR-166
+ * Expert Group and released to the public domain, as explained at
+ * http://creativecommons.org/licenses/publicdomain
+ */
+
+/*
+ * @test
  * @bug 4486658
  * @summary Checks that a priority queue returns elements in sorted order across various operations
- *
- * @compile -source 1.5 PriorityQueueSort.java
- * @run main PriorityQueueSort
  */
 
 import java.util.*;
 
 public class PriorityQueueSort {
 
-    static class MyComparator implements Comparator<Integer> { 
+    static class MyComparator implements Comparator<Integer> {
         public int compare(Integer x, Integer y) {
-            int i = ((Integer)x).intValue();
-            int j = ((Integer)y).intValue();
+            int i = x.intValue();
+            int j = y.intValue();
             if (i < j) return -1;
             if (i > j) return 1;
             return 0;
@@ -25,7 +28,7 @@ public class PriorityQueueSort {
         int n = 10000;
         if (args.length > 0)
             n = Integer.parseInt(args[0]);
-        
+
         List<Integer> sorted = new ArrayList<Integer>(n);
         for (int i = 0; i < n; i++)
             sorted.add(new Integer(i));