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> |
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> |
315 |
|
* Removes the first occurrence of the specified element from this deque. |
316 |
|
* If the deque does not contain the element, it is unchanged. |
317 |
|
* More formally, removes the first element {@code e} such that |
318 |
< |
* <tt>(o==null ? e==null : o.equals(e))</tt> |
322 |
< |
* (if such an element exists). |
318 |
> |
* {@code Objects.equals(o, e)} (if such an element exists). |
319 |
|
* Returns {@code true} if this deque contained the specified element |
320 |
|
* (or equivalently, if this deque changed as a result of the call). |
321 |
|
* |
333 |
|
* Removes the last occurrence of the specified element from this deque. |
334 |
|
* If the deque does not contain the element, it is unchanged. |
335 |
|
* More formally, removes the last element {@code e} such that |
336 |
< |
* <tt>(o==null ? e==null : o.equals(e))</tt> |
341 |
< |
* (if such an element exists). |
336 |
> |
* {@code Objects.equals(o, e)} (if such an element exists). |
337 |
|
* Returns {@code true} if this deque contained the specified element |
338 |
|
* (or equivalently, if this deque changed as a result of the call). |
339 |
|
* |
488 |
|
* Removes the first occurrence of the specified element from this deque. |
489 |
|
* If the deque does not contain the element, it is unchanged. |
490 |
|
* More formally, removes the first element {@code e} such that |
491 |
< |
* <tt>(o==null ? e==null : o.equals(e))</tt> |
497 |
< |
* (if such an element exists). |
491 |
> |
* {@code Objects.equals(o, e)} (if such an element exists). |
492 |
|
* Returns {@code true} if this deque contained the specified element |
493 |
|
* (or equivalently, if this deque changed as a result of the call). |
494 |
|
* |
507 |
|
/** |
508 |
|
* Returns {@code true} if this deque contains the specified element. |
509 |
|
* More formally, returns {@code true} if and only if this deque contains |
510 |
< |
* at least one element {@code e} such that |
517 |
< |
* <tt>(o==null ? e==null : o.equals(e))</tt>. |
510 |
> |
* at least one element {@code e} such that {@code Objects.equals(o, e)}. |
511 |
|
* |
512 |
|
* @param o element whose presence in this deque is to be tested |
513 |
|
* @return {@code true} if this deque contains the specified element |