java 生成者消费者模型范例

最新推荐文章于 2022-04-21 16:47:25 发布
最新推荐文章于 2022-04-21 16:47:25 发布
阅读量328 收藏
点赞数
分类专栏： Java多线程 文章标签： 生成者消费者模式
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/zhengzizhi/article/details/85072761
版权

范例1：

package com.contoso;

public class App {

    public static void main(String[] args) {
        Processor processor = new Processor();
        Thread t1 = new Thread(new Runnable() {
            @Override
            public void run() {
                try {
                    processor.produce();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        });

        Thread t2 = new Thread(new Runnable() {
            @Override
            public void run() {
                try {
                    processor.consume();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        });

        t1.start();
        t2.start();
        try {
            Thread.sleep(5000); // 让主线程暂停5秒
            System.exit(0); // 强制退出死循环应用程序
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }

}

package com.contoso;

import java.util.LinkedList;
import java.util.Random;

public class Processor {

    private LinkedList<Integer> list = new LinkedList<>();
    private final int LIMIT = 10;
    private final Object lock = new Object();

    public void produce() throws InterruptedException {
        int value = 0;
        while (true) {
            synchronized (lock) {               
                while (list.size() == LIMIT) {
                    lock.wait();
                }
                list.add(value);

                System.out.println("Producer added: " + value + " queue size is " + list.size());
                value++;
                lock.notify();
            }
        }
    }

    public void consume() throws InterruptedException {
        Random random = new Random();
        while (true) {
            synchronized (lock) {
                while (list.size() == 0) {
                    lock.wait();
                }

                int value = list.removeFirst();
                System.out.print("Removed value by consumer is: " + value);
                System.out.println(" Now list size is: " + list.size());
                lock.notify();
            }
            Thread.sleep(random.nextInt(1000)); //force producer fill the queue to LIMIT_SIZE
        }
    }
}

run:
Producer added: 0 queue size is 1
Removed value by consumer is: 0 Now list size is: 0
Producer added: 1 queue size is 1
Producer added: 2 queue size is 2
Producer added: 3 queue size is 3
Producer added: 4 queue size is 4
Producer added: 5 queue size is 5
Producer added: 6 queue size is 6
Producer added: 7 queue size is 7
Producer added: 8 queue size is 8
Producer added: 9 queue size is 9
Producer added: 10 queue size is 10
Removed value by consumer is: 1 Now list size is: 9
Producer added: 11 queue size is 10
Removed value by consumer is: 2 Now list size is: 9
Producer added: 12 queue size is 10
Removed value by consumer is: 3 Now list size is: 9
Producer added: 13 queue size is 10
Removed value by consumer is: 4 Now list size is: 9
Producer added: 14 queue size is 10
Removed value by consumer is: 5 Now list size is: 9
Producer added: 15 queue size is 10
Removed value by consumer is: 6 Now list size is: 9
Producer added: 16 queue size is 10
Removed value by consumer is: 7 Now list size is: 9
Producer added: 17 queue size is 10
Removed value by consumer is: 8 Now list size is: 9
Producer added: 18 queue size is 10
Removed value by consumer is: 9 Now list size is: 9
Producer added: 19 queue size is 10
Removed value by consumer is: 10 Now list size is: 9
Producer added: 20 queue size is 10
Removed value by consumer is: 11 Now list size is: 9
Producer added: 21 queue size is 10
BUILD SUCCESSFUL (total time: 5 seconds)

范例2：

package com.contoso;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

class BlockingQueue<T> {

    private Queue<T> queue = new LinkedList<>();
    private int capacity;
    private Lock lock = new ReentrantLock();
    //condition variables
    private Condition notFull = lock.newCondition();
    private Condition notEmpty = lock.newCondition();

    public BlockingQueue(int capacity) {
        this.capacity = capacity;
    }

    public void put(T element) throws InterruptedException {
        lock.lock();
        try {
            while (queue.size() == capacity) {
                System.out.println("queue is full cannot put");
                notFull.await(); //releases lock
            }

            queue.add(element);
            System.out.println("Added to the queue " + element);
            notEmpty.signal(); //calls waiting thread on the same object
        } finally {
            lock.unlock();
        }
    }

    public T take() throws InterruptedException {
        lock.lock();
        try {
            while (queue.isEmpty()) {
                System.out.println("queue is empty, cannot take");
                notEmpty.await(); //releases lock
            }

            T item = queue.remove();
            System.out.println("Removed to the queue " + item);
            notFull.signal(); //calls waiting thread on same object
            return item;
        } finally {
            lock.unlock();
        }
    }
}

public class BlockingQueueApp {

    public static void main(String[] args) {
        BlockingQueue<Integer> blockingQueue = new BlockingQueue<>(10);
        Random random = new Random();
        Thread t1 = new Thread(new Runnable() {
            public void run() {
                try {
                    while (true) {
                        blockingQueue.put(random.nextInt(10));
                    }
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        });

        Thread t2 = new Thread(new Runnable() {
            public void run() {
                try {
                    Thread.sleep(1000);//wait for putting to the queue first
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                try {
                    while (true) {
                        blockingQueue.take();
                    }
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        });
        t1.start();
        t2.start();
        try {
            Thread.sleep(1200); // 让主线程暂停1.2秒
            System.exit(0); // 强制退出死循环应用程序
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
}
run:
Added to the queue 4
Added to the queue 4
Added to the queue 7
Added to the queue 4
Added to the queue 4
Added to the queue 3
Added to the queue 5
Added to the queue 6
Added to the queue 5
Added to the queue 1
queue is full cannot put
Removed to the queue 4
Removed to the queue 4
Removed to the queue 7
Removed to the queue 4
Removed to the queue 4
Removed to the queue 3
Removed to the queue 5
Removed to the queue 6
Removed to the queue 5
Removed to the queue 1
queue is empty, cannot take
Added to the queue 0
Added to the queue 6
Added to the queue 1
Added to the queue 4
Added to the queue 2
Added to the queue 1
Added to the queue 4
Removed to the queue 0
Removed to the queue 6
Removed to the queue 1
Removed to the queue 4
Removed to the queue 2
Removed to the queue 1
Removed to the queue 4
queue is empty, cannot take
Added to the queue 2
Added to the queue 0
Added to the queue 7
Added to the queue 0
Added to the queue 5
Added to the queue 5
Added to the queue 9
Added to the queue 9
Added to the queue 8
Added to the queue 1
queue is full cannot put
Removed to the queue 2
Removed to the queue 0
Removed to the queue 7
Removed to the queue 0
Removed to the queue 5
Removed to the queue 5
Removed to the queue 9
Removed to the queue 9
Removed to the queue 8
Removed to the queue 1
queue is empty, cannot take
Added to the queue 4
Added to the queue 1
Added to the queue 0
Added to the queue 8
Added to the queue 3
Added to the queue 4
Added to the queue 7
Added to the queue 2
Added to the queue 2
Added to the queue 2
queue is full cannot put
Removed to the queue 4
Removed to the queue 1
Removed to the queue 0
Removed to the queue 8
Removed to the queue 3
Removed to the queue 4
Removed to the queue 7
Removed to the queue 2
Removed to the queue 2
Removed to the queue 2
queue is empty, cannot take
Added to the queue 2
Added to the queue 8
Added to the queue 9
Added to the queue 9
Added to the queue 2
Added to the queue 7
Added to the queue 6
Added to the queue 7
Added to the queue 3
Added to the queue 2
queue is full cannot put
Removed to the queue 2
Removed to the queue 8
Removed to the queue 9
Removed to the queue 9
Removed to the queue 2
Removed to the queue 7
Removed to the queue 6
Removed to the queue 7
Removed to the queue 3
Removed to the queue 2
queue is empty, cannot take
Added to the queue 8
Added to the queue 6
Added to the queue 9
Added to the queue 6
Added to the queue 6
Added to the queue 5
Added to the queue 0
Added to the queue 8
Added to the queue 0
Added to the queue 9
queue is full cannot put
Removed to the queue 8
Removed to the queue 6
Removed to the queue 9
Removed to the queue 6
Removed to the queue 6
Removed to the queue 5
Removed to the queue 0
Removed to the queue 8
Removed to the queue 0
Removed to the queue 9
queue is empty, cannot take
Added to the queue 6
Added to the queue 7
Added to the queue 2
Added to the queue 1
Added to the queue 5
Added to the queue 7
Added to the queue 5
Added to the queue 7
Added to the queue 3
Added to the queue 2
queue is full cannot put
Removed to the queue 6
Removed to the queue 7
Removed to the queue 2
Removed to the queue 1
Removed to the queue 5
Removed to the queue 7
Removed to the queue 5
Removed to the queue 7
Removed to the queue 3
Removed to the queue 2
queue is empty, cannot take
Added to the queue 8
Added to the queue 3
Added to the queue 7
Added to the queue 0
Added to the queue 7
Added to the queue 8
Added to the queue 8
Added to the queue 2
Added to the queue 8
Added to the queue 3
queue is full cannot put
Removed to the queue 8
Removed to the queue 3
Removed to the queue 7
Removed to the queue 0
Removed to the queue 7
Removed to the queue 8
Removed to the queue 8
Removed to the queue 2
Removed to the queue 8
Removed to the queue 3
queue is empty, cannot take
Added to the queue 9
Added to the queue 6
Added to the queue 2
Added to the queue 9
Added to the queue 2
Added to the queue 6
Added to the queue 9
Added to the queue 6
Added to the queue 0
Added to the queue 7
queue is full cannot put
Removed to the queue 9
Removed to the queue 6
Removed to the queue 2
Removed to the queue 9
Removed to the queue 2
Removed to the queue 6
Removed to the queue 9
Removed to the queue 6
Removed to the queue 0
Removed to the queue 7
queue is empty, cannot take
Added to the queue 2
Added to the queue 7
Added to the queue 7
Added to the queue 9
Added to the queue 4
Added to the queue 7
Added to the queue 9
Added to the queue 0
Added to the queue 6
Added to the queue 5
queue is full cannot put
Removed to the queue 2
Removed to the queue 7
Removed to the queue 7
Removed to the queue 9
Removed to the queue 4
Removed to the queue 7
Added to the queue 0
Added to the queue 3
Added to the queue 5
Added to the queue 2
Added to the queue 5
Added to the queue 1
queue is full cannot put
Removed to the queue 9
Removed to the queue 0
Removed to the queue 6
Removed to the queue 5
Removed to the queue 0
Removed to the queue 3
Removed to the queue 5
Removed to the queue 2
Removed to the queue 5
Removed to the queue 1
queue is empty, cannot take
Added to the queue 0
Added to the queue 4
Added to the queue 9
Added to the queue 6
Added to the queue 5
Added to the queue 0
Added to the queue 0
Added to the queue 2
Added to the queue 5
Added to the queue 2
queue is full cannot put
Removed to the queue 0
Removed to the queue 4
Removed to the queue 9
Removed to the queue 6
Removed to the queue 5
Removed to the queue 0
Removed to the queue 0
Removed to the queue 2
Removed to the queue 5
Removed to the queue 2
queue is empty, cannot take
Added to the queue 1
Added to the queue 8
Added to the queue 4
Added to the queue 2
Added to the queue 3
Removed to the queue 1
Removed to the queue 8
Removed to the queue 4
Removed to the queue 2
Removed to the queue 3
queue is empty, cannot take
Added to the queue 5
Added to the queue 6
Added to the queue 3
Added to the queue 2
Added to the queue 9
Added to the queue 3
Added to the queue 8
Added to the queue 6
Added to the queue 5
Removed to the queue 5
Removed to the queue 6
Removed to the queue 3
Removed to the queue 2
Removed to the queue 9
Removed to the queue 3
Removed to the queue 8
Removed to the queue 6
Removed to the queue 5
queue is empty, cannot take
Added to the queue 5
Added to the queue 5
Added to the queue 5
Added to the queue 2
Removed to the queue 5
Removed to the queue 5
Removed to the queue 5
Removed to the queue 2
queue is empty, cannot take
Added to the queue 7
Added to the queue 7
Added to the queue 8
Added to the queue 0
Added to the queue 6
Added to the queue 5
Removed to the queue 7
Removed to the queue 7
Removed to the queue 8
Removed to the queue 0
Removed to the queue 6
Removed to the queue 5
queue is empty, cannot take
Added to the queue 4
Removed to the queue 4
queue is empty, cannot take
Added to the queue 6
Added to the queue 4
Added to the queue 0
Added to the queue 7
Removed to the queue 6
Removed to the queue 4
Removed to the queue 0
Removed to the queue 7
queue is empty, cannot take
Added to the queue 4
Added to the queue 4
Added to the queue 7
Added to the queue 3
Added to the queue 7
Added to the queue 5
Added to the queue 8
Added to the queue 8
Added to the queue 2
Added to the queue 8
queue is full cannot put
Removed to the queue 4
Removed to the queue 4
Removed to the queue 7
Removed to the queue 3
Removed to the queue 7
Removed to the queue 5
Removed to the queue 8
Removed to the queue 8
Removed to the queue 2
Removed to the queue 8
queue is empty, cannot take
Added to the queue 2
Added to the queue 5
Added to the queue 2
Added to the queue 3
Added to the queue 5
Added to the queue 9
Added to the queue 5
Added to the queue 8
Added to the queue 5
Added to the queue 6
queue is full cannot put
Removed to the queue 2
Removed to the queue 5
Removed to the queue 2
Removed to the queue 3
Removed to the queue 5
Added to the queue 0
Added to the queue 0
Added to the queue 1
Added to the queue 9
Added to the queue 9
queue is full cannot put
Removed to the queue 9
Removed to the queue 5
Removed to the queue 8
Removed to the queue 5
Removed to the queue 6
Removed to the queue 0
Removed to the queue 0
Removed to the queue 1
Removed to the queue 9
Removed to the queue 9
queue is empty, cannot take
Added to the queue 3
Added to the queue 9
Added to the queue 5
Added to the queue 7
Added to the queue 7
Added to the queue 2
Added to the queue 3
Added to the queue 9
Removed to the queue 3
Removed to the queue 9
Removed to the queue 5
Removed to the queue 7
Removed to the queue 7
Removed to the queue 2
Removed to the queue 3
Removed to the queue 9
queue is empty, cannot take
Added to the queue 1
Added to the queue 2
Added to the queue 6
Added to the queue 3
Added to the queue 6
Added to the queue 2
Added to the queue 2
Added to the queue 7
Added to the queue 4
Added to the queue 0
queue is full cannot put
Removed to the queue 1
Removed to the queue 2
Removed to the queue 6
Added to the queue 9
Added to the queue 1
Added to the queue 1
queue is full cannot put
Removed to the queue 3
Added to the queue 0
queue is full cannot put
Removed to the queue 6
Added to the queue 6
queue is full cannot put
Removed to the queue 2
Removed to the queue 2
Removed to the queue 7
Removed to the queue 4
Removed to the queue 0
Removed to the queue 9
Removed to the queue 1
Removed to the queue 1
Removed to the queue 0
Removed to the queue 6
Added to the queue 9
Added to the queue 7
Added to the queue 9
Added to the queue 8
Added to the queue 9
Removed to the queue 9
Added to the queue 7
Added to the queue 5
Added to the queue 2
Added to the queue 1
Added to the queue 0
Added to the queue 1
queue is full cannot put
Removed to the queue 7
Added to the queue 1
queue is full cannot put
Removed to the queue 9
Added to the queue 8
queue is full cannot put
Removed to the queue 8
Added to the queue 5
Removed to the queue 9
Added to the queue 9
queue is full cannot put
Removed to the queue 7
Added to the queue 5
queue is full cannot put
Removed to the queue 5
Added to the queue 4
queue is full cannot put
Removed to the queue 2
Added to the queue 8
queue is full cannot put
Removed to the queue 1
Removed to the queue 0
Added to the queue 3
Added to the queue 7
queue is full cannot put
Removed to the queue 1
Added to the queue 9
Removed to the queue 1
Added to the queue 9
queue is full cannot put
Removed to the queue 8
Removed to the queue 5
Removed to the queue 9
Removed to the queue 5
Removed to the queue 4
Removed to the queue 8
Removed to the queue 3
Removed to the queue 7
Removed to the queue 9
Removed to the queue 9
Added to the queue 1
Added to the queue 7
Added to the queue 5
Added to the queue 7
Added to the queue 7
Added to the queue 2
Added to the queue 3
Added to the queue 3
Added to the queue 8
Removed to the queue 1
Added to the queue 0
Added to the queue 9
queue is full cannot put
Removed to the queue 7
Added to the queue 5
queue is full cannot put
Removed to the queue 5
Added to the queue 4
Removed to the queue 7
Removed to the queue 7
Removed to the queue 2
Removed to the queue 3
Removed to the queue 3
Added to the queue 1
Removed to the queue 8
Removed to the queue 0
Removed to the queue 9
Removed to the queue 5
Removed to the queue 4
Removed to the queue 1
queue is empty, cannot take
Added to the queue 2
Added to the queue 7
Added to the queue 3
Added to the queue 4
Added to the queue 4
Added to the queue 5
Added to the queue 9
Added to the queue 8
Added to the queue 1
Added to the queue 3
queue is full cannot put
Removed to the queue 2
Removed to the queue 7
Added to the queue 7
Added to the queue 6
queue is full cannot put
Removed to the queue 3
Removed to the queue 4
Removed to the queue 4
Removed to the queue 5
Removed to the queue 9
Added to the queue 5
Added to the queue 8
Added to the queue 4
Added to the queue 5
Added to the queue 8
queue is full cannot put
Removed to the queue 8
Removed to the queue 1
Removed to the queue 3
Removed to the queue 7
Removed to the queue 6
Removed to the queue 5
Removed to the queue 8
Removed to the queue 4
Removed to the queue 5
Added to the queue 1
Added to the queue 2
Added to the queue 1
Added to the queue 2
Added to the queue 2
Added to the queue 4
Added to the queue 4
Added to the queue 3
Added to the queue 9
queue is full cannot put
Removed to the queue 8
Added to the queue 2
queue is full cannot put
Removed to the queue 1
Added to the queue 0
queue is full cannot put
Removed to the queue 2
Added to the queue 6
queue is full cannot put
Removed to the queue 1
Added to the queue 2
queue is full cannot put
Removed to the queue 2
Added to the queue 2
queue is full cannot put
Removed to the queue 2
Removed to the queue 4
Removed to the queue 4
Removed to the queue 3
Removed to the queue 9
Removed to the queue 2
Added to the queue 2
Added to the queue 4
Added to the queue 4
Added to the queue 0
Added to the queue 5
Added to the queue 6
queue is full cannot put
Removed to the queue 0
Removed to the queue 6
Added to the queue 4
Added to the queue 8
queue is full cannot put
Removed to the queue 2
Added to the queue 8
queue is full cannot put
Removed to the queue 2
Removed to the queue 2
Removed to the queue 4
Removed to the queue 4
Removed to the queue 0
Removed to the queue 5
Removed to the queue 6
Added to the queue 5
Removed to the queue 4
Added to the queue 5
Added to the queue 3
Added to the queue 2
Added to the queue 9
Added to the queue 3
Added to the queue 6
Added to the queue 6
queue is full cannot put
Removed to the queue 8
Added to the queue 4
queue is full cannot put
Removed to the queue 8
Removed to the queue 5
Removed to the queue 5
Removed to the queue 3
Added to the queue 2
Removed to the queue 2
Removed to the queue 9
Removed to the queue 3
Removed to the queue 6
Removed to the queue 6
Removed to the queue 4
Added to the queue 4
Added to the queue 7
Added to the queue 6
Added to the queue 0
Removed to the queue 2
Added to the queue 6
Added to the queue 1
Added to the queue 5
Added to the queue 8
Added to the queue 0
Added to the queue 1
queue is full cannot put
Removed to the queue 4
Removed to the queue 7
Removed to the queue 6
Removed to the queue 0
Removed to the queue 6
Removed to the queue 1
Removed to the queue 5
Removed to the queue 8
Removed to the queue 0
Removed to the queue 1
queue is empty, cannot take
Added to the queue 6
Added to the queue 2
Added to the queue 3
Added to the queue 9
Added to the queue 8
Added to the queue 9
Added to the queue 5
Added to the queue 8
Added to the queue 9
Added to the queue 0
Removed to the queue 6
Removed to the queue 2
Removed to the queue 3
Removed to the queue 9
Removed to the queue 8
Removed to the queue 9
Removed to the queue 5
Removed to the queue 8
Removed to the queue 9
Removed to the queue 0
queue is empty, cannot take
Added to the queue 4
Added to the queue 5
Added to the queue 7
Added to the queue 9
Added to the queue 4
Added to the queue 3
Added to the queue 6
Removed to the queue 4
Added to the queue 0
Added to the queue 7
Added to the queue 3
Added to the queue 4
queue is full cannot put
Removed to the queue 5
Added to the queue 1
queue is full cannot put
Removed to the queue 7
Removed to the queue 9
Removed to the queue 4
Removed to the queue 3
Removed to the queue 6
Removed to the queue 0
Removed to the queue 7
Removed to the queue 3
Removed to the queue 4
Removed to the queue 1
Added to the queue 1
Added to the queue 5
Added to the queue 4
Added to the queue 0
Added to the queue 4
Added to the queue 7
Added to the queue 6
Added to the queue 9
Added to the queue 9
Added to the queue 1
queue is full cannot put
Removed to the queue 1
Removed to the queue 5
Removed to the queue 4
Removed to the queue 0
Removed to the queue 4
Added to the queue 9
Added to the queue 4
Added to the queue 5
Added to the queue 6
Added to the queue 5
queue is full cannot put
Removed to the queue 7
Removed to the queue 6
Removed to the queue 9
Removed to the queue 9
Added to the queue 2
Added to the queue 6
Added to the queue 6
Added to the queue 4
queue is full cannot put
Removed to the queue 1
Removed to the queue 9
Removed to the queue 4
Removed to the queue 5
Removed to the queue 6
Removed to the queue 5
Removed to the queue 2
Removed to the queue 6
Removed to the queue 6
Removed to the queue 4
queue is empty, cannot take
Added to the queue 4
Added to the queue 7
Added to the queue 9
Removed to the queue 4
Removed to the queue 7
Removed to the queue 9
queue is empty, cannot take
Added to the queue 6
Added to the queue 8
Added to the queue 4
Added to the queue 2
Removed to the queue 6
Removed to the queue 8
Removed to the queue 4
Removed to the queue 2
queue is empty, cannot take
Added to the queue 5
Added to the queue 8
Added to the queue 8
Added to the queue 1
Added to the queue 4
Added to the queue 9
Added to the queue 2
Added to the queue 5
Added to the queue 8
Added to the queue 5
queue is full cannot put
Removed to the queue 5
Removed to the queue 8
Removed to the queue 8
Removed to the queue 1
Removed to the queue 4
Removed to the queue 9
Removed to the queue 2
Removed to the queue 5
Removed to the queue 8
Removed to the queue 5
queue is empty, cannot take
Added to the queue 9
Added to the queue 4
Added to the queue 8
Added to the queue 1
Added to the queue 4
Added to the queue 0
Added to the queue 4
Added to the queue 7
Added to the queue 4
Added to the queue 1
queue is full cannot put
Removed to the queue 9
Removed to the queue 4
Removed to the queue 8
Removed to the queue 1
Removed to the queue 4
Removed to the queue 0
Removed to the queue 4
Removed to the queue 7
Removed to the queue 4
Removed to the queue 1
queue is empty, cannot take
Added to the queue 0
Added to the queue 5
Added to the queue 4
Added to the queue 6
Added to the queue 7
Added to the queue 8
Added to the queue 0
Added to the queue 2
Added to the queue 9
Added to the queue 7
queue is full cannot put
Removed to the queue 0
Removed to the queue 5
Removed to the queue 4
Removed to the queue 6
Removed to the queue 7
Removed to the queue 8
Removed to the queue 0
Removed to the queue 2
Removed to the queue 9
Removed to the queue 7
queue is empty, cannot take
Added to the queue 4
Added to the queue 9
Removed to the queue 4
Removed to the queue 9
queue is empty, cannot take
Added to the queue 2
Added to the queue 5
Added to the queue 3
Added to the queue 0
Added to the queue 4
Added to the queue 2
Added to the queue 8
Added to the queue 4
Added to the queue 5
Removed to the queue 2
Removed to the queue 5
Removed to the queue 3
Removed to the queue 0
Removed to the queue 4
Removed to the queue 2
Removed to the queue 8
Removed to the queue 4
Removed to the queue 5
queue is empty, cannot take
Added to the queue 5
Added to the queue 6
Added to the queue 0
Added to the queue 9
Added to the queue 0
Added to the queue 2
Added to the queue 3
Removed to the queue 5
Removed to the queue 6
Removed to the queue 0
Removed to the queue 9
Removed to the queue 0
Removed to the queue 2
Removed to the queue 3
queue is empty, cannot take
Added to the queue 1
Added to the queue 7
Added to the queue 1
Added to the queue 4
Added to the queue 0
Added to the queue 8
Added to the queue 8
Added to the queue 3
Added to the queue 9
Added to the queue 0
queue is full cannot put
Removed to the queue 1
Removed to the queue 7
Removed to the queue 1
Removed to the queue 4
Removed to the queue 0

范例3：

package com.contoso;

import java.util.Random;
import java.util.UUID;
import java.util.concurrent.LinkedBlockingQueue;

public class LinkedBlockingQueueExample1 {

    /**
     * Concurrent Queue interface.
     *
     * Implementations: LinkedBlockingQueue, ArrayBlockingQueue,
     * PriorityBlockingQueue, SynchronizedQueue.
     *
     * Used for the Producer-Consumer pattern.
     *
     * Blocking methods: put/take; Timed blocking methods: offer, poll;
     *
     * Can be bounded or unbounded.
     *
     */
    public static void useBlockingQueue() {
        System.out.println("=== BlockingQueue ===");

        // Bounded UUID queue
        LinkedBlockingQueue uuidQueue = new LinkedBlockingQueue<UUID>(10);

        System.out.println("Queue will execute for 10s");

        // Multiple consumers
        Runnable runConsumer = () -> {
            while (!Thread.currentThread().isInterrupted()) {
                try {
                    Object uuid = uuidQueue.take();
                    System.err.println("Consumed: " + uuid + " by " + Thread.currentThread().getName());

                } catch (InterruptedException e) {
                    // interrupted pattern
                    // InterruptedException makes isInterrupted returns false
                    Thread.currentThread().interrupt();
                    System.err.println("Consumer Finished");
                }
            }
        };
        Thread consumer1 = new Thread(runConsumer);
        Thread consumer2 = new Thread(runConsumer);
        consumer1.start();
        consumer2.start();

        // Producer Thread
        Runnable runProducer = () -> {
            try {
                while (!Thread.currentThread().isInterrupted()) {
                    Random r = new Random();
                    // Delay producer
                    Thread.sleep(r.nextInt(1000));
                    UUID randomUUID = UUID.randomUUID();
                    System.out.println("Produced: " + randomUUID + " by " + Thread.currentThread().getName());
                    uuidQueue.put(randomUUID);
                }
            } catch (InterruptedException e) {
                // interrupted pattern
                System.err.println("Producer Finished");
            }
        };

        // Multiple producers - Examples using simple threads this time.
        Thread producer1 = new Thread(runProducer);
        Thread producer2 = new Thread(runProducer);
        Thread producer3 = new Thread(runProducer);
        producer1.start();
        producer2.start();
        producer3.start();

        try {
            // Queue will run for 10secs
            Thread.sleep(10000);
            producer1.interrupt();
            producer2.interrupt();
            producer3.interrupt();
            consumer1.interrupt();
            consumer2.interrupt();

        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }

    public static void main(String[] args) {
        useBlockingQueue();
    }

}

zhengzizhi
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
java源码包---java 源码 大量 实例
04-18
　Java生成密钥、保存密钥的实例源码，通过本源码可以了解到Java如何产生单钥加密的密钥(myKey)、产生双钥的密钥对(keyPair)、如何保存公钥的字节数组、保存私钥到文件privateKey.dat、如何用Java对象序列化保存私钥...
创建react失败经验
keny-大成的博客
12-19 3830
创建的项目失败 Installing packages. This might take a couple of minutes. Installing react, react-dom, and react-scripts with cra-template... yarn add v1.13.0 info No lockfile found. [1/4] ???? Resolving pack...
React学习(一)React开发环境搭建,使用create-react-app创建一个demo
sun_luming的博客
12-08 1363
React开发过程中会使用大量node.js提供的各种库（就像Java开发需要使用大量的jar包一样），我们在开发Java程序时使用Maven来管理开发过程中使用的jar包，相应的在开发React程序时我们需要使用npm (这里给个npm的全称吧，node package manager，Node 包管理器，看翻译过来的意思就知道是干什么的) 来管理node提供的各种库。 第一步：安装node.j...
react搭建环境时执行npm start 报错 start: 'react-scripts start'几种常见解决办法
zhang_xiao_xie的博客
12-03 2万+
执行npm start 报错 [email protected] start:‘react-scripts start’ 我在搭建好react环境之后 只是安装了一个项目，然后在执行 npm start的时候出现了报错 错误如下图所示： 开始在网上搜索了一些办法 大部分问题都可以通过下面几种方法解决： 1）有的是因为node 或者webpack的版本不兼容的问题，据说5点几的npm有问题，建议升...
使用npx(creact-react-app) 构建项目后-npm start启动报错
hahahhahahahha123456的博客
10-24 1961
使用create-react-app创建的React项目时，有时在安装完其他组件后，再次运行 npm start 命令时会报以上错误，让我很郁闷，不过在上网搜了这个错后原来： 是create-react-app有丢包的缺陷，手动安装包后，需要重新npm install一下，这样node_modules/.bin/目录下才会重新出现react-scripts的文件，这样npm start命令才...
解决create-react-app创建项目出错
m0_55986526的博客
10-07 1352
Installing packages. This might take a couple of minutes. Installing react, react-dom, and react-scripts with cra-template-typescript... npm ERR! code 1 npm ERR! path C:\Users\MHX\Desktop\react-demo\node_modules\canvas npm ERR! command failed npm ERR! comm
java源码包2
04-20
　Java生成密钥、保存密钥的实例源码，通过本源码可以了解到Java如何产生单钥加密的密钥(myKey)、产生双钥的密钥对(keyPair)、如何保存公钥的字节数组、保存私钥到文件privateKey.dat、如何用Java对象序列化保存私钥...
JAVA上百实例源码以及开源项目
01-03
　Java生成密钥、保存密钥的实例源码，通过本源码可以了解到Java如何产生单钥加密的密钥(myKey)、产生双钥的密钥对(keyPair)、如何保存公钥的字节数组、保存私钥到文件privateKey.dat、如何用Java对象序列化保存私钥...
java源码包3
04-20
　Java生成密钥、保存密钥的实例源码，通过本源码可以了解到Java如何产生单钥加密的密钥(myKey)、产生双钥的密钥对(keyPair)、如何保存公钥的字节数组、保存私钥到文件privateKey.dat、如何用Java对象序列化保存私钥...
java源码包4
04-20
　Java生成密钥、保存密钥的实例源码，通过本源码可以了解到Java如何产生单钥加密的密钥(myKey)、产生双钥的密钥对(keyPair)、如何保存公钥的字节数组、保存私钥到文件privateKey.dat、如何用Java对象序列化保存私钥...
ES6-react-sample-app
06-08
Github repos 搜索示例应用程序 抽象的 此应用程序是使用以下语言和技术的测试： ES6 React/JSX 通量架构 演示 请参阅实时示例。 安装步骤 安装依赖 $ npm install && bower install 然后启动开发观察者 $ npm run watch 在浏览器中打开index.html文件。 测试 $ npm test 注意事项： js-only 文件经过单元测试，jsx 没有（组件和主布局）， linting 是通过ES6 转译完成的 通量架构 我一直在使用展示的 Flux 架构。 为了代码简单起见，web api 实用程序和动作创建器模块具有交叉依赖关系，我对此不太满意（请参阅和模块）。 Flux 架构对于这个演示来说可能有点矫枉过正，但它是理解它的良好开端。 我认为，从这些第一步开始，这个应用程序可以很好地发展。
react学习历程3——创建项目之报错
qq_41470573的博客
05-31 429
俗话说，磨刀不误砍柴工，一个好的IDE工具，对于开发效率的提升那是相当明显的，我使用的是webstorm，推荐大家使用。 首先是创建react项目，本人创建出现报错，报错信息没有记录下来
React 0基础入门
m0_55064043的博客
04-21 858
React 入门
React第一步：安装
qq_41442428的博客
07-24 147
作为一名刚出来的应届生，若想在以后前端路上越走越高的话，就必须得不断广泛去学习前端代码，前期是广泛学习，中期深入理解，后期掌握思想。 react的安装 第一步：安装react-app npm install -g create-react-app 第二步：创建文件名my-app create-react-app my-app 第三步：进入到my-app目录 cd my-app 第四步：运行环境 npm start 在运行第二步的时候，有时候会出现一些问题，因为React他对node的版本的有一定的要求。
从零开始搭建react项目（一）
yemuxia_sinian的博客
01-03 7331
自学react有一段时间了，官网文档基础的看了一遍，然后便把之前公司做的一个vue项目用react搭建了下，顺便整理下一些知识点。 项目大概效果： 一、利用create-react-app搭建项目 1、全局安装create-react-app，执行：npm install -g create-react-app 命令进行安装 2、进入要安装项目的文件夹，执行：npx create-re......
使用 create-react-app 构建 react应用程序 （react-scripts）
github_squad的博客
02-26 5万+
前言:    一般我们开始创建react web应用程序的时候,要自己通过 npm 或者 yarn 安装项目的全部依赖，再写webpack.config.js,一系列复杂的配置,搭建好开发环境后写src源代码。 现在 如果你正在搭建react运行环境，使用 create-react-app 去自动构建你的app程序。你的项目所在的文件夹下是没有配置文件。react-script
开发 react 应用最好用的脚手架 create-react-app
热门推荐
QTFYING的博客
11-29 7万+
1. 介绍 在开发react应用时，应该没有人用传统的方法引入react的源文件(js)，然后在html编辑吧。 大家都是用webpack + es6来结合react开发前端应用。 这个时候，我们可以手动使用npm来安装各种插件，来从头到尾自己搭建环境。 比如： npm install react react-dom --save npm install babel babel-loa...
React之npm ERR! [email protected] start: `react-scripts start`
weixin_40200876的博客
07-25 7857
npm ERR! code ELIFECYCLE npm ERR! errno 1 npm ERR! [email protected] start: `react-scripts start` npm ERR! Exit status 1 npm ERR! npm ERR! Failed at the [email protected] start script. npm ERR! This is ...
java 设计模式 建造者模式 ，给一个代码范例
最新发布
04-18
在这个范例中，我们定义了一个 `Car` 类，该类包含了一些基本的属性，例如制造商、型号、年份和颜色。我们使用了建造者模式来构造 `Car` 对象，其中 `Builder` 类包含了与 `Car` 相同的属性。我们在 `Builder` 中为...

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

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

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值