mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-29 03:45:51 +00:00
Code Activity

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

Browse source
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
Download patch file Download diff file Expand all files Collapse all files

8
src/math/subpaving/subpaving.cpp
View file

@ -76,7 +76,7 @@ namespace subpaving {
m_ctx.nm().set(m_as[i], as[i]);
}
m_ctx.nm().set(m_c, c);
return m_ctx.mk_sum(m_c, sz, m_as.c_ptr(), xs);
return m_ctx.mk_sum(m_c, sz, m_as.data(), xs);
}
ineq * mk_ineq(var x, mpq const & k, bool lower, bool open) override {
return reinterpret_cast<ineq*>(m_ctx.mk_ineq(x, k, lower, open));
@ -119,7 +119,7 @@ namespace subpaving {
int2mpf(as[i], m_as[i]);
}
int2mpf(c, m_c);
return m_ctx.mk_sum(m_c, sz, m_as.c_ptr(), xs);
return m_ctx.mk_sum(m_c, sz, m_as.data(), xs);
}
catch (const f2n<mpf_manager>::exception &) {
throw subpaving::exception();
@ -176,7 +176,7 @@ namespace subpaving {
int2hwf(as[i], m_as[i]);
}
int2hwf(c, m_c);
return m_ctx.mk_sum(m_c, sz, m_as.c_ptr(), xs);
return m_ctx.mk_sum(m_c, sz, m_as.data(), xs);
}
catch (const f2n<mpf_manager>::exception &) {
throw subpaving::exception();
@ -234,7 +234,7 @@ namespace subpaving {
int2fpoint(as[i], m_as[i]);
}
int2fpoint(c, m_c);
return this->m_ctx.mk_sum(m_c, sz, m_as.c_ptr(), xs);
return this->m_ctx.mk_sum(m_c, sz, m_as.data(), xs);
}
catch (const typename context_fpoint::numeral_manager::exception &) {
throw subpaving::exception();

2
src/math/subpaving/subpaving_t_def.h
View file

@ -712,7 +712,7 @@ var context_t<C>::mk_monomial(unsigned sz, power const * pws) {
}
}
sz = j + 1;
pws = m_pws.c_ptr();
pws = m_pws.data();
unsigned mem_sz = monomial::get_obj_size(sz);
void * mem = allocator().allocate(mem_sz);
monomial * r = new (mem) monomial(sz, pws);

4
src/math/subpaving/tactic/expr2subpaving.cpp
View file

@ -212,7 +212,7 @@ struct expr2subpaving::imp {
else if (pws.size() == 1 && pws[0].degree() == 1)
x = pws[0].get_var();
else
x = s().mk_monomial(pws.size(), pws.c_ptr());
x = s().mk_monomial(pws.size(), pws.data());
cache_result(t, x, n, d);
return x;
}
@ -258,7 +258,7 @@ struct expr2subpaving::imp {
x = subpaving::null_var;
}
else {
x = s().mk_sum(sum_c, sz, ns.c_ptr(), xs.c_ptr());
x = s().mk_sum(sum_c, sz, ns.data(), xs.data());
qm().set(n, 1);
}
cache_result(t, x, n, d);

2
src/math/subpaving/tactic/subpaving_tactic.cpp
View file

@ -174,7 +174,7 @@ class subpaving_tactic : public tactic {
for (unsigned i = 0; i < sz; i++) {
ineq_buffer.push_back(mk_ineq(args[i]));
}
m_ctx->add_clause(sz, ineq_buffer.c_ptr());
m_ctx->add_clause(sz, ineq_buffer.data());
}
void internalize(goal const & g) {