mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-06-05 16:40:52 +00:00
Code Activity

Modernize C++ patterns: range-based for loops and nullptr (#8167)

Browse source 
* Initial plan

* Replace NULL with nullptr in test files

Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>

* Convert iterator loops to range-based for loops (part 1)

Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>

* Convert iterator loops to range-based for loops (part 2)

Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>

* Fix compilation errors in iterator loop conversions

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:
Copilot 2026-01-11 21:20:07 -08:00 • committed by GitHub
parent 15108bf36e
commit b5492e5cf9
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
16 changed files with 84 additions and 140 deletions
Download patch file Download diff file Expand all files Collapse all files

15
src/muz/ddnf/ddnf.cpp
View file

@ -367,9 +367,8 @@ namespace datalog {
}
void add_table(ddnf_nodes& dst, ddnf_nodes const& src) {
ddnf_nodes::iterator it = src.begin(), end = src.end();
for (; it != end; ++it) {
dst.insert(*it);
for (ddnf_node* node : src) {
dst.insert(node);
}
}
};
@ -428,9 +427,8 @@ namespace datalog {
u_map<ddnf_mgr*> m_mgrs;
public:
~ddnfs() {
u_map<ddnf_mgr*>::iterator it = m_mgrs.begin(), end = m_mgrs.end();
for (; it != end; ++it) {
dealloc(it->m_value);
for (auto const& kv : m_mgrs) {
dealloc(kv.m_value);
}
}
@ -838,11 +836,10 @@ namespace datalog {
compile_var(v, w);
unsigned num_bits = bv.get_bv_size(c);
ddnf_nodes const& ns = m_ddnfs.lookup(num_bits, *t);
ddnf_nodes::iterator it = ns.begin(), end = ns.end();
expr_ref_vector eqs(m);
sort* s = w->get_sort();
for (; it != end; ++it) {
eqs.push_back(m.mk_eq(w, bv.mk_numeral(rational((*it)->get_id()), s)));
for (ddnf_node* node : ns) {
eqs.push_back(m.mk_eq(w, bv.mk_numeral(rational(node->get_id()), s)));
}
switch (eqs.size()) {
case 0: