java CappedBufferQueue

package com.sibo.concurrent;

// queue interface
public interface EventQueue<T> {

    void put(T event);

    EventBuffer<T> swap(EventBuffer<T> eventBuffer);

    boolean isEmpty();

    int size();

}
package com.sibo.concurrent;

import java.util.ArrayList;

public class EventBuffer<T> {

    private ArrayList<T> events = new ArrayList<>();

    public int size() {
        return events.size();
    }

    public T get(int index) {
        return events.get(index);
    }

    public void add(T event) {
        events.add(event);
    }

    public boolean isEmpty() {
        return events.isEmpty();
    }

    public void clear() {
        events.clear();
    }

}
package com.sibo.concurrent;

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

public class CappedBlockingEventQueue<T> implements EventQueue<T> {

    private final Lock lock = new ReentrantLock();
    private final Condition empty = lock.newCondition();
    private final Condition full = lock.newCondition();
    private EventBuffer<T> queue = new EventBuffer<>();
    private final int cap;

    public CappedBlockingEventQueue(int maxQueueSize) {
        this.cap = maxQueueSize;
    }

    @Override
    public void put(T event) {
        lock.lock();
        try {
            while (queue.size() >= cap) {
                try {
                    full.await();
                } catch (InterruptedException e) {
                    throw new RuntimeException(e);
                }
            }
            queue.add(event);
            empty.signal();
        } finally {
            lock.unlock();
        }
    }

    @Override
    public EventBuffer<T> swap(EventBuffer<T> eventBuffer) {
        lock.lock();
        try {
            while (queue.isEmpty()) {
                try {
                    empty.await();
                } catch (InterruptedException e) {
                    throw new RuntimeException(e);
                }
            }
            EventBuffer<T> toReturn = queue;
            queue = eventBuffer;
            full.signalAll();
            return toReturn;
        } finally {
            lock.unlock();
        }
    }

    @Override
    public boolean isEmpty() {
        lock.lock();
        try {
            return queue.isEmpty();
        } finally {
            lock.unlock();
        }
    }

    @Override
    public int size() {
        lock.lock();
        try {
            return queue.size();
        } finally {
            lock.unlock();
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值