mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-02-03 15:56:17 +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

8
src/util/fixed_bit_vector.cpp
View file

@ -100,21 +100,21 @@ fixed_bit_vector_manager::fill1(fixed_bit_vector& bv) const {
fixed_bit_vector&
fixed_bit_vector_manager::set_and(fixed_bit_vector& dst, fixed_bit_vector const& src) const {
for (unsigned i = 0; i < m_num_words; i++)
for (unsigned i = 0; i < m_num_words; ++i)
dst.m_data[i] &= src.m_data[i];
return dst;
}
fixed_bit_vector&
fixed_bit_vector_manager::set_or(fixed_bit_vector& dst, fixed_bit_vector const& src) const {
for (unsigned i = 0; i < m_num_words; i++)
for (unsigned i = 0; i < m_num_words; ++i)
dst.m_data[i] |= src.m_data[i];
return dst;
}
fixed_bit_vector&
fixed_bit_vector_manager::set_neg(fixed_bit_vector& dst) const {
for (unsigned i = 0; i < m_num_words; i++)
for (unsigned i = 0; i < m_num_words; ++i)
dst.m_data[i] = ~dst.m_data[i];
return dst;
}
@ -130,7 +130,7 @@ bool fixed_bit_vector_manager::equals(fixed_bit_vector const& a, fixed_bit_vecto
unsigned n = num_words();
if (n == 0)
return true;
for (unsigned i = 0; i < n - 1; i++) {
for (unsigned i = 0; i < n - 1; ++i) {
if (a.m_data[i] != b.m_data[i])
return false;
}