#include <ta/taproduct.hh>
spot::ta_succ_iterator_product_by_changeset::ta_succ_iterator_product_by_changeset |
( |
const state_ta_product * |
s, |
|
|
const ta * |
t, |
|
|
const kripke * |
k, |
|
|
bdd |
changeset |
|
) |
| |
bdd spot::ta_succ_iterator_product::current_acceptance_conditions |
( |
) | |
const |
|
virtualinherited |
bdd spot::ta_succ_iterator_product::current_condition |
( |
) | |
const |
|
virtualinherited |
Get the changeset on the transition leading to current successor.
This is a boolean function of atomic propositions.
Implements spot::ta_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.
The returned state should be destroyed (see state::destroy) by the caller after it is no longer used.
Implements spot::ta_succ_iterator.
bool spot::ta_succ_iterator_product::done |
( |
) | |
const |
|
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())
...
Implements spot::ta_succ_iterator.
void spot::ta_succ_iterator_product::first |
( |
) | |
|
|
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()
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.
bool spot::ta_succ_iterator_product::is_stuttering_transition |
( |
) | |
const |
|
inherited |
Return true if the changeset of the current transition is empty.
void spot::ta_succ_iterator_product::next |
( |
) | |
|
|
virtualinherited |
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.
void spot::ta_succ_iterator_product_by_changeset::next_kripke_dest |
( |
) | |
|
Move to the next successor in the kripke structure.
void spot::ta_succ_iterator_product::next_non_stuttering_ |
( |
) | |
|
|
protectedinherited |
void spot::ta_succ_iterator_product::step_ |
( |
) | |
|
|
protectedinherited |
Internal routines to advance to the next successor.
bdd spot::ta_succ_iterator_product::current_acceptance_conditions_ |
|
protectedinherited |
bdd spot::ta_succ_iterator_product::current_condition_ |
|
protectedinherited |
bool spot::ta_succ_iterator_product::is_stuttering_transition_ |
|
protectedinherited |
const kripke* spot::ta_succ_iterator_product::kripke_ |
|
protectedinherited |
state* spot::ta_succ_iterator_product::kripke_current_dest_state |
|
protectedinherited |
bdd spot::ta_succ_iterator_product::kripke_source_condition |
|
protectedinherited |
const ta* spot::ta_succ_iterator_product::ta_ |
|
protectedinherited |
The documentation for this class was generated from the following file: