Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator Class Reference

#include <graph.H>

Inheritance diagram for Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator:

Collaboration diagram for Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator:

Public Member Functions
	AdjacentArcIterator ()
	AdjacentArcIterator (const Graph &g, Node *n)
	AdjacentArcIterator (const Graph &g, Node *n, DL *curr)
	AdjacentArcIterator (const AdjacentArcIterator &it)
	AdjacentArcIterator (AdjacentArcIterator &&it)
AdjacentArcIterator &	operator= (const AdjacentArcIterator &it)
AdjacentArcIterator &	operator= (AdjacentArcIterator &&it)
void	swap (AdjacentArcIterator &it)
Arc *	get_current ()
Arc *	get_current () const
Node *	get_src_node ()
Node *	get_src_node () const
Node *	get_tgt_node ()
const Node *	get_tgt_node () const
Public Member Functions inherited from Designar::DL::Iterator
	Iterator ()
	Iterator (DL *h)
	Iterator (DL *h, DL *c)
	Iterator (const Iterator &it)
	Iterator (Iterator &&it)
Iterator &	operator= (const Iterator &it)
Iterator &	operator= (Iterator &&it)
void	swap (Iterator &it)
bool	has_current () const
DL *	get_current ()
DL *	get_current () const
void	next ()
void	prev ()
void	reset ()
DL *	del ()
Public Member Functions inherited from Designar::BidirectionalIterator< AdjacentArcIterator, Arc *, true >
AdjacentArcIterator &	operator-- ()
AdjacentArcIterator	operator-- (int)
Public Member Functions inherited from Designar::ForwardIterator< AdjacentArcIterator, Arc *, RET_CPY >
AdjacentArcIterator &	operator++ ()
AdjacentArcIterator	operator++ (int)
Public Member Functions inherited from Designar::BasicIterator< AdjacentArcIterator, Arc *, RET_CPY >
bool	has_curr () const
RetType< RET_CPY, Arc *, Arc *& >	get_curr ()
RetType< RET_CPY, Arc *, const Arc *& >	get_curr () const
RetType< RET_CPY, Arc *, Arc *& >	operator* ()
RetType< RET_CPY, Arc *, const Arc *& >	operator* () const
Arc **	operator-> ()
bool	operator== (const AdjacentArcIterator &it) const
bool	operator!= (const AdjacentArcIterator &it) const

Friends
class	BasicIterator< AdjacentArcIterator, Arc *, true >

Additional Inherited Members
Protected Member Functions inherited from Designar::DL::Iterator
DL *	get_head () const
DL *	get_location () const
Protected Member Functions inherited from Designar::BasicIterator< AdjacentArcIterator, Arc *, RET_CPY >
AdjacentArcIterator &	me ()
const AdjacentArcIterator &	const_me () const

Constructor & Destructor Documentation

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::AdjacentArcIterator ( )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::AdjacentArcIterator ( const Graph &  g, Node *  n  )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::AdjacentArcIterator ( const Graph &  g, Node *  n, DL *  curr  )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::AdjacentArcIterator ( const AdjacentArcIterator &  it )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::AdjacentArcIterator ( AdjacentArcIterator &&  it )

inline

Member Function Documentation

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Arc* Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::get_current ( )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Arc* Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::get_current ( ) const

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Node* Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::get_src_node ( )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Node* Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::get_src_node ( ) const

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

Node* Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::get_tgt_node ( )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

const Node* Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::get_tgt_node ( ) const

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

AdjacentArcIterator& Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::operator= ( const AdjacentArcIterator &  it )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

AdjacentArcIterator& Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::operator= ( AdjacentArcIterator &&  it )

inline

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

void Designar::Graph< NodeInfo, ArcInfo, GraphInfo >::AdjacentArcIterator::swap ( AdjacentArcIterator &  it )

inline

Friends And Related Function Documentation

template<typename NodeInfo , typename ArcInfo = EmptyClass, typename GraphInfo = EmptyClass>

friend class BasicIterator< AdjacentArcIterator, Arc *, true >

friend

---

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

• include/graph.H