LinkedList.cpp

#include "LinkedList.h"

template<class T>
LinkedList<T>::LinkedList()
{
    h_node = nullptr;
    length=0;
}

template<class T>
LinkedList<T>::~LinkedList()
{
    LinkedNode<T>* conductor = h_node;
    while(conductor->next != h_node)
    {
        conductor = conductor->next;
        delete conductor;
    }
    delete h_node;
}

template<class T>
LinkedNode<T>* LinkedList<T>::push_back(T value)
{
    LinkedNode<T>* conductor = h_node;


    if(h_node == nullptr)
    {
        h_node = new LinkedNode<T>;
        h_node->x = value;
        h_node->next = h_node;
        length++;
        return h_node;
    }

    while(conductor->next != h_node)
    {
        conductor = conductor->next;
    }

    conductor->next = new LinkedNode<T>;
    conductor->next->x = value;
    conductor->next->next = h_node;
    length++;
    return conductor->next;
}

template<class T>
LinkedNode<T>* LinkedList<T>::push_front(T value)
{
    if(h_node == nullptr)
    {
        h_node = new LinkedNode<T>;
        h_node->x = value;
        h_node->next = h_node;
        length++;
        return h_node;
    }

    LinkedNode<T>* old_h = h_node;
    h_node = new LinkedNode<T>;
    h_node->x = value;
    h_node->next = old_h;
    length++;

    LinkedNode<T>* conductor = old_h;
    while(conductor->next != old_h)
    {
        conductor = conductor->next;
    }
    conductor->next = h_node;
    return h_node;
}

template<class T>
void LinkedList<T>::set_head(LinkedNode<T>* node)
{
    LinkedNode<T>* conductor = h_node;
    int i=0;
    while ( conductor->next != node )
    {
        conductor = conductor->next;

        if(i > length)
            return;
        i++;
    }
    h_node = node;
}

template<class T>
LinkedNode<T>* LinkedList<T>::get_head()
{
    return h_node;
}

template<class T>
void LinkedList<T>::remove(LinkedNode<T>* node)
{
    LinkedNode<T>* conductor = h_node;
    LinkedNode<T>* prev_node;
    int i=0;
    while ( conductor->next != node )
    {
        prev_node = conductor;
        conductor = conductor->next;

        if(i > length)
            return;
        i++;
    }
    // TODO: Why do an extra next. Why on earth does this work!?
    prev_node->next->next = conductor->next->next;
    if(node == h_node)
    {
        h_node = conductor->next->next;
    }
    delete node;
    length--;
}

template<class T>
template<typename IterF>
void LinkedList<T>::iterate(IterF iterfunction)
{
    LinkedNode<T>* conductor = h_node;

    iterfunction(h_node->x);
    while ( conductor->next != h_node )
    {
        iterfunction(conductor->next->x);
        conductor = conductor->next;
    }
}