mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-22 08:35:31 +00:00
Code Activity

remove add_non_viable

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2021-11-18 15:57:55 -08:00
parent 6bf4f001d9
commit caaefef847
4 changed files with 0 additions and 28 deletions
Download patch file Download diff file Expand all files Collapse all files

7
src/math/polysat/viable.cpp
View file

@ -90,13 +90,6 @@ namespace polysat {
return var2bits(v).contains(m_viable[v], val);
}
void viable::add_non_viable(pvar v, rational const& val) {
LOG("pvar " << v << " /= " << val);
SASSERT(is_viable(v, val));
auto const& bits = var2bits(v);
intersect_viable(v, bits.var() != val);
}
void viable::intersect_viable(pvar v, bdd vals) {
push_viable(v);
m_viable[v] &= vals;

5
src/math/polysat/viable.h
View file

@ -86,11 +86,6 @@ namespace polysat {
*/
bool is_viable(pvar v, rational const& val);
/**
* register that val is non-viable for var.
*/
void add_non_viable(pvar v, rational const& val);
/*
* Extract min and max viable values for v
*/

11
src/math/polysat/viable2.cpp
View file

@ -170,17 +170,6 @@ namespace polysat {
return true;
}
void viable2::add_non_viable(pvar v, rational const& lo_val, signed_constraint const& c) {
entry* ne = alloc_entry();
rational const& max_value = s.var2pdd(v).max_value();
rational hi_val = (lo_val == max_value) ? rational::zero() : lo_val + 1;
pdd lo = s.var2pdd(v).mk_val(lo_val);
pdd hi = s.var2pdd(v).mk_val(hi_val);
ne->interval = eval_interval::proper(lo, lo_val, hi, hi_val);
ne->src = c;
intersect(v, ne);
}
rational viable2::min_viable(pvar v) {
rational lo(0);
auto* e = m_viable[v];

5
src/math/polysat/viable2.h
View file

@ -83,11 +83,6 @@ namespace polysat {
*/
bool is_viable(pvar v, rational const& val);
/**
* register that val is non-viable for var.
*/
void add_non_viable(pvar v, rational const& val, signed_constraint const& c);
/*
* Extract min and max viable values for v
*/