7 |
|
package java.util; |
8 |
|
|
9 |
|
/** |
10 |
< |
* <tt>AbstractQueue</tt> provides default implementations of |
11 |
< |
* {@link #add add}, {@link #remove remove}, and {@link #element element} |
12 |
< |
* based on |
13 |
< |
* {@link #offer offer}, {@link #poll poll}, and {@link #peek peek}, |
14 |
< |
* respectively but that |
15 |
< |
* throw exceptions instead of indicating failure via <tt>false</tt> or |
10 |
> |
* <tt>AbstractQueue</tt> provides default implementations of |
11 |
> |
* {@link #add add}, {@link #remove remove}, and {@link #element element} |
12 |
> |
* based on |
13 |
> |
* {@link #offer offer}, {@link #poll poll}, and {@link #peek peek}, |
14 |
> |
* respectively but that |
15 |
> |
* throw exceptions instead of indicating failure via <tt>false</tt> or |
16 |
|
* <tt>null</tt> returns. |
17 |
|
* <p>The provided implementations all assume that the base implementation |
18 |
|
* does <em>not</em> allow <tt>null</tt> elements. |
19 |
|
* @since 1.5 |
20 |
|
* @author Doug Lea |
21 |
|
*/ |
22 |
< |
public abstract class AbstractQueue<E> |
23 |
< |
extends AbstractCollection<E> |
22 |
> |
public abstract class AbstractQueue<E> |
23 |
> |
extends AbstractCollection<E> |
24 |
|
implements Queue<E> { |
25 |
|
|
26 |
|
// note that optional methods are not optional here or in our subclasses, |
29 |
|
|
30 |
|
/** |
31 |
|
* Adds the specified element to this queue. |
32 |
< |
* @return <tt>true</tt> (as per the general contract of |
32 |
> |
* @return <tt>true</tt> (as per the general contract of |
33 |
|
* <tt>Collection.add</tt>). |
34 |
|
* |
35 |
|
* @throws NullPointerException if the element is null |
55 |
|
* @return <tt>true</tt> if this collection changed as a result of the |
56 |
|
* call. |
57 |
|
* @throws NullPointerException if <tt>c</tt> is <tt>null</tt> |
58 |
< |
* |
58 |
> |
* |
59 |
|
*/ |
60 |
< |
boolean addAll(Collection<? extends E> c) { |
60 |
> |
public boolean addAll(Collection<? extends E> c) { |
61 |
|
return super.addAll(c); |
62 |
|
} |
63 |
|
|