mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-06 14:13:23 +00:00
Code Activity

fix compiler warnings

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2017-07-04 13:43:32 -07:00
parent a1306eaab6
commit d66db280a8
3 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/ast/substitution/substitution.cpp
View file

@ -85,7 +85,7 @@ void substitution::apply(unsigned num_actual_offsets, unsigned const * deltas, e
m_state = APPLY; m_state = APPLY;
unsigned j; unsigned j;
expr * e; expr * e = 0;
unsigned off; unsigned off;
expr_offset n1; expr_offset n1;
bool visited; bool visited;
@ -214,7 +214,7 @@ void substitution::apply(unsigned num_actual_offsets, unsigned const * deltas, e
} }
} }
SASSERT(m_apply_cache.contains(n)); SASSERT(m_apply_cache.contains(n));
m_apply_cache.find(n, e); VERIFY(m_apply_cache.find(n, e));
m_new_exprs.push_back(e); m_new_exprs.push_back(e);
result = e; result = e;

2
src/tactic/arith/elim01_tactic.cpp
View file

@ -169,7 +169,7 @@ public:
for (; bit != bend; ++bit) { for (; bit != bend; ++bit) {
if (!is_app(*bit)) continue; if (!is_app(*bit)) continue;
app* x = to_app(*bit); app* x = to_app(*bit);
bool s1, s2; bool s1 = false, s2 = false;
rational lo, hi; rational lo, hi;
if (a.is_int(x) && if (a.is_int(x) &&
bounds.has_lower(x, lo, s1) && !s1 && zero <= lo && bounds.has_lower(x, lo, s1) && !s1 && zero <= lo &&

2
src/tactic/arith/lia2card_tactic.cpp
View file

@ -176,7 +176,7 @@ public:
bound_manager::iterator bit = bounds.begin(), bend = bounds.end(); bound_manager::iterator bit = bounds.begin(), bend = bounds.end();
for (; bit != bend; ++bit) { for (; bit != bend; ++bit) {
expr* x = *bit; expr* x = *bit;
bool s1, s2; bool s1 = false, s2 = false;
rational lo, hi; rational lo, hi;
if (a.is_int(x) && if (a.is_int(x) &&
bounds.has_lower(x, lo, s1) && !s1 && lo.is_zero() && bounds.has_lower(x, lo, s1) && !s1 && lo.is_zero() &&