27 |
|
* <p>The twelve methods described above are summarized in the |
28 |
|
* following table: |
29 |
|
* |
30 |
– |
* <p> |
30 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
31 |
|
* <caption>Summary of Deque methods</caption> |
32 |
|
* <tr> |
43 |
|
* </tr> |
44 |
|
* <tr> |
45 |
|
* <td><b>Insert</b></td> |
46 |
< |
* <td>{@link #addFirst addFirst(e)}</td> |
47 |
< |
* <td>{@link #offerFirst offerFirst(e)}</td> |
48 |
< |
* <td>{@link #addLast addLast(e)}</td> |
49 |
< |
* <td>{@link #offerLast offerLast(e)}</td> |
46 |
> |
* <td>{@link Deque#addFirst addFirst(e)}</td> |
47 |
> |
* <td>{@link Deque#offerFirst offerFirst(e)}</td> |
48 |
> |
* <td>{@link Deque#addLast addLast(e)}</td> |
49 |
> |
* <td>{@link Deque#offerLast offerLast(e)}</td> |
50 |
|
* </tr> |
51 |
|
* <tr> |
52 |
|
* <td><b>Remove</b></td> |
53 |
< |
* <td>{@link #removeFirst removeFirst()}</td> |
54 |
< |
* <td>{@link #pollFirst pollFirst()}</td> |
55 |
< |
* <td>{@link #removeLast removeLast()}</td> |
56 |
< |
* <td>{@link #pollLast pollLast()}</td> |
53 |
> |
* <td>{@link Deque#removeFirst removeFirst()}</td> |
54 |
> |
* <td>{@link Deque#pollFirst pollFirst()}</td> |
55 |
> |
* <td>{@link Deque#removeLast removeLast()}</td> |
56 |
> |
* <td>{@link Deque#pollLast pollLast()}</td> |
57 |
|
* </tr> |
58 |
|
* <tr> |
59 |
|
* <td><b>Examine</b></td> |
60 |
< |
* <td>{@link #getFirst getFirst()}</td> |
61 |
< |
* <td>{@link #peekFirst peekFirst()}</td> |
62 |
< |
* <td>{@link #getLast getLast()}</td> |
63 |
< |
* <td>{@link #peekLast peekLast()}</td> |
60 |
> |
* <td>{@link Deque#getFirst getFirst()}</td> |
61 |
> |
* <td>{@link Deque#peekFirst peekFirst()}</td> |
62 |
> |
* <td>{@link Deque#getLast getLast()}</td> |
63 |
> |
* <td>{@link Deque#peekLast peekLast()}</td> |
64 |
|
* </tr> |
65 |
|
* </table> |
66 |
|
* |
70 |
|
* inherited from the {@code Queue} interface are precisely equivalent to |
71 |
|
* {@code Deque} methods as indicated in the following table: |
72 |
|
* |
74 |
– |
* <p> |
73 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
74 |
|
* <caption>Comparison of Queue and Deque methods</caption> |
75 |
|
* <tr> |
108 |
|
* beginning of the deque. Stack methods are precisely equivalent to |
109 |
|
* {@code Deque} methods as indicated in the table below: |
110 |
|
* |
113 |
– |
* <p> |
111 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
112 |
|
* <caption>Comparison of Stack and Deque methods</caption> |
113 |
|
* <tr> |
164 |
|
public interface Deque<E> extends Queue<E> { |
165 |
|
/** |
166 |
|
* Inserts the specified element at the front of this deque if it is |
167 |
< |
* possible to do so immediately without violating capacity restrictions. |
168 |
< |
* When using a capacity-restricted deque, it is generally preferable to |
169 |
< |
* use method {@link #offerFirst}. |
167 |
> |
* possible to do so immediately without violating capacity restrictions, |
168 |
> |
* throwing an {@code IllegalStateException} if no space is currently |
169 |
> |
* available. When using a capacity-restricted deque, it is generally |
170 |
> |
* preferable to use method {@link #offerFirst}. |
171 |
|
* |
172 |
|
* @param e the element to add |
173 |
|
* @throws IllegalStateException if the element cannot be added at this |
183 |
|
|
184 |
|
/** |
185 |
|
* Inserts the specified element at the end of this deque if it is |
186 |
< |
* possible to do so immediately without violating capacity restrictions. |
187 |
< |
* When using a capacity-restricted deque, it is generally preferable to |
188 |
< |
* use method {@link #offerLast}. |
186 |
> |
* possible to do so immediately without violating capacity restrictions, |
187 |
> |
* throwing an {@code IllegalStateException} if no space is currently |
188 |
> |
* available. When using a capacity-restricted deque, it is generally |
189 |
> |
* preferable to use method {@link #offerLast}. |
190 |
|
* |
191 |
|
* <p>This method is equivalent to {@link #add}. |
192 |
|
* |
323 |
|
* @param o element to be removed from this deque, if present |
324 |
|
* @return {@code true} if an element was removed as a result of this call |
325 |
|
* @throws ClassCastException if the class of the specified element |
326 |
< |
* is incompatible with this deque (optional) |
327 |
< |
* @throws NullPointerException if the specified element is null and this |
328 |
< |
* deque does not permit null elements (optional) |
326 |
> |
* is incompatible with this deque |
327 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
328 |
> |
* @throws NullPointerException if the specified element is null |
329 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
330 |
|
*/ |
331 |
|
boolean removeFirstOccurrence(Object o); |
332 |
|
|
342 |
|
* @param o element to be removed from this deque, if present |
343 |
|
* @return {@code true} if an element was removed as a result of this call |
344 |
|
* @throws ClassCastException if the class of the specified element |
345 |
< |
* is incompatible with this deque (optional) |
346 |
< |
* @throws NullPointerException if the specified element is null and this |
347 |
< |
* deque does not permit null elements (optional) |
345 |
> |
* is incompatible with this deque |
346 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
347 |
> |
* @throws NullPointerException if the specified element is null |
348 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
349 |
|
*/ |
350 |
|
boolean removeLastOccurrence(Object o); |
351 |
|
|
454 |
|
/** |
455 |
|
* Pushes an element onto the stack represented by this deque (in other |
456 |
|
* words, at the head of this deque) if it is possible to do so |
457 |
< |
* immediately without violating capacity restrictions, returning |
457 |
< |
* {@code true} upon success and throwing an |
457 |
> |
* immediately without violating capacity restrictions, throwing an |
458 |
|
* {@code IllegalStateException} if no space is currently available. |
459 |
|
* |
460 |
|
* <p>This method is equivalent to {@link #addFirst}. |
500 |
|
* @param o element to be removed from this deque, if present |
501 |
|
* @return {@code true} if an element was removed as a result of this call |
502 |
|
* @throws ClassCastException if the class of the specified element |
503 |
< |
* is incompatible with this deque (optional) |
504 |
< |
* @throws NullPointerException if the specified element is null and this |
505 |
< |
* deque does not permit null elements (optional) |
503 |
> |
* is incompatible with this deque |
504 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
505 |
> |
* @throws NullPointerException if the specified element is null |
506 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
507 |
|
*/ |
508 |
|
boolean remove(Object o); |
509 |
|
|
515 |
|
* |
516 |
|
* @param o element whose presence in this deque is to be tested |
517 |
|
* @return {@code true} if this deque contains the specified element |
518 |
< |
* @throws ClassCastException if the type of the specified element |
519 |
< |
* is incompatible with this deque (optional) |
520 |
< |
* @throws NullPointerException if the specified element is null and this |
521 |
< |
* deque does not permit null elements (optional) |
518 |
> |
* @throws ClassCastException if the class of the specified element |
519 |
> |
* is incompatible with this deque |
520 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
521 |
> |
* @throws NullPointerException if the specified element is null |
522 |
> |
* (<a href="../Collection.html#optional-restrictions">optional</a>) |
523 |
|
*/ |
524 |
|
boolean contains(Object o); |
525 |
|
|