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

*** 44,75 ****
   * {@code null} or {@code false}, depending on the operation).  The
   * latter form of the insert operation is designed specifically for
   * use with capacity-restricted {@code Queue} implementations; in most
   * implementations, insert operations cannot fail.
   *
!  * <table class="plain">
   * <caption>Summary of Queue methods</caption>
   *  <tr>
   *    <td></td>
!  *    <td style="text-align:center"><em>Throws exception</em></td>
!  *    <td style="text-align:center"><em>Returns special value</em></td>
   *  </tr>
   *  <tr>
!  *    <td><b>Insert</b></td>
   *    <td>{@link #add(Object) add(e)}</td>
   *    <td>{@link #offer(Object) offer(e)}</td>
   *  </tr>
   *  <tr>
!  *    <td><b>Remove</b></td>
   *    <td>{@link #remove() remove()}</td>
   *    <td>{@link #poll() poll()}</td>
   *  </tr>
   *  <tr>
!  *    <td><b>Examine</b></td>
   *    <td>{@link #element() element()}</td>
   *    <td>{@link #peek() peek()}</td>
   *  </tr>
   * </table>
   *
   * <p>Queues typically, but do not necessarily, order elements in a
   * FIFO (first-in-first-out) manner.  Among the exceptions are
   * priority queues, which order elements according to a supplied
--- 44,79 ----
   * {@code null} or {@code false}, depending on the operation).  The
   * latter form of the insert operation is designed specifically for
   * use with capacity-restricted {@code Queue} implementations; in most
   * implementations, insert operations cannot fail.
   *
!  * <table class="striped">
   * <caption>Summary of Queue methods</caption>
+  *  <thead>
   *  <tr>
   *    <td></td>
!  *    <th scope="col" style="font-weight:normal; font-style:italic">Throws exception</th>
!  *    <th scope="col" style="font-weight:normal; font-style:italic">Returns special value</th>
   *  </tr>
+  *  </thead>
+  *  <tbody>
   *  <tr>
!  *    <th scope="row">Insert</th>
   *    <td>{@link #add(Object) add(e)}</td>
   *    <td>{@link #offer(Object) offer(e)}</td>
   *  </tr>
   *  <tr>
!  *    <th scope="row">Remove</th>
   *    <td>{@link #remove() remove()}</td>
   *    <td>{@link #poll() poll()}</td>
   *  </tr>
   *  <tr>
!  *    <th scope="row">Examine</th>
   *    <td>{@link #element() element()}</td>
   *    <td>{@link #peek() peek()}</td>
   *  </tr>
+  *  </tbody>
   * </table>
   *
   * <p>Queues typically, but do not necessarily, order elements in a
   * FIFO (first-in-first-out) manner.  Among the exceptions are
   * priority queues, which order elements according to a supplied