spot 2.12.2
|
Iterate over the successors of a product computed on the fly. More...
#include <spot/ta/taproduct.hh>
Public Member Functions | |
ta_succ_iterator_product (const state_ta_product *s, const ta *t, const kripke *k) | |
virtual bool | first () override |
Position the iterator on the first successor (if any). More... | |
virtual bool | next () override |
Jump to the next successor (if any). More... | |
virtual bool | done () const override |
Check whether the iteration is finished. More... | |
virtual state_ta_product * | dst () const override |
Get the destination state of the current edge. More... | |
virtual bdd | cond () const override |
Get the condition on the edge leading to this successor. More... | |
virtual acc_cond::mark_t | acc () const override |
Get the acceptance mark of the edge leading to this successor. More... | |
bool | is_stuttering_transition () const |
Return true if the changeset of the current transition is empty. More... | |
Protected Member Functions | |
void | step_ () |
Internal routines to advance to the next successor. More... | |
bool | next_non_stuttering_ () |
void | next_kripke_dest () |
Move to the next successor in the kripke structure. More... | |
Protected Attributes | |
const state_ta_product * | source_ |
const ta * | ta_ |
const kripke * | kripke_ |
ta_succ_iterator * | ta_succ_it_ |
twa_succ_iterator * | kripke_succ_it_ |
const state_ta_product * | current_state_ |
bdd | current_condition_ |
acc_cond::mark_t | current_acceptance_conditions_ |
bool | is_stuttering_transition_ |
bdd | kripke_source_condition |
const state * | kripke_current_dest_state |
Iterate over the successors of a product computed on the fly.
|
overridevirtual |
Get the acceptance mark of the edge leading to this successor.
Implements spot::twa_succ_iterator.
|
overridevirtual |
Get the condition on the edge leading to this successor.
This is a Boolean function of atomic propositions.
Implements spot::twa_succ_iterator.
|
overridevirtual |
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 typical use case of done() is in a for
loop such as:
for (s->first(); !s->done(); s->next()) ...
It is incorrect to call done() if first() hasn't been called before. If done() returns true, it is invalid to call next(), cond(), acc(), or dst().
Implements spot::twa_succ_iterator.
|
overridevirtual |
Get the destination state of the current edge.
Each call to dst() (even several times on the same edge) creates a new state that has to be destroyed (see state::destroy()) by the caller after it is no longer used.
Note that the same state may occur at different points in the iteration, as different outgoing edges (usually with different labels or acceptance membership) may go to the same state.
Implements spot::twa_succ_iterator.
|
overridevirtual |
Position the iterator on the first successor (if any).
This method can be called several times in order to make multiple passes over successors.
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.If first() returns false, it is invalid to call next(), cond(), acc(), or dst().
Implements spot::twa_succ_iterator.
bool spot::ta_succ_iterator_product::is_stuttering_transition | ( | ) | const |
Return true if the changeset of the current transition is empty.
|
overridevirtual |
Jump to the next successor (if any).
done()
(or better: check the return value of next()) to ensure there is a successor.If next() returns false, it is invalid to call next() again, or to call cond(), acc() or dst().
Implements spot::twa_succ_iterator.
|
protected |
Move to the next successor in the kripke structure.
|
protected |
Internal routines to advance to the next successor.