DeSiGNAR  0.5a
Data Structures General Library
Public Member Functions | Protected Member Functions | Friends | List of all members
Designar::MTreeNode< Key >::ChildrenIterator Class Reference

#include <nodesdef.H>

Inheritance diagram for Designar::MTreeNode< Key >::ChildrenIterator:
Inheritance graph
[legend]
Collaboration diagram for Designar::MTreeNode< Key >::ChildrenIterator:
Collaboration graph
[legend]

Public Member Functions

 ChildrenIterator ()
 
 ChildrenIterator (const MTreeNode &node)
 
 ChildrenIterator (const ChildrenIterator &it)
 
 ChildrenIterator (ChildrenIterator &&it)
 
ChildrenIteratoroperator= (const ChildrenIterator &it)
 
ChildrenIteratoroperator= (ChildrenIterator &&it)
 
void swap (ChildrenIterator &it)
 
nat_t get_position () const
 
bool has_current () const
 
MTreeNodeget_current ()
 
MTreeNodeget_current () const
 
void next ()
 
void prev ()
 
- Public Member Functions inherited from Designar::BidirectionalIterator< ChildrenIterator, MTreeNode *, true >
ChildrenIterator & operator-- ()
 
ChildrenIterator operator-- (int)
 
- Public Member Functions inherited from Designar::ForwardIterator< ChildrenIterator, MTreeNode *, RET_CPY >
ChildrenIterator & operator++ ()
 
ChildrenIterator operator++ (int)
 
- Public Member Functions inherited from Designar::BasicIterator< ChildrenIterator, MTreeNode *, RET_CPY >
bool has_curr () const
 
RetType< RET_CPY, MTreeNode *, MTreeNode *& > get_curr ()
 
RetType< RET_CPY, MTreeNode *, const MTreeNode *& > get_curr () const
 
RetType< RET_CPY, MTreeNode *, MTreeNode *& > operator* ()
 
RetType< RET_CPY, MTreeNode *, const MTreeNode *& > operator* () const
 
MTreeNode ** operator-> ()
 
bool operator== (const ChildrenIterator &it) const
 
bool operator!= (const ChildrenIterator &it) const
 

Protected Member Functions

MTreeNodeget_location () const
 
- Protected Member Functions inherited from Designar::BasicIterator< ChildrenIterator, MTreeNode *, RET_CPY >
ChildrenIterator & me ()
 
const ChildrenIterator & const_me () const
 

Friends

class BasicIterator< ChildrenIterator, MTreeNode *, true >
 

Constructor & Destructor Documentation

template<typename Key >
Designar::MTreeNode< Key >::ChildrenIterator::ChildrenIterator ( )
inline
template<typename Key >
Designar::MTreeNode< Key >::ChildrenIterator::ChildrenIterator ( const MTreeNode node)
inline
template<typename Key >
Designar::MTreeNode< Key >::ChildrenIterator::ChildrenIterator ( const ChildrenIterator it)
inline
template<typename Key >
Designar::MTreeNode< Key >::ChildrenIterator::ChildrenIterator ( ChildrenIterator &&  it)
inline

Member Function Documentation

template<typename Key >
MTreeNode* Designar::MTreeNode< Key >::ChildrenIterator::get_current ( )
inline
template<typename Key >
MTreeNode* Designar::MTreeNode< Key >::ChildrenIterator::get_current ( ) const
inline
template<typename Key >
MTreeNode* Designar::MTreeNode< Key >::ChildrenIterator::get_location ( ) const
inlineprotected
template<typename Key >
nat_t Designar::MTreeNode< Key >::ChildrenIterator::get_position ( ) const
inline
template<typename Key >
bool Designar::MTreeNode< Key >::ChildrenIterator::has_current ( ) const
inline
template<typename Key >
void Designar::MTreeNode< Key >::ChildrenIterator::next ( )
inline
template<typename Key >
ChildrenIterator& Designar::MTreeNode< Key >::ChildrenIterator::operator= ( const ChildrenIterator it)
inline
template<typename Key >
ChildrenIterator& Designar::MTreeNode< Key >::ChildrenIterator::operator= ( ChildrenIterator &&  it)
inline
template<typename Key >
void Designar::MTreeNode< Key >::ChildrenIterator::prev ( )
inline
template<typename Key >
void Designar::MTreeNode< Key >::ChildrenIterator::swap ( ChildrenIterator it)
inline

Friends And Related Function Documentation

template<typename Key >
friend class BasicIterator< ChildrenIterator, MTreeNode *, true >
friend

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