/*
 * Name: Scott Lonsdale
 * Course: SENG1120
 * Student number: 3303788
*/

template<typename object>
Queue<object>::Queue()
{
    data = new LinkedList<object>();
    used = 0;
}

template<typename object>
Queue<object>::~Queue()
{
    delete data;

}

template<typename object>
void Queue<object>::enqueue(const object& entry)
{
    ++used;
    data->addToTail(entry); // uses add_to_tail from LinkedList
}

template<typename object>
void Queue<object>::dequeue()
{
    --used;
    data->removeFromHead(); // reused from LinkedList
}

template<typename object>
object Queue<object>::front()
{
    data->moveToHead(); // makes current move to head
    return data->getCurrent();
}




template<typename object>
int Queue<object>::size() const
{
    return used;
}



template<typename object>
bool Queue<object>::is_empty() const
{
    if ( used = 0 ) {return true;}
    else {return false;}
}