mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-06-08 01:50:55 +00:00
Code Activity

Fix 13 compiler warnings: sign-comparison and unused parameters (#8215)

Browse source 
* Initial plan

* Fix 13 compiler warnings: sign-comparison and unused parameters

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-16 16:00:42 -08:00 • committed by GitHub
parent 9666915dca
commit 36323f723b
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
10 changed files with 13 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/smt/diff_logic.h
View file

@ -224,7 +224,7 @@ class dl_graph {
SASSERT(m_assignment.size() == m_parent.size());
SASSERT(m_assignment.size() <= m_heap.get_bounds());
SASSERT(m_in_edges.size() == m_out_edges.size());
int n = m_out_edges.size();
int n = static_cast<int>(m_out_edges.size());
for (dl_var id = 0; id < n; ++id) {
const edge_id_vector & e_ids = m_out_edges[id];
for (edge_id e_id : e_ids) {
@ -1195,7 +1195,7 @@ public:
scc_id.reset();
m_roots.reset();
m_unfinished.reset();
int n = m_assignment.size();
int n = static_cast<int>(m_assignment.size());
m_unfinished_set.resize(n, false);
m_dfs_time.resize(n, -1);
scc_id.resize(n, -1);

2
src/smt/smt_case_split_queue.cpp
View file

@ -1030,7 +1030,7 @@ namespace {
void add_to_queue2(expr * e)
{
int idx = m_queue2.size();
int idx = static_cast<int>(m_queue2.size());
GOAL_START();
m_queue2.push_back(queue_entry(e, get_generation(e)));

2
src/smt/theory_arith_core.h
View file

@ -2174,7 +2174,7 @@ namespace smt {
bool is_pos = !is_neg;
if (x_i != x_j && ((is_pos && above_lower(x_j)) || (is_neg && below_upper(x_j)))) {
int num = get_num_non_free_dep_vars(x_j, best_so_far);
int col_sz = m_columns[x_j].size();
int col_sz = static_cast<int>(m_columns[x_j].size());
if (num < best_so_far || (num == best_so_far && col_sz < best_col_sz)) {
result = x_j;
out_a_ij = a_ij;

2
src/smt/theory_dense_diff_logic_def.h
View file

@ -620,7 +620,7 @@ namespace smt {
template<typename Ext>
bool theory_dense_diff_logic<Ext>::check_matrix() const {
int sz = m_matrix.size();
int sz = static_cast<int>(m_matrix.size());
for (theory_var i = 0; i < sz; ++i) {
for (theory_var j = 0; j < sz; ++j) {
cell const & c = m_matrix[i][j];