25 |
|
* <tt>Deque</tt> implementations; in most implementations, insert |
26 |
|
* operations cannot fail. |
27 |
|
* |
28 |
< |
* <p>The twelve methods described above are are summarized in the |
29 |
< |
* follwoing table:<p> |
28 |
> |
* <p>The twelve methods described above are summarized in the |
29 |
> |
* following table:<p> |
30 |
|
* |
31 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
32 |
|
* <tr> |
132 |
|
* a deque is used as a queue or a stack; in either case, elements are |
133 |
|
* drawn from the beginning of the deque. |
134 |
|
* |
135 |
< |
* <p>This inteface provides two methods to to remove interior |
135 |
> |
* <p>This interface provides two methods to remove interior |
136 |
|
* elements, {@link #removeFirstOccurrence removeFirstOccurrence} and |
137 |
|
* {@link #removeLastOccurrence removeLastOccurrence}. Unlike the |
138 |
|
* {@link List} interface, this interface does not provide support for |