mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-27 10:55:50 +00:00
Code Activity

na

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2021-06-21 16:00:13 -07:00
parent 6f93ed8dc2
commit 9173306adc
4 changed files with 20 additions and 54 deletions
Download patch file Download diff file Expand all files Collapse all files

40
src/math/polysat/solver.cpp
View file

@ -34,49 +34,9 @@ namespace polysat {
return *m_pdd[sz];
}
#if 0
dd::fdd const& solver::sz2bits(unsigned sz) {
m_bits.reserve(sz + 1);
auto* bits = m_bits[sz];
if (!bits) {
m_bits.set(sz, alloc(dd::fdd, m_bdd, sz));
bits = m_bits[sz];
}
return *bits;
}
bool solver::has_viable(pvar v) {
return !m_viable[v].is_false();
}
bool solver::is_viable(pvar v, rational const& val) {
return var2bits(v).contains(m_viable[v], val);
}
void solver::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 solver::intersect_viable(pvar v, bdd vals) {
push_viable(v);
m_viable[v] &= vals;
if (m_viable[v].is_false())
set_conflict(v);
}
dd::find_t solver::find_viable(pvar v, rational & val) {
return var2bits(v).find_hint(m_viable[v], m_value[v], val);
}
#endif
solver::solver(reslimit& lim):
m_lim(lim),
m_vble(*this),
// m_bdd(1000),
m_dm(m_value_manager, m_alloc),
m_linear_solver(*this),
m_free_vars(m_activity),