mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-05-05 09:55:15 +00:00
Code Activity

Standardize for-loop increments to prefix form (++i) (#8199)

Browse source 
* Initial plan

* Convert postfix to prefix increment in for loops

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

* Fix member variable increment conversion bug

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

* Update API generator to produce prefix increments

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-14 19:55:31 -08:00 • committed by GitHub
parent 1bf463d77a
commit 2436943794
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
475 changed files with 3237 additions and 3237 deletions
Download patch file Download diff file Expand all files Collapse all files

16
src/smt/diff_logic.h
View file

@ -225,7 +225,7 @@ class dl_graph {
SASSERT(m_assignment.size() <= m_heap.get_bounds());
SASSERT(m_in_edges.size() == m_out_edges.size());
int n = m_out_edges.size();
for (dl_var id = 0; id < n; id++) {
for (dl_var id = 0; id < n; ++id) {
const edge_id_vector & e_ids = m_out_edges[id];
for (edge_id e_id : e_ids) {
SASSERT(static_cast<unsigned>(e_id) <= m_edges.size());
@ -233,7 +233,7 @@ class dl_graph {
SASSERT(e.get_source() == id);
}
}
for (dl_var id = 0; id < n; id++) {
for (dl_var id = 0; id < n; ++id) {
const edge_id_vector & e_ids = m_in_edges[id];
for (edge_id e_id : e_ids) {
SASSERT(static_cast<unsigned>(e_id) <= m_edges.size());
@ -242,7 +242,7 @@ class dl_graph {
}
}
n = m_edges.size();
for (int i = 0; i < n; i++) {
for (int i = 0; i < n; ++i) {
const edge & e = m_edges[i];
SASSERT(std::find(m_out_edges[e.get_source()].begin(), m_out_edges[e.get_source()].end(), i)
!= m_out_edges[e.get_source()].end());
@ -884,7 +884,7 @@ public:
unsigned num_edges = m_edges.size();
SASSERT(old_num_edges <= num_edges);
unsigned to_delete = num_edges - old_num_edges;
for (unsigned i = 0; i < to_delete; i++) {
for (unsigned i = 0; i < to_delete; ++i) {
const edge & e = m_edges.back();
TRACE(dl_bug, tout << "deleting edge:\n"; display_edge(tout, e););
dl_var source = e.get_source();
@ -990,7 +990,7 @@ public:
out << "digraph "" {\n";
unsigned n = m_assignment.size();
for (unsigned v = 0; v < n; v++) {
for (unsigned v = 0; v < n; ++v) {
if (vars.contains(v)) {
out << "\"" << v << "\" [label=\"" << v << ":" << m_assignment[v] << "\"]\n";
}
@ -1029,7 +1029,7 @@ public:
template<typename FilterAssignmentProc>
void display_assignment(std::ostream & out, FilterAssignmentProc p) const {
unsigned n = m_assignment.size();
for (unsigned v = 0; v < n; v++) {
for (unsigned v = 0; v < n; ++v) {
if (p(v)) {
out << "$" << v << " := " << m_assignment[v] << "\n";
}
@ -1201,13 +1201,13 @@ public:
scc_id.resize(n, -1);
m_next_dfs_time = 0;
m_next_scc_id = 0;
for (dl_var v = 0; v < n; v++) {
for (dl_var v = 0; v < n; ++v) {
if (m_dfs_time[v] == -1) {
dfs(v, scc_id);
}
}
TRACE(eq_scc,
for (dl_var v = 0; v < n; v++) {
for (dl_var v = 0; v < n; ++v) {
tout << "$" << v << " -> " << scc_id[v] << "\n";
});
}