首页 > 其他 > 详细

简单生产消费模型

时间:2019-11-26 11:53:41      阅读:84      评论:0      收藏:0      [点我收藏+]
import java.util.Queue;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.LinkedBlockingQueue;

public class Application {
    final static int TASKCOUNT = 20;

    public static void main(String args[]) {
        CountDownLatch locked = new CountDownLatch(TASKCOUNT);
        Queue<Integer> queue = new LinkedBlockingQueue<>(TASKCOUNT);
        Producer producer = new Producer(locked, queue, TASKCOUNT);
        Consumer comsumer1 = new Consumer(locked, queue);
//        Consumer comsumer2 = new Consumer(locked, queue);
        new Thread(producer).start();
        new Thread(comsumer1).start();
        new Thread(comsumer1).start();
        System.out.println("主线程结束");
    }
}

class Producer implements Runnable {

    CountDownLatch locked;
    Queue<Integer> queue;
    int count;

    public Producer(CountDownLatch locked, Queue<Integer> queue, int count) {
        this.locked = locked;
        this.queue = queue;
        this.count = count;
    }

    @Override
    public void run() {
        for (int i = 0; i < 20; i++) {
            this.queue.add(i);
            this.locked.countDown();
        }
    }
}

class Consumer implements Runnable {

    CountDownLatch locked;
    Queue<Integer> queue;

    public Consumer(CountDownLatch locked, Queue<Integer> queue) {
        this.locked = locked;
        this.queue = queue;
    }
    
    @Override
    public void run() {
        try {
            this.locked.await();
            while (true) {
                if (this.queue.isEmpty()) {
                    break;
                }
                System.out.println(String.format("ThreadId = %s, Task = %s ", Thread.currentThread().getId(), this.queue.poll()));
            }
        } catch (InterruptedException e) {
            e.printStackTrace();
        } finally {
            System.out.println(Thread.currentThread().getId() + "线程结束");
        }
    }
}

 

简单生产消费模型

原文:https://www.cnblogs.com/fqybzhangji/p/11934140.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!