生产者消费者模型

代码如下, 

package PandC;

import java.util.LinkedList;
import java.util.Random;
import java.util.function.Consumer;

/**
 * @author 
 * @date 2019/11/15 10:07
 */
public class TestThread {
    public static void main(String[] args) {
        LinkedList<String> content=new LinkedList<>();
        Consumer1 consumer1=new Consumer1("x1",content);
        Consumer1 consumer2=new Consumer1("x2",content);

        Product1 product1=new Product1(content,"p1");
        Product1 product2=new Product1(content,"p2");


       consumer1.start();
       consumer2.start();
       product1.start();
       product2.start();




    }

//    static class xiaofei extends  Thread{
//        private Consume consume;
//
//        public xiaofei(Consume consume) {
//            this.consume = consume;
//        }
//        public void run(){
//            while(true){
//             
    static class Consumer1 extends Thread{
        private LinkedList<String> linkedList;
        String name;


        public Consumer1(String name, LinkedList<String> linkedList) {
            super(name);
            this.name=name;
            this.linkedList=linkedList;
        }
        public void run(){
            while (true){
                synchronized (linkedList){
                    while(linkedList.size()<=0){
                        try {
                            linkedList.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    }
                    System.out.println("消费者 "+name +" 消费了:"+linkedList.removeFirst()+",,产品剩余:"+linkedList.size());
                   // System.out.println(linkedList);
                    linkedList.notify();
                }



            }

        }
    }
    static class Product1 extends Thread{
        private LinkedList<String> linkedList;
        String name;

        public Product1(LinkedList<String> linkedList, String name) {
            this.linkedList = linkedList;
            this.name = name;
        }

        public void run(){
            while(true){
                synchronized (linkedList){
                    while(linkedList.size()>=10){
                        try {
                            linkedList.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    }
                    Random random=new Random();
                    int i =random.nextInt(26)+65;

                    String x=(char)i+"";
                    linkedList.add(x);
                    System.out.println("生产者 "+name +" 生产了:"+x +",,产品剩余:"+linkedList.size());

                    //System.out.println(linkedList);
                    linkedList.notify();
                }


            }

        }
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值