3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-04-28 06:43:36 +00:00

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

* 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

View file

@ -42,7 +42,7 @@ public:
}
bool empty() const {
for (unsigned i = 0; i < size(); i++) {
for (unsigned i = 0; i < size(); ++i) {
if ((*this)[i] != 0) {
return false;
}
@ -72,7 +72,7 @@ public:
unsigned num_elems() const {
unsigned r = 0;
for (unsigned i = 0; i < size(); i++) {
for (unsigned i = 0; i < size(); ++i) {
r += get_num_1bits((*this)[i]);
}
return r;
@ -84,7 +84,7 @@ public:
if (source_size > size()) {
resize(source_size + 1);
}
for (unsigned i = 0; i < source_size; i++) {
for (unsigned i = 0; i < source_size; ++i) {
(*this)[i] |= source[i];
}
return *this;
@ -95,7 +95,7 @@ public:
if (source_size < size()) {
resize(source_size);
}
for (unsigned i = 0; i < size(); i++) {
for (unsigned i = 0; i < size(); ++i) {
(*this)[i] &= source[i];
}
return *this;
@ -106,7 +106,7 @@ public:
if (source.size() < min_size) {
min_size = source.size();
}
for (unsigned i = 0; i < min_size; i++) {
for (unsigned i = 0; i < min_size; ++i) {
if ((*this)[i] != source[i]) {
return false;
}
@ -135,7 +135,7 @@ public:
if (source.size() < min_size) {
min_size = source.size();
}
for (unsigned i = 0; i < min_size; i++) {
for (unsigned i = 0; i < min_size; ++i) {
if (((*this)[i] & ~source[i]) != 0) {
return false;
}
@ -219,7 +219,7 @@ inline std::ostream & operator<<(std::ostream & target, const uint_set & s) {
unsigned n = s.get_max_elem() + 1;
target << "{";
bool first = true;
for (unsigned i = 0; i < n; i++) {
for (unsigned i = 0; i < n; ++i) {
if (s.contains(i)) {
if (first) {
first = false;