package cse1030.datastructures;

import java.util.LinkedList;

/**
 * A simple queue implementation supporting enqueue, dequeue,
 * and isEmpty operations.
 * 
 * @author CSE1030
 *
 * @param <E> the type of element held by this queue
 */
public class Queue<E> {
	private LinkedList<E> q;

	/**
	 * Create an empty queue.
	 */
	public Queue() {
		this.q = new LinkedList<E>();
	}

	/**
	 * Add an element to the back of the queue.
	 * 
	 * @param element the element to add to the back of the queue
	 */
	public void enqueue(E element) {
		this.q.addLast(element);
	}

	/**
	 * Remove the front element of the queue. The element is returned
	 * to the client.
	 * 
	 * @return the element that was removed from the front of the queue
	 */
	public E dequeue() {
		return this.q.removeFirst();
	}
	
	/**
	 * Returns <code>true</code> if this queue contains no elements.
	 * 
	 * @return <code>true</code> if this queue contains no elements
	 */
	public boolean isEmpty() {
		return this.q.isEmpty();
	}
}