8 |
|
|
9 |
|
/** |
10 |
|
* A collection designed for holding elements prior to processing. |
11 |
< |
* Besides basic {@link Collection} operations, queues provide |
11 |
> |
* Besides basic {@link java.util.Collection Collection} operations, queues provide |
12 |
|
* additional insertion, extraction, and inspection operations. |
13 |
|
* |
14 |
|
* <p>Queues typically, but do not necessarily, order elements in a |
20 |
|
* which would be removed by a call to {@link #remove() } or {@link #poll()}. |
21 |
|
* Every <tt>Queue</tt> implementation must specify its ordering guarantees. |
22 |
|
* |
23 |
< |
* <p>The {@link #offer(E)} method adds an element if possible, otherwise |
24 |
< |
* returning <tt>false</tt>. This differs from the {@link |
25 |
< |
* Collections#add(Object)} method, which throws an unchecked exception upon |
23 |
> |
* <p>The {@link #offer offer} method adds an element if possible, otherwise |
24 |
> |
* returning <tt>false</tt>. This differs from the |
25 |
> |
* {@link java.util.Collection#add Collection.add} |
26 |
> |
* method, which throws an unchecked exception upon |
27 |
|
* failure. It is designed for use in collections in which failure to |
28 |
|
* add is a normal, rather than exceptional occurrence, for example, |
29 |
|
* in fixed-capacity (or "bounded") queues. |
58 |
|
* <a href="{@docRoot}/../guide/collections/index.html"> |
59 |
|
* Java Collections Framework</a>. |
60 |
|
* |
61 |
< |
* @see Collection |
61 |
> |
* @see java.util.Collection |
62 |
|
* @see LinkedList |
63 |
|
* @see PriorityQueue |
64 |
|
* @see java.util.concurrent.LinkedQueue |