#include <string.h>

template <class T>
Queue<T>::Queue(int num_elts)
{
  _elts = new T[num_elts];
  _head = _tail = 0;
  _eltsSize = num_elts;
}


template<class T>
Queue<T>::Queue(Queue<T>& q)
{
  _head = q._head;
  _tail = q._tail;
  _eltsSize = q._eltsSize;
  memcpy(_elts, q._elts, sizeof(T) * _eltsSize);
}


template<class T>
Queue<T>::~Queue()
{
  delete [] _elts;
}


template<class T>
const Queue<T>&
Queue<T>::operator=(const Queue<T>& q)
{
  if (_elts)
    delete [] _elts;

  _head = q._head;
  _tail = q._tail;
  _eltsSize = q._eltsSize;
  memcpy(_elts, q._elts, sizeof(T) * _eltsSize);

  return *this;
}


template<class T>
void
Queue<T>::enqueue(T item)
{
  _elts[_tail] = item;
  _tail = (_tail + 1) % _eltsSize;
}


template<class T>
void
Queue<T>::dequeue(T& item)
{
  item = _elts[_head];
  _head = (_head + 1) % _eltsSize;
}


template<class T>
int
Queue<T>::isEmpty(void)
{
  return (_head == _tail);
}


template<class T>
int
Queue<T>::isFull(void)
{
  return (((_tail + 1) % _eltsSize) == _head);
}