spot
1.2.4
|
Iterator code for Kripke structure. More...
#include <kripke/kripke.hh>
Public Member Functions | |
kripke_succ_iterator (const bdd &cond) | |
Constructor. More... | |
virtual bdd | current_condition () const |
Get the condition on the transition leading to this successor. More... | |
virtual bdd | current_acceptance_conditions () const |
Get the acceptance conditions on the transition leading to this successor. More... | |
Iteration | |
virtual void | first ()=0 |
Position the iterator on the first successor (if any). More... | |
virtual void | next ()=0 |
Jump to the next successor (if any). More... | |
virtual bool | done () const =0 |
Check whether the iteration is finished. More... | |
Inspection | |
virtual state * | current_state () const =0 |
Get the state of the current successor. More... | |
Protected Attributes | |
bdd | cond_ |
Iterator code for Kripke structure.
This iterator can be used to simplify the writing of an iterator on a Kripke structure (or lookalike).
If you inherit from this iterator, you should only redefine
This class implements kripke_succ_iterator::current_condition(), and kripke_succ_iterator::current_acceptance_conditions().
spot::kripke_succ_iterator::kripke_succ_iterator | ( | const bdd & | cond) |
Constructor.
The cond argument will be the one returned by kripke_succ_iterator::current_condition().
|
virtual |
Get the acceptance conditions on the transition leading to this successor.
Implements spot::tgba_succ_iterator.
|
virtual |
Get the condition on the transition leading to this successor.
This is a boolean function of atomic propositions.
Implements spot::tgba_succ_iterator.
|
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::tgba_explicit_succ_iterator< State >, spot::ta_succ_iterator, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::ta_succ_iterator_product, spot::tgba_succ_iterator_union, spot::tgta_succ_iterator_product, and spot::tgba_succ_iterator_concrete.
|
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::tgba_explicit_succ_iterator< State >, spot::ta_succ_iterator, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::tgba_succ_iterator_union, spot::ta_succ_iterator_product, spot::tgta_succ_iterator_product, and spot::tgba_succ_iterator_concrete.
|
pure virtualinherited |
Position the iterator on the first successor (if any).
This method can be called several times to make multiple passes over successors.
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. Implemented in spot::ta_explicit_succ_iterator, spot::tgba_explicit_succ_iterator< State >, spot::ta_succ_iterator, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::tgba_succ_iterator_union, spot::ta_succ_iterator_product, spot::tgta_succ_iterator_product, and spot::tgba_succ_iterator_concrete.
|
pure virtualinherited |
Jump to the next successor (if any).
done()
to ensure there is a successor. Implemented in spot::ta_explicit_succ_iterator, spot::tgba_explicit_succ_iterator< State >, spot::ta_succ_iterator, spot::taa_succ_iterator, spot::kripke_explicit_succ_iterator, spot::tgba_succ_iterator_union, spot::ta_succ_iterator_product, spot::tgta_succ_iterator_product, and spot::tgba_succ_iterator_concrete.