mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-24 03:57:51 +00:00
Code Activity

na

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2021-07-02 02:48:45 -07:00
parent 05bcf0bed7
commit 788de7d614
9 changed files with 174 additions and 45 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -11,6 +11,11 @@ Author:
Nikolaj Bjorner (nbjorner) 2021-03-19
Jakob Rath 2021-04-6
Notes:
NEW_VIABLE uses cheaper book-keeping, but is partial.
The implementation of NEW_VIABLE is atm incomplete and ad-hoc.
--*/
#pragma once
@ -18,10 +23,7 @@ Author:
#include <limits>
#if !NEW_VIABLE
#include "math/dd/dd_bdd.h"
#endif
#include "math/polysat/types.h"
#include "math/interval/mod_interval.h"
@ -43,15 +45,17 @@ namespace polysat {
unsigned m_num_bits;
rational p2() const { return rational::power_of_two(m_num_bits); }
bool is_max(rational const& a) const;
void set_lo(rational const& lo);
void set_hi(rational const& hi);
void intersect_eq(rational const& a, bool is_positive);
void narrow(std::function<bool(rational const&)>& eval, unsigned& budget);
public:
viable_set(unsigned num_bits): m_num_bits(num_bits) {}
bool is_singleton() const;
dd::find_t find_hint(rational const& c, rational& val) const;
void set_ne(rational const& a) { intersect_eq(a, false); }
void intersect_eq(rational const& a, rational const& b, bool is_positive);
void set_lo(rational const& lo);
void set_hi(rational const& hi);
bool intersect_eq(rational const& a, rational const& b, bool is_positive);
void intersect_eq(rational const& a, rational const& b, bool is_positive, unsigned& budget);
bool intersect_ule(rational const& a, rational const& b, rational const& c, rational const& d, bool is_positive);
void intersect_ule(rational const& a, rational const& b, rational const& c, rational const& d, bool is_positive, unsigned& budget);
};