LinkedListHead::Iterator< _Ty > Class Template Reference

#include "LinkedList.h"

Public Types
typedef std::bidirectional_iterator_tag	iterator_category
typedef _Ty	value_type
typedef ptrdiff_t	difference_type
typedef ptrdiff_t	distance_type
typedef _Ty *	pointer
typedef _Ty const *	const_pointer
typedef _Ty &	reference
typedef _Ty const &	const_reference

Public Member Functions
	Iterator ()
	Iterator (pointer _Pnode)
Iterator &	operator= (Iterator const &_Right)
Iterator &	operator= (const_pointer const &_Right)
reference	operator* ()
pointer	operator-> ()
Iterator &	operator++ ()
Iterator	operator++ (int)
Iterator &	operator-- ()
Iterator	operator-- (int)
bool	operator== (Iterator const &_Right) const
bool	operator!= (Iterator const &_Right) const
bool	operator== (pointer const &_Right) const
bool	operator!= (pointer const &_Right) const
bool	operator== (const_reference _Right) const
bool	operator!= (const_reference _Right) const
pointer	_Mynode ()

Protected Attributes
pointer	_Ptr

Detailed Description

template<class _Ty>
class LinkedListHead::Iterator< _Ty >

Member Typedef Documentation

const_pointer

template<class _Ty >

typedef _Ty const* LinkedListHead::Iterator< _Ty >::const_pointer

const_reference

template<class _Ty >

typedef _Ty const& LinkedListHead::Iterator< _Ty >::const_reference

difference_type

template<class _Ty >

typedef ptrdiff_t LinkedListHead::Iterator< _Ty >::difference_type

distance_type

template<class _Ty >

typedef ptrdiff_t LinkedListHead::Iterator< _Ty >::distance_type

iterator_category

template<class _Ty >

typedef std::bidirectional_iterator_tag LinkedListHead::Iterator< _Ty >::iterator_category

pointer

template<class _Ty >

typedef _Ty* LinkedListHead::Iterator< _Ty >::pointer

reference

template<class _Ty >

typedef _Ty& LinkedListHead::Iterator< _Ty >::reference

value_type

template<class _Ty >

typedef _Ty LinkedListHead::Iterator< _Ty >::value_type

Constructor & Destructor Documentation

Iterator() [1/2]

template<class _Ty >

LinkedListHead::Iterator< _Ty >::Iterator ( )

inline

                   : _Ptr(0)
        {
            // construct with null node pointer
        }

Iterator() [2/2]

template<class _Ty >

LinkedListHead::Iterator< _Ty >::Iterator ( pointer  _Pnode )

inline

                                 : _Ptr(_Pnode)
        {
            // construct with node pointer _Pnode
        }

Member Function Documentation

_Mynode()

template<class _Ty >

pointer LinkedListHead::Iterator< _Ty >::_Mynode ( )

inline

        {
            // return node pointer
            return (_Ptr);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator!=() [1/3]

template<class _Ty >

bool LinkedListHead::Iterator< _Ty >::operator!= ( const_reference  _Right ) const

inline

        {
            // test for reference equality
            return (_Ptr != &_Right);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator!=() [2/3]

template<class _Ty >

bool LinkedListHead::Iterator< _Ty >::operator!= ( Iterator< _Ty > const &  _Right ) const

inline

        {
            // test for iterator inequality
            return (!(*this == _Right));
        }

operator!=() [3/3]

template<class _Ty >

bool LinkedListHead::Iterator< _Ty >::operator!= ( pointer const &  _Right ) const

inline

        {
            // test for pointer equality
            return (!(*this == _Right));
        }

operator*()

template<class _Ty >

reference LinkedListHead::Iterator< _Ty >::operator* ( )

inline

        {
            // return designated value
            return *_Ptr;
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator++() [1/2]

template<class _Ty >

Iterator & LinkedListHead::Iterator< _Ty >::operator++ ( )

inline

        {
            // preincrement
            _Ptr = _Ptr->next();
            return (*this);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator++() [2/2]

template<class _Ty >

Iterator LinkedListHead::Iterator< _Ty >::operator++ ( int  )

inline

        {
            // postincrement
            iterator _Tmp = *this;
            ++*this;
            return (_Tmp);
        }

operator--() [1/2]

template<class _Ty >

Iterator & LinkedListHead::Iterator< _Ty >::operator-- ( )

inline

        {
            // predecrement
            _Ptr = _Ptr->prev();
            return (*this);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator--() [2/2]

template<class _Ty >

Iterator LinkedListHead::Iterator< _Ty >::operator-- ( int  )

inline

        {
            // postdecrement
            iterator _Tmp = *this;
            --*this;
            return (_Tmp);
        }

operator->()

template<class _Ty >

pointer LinkedListHead::Iterator< _Ty >::operator-> ( )

inline

        {
            // return pointer to class object
            return _Ptr;
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator=() [1/2]

template<class _Ty >

Iterator & LinkedListHead::Iterator< _Ty >::operator= ( const_pointer const &  _Right )

inline

        {
            _Ptr = pointer(_Right);
            return *this;
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator=() [2/2]

template<class _Ty >

Iterator & LinkedListHead::Iterator< _Ty >::operator= ( Iterator< _Ty > const &  _Right )

inline

        {
            _Ptr = _Right._Ptr;
            return *this;
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator==() [1/3]

template<class _Ty >

bool LinkedListHead::Iterator< _Ty >::operator== ( const_reference  _Right ) const

inline

        {
            // test for reference equality
            return (_Ptr == &_Right);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator==() [2/3]

template<class _Ty >

bool LinkedListHead::Iterator< _Ty >::operator== ( Iterator< _Ty > const &  _Right ) const

inline

        {
            // test for iterator equality
            return (_Ptr == _Right._Ptr);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

operator==() [3/3]

template<class _Ty >

bool LinkedListHead::Iterator< _Ty >::operator== ( pointer const &  _Right ) const

inline

        {
            // test for pointer equality
            return (_Ptr != _Right);
        }

References LinkedListHead::Iterator< _Ty >::_Ptr.

Member Data Documentation

_Ptr

template<class _Ty >

pointer LinkedListHead::Iterator< _Ty >::_Ptr

protected

Referenced by LinkedListHead::Iterator< _Ty >::_Mynode(), LinkedListHead::Iterator< _Ty >::operator!=(), LinkedListHead::Iterator< _Ty >::operator*(), LinkedListHead::Iterator< _Ty >::operator++(), LinkedListHead::Iterator< _Ty >::operator--(), LinkedListHead::Iterator< _Ty >::operator->(), LinkedListHead::Iterator< _Ty >::operator=(), LinkedListHead::Iterator< _Ty >::operator=(), LinkedListHead::Iterator< _Ty >::operator==(), LinkedListHead::Iterator< _Ty >::operator==(), and LinkedListHead::Iterator< _Ty >::operator==().

---

The documentation for this class was generated from the following file:

• azerothcore-wotlk/src/common/Dynamic/LinkedList.h