Queue.cpp

#include "stdafx.h"
using namespace std;

//int main()
//{


    DataType Node::getData() const
    {

        return data;
    }
    void Node::setData(const DataType& _data)
    {
        data = _data;
    }
    Node* Node::detpNext()
    {
        return pNext;
    }
    const Node* Node::detpNext() const
    {
        return pNext;
    }
    void Node::setpNext(Node* _pNext)
    {
        pNext = _pNext;

    }

    void printList(Node * pHead)
    {
        for (Node*pCurrent = pHead; pCurrent != nullptr; pCurrent = pCurrent->detpNext())
        {
            cout << pCurrent->getData() << endl;
        }
    }
    void addListHead(const DataType &data, Node*& pHead)
    {
        Node* pNew = new Node;
        pNew->setData(data);
        pNew->setpNext(pHead);
        pHead = pNew;
    }
    void addlist(const DataType & data, Node* pCurrent)
    {
        Node * pNew = new Node(data, pCurrent->detpNext());
        pCurrent->setpNext(pNew);
    }

    Node* findInList(const DataType& data, Node* start)
    {
        for (Node* pCurrent = start; pCurrent != nullptr; pCurrent = pCurrent->detpNext())

        {
            if (pCurrent->getData() == data)
                return pCurrent;
        }
        return nullptr;
    }
    void delListHead(Node*& pHead)
    {
        Node*pDel = pHead;
        pHead = pHead->detpNext();
        delete pDel;
    }

    void delListNode(Node* pRrew)
    {
        Node*pDel = pRrew->detpNext();
        pRrew->setpNext(pDel->detpNext());
        delete pDel;
    }

    void Quene::enque (const DataType &data)
    {
        if (first == nullptr)
        {
            addListHead(data, first);
            end = first;
        }
        else
        {
            addlist(data, end);
            end = end->detpNext();
        }
    }
    bool Quene::deque(DataType& value)
    {
        if ( this->first!=nullptr)
        {
            if (first =end)
            {
                end = nullptr;
            }
            value = first->getData();
            delListHead(first);
            return true;
        }
        return false;
    }
    void Quene::show()
    {
        printList(first);
    }