rename tgba_run as twa_run
Part of #113. * src/twaalgos/emptiness.cc, src/twaalgos/emptiness.hh (tgba_run): Rename as ... (twa_run): ... this. * NEWS: Mention it. * iface/ltsmin/modelcheck.cc, src/tests/complementation.cc, src/tests/emptchk.cc, src/tests/ikwiad.cc, src/tests/randtgba.cc, src/twa/twa.hh, src/twaalgos/bfssteps.cc, src/twaalgos/bfssteps.hh, src/twaalgos/gtec/ce.cc, src/twaalgos/gtec/ce.hh, src/twaalgos/gv04.cc, src/twaalgos/magic.cc, src/twaalgos/minimize.cc, src/twaalgos/ndfs_result.hxx, src/twaalgos/projrun.cc, src/twaalgos/projrun.hh, src/twaalgos/reducerun.cc, src/twaalgos/reducerun.hh, src/twaalgos/replayrun.cc, src/twaalgos/replayrun.hh, src/twaalgos/se05.cc, src/twaalgos/word.cc, src/twaalgos/word.hh, wrap/python/ajax/spotcgi.in, wrap/python/spot_impl.i: Adjust.
This commit is contained in:
parent
4a91fccc33
commit
4221e68d44
28 changed files with 147 additions and 146 deletions
|
|
@ -39,7 +39,7 @@ namespace spot
|
|||
}
|
||||
|
||||
const state*
|
||||
search(const state* start, tgba_run::steps& l)
|
||||
search(const state* start, twa_run::steps& l)
|
||||
{
|
||||
return this->bfs_steps::search(filter(start), l);
|
||||
}
|
||||
|
|
@ -60,7 +60,7 @@ namespace spot
|
|||
}
|
||||
|
||||
bool
|
||||
match(tgba_run::step&, const state* dest)
|
||||
match(twa_run::step&, const state* dest)
|
||||
{
|
||||
return target->find(dest) != target->end();
|
||||
}
|
||||
|
|
@ -91,10 +91,10 @@ namespace spot
|
|||
return count;
|
||||
}
|
||||
|
||||
tgba_run_ptr
|
||||
twa_run_ptr
|
||||
couvreur99_check_result::accepting_run()
|
||||
{
|
||||
run_ = std::make_shared<tgba_run>();
|
||||
run_ = std::make_shared<twa_run>();
|
||||
|
||||
assert(!ecs_->root.empty());
|
||||
|
||||
|
|
@ -106,7 +106,7 @@ namespace spot
|
|||
|
||||
// Register all states from the cycle as target of the BFS.
|
||||
state_set ss;
|
||||
for (tgba_run::steps::const_iterator i = run_->cycle.begin();
|
||||
for (twa_run::steps::const_iterator i = run_->cycle.begin();
|
||||
i != run_->cycle.end(); ++i)
|
||||
ss.insert(i->s);
|
||||
shortest_path shpath(&ss, ecs_, this);
|
||||
|
|
@ -132,7 +132,7 @@ namespace spot
|
|||
}
|
||||
|
||||
// Locate cycle_entry_point on the cycle.
|
||||
tgba_run::steps::iterator cycle_ep_it;
|
||||
twa_run::steps::iterator cycle_ep_it;
|
||||
for (cycle_ep_it = run_->cycle.begin();
|
||||
cycle_ep_it != run_->cycle.end()
|
||||
&& cycle_entry_point->compare(cycle_ep_it->s); ++cycle_ep_it)
|
||||
|
|
@ -201,7 +201,7 @@ namespace spot
|
|||
}
|
||||
|
||||
virtual bool
|
||||
match(tgba_run::step& st, const state* s)
|
||||
match(twa_run::step& st, const state* s)
|
||||
{
|
||||
acc_cond::mark_t less_acc =
|
||||
acc_to_traverse - st.acc;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue