corda/classpath/java/util/AbstractQueue.java
Mike Jensen b5d388a718 Added an implemention of ArrayDeque, as well as unit tests
I also used this opportunity to reduce code duplication around other queue/deque implementations.
2014-03-18 19:45:00 -06:00

68 lines
1.3 KiB
Java

/* Copyright (c) 2008-2013, Avian Contributors
Permission to use, copy, modify, and/or distribute this software
for any purpose with or without fee is hereby granted, provided
that the above copyright notice and this permission notice appear
in all copies.
There is NO WARRANTY for this software. See license.txt for
details. */
package java.util;
public abstract class AbstractQueue<T> extends AbstractCollection<T> implements Queue<T> {
protected AbstractQueue() {
super();
}
@Override
public boolean add(T element) {
if (offer(element)) {
return true;
} else {
throw new IllegalStateException();
}
}
@Override
public boolean addAll(Collection <? extends T> collection) {
if (collection == null) {
throw new NullPointerException();
}
for (T element : collection) {
add(element);
}
return true;
}
@Override
public void clear() {
while (size() > 0) {
poll();
}
}
@Override
public T element() {
T result = peek();
if (result == null) {
throw new NoSuchElementException();
} else {
return result;
}
}
@Override
public T remove() {
T result = poll();
if (result == null) {
throw new NoSuchElementException();
} else {
return result;
}
}
}