mirror of
https://github.com/VolmitSoftware/Iris.git
synced 2025-07-19 10:43:14 +00:00
80 lines
1.5 KiB
Java
80 lines
1.5 KiB
Java
package com.volmit.iris.util;
|
|
|
|
public class ShurikenQueue<T> implements Queue<T> {
|
|
private KList<T> queue;
|
|
private boolean randomPop;
|
|
private boolean reversePop;
|
|
|
|
public ShurikenQueue() {
|
|
clear();
|
|
}
|
|
|
|
public ShurikenQueue<T> responsiveMode() {
|
|
reversePop = true;
|
|
return this;
|
|
}
|
|
|
|
public ShurikenQueue<T> randomMode() {
|
|
randomPop = true;
|
|
return this;
|
|
}
|
|
|
|
@Override
|
|
public ShurikenQueue<T> queue(T t) {
|
|
queue.add(t);
|
|
return this;
|
|
}
|
|
|
|
@Override
|
|
public ShurikenQueue<T> queue(KList<T> t) {
|
|
queue.add(t);
|
|
return this;
|
|
}
|
|
|
|
@Override
|
|
public boolean hasNext(int amt) {
|
|
return queue.size() >= amt;
|
|
}
|
|
|
|
@Override
|
|
public boolean hasNext() {
|
|
return !queue.isEmpty();
|
|
}
|
|
|
|
@Override
|
|
public T next() {
|
|
return reversePop ? queue.popLast() : randomPop ? queue.popRandom() : queue.pop();
|
|
}
|
|
|
|
@Override
|
|
public KList<T> next(int amt) {
|
|
KList<T> t = new KList<>();
|
|
|
|
for (int i = 0; i < amt; i++) {
|
|
if (!hasNext()) {
|
|
break;
|
|
}
|
|
|
|
t.add(next());
|
|
}
|
|
|
|
return t;
|
|
}
|
|
|
|
@Override
|
|
public ShurikenQueue<T> clear() {
|
|
queue = new KList<T>();
|
|
return this;
|
|
}
|
|
|
|
@Override
|
|
public int size() {
|
|
return queue.size();
|
|
}
|
|
|
|
@Override
|
|
public boolean contains(T p) {
|
|
return queue.contains(p);
|
|
}
|
|
}
|