5 |
|
*/ |
6 |
|
|
7 |
|
package java.util.concurrent; |
8 |
< |
import java.util.*; |
8 |
> |
import java.util.*; |
9 |
|
|
10 |
|
/** |
11 |
|
* A {@link Deque} that additionally supports operations that wait for |
31 |
|
* <td>{@link #putFirst putFirst(e)}</td> |
32 |
|
* <td>{@link #offerFirst(Object, long, TimeUnit) offerFirst(e, time, unit)}</td> |
33 |
|
* <td>{@link #putLast putLast(e)}</td> |
34 |
< |
* <td>{@link #offerLast(Object, long, TimeUnit) offerLast(e, time, unit)}</td> |
34 |
> |
* <td>{@link #offerLast(Object, long, TimeUnit) offerLast(e, time, unit)}</td> |
35 |
|
* </tr> |
36 |
|
* <tr> |
37 |
|
* <td><b>Remove</b></td> |
193 |
|
*/ |
194 |
|
void put(E o) throws InterruptedException; |
195 |
|
|
196 |
< |
/** |
196 |
> |
/** |
197 |
|
* Inserts the specified element as the lest element of this |
198 |
|
* deque, if possible. When using deques that may impose |
199 |
|
* insertion restrictions (for example capacity bounds), method |