mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-25 20:46:01 +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

14
src/duality/duality_rpfp.cpp Executable file → Normal file
View file

@ -1345,8 +1345,8 @@ namespace Duality {
{
timer_start("Solve");
TermTree *tree = GetConstraintTree(root);
TermTree *interpolant = NULL;
TermTree *goals = NULL;
TermTree *interpolant = nullptr;
TermTree *goals = nullptr;
if(ls->need_goals)
goals = GetGoalTree(root);
ClearProofCore();
@ -1396,11 +1396,11 @@ namespace Duality {
timer_start("Solve");
TermTree *tree = CollapseTermTree(GetConstraintTree(root,node));
tree->getChildren().push_back(CollapseTermTree(ToTermTree(node)));
TermTree *interpolant = NULL;
TermTree *interpolant = nullptr;
ClearProofCore();
timer_start("interpolate_tree");
lbool res = ls_interpolate_tree(tree, interpolant, dualModel,0,true);
lbool res = ls_interpolate_tree(tree, interpolant, dualModel,nullptr,true);
timer_stop("interpolate_tree");
if (res == l_false) {
DecodeTree(node, interpolant->getChildren()[0], 0);
@ -1423,7 +1423,7 @@ namespace Duality {
void RPFP::DisposeDualModel()
{
dualModel = model(ctx,NULL);
dualModel = model(ctx,nullptr);
}
RPFP::Term RPFP::UnderapproxFlag(Node *n){
@ -3281,9 +3281,9 @@ namespace Duality {
{
stack_entry &back = stack.back();
for(std::list<Edge *>::iterator it = back.edges.begin(), en = back.edges.end(); it != en; ++it)
(*it)->dual = expr(ctx,NULL);
(*it)->dual = expr(ctx,nullptr);
for(std::list<Node *>::iterator it = back.nodes.begin(), en = back.nodes.end(); it != en; ++it)
(*it)->dual = expr(ctx,NULL);
(*it)->dual = expr(ctx,nullptr);
for(std::list<std::pair<Edge *,Term> >::iterator it = back.constraints.begin(), en = back.constraints.end(); it != en; ++it)
(*it).first->constraints.pop_back();
stack.pop_back();