| 20 |
|
* <p>This is a classic "bounded buffer", in which a |
| 21 |
|
* fixed-sized array holds elements inserted by producers and |
| 22 |
|
* extracted by consumers. Once created, the capacity cannot be |
| 23 |
< |
* increased. Attempts to offer an element to a full queue will |
| 24 |
< |
* result in the offer operation blocking; attempts to retrieve an |
| 23 |
> |
* increased. Attempts to put an element to a full queue will |
| 24 |
> |
* result in the put operation blocking; attempts to retrieve an |
| 25 |
|
* element from an empty queue will similarly block. |
| 26 |
|
* |
| 27 |
|
* <p> This class supports an optional fairness policy for ordering |
