#include <tgba/tgbaexplicit.hh>
Inheritance diagram for spot::tgba_explicit_succ_iterator:
Public Member Functions | |
tgba_explicit_succ_iterator (const tgba_explicit::state *s, bdd all_acc) | |
virtual | ~tgba_explicit_succ_iterator () |
virtual void | first () |
Position the iterator on the first successor (if any). | |
virtual void | next () |
Jump to the next successor (if any). | |
virtual bool | done () const |
Check whether the iteration is finished. | |
virtual state_explicit * | current_state () const |
Get the state of the current successor. | |
virtual bdd | current_condition () const |
Get the condition on the transition leading to this successor. | |
virtual bdd | current_acceptance_conditions () const |
Get the acceptance conditions on the transition leading to this successor. | |
Private Attributes | |
const tgba_explicit::state * | s_ |
tgba_explicit::state::const_iterator | i_ |
bdd | all_acceptance_conditions_ |
|
|
|
|
|
Get the acceptance conditions on the transition leading to this successor.
Implements spot::tgba_succ_iterator. |
|
Get the condition on the transition leading to this successor. This is a boolean function of atomic propositions. Implements spot::tgba_succ_iterator. |
|
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. Implements spot::tgba_succ_iterator. |
|
Check whether the iteration is finished.
This function should be called after any call to
The usual way to do this is with a for (s->first(); !s->done(); s->next())
...
Implements spot::tgba_succ_iterator. |
|
Position the iterator on the first successor (if any). This method can be called several times to make multiple passes over successors.
Implements spot::tgba_succ_iterator. |
|
Jump to the next successor (if any).
Implements spot::tgba_succ_iterator. |
|
|
|
|
|
|