| 9 |
|
import java.util.*; |
| 10 |
|
|
| 11 |
|
/** |
| 12 |
< |
* An unbounded queue based on linked nodes. |
| 12 |
> |
* An optionally-bounded blocking queue based on linked nodes. Linked |
| 13 |
> |
* queues typically have higher throughput than array-based queues but |
| 14 |
> |
* less predicatble performance in most concurrent applications. |
| 15 |
> |
* |
| 16 |
> |
* <p> The optional capacity bound constructor argument serves as a |
| 17 |
> |
* way to prevent unlmited queue expansion. Linked nodes are |
| 18 |
> |
* dynamically created upon each insertion unless this would bring the |
| 19 |
> |
* queue above capacity. |
| 20 |
> |
* |
| 21 |
|
**/ |
| 22 |
|
public class LinkedBlockingQueue<E> extends AbstractQueue<E> |
| 23 |
|
implements BlockingQueue<E>, java.io.Serializable { |
