Clean the usage of spot::acc_cond::mark_t
spot::acc_cond::mark_t is implemented as a bit vector using a single unsigned, and implicit conversions between mark_t and unsigned may be confusing. We try to use the proper interface. * bin/autfilt.cc, bin/ltlsynt.cc, spot/kripke/kripke.cc, spot/misc/game.hh, spot/parseaut/parseaut.yy, spot/priv/accmap.hh, spot/ta/ta.cc, spot/ta/taexplicit.cc, spot/ta/taproduct.cc, spot/taalgos/emptinessta.cc, spot/taalgos/tgba2ta.cc, spot/twa/acc.cc, spot/twa/acc.hh, spot/twa/taatgba.cc, spot/twa/taatgba.hh, spot/twa/twagraph.hh, spot/twaalgos/alternation.cc, spot/twaalgos/cleanacc.cc, spot/twaalgos/cobuchi.cc, spot/twaalgos/complete.cc, spot/twaalgos/couvreurnew.cc, spot/twaalgos/degen.cc, spot/twaalgos/dot.cc, spot/twaalgos/dtwasat.cc, spot/twaalgos/dualize.cc, spot/twaalgos/emptiness.cc, spot/twaalgos/gtec/ce.cc, spot/twaalgos/gtec/gtec.cc, spot/twaalgos/gtec/sccstack.cc, spot/twaalgos/gv04.cc, spot/twaalgos/hoa.cc, spot/twaalgos/lbtt.cc, spot/twaalgos/ltl2tgba_fm.cc, spot/twaalgos/magic.cc, spot/twaalgos/ndfs_result.hxx, spot/twaalgos/rabin2parity.cc, spot/twaalgos/randomgraph.cc, spot/twaalgos/remfin.cc, spot/twaalgos/sbacc.cc, spot/twaalgos/sccfilter.cc, spot/twaalgos/sccinfo.cc, spot/twaalgos/sccinfo.hh, spot/twaalgos/se05.cc, spot/twaalgos/sepsets.cc, spot/twaalgos/simulation.cc, spot/twaalgos/strength.cc, spot/twaalgos/stripacc.cc, spot/twaalgos/stutter.cc, spot/twaalgos/sum.cc, spot/twaalgos/tau03.cc, spot/twaalgos/tau03opt.cc, spot/twaalgos/totgba.cc, spot/twaalgos/toweak.cc, python/spot/impl.i, tests/core/acc.cc, tests/core/twagraph.cc: do not confuse mark_t and unsigned * tests/python/acc_cond.ipynb: warn about possible change of the API
This commit is contained in:
parent
cfcc18e680
commit
b09c293f1a
57 changed files with 333 additions and 308 deletions
|
|
@ -52,9 +52,9 @@ namespace spot
|
|||
std::vector<acc_cond::mark_t> common_in(ns, all);
|
||||
std::vector<acc_cond::mark_t> common_out(ns, all);
|
||||
// Marks that label one incoming transition from the same SCC.
|
||||
std::vector<acc_cond::mark_t> one_in(ns, 0U);
|
||||
std::vector<acc_cond::mark_t> one_in(ns, acc_cond::mark_t({}));
|
||||
std::vector<bool> true_state(ns, false);
|
||||
acc_cond::mark_t true_state_acc = 0U;
|
||||
acc_cond::mark_t true_state_acc = {};
|
||||
unsigned true_state_last;
|
||||
for (auto& e: old->edges())
|
||||
for (unsigned d: old->univ_dests(e.dst))
|
||||
|
|
@ -95,7 +95,7 @@ namespace spot
|
|||
if (ts)
|
||||
{
|
||||
state = true_state_last; // Merge all true states.
|
||||
m = 0U;
|
||||
m = {};
|
||||
}
|
||||
pair_t x(state, m);
|
||||
auto p = s2n.emplace(x, 0);
|
||||
|
|
@ -126,7 +126,7 @@ namespace spot
|
|||
internal::univ_dest_mapper<twa_graph::graph_t> uniq(res->get_graph());
|
||||
for (unsigned s: old_init)
|
||||
{
|
||||
acc_cond::mark_t init_acc = 0U;
|
||||
acc_cond::mark_t init_acc = {};
|
||||
if (!si.is_rejecting_scc(si.scc_of(s)))
|
||||
// Use any edge going into the initial state to set the first
|
||||
// acceptance mark.
|
||||
|
|
@ -148,7 +148,7 @@ namespace spot
|
|||
for (unsigned d: old->univ_dests(t.dst))
|
||||
{
|
||||
unsigned scc_dst = si.scc_of(d);
|
||||
acc_cond::mark_t acc = 0U;
|
||||
acc_cond::mark_t acc = {};
|
||||
bool dst_acc = !si.is_rejecting_scc(scc_dst);
|
||||
if (maybe_accepting && scc_src == scc_dst)
|
||||
acc = t.acc - common_out[t.src];
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue