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> |