| 6 |
|
|
| 7 |
|
package jsr166x; // XXX This belongs in java.util!!! XXX |
| 8 |
|
import java.util.concurrent.*; // XXX This import goes away XXX |
| 9 |
< |
import java.util.*; |
| 9 |
> |
import java.util.*; |
| 10 |
|
|
| 11 |
|
/** |
| 12 |
|
* A {@link Deque} that additionally supports operations that wait for |
| 32 |
|
* <td>{@link #putFirst putFirst(e)}</td> |
| 33 |
|
* <td>{@link #offerFirst(Object, long, TimeUnit) offerFirst(e, time, unit)}</td> |
| 34 |
|
* <td>{@link #putLast putLast(e)}</td> |
| 35 |
< |
* <td>{@link #offerLast(Object, long, TimeUnit) offerLast(e, time, unit)}</td> |
| 35 |
> |
* <td>{@link #offerLast(Object, long, TimeUnit) offerLast(e, time, unit)}</td> |
| 36 |
|
* </tr> |
| 37 |
|
* <tr> |
| 38 |
|
* <td><b>Remove</b></td> |
| 194 |
|
*/ |
| 195 |
|
void put(E o) throws InterruptedException; |
| 196 |
|
|
| 197 |
< |
/** |
| 197 |
> |
/** |
| 198 |
|
* Inserts the specified element as the lest element of this |
| 199 |
|
* deque, if possible. When using deques that may impose |
| 200 |
|
* insertion restrictions (for example capacity bounds), method |
| 214 |
|
/** |
| 215 |
|
* Retrieves and removes the first element of this deque, waiting |
| 216 |
|
* if no elements are present on this deque. |
| 217 |
< |
* This method is equivalent to to takeFirst |
| 217 |
> |
* This method is equivalent to to takeFirst |
| 218 |
|
* @return the head of this deque |
| 219 |
|
* @throws InterruptedException if interrupted while waiting. |
| 220 |
|
*/ |
