mirror of
https://github.com/Z3Prover/z3
synced 2025-04-24 01:25:31 +00:00
deal with compiler warnings (unused variables etc)
This commit is contained in:
parent
6092bf534c
commit
c0f80f92ba
8 changed files with 14 additions and 23 deletions
|
@ -583,8 +583,7 @@ namespace sat {
|
|||
void ddfw::shift_weights() {
|
||||
++m_shifts;
|
||||
for (unsigned to_idx : m_unsat) {
|
||||
auto& cf = m_clauses[to_idx];
|
||||
SASSERT(!cf.is_true());
|
||||
SASSERT(!m_clauses[to_idx].is_true());
|
||||
unsigned from_idx = select_max_same_sign(to_idx);
|
||||
if (from_idx == UINT_MAX || disregard_neighbor())
|
||||
from_idx = select_random_true_clause();
|
||||
|
|
|
@ -72,9 +72,6 @@ namespace arith {
|
|||
continue;
|
||||
if (!s.lp().external_is_used(v))
|
||||
continue;
|
||||
int64_t old_value = 0;
|
||||
if (s.is_registered_var(v))
|
||||
old_value = to_numeral(s.get_ivalue(v).x);
|
||||
int64_t new_value = m_vars[v].m_best_value;
|
||||
s.ensure_column(v);
|
||||
lp::column_index vj = s.lp().to_column_index(v);
|
||||
|
@ -535,13 +532,12 @@ namespace arith {
|
|||
int64_t new_value;
|
||||
double result = 0;
|
||||
double max_result = -1;
|
||||
theory_var max_var = 0;
|
||||
for (auto const & [coeff, x] : ineq->m_args) {
|
||||
if (!cm(!sign0, *ineq, x, coeff, new_value))
|
||||
continue;
|
||||
double result = 0;
|
||||
auto old_value = m_vars[x].m_value;
|
||||
for (auto const [coeff, bv] : m_vars[x].m_bool_vars) {
|
||||
for (auto const& [coeff, bv] : m_vars[x].m_bool_vars) {
|
||||
bool sign = !m_bool_search->value(bv);
|
||||
auto dtt_old = dtt(sign, *atom(bv));
|
||||
auto dtt_new = dtt(sign, *atom(bv), coeff, old_value, new_value);
|
||||
|
|
|
@ -32,7 +32,7 @@ namespace euf {
|
|||
for (auto* th : m_solvers)
|
||||
th->set_bool_search(&bool_search);
|
||||
|
||||
lbool r = bool_search.check(0, nullptr, nullptr);
|
||||
bool_search.check(0, nullptr, nullptr);
|
||||
|
||||
auto const& mdl = bool_search.get_model();
|
||||
for (unsigned i = 0; i < mdl.size(); ++i)
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue