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:
Etienne Renault 2016-11-22 10:21:08 +01:00
parent ef214b2c42
commit 43ec36cda7
54 changed files with 310 additions and 310 deletions

View file

@ -266,7 +266,7 @@ namespace spot
{
hash_set* cI = new hash_set;
cI->insert(*i);
done.push_back(cI);
done.emplace_back(cI);
used_var[set_num] = 1;
free_var.erase(set_num);
@ -284,9 +284,9 @@ namespace spot
used_var[num] = s;
free_var.erase(num);
if (s > 1)
cur_run.push_back(G);
cur_run.emplace_back(G);
else
done.push_back(G);
done.emplace_back(G);
for (hash_set::const_iterator i = G->begin(); i != G->end(); ++i)
state_set_map[*i] = num;
@ -304,9 +304,9 @@ namespace spot
used_var[num] = s;
free_var.erase(num);
if (s > 1)
cur_run.push_back(F);
cur_run.emplace_back(F);
else
done.push_back(F);
done.emplace_back(F);
for (hash_set::const_iterator i = F->begin(); i != F->end(); ++i)
state_set_map[*i] = num;
}
@ -323,9 +323,9 @@ namespace spot
used_var[num] = s;
free_var.erase(num);
if (s > 1)
cur_run.push_back(G_F);
cur_run.emplace_back(G_F);
else
done.push_back(G_F);
done.emplace_back(G_F);
for (hash_set::const_iterator i = G_F->begin(); i != G_F->end(); ++i)
state_set_map[*i] = num;
}
@ -342,9 +342,9 @@ namespace spot
used_var[num] = s;
free_var.erase(num);
if (s > 1)
cur_run.push_back(S);
cur_run.emplace_back(S);
else
done.push_back(S);
done.emplace_back(S);
for (hash_set::const_iterator i = S->begin(); i != S->end(); ++i)
state_set_map[*i] = num;
}
@ -432,7 +432,7 @@ namespace spot
trace
<< "set " << format_hash_set(bsi->second, ta_)
<< " was not split" << std::endl;
next_run.push_back(bsi->second);
next_run.emplace_back(bsi->second);
}
else
{
@ -466,14 +466,14 @@ namespace spot
trace
<< "set " << format_hash_set(set, ta_)
<< " is minimal" << std::endl;
done.push_back(set);
done.emplace_back(set);
}
else
{
trace
<< "set " << format_hash_set(set, ta_)
<< " should be processed further" << std::endl;
next_run.push_back(set);
next_run.emplace_back(set);
}
}
}

View file

@ -167,7 +167,7 @@ namespace spot
void
ta_reachable_iterator_breadth_first::add_state(const state* s)
{
todo.push_back(s);
todo.emplace_back(s);
}
const state*