OgreIteratorWrappers.h

Go to the documentation of this file.

/*
-----------------------------------------------------------------------------
This source file is part of OGRE
    (Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/

Copyright (c) 2000-2005 The OGRE Team
Also see acknowledgements in Readme.html

This program 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 2 of the License, or (at your option) any later
version.

This program 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
this program; if not, write to the Free Software Foundation, Inc., 59 Temple
Place - Suite 330, Boston, MA 02111-1307, USA, or go to
http://www.gnu.org/copyleft/lesser.txt.
-----------------------------------------------------------------------------
*/
#ifndef __IteratorWrappers_H__
#define __IteratorWrappers_H__

#include "OgrePrerequisites.h"

namespace Ogre {

    template <class T>
    class VectorIterator
    {
    private:
        typename T::iterator mCurrent;
        typename T::iterator mEnd;
        VectorIterator() {};
    public:
        typedef typename T::value_type ValueType;

        VectorIterator(typename T::iterator start, typename T::iterator end)
            : mCurrent(start), mEnd(end)
        {
        }

        bool hasMoreElements(void) const
        {
            return mCurrent != mEnd;
        }

        typename T::value_type getNext(void)
        {
            return *mCurrent++;
        }
        typename T::value_type peekNext(void)
        {
            return *mCurrent;
        }
        typename T::pointer peekNextPtr(void)
        {
            return &(*mCurrent);
        }
        void moveNext(void)
        {
            mCurrent++;
        }



    };

    template <class T>
    class MapIterator
    {
    private:
        typename T::iterator mCurrent;
        typename T::iterator mEnd;
        MapIterator() {};
    public:
        typedef typename T::mapped_type MappedType;
        typedef typename T::key_type KeyType;

        MapIterator(typename T::iterator start, typename T::iterator end)
            : mCurrent(start), mEnd(end)
        {
        }

        bool hasMoreElements(void) const
        {
            return mCurrent != mEnd;
        }

        typename T::mapped_type getNext(void)
        {
            return (mCurrent++)->second;
        }
        typename T::mapped_type peekNextValue(void)
        {
            return mCurrent->second;
        }
        typename T::key_type peekNextKey(void)
        {
            return mCurrent->first;
        }
        MapIterator<T> & operator=( MapIterator<T> &rhs )
        {
            mCurrent = rhs.mCurrent;
            mEnd = rhs.mEnd;
            return *this;
        }
        typename T::pointer peekNextValuePtr(void)
        {
            return &(mCurrent->second);
        }
        void moveNext(void)
        {
            mCurrent++;
        }



    };
    template <class T>
    class ConstVectorIterator
    {
    private:
        mutable typename T::const_iterator mCurrent;
        typename T::const_iterator mEnd;
        ConstVectorIterator() {};
    public:
        typedef typename T::value_type ValueType;

        ConstVectorIterator(typename T::const_iterator start, typename T::const_iterator end)
            : mCurrent(start), mEnd(end)
        {
        }

        bool hasMoreElements(void) const
        {
            return mCurrent != mEnd;
        }

        typename T::value_type getNext(void)
        {
            return *mCurrent++;
        }
        typename T::value_type peekNext(void) const
        {
            return *mCurrent;
        }
        typename T::const_pointer peekNextPtr(void) const
        {
            return &(*mCurrent);
        }
        void moveNext(void) const
        {
            mCurrent++;
        }



    };

    template <class T>
    class ConstMapIterator
    {
    private:
        mutable typename T::const_iterator mCurrent;
        typename T::const_iterator mEnd;
        ConstMapIterator() {};
    public:
        typedef typename T::mapped_type MappedType;
        typedef typename T::key_type KeyType;

        ConstMapIterator(typename T::const_iterator start, typename T::const_iterator end)
            : mCurrent(start), mEnd(end)
        {
        }

        bool hasMoreElements(void) const
        {
            return mCurrent != mEnd;
        }

        typename T::mapped_type getNext(void)
        {
            return (mCurrent++)->second;
        }
        typename T::mapped_type peekNextValue(void) const
        {
            return mCurrent->second;
        }
        typename T::key_type peekNextKey(void) const
        {
            return mCurrent->first;
        }
        MapIterator<T> & operator=( MapIterator<T> &rhs )
        {
            mCurrent = rhs.mCurrent;
            mEnd = rhs.mEnd;
            return *this;
        }
        typename T::const_pointer peekNextValuePtr(void) const
        {
            return &(mCurrent->second);
        }
        void moveNext(void) const
        {
            mCurrent++;
        }



    };
}
#endif

---

Copyright © 2000-2005 by The OGRE Team

This work is licensed under a Creative Commons Attribution-ShareAlike 2.5 License.
Last modified Sun Feb 12 12:59:47 2006