Java多线程学习之:BlockingQueue实现生产者消费者

PCCommon:

public class PCCommon {
	private BlockingQueue<User> queue = new LinkedBlockingQueue<User>();
	//生产
	public void productData(User user){
		queue.add(user);
	}
	//消费
	public void consumerData(){
		User user = queue.poll();
		if(user != null){
			System.out.println("userid:"+user.getUserid());
			System.out.println("username:"+user.getUsername());
		}
	}
}

ConsumerThread:

public class ConsumerThread extends Thread{
	private PCCommon pcService;
	public ConsumerThread(PCCommon pcService){
		this.pcService=pcService;
	}
	@Override
	public void run(){
		while(true){
			pcService.consumerData();
		}
	}
}

PCTest:

public class PCTest {
	public static void main(String[] args){
		PCCommon pc = new PCCommon();
		ConsumerThread ct1 = new ConsumerThread(pc);
		ConsumerThread ct2 = new ConsumerThread(pc);
		ConsumerThread ct3 = new ConsumerThread(pc);
		ct1.start();
		ct2.start();
		ct3.start();
		User user1 = new User();
		user1.setUserid(1);
		user1.setUsername("username1");
		pc.productData(user1);
		
		User user2 = new User();
		user2.setUserid(2);
		user2.setUsername("username2");
		pc.productData(user2);
		
		User user3 = new User();
		user3.setUserid(3);
		user3.setUsername("username3");
		pc.productData(user3);
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
可以使用Java中的BlockingQueue实现消费者生产者问题。BlockingQueue是一个线程安全的队列,它提供了put()和take()方法,分别用于生产和消费。当队列为空时,take()方法会阻塞线程,直到队列中有元素;当队列满时,put()方法会阻塞线程,直到队列中有空闲位置。 以下是一个简单的示例代码: import java.util.concurrent.BlockingQueue; import java.util.concurrent.LinkedBlockingQueue; public class ProducerConsumerExample { private static final int QUEUE_CAPACITY = 10; private static final int NUM_PRODUCERS = 2; private static final int NUM_CONSUMERS = 3; public static void main(String[] args) { BlockingQueue<Integer> queue = new LinkedBlockingQueue<>(QUEUE_CAPACITY); for (int i = 0; i < NUM_PRODUCERS; i++) { new Thread(new Producer(queue)).start(); } for (int i = 0; i < NUM_CONSUMERS; i++) { new Thread(new Consumer(queue)).start(); } } static 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 = 0; i < 10; i++) { queue.put(i); System.out.println("Produced: " + i); Thread.sleep(1000); } } catch (InterruptedException e) { e.printStackTrace(); } } } static 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(); System.out.println("Consumed: " + value); Thread.sleep(2000); } } catch (InterruptedException e) { e.printStackTrace(); } } } }

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值