mirror of
https://github.com/Z3Prover/z3
synced 2025-08-23 11:37:54 +00:00
call it data instead of c_ptr for approaching C++11 std::vector convention.
This commit is contained in:
parent
524dcd35f9
commit
4a6083836a
456 changed files with 2802 additions and 2802 deletions
|
@ -419,7 +419,7 @@ struct goal2sat::imp : public sat::sat_internalizer {
|
|||
}
|
||||
}
|
||||
else {
|
||||
mk_root_clause(m_result_stack.size(), m_result_stack.c_ptr());
|
||||
mk_root_clause(m_result_stack.size(), m_result_stack.data());
|
||||
}
|
||||
m_result_stack.shrink(old_sz);
|
||||
}
|
||||
|
@ -442,7 +442,7 @@ struct goal2sat::imp : public sat::sat_internalizer {
|
|||
// I have to execute it after the binary mk_clause above.
|
||||
mk_clause(num+1, lits);
|
||||
if (aig())
|
||||
aig()->add_or(l, num, aig_lits.c_ptr());
|
||||
aig()->add_or(l, num, aig_lits.data());
|
||||
|
||||
m_solver.set_phase(~l);
|
||||
m_result_stack.shrink(old_sz);
|
||||
|
@ -463,7 +463,7 @@ struct goal2sat::imp : public sat::sat_internalizer {
|
|||
for (unsigned i = 0; i < num; ++i) {
|
||||
m_result_stack[i].neg();
|
||||
}
|
||||
mk_root_clause(m_result_stack.size(), m_result_stack.c_ptr());
|
||||
mk_root_clause(m_result_stack.size(), m_result_stack.data());
|
||||
}
|
||||
else {
|
||||
for (unsigned i = 0; i < num; ++i) {
|
||||
|
@ -495,7 +495,7 @@ struct goal2sat::imp : public sat::sat_internalizer {
|
|||
}
|
||||
mk_clause(num+1, lits);
|
||||
if (aig()) {
|
||||
aig()->add_and(l, num, aig_lits.c_ptr());
|
||||
aig()->add_and(l, num, aig_lits.data());
|
||||
}
|
||||
m_solver.set_phase(l);
|
||||
if (sign)
|
||||
|
|
|
@ -63,7 +63,7 @@ class sat_tactic : public tactic {
|
|||
IF_VERBOSE(TACTIC_VERBOSITY_LVL, m_solver->display_status(verbose_stream()););
|
||||
TRACE("sat_dimacs", m_solver->display_dimacs(tout););
|
||||
dep2assumptions(dep2asm, assumptions);
|
||||
lbool r = m_solver->check(assumptions.size(), assumptions.c_ptr());
|
||||
lbool r = m_solver->check(assumptions.size(), assumptions.data());
|
||||
TRACE("sat", tout << "result of checking: " << r << " ";
|
||||
if (r == l_undef) tout << m_solver->get_reason_unknown(); tout << "\n";);
|
||||
if (r == l_false) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue