spot  2.8.1
Public Member Functions | Protected Attributes | List of all members
spot::ta_succ_iterator_product Class Reference

Iterate over the successors of a product computed on the fly. More...

#include <spot/ta/taproduct.hh>

Inheritance diagram for spot::ta_succ_iterator_product:
Collaboration diagram for spot::ta_succ_iterator_product:

Public Member Functions

 ta_succ_iterator_product (const state_ta_product *s, const ta *t, const kripke *k)
 
virtual bool first () override
 Position the iterator on the first successor (if any). More...
 
virtual bool next () override
 Jump to the next successor (if any). More...
 
virtual bool done () const override
 Check whether the iteration is finished. More...
 
virtual state_ta_productdst () const override
 Get the destination state of the current edge. More...
 
virtual bdd cond () const override
 Get the condition on the edge leading to this successor. More...
 
virtual acc_cond::mark_t acc () const override
 Get the acceptance mark of the edge leading to this successor. More...
 
bool is_stuttering_transition () const
 Return true if the changeset of the current transition is empty. More...
 

Protected Member Functions

void step_ ()
 Internal routines to advance to the next successor. More...
 
bool next_non_stuttering_ ()
 Internal routines to advance to the next successor. More...
 
void next_kripke_dest ()
 Move to the next successor in the kripke structure. More...
 

Protected Attributes

const state_ta_productsource_
 
const tata_
 
const kripkekripke_
 
ta_succ_iteratorta_succ_it_
 
twa_succ_iteratorkripke_succ_it_
 
const state_ta_productcurrent_state_
 
bdd current_condition_
 
acc_cond::mark_t current_acceptance_conditions_
 
bool is_stuttering_transition_
 
bdd kripke_source_condition
 
const statekripke_current_dest_state
 

Detailed Description

Iterate over the successors of a product computed on the fly.

Member Function Documentation

◆ acc()

virtual acc_cond::mark_t spot::ta_succ_iterator_product::acc ( ) const
overridevirtual

Get the acceptance mark of the edge leading to this successor.

Implements spot::twa_succ_iterator.

◆ cond()

virtual bdd spot::ta_succ_iterator_product::cond ( ) const
overridevirtual

Get the condition on the edge leading to this successor.

This is a Boolean function of atomic propositions.

Implements spot::twa_succ_iterator.

◆ done()

virtual bool spot::ta_succ_iterator_product::done ( ) const
overridevirtual

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 typical use case of done() is in a for loop such as:

for (s->first(); !s->done(); s->next())
  ...
Returns
false iff the iterator is pointing to a successor.

It is incorrect to call done() if first() hasn't been called before. If done() returns true, it is invalid to call next(), cond(), acc(), or dst().

Implements spot::twa_succ_iterator.

◆ dst()

virtual state_ta_product* spot::ta_succ_iterator_product::dst ( ) const
overridevirtual

Get the destination state of the current edge.

Each call to dst() (even several times on the same edge) creates a new state that has to be destroyed (see state::destroy()) by the caller after it is no longer used.

Note that the same state may occur at different points in the iteration, as different outgoing edges (usually with different labels or acceptance membership) may go to the same state.

Implements spot::twa_succ_iterator.

◆ first()

virtual bool spot::ta_succ_iterator_product::first ( )
overridevirtual

Position the iterator on the first successor (if any).

This method can be called several times in order to make multiple passes over successors.

Warning
One should always call done() (or better: check the return value of first()) 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.
Returns
true iff there is at least one successor

If first() returns false, it is invalid to call next(), cond(), acc(), or dst().

Implements spot::twa_succ_iterator.

◆ is_stuttering_transition()

bool spot::ta_succ_iterator_product::is_stuttering_transition ( ) const

Return true if the changeset of the current transition is empty.

◆ next()

virtual bool spot::ta_succ_iterator_product::next ( )
overridevirtual

Jump to the next successor (if any).

Warning
Again, one should always call done() (or better: check the return value of next()) to ensure there is a successor.
Returns
true if the iterator moved to a new successor, false if the iterator could not move to a new successor.

If next() returns false, it is invalid to call next() again, or to call cond(), acc() or dst().

Implements spot::twa_succ_iterator.

◆ next_kripke_dest()

void spot::ta_succ_iterator_product::next_kripke_dest ( )
protected

Move to the next successor in the kripke structure.

◆ next_non_stuttering_()

bool spot::ta_succ_iterator_product::next_non_stuttering_ ( )
protected

Internal routines to advance to the next successor.

◆ step_()

void spot::ta_succ_iterator_product::step_ ( )
protected

Internal routines to advance to the next successor.


The documentation for this class was generated from the following file:

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.8.13