/*
 * Queue.h
 *
 *  Created on: Feb 16, 2009
 *      Author: adrienne
 */

#ifndef QUEUE_H_
#define QUEUE_H_

#include <iostream>
#include <cstddef>
#include "CircleDoubleList.h"

using namespace std;

template<typename Element_Type>

class Queue {

private:

	CircleDoubleList<Element_Type>* list;	//The underlying structure of the queue

	/** Add any additional private data members or functions needed here */


public:

	/**
	 * Creates an empty queue.
	 */
	Queue()
	{
	}

	/**
	 * Copy constructor for the queue.
	 */
	Queue(const Queue& otherQueue)
	{
	}

	/**
	 * Destructor for the queue.
	 */
	~Queue()
	{
	}

	/**
	 * Put the element onto the queue.
	 */
	void enqueue(Element_Type element)
	{
	}

	/**
	 * Remove the element from the queue and return it.  The element
	 * removed must be the first element that was inserted inserted.
	 */
	Element_Type dequeue()
	{
	}

	/**
	 * Returns the element that is next to be removed, but does not
	 * remove it from the queue.
	 */
	Element_Type peek()
	{

	}

	/**
	 * Clear out the contents of the queue (and deallocate appropriately).
	 */
	void clear()
	{
	}

	/**
	 * Returns true if the queue is empty, false otherwise.
	 */
	bool isEmpty() const
	{
	}

	/**
	 * Overload the output stream operator so that the queue can be outputted
	 * to the screen.  This overloading assumes that the elements inside the stack
	 * have also overloaded this operator.
	 */
	friend ostream& operator<< (ostream& osObject, const Queue& queueObject)
	{
	}

};

#endif /* QUEUE_H_ */