| 17 |
|
* use with capacity-restricted {@code Queue} implementations; in most |
| 18 |
|
* implementations, insert operations cannot fail. |
| 19 |
|
* |
| 20 |
< |
* <table class="plain"> |
| 20 |
> |
* <table class="striped"> |
| 21 |
|
* <caption>Summary of Queue methods</caption> |
| 22 |
+ |
* <thead> |
| 23 |
|
* <tr> |
| 24 |
|
* <td></td> |
| 25 |
< |
* <td style="text-align:center"><em>Throws exception</em></td> |
| 26 |
< |
* <td style="text-align:center"><em>Returns special value</em></td> |
| 25 |
> |
* <th scope="col" style="font-weight:normal; font-style:italic">Throws exception</th> |
| 26 |
> |
* <th scope="col" style="font-weight:normal; font-style:italic">Returns special value</th> |
| 27 |
|
* </tr> |
| 28 |
+ |
* </thead> |
| 29 |
+ |
* <tbody> |
| 30 |
|
* <tr> |
| 31 |
< |
* <td><b>Insert</b></td> |
| 31 |
> |
* <th scope="row">Insert</th> |
| 32 |
|
* <td>{@link #add(Object) add(e)}</td> |
| 33 |
|
* <td>{@link #offer(Object) offer(e)}</td> |
| 34 |
|
* </tr> |
| 35 |
|
* <tr> |
| 36 |
< |
* <td><b>Remove</b></td> |
| 36 |
> |
* <th scope="row">Remove</th> |
| 37 |
|
* <td>{@link #remove() remove()}</td> |
| 38 |
|
* <td>{@link #poll() poll()}</td> |
| 39 |
|
* </tr> |
| 40 |
|
* <tr> |
| 41 |
< |
* <td><b>Examine</b></td> |
| 41 |
> |
* <th scope="row">Examine</th> |
| 42 |
|
* <td>{@link #element() element()}</td> |
| 43 |
|
* <td>{@link #peek() peek()}</td> |
| 44 |
|
* </tr> |
| 45 |
+ |
* </tbody> |
| 46 |
|
* </table> |
| 47 |
|
* |
| 48 |
|
* <p>Queues typically, but do not necessarily, order elements in a |
