2021-01-26关于java.util.concurrent.ArrayBlockingQueue(英文版)

最新推荐文章于 2025-08-09 15:58:26 发布

qq_43528792

最新推荐文章于 2025-08-09 15:58:26 发布

阅读量103

点赞数

CC 4.0 BY-SA版权

文章标签： java

本文链接：https://blog.csdn.net/qq_43528792/article/details/113173136

本文介绍了一种由数组支持的有界阻塞队列，该队列遵循先进先出(FIFO)原则。详细解释了队列头部和尾部的概念，并说明了插入和获取操作的行为。此外，还探讨了公平性策略对生产者和消费者线程的影响。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

中文版译文请查看方便对照，可能更好理解

1.introduction

A bounded blocking queue backed by an array.
This queue orders elements FIFO (first-in-first-out).
The head of the queue is that element that has been on the queue the longest time.
The tail of the queue is that element that has been on the queue the shortest time.
New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue.

This is a classic “bounded buffer”, in which a fixed-sized array holds elements inserted by producers and extracted by consumers.

Once created, the capacity cannot be changed.
Attempts to put an element into a full queue will result in the operation blocking; attempts to take an element from an empty queue will similarly block.

This class supports an optional fairness policy for ordering waiting producer and consumer threads.

By default, this ordering is not guaranteed.

However, a queue constructed with fairness set to true grants threads access in FIFO order. Fairness generally decreases throughput but reduces variability and avoids starvation.

This class and its iterator implement all of the optional methods of the Collection and Iterator interfaces.

This class is a member of the Java Collections Framework.

2.method

2.1 offer();

Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available. When using a capacity-restricted queue, this method is generally preferable to add, which can fail to insert an element only by throwing an exception.