#include "LinkedList.h"

LinkedList::LinkedList()
{
    this->m_NodeC = 0;
    this->m_Head = nullptr;
    this->m_Tail = nullptr;
}

void LinkedList::AddToHead(void* pvData)
{
    _LL_NODE* pNode = new _LL_NODE();
    pNode->m_pvData = pvData;

    if (!m_Tail)
    {
        m_Tail = pNode;
    }

    if (m_Head)
    {
        m_Head->m_Prev = pNode;
        pNode->m_Next = m_Head;
    }

    m_Head = pNode;
    m_NodeC++;
}

void LinkedList::AddToTail(void* pvData)
{
    _LL_NODE* pNode = new _LL_NODE();
    pNode->m_pvData = pvData;

    if (!m_Head)
    {
        m_Head = pNode;
    }

    if (m_Tail) {
        m_Tail->m_Next = pNode;
        pNode->m_Prev = m_Tail;
    }

    pNode->m_Next = nullptr;
    pNode->m_Prev = m_Tail;

    m_Tail = pNode;
    m_NodeC++;
}

void LinkedList::RemoveNode(_LL_NODE* pNodeToRemove)
{
    _LL_NODE* pCurrentNode;
    for (pCurrentNode = m_Head; pCurrentNode != pNodeToRemove; pCurrentNode = pCurrentNode->m_Next)
    {
        ;
    }

    if (pCurrentNode == m_Head)
    {
        m_Head = m_Head->m_Next;
    }
    else 
    {
        pCurrentNode->m_Prev->m_Next = pCurrentNode->m_Next;

        if (pCurrentNode->m_Next)
        {
            pCurrentNode->m_Next->m_Prev = pCurrentNode->m_Prev;
        }
    }

    m_NodeC--;
}

LinkedList::_LL_NODE* LinkedList::RemoveHeadNode() 
{
    _LL_NODE* pHeadNode = m_Head;

    if (m_NodeC > 0)
    {
        m_Head = m_Head->m_Next;
        m_NodeC--;
    }

    return pHeadNode;
}

void LinkedList::ClearList() 
{
    while (true) 
    {
        _LL_NODE* pHeadNode = RemoveHeadNode();
        if (!pHeadNode)
        {
            break;
        }
        delete pHeadNode;
    }
}