
com.yomahub.liteflow.util.LimitQueue Maven / Gradle / Ivy
The newest version!
/**
* Title: liteflow
* Description: 轻量级的组件式流程框架
* @author Bryan.Zhang
* @email [email protected]
* @Date 2020/4/1
*/
package com.yomahub.liteflow.util;
import java.util.Collection;
import java.util.Iterator;
import java.util.Queue;
import java.util.concurrent.ConcurrentLinkedQueue;
/**
* 有限队列集合
*
* @author Bryan.Zhang
*/
public class LimitQueue implements Queue {
/**
* 队列长度,实例化类的时候指定
*/
private int limit;
Queue queue = new ConcurrentLinkedQueue<>();
public LimitQueue(int limit) {
this.limit = limit;
}
@Override
public boolean offer(E e) {
if (queue.size() >= limit) {
// 如果超出长度,入队时,先出队
queue.poll();
}
return queue.offer(e);
}
@Override
public E poll() {
return queue.poll();
}
public Queue getQueue() {
return queue;
}
public int getLimit() {
return limit;
}
@Override
public boolean add(E e) {
return queue.add(e);
}
@Override
public E element() {
return queue.element();
}
@Override
public E peek() {
return queue.peek();
}
@Override
public boolean isEmpty() {
return queue.size() == 0 ? true : false;
}
@Override
public int size() {
return queue.size();
}
@Override
public E remove() {
return queue.remove();
}
@Override
public boolean addAll(Collection extends E> c) {
return queue.addAll(c);
}
@Override
public void clear() {
queue.clear();
}
@Override
public boolean contains(Object o) {
return queue.contains(o);
}
@Override
public boolean containsAll(Collection> c) {
return queue.containsAll(c);
}
@Override
public Iterator iterator() {
return queue.iterator();
}
@Override
public boolean remove(Object o) {
return queue.remove(o);
}
@Override
public boolean removeAll(Collection> c) {
return queue.removeAll(c);
}
@Override
public boolean retainAll(Collection> c) {
return queue.retainAll(c);
}
@Override
public Object[] toArray() {
return queue.toArray();
}
@Override
public T[] toArray(T[] a) {
return queue.toArray(a);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy