832a504d8d
Rewrite using bdd_satoneset. This time it's for real. (I hope.) * src/tgba/succiterconcrete.hh (current_base_, current_base_left_): Delete. * tgba/tgbabddcoredata.hh (next_set): New variable. * tgba/tgbabddcoredata.cc, tgba/tgbabddtranslatefactory.cc: Adjust to update next_set.
48 lines
1.6 KiB
C++
48 lines
1.6 KiB
C++
#ifndef SPOT_TGBA_SUCCITERCONCRETE_HH
|
|
# define SPOT_TGBA_SUCCITERCONCRETE_HH
|
|
|
|
#include "statebdd.hh"
|
|
#include "succiter.hh"
|
|
#include "tgbabddcoredata.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// A concrete iterator over successors of a TGBA state.
|
|
class tgba_succ_iterator_concrete: public tgba_succ_iterator
|
|
{
|
|
public:
|
|
/// \brief Build a spot::tgba_succ_iterator_concrete.
|
|
///
|
|
/// \param successors The set of successors with ingoing
|
|
/// conditions and accepting 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 accepting conditions.
|
|
/// \param d The core data of the automata.
|
|
/// These contains sets of variables useful to split a BDD, and
|
|
/// compute accepting conditions.
|
|
tgba_succ_iterator_concrete(const tgba_bdd_core_data& d, bdd successors);
|
|
virtual ~tgba_succ_iterator_concrete();
|
|
|
|
// iteration
|
|
void first();
|
|
void next();
|
|
bool done();
|
|
|
|
// inspection
|
|
state_bdd* current_state();
|
|
bdd current_condition();
|
|
bdd current_accepting_conditions();
|
|
|
|
private:
|
|
const tgba_bdd_core_data& data_; ///< 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.
|
|
};
|
|
}
|
|
|
|
#endif // SPOT_TGBA_SUCCITERCONCRETE_HH
|