* |
@@ -132,7 +132,7 @@ import java.util.*; // XXX This impor
* a deque is used as a queue or a stack; in either case, elements are
* drawn from the beginning of the deque.
*
- * This inteface provides two methods to to remove interior
+ *
This interface provides two methods to remove interior
* elements, {@link #removeFirstOccurrence removeFirstOccurrence} and
* {@link #removeLastOccurrence removeLastOccurrence}. Unlike the
* {@link List} interface, this interface does not provide support for
@@ -145,7 +145,7 @@ import java.util.*; // XXX This impor
* take advantage of the ability to insert nulls. This is so because
* null is used as a special return value by various methods
* to indicated that the deque is empty.
- *
+ *
*
Deque implementations generally do not define
* element-based versions of the equals and hashCode
* methods, but instead inherit the identity-based versions from class
@@ -339,7 +339,7 @@ public interface Deque extends Queue<
/**
* Inserts the specified element into the queue represented by this
* deque unless it would violate capacity restrictions. In other words,
- * inserts the specified element as the last element of this deque.
+ * inserts the specified element as the last element of this deque.
*
* This method is equivalent to {@link #addLast}.
*
@@ -419,7 +419,7 @@ public interface Deque extends Queue<
/**
* Pops an element from the stack represented by this deque. In other
- * words, removes and returns the the first element of this deque.
+ * words, removes and returns the first element of this deque.
*
* This method is equivalent to {@link #removeFirst()}.
*
@@ -435,7 +435,7 @@ public interface Deque extends Queue<
/**
* Returns an iterator over the elements in this deque. The elements
* will be ordered from first (head) to last (tail).
- *
+ *
* @return an Iterator over the elements in this deque
*/
Iterator iterator();