Iterate over the successors of a product computed on the fly. More...
#include <tgba/tgbaproduct.hh>
Public Member Functions | |
tgba_succ_iterator_product (tgba_succ_iterator *left, tgba_succ_iterator *right, bdd left_neg, bdd right_neg, bddPair *right_common_acc) | |
virtual | ~tgba_succ_iterator_product () |
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_product * | 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. | |
Protected Attributes | |
tgba_succ_iterator * | left_ |
tgba_succ_iterator * | right_ |
bdd | current_cond_ |
bdd | left_neg_ |
bdd | right_neg_ |
bddPair * | right_common_acc_ |
Private Member Functions | |
void | step_ () |
Internal routines to advance to the next successor. | |
void | next_non_false_ () |
Friends | |
class | tgba_product |
Iterate over the successors of a product computed on the fly.
spot::tgba_succ_iterator_product::tgba_succ_iterator_product | ( | tgba_succ_iterator * | left, | |
tgba_succ_iterator * | right, | |||
bdd | left_neg, | |||
bdd | right_neg, | |||
bddPair * | right_common_acc | |||
) |
virtual spot::tgba_succ_iterator_product::~tgba_succ_iterator_product | ( | ) | [virtual] |
bdd spot::tgba_succ_iterator_product::current_acceptance_conditions | ( | ) | const [virtual] |
Get the acceptance conditions on the transition leading to this successor.
Implements spot::tgba_succ_iterator.
bdd spot::tgba_succ_iterator_product::current_condition | ( | ) | const [virtual] |
Get the condition on the transition leading to this successor.
This is a boolean function of atomic propositions.
Implements spot::tgba_succ_iterator.
state_product* spot::tgba_succ_iterator_product::current_state | ( | ) | const [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.
Implements spot::tgba_succ_iterator.
bool spot::tgba_succ_iterator_product::done | ( | ) | const [virtual] |
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::tgba_succ_iterator.
void spot::tgba_succ_iterator_product::first | ( | ) | [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.
void spot::tgba_succ_iterator_product::next | ( | ) | [virtual] |
Jump to the next successor (if any).
done()
to ensure there is a successor. Implements spot::tgba_succ_iterator.
void spot::tgba_succ_iterator_product::next_non_false_ | ( | ) | [private] |
void spot::tgba_succ_iterator_product::step_ | ( | ) | [private] |
Internal routines to advance to the next successor.
friend class tgba_product [friend] |
bdd spot::tgba_succ_iterator_product::current_cond_ [protected] |
bdd spot::tgba_succ_iterator_product::left_neg_ [protected] |
bddPair* spot::tgba_succ_iterator_product::right_common_acc_ [protected] |
bdd spot::tgba_succ_iterator_product::right_neg_ [protected] |