3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-02-14 04:41:48 +00:00

Apply std::move to 6 more expr_ref/app_ref variables in smt/ (batch 2)

Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com>
This commit is contained in:
copilot-swe-agent[bot] 2026-02-12 08:55:52 +00:00
parent fb56d8462e
commit 6e75c971f3
5 changed files with 6 additions and 6 deletions

View file

@ -81,7 +81,7 @@ namespace smt {
app * eq = m.mk_eq(arg1, arg2);
app_ref neq(m.mk_not(eq), m);
if (std::find(lits.begin(), lits.end(), neq.get()) == lits.end()) {
lits.push_back(neq);
lits.push_back(std::move(neq));
prs.push_back(mk_hypothesis(m, eq, false, arg1, arg2));
}
}

View file

@ -589,7 +589,7 @@ namespace smt {
app_ref lam_name(m.mk_fresh_const("lambda", q->get_sort()), m);
app_ref eq(m), lam_app(m);
expr_ref_vector vars(m);
vars.push_back(lam_name);
vars.push_back(std::move(lam_name));
unsigned sz = q->get_num_decls();
for (unsigned i = 0; i < sz; ++i)
vars.push_back(m.mk_var(sz - i - 1, q->get_decl_sort(i)));

View file

@ -523,7 +523,7 @@ namespace smt {
break;
expr_ref lit(g2l.to());
lit = g2l(t->get_literal().get());
cube.push_back(lit);
cube.push_back(std::move(lit));
t = t->parent();
}
return true;

View file

@ -163,7 +163,7 @@ namespace smt {
SASSERT(!is_enabled_guard(guard));
app_ref dlimit = m_util.mk_num_rounds_pred(m_num_rounds);
expr_ref_vector core(m);
core.push_back(dlimit);
core.push_back(std::move(dlimit));
core.push_back(guard);
if (!m_guard2pending.contains(guard)) {
m_disabled_guards.push_back(guard);
@ -418,7 +418,7 @@ namespace smt {
if (u().has_rec_defs() || !m_disabled_guards.empty()) {
app_ref dlimit = m_util.mk_num_rounds_pred(m_num_rounds);
TRACEFN("add_theory_assumption " << dlimit);
assumptions.push_back(dlimit);
assumptions.push_back(std::move(dlimit));
for (expr* e : m_disabled_guards)
assumptions.push_back(m.mk_not(e));
}

View file

@ -3350,7 +3350,7 @@ void theory_seq::add_theory_assumptions(expr_ref_vector & assumptions) {
expr_ref dlimit = m_sk.mk_max_unfolding_depth(m_max_unfolding_depth);
m_trail_stack.push(value_trail<literal>(m_max_unfolding_lit));
m_max_unfolding_lit = mk_literal(dlimit);
assumptions.push_back(dlimit);
assumptions.push_back(std::move(dlimit));
for (auto const& kv : m_length_limit_map) {
if (kv.m_value > 0)
assumptions.push_back(m_sk.mk_length_limit(kv.m_key, kv.m_value));