--- jsr166/src/main/java/util/Queue.java	2003/07/28 19:53:49	1.9
+++ jsr166/src/main/java/util/Queue.java	2003/08/04 01:54:13	1.13
@@ -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.
  *
  * <p>Queues typically, but do not necessarily, order elements in a
@@ -18,11 +18,12 @@ package java.util;
  * stacks) which order the elements LIFO (last-in-first-out).
  * Whatever the ordering used, the <em>head</em> of the queue is that element
  * which would be removed by a call to {@link #remove() } or {@link #poll()}.
- * Every Queue implementation must specify its ordering guarantees.
+ * Every <tt>Queue</tt> implementation must specify its ordering guarantees.
  *
- * <p>The {@link #offer(E)} method adds an element if possible, otherwise
- * returning <tt>false</tt>.  This differs from the {@link
- * Collections#add(Object)} method, which throws an unchecked exception upon
+ * <p>The {@link #offer offer} method adds an element if possible, otherwise
+ * returning <tt>false</tt>.  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 &quot;bounded&quot;) queues.
@@ -37,7 +38,7 @@ package java.util;
  * while the <tt>poll()</tt> method returns <tt>null</tt>.
  *
  * <p>The {@link #element()} and {@link #peek()} methods return, but do
- * not delete, the head of the queue.
+ * not remove, the head of the queue.
  *
  * <p>The <tt>Queue</tt> interface does not define the <i>blocking queue
  * methods</i>, which are common in concurrent programming.  These methods,
@@ -57,7 +58,7 @@ package java.util;
  * <a href="{@docRoot}/../guide/collections/index.html">
  * Java Collections Framework</a>.
  *
- * @see Collection
+ * @see java.util.Collection
  * @see LinkedList
  * @see PriorityQueue
  * @see java.util.concurrent.LinkedQueue
@@ -73,11 +74,11 @@ public interface Queue<E> extends Collec
     /**
      * Add the specified element to this queue, if possible.
      *
-     * @param element the element to add.
+     * @param o the element to add.
      * @return <tt>true</tt> if it was possible to add the element to
-     * this queue.
+     * this queue, else <tt>false</tt>
      */
-    boolean offer(E element);
+    boolean offer(E o);
 
     /**
      * Retrieve and remove the head of this queue, if it is available.
@@ -90,7 +91,7 @@ public interface Queue<E> extends Collec
     /**
      * Retrieve and remove the head of this queue.
      * This method differs
-     * from the <tt>poll</tt> method in that it throws an exception if the
+     * from the <tt>poll</tt> method in that it throws an exception if this
      * queue is empty.
      *
      * @return the head of this queue.
@@ -99,9 +100,9 @@ public interface Queue<E> extends Collec
     E remove();
 
     /**
-     * Retrieve, but do not remove, the head of this queue, or <tt>null</tt>
-     * if this queue is empty.  This method differs from the <tt>poll</tt>
-     * method only in that this method does not remove the element from
+     * Retrieve, but do not remove, the head of this queue.
+     * This method differs from the <tt>poll</tt>
+     * method only in that this method does not remove the head element from
      * this queue.
      *
      * @return the head of this queue, or <tt>null</tt> if this queue is empty.