--- jsr166/src/main/java/util/Queue.java 2003/08/01 19:34:05 1.12 +++ jsr166/src/main/java/util/Queue.java 2003/08/30 11:40:04 1.16 @@ -20,8 +20,9 @@ package java.util; * which would be removed by a call to {@link #remove() } or {@link #poll()}. * Every Queue implementation must specify its ordering guarantees. * - *
The {@link #offer offer(E)} method adds an element if possible, otherwise - * returning false. This differs from the {@link java.util.Collection#add Collection.add(E)} + *
The {@link #offer offer} method adds an element if possible, otherwise + * returning false. This differs from the + * {@link java.util.Collection#add Collection.add} * method, which throws an unchecked exception upon * failure. It is designed for use in collections in which failure to * add is a normal, rather than exceptional occurrence, for example, @@ -53,6 +54,14 @@ package java.util; * used as a special return value by the poll method to * indicate that the queue contains no elements. * + *
Queue implementations generally do not define + * element-based versions of methods equals and + * hashCode but instead inherit the identity based versions + * from class Object, because element-based equality is not + * always well-defined for queues with the same elements but different + * ordering properties. + * + * *
This interface is a member of the
*
* Java Collections Framework.
@@ -60,7 +69,7 @@ package java.util;
* @see java.util.Collection
* @see LinkedList
* @see PriorityQueue
- * @see java.util.concurrent.LinkedQueue
+ * @see java.util.concurrent.LinkedBlockingQueue
* @see java.util.concurrent.BlockingQueue
* @see java.util.concurrent.ArrayBlockingQueue
* @see java.util.concurrent.LinkedBlockingQueue
@@ -71,7 +80,7 @@ package java.util;
public interface Queue