基于数组的有界缓存实现

public class BaseBoundBuffer {

    public String[] buf;
    private int tail;
    private int count;
    private int head;

    public BaseBoundBuffer(int cap) {
        this.buf = new String[cap];
    }

    public synchronized void doPut(String v) {
        buf[tail] = v;
        if (++tail == buf.length)
            tail = 0;
        if (count < buf.length)
            count++;
        System.out.println("doPut count: " + count);
    }

    public synchronized String doTake() {
        String v = buf[head];
        buf[head] = null;
        if (++head == buf.length)
            head = 0;
        if (count > 0)
            --count;
        System.out.println("doTake count: " + count);
        return v;
    }

    public synchronized boolean isEmpty() {
        return count == 0;
    }

    public synchronized boolean isFull() {
        return count == buf.length;
    }

    public static void main(String[] args) {
        BaseBoundBuffer bbb = new BaseBoundBuffer(4);
        String[] arr = new String[] { "a", "b", "c", "d", "f" };
        for (String a : arr) {
            bbb.doPut(a);
        }
        System.out.println(Arrays.toString(bbb.buf));

        System.out.println(bbb.isFull());

        for (int i = 0; i < 5; i++) {
            System.out.println(bbb.doTake());
        }
        System.out.println(Arrays.toString(bbb.buf));

        System.out.println(bbb.isEmpty());

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值