12 |
|
* additional insertion, extraction, and inspection operations. |
13 |
|
* |
14 |
|
* <p>Queues typically, but do not necessarily, order elements in a |
15 |
< |
* FIFO (first-in-first-out) manner. Among the exceptions are priority |
16 |
< |
* queues, which order elements according to a supplied comparators, or |
17 |
< |
* the elements natural ordering. Every Queue implementation must specify |
18 |
< |
* its ordering guarantees. |
15 |
> |
* FIFO (first-in-first-out) manner. Among the exceptions are |
16 |
> |
* priority queues, which order elements according to a supplied |
17 |
> |
* comparator, or the elements' natural ordering. Every Queue |
18 |
> |
* implementation must specify its ordering guarantees. |
19 |
|
* |
20 |
|
* <p>The {@link #offer(E)} method adds an element if possible, otherwise |
21 |
|
* returning <tt>false</tt>. This differs from the {@link |