--- jsr166/src/main/java/util/Queue.java 2013/02/11 17:27:45 1.39 +++ jsr166/src/main/java/util/Queue.java 2018/10/01 00:10:53 1.50 @@ -8,39 +8,41 @@ package java.util; /** * A collection designed for holding elements prior to processing. - * Besides basic {@link java.util.Collection Collection} operations, - * queues provide additional insertion, extraction, and inspection - * operations. Each of these methods exists in two forms: one throws - * an exception if the operation fails, the other returns a special - * value (either {@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. + * Besides basic {@link Collection} operations, queues provide + * additional insertion, extraction, and inspection operations. + * Each of these methods exists in two forms: one throws an exception + * if the operation fails, the other returns a special value (either + * {@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. * - *
- *
- * | Throws exception | - *Returns special value | + *Throws exception | + *Returns special value | *|
---|---|---|---|---|---|
Insert | - *{@link #add add(e)} | - *{@link #offer offer(e)} | + *Insert | + *{@link #add(Object) add(e)} | + *{@link #offer(Object) offer(e)} | *
Remove | - *{@link #remove remove()} | - *{@link #poll poll()} | + *Remove | + *{@link #remove() remove()} | + *{@link #poll() poll()} | *
Examine | - *{@link #element element()} | - *{@link #peek peek()} | + *Examine | + *{@link #element() element()} | + *{@link #peek() peek()} | *
Queues typically, but do not necessarily, order elements in a @@ -49,7 +51,7 @@ package java.util; * comparator, or the elements' natural ordering, and LIFO queues (or * stacks) which order the elements LIFO (last-in-first-out). * Whatever the ordering used, the head of the queue is that - * element which would be removed by a call to {@link #remove() } or + * element which would be removed by a call to {@link #remove()} or * {@link #poll()}. In a FIFO queue, all new elements are inserted at * the tail of the queue. Other kinds of queues may use * different placement rules. Every {@code Queue} implementation @@ -96,22 +98,13 @@ package java.util; * always well-defined for queues with the same elements but different * ordering properties. * - * *
This interface is a member of the
- *
+ *
* Java Collections Framework.
*
- * @see java.util.Collection
- * @see LinkedList
- * @see PriorityQueue
- * @see java.util.concurrent.LinkedBlockingQueue
- * @see java.util.concurrent.BlockingQueue
- * @see java.util.concurrent.ArrayBlockingQueue
- * @see java.util.concurrent.LinkedBlockingQueue
- * @see java.util.concurrent.PriorityBlockingQueue
* @since 1.5
* @author Doug Lea
- * @param