24 |
|
* <tt>Deque</tt> implementations; in most implementations, insert |
25 |
|
* operations cannot fail. |
26 |
|
* |
27 |
< |
* <p>The twelve methods described above are are summarized in the |
28 |
< |
* follwoing table:<p> |
27 |
> |
* <p>The twelve methods described above are summarized in the |
28 |
> |
* following table:<p> |
29 |
|
* |
30 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
31 |
|
* <tr> |
131 |
|
* a deque is used as a queue or a stack; in either case, elements are |
132 |
|
* drawn from the beginning of the deque. |
133 |
|
* |
134 |
< |
* <p>This inteface provides two methods to to remove interior |
134 |
> |
* <p>This interface provides two methods to remove interior |
135 |
|
* elements, {@link #removeFirstOccurrence removeFirstOccurrence} and |
136 |
|
* {@link #removeLastOccurrence removeLastOccurrence}. Unlike the |
137 |
|
* {@link List} interface, this interface does not provide support for |
419 |
|
|
420 |
|
/** |
421 |
|
* Pops an element from the stack represented by this deque. In other |
422 |
< |
* words, removes and returns the the first element of this deque. |
422 |
> |
* words, removes and returns the first element of this deque. |
423 |
|
* |
424 |
|
* <p>This method is equivalent to {@link #removeFirst()}. |
425 |
|
* |