--- jsr166/src/main/java/util/Deque.java	2005/05/16 04:58:20	1.9
+++ jsr166/src/main/java/util/Deque.java	2005/05/18 03:45:35	1.13
@@ -182,7 +182,7 @@ public interface Deque<E> extends Queue<
     void addFirst(E e);
 
     /**
-     * Inserts the specified element at the end of this deque  if it is
+     * Inserts the specified element at the end of this deque if it is
      * possible to do so immediately without violating capacity restrictions.
      * When using a capacity-restricted deque, it is generally preferable to
      * use method {@link #offerLast}.
@@ -206,8 +206,8 @@ public interface Deque<E> extends Queue<
      * which can fail to insert an element only by throwing an exception.
      *
      * @param e the element to add
-     * @return <tt>true</tt> if it was possible to insert the element,
-     *         else <tt>false</tt>
+     * @return <tt>true</tt> if the element was added to this deque, else
+     *         <tt>false</tt>
      * @throws ClassCastException if the class of the specified element
      *         prevents it from being added to this deque
      * @throws NullPointerException if the specified element is null and this
@@ -224,8 +224,8 @@ public interface Deque<E> extends Queue<
      * which can fail to insert an element only by throwing an exception.
      *
      * @param e the element to add
-     * @return <tt>true</tt> if it was possible to insert the element,
-     *         else <tt>false</tt>
+     * @return <tt>true</tt> if the element was added to this deque, else
+     *         <tt>false</tt>
      * @throws ClassCastException if the class of the specified element
      *         prevents it from being added to this deque
      * @throws NullPointerException if the specified element is null and this
@@ -313,8 +313,8 @@ public interface Deque<E> extends Queue<
      * More formally, removes the first element <tt>e</tt> such that
      * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>
      * (if such an element exists).
-     * Returns true if this deque contained the specified element (or
-     * equivalently, if this deque changed as a result of the call).
+     * Returns <tt>true</tt> if this deque contained the specified element
+     * (or equivalently, if this deque changed as a result of the call).
      *
      * @param o element to be removed from this deque, if present
      * @return <tt>true</tt> if an element was removed as a result of this call
@@ -331,8 +331,8 @@ public interface Deque<E> extends Queue<
      * More formally, removes the last element <tt>e</tt> such that
      * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>
      * (if such an element exists).
-     * Returns true if this deque contained the specified element (or
-     * equivalently, if this deque changed as a result of the call).
+     * Returns <tt>true</tt> if this deque contained the specified element
+     * (or equivalently, if this deque changed as a result of the call).
      *
      * @param o element to be removed from this deque, if present
      * @return <tt>true</tt> if an element was removed as a result of this call
@@ -487,8 +487,8 @@ public interface Deque<E> extends Queue<
      * More formally, removes the first element <tt>e</tt> such that
      * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>
      * (if such an element exists).
-     * Returns true if this deque contained the specified element (or
-     * equivalently, if this deque changed as a result of the call).
+     * Returns <tt>true</tt> if this deque contained the specified element
+     * (or equivalently, if this deque changed as a result of the call).
      *
      * <p>This method is equivalent to {@link #removeFirstOccurrence}.
      *
@@ -524,10 +524,10 @@ public interface Deque<E> extends Queue<
     public int size();
 
     /**
-     * Returns an iterator over the elements in this deque.  The elements
-     * will be ordered from first (head) to last (tail).
+     * Returns an iterator over the elements in this deque in proper sequence.
+     * The elements will be returned in order from first (head) to last (tail).
      *
-     * @return an <tt>Iterator</tt> over the elements in this deque
+     * @return an iterator over the elements in this deque in proper sequence
      */
     Iterator<E> iterator();
 }