#include <tgba/taatgba.hh>
Classes | |
struct | distance_sort |
Public Member Functions | |
taa_succ_iterator (const taa_tgba::state_set *s, bdd all_acc) | |
virtual | ~taa_succ_iterator () |
virtual void | first () |
Position the iterator on the first successor (if any). | |
virtual void | next () |
Jump to the next successor (if any). | |
virtual bool | done () const |
Check whether the iteration is finished. | |
virtual state_set * | current_state () const |
Get the state of the current successor. | |
virtual bdd | current_condition () const |
Get the condition on the transition leading to this successor. | |
virtual bdd | current_acceptance_conditions () const |
Get the acceptance conditions on the transition leading to this successor. | |
Private Types | |
typedef taa_tgba::state::const_iterator | iterator |
typedef std::pair< iterator, iterator > | iterator_pair |
typedef std::vector < iterator_pair > | bounds_t |
typedef Sgi::hash_map< const spot::state_set *, std::vector < taa_tgba::transition * > , state_ptr_hash, state_ptr_equal > | seen_map |
Private Attributes | |
std::vector < taa_tgba::transition * > ::const_iterator | i_ |
std::vector < taa_tgba::transition * > | succ_ |
bdd | all_acceptance_conditions_ |
seen_map | seen_ |
typedef std::vector<iterator_pair> spot::taa_succ_iterator::bounds_t [private] |
typedef taa_tgba::state::const_iterator spot::taa_succ_iterator::iterator [private] |
Those typedefs are used to generate all possible successors in the constructor using a cartesian product.
typedef std::pair<iterator, iterator> spot::taa_succ_iterator::iterator_pair [private] |
typedef Sgi::hash_map< const spot::state_set*, std::vector<taa_tgba::transition*>, state_ptr_hash, state_ptr_equal> spot::taa_succ_iterator::seen_map [private] |
spot::taa_succ_iterator::taa_succ_iterator | ( | const taa_tgba::state_set * | s, | |
bdd | all_acc | |||
) |
virtual spot::taa_succ_iterator::~taa_succ_iterator | ( | ) | [virtual] |
virtual bdd spot::taa_succ_iterator::current_acceptance_conditions | ( | ) | const [virtual] |
Get the acceptance conditions on the transition leading to this successor.
Implements spot::tgba_succ_iterator.
virtual bdd spot::taa_succ_iterator::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.
virtual state_set* spot::taa_succ_iterator::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.
virtual bool spot::taa_succ_iterator::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.
virtual void spot::taa_succ_iterator::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.
virtual void spot::taa_succ_iterator::next | ( | ) | [virtual] |
Jump to the next successor (if any).
done()
to ensure there is a successor. Implements spot::tgba_succ_iterator.
bdd spot::taa_succ_iterator::all_acceptance_conditions_ [private] |
std::vector<taa_tgba::transition*>::const_iterator spot::taa_succ_iterator::i_ [private] |
seen_map spot::taa_succ_iterator::seen_ [private] |
std::vector<taa_tgba::transition*> spot::taa_succ_iterator::succ_ [private] |