3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-19 10:52:02 +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

@ -146,7 +146,7 @@ void func_interp::set_else(expr * e) {
ptr_vector<expr> args;
while (e && is_fi_entry_expr(e, args)) {
insert_entry(args.c_ptr(), to_app(e)->get_arg(1));
insert_entry(args.data(), to_app(e)->get_arg(1));
e = to_app(e)->get_arg(2);
}
@ -348,7 +348,7 @@ expr * func_interp::get_interp_core() const {
eqs.push_back(m().mk_eq(vars[i], curr->get_arg(i)));
}
SASSERT(eqs.size() == m_arity);
expr * cond = mk_and(m(), eqs.size(), eqs.c_ptr());
expr * cond = mk_and(m(), eqs.size(), eqs.data());
expr * th = curr->get_result();
if (m().is_true(th)) {
r = m().is_false(r) ? cond : m().mk_or(cond, r);
@ -393,13 +393,13 @@ expr_ref func_interp::get_array_interp_core(func_decl * f) const {
vars.push_back(m().mk_var(m_arity - i - 1, sorts.back()));
}
r = sub(r, vars);
r = m().mk_lambda(sorts.size(), sorts.c_ptr(), var_names.c_ptr(), r);
r = m().mk_lambda(sorts.size(), sorts.data(), var_names.data(), r);
return r;
}
expr_ref_vector args(m());
array_util autil(m());
sort_ref A(autil.mk_array_sort(domain.size(), domain.c_ptr(), m_else->get_sort()), m());
sort_ref A(autil.mk_array_sort(domain.size(), domain.data(), m_else->get_sort()), m());
r = autil.mk_const_array(A, m_else);
for (func_entry * curr : m_entries) {
expr * res = curr->get_result();
@ -448,7 +448,7 @@ func_interp * func_interp::translate(ast_translation & translator) const {
ptr_buffer<expr> new_args;
for (unsigned i = 0; i < m_arity; i++)
new_args.push_back(translator(curr->get_arg(i)));
new_fi->insert_new_entry(new_args.c_ptr(), translator(curr->get_result()));
new_fi->insert_new_entry(new_args.data(), translator(curr->get_result()));
}
new_fi->set_else(translator(m_else));
return new_fi;