// Class Stack:
// Stack container.
// Stack should be able to push, pop, check if is empty,
// full, check size, the topmost element on the stack, push
// pop and clear.

class Queue{
private:
	unsigned int Size;
	DLinkedList List;
public:
	Queue();

	Queue(const Queue& source);
	Queue& operator=(const Queue& RHS);

	// should return false if operation is not successful,
	bool enQueue(const ElementD& val);

	// should return false if operation is not successful,
	// if successful set reference parameter to item poped
	bool deQueue(ElementD& val);
	
	// get element at front
	bool getFront(ElementD& val);

	// check if full
	unsigned int size() const;
	
	bool isFull() const;
	bool isEmpty() const;
	void clear();

	~Queue();
};