--- jsr166/src/main/java/util/Deque.java 2013/08/02 22:47:35 1.27
+++ jsr166/src/main/java/util/Deque.java 2014/12/31 22:40:51 1.31
@@ -27,7 +27,6 @@ package java.util;
*
The twelve methods described above are summarized in the
* following table:
*
- *
*
* Summary of Deque methods
*
@@ -71,7 +70,6 @@ package java.util;
* inherited from the {@code Queue} interface are precisely equivalent to
* {@code Deque} methods as indicated in the following table:
*
- *
*
* Comparison of Queue and Deque methods
*
@@ -110,7 +108,6 @@ package java.util;
* beginning of the deque. Stack methods are precisely equivalent to
* {@code Deque} methods as indicated in the table below:
*
- *
*
* Comparison of Stack and Deque methods
*
@@ -162,7 +159,7 @@ package java.util;
* @author Doug Lea
* @author Josh Bloch
* @since 1.6
- * @param the type of elements held in this collection
+ * @param the type of elements held in this deque
*/
public interface Deque extends Queue {
/**
@@ -318,8 +315,7 @@ public interface Deque extends Queue<
* Removes the first occurrence of the specified element from this deque.
* If the deque does not contain the element, it is unchanged.
* More formally, removes the first element {@code e} such that
- * (o==null ? e==null : o.equals(e))
- * (if such an element exists).
+ * {@code Objects.equals(o, e)} (if such an element exists).
* Returns {@code true} if this deque contained the specified element
* (or equivalently, if this deque changed as a result of the call).
*
@@ -337,8 +333,7 @@ public interface Deque extends Queue<
* Removes the last occurrence of the specified element from this deque.
* If the deque does not contain the element, it is unchanged.
* More formally, removes the last element {@code e} such that
- * (o==null ? e==null : o.equals(e))
- * (if such an element exists).
+ * {@code Objects.equals(o, e)} (if such an element exists).
* Returns {@code true} if this deque contained the specified element
* (or equivalently, if this deque changed as a result of the call).
*
@@ -493,8 +488,7 @@ public interface Deque extends Queue<
* Removes the first occurrence of the specified element from this deque.
* If the deque does not contain the element, it is unchanged.
* More formally, removes the first element {@code e} such that
- * (o==null ? e==null : o.equals(e))
- * (if such an element exists).
+ * {@code Objects.equals(o, e)} (if such an element exists).
* Returns {@code true} if this deque contained the specified element
* (or equivalently, if this deque changed as a result of the call).
*
@@ -513,8 +507,7 @@ public interface Deque extends Queue<
/**
* Returns {@code true} if this deque contains the specified element.
* More formally, returns {@code true} if and only if this deque contains
- * at least one element {@code e} such that
- * (o==null ? e==null : o.equals(e)).
+ * at least one element {@code e} such that {@code Objects.equals(o, e)}.
*
* @param o element whose presence in this deque is to be tested
* @return {@code true} if this deque contains the specified element
@@ -531,7 +524,7 @@ public interface Deque extends Queue<
*
* @return the number of elements in this deque
*/
- public int size();
+ int size();
/**
* Returns an iterator over the elements in this deque in proper sequence.