Java实现生产者与消费者模型

生产者

package org.lulu.learn;

import java.util.HashSet;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.LinkedBlockingDeque;

/**
 * Project: Day09
 * Created: Lulu
 * Date: 2016/8/6
 *
 * 生产者和消费者模型
 */
public class Test02 {
    public static void main(String[] args) {
        //ArrayDeque是线程不安全的,不能使用
        Queue queue = new LinkedBlockingDeque();//仓库
//        boolean[] isFinish = {false};
        Set<Thread> creators = new HashSet<>();
        Creator creator = new Creator(queue, creators);
        Customer customer = new Customer(queue, creators);
        new Thread(creator, "生产者 1").start();
        new Thread(creator, "生产者 2").start();
        new Thread(creator, "生产者 3").start();
        while (creators.isEmpty()) {
            try {
                Thread.sleep(10);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        new Thread(customer).start();
        new Thread(customer).start();
        new Thread(customer).start();
    }
}

消费者

package org.lulu.learn;

import java.util.Queue;
import java.util.Set;

/**
 * Project: Day09
 * Created: Lulu
 * Date: 2016/8/6
 */
public class Customer implements Runnable {
    private Queue<String> queue;
    //生产是否完成的变量 bool类型的引用
//    private boolean[] isFinsh;
    private Set<Thread> creators;

    public Customer(Queue<String> queue, Set<Thread> creators) {
        this.queue = queue;
//        this.isFinsh = isFinsh;
        this.creators = creators;
    }

    @Override
    public void run() {
        while (true) {

            try {
                Thread.sleep(100);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }

            synchronized (queue) {

                if (queue.isEmpty()) {
                    if (creators.isEmpty()) {
                        break;
                    } else {
                        try {
                            queue.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    }
                } else {
                    System.out.println("消费了" + queue.poll());
                }
            }
        }
    }

}

测试类

package org.lulu.learn;

import java.util.HashSet;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.LinkedBlockingDeque;

/**
 * Project: Day09
 * Created: Lulu
 * Date: 2016/8/6
 *
 * 生产者和消费者模型
 */
public class Test02 {
    public static void main(String[] args) {
        //ArrayDeque是线程不安全的,不能使用
        Queue queue = new LinkedBlockingDeque();//仓库
//        boolean[] isFinish = {false};
        Set<Thread> creators = new HashSet<>();
        Creator creator = new Creator(queue, creators);
        Customer customer = new Customer(queue, creators);
        new Thread(creator, "生产者 1").start();
        new Thread(creator, "生产者 2").start();
        new Thread(creator, "生产者 3").start();
        while (creators.isEmpty()) {
            try {
                Thread.sleep(10);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        new Thread(customer).start();
        new Thread(customer).start();
        new Thread(customer).start();
    }
}

效果图:
这里写图片描述

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值