spot
1.2.1a
|
This is an iterator for the product. More...
#include <fasttgba/fasttgba_product.hh>
Public Member Functions | |
fast_product_iterator (fasttgba_succ_iterator *left, fasttgba_succ_iterator *right, fixed_size_pool *p, bool left_is_kripke=false) | |
virtual void | first () |
Position the iterator on the first successor (if any). More... | |
virtual void | next () |
Jump to the next successor (if any). More... | |
virtual bool | done () const |
Check whether the iteration is finished. More... | |
virtual fasttgba_state * | current_state () const |
Get the state of the current successor. More... | |
virtual cube | current_condition () const |
Get the condition on the transition leading to this successor. More... | |
virtual markset | current_acceptance_marks () const |
Get the acceptance conditions on the transition leading to this successor. More... | |
virtual fasttgba_succ_iterator * | left () const |
An accessor to the left iterator. More... | |
virtual fasttgba_succ_iterator * | right () const |
An accessor to the right iterator. More... | |
Protected Member Functions | |
void | step () |
Protected Attributes | |
fasttgba_succ_iterator * | left_ |
Reference on the left iterator. More... | |
fasttgba_succ_iterator * | right_ |
Reference on the right iterator. More... | |
fixed_size_pool * | pool_ |
bool | kripke_left |
The left automaton is a Kripke. More... | |
This is an iterator for the product.
This iterator is in charge to compute only valid successors it means sucessors that are correct in the meaning of cube. If t1 and t2 are resp. labelled by a and !a then no synchro- -nisation is possible
When performing the synchronisation of two tansitions t1(src_1, ap_1, , dst_1) and t2(src_2, ap_2, , dst_2) if ap_1 and ap_2 are compatible then the resulting transition would be : t ((src_1, src_2), (ap_1 & ap_2), (|), (dst_1, dst_2))
|
virtual |
Get the acceptance conditions on the transition leading to this successor.
Implements spot::fasttgba_succ_iterator.
|
virtual |
Get the condition on the transition leading to this successor.
This is a boolean function of atomic propositions.
Implements spot::fasttgba_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::fasttgba_succ_iterator.
|
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.
Implements spot::fasttgba_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::fasttgba_succ_iterator.
|
virtual |
An accessor to the left iterator.
|
virtual |
Jump to the next successor (if any).
done()
to ensure there is a successor. Implements spot::fasttgba_succ_iterator.
|
virtual |
An accessor to the right iterator.
|
protected |
This method is used to compute a step in the iterator considering the two sub iterators.
|
protected |
The left automaton is a Kripke.
|
protected |
Reference on the left iterator.
|
protected |
Reference on the right iterator.