--- jsr166/src/main/java/util/PriorityQueue.java 2003/08/30 11:40:04 1.36
+++ 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 @@
*
* Java Collections Framework.
* @since 1.5
+ * @version %I%, %G%
* @author Josh Bloch
*/
public class PriorityQueue extends AbstractQueue
@@ -462,7 +470,7 @@ public class PriorityQueue extends Ab
cursor--;
} else {
if (forgetMeNot == null)
- forgetMeNot = new ArrayList();
+ forgetMeNot = new ArrayList();
forgetMeNot.add(moved);
}
} else if (lastRetElt != null) {
@@ -649,7 +657,7 @@ public class PriorityQueue extends Ab
s.writeInt(queue.length);
// Write out all elements in the proper order.
- for (int i=0; i extends Ab
queue = new Object[arrayLength];
// Read in all elements in the proper order.
- for (int i=0; i