mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-02-16 13:51:44 +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

10
src/util/prime_generator.cpp
View file

@ -32,12 +32,12 @@ void prime_generator::process_next_k_numbers(uint64_t k) {
SASSERT(m_primes[j] == 3);
while (!todo.empty()) {
unsigned sz = m_primes.size();
for (; j < sz; j++) {
for (; j < sz; ++j) {
uint64_t p = m_primes[j];
unsigned todo_sz = todo.size();
unsigned k1 = 0;
unsigned k2 = 0;
for (; k1 < todo_sz; k1++) {
for (; k1 < todo_sz; ++k1) {
if (todo[k1] % p == 0)
continue;
todo[k2] = todo[k1];
@ -48,7 +48,7 @@ void prime_generator::process_next_k_numbers(uint64_t k) {
return;
if (p > (todo[k2-1] / p) + 1) {
// all numbers in todo are primes
for (unsigned k1 = 0; k1 < k2; k1++) {
for (unsigned k1 = 0; k1 < k2; ++k1) {
m_primes.push_back(todo[k1]);
}
return;
@ -58,7 +58,7 @@ void prime_generator::process_next_k_numbers(uint64_t k) {
p = p*p;
unsigned todo_sz = todo.size();
unsigned k1 = 0;
for (k1 = 0; k1 < todo_sz; k1++) {
for (k1 = 0; k1 < todo_sz; ++k1) {
if (todo[k1] < p) {
m_primes.push_back(todo[k1]);
}
@ -67,7 +67,7 @@ void prime_generator::process_next_k_numbers(uint64_t k) {
}
}
unsigned k2 = 0;
for (; k1 < todo_sz; k1++, k2++) {
for (; k1 < todo_sz; ++k1, ++k2) {
todo[k2] = todo[k1];
}
todo.shrink(k2);