Prefer emplace_back to push_back
* spot/graph/ngraph.hh, spot/ltsmin/ltsmin.cc, spot/misc/bitvect.hh, spot/misc/intvcomp.cc, spot/misc/satsolver.cc, spot/priv/weight.cc, spot/ta/taexplicit.cc, spot/taalgos/minimize.cc, spot/taalgos/reachiter.cc, spot/tl/exclusive.cc, spot/tl/formula.cc, spot/tl/formula.hh, spot/tl/mark.cc, spot/tl/mutation.cc, spot/tl/relabel.cc, spot/tl/remove_x.cc, spot/tl/simplify.cc, spot/twa/acc.cc, spot/twa/acc.hh, spot/twa/formula2bdd.cc, spot/twa/taatgba.cc, spot/twa/taatgba.hh, spot/twa/twa.hh, spot/twa/twagraph.cc, spot/twaalgos/bfssteps.cc, spot/twaalgos/canonicalize.cc, spot/twaalgos/compsusp.cc, spot/twaalgos/copy.cc, spot/twaalgos/cycles.cc, spot/twaalgos/degen.cc, spot/twaalgos/determinize.cc, spot/twaalgos/dtwasat.cc, spot/twaalgos/emptiness.cc, spot/twaalgos/gv04.cc, spot/twaalgos/hoa.cc, spot/twaalgos/ltl2taa.cc, spot/twaalgos/ltl2tgba_fm.cc, spot/twaalgos/magic.cc, spot/twaalgos/mask.hh, spot/twaalgos/minimize.cc, spot/twaalgos/powerset.cc, spot/twaalgos/product.cc, spot/twaalgos/randomgraph.cc, spot/twaalgos/reachiter.cc, spot/twaalgos/relabel.cc, spot/twaalgos/remfin.cc, spot/twaalgos/sccfilter.cc, spot/twaalgos/se05.cc, spot/twaalgos/simulation.cc, spot/twaalgos/stutter.cc, spot/twaalgos/tau03opt.cc, spot/twaalgos/totgba.cc, spot/twaalgos/word.cc, tests/core/bitvect.cc: here.
This commit is contained in:
parent
ef214b2c42
commit
43ec36cda7
54 changed files with 310 additions and 310 deletions
|
|
@ -247,7 +247,7 @@ namespace spot
|
|||
a = bdd_low(a);
|
||||
if (h != bddfalse)
|
||||
{
|
||||
t.push_back(bm[v]);
|
||||
t.emplace_back(bm[v]);
|
||||
if (a == bddfalse)
|
||||
a = h;
|
||||
}
|
||||
|
|
@ -434,7 +434,7 @@ namespace spot
|
|||
b = high;
|
||||
}
|
||||
assert(b != bddfalse);
|
||||
v.push_back(res);
|
||||
v.emplace_back(res);
|
||||
}
|
||||
return formula::multop(o, std::move(v));
|
||||
}
|
||||
|
|
@ -455,7 +455,7 @@ namespace spot
|
|||
minato_isop isop(f);
|
||||
bdd cube;
|
||||
while ((cube = isop.next()) != bddfalse)
|
||||
v.push_back(conj_bdd_to_formula(cube));
|
||||
v.emplace_back(conj_bdd_to_formula(cube));
|
||||
return formula::Or(std::move(v));
|
||||
}
|
||||
|
||||
|
|
@ -469,7 +469,7 @@ namespace spot
|
|||
minato_isop isop(f);
|
||||
bdd cube;
|
||||
while ((cube = isop.next()) != bddfalse)
|
||||
v.push_back(conj_bdd_to_sere(cube));
|
||||
v.emplace_back(conj_bdd_to_sere(cube));
|
||||
return formula::OrRat(std::move(v));
|
||||
}
|
||||
|
||||
|
|
@ -742,9 +742,9 @@ namespace spot
|
|||
|
||||
for (auto g: f)
|
||||
if (g.accepts_eword())
|
||||
final.push_back(g);
|
||||
final.emplace_back(g);
|
||||
else
|
||||
non_final.push_back(g);
|
||||
non_final.emplace_back(g);
|
||||
|
||||
if (non_final.empty())
|
||||
// (a* & b*);c = (a*|b*);c
|
||||
|
|
@ -780,9 +780,9 @@ namespace spot
|
|||
formula g = f[m];
|
||||
if (n != m)
|
||||
g = formula::Concat({g, star});
|
||||
conj.push_back(g);
|
||||
conj.emplace_back(g);
|
||||
}
|
||||
disj.push_back(formula::AndRat(std::move(conj)));
|
||||
disj.emplace_back(formula::AndRat(std::move(conj)));
|
||||
}
|
||||
return recurse_and_concat(formula::OrRat(std::move(disj)));
|
||||
}
|
||||
|
|
@ -813,9 +813,9 @@ namespace spot
|
|||
unsigned s = f.size();
|
||||
v.reserve(s);
|
||||
for (unsigned n = 1; n < s; ++n)
|
||||
v.push_back(f[n]);
|
||||
v.emplace_back(f[n]);
|
||||
if (to_concat_)
|
||||
v.push_back(to_concat_);
|
||||
v.emplace_back(to_concat_);
|
||||
return recurse(f[0], formula::Concat(std::move(v)));
|
||||
}
|
||||
case op::Fusion:
|
||||
|
|
@ -2092,7 +2092,7 @@ namespace spot
|
|||
|
||||
bdd conds = bdd_existcomp(label, d.var_set);
|
||||
bdd promises = bdd_existcomp(label, d.a_set);
|
||||
dests.push_back(transition(dest, conds, promises));
|
||||
dests.emplace_back(transition(dest, conds, promises));
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue