3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-02-23 08:47:37 +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 Nikolaj Bjorner
parent 851b8ea31c
commit 317dd92105
475 changed files with 3237 additions and 3237 deletions

View file

@ -384,7 +384,7 @@ template<typename C>
void interval_manager<C>::fact(unsigned n, numeral & o) {
_scoped_numeral<numeral_manager> aux(m());
m().set(o, 1);
for (unsigned i = 2; i <= n; i++) {
for (unsigned i = 2; i <= n; ++i) {
m().set(aux, static_cast<int>(i));
m().mul(aux, o, o);
TRACE(fact_bug, tout << "i: " << i << ", o: " << m().to_rational_string(o) << "\n";);
@ -1901,7 +1901,7 @@ void interval_manager<C>::pi(unsigned n, interval & r) {
// compute lower bound
numeral & l_val = m_result_lower;
m().reset(l_val);
for (unsigned i = 0; i <= n; i++) {
for (unsigned i = 0; i <= n; ++i) {
pi_series(i, p, false);
round_to_minus_inf();
m().add(l_val, p, l_val);
@ -1916,7 +1916,7 @@ void interval_manager<C>::pi(unsigned n, interval & r) {
else {
// recompute the sum rounding to plus infinite
m().reset(u_val);
for (unsigned i = 0; i <= n; i++) {
for (unsigned i = 0; i <= n; ++i) {
pi_series(i, p, true);
round_to_plus_inf();
m().add(u_val, p, u_val);
@ -1954,7 +1954,7 @@ void interval_manager<C>::e_series(unsigned k, bool upper, numeral & o) {
_scoped_numeral<numeral_manager> d(m()), a(m());
m().set(o, 2);
m().set(d, 1);
for (unsigned i = 2; i <= k; i++) {
for (unsigned i = 2; i <= k; ++i) {
set_rounding(!upper);
m().set(a, static_cast<int>(i));
m().mul(d, a, d); // d == i!