mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-28 11:25:51 +00:00
Code Activity

Use nullptr.

Browse source
This commit is contained in:
Bruce Mitchener 2018-02-12 14:05:55 +07:00
parent f01328c65f
commit 76eb7b9ede
625 changed files with 4639 additions and 4639 deletions
Download patch file Download diff file Expand all files Collapse all files

24
src/qe/qe_arith_plugin.cpp
View file

@ -891,7 +891,7 @@ namespace qe {
while (m_arith.is_add(p)) {
bool found_x = false;
expr* next_p = 0;
expr* next_p = nullptr;
for (unsigned i = 0; i < to_app(p)->get_num_args(); ++i) {
expr* arg = to_app(p)->get_arg(i);
if (contains_x(arg)) {
@ -1287,7 +1287,7 @@ namespace qe {
m_div_coeffs.reset();
m_div_divisors.reset();
m_div_atoms.reset();
m_div_z = 0;
m_div_z = nullptr;
m_nested_div_terms.reset();
m_nested_div_coeffs.reset();
m_nested_div_divisors.reset();
@ -1485,7 +1485,7 @@ public:
expr* m_term;
ptr_vector<app> m_vars;
branch_formula(): m_fml(0), m_var(0), m_branch(0), m_result(0), m_term(0) {}
branch_formula(): m_fml(nullptr), m_var(nullptr), m_branch(0), m_result(nullptr), m_term(nullptr) {}
branch_formula(expr* fml, app* var, unsigned b, expr* r, rational coeff, expr* term, app_ref_vector const& vars):
m_fml(fml),
@ -1750,7 +1750,7 @@ public:
x_subst x_t(m_util);
bounds_proc& bounds = get_bounds(x, fml);
branch_formula bf;
VERIFY (m_subst.find(branch_formula(fml, x, v, 0, rational::zero(), 0, m_util.m_vars_added), bf));
VERIFY (m_subst.find(branch_formula(fml, x, v, nullptr, rational::zero(), nullptr, m_util.m_vars_added), bf));
x_t.set_term(bf.m_term);
x_t.set_coeff(bf.m_coeff);
@ -1949,7 +1949,7 @@ public:
}
}
assign(x, fml, vl);
subst(x, vl, fml, 0);
subst(x, vl, fml, nullptr);
TRACE("qe", tout << mk_pp(fml, m) << "\n";);
return true;
}
@ -1972,7 +1972,7 @@ public:
vl = numeral(0);
}
assign(x, fml, vl);
subst(x, vl, fml, 0);
subst(x, vl, fml, nullptr);
TRACE("qe", tout << mk_pp(fml, m) << "\n";);
return true;
@ -2037,7 +2037,7 @@ public:
bool get_cache(app* x, expr* fml, unsigned v, expr_ref& result) {
branch_formula bf;
if (!m_subst.find(branch_formula(fml, x, v, 0, rational::zero(), 0, m_util.m_vars_added), bf)) {
if (!m_subst.find(branch_formula(fml, x, v, nullptr, rational::zero(), nullptr, m_util.m_vars_added), bf)) {
return false;
}
SASSERT(bf.m_result);
@ -2171,7 +2171,7 @@ public:
}
bounds_proc& get_bounds(app* x, expr* fml) {
bounds_proc* result = 0;
bounds_proc* result = nullptr;
VERIFY (m_bounds_cache.find(x, fml, result));
return *result;
}
@ -2407,7 +2407,7 @@ public:
}
bool update_bounds(contains_app& contains_x, expr* fml) {
bounds_proc* bounds = 0;
bounds_proc* bounds = nullptr;
if (m_bounds_cache.find(contains_x.x(), fml, bounds)) {
return true;
}
@ -2479,7 +2479,7 @@ public:
}
void assign(contains_app& x, expr* fml, rational const& vl) override {
nlarith::branch_conditions *brs = 0;
nlarith::branch_conditions *brs = nullptr;
VERIFY (m_cache.find(x.x(), fml, brs));
SASSERT(vl.is_unsigned());
SASSERT(vl.get_unsigned() < brs->size());
@ -2516,7 +2516,7 @@ public:
}
void subst(contains_app& x, rational const& vl, expr_ref& fml, expr_ref* def) override {
nlarith::branch_conditions *brs = 0;
nlarith::branch_conditions *brs = nullptr;
VERIFY (m_cache.find(x.x(), fml, brs));
SASSERT(vl.is_unsigned());
SASSERT(vl.get_unsigned() < brs->size());
@ -2535,7 +2535,7 @@ public:
unsigned get_weight(contains_app& x, expr* fml) override {
obj_map<app, unsigned>* weights = 0;
obj_map<app, unsigned>* weights = nullptr;
unsigned weight = 0;
if (!m_weights.find(fml, weights)) {
weights = alloc(weight_m);