手撕阻塞队列



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

public class MyQueue<T> {


    public MyQueue(Integer capacity) {
        this.capacity = capacity;
    }

    private Integer capacity;

    private volatile int size = 0;

    private LinkedList<T> container = new LinkedList<>();

    private Lock lock = new ReentrantLock();

    private Condition fullCondition = lock.newCondition();

    private Condition emptyCondition = lock.newCondition();

    public void add(T t) {
        lock.lock();
        try {
            while (capacity.equals(size)) {
                System.out.println("对象满了");
                try {
                    fullCondition.await();
                } catch (InterruptedException e) {
                    fullCondition.signal();
                    e.printStackTrace();
                }
            }
            size++;
            emptyCondition.signal();
            container.add(t);
        } finally {
            lock.unlock();
        }
    }

    public T get() {
        lock.lock();
        try {
            while (size == 0) {
                try {
                    emptyCondition.await();
                } catch (InterruptedException e) {
                    emptyCondition.signal();
                    e.printStackTrace();
                }
            }
            size--;
            fullCondition.signal();
            return container.remove(0);
        } finally {
            lock.unlock();
        }
    }

    public static void main(String[] args) {
        MyQueue<String> queue = new MyQueue<String>(10);
        Thread thread1 = new Thread(() -> {
            for (int i = 0; i < 100; i++) {
                queue.add("元素" + i);
                System.out.println("添加元素" + i);
                try {
                    Thread.sleep(500);
                }catch (InterruptedException e){
                    e.printStackTrace();
                }
            }
        });

        Thread thread2 = new Thread(() -> {
            for(;;){
                System.out.println("消费:" + queue.get());
                try {
                    Thread.sleep(800);
                }catch (InterruptedException e){
                    e.printStackTrace();
                }
            }
        });

        thread1.start();
        thread2.start();
    }

}

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值