ProducerConsumerDemo

本文提供了一个使用Java实现的生产者消费者模式示例。通过一个缓冲区,多个生产者线程向缓冲区中添加随机整数,而多个消费者线程从缓冲区中移除这些整数。该示例展示了如何利用synchronized关键字来协调生产和消费行为。

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

package com.my.demo;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Random;
import java.util.Scanner;

public class ProducerConsumerDemo {
	public static void main(String args[]) {
		LinkedList<Integer> buffer = new LinkedList<>();
		new Producer(buffer, "P1").start();
		new Consumer(buffer, "C1").start();
		new Consumer(buffer, "C2").start();
		new Consumer(buffer, "C3").start();
	}
}

class Producer extends Thread {
	private LinkedList<Integer> list;

	public Producer(LinkedList<Integer> list, String name) {
		super(name);
		this.list = list;
	}

	@Override
	public void run() {
		try {
			Scanner scanner = new Scanner(System.in);
			while (true) {
				String line = scanner.nextLine();
				if (line.startsWith("p")) {//produce. example: p8->produce 8 items
					fillList(Integer.parseInt(line.substring(1)));
				} else if (line.startsWith("b")) {//break producer.
					break;
				}
			}
			scanner.close();
			System.out.println(getName() + " exit.");
		} catch (Exception e) {
			System.out.println(getName() + " Producer exception.");
		}
	}
	
	private void fillList(int count) {
		synchronized (list) {
			for (int n = 0; n < count; n++) {
				//如果list已满,则等待
				if (list.size() >= 20) {
					try {
						System.out.println(getName() + " List is full, Producer wait.");
						list.wait();
					} catch (Exception ex) {
						ex.printStackTrace();
					}
				}
				
				//如果list没有满,则继续生产
				Random random = new Random();
				int i = random.nextInt(90) + 10;
				list.add(i);
				list.notifyAll();
			}
		}
	}
}

class Consumer extends Thread {
	private LinkedList<Integer> list;

	public Consumer(LinkedList<Integer> list, String name) {
		super(name);
		this.list = list;
	}

	@Override
	public void run() {
		while (true) {
			synchronized (list) {
				if (list.isEmpty()) {
					System.out.println(getName() + " List is empty, Consumer wait.");
					try {
						list.wait();
					} catch (Exception ex) {
						ex.printStackTrace();
					}
				}
				System.out.println(getName() + " Consuming: " + list.removeLast() + ", list.size=" + list.size() + ", list=" + Arrays.toString(list.toArray()));
				list.notifyAll();
			}
			try {
				Thread.sleep(200);
			} catch (InterruptedException e) {
				System.out.println(getName() + " Consumer interrupted");
			}
		}
	}
}

 

转载于:https://my.oschina.net/itblog/blog/1491147

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值