spot  1.2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Member Functions | List of all members
spot::ta_explicit_succ_iterator Class Reference

Successor iterators used by spot::ta_explicit. More...

#include <ta/taexplicit.hh>

Inheritance diagram for spot::ta_explicit_succ_iterator:
Inheritance graph
Collaboration diagram for spot::ta_explicit_succ_iterator:
Collaboration graph

Public Member Functions

 ta_explicit_succ_iterator (const state_ta_explicit *s)
 
 ta_explicit_succ_iterator (const state_ta_explicit *s, bdd condition)
 
virtual void first ()
 Position the iterator on the first successor (if any). More...
 
virtual void next ()
 Jump to the next successor (if any). More...
 
virtual bool done () const
 Check whether the iteration is finished. More...
 
virtual statecurrent_state () const
 Get the state of the current successor. More...
 
virtual bdd current_condition () const
 Get the changeset on the transition leading to current successor. More...
 
virtual bdd current_acceptance_conditions () const
 Get the acceptance conditions on the transition leading to this successor. More...
 

Detailed Description

Successor iterators used by spot::ta_explicit.

Member Function Documentation

virtual bdd spot::ta_explicit_succ_iterator::current_acceptance_conditions ( ) const
virtual

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

Implements spot::ta_succ_iterator.

virtual bdd spot::ta_explicit_succ_iterator::current_condition ( ) const
virtual

Get the changeset on the transition leading to current successor.

This is a boolean function of atomic propositions.

Implements spot::ta_succ_iterator.

virtual state* spot::ta_explicit_succ_iterator::current_state ( ) const
virtual

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::ta_succ_iterator.

virtual bool spot::ta_explicit_succ_iterator::done ( ) const
virtual

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::ta_succ_iterator.

virtual void spot::ta_explicit_succ_iterator::first ( )
virtual

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() 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.

Implements spot::ta_succ_iterator.

virtual void spot::ta_explicit_succ_iterator::next ( )
virtual

Jump to the next successor (if any).

Warning
Again, one should always call done() to ensure there is a successor.

Implements spot::ta_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 Thu May 15 2014 11:04:11 for spot by doxygen 1.8.4