mirror of
https://github.com/Z3Prover/z3
synced 2026-03-02 03:36:53 +00:00
Refactor mk_and/mk_or call sites to use vector overloads (#8286)
* Initial plan * Refactor mk_and and mk_or call sites to use overloaded methods Changed 130 call sites across 64 files to use vector overloads directly instead of manually passing .size() and .data()/.c_ptr() Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com> * Revert mk_or changes for ptr_buffer/ptr_vector (no overload exists in ast_util.h) * Fix compilation errors from mk_and/mk_or refactoring Fixed type mismatches by: - Removing m parameter for expr_ref_vector (ast_util.h has mk_and/mk_or(expr_ref_vector) overloads) - Reverting changes for ref_buffer types (no overload exists in ast_util.h, only in ast.h for m.mk_and) - Verified build succeeds and Z3 works correctly Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com> * Fix test files to use correct mk_and/mk_or overloads Changed test/doc.cpp and test/udoc_relation.cpp to use mk_and(expr_ref_vector) and mk_or(expr_ref_vector) without m parameter Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com> --------- Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com> Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>
This commit is contained in:
parent
d2e0354ce4
commit
ebc0688470
61 changed files with 118 additions and 118 deletions
|
|
@ -173,7 +173,7 @@ class test_doc_cls {
|
|||
default: break;
|
||||
}
|
||||
}
|
||||
result = mk_and(m, conjs.size(), conjs.data());
|
||||
result = mk_and(conjs);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
|
@ -197,7 +197,7 @@ class test_doc_cls {
|
|||
break;
|
||||
}
|
||||
}
|
||||
result = mk_and(m, conjs.size(), conjs.data());
|
||||
result = mk_and(conjs);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
|
@ -208,7 +208,7 @@ class test_doc_cls {
|
|||
for (unsigned i = 0; i < d.neg().size(); ++i) {
|
||||
conjs.push_back(m.mk_not(to_formula(d.neg()[i], m2)));
|
||||
}
|
||||
result = mk_and(m, conjs.size(), conjs.data());
|
||||
result = mk_and(conjs);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
|
@ -218,7 +218,7 @@ class test_doc_cls {
|
|||
for (unsigned i = 0; i < ud.size(); ++i) {
|
||||
disjs.push_back(to_formula(ud[i], m2));
|
||||
}
|
||||
result = mk_or(m, disjs.size(), disjs.data());
|
||||
result = mk_or(disjs);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
|
@ -299,7 +299,7 @@ class test_doc_cls {
|
|||
fmls.push_back(m.mk_not(mk_conj(*t)));
|
||||
d->neg().push_back(t);
|
||||
}
|
||||
fml1 = mk_and(m, fmls.size(), fmls.data());
|
||||
fml1 = mk_and(fmls);
|
||||
bool_vector to_merge(N, false);
|
||||
bit_vector discard_cols;
|
||||
discard_cols.resize(N, false);
|
||||
|
|
@ -321,7 +321,7 @@ class test_doc_cls {
|
|||
}
|
||||
}
|
||||
eqs.push_back(to_formula(*d, dm));
|
||||
fml1 = mk_and(m, eqs.size(), eqs.data());
|
||||
fml1 = mk_and(eqs);
|
||||
if (dm.merge(*d, lo, 1, equalities, discard_cols)) {
|
||||
fml2 = to_formula(*d, dm);
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue