18 |
|
* implementations; in most implementations, insert operations cannot |
19 |
|
* fail. |
20 |
|
* |
21 |
– |
* <p> |
21 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
22 |
|
* <caption>Summary of Queue methods</caption> |
23 |
|
* <tr> |
27 |
|
* </tr> |
28 |
|
* <tr> |
29 |
|
* <td><b>Insert</b></td> |
30 |
< |
* <td>{@link #add add(e)}</td> |
31 |
< |
* <td>{@link #offer offer(e)}</td> |
30 |
> |
* <td>{@link Queue#add add(e)}</td> |
31 |
> |
* <td>{@link Queue#offer offer(e)}</td> |
32 |
|
* </tr> |
33 |
|
* <tr> |
34 |
|
* <td><b>Remove</b></td> |
35 |
< |
* <td>{@link #remove remove()}</td> |
36 |
< |
* <td>{@link #poll poll()}</td> |
35 |
> |
* <td>{@link Queue#remove remove()}</td> |
36 |
> |
* <td>{@link Queue#poll poll()}</td> |
37 |
|
* </tr> |
38 |
|
* <tr> |
39 |
|
* <td><b>Examine</b></td> |
40 |
< |
* <td>{@link #element element()}</td> |
41 |
< |
* <td>{@link #peek peek()}</td> |
40 |
> |
* <td>{@link Queue#element element()}</td> |
41 |
> |
* <td>{@link Queue#peek peek()}</td> |
42 |
|
* </tr> |
43 |
|
* </table> |
44 |
|
* |
100 |
|
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
101 |
|
* Java Collections Framework</a>. |
102 |
|
* |
104 |
– |
* @see java.util.Collection |
105 |
– |
* @see LinkedList |
106 |
– |
* @see PriorityQueue |
107 |
– |
* @see java.util.concurrent.LinkedBlockingQueue |
108 |
– |
* @see java.util.concurrent.BlockingQueue |
109 |
– |
* @see java.util.concurrent.ArrayBlockingQueue |
110 |
– |
* @see java.util.concurrent.LinkedBlockingQueue |
111 |
– |
* @see java.util.concurrent.PriorityBlockingQueue |
103 |
|
* @since 1.5 |
104 |
|
* @author Doug Lea |
105 |
< |
* @param <E> the type of elements held in this collection |
105 |
> |
* @param <E> the type of elements held in this queue |
106 |
|
*/ |
107 |
|
public interface Queue<E> extends Collection<E> { |
108 |
|
/** |