spot
1.0
|
#include <tgba/succiterconcrete.hh>
Public Member Functions | |
tgba_succ_iterator_concrete (const tgba_bdd_core_data &d, bdd successors) | |
Build a spot::tgba_succ_iterator_concrete. | |
virtual | ~tgba_succ_iterator_concrete () |
void | first () |
Position the iterator on the first successor (if any). | |
void | next () |
Jump to the next successor (if any). | |
bool | done () const |
Check whether the iteration is finished. | |
state_bdd * | current_state () const |
Get the state of the current successor. | |
bdd | current_condition () const |
Get the condition on the transition leading to this successor. | |
bdd | current_acceptance_conditions () const |
Get the acceptance conditions on the transition leading to this successor. |
Private Attributes | |
const tgba_bdd_core_data & | data_ |
Core data of the automaton. | |
bdd | succ_set_ |
The set of successors. | |
bdd | succ_set_left_ |
Unexplored successors (including current_). | |
bdd | current_ |
Current successor, as a conjunction of atomic proposition and Next variables. | |
bdd | current_state_ |
Current successor, as a conjunction of Now variables. | |
bdd | current_acc_ |
Acceptance conditions for the current transition. |
A concrete iterator over successors of a TGBA state.
spot::tgba_succ_iterator_concrete::tgba_succ_iterator_concrete | ( | const tgba_bdd_core_data & | d, |
bdd | successors | ||
) |
Build a spot::tgba_succ_iterator_concrete.
successors | The set of successors with ingoing conditions and acceptance conditions, represented as a BDD. The job of this iterator will be to enumerate the satisfactions of that BDD and split them into destination states and conditions, and compute acceptance conditions. |
d | The core data of the automata. These contains sets of variables useful to split a BDD, and compute acceptance conditions. |
|
virtual |
|
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.
|
virtual |
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::tgba_succ_iterator.
|
virtual |
Check whether the iteration is finished.
This function should be called after any call to \c first() or \c next() and before any enquiry about the current state. The usual way to do this is with a \c for loop. @code
for (s->first(); !s->done(); s->next()) ...
Implements spot::tgba_succ_iterator.
|
virtual |
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. Implements spot::tgba_succ_iterator.
|
virtual |
Jump to the next successor (if any).
done()
to ensure there is a successor. Implements spot::tgba_succ_iterator.
|
private |
Current successor, as a conjunction of atomic proposition and Next variables.
|
private |
Acceptance conditions for the current transition.
|
private |
Current successor, as a conjunction of Now variables.
|
private |
Core data of the automaton.
|
private |
The set of successors.
|
private |
Unexplored successors (including current_).