Stack work

There are now multiple kinds of stacks, with Stack being abstract and
SimpleStack being the basic implementation.

QueueStack is a stack that's actually a queue.
SpaghettiStack is a stack that has a parent it can access.

1 files changed, 50 insertions, 0 deletions

diff --git a/BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java b/BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java
new file mode 100644
index 0000000..472e161
--- /dev/null
+++ b/BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java
@@ -0,0 +1,50 @@
+package bjc.utils.esodata;
+
+import java.util.ArrayList;
+import java.util.Deque;
+import java.util.List;
+import java.util.LinkedList;
+import java.util.function.Consumer;
+
+/**
+ * A FIFO implementation of a stack.
+ *
+ * @param T The datatype stored in the stack.
+ * @author Ben Culkin
+ */
+public class QueueStack<T> extends Stack<T> {
+	private Deque<T> backing;
+
+	/**
+	 * Create a new empty stack queue.
+	 *
+	 */
+	public SimpleStack() {
+		backing = new LinkedList();
+	}
+
+	@Override
+	public void push(T elm) {
+		backing.add(elm);
+	}
+
+	@Override
+	public T pop() {
+		return backing.remove();
+	}
+
+	@Override
+	public T top() {
+		return backing.peek();
+	}
+
+	@Override
+	public int size() {
+		return backing.size();
+	}
+
+	@Override
+	public boolean empty() {
+		return backing.size() == 0;
+	}
+}