Condition机制实现生产-消费者模型:
import javax.swing.*;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
class Goods1{
private String name;
private int count;
private int maxCount;
public Goods1(int maxCount){
this.maxCount = maxCount;
}
private Lock lock = new ReentrantLock();
private Condition consumer = lock.newCondition();
private Condition producer = lock.newCondition();
//生产方法
public void setGoods(String name) {
lock.lock();
//当商品数量已达最大,等待消费者消费
try {
while (count == maxCount){
System.out.println(Thread.currentThread().getName()+
"商品数已达最大,等待消费者消费");
producer.await();
}
Thread.sleep(200);
//生产商品
this.name = name;
count++;
System.out.println(Thread.currentThread().getName()+
"生产"+toString());
//唤醒消费者线程
consumer.signalAll();
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
lock.unlock();
}
}
//消费方法
public void getGoods(){
lock.lock();
//商品数为0时阻塞消费者线程
try {
while(count == 0){
System.out.println(Thread.currentThread().getName()+
"商品已经被消费完,等待生产者生产");
consumer.await();
}
Thread.sleep(200);
count--;
System.out.println(Thread.currentThread().getName()+
"消费"+toString());
//唤醒生产者线程
producer.signalAll();
} catch (InterruptedException e) {
e.printStackTrace();
} finally {
lock.unlock();
}
}
@Override
public String toString() {
return "Goods{"+
"name='"+name+'\''+
",count=" +count +
'}';
}
}
//生产者
class Producer1 implements Runnable{
private Goods1 goods;
public Producer1(Goods1 goods) {
this.goods = goods;
}
@Override
public void run() {
while (true){
this.goods.setGoods("口红");
}
}
}
//消费者
class Consumer1 implements Runnable{
private Goods1 goods;
Consumer1(Goods1 goods) {
this.goods = goods;
}
@Override
public void run() {
while (true){
this.goods.getGoods();
}
}
}
public class ConditionPC {
public static void main(String[] args) {
List list = new ArrayList<>();
Goods1 goods = new Goods1(10);
Producer1 producer1 = new Producer1(goods);
Consumer1 consumer1 = new Consumer1(goods);
//10个消费者线程
for (int i = 0; i < 10; i++) {
Thread thread = new Thread(consumer1,"生产者"+i);
list.add(thread);
}
//5个生产者线程
for (int i = 0; i < 10; i++) {
Thread thread = new Thread(producer1,"生产者"+i);
list.add(thread);
}
for (Thread thread :list) {
thread.start();
}
}
}
1048

被折叠的 条评论
为什么被折叠?



