QueueIterator.h

Go to the documentation of this file.

/*********************************************************\
 *  File: QueueIterator.h                                *
 *
 *  Copyright (C) 2002-2012 The PixelLight Team (http://www.pixellight.org/)
 *
 *  This file is part of PixelLight.
 *
 *  PixelLight is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU Lesser General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  PixelLight is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 *  GNU Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with PixelLight. If not, see <http://www.gnu.org/licenses/>.
\*********************************************************/


#ifndef __PLCORE_CONTAINER_QUEUEITERATOR_H__
#define __PLCORE_CONTAINER_QUEUEITERATOR_H__
#pragma once


//[-------------------------------------------------------]
//[ Includes                                              ]
//[-------------------------------------------------------]
#include "PLCore/Container/IteratorImpl.h"


//[-------------------------------------------------------]
//[ Namespace                                             ]
//[-------------------------------------------------------]
namespace PLCore {


//[-------------------------------------------------------]
//[ Forward declarations                                  ]
//[-------------------------------------------------------]
template <class ValueType> class Queue;


//[-------------------------------------------------------]
//[ Classes                                               ]
//[-------------------------------------------------------]
/**
*  @brief
*    Queue iterator class
*/
template <class ValueType>
class QueueIterator : public IteratorImpl<ValueType> {


    //[-------------------------------------------------------]
    //[ Friends                                               ]
    //[-------------------------------------------------------]
    friend class Queue<ValueType>;


    //[-------------------------------------------------------]
    //[ Private functions                                     ]
    //[-------------------------------------------------------]
    private:
        /**
        *  @brief
        *    Constructor
        *
        *  @param[in] lstQueue
        *    Queue to operate on
        *  @param[in] nIndex
        *    Start index, if >= GetNumOfElements() the index is set to the last valid index
        */
        QueueIterator(const Queue<ValueType> &lstQueue, uint32 nIndex);

        /**
        *  @brief
        *    Constructor
        *
        *  @param[in] lstQueue
        *    Queue to operate on
        *
        *  @note
        *    - The iterator will start at the last element
        */
        QueueIterator(const Queue<ValueType> &lstQueue);

        /**
        *  @brief
        *    Copy constructor
        *
        *  @param[in] cSource
        *    Source to copy from
        */
        QueueIterator(const QueueIterator<ValueType> &cSource);

        /**
        *  @brief
        *    Destructor
        */
        virtual ~QueueIterator();


    //[-------------------------------------------------------]
    //[ Private data                                          ]
    //[-------------------------------------------------------]
    private:
        const Queue<ValueType>                  *m_plstQueue;           /**< Queue to operate on (always valid!) */
        typename Queue<ValueType>::QueueElement *m_pNextElement;        /**< Next list element, can be a null pointer */
        typename Queue<ValueType>::QueueElement *m_pPreviousElement;    /**< Previous list element, can be a null pointer */


    //[-------------------------------------------------------]
    //[ Private virtual IteratorImpl functions                ]
    //[-------------------------------------------------------]
    private:
        virtual IteratorImpl<ValueType> *Clone() const override;
        virtual bool HasNext() const override;
        virtual ValueType &Next() override;
        virtual bool HasPrevious() const override;
        virtual ValueType &Previous() override;


};


//[-------------------------------------------------------]
//[ Namespace                                             ]
//[-------------------------------------------------------]
} // PLCore


//[-------------------------------------------------------]
//[ Implementation                                        ]
//[-------------------------------------------------------]
#include "PLCore/Container/QueueIterator.inl"


#endif // __PLCORE_CONTAINER_QUEUEITERATOR_H__