阻塞队列例子

public class TestBlockArray {
    private int[] arr;
    private Condition notEmpty;
    private Condition notFull;
    private ReentrantLock lock;
    private int putIndex;
    private int getPutIndex;
    private int count;

    public static void main(String[] args) throws InterruptedException {
        TestBlockArray testBlockArray = new TestBlockArray(4, true);
        testBlockArray.poll(1);
        testBlockArray.poll(2);
        testBlockArray.poll(3);
        testBlockArray.poll(4);
        System.out.println(testBlockArray.take());
        System.out.println(testBlockArray.take());
        System.out.println(testBlockArray.take());
        System.out.println(testBlockArray.take());
        //System.out.println(testBlockArray.take());
        //System.out.println(testBlockArray.take());
        testBlockArray.poll(5);
        testBlockArray.poll(6);

        System.out.println(testBlockArray.take());
        System.out.println(testBlockArray.take());
    }

    public TestBlockArray(int cap, boolean fair){
        lock = new ReentrantLock(fair);
        notFull = lock.newCondition();
        notEmpty = lock.newCondition();
        arr = new int[cap];
    }

    public boolean poll(int item){
        lock.lock();
        try {
            while (count == arr.length){
                notFull.await();
            }
            enq(item);
        } catch (InterruptedException e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
        return true;
    }

    public int take() throws InterruptedException {
        lock.lock();
        try{
            while (count == 0){
                notEmpty.await();
            }
            return deq();
        }finally {
            lock.unlock();
        }
    }




    public void enq(int item){
        arr[putIndex] = item;
        if (++putIndex == arr.length) {
            putIndex = 0;
        }
        count ++;
        notEmpty.signal();
    }

    public int deq(){
       int ret = arr[getPutIndex];
       if (++getPutIndex == arr.length){
           getPutIndex = 0;
       }
       count --;
       notFull.signal();
       return ret;
    }


}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值