mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 09:35:32 +00:00
Code Activity

Use nullptr.

Browse source
This commit is contained in:
Bruce Mitchener 2018-10-02 09:11:19 +07:00
parent 808d2eb60f
commit cdfc19a885
44 changed files with 98 additions and 98 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/tactic/arith/degree_shift_tactic.cpp
View file

@ -204,7 +204,7 @@ class degree_shift_tactic : public tactic {
for (auto const& kv : m_var2degree) {
SASSERT(kv.m_value.is_int());
SASSERT(kv.m_value >= rational(2));
app * fresh = m.mk_fresh_const(0, kv.m_key->get_decl()->get_range());
app * fresh = m.mk_fresh_const(nullptr, kv.m_key->get_decl()->get_range());
m_pinned.push_back(fresh);
m_var2var.insert(kv.m_key, fresh);
if (m_produce_models) {

2
src/tactic/arith/lia2card_tactic.cpp
View file

@ -36,7 +36,7 @@ class lia2card_tactic : public tactic {
expr* m_expr;
bound(unsigned lo, unsigned hi, expr* b):
m_lo(lo), m_hi(hi), m_expr(b) {}
bound(): m_lo(0), m_hi(0), m_expr(0) {}
bound(): m_lo(0), m_hi(0), m_expr(nullptr) {}
};
struct lia_rewriter_cfg : public default_rewriter_cfg {

2
src/tactic/fd_solver/enum2bv_solver.cpp
View file

@ -148,7 +148,7 @@ public:
// translate enumeration constants to bit-vectors.
for (expr* v : vars) {
func_decl* f = 0;
func_decl* f = nullptr;
if (is_app(v) && is_uninterp_const(v) && m_rewriter.enum2bv().find(to_app(v)->get_decl(), f)) {
bvars.push_back(m.mk_const(f));
}

2
src/tactic/generic_model_converter.h
View file

@ -45,7 +45,7 @@ public:
void hide(expr* e) { SASSERT(is_app(e) && to_app(e)->get_num_args() == 0); hide(to_app(e)->get_decl()); }
void hide(func_decl * f) { m_entries.push_back(entry(f, 0, m, HIDE)); }
void hide(func_decl * f) { m_entries.push_back(entry(f, nullptr, m, HIDE)); }
void add(func_decl * d, expr* e);

2
src/tactic/portfolio/solver2lookahead.cpp
View file

@ -20,5 +20,5 @@ Notes:
#include "solver/solver.h"
solver * mk_solver2lookahead(solver* s) {
return 0;
return nullptr;
}

2
src/tactic/proof_converter.cpp
View file

@ -130,7 +130,7 @@ proof_ref apply(ast_manager & m, proof_converter_ref & pc1, proof_converter_ref_
for (unsigned i = 0; i < sz; i++) {
proof_ref pr(m);
SASSERT(pc2s[i]); // proof production is enabled
pr = pc2s[i]->operator()(m, 0, 0);
pr = pc2s[i]->operator()(m, 0, nullptr);
prs.push_back(pr);
}
return (*pc1)(m, sz, prs.c_ptr());

2
src/tactic/sine_filter.cpp
View file

@ -54,7 +54,7 @@ public:
TRACE("sine", tout << new_forms.size(););
g->reset();
for (unsigned i = 0; i < new_forms.size(); i++) {
g->assert_expr(new_forms.get(i), 0, 0);
g->assert_expr(new_forms.get(i), nullptr, nullptr);
}
g->inc_depth();
g->updt_prec(goal::OVER);

4
src/tactic/tactical.cpp
View file

@ -636,7 +636,7 @@ public:
else {
SASSERT(is_decided_unsat(r2));
if (cores_enabled && r2[0]->dep(0) != 0) {
if (cores_enabled && r2[0]->dep(0) != nullptr) {
expr_dependency_ref * new_dep = alloc(expr_dependency_ref, new_m);
*new_dep = r2[0]->dep(0);
core_buffer.set(i, new_dep);
@ -674,7 +674,7 @@ public:
ast_translation translator(*(managers[i]), m, false);
goal_ref_buffer * r = goals_vect[i];
unsigned j = result.size();
if (r != 0) {
if (r != nullptr) {
for (unsigned k = 0; k < r->size(); k++) {
result.push_back((*r)[k]->translate(translator));
}