| 1 |
|
/* |
| 2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
|
* Expert Group and released to the public domain, as explained at |
| 4 |
< |
* http://creativecommons.org/licenses/publicdomain |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
package java.util; |
| 50 |
|
* Whatever the ordering used, the <em>head</em> of the queue is that |
| 51 |
|
* element which would be removed by a call to {@link #remove() } or |
| 52 |
|
* {@link #poll()}. In a FIFO queue, all new elements are inserted at |
| 53 |
< |
* the <em> tail</em> of the queue. Other kinds of queues may use |
| 53 |
> |
* the <em>tail</em> of the queue. Other kinds of queues may use |
| 54 |
|
* different placement rules. Every <tt>Queue</tt> implementation |
| 55 |
|
* must specify its ordering properties. |
| 56 |
|
* |
