src/java.base/share/classes/java/util/Deque.java

*** 54,64 ****
   * operations cannot fail.
   *
   * <p>The twelve methods described above are summarized in the
   * following table:
   *
!  * <table BORDER CELLPADDING=3 CELLSPACING=1>
   * <caption>Summary of Deque methods</caption>
   *  <tr>
   *    <td></td>
   *    <td style="text-align:center" COLSPAN = 2> <b>First Element (Head)</b></td>
   *    <td style="text-align:center" COLSPAN = 2> <b>Last Element (Tail)</b></td>
--- 54,64 ----
   * operations cannot fail.
   *
   * <p>The twelve methods described above are summarized in the
   * following table:
   *
!  * <table class="plain">
   * <caption>Summary of Deque methods</caption>
   *  <tr>
   *    <td></td>
   *    <td style="text-align:center" COLSPAN = 2> <b>First Element (Head)</b></td>
   *    <td style="text-align:center" COLSPAN = 2> <b>Last Element (Tail)</b></td>
*** 97,107 ****
   * used as a queue, FIFO (First-In-First-Out) behavior results.  Elements are
   * added at the end of the deque and removed from the beginning.  The methods
   * inherited from the {@code Queue} interface are precisely equivalent to
   * {@code Deque} methods as indicated in the following table:
   *
!  * <table BORDER CELLPADDING=3 CELLSPACING=1>
   * <caption>Comparison of Queue and Deque methods</caption>
   *  <tr>
   *    <td style="text-align:center"> <b>{@code Queue} Method</b></td>
   *    <td style="text-align:center"> <b>Equivalent {@code Deque} Method</b></td>
   *  </tr>
--- 97,107 ----
   * used as a queue, FIFO (First-In-First-Out) behavior results.  Elements are
   * added at the end of the deque and removed from the beginning.  The methods
   * inherited from the {@code Queue} interface are precisely equivalent to
   * {@code Deque} methods as indicated in the following table:
   *
!  * <table class="plain">
   * <caption>Comparison of Queue and Deque methods</caption>
   *  <tr>
   *    <td style="text-align:center"> <b>{@code Queue} Method</b></td>
   *    <td style="text-align:center"> <b>Equivalent {@code Deque} Method</b></td>
   *  </tr>
*** 135,145 ****
   * interface should be used in preference to the legacy {@link Stack} class.
   * When a deque is used as a stack, elements are pushed and popped from the
   * beginning of the deque.  Stack methods are precisely equivalent to
   * {@code Deque} methods as indicated in the table below:
   *
!  * <table BORDER CELLPADDING=3 CELLSPACING=1>
   * <caption>Comparison of Stack and Deque methods</caption>
   *  <tr>
   *    <td style="text-align:center"> <b>Stack Method</b></td>
   *    <td style="text-align:center"> <b>Equivalent {@code Deque} Method</b></td>
   *  </tr>
--- 135,145 ----
   * interface should be used in preference to the legacy {@link Stack} class.
   * When a deque is used as a stack, elements are pushed and popped from the
   * beginning of the deque.  Stack methods are precisely equivalent to
   * {@code Deque} methods as indicated in the table below:
   *
!  * <table class="plain">
   * <caption>Comparison of Stack and Deque methods</caption>
   *  <tr>
   *    <td style="text-align:center"> <b>Stack Method</b></td>
   *    <td style="text-align:center"> <b>Equivalent {@code Deque} Method</b></td>
   *  </tr>