--- jsr166/src/main/java/util/Queue.java 2003/10/18 12:29:27 1.20 +++ jsr166/src/main/java/util/Queue.java 2004/11/21 01:40:39 1.23 @@ -1,7 +1,7 @@ /* * Written by Doug Lea with assistance from members of JCP JSR-166 - * Expert Group and released to the public domain. Use, modify, and - * redistribute this code in any way without acknowledgement. + * Expert Group and released to the public domain, as explained at + * http://creativecommons.org/licenses/publicdomain */ package java.util; @@ -9,7 +9,31 @@ 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. + * additional insertion, extraction, and inspection operations. The names + * of the operations vary with their policies: + * + *
Operation | + *Attempt | + *Throw | + *
insert | + *offer(x) | + *add(x) | + *
extract | + *poll() | + *remove() | + *
inspect | + *peek() | + *element() | + *
Queues typically, but do not necessarily, order elements in a
* FIFO (first-in-first-out) manner. Among the exceptions are
@@ -79,7 +103,7 @@ package java.util;
* @see java.util.concurrent.PriorityBlockingQueue
* @since 1.5
* @author Doug Lea
- * @param