windows-server-2003/printscan/inc/psutil/simlist.h

/*******************************************************************************
 *
 *  (C) COPYRIGHT MICROSOFT CORPORATION, 1998
 *
 *  TITLE:       SIMLIST.H
 *
 *  VERSION:     1.0
 *
 *  AUTHOR:      ShaunIv
 *
 *  DATE:        2/25/1999
 *
 *  DESCRIPTION: Simple singly linked list template class.
 *
 *******************************************************************************/

#ifndef __SIMLIST_H_INCLUDED
#define __SIMLIST_H_INCLUDED

template <class T>
class CSimpleLinkedList
{
private:

    class CLinkedListNode
    {
    private:
        CLinkedListNode *m_pNext;
        T                m_Data;
    public:
        CLinkedListNode( const T &data )
        : m_pNext(NULL), m_Data(data)
        {
        }
        const CLinkedListNode *Next(void) const
        {
            return (m_pNext);
        }
        CLinkedListNode *Next(void)
        {
            return (m_pNext);
        }
        void Next( CLinkedListNode *pNext )
        {
            m_pNext = pNext;
        }
        const T &Data(void) const
        {
            return (m_Data);
        }
        T &Data(void)
        {
            return (m_Data);
        }
    };

private:
    CLinkedListNode *m_pHead;
    CLinkedListNode *m_pTail;
    int              m_nItemCount;

public:
    CSimpleLinkedList( const CSimpleLinkedList &other )
      : m_pHead(NULL),
        m_pTail(NULL),
        m_nItemCount(0)
    {
        for (Iterator i(other);i != other.End();i++)
        {
            Append(*i);
        }
    }
    CSimpleLinkedList(void)
      : m_pHead(NULL),
        m_pTail(NULL),
        m_nItemCount(0)
    {
    }
    CSimpleLinkedList &operator=( const CSimpleLinkedList &other )
    {
        //
        // Make sure we aren't the same object
        //
        if (this != &other)
        {
            //
            // Free our list
            //
            Destroy();

            //
            // Loop through the other list, copying nodes to our list
            //
            for (Iterator i(other);i != other.End();i++)
            {
                Append(*i);
            }
        }
        return *this;
    }
    virtual ~CSimpleLinkedList(void)
    {
        Destroy();
    }
    void Destroy(void)
    {
        //
        // Loop through each item, deleting it
        //
        while (m_pHead)
        {
            //
            // Save the head pointer
            //
            CLinkedListNode *pCurr = m_pHead;

            //
            // Point the head to the next item
            //
            m_pHead = m_pHead->Next();

            //
            // Delete this item
            //
            delete pCurr;
        }

        //
        // Reinitialize all the variables to their empty state
        //
        m_pHead = m_pTail = NULL;
        m_nItemCount = 0;
    }
    void Remove( const T &data )
    {
        //
        // Loop until we find this item, and save the previous item before incrementing
        //
        CLinkedListNode *pPrev = NULL, *pCurr = m_pHead;
        while (pCurr && pCurr->Data() != data)
        {
            pPrev = pCurr;
            pCurr = pCurr->Next();
        }
        
        //
        // If we didn't find the item, return
        //
        if (!pCurr)
        {
            return;
        }

        //
        // If this is the last item, point the tail pointer at the previous item (which could be NULL)
        //
        if (pCurr == m_pTail)
        {
            m_pTail = pPrev;
        }

        //
        // If this is the first item, point the head at the next item
        //
        if (pCurr == m_pHead)
        {
            m_pHead = pCurr->Next();
        }
        
        //
        // Point the previous item's next pointer at our next pointer
        //
        if (pPrev)
        {
            pPrev->Next(pCurr->Next());
        }
        
        //
        // Delete this item
        //
        delete pCurr;

        //
        // Decrement the item count
        //
        m_nItemCount--;
    }
    void Append( const CSimpleLinkedList &other )
    {
        //
        // Loop through the other list, copying nodes to our list
        //
        for (Iterator i(other);i != other.End();i++)
        {
            Append(*i);
        }
    }

    int Count(void) const
    {
        return m_nItemCount;
    }

    class Iterator;
    friend class Iterator;
    class Iterator
    {
    private:
        CLinkedListNode *m_pCurr;
    public:
        Iterator( CLinkedListNode *pNode )
          : m_pCurr(pNode)
        {
        }
        Iterator( const CSimpleLinkedList &list )
          : m_pCurr(list.m_pHead)
        {
        }
        Iterator(void)
          : m_pCurr(NULL)
        {
        }
        Iterator &Next(void)
        {
            if (m_pCurr)
            {
                m_pCurr = m_pCurr->Next();
            }
            return (*this);
        }
        Iterator &Begin(const CSimpleLinkedList &list)
        {
            m_pCurr = list.m_pHead;
            return (*this);
        }
        Iterator &operator=( const Iterator &other )
        {
            m_pCurr = other.m_pCurr;
            return (*this);
        }
        bool End(void) const
        {
            return(m_pCurr == NULL);
        }
        T &operator*(void)
        {
            return (m_pCurr->Data());
        }
        const T &operator*(void) const
        {
            return (m_pCurr->Data());
        }
        Iterator &operator++(void)
        {
            Next();
            return (*this);
        }
        Iterator operator++(int)
        {
            Iterator tmp(*this);
            Next();
            return (tmp);
        }
        bool operator!=( const Iterator &other ) const
        {
            return (m_pCurr != other.m_pCurr);
        }
        bool operator==( const Iterator &other ) const
        {
            return (m_pCurr == other.m_pCurr);
        }
    };
    Iterator Begin(void) const
    {
        return Iterator(*this);
    }
    Iterator End(void) const
    {
        return Iterator();
    }
    Iterator Begin(void)
    {
        return Iterator(*this);
    }
    Iterator End(void)
    {
        return Iterator();
    }
    Iterator Find( const T &data )
    {
        for (Iterator i=Begin();i != End();++i)
        {
            if (*i == data)
            {
                return i;
            }
        }
        return End();
    }
    Iterator Prepend( const T &data )
    {
        //
        // Allocate a new item to hold this data
        //
        CLinkedListNode *pNewItem = new CLinkedListNode(data);
        if (pNewItem)
        {
            //
            // If the list is empty, point everything at this item
            //
            if (Empty())
            {
                m_pHead = m_pTail = pNewItem;
            }
            
            //
            // Point our next pointer to the current, then point the head at us
            //
            else
            {
                pNewItem->Next(m_pHead);
                m_pHead = pNewItem;
            }
            
            //
            // Increment the item count
            //
            m_nItemCount++;
        }
        
        //
        // Return an iterator that points to the new item
        //
        return Iterator(pNewItem);
    }
    Iterator Append( const T &data )
    {
        //
        // Allocate a new item to hold this data
        //
        CLinkedListNode *pNewItem = new CLinkedListNode(data);
        if (pNewItem)
        {
            //
            // If the list is empty, point everything at this item
            //
            if (Empty())
            {
                m_pHead = m_pTail = pNewItem;
            }

            //
            // Point the tail's next pointer to us, then point the tail at us
            //
            else
            {
                m_pTail->Next(pNewItem);
                m_pTail = pNewItem;
            }
            
            //
            // Increment the item count
            //
            m_nItemCount++;
        }

        //
        // Return an iterator that points to the new item
        //
        return Iterator(pNewItem);
    }
    
    bool Empty(void) const
    {
        return (m_pHead == NULL);
    }
};

template <class T>
class CSimpleStack : public CSimpleLinkedList<T>
{
private:
    CSimpleStack( const CSimpleStack &other );
    CSimpleStack &operator=( const CSimpleStack &other );
public:
    CSimpleStack(void)
    {
    }
    virtual ~CSimpleStack(void)
    {
    }
    void Push( const T &data )
    {
        Prepend(data);
    }
    bool Pop( T &data )
    {
        if (Empty())
            return false;
        Iterator iter(*this);
        data = *iter;
        Remove(*iter);
        return true;
    }
};


template <class T>
class CSimpleQueue : public CSimpleLinkedList<T>
{
private:
    CSimpleQueue( const CSimpleQueue &other );
    CSimpleQueue &operator=( const CSimpleQueue &other );
public:
    CSimpleQueue(void)
    {
    }
    virtual ~CSimpleQueue(void)
    {
    }
    void Enqueue( const T &data )
    {
        Append(data);
    }
    bool Dequeue( T &data )
    {
        if (Empty())
            return false;
        Iterator iter(*this);
        data = *iter;
        Remove(*iter);
        return true;
    }
};

#endif __SIMLIST_H_INCLUDED