mirrors/Iris
1
0
Fork 0
mirror of https://github.com/VolmitSoftware/Iris.git synced 2026-04-06 07:46:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Cleanup SRC

Browse Source
This commit is contained in:
Daniel Mills
2021-07-14 02:34:13 -04:00
parent f29015426f
commit 6ca6fc6989
605 changed files with 53283 additions and 64305 deletions
Download Patch File Download Diff File Expand all files Collapse all files

137
src/main/java/com/volmit/iris/util/ShurikenQueue.java
View File

@@ -1,94 +1,79 @@
package com.volmit.iris.util;
public class ShurikenQueue<T> implements Queue<T>
{
private KList<T> queue;
private boolean randomPop;
private boolean reversePop;
public class ShurikenQueue<T> implements Queue<T> {
private KList<T> queue;
private boolean randomPop;
private boolean reversePop;
public ShurikenQueue()
{
clear();
}
public ShurikenQueue() {
clear();
}
public ShurikenQueue<T> responsiveMode()
{
reversePop = true;
return this;
}
public ShurikenQueue<T> responsiveMode() {
reversePop = true;
return this;
}
public ShurikenQueue<T> randomMode()
{
randomPop = 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(T t) {
queue.add(t);
return this;
}
@Override
public ShurikenQueue<T> queue(KList<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(int amt) {
return queue.size() >= amt;
}
@Override
public boolean hasNext()
{
return !queue.isEmpty();
}
@Override
public boolean hasNext() {
return !queue.isEmpty();
}
@Override
public T next()
{
return reversePop ? queue.popLast() : randomPop ? queue.popRandom() : queue.pop();
}
@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<>();
@Override
public KList<T> next(int amt) {
KList<T> t = new KList<>();
for(int i = 0; i < amt; i++)
{
if(!hasNext())
{
break;
}
for (int i = 0; i < amt; i++) {
if (!hasNext()) {
break;
}
t.add(next());
}
t.add(next());
}
return t;
}
return t;
}
@Override
public ShurikenQueue<T> clear()
{
queue = new KList<T>();
return this;
}
@Override
public ShurikenQueue<T> clear() {
queue = new KList<T>();
return this;
}
@Override
public int size()
{
return queue.size();
}
@Override
public int size() {
return queue.size();
}
@Override
public boolean contains(T p)
{
return queue.contains(p);
}
@Override
public boolean contains(T p) {
return queue.contains(p);
}
}