summaryrefslogtreecommitdiff
path: root/BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java
diff options
context:
space:
mode:
Diffstat (limited to 'BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java')
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java88
1 files changed, 0 insertions, 88 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
deleted file mode 100644
index 850598a..0000000
--- a/BJC-Utils2/src/main/java/bjc/utils/esodata/QueueStack.java
+++ /dev/null
@@ -1,88 +0,0 @@
-package bjc.utils.esodata;
-
-import java.util.Deque;
-import java.util.LinkedList;
-
-/**
- * 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 final Deque<T> backing;
-
- /**
- * Create a new empty stack queue.
- *
- */
- public QueueStack() {
- backing = new LinkedList<>();
- }
-
- @Override
- public void push(final T elm) {
- backing.add(elm);
- }
-
- @Override
- public T pop() {
- if (backing.isEmpty()) throw new StackUnderflowException();
-
- return backing.remove();
- }
-
- @Override
- public T top() {
- if (backing.isEmpty()) throw new StackUnderflowException();
-
- return backing.peek();
- }
-
- @Override
- public int size() {
- return backing.size();
- }
-
- @Override
- public boolean empty() {
- return backing.size() == 0;
- }
-
- @SuppressWarnings("unchecked")
- @Override
- public T[] toArray() {
- return (T[]) backing.toArray();
- }
-
- @Override
- public String toString() {
- return String.format("QueueStack [backing=%s]", backing);
- }
-
- @Override
- public int hashCode() {
- final int prime = 31;
- int result = 1;
-
- result = prime * result + (backing == null ? 0 : backing.hashCode());
-
- return result;
- }
-
- @Override
- public boolean equals(final Object obj) {
- if (this == obj) return true;
- if (obj == null) return false;
- if (!(obj instanceof QueueStack<?>)) return false;
-
- final QueueStack<?> other = (QueueStack<?>) obj;
-
- if (backing == null) {
- if (other.backing != null) return false;
- } else if (!backing.equals(other.backing)) return false;
-
- return true;
- }
-}