--- jsr166/src/main/java/util/Queue.java 2003/07/31 07:18:02 1.10 +++ jsr166/src/main/java/util/Queue.java 2003/08/06 01:57:53 1.15 @@ -8,7 +8,7 @@ package java.util; /** * A collection designed for holding elements prior to processing. - * Besides basic {@link Collection} operations, queues provide + * Besides basic {@link java.util.Collection Collection} operations, queues provide * additional insertion, extraction, and inspection operations. * *
Queues typically, but do not necessarily, order elements in a @@ -20,9 +20,10 @@ 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(E)} method adds an element if possible, otherwise - * returning false. This differs from the {@link - * Collections#add(Object)} method, which throws an unchecked exception upon + *
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,
* in fixed-capacity (or "bounded") queues.
@@ -57,10 +58,10 @@ package java.util;
*
* Java Collections Framework.
*
- * @see Collection
+ * @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 +72,7 @@ package java.util;
public interface Queue