3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 01:25:31 +00:00

call it data instead of c_ptr for approaching C++11 std::vector convention.

This commit is contained in:
Nikolaj Bjorner 2021-04-13 18:17:10 -07:00
parent 524dcd35f9
commit 4a6083836a
456 changed files with 2802 additions and 2802 deletions

View file

@ -95,7 +95,7 @@ static void track_clause(sat::solver& dst,
sat::literal lit = sat::literal(dst.mk_var(true, false), false);
tracking_clauses.set(lit.var(), lits);
lits.push_back(~lit);
dst.mk_clause(lits.size(), lits.c_ptr());
dst.mk_clause(lits.size(), lits.data());
assumptions.push_back(lit);
}
@ -254,7 +254,7 @@ unsigned read_dimacs(char const * file_name) {
g_solver = &solver2;
sat::literal_vector assumptions;
track_clauses(solver, solver2, assumptions, tracking_clauses);
r = g_solver->check(assumptions.size(), assumptions.c_ptr());
r = g_solver->check(assumptions.size(), assumptions.data());
}
else if (par.get_bool("enable", false)) {
r = solve_parallel(solver);

View file

@ -49,7 +49,7 @@ class smt_checker {
expr_ref_vector args(m);
for (expr* arg : *to_app(e))
args.push_back(define(arg, depth - 1));
r = m.mk_app(to_app(e)->get_decl(), args.size(), args.c_ptr());
r = m.mk_app(to_app(e)->get_decl(), args.size(), args.data());
}
return r;
}
@ -77,7 +77,7 @@ class smt_checker {
m_lemma_solver->assert_expr(lit2expr(lit));
}
#endif
m_units.append(units.size() - m_units.size(), units.c_ptr() + m_units.size());
m_units.append(units.size() - m_units.size(), units.data() + m_units.size());
}
void check_assertion_redundant(sat::literal_vector const& input) {
@ -111,7 +111,7 @@ class smt_checker {
add_units();
drup_units.reset();
if (m_drat.is_drup(lits.size(), lits.c_ptr(), drup_units)) {
if (m_drat.is_drup(lits.size(), lits.data(), drup_units)) {
std::cout << "drup\n";
return;
}
@ -194,7 +194,7 @@ public:
}
if (name == "is" && sz == 3) {
name = sexpr->get_child(2)->get_child(0)->get_symbol();
f = ctx.find_func_decl(name, params.size(), params.c_ptr(), args.size(), sorts.c_ptr(), rng.get());
f = ctx.find_func_decl(name, params.size(), params.data(), args.size(), sorts.data(), rng.get());
if (!f)
goto bail;
datatype_util dtu(m);
@ -238,7 +238,7 @@ public:
default:
goto bail;
}
f = ctx.find_func_decl(name, params.size(), params.c_ptr(), args.size(), sorts.c_ptr(), rng.get());
f = ctx.find_func_decl(name, params.size(), params.data(), args.size(), sorts.data(), rng.get());
if (!f)
goto bail;
result = ctx.m().mk_app(f, args);
@ -328,7 +328,7 @@ static void verify_smt(char const* drat_file, char const* smt_file) {
sargs.push_back(sorts.get(n));
psort_decl* pd = ctx.find_psort_decl(name);
if (pd)
srt = pd->instantiate(ctx.pm(), sargs.size(), sargs.c_ptr());
srt = pd->instantiate(ctx.pm(), sargs.size(), sargs.data());
else
srt = m.mk_uninterpreted_sort(name);
sorts.reserve(r.m_node_id+1);