ArrayQueue.java

public class ArrayQueue<E> implements Queue<E> {
	private Array<E> array;
	public ArrayQueue(int capacity) {
		array=new Array<>(capacity);
	}
	public ArrayQueue() {
		array=new Array<>();
	}
	@Override
	public int getSize() {
		return array.getSize();
	}
	public boolean isEmpty() {
		return array.isEmpty();
	}
	public int getCapacity() {
		return array.getCapacity();
	}
	@Override
	public void enqueue(E e) {
		array.addLast(e);
	}
	public E dequeue() {
		return array.removeFirst();
	}
	@Override
	public E getFront() {
		return array.getFrist();
	}
	@Override
	public String toString() {
		StringBuilder res=new StringBuilder();
		res.append("queue:");
		res.append("front [");
		for(int i=0;i<array.getSize();i++) {
			res.append(array.get(i));
			if(i!=array.getSize()-1) {
				res.append(",");
			}
		}
		res.append("] tail");
		return res.toString();
	}
	public static void main(String[] args) {
		ArrayQueue<Integer> queue =new ArrayQueue<>();
		for(int i=0;i<10;i++) {
			queue.enqueue(i);
			System.out.println(queue);
			if(i%3==2) {
				queue.dequeue();
				System.out.println(queue);
			}
		}
	}
}