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

18
src/smt/smt_case_split_queue.cpp
View file

@ -280,7 +280,7 @@ namespace {
ptr_vector<expr> undef_children;
bool found_undef = false;
unsigned num_args = parent->get_num_args();
for (unsigned i = 0; i < num_args; i++) {
for (unsigned i = 0; i < num_args; ++i) {
expr * arg = parent->get_arg(i);
lbool arg_val = ctx.get_assignment(arg);
if (arg_val == val)
@ -420,7 +420,7 @@ namespace {
void next_case_split_core(ptr_vector<expr> & queue, unsigned & head, bool_var & next, lbool & phase) {
phase = l_undef;
unsigned sz = queue.size();
for (; head < sz; head++) {
for (; head < sz; ++head) {
expr * curr = queue[head];
bool is_or = m_manager.is_or(curr);
bool is_and = m_manager.is_and(curr);
@ -480,7 +480,7 @@ namespace {
if (queue.empty())
return;
unsigned sz = queue.size();
for (unsigned i = 0; i < sz; i++) {
for (unsigned i = 0; i < sz; ++i) {
if (i == head)
out << "[HEAD" << idx << "]=> ";
out << "#" << queue[i]->get_id() << " ";
@ -614,7 +614,7 @@ namespace {
void next_case_split_core(bool_var & next, lbool & phase) {
phase = l_undef;
unsigned sz = m_queue.size();
for (; m_head < sz; m_head++) {
for (; m_head < sz; ++m_head) {
expr * curr = m_queue[m_head];
bool is_or = m_manager.is_or(curr);
bool is_and = m_manager.is_and(curr);
@ -675,7 +675,7 @@ namespace {
if (m_queue.empty())
return;
unsigned sz = m_queue.size();
for (unsigned i = 0; i < sz; i++) {
for (unsigned i = 0; i < sz; ++i) {
if (i == m_head)
out << "[HEAD]=> ";
out << "#" << m_queue[i]->get_id() << " ";
@ -856,14 +856,14 @@ namespace {
m_current_generation = s.m_generation;
m_current_goal = s.m_goal;
for (unsigned i = s.m_queue2_trail; i < m_queue2.size(); i++) {
for (unsigned i = s.m_queue2_trail; i < m_queue2.size(); ++i) {
//TRACE(case_split, tout << "ld[" << i << "] = " << m_queue2[i].m_last_decided << " cont " <<
SASSERT((m_queue2[i].m_last_decided == -1) == m_priority_queue2.contains(i));
if (m_priority_queue2.contains(i))
m_priority_queue2.erase(i);
}
for (unsigned i = 0; i < s.m_queue2_trail; i++) {
for (unsigned i = 0; i < s.m_queue2_trail; ++i) {
queue_entry & e = m_queue2[i];
if (e.m_last_decided > static_cast<int>(new_lvl)) {
@ -923,7 +923,7 @@ namespace {
next = null_bool_var;
unsigned sz = m_queue.size();
for (; m_head < sz; m_head++) {
for (; m_head < sz; ++m_head) {
expr * curr = m_queue[m_head];
next_case_split_core(curr, next, phase);
if (next != null_bool_var)
@ -955,7 +955,7 @@ namespace {
if (queue.empty())
return;
unsigned sz = queue.size();
for (unsigned i = 0; i < sz; i++) {
for (unsigned i = 0; i < sz; ++i) {
if (i == head)
out << "[HEAD" << idx << "]=> ";
out << "#" << queue[i]->get_id() << " ";