| 14 |
|
* sometimes (using method {@link #transfer}) await receipt of |
| 15 |
|
* elements by consumers invoking {@code take} or {@code poll}, while |
| 16 |
|
* at other times enqueue elements (via method {@code put}) without |
| 17 |
< |
* waiting for receipt. {@linkplain |
| 18 |
< |
* #tryTransfer(Object) Non-blocking} and {@linkplain |
| 19 |
< |
* #tryTransfer(Object,long,TimeUnit) time-out} versions of {@code |
| 20 |
< |
* tryTransfer} are also available. A {@code TransferQueue} may also |
| 21 |
< |
* be queried, via {@link #hasWaitingConsumer}, whether there are any |
| 22 |
< |
* threads waiting for items, which is a converse analogy to a {@code |
| 23 |
< |
* peek} operation. |
| 17 |
> |
* waiting for receipt. |
| 18 |
> |
* {@linkplain #tryTransfer(Object) Non-blocking} and |
| 19 |
> |
* {@linkplain #tryTransfer(Object,long,TimeUnit) time-out} versions of |
| 20 |
> |
* {@code tryTransfer} are also available. |
| 21 |
> |
* A {@code TransferQueue} may also be queried, via {@link |
| 22 |
> |
* #hasWaitingConsumer}, whether there are any threads waiting for |
| 23 |
> |
* items, which is a converse analogy to a {@code peek} operation. |
| 24 |
|
* |
| 25 |
|
* <p>Like other blocking queues, a {@code TransferQueue} may be |
| 26 |
|
* capacity bounded. If so, an attempted transfer operation may |
