spot  1.99.4
 All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
Public Member Functions | Protected Attributes | List of all members
spot::fair_kripke_succ_iterator Class Referenceabstract

Iterator code for a Fair Kripke structure. More...

#include <kripke/fairkripke.hh>

Inheritance diagram for spot::fair_kripke_succ_iterator:
Inheritance graph
Collaboration diagram for spot::fair_kripke_succ_iterator:
Collaboration graph

Public Member Functions

 fair_kripke_succ_iterator (const bdd &cond, acc_cond::mark_t acc_cond)
 Constructor. 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...
 
Iteration
virtual bool first ()=0
 Position the iterator on the first successor (if any). More...
 
virtual bool next ()=0
 Jump to the next successor (if any). More...
 
virtual bool done () const =0
 Check whether the iteration is finished. More...
 
Inspection
virtual statecurrent_state () const =0
 Get the state of the current successor. More...
 

Protected Attributes

bdd cond_
 
acc_cond::mark_t acc_cond_
 

Detailed Description

Iterator code for a Fair Kripke structure.

This iterator can be used to simplify the writing of an iterator on a Fair Kripke structure (or lookalike).

If you inherit from this iterator, you should only redefine

This class implements fair_kripke_succ_iterator::current_condition(), and fair_kripke_succ_iterator::current_acceptance_conditions().

Constructor & Destructor Documentation

spot::fair_kripke_succ_iterator::fair_kripke_succ_iterator ( const bdd &  cond,
acc_cond::mark_t  acc_cond 
)

Member Function Documentation

virtual acc_cond::mark_t spot::fair_kripke_succ_iterator::current_acceptance_conditions ( ) const
virtual

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

Implements spot::twa_succ_iterator.

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

Get the condition on the transition leading to this successor.

This is a boolean function of atomic propositions.

Implements spot::twa_succ_iterator.

virtual state* spot::twa_succ_iterator::current_state ( ) const
pure virtualinherited

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.

Implemented in spot::ta_explicit_succ_iterator, spot::ta_succ_iterator, spot::twa_graph_succ_iterator< Graph >, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::ta_succ_iterator_product, and spot::tgta_succ_iterator_product.

virtual bool spot::twa_succ_iterator::done ( ) const
pure virtualinherited

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

Implemented in spot::ta_explicit_succ_iterator, spot::ta_succ_iterator, spot::twa_graph_succ_iterator< Graph >, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::ta_succ_iterator_product, and spot::tgta_succ_iterator_product.

virtual bool spot::twa_succ_iterator::first ( )
pure virtualinherited

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

Implemented in spot::ta_explicit_succ_iterator, spot::ta_succ_iterator, spot::twa_graph_succ_iterator< Graph >, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::ta_succ_iterator_product, and spot::tgta_succ_iterator_product.

virtual bool spot::twa_succ_iterator::next ( )
pure virtualinherited

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

Implemented in spot::ta_explicit_succ_iterator, spot::ta_succ_iterator, spot::twa_graph_succ_iterator< Graph >, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::ta_succ_iterator_product, and spot::tgta_succ_iterator_product.


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 Oct 1 2015 05:49:15 for spot by doxygen 1.8.8