BlockingQueue<String> queue = new LinkedBlockingQueue<>();
// 入隊(duì)列
queue.put("abc");
// 出隊(duì)列. 如果沒有 put 直接 take, 就會(huì)阻塞.
String elem = queue.take();

class BlockingQueue{
    //隊(duì)列里存放的個(gè)數(shù)
   volatile private int size = 0;
    //隊(duì)列的頭節(jié)點(diǎn)
    private int head = 0;
    //隊(duì)列的尾節(jié)點(diǎn)
    private int prov = 0;
    //創(chuàng)建一個(gè)數(shù)組,我們來給這個(gè)數(shù)組的容量設(shè)置為100
    private int[] array = new int[100];
    //創(chuàng)建一個(gè)專業(yè)的鎖對(duì)象
    private Object object = new Object();
    //實(shí)現(xiàn)阻塞隊(duì)列中的put方法
    public void put(int value) throws InterruptedException {
        synchronized (object) {
            //當(dāng)數(shù)組已經(jīng)滿了
            if (size == array.length) {
                object.wait();
            } else {
                //我們可以優(yōu)化成prov = (prov + 1) % items.length
                array[prov] = value;
                prov ++;
               if (prov >= array.length) {
                   prov = 0;
               }
            }
            size++;
            object.notify();
        }
    }
    //實(shí)現(xiàn)阻塞隊(duì)列中的take方法
    public int take() throws InterruptedException {
        synchronized (object) {
            if (size == 0) {
                object.wait();
            }
            int x = array[head];
            head++;
            if (head >= array.length) {
                head = 0;
            }
            size--;
            object.notify();
            return x;
        }
    }
}

class BlockingQueue{
    //隊(duì)列里存放的個(gè)數(shù)
   volatile private int size = 0;
    //隊(duì)列的頭節(jié)點(diǎn)
    private int head = 0;
    //隊(duì)列的尾節(jié)點(diǎn)
    private int prov = 0;
    //創(chuàng)建一個(gè)數(shù)組,我們來給這個(gè)數(shù)組的容量設(shè)置為100
    private int[] array = new int[100];
    //創(chuàng)建一個(gè)專業(yè)的鎖對(duì)象
    private Object object = new Object();
    //實(shí)現(xiàn)阻塞隊(duì)列中的put方法
    public void put(int value) throws InterruptedException {
        synchronized (object) {
            //當(dāng)數(shù)組已經(jīng)滿了
            if (size == array.length) {
                object.wait();
            } else {
                //我們可以優(yōu)化成prov = (prov + 1) % items.length
                array[prov] = value;
                prov ++;
               if (prov >= array.length) {
                   prov = 0;
               }
            }
            size++;
            object.notify();
        }
    }
    //實(shí)現(xiàn)阻塞隊(duì)列中的take方法
    public int take() throws InterruptedException {
        synchronized (object) {
            if (size == 0) {
                object.wait();
            }
            int x = array[head];
            head++;
            if (head >= array.length) {
                head = 0;
            }
            size--;
            object.notify();
            return x;
        }
    }
}
public class Test {
    public static void main(String[] args) {
        BlockingQueue blockingQueue = new BlockingQueue();
        Thread thread1 = new Thread(()-> {
            while (true) {
                for (int i = 0; i < 100; i++) {
                    try {
                        blockingQueue.put(i);
                        System.out.println("生產(chǎn)了"+i);
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                }
            }
        });
        Thread thread2 = new Thread(()->{
                while (true) {
                    try {
                        int b = blockingQueue.take();
                        System.out.println("消耗了"+b);
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    }
                }
        });
        thread1.start();
        thread2.start();
    }
}