--- jsr166/src/main/java/util/Queue.java 2003/05/18 18:10:02 1.2 +++ jsr166/src/main/java/util/Queue.java 2003/06/07 18:31:00 1.4 @@ -1,3 +1,9 @@ +/* + * Written by Doug Lea with assistance from members of JCP JSR-166 + * Expert Group and released to the public domain. Use, modify, and + * redistribute this code in any way without acknowledgement. + */ + package java.util; /** @@ -17,10 +23,14 @@ package java.util; * failure. It is designed for use in collections in which failure to * add is a normal, rather than exceptional occurrence, for example, * in fixed-capacity (or “bounded”) queues. - * + + * *
The {@link #remove()} and {@link #poll()} methods remove and return an
- * element in accord with the implementation's ordering policy. For example,
- * in FIFO queues, they remove and return the oldest element in the queue.
+ * element in accord with the implementation's ordering policy.
+ * Exactly which element is removed from the queue is a function
+ * of the queue's ordering policy, which differs from implementation
+ * to implementation. Possible orderings include (but are not limited
+ * to) first-in-first-out (FIFO), element priority, and arbitrary.
* The remove() and poll() methods differ only in their
* behavior when the queue is empty: the remove() method throws an
* exception, while the poll() method returns null.
@@ -65,20 +75,16 @@ public interface Queue