Main Page | Modules | Namespace List | Class Hierarchy | Class List | Directories | File List | Namespace Members | Class Members | File Members

spot::tgba_succ_iterator_concrete Class Reference
[TGBA representations]

#include <tgba/succiterconcrete.hh>

Inheritance diagram for spot::tgba_succ_iterator_concrete:

Inheritance graph
[legend]
Collaboration diagram for spot::tgba_succ_iterator_concrete:

Collaboration graph
[legend]
List of all members.

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_bddcurrent_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_datadata_
 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_
 Accepting conditions for the current transition.

Detailed Description

A concrete iterator over successors of a TGBA state.


Constructor & Destructor Documentation

spot::tgba_succ_iterator_concrete::tgba_succ_iterator_concrete const tgba_bdd_core_data d,
bdd  successors
 

Build a spot::tgba_succ_iterator_concrete.

Parameters:
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 spot::tgba_succ_iterator_concrete::~tgba_succ_iterator_concrete  )  [virtual]
 


Member Function Documentation

bdd spot::tgba_succ_iterator_concrete::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_concrete::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_bdd* spot::tgba_succ_iterator_concrete::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_concrete::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_concrete::first  )  [virtual]
 

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

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

Warning:
One should always call 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_concrete::next  )  [virtual]
 

Jump to the next successor (if any).

Warning:
Again, one should always call done() to ensure there is a successor.

Implements spot::tgba_succ_iterator.


Member Data Documentation

bdd spot::tgba_succ_iterator_concrete::current_ [private]
 

Current successor, as a conjunction of atomic proposition and Next variables.

bdd spot::tgba_succ_iterator_concrete::current_acc_ [private]
 

Accepting conditions for the current transition.

bdd spot::tgba_succ_iterator_concrete::current_state_ [private]
 

Current successor, as a conjunction of Now variables.

const tgba_bdd_core_data& spot::tgba_succ_iterator_concrete::data_ [private]
 

Core data of the automaton.

bdd spot::tgba_succ_iterator_concrete::succ_set_ [private]
 

The set of successors.

bdd spot::tgba_succ_iterator_concrete::succ_set_left_ [private]
 

Unexplored successors (including current_).


The documentation for this class was generated from the following file:
Please comment this page and report errors about it on the RefDocComments page.
Generated on Mon Jan 31 12:55:32 2005 for spot by doxygen 1.4.0