spot  1.99.3
 All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
Public Member Functions | List of all members
spot::twa_graph_succ_iterator< Graph > Class Template Referencefinal
Inheritance diagram for spot::twa_graph_succ_iterator< Graph >:
Inheritance graph
Collaboration diagram for spot::twa_graph_succ_iterator< Graph >:
Collaboration graph

Public Member Functions

 twa_graph_succ_iterator (const Graph *g, edge t)
 
virtual void recycle (edge t)
 
virtual bool first ()
 Position the iterator on the first successor (if any). More...
 
virtual bool next ()
 Jump to the next successor (if any). More...
 
virtual bool done () const
 Check whether the iteration is finished. More...
 
virtual twa_graph_statecurrent_state () const
 Get the state of the current successor. More...
 
virtual bdd current_condition () const
 Get the condition on the transition leading to this successor. More...
 
virtual acc_cond::mark_t current_acceptance_conditions () const
 Get the acceptance conditions on the transition leading to this successor. More...
 
edge pos () const
 

Member Function Documentation

template<class Graph>
virtual acc_cond::mark_t spot::twa_graph_succ_iterator< Graph >::current_acceptance_conditions ( ) const
inlinevirtual

Get the acceptance conditions on the transition leading to this successor.

Implements spot::twa_succ_iterator.

template<class Graph>
virtual bdd spot::twa_graph_succ_iterator< Graph >::current_condition ( ) const
inlinevirtual

Get the condition on the transition leading to this successor.

This is a boolean function of atomic propositions.

Implements spot::twa_succ_iterator.

template<class Graph>
virtual twa_graph_state* spot::twa_graph_succ_iterator< Graph >::current_state ( ) const
inlinevirtual

Get the state of the current successor.

Note that the same state may occur at different points in the iteration. These actually correspond to the same destination. It just means there were several transitions, with different conditions, leading to the same state.

The returned state should be destroyed (see state::destroy) by the caller after it is no longer used.

Implements spot::twa_succ_iterator.

template<class Graph>
virtual bool spot::twa_graph_succ_iterator< Graph >::done ( ) const
inlinevirtual

Check whether the iteration is finished.

This function should be called after any call to first() or next() and before any enquiry about the current state.

The usual way to do this is with a for loop.

for (s->first(); !s->done(); s->next())
  ...  

Implements spot::twa_succ_iterator.

template<class Graph>
virtual bool spot::twa_graph_succ_iterator< Graph >::first ( )
inlinevirtual

Position the iterator on the first successor (if any).

This method can be called several times to make multiple passes over successors.

Warning
One should always call done() (or better: check the return value of first()) to ensure there is a successor, even after first(). A common trap is to assume that there is at least one successor: this is wrong.
Returns
whether there is actually a successor

Implements spot::twa_succ_iterator.

template<class Graph>
virtual bool spot::twa_graph_succ_iterator< Graph >::next ( )
inlinevirtual

Jump to the next successor (if any).

Warning
Again, one should always call done() (or better: check the return value of next()) ensure there is a successor.
Returns
whether there is actually a successor

Implements spot::twa_succ_iterator.


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

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Wed Aug 26 2015 08:42:38 for spot by doxygen 1.8.8