| 1 |
|
/* |
| 2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
< |
* Expert Group and released to the public domain. Use, modify, and |
| 4 |
< |
* redistribute this code in any way without acknowledgement. |
| 3 |
> |
* Expert Group and released to the public domain, as explained at |
| 4 |
> |
* http://creativecommons.org/licenses/publicdomain |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
package java.util; |
| 19 |
|
* <p> A <tt>Queue</tt> implementation that extends this class must |
| 20 |
|
* minimally define a method {@link Queue#offer} which does not permit |
| 21 |
|
* insertion of <tt>null</tt> elements, along with methods {@link |
| 22 |
< |
* Queue#peek}, {@link Queue#poll}, {@link Collection#size}, {@link |
| 23 |
< |
* Collection#remove}, and a {@link Collection#iterator} supporting |
| 24 |
< |
* {@link Iterator#remove}. If these requirements cannot be met, |
| 25 |
< |
* consider instead subclassing {@link AbstractCollection}. |
| 22 |
> |
* Queue#peek}, {@link Queue#poll}, {@link Collection#size}, and a |
| 23 |
> |
* {@link Collection#iterator} supporting {@link |
| 24 |
> |
* Iterator#remove}. Typically, additional methods will be overridden |
| 25 |
> |
* as well. If these requirements cannot be met, consider instead |
| 26 |
> |
* subclassing {@link AbstractCollection}. |
| 27 |
|
* |
| 28 |
+ |
* <p>This class is a member of the |
| 29 |
+ |
* <a href="{@docRoot}/../guide/collections/index.html"> |
| 30 |
+ |
* Java Collections Framework</a>. |
| 31 |
+ |
* |
| 32 |
|
* @since 1.5 |
| 33 |
|
* @author Doug Lea |
| 34 |
+ |
* @param <E> the type of elements held in this collection |
| 35 |
|
*/ |
| 36 |
|
public abstract class AbstractQueue<E> |
| 37 |
|
extends AbstractCollection<E> |
| 43 |
|
protected AbstractQueue() { |
| 44 |
|
} |
| 45 |
|
|
| 40 |
– |
/** |
| 41 |
– |
* Inserts the specified element to this queue, if possible. |
| 42 |
– |
* |
| 43 |
– |
* @param o the element to add. |
| 44 |
– |
* @return <tt>true</tt> if it was possible to add the element to |
| 45 |
– |
* this queue, else <tt>false</tt> |
| 46 |
– |
* @throws NullPointerException if the specified element is <tt>null</tt> |
| 47 |
– |
*/ |
| 48 |
– |
public boolean offer(E o) { return false; } |
| 49 |
– |
// FIXME: Replace above no-op with following abstract version |
| 50 |
– |
// when javac allows it. |
| 51 |
– |
// public abstract boolean offer(E o); |
| 46 |
|
|
| 47 |
|
/** |
| 48 |
|
* Adds the specified element to this queue. This implementation |
| 49 |
|
* returns <tt>true</tt> if <tt>offer</tt> succeeds, else |
| 50 |
|
* throws an IllegalStateException. |
| 51 |
< |
* th |
| 51 |
> |
* |
| 52 |
|
* @param o the element |
| 53 |
|
* @return <tt>true</tt> (as per the general contract of |
| 54 |
|
* <tt>Collection.add</tt>). |
| 107 |
|
; |
| 108 |
|
} |
| 109 |
|
|
| 116 |
– |
// Declarations that mostly just remove optionality clauses. |
| 117 |
– |
|
| 118 |
– |
/** |
| 119 |
– |
* Removes a single instance of the specified element from this |
| 120 |
– |
* queue, if one is present. More formally, removes an element |
| 121 |
– |
* <tt>e</tt> such that <tt>(o==null ? e==null : |
| 122 |
– |
* o.equals(e))</tt>, if the queue contains such an element. |
| 123 |
– |
* Returns <tt>true</tt> if the queue contained the specified |
| 124 |
– |
* element (or equivalently, if the queue changed as a result of |
| 125 |
– |
* the call). |
| 126 |
– |
* |
| 127 |
– |
* @param o the element to remove |
| 128 |
– |
* @return true if the element was removed |
| 129 |
– |
*/ |
| 130 |
– |
public abstract boolean remove(Object o); |
| 131 |
– |
|
| 132 |
– |
/** |
| 133 |
– |
* Removes from this queue all of its elements that are contained in |
| 134 |
– |
* the specified collection. <p> |
| 135 |
– |
* |
| 136 |
– |
* This implementation iterates over this queue, checking each |
| 137 |
– |
* element returned by the iterator in turn to see if it's contained |
| 138 |
– |
* in the specified collection. If it's so contained, it's removed from |
| 139 |
– |
* this queue with the iterator's <tt>remove</tt> method.<p> |
| 140 |
– |
* |
| 141 |
– |
* @param c elements to be removed from this collection. |
| 142 |
– |
* @return <tt>true</tt> if this queue changed as a result of the |
| 143 |
– |
* call. |
| 144 |
– |
* @throws NullPointerException if the specified collection is null. |
| 145 |
– |
*/ |
| 146 |
– |
public boolean removeAll(Collection<?> c) { |
| 147 |
– |
return super.removeAll(c); |
| 148 |
– |
} |
| 149 |
– |
|
| 150 |
– |
/** |
| 151 |
– |
* Retains only the elements in this queue that are contained in the |
| 152 |
– |
* specified collection. In other words, removes |
| 153 |
– |
* from this queue all of its elements that are not contained in the |
| 154 |
– |
* specified collection. <p> |
| 155 |
– |
* |
| 156 |
– |
* This implementation iterates over this queue, checking each |
| 157 |
– |
* element returned by the iterator in turn to see if it's contained |
| 158 |
– |
* in the specified collection. If it's not so contained, it's removed |
| 159 |
– |
* from this queue with the iterator's <tt>remove</tt> method.<p> |
| 160 |
– |
* |
| 161 |
– |
* @param c elements to be retained in this collection. |
| 162 |
– |
* @return <tt>true</tt> if this queue changed as a result of the |
| 163 |
– |
* call. |
| 164 |
– |
* @throws NullPointerException if the specified collection is null. |
| 165 |
– |
* |
| 166 |
– |
*/ |
| 167 |
– |
public boolean retainAll(Collection<?> c) { |
| 168 |
– |
return super.retainAll(c); |
| 169 |
– |
} |
| 170 |
– |
|
| 110 |
|
/** |
| 111 |
|
* Adds all of the elements in the specified collection to this |
| 112 |
< |
* queue. The behavior of this operation is undefined if the |
| 113 |
< |
* specified collection is modified while the operation is in |
| 114 |
< |
* progress. (This implies that the behavior of this call is |
| 115 |
< |
* undefined if the specified collection is this queue, and this |
| 116 |
< |
* queue is nonempty.) |
| 117 |
< |
* |
| 118 |
< |
* <p> This implementation iterates over the specified collection, |
| 119 |
< |
* and uses the <tt>add</tt> method to insert each object returned by |
| 120 |
< |
* the iterator to this queue, in turn. |
| 112 |
> |
* queue. Attempts to addAll of a queue to itself result in |
| 113 |
> |
* <tt>IllegalArgumentException</tt>. Further, the behavior of |
| 114 |
> |
* this operation is undefined if the specified collection is |
| 115 |
> |
* modified while the operation is in progress. |
| 116 |
> |
* |
| 117 |
> |
* <p>This implementation iterates over the specified collection, |
| 118 |
> |
* and adds each element returned by the iterator to this |
| 119 |
> |
* collection, in turn. A runtime exception encountered while |
| 120 |
> |
* trying to add an element (including, in particular, a |
| 121 |
> |
* <tt>null</tt> element) may result in only some of the elements |
| 122 |
> |
* having been successfully added when the associated exception is |
| 123 |
> |
* thrown. |
| 124 |
|
* |
| 125 |
< |
* @param c collection whose elements are to be added to this queue |
| 126 |
< |
* @return <tt>true</tt> if this queue changed as a result of the |
| 125 |
> |
* @param c collection whose elements are to be added to this collection. |
| 126 |
> |
* @return <tt>true</tt> if this collection changed as a result of the |
| 127 |
|
* call. |
| 128 |
< |
* @throws NullPointerException if <tt>c</tt> or any element in <tt>c</tt> |
| 129 |
< |
* is <tt>null</tt> |
| 130 |
< |
* @throws IllegalStateException if any element cannot be added. |
| 128 |
> |
* @throws NullPointerException if the specified collection or |
| 129 |
> |
* any of its elements are null. |
| 130 |
> |
* @throws IllegalArgumentException if c is this queue. |
| 131 |
|
* |
| 132 |
+ |
* @see #add(Object) |
| 133 |
|
*/ |
| 134 |
|
public boolean addAll(Collection<? extends E> c) { |
| 135 |
< |
return super.addAll(c); |
| 135 |
> |
if (c == null) |
| 136 |
> |
throw new NullPointerException(); |
| 137 |
> |
if (c == this) |
| 138 |
> |
throw new IllegalArgumentException(); |
| 139 |
> |
boolean modified = false; |
| 140 |
> |
Iterator<? extends E> e = c.iterator(); |
| 141 |
> |
while (e.hasNext()) { |
| 142 |
> |
if (add(e.next())) |
| 143 |
> |
modified = true; |
| 144 |
> |
} |
| 145 |
> |
return modified; |
| 146 |
|
} |
| 147 |
|
|
| 148 |
|
} |
