在Java中如何使用BlockingQueue实现生产者消费者模式_BlockingQueue操作实践经验

<font face="Courier New,Courier,monospace">
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.ArrayBlockingQueue;

public class ProducerConsumerExample {
    private static final int QUEUE_CAPACITY = 5;

    public static void main(String[] args) {
        BlockingQueue<Integer> queue = new ArrayBlockingQueue<>(QUEUE_CAPACITY);

        Thread producer = new Thread(new Producer(queue));
        Thread consumer = new Thread(new Consumer(queue));

        producer.start();
        consumer.start();
    }
}

class Producer implements Runnable {
    private final BlockingQueue<Integer> queue;

    public Producer(BlockingQueue<Integer> queue) {
        this.queue = queue;
    }

    @Override
    public void run() {
        try {
            for (int i = 1; i <= 10; i++) {
                System.out.println("生产者放入: " + i);
                queue.put(i); // 自动阻塞
                Thread.sleep(500); // 模拟生产耗时
            }
            queue.put(-1); // 发送结束信号
        } catch (InterruptedException e) {
            Thread.currentThread().interrupt();
        }
    }
}

class Consumer implements Runnable {
    private final BlockingQueue<Integer> queue;

    public Consumer(BlockingQueue<Integer> queue) {
        this.queue = queue;
    }

    @Override
    public void run() {
        try {
            while (true) {
                Integer value = queue.take();
                if (value == -1) {
                    System.out.println("消费者收到结束信号，退出");
                    break;
                }
                System.out.println("消费者取出: " + value);
                Thread.sleep(800); // 模拟消费耗时
            }
        } catch (InterruptedException e) {
            Thread.currentThread().interrupt();
        }
    }
}
</font>

<font face="Courier New,Courier,monospace">
ExecutorService executor = Executors.newFixedThreadPool(3);
executor.submit(new Producer(queue));
executor.submit(new Consumer(queue));
executor.submit(new Consumer(queue)); // 多个消费者
</font>