--- jsr166/src/main/java/util/PriorityQueue.java	2003/08/30 11:44:53	1.37
+++ jsr166/src/main/java/util/PriorityQueue.java	2003/09/07 15:06:19	1.39
@@ -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>
@@ -649,7 +657,7 @@ public class PriorityQueue<E> extends Ab
         s.writeInt(queue.length);
 
         // Write out all elements in the proper order.
-        for (int i=0; i<size; i++)
+        for (int i=1; i<=size; i++)
             s.writeObject(queue[i]);
     }
 
@@ -668,7 +676,7 @@ public class PriorityQueue<E> extends Ab
         queue = new Object[arrayLength];
 
         // Read in all elements in the proper order.
-        for (int i=0; i<size; i++)
+        for (int i=1; i<=size; i++)
             queue[i] = (E) s.readObject();
     }