27 |
|
* <p>The twelve methods described above are summarized in the |
28 |
|
* following table: |
29 |
|
* |
30 |
< |
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
30 |
> |
* <table class="plain"> |
31 |
|
* <caption>Summary of Deque methods</caption> |
32 |
|
* <tr> |
33 |
|
* <td></td> |
70 |
|
* inherited from the {@code Queue} interface are precisely equivalent to |
71 |
|
* {@code Deque} methods as indicated in the following table: |
72 |
|
* |
73 |
< |
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
73 |
> |
* <table class="plain"> |
74 |
|
* <caption>Comparison of Queue and Deque methods</caption> |
75 |
|
* <tr> |
76 |
|
* <td style="text-align:center"> <b>{@code Queue} Method</b></td> |
108 |
|
* beginning of the deque. Stack methods are precisely equivalent to |
109 |
|
* {@code Deque} methods as indicated in the table below: |
110 |
|
* |
111 |
< |
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
111 |
> |
* <table class="plain"> |
112 |
|
* <caption>Comparison of Stack and Deque methods</caption> |
113 |
|
* <tr> |
114 |
|
* <td style="text-align:center"> <b>Stack Method</b></td> |