_Tree_unchecked_const_iterator< _Mytree, _Base > Class Template Reference

Inheritance diagram for _Tree_unchecked_const_iterator< _Mytree, _Base >:

Public Types
typedef _Tree_unchecked_const_iterator< _Mytree, _Base >	_Myiter
typedef bidirectional_iterator_tag	iterator_category
typedef _Mytree::_Nodeptr	_Nodeptr
typedef _Mytree::value_type	value_type
typedef _Mytree::difference_type	difference_type
typedef _Mytree::const_pointer	pointer
typedef _Mytree::const_reference	reference
Public Types inherited from _Iterator012< bidirectional_iterator_tag, _Mytree::value_type, _Mytree::difference_type, _Mytree::const_pointer, _Mytree::const_reference, _Base >
typedef bidirectional_iterator_tag	iterator_category
typedef _Mytree::value_type	value_type
typedef _Mytree::difference_type	difference_type
typedef _Mytree::const_pointer	pointer
typedef _Mytree::const_reference	reference

Public Member Functions
	_Tree_unchecked_const_iterator ()
	_Tree_unchecked_const_iterator (_Nodeptr _Pnode, const _Mytree *_Plist)
reference	operator* () const
pointer	operator-> () const
_Myiter &	operator++ ()
_Myiter	operator++ (int)
_Myiter &	operator-- ()
_Myiter	operator-- (int)
bool	operator== (const _Myiter &_Right) const
bool	operator!= (const _Myiter &_Right) const
_Nodeptr	_Mynode () const

Public Attributes
_Nodeptr	_Ptr

Member Typedef Documentation

template<class _Mytree, class _Base = _Iterator_base0>

typedef _Tree_unchecked_const_iterator<_Mytree, _Base> _Tree_unchecked_const_iterator< _Mytree, _Base >::_Myiter

template<class _Mytree, class _Base = _Iterator_base0>

typedef _Mytree::_Nodeptr _Tree_unchecked_const_iterator< _Mytree, _Base >::_Nodeptr

template<class _Mytree, class _Base = _Iterator_base0>

typedef _Mytree::difference_type _Tree_unchecked_const_iterator< _Mytree, _Base >::difference_type

template<class _Mytree, class _Base = _Iterator_base0>

typedef bidirectional_iterator_tag _Tree_unchecked_const_iterator< _Mytree, _Base >::iterator_category

template<class _Mytree, class _Base = _Iterator_base0>

typedef _Mytree::const_pointer _Tree_unchecked_const_iterator< _Mytree, _Base >::pointer

template<class _Mytree, class _Base = _Iterator_base0>

typedef _Mytree::const_reference _Tree_unchecked_const_iterator< _Mytree, _Base >::reference

template<class _Mytree, class _Base = _Iterator_base0>

typedef _Mytree::value_type _Tree_unchecked_const_iterator< _Mytree, _Base >::value_type

Constructor & Destructor Documentation

template<class _Mytree, class _Base = _Iterator_base0>

_Tree_unchecked_const_iterator< _Mytree, _Base >::_Tree_unchecked_const_iterator ( )

inline

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

template<class _Mytree, class _Base = _Iterator_base0>

_Tree_unchecked_const_iterator< _Mytree, _Base >::_Tree_unchecked_const_iterator ( _Nodeptr  _Pnode, const _Mytree *  _Plist  )

inline

        : _Ptr(_Pnode)
        {   // construct with node pointer _Pnode
        this->_Adopt(_Plist);
        }

Member Function Documentation

template<class _Mytree, class _Base = _Iterator_base0>

_Nodeptr _Tree_unchecked_const_iterator< _Mytree, _Base >::_Mynode ( ) const

inline

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

template<class _Mytree, class _Base = _Iterator_base0>

bool _Tree_unchecked_const_iterator< _Mytree, _Base >::operator!= ( const _Myiter &  _Right ) const

inline

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

template<class _Mytree, class _Base = _Iterator_base0>

reference _Tree_unchecked_const_iterator< _Mytree, _Base >::operator* ( ) const

inline

        {   // return designated value
        return (_Mytree::_Myval(_Ptr));
        }

template<class _Mytree, class _Base = _Iterator_base0>

_Myiter& _Tree_unchecked_const_iterator< _Mytree, _Base >::operator++ ( )

inline

        {   // preincrement
        if (_Mytree::_Isnil(_Ptr))
            ;   // end() shouldn't be incremented, don't move
        else if (!_Mytree::_Isnil(_Mytree::_Right(_Ptr)))
            _Ptr = _Mytree::_Min(
                _Mytree::_Right(_Ptr)); // ==> smallest of right subtree
        else
            {   // climb looking for right subtree
            _Nodeptr _Pnode;
            while (!_Mytree::_Isnil(_Pnode = _Mytree::_Parent(_Ptr))
                && _Ptr == _Mytree::_Right(_Pnode))
                _Ptr = _Pnode;  // ==> parent while right subtree
            _Ptr = _Pnode;  // ==> parent (head if end())
            }
        return (*this);
        }

template<class _Mytree, class _Base = _Iterator_base0>

_Myiter _Tree_unchecked_const_iterator< _Mytree, _Base >::operator++ ( int  )

inline

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

template<class _Mytree, class _Base = _Iterator_base0>

_Myiter& _Tree_unchecked_const_iterator< _Mytree, _Base >::operator-- ( )

inline

        {   // predecrement
        if (_Mytree::_Isnil(_Ptr))
            _Ptr = _Mytree::_Right(_Ptr);   // end() ==> rightmost
        else if (!_Mytree::_Isnil(_Mytree::_Left(_Ptr)))
            _Ptr = _Mytree::_Max(
                _Mytree::_Left(_Ptr));  // ==> largest of left subtree
        else
            {   // climb looking for left subtree
            _Nodeptr _Pnode;
            while (!_Mytree::_Isnil(_Pnode = _Mytree::_Parent(_Ptr))
                && _Ptr == _Mytree::_Left(_Pnode))
                _Ptr = _Pnode;  // ==> parent while left subtree
            if (_Mytree::_Isnil(_Ptr))
                ;   // begin() shouldn't be decremented, don't move
            else
                _Ptr = _Pnode;  // ==> parent if not head
            }
        return (*this);
        }

template<class _Mytree, class _Base = _Iterator_base0>

_Myiter _Tree_unchecked_const_iterator< _Mytree, _Base >::operator-- ( int  )

inline

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

template<class _Mytree, class _Base = _Iterator_base0>

pointer _Tree_unchecked_const_iterator< _Mytree, _Base >::operator-> ( ) const

inline

        {   // return pointer to class object
        return (pointer_traits<pointer>::pointer_to(**this));
        }

template<class _Mytree, class _Base = _Iterator_base0>

bool _Tree_unchecked_const_iterator< _Mytree, _Base >::operator== ( const _Myiter &  _Right ) const

inline

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

Member Data Documentation

template<class _Mytree, class _Base = _Iterator_base0>

_Nodeptr _Tree_unchecked_const_iterator< _Mytree, _Base >::_Ptr

---

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

• VS2017/inc/xtree