--- jsr166/src/main/java/util/PriorityQueue.java	2003/08/30 11:40:04	1.36
+++ jsr166/src/main/java/util/PriorityQueue.java	2003/09/01 12:23:28	1.38
@@ -1,4 +1,11 @@
- package java.util;
+/*
+ * %W% %E%
+ *
+ * Copyright 2003 Sun Microsystems, Inc. All rights reserved.
+ * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+ */
+
+package java.util;
 
 /**
  * An unbounded priority {@linkplain Queue queue} based on a priority heap.
@@ -48,6 +55,7 @@
  * <a href="{@docRoot}/../guide/collections/index.html">
  * Java Collections Framework</a>.
  * @since 1.5
+ * @version %I%, %G%
  * @author Josh Bloch
  */
 public class PriorityQueue<E> extends AbstractQueue<E>
@@ -462,7 +470,7 @@ public class PriorityQueue<E> extends Ab
                     cursor--;
                 } else {
                     if (forgetMeNot == null)
-                        forgetMeNot = new ArrayList();
+                        forgetMeNot = new ArrayList<E>();
                     forgetMeNot.add(moved);
                 }
             } else if (lastRetElt != null) {
@@ -669,7 +677,7 @@ public class PriorityQueue<E> extends Ab
 
         // Read in all elements in the proper order.
         for (int i=0; i<size; i++)
-            queue[i] = s.readObject();
+            queue[i] = (E) s.readObject();
     }
 
 }