--- jsr166/src/main/java/util/AbstractQueue.java 2003/08/04 01:50:33 1.11 +++ jsr166/src/main/java/util/AbstractQueue.java 2003/10/05 22:59:21 1.19 @@ -7,15 +7,24 @@ package java.util; /** - * AbstractQueue provides default implementations of - * {@link #add add}, {@link #remove remove}, and {@link #element element} - * based on - * {@link #offer offer}, {@link #poll poll}, and {@link #peek peek}, - * respectively but that - * throw exceptions instead of indicating failure via false or + * This class provides skeletal implementations of some {@link Queue} + * operations. The implementations in this class are appropriate when + * the base implementation does not allow null + * elements. Methods {@link #add add}, {@link #remove remove}, and + * {@link #element element} are based on {@link #offer offer}, {@link + * #poll poll}, and {@link #peek peek}, respectively but throw + * exceptions instead of indicating failure via false or * null returns. - *
The provided implementations all assume that the base implementation - * does not allow null elements. + * + *
A Queue implementation that extends this class must
+ * minimally define a method {@link Queue#offer} which does not permit
+ * insertion of null elements, along with methods {@link
+ * Queue#peek}, {@link Queue#poll}, {@link Collection#size}, and a
+ * {@link Collection#iterator} supporting {@link
+ * Iterator#remove}. Typically, additional methods will be overridden
+ * as well. If these requirements cannot be met, consider instead
+ * subclassing {@link AbstractCollection}.
+ *
* @since 1.5
* @author Doug Lea
*/
@@ -23,16 +32,24 @@ public abstract class AbstractQueue
- * This implementation iterates over the specified collection, and adds
- * each object returned by the iterator to this collection, in turn.
+ * Retrieves and removes the head of this queue.
+ * This implementation returns the result of poll
+ * unless the queue is empty.
*
- * @param c collection whose elements are to be added to this queue
- * @return true if this collection changed as a result of the
- * call.
- * @throws NullPointerException if c or any element in c
- * is null
- *
+ * @return the head of this queue.
+ * @throws NoSuchElementException if this queue is empty.
*/
- public boolean addAll(Collection extends E> c) {
- return super.addAll(c);
- }
-
- /** @throws NoSuchElementException {@inheritDoc} */
public E remove() {
E x = poll();
if (x != null)
@@ -71,7 +74,15 @@ public abstract class AbstractQueue This implementation iterates over the specified collection,
+ * and adds each element returned by the iterator to this
+ * collection, in turn. A runtime exception encountered while
+ * trying to add an element (including, in particular, a
+ * null element) may result in only some of the elements
+ * having been successfully added when the associated exception is
+ * thrown.
+ *
+ * @param c collection whose elements are to be added to this collection.
+ * @return true if this collection changed as a result of the
+ * call.
+ * @throws NullPointerException if the specified collection, or
+ * any of its elements are null.
+ * @throws IllegalArgumentException if c is this queue.
+ *
+ * @see #add(Object)
+ */
+ public boolean addAll(Collection extends E> c) {
+ if (c == null)
+ throw new NullPointerException();
+ if (c == this)
+ throw new IllegalArgumentException();
+ boolean modified = false;
+ Iterator extends E> e = c.iterator();
+ while (e.hasNext()) {
+ if (add(e.next()))
+ modified = true;
+ }
+ return modified;
+ }
+}