Otawa  0.10
otawa::graph::Graph::InIterator Class Reference

#include <otawa/graph/Graph.h>

Inheritance diagram for otawa::graph::Graph::InIterator:
elm::PreIterator< InIterator, graph::Edge * >

Public Member Functions

 InIterator (const Node *source)
 
 InIterator (const Graph &graph, const Node *source)
 
 InIterator (const InIterator &iterator)
 
bool ended (void) const
 
graph::Edgeitem (void) const
 
void next (void)
 
 operator bool (void) const
 
 operator graph::Edge * (void) const
 
InIteratoroperator++ (void)
 
InIteratoroperator++ (int)
 
graph::Edgeoperator* (void) const
 
graph::Edgeoperator-> (void) const
 

Private Attributes

Node::Predecessor iter
 

Constructor & Destructor Documentation

otawa::graph::Graph::InIterator::InIterator ( const Node source)
inline
otawa::graph::Graph::InIterator::InIterator ( const Graph graph,
const Node source 
)
inline
otawa::graph::Graph::InIterator::InIterator ( const InIterator iterator)
inline

Member Function Documentation

bool otawa::graph::Graph::InIterator::ended ( void  ) const
inline
graph::Edge* otawa::graph::Graph::InIterator::item ( void  ) const
inline
void otawa::graph::Graph::InIterator::next ( void  )
inline
elm::PreIterator< InIterator , graph::Edge * >::operator bool ( void  ) const
inherited
elm::PreIterator< InIterator , graph::Edge * >::operator graph::Edge * ( void  ) const
inherited
graph::Edge * elm::PreIterator< InIterator , graph::Edge * >::operator* ( void  ) const
inherited
InIterator & elm::PreIterator< InIterator , graph::Edge * >::operator++ ( int  )
inherited
InIterator & elm::PreIterator< InIterator , graph::Edge * >::operator++ ( void  )
inherited
graph::Edge * elm::PreIterator< InIterator , graph::Edge * >::operator-> ( void  ) const
inherited

Member Data Documentation

Node::Predecessor otawa::graph::Graph::InIterator::iter
private

Referenced by ended(), item(), and next().


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