mirror of
https://github.com/Z3Prover/z3
synced 2025-04-29 11:55:51 +00:00
Use nullptr.
This commit is contained in:
parent
f01328c65f
commit
76eb7b9ede
625 changed files with 4639 additions and 4639 deletions
|
@ -243,7 +243,7 @@ public:
|
|||
case l_true:
|
||||
get_current_correction_set(cs);
|
||||
if (cs.empty()) {
|
||||
m_found_feasible_optimum = m_model.get() != 0;
|
||||
m_found_feasible_optimum = m_model.get() != nullptr;
|
||||
m_lower = m_upper;
|
||||
}
|
||||
else {
|
||||
|
@ -443,7 +443,7 @@ public:
|
|||
rational w = split_core(corr_set);
|
||||
cs_max_resolve(corr_set, w);
|
||||
IF_VERBOSE(2, verbose_stream() << "(opt.maxres.correction-set " << corr_set.size() << ")\n";);
|
||||
m_csmodel = 0;
|
||||
m_csmodel = nullptr;
|
||||
m_correction_set_size = 0;
|
||||
}
|
||||
|
||||
|
@ -488,7 +488,7 @@ public:
|
|||
}
|
||||
|
||||
void process_unsat(exprs const& core) {
|
||||
IF_VERBOSE(3, verbose_stream() << "(maxres cs model valid: " << (m_csmodel.get() != 0) << " cs size:" << m_correction_set_size << " core: " << core.size() << ")\n";);
|
||||
IF_VERBOSE(3, verbose_stream() << "(maxres cs model valid: " << (m_csmodel.get() != nullptr) << " cs size:" << m_correction_set_size << " core: " << core.size() << ")\n";);
|
||||
expr_ref fml(m);
|
||||
remove_core(core);
|
||||
SASSERT(!core.empty());
|
||||
|
@ -524,7 +524,7 @@ public:
|
|||
if (m_c.sat_enabled()) {
|
||||
// SAT solver core extracts some model
|
||||
// during unsat core computation.
|
||||
mdl = 0;
|
||||
mdl = nullptr;
|
||||
s().get_model(mdl);
|
||||
}
|
||||
else {
|
||||
|
@ -533,7 +533,7 @@ public:
|
|||
if (mdl.get() && w < m_upper) {
|
||||
update_assignment(mdl.get());
|
||||
}
|
||||
return 0 != mdl.get();
|
||||
return nullptr != mdl.get();
|
||||
}
|
||||
|
||||
lbool minimize_core(exprs& core) {
|
||||
|
@ -820,7 +820,7 @@ public:
|
|||
m_found_feasible_optimum = false;
|
||||
m_last_index = 0;
|
||||
add_upper_bound_block();
|
||||
m_csmodel = 0;
|
||||
m_csmodel = nullptr;
|
||||
m_correction_set_size = 0;
|
||||
return l_true;
|
||||
}
|
||||
|
@ -844,7 +844,7 @@ public:
|
|||
smt_solver->assert_expr(s().get_assertion(i));
|
||||
}
|
||||
smt_solver->assert_expr(core);
|
||||
lbool is_sat = smt_solver->check_sat(0, 0);
|
||||
lbool is_sat = smt_solver->check_sat(0, nullptr);
|
||||
if (is_sat == l_true) {
|
||||
IF_VERBOSE(0, verbose_stream() << "not a core\n";);
|
||||
}
|
||||
|
@ -864,7 +864,7 @@ public:
|
|||
}
|
||||
smt_solver->assert_expr(n);
|
||||
}
|
||||
lbool is_sat = smt_solver->check_sat(0, 0);
|
||||
lbool is_sat = smt_solver->check_sat(0, nullptr);
|
||||
if (is_sat == l_false) {
|
||||
IF_VERBOSE(0, verbose_stream() << "assignment is infeasible\n";);
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue