diff --git a/src/math/polysat/viable.cpp b/src/math/polysat/viable.cpp index 9fe444301..e2c461d7b 100644 --- a/src/math/polysat/viable.cpp +++ b/src/math/polysat/viable.cpp @@ -1511,7 +1511,15 @@ namespace polysat { return {nullptr, false}; } - lbool viable::find_on_layers(pvar const v, unsigned_vector const& widths, pvar_vector const& overlaps, fixed_bits_info const& fbi, rational const& to_cover_lo, rational const& to_cover_hi, rational& val) { + lbool viable::find_on_layers( + pvar const v, + unsigned_vector const& widths, + pvar_vector const& overlaps, + fixed_bits_info const& fbi, + rational const& to_cover_lo, + rational const& to_cover_hi, + rational& val + ) { ptr_vector refine_todo; // max number of interval refinements before falling back to the univariate solver diff --git a/src/math/polysat/viable.h b/src/math/polysat/viable.h index 09cddbf3a..bacd501a0 100644 --- a/src/math/polysat/viable.h +++ b/src/math/polysat/viable.h @@ -207,8 +207,24 @@ namespace polysat { public: lbool find_viable2_new(pvar v, rational& out_lo, rational& out_hi); - lbool viable::find_on_layers(pvar v, unsigned_vector const& widths, pvar_vector const& overlaps, fixed_bits_info const& fbi, rational const& to_cover_lo, rational const& to_cover_hi, rational& out_val); - lbool find_on_layer(pvar v, unsigned w_idx, unsigned_vector const& widths, pvar_vector const& overlaps, fixed_bits_info const& fbi, rational const& to_cover_lo, rational const& to_cover_hi, rational& out_val, ptr_vector& refine_todo); + lbool find_on_layers( + pvar v, + unsigned_vector const& widths, + pvar_vector const& overlaps, + fixed_bits_info const& fbi, + rational const& to_cover_lo, + rational const& to_cover_hi, + rational& out_val); + lbool find_on_layer( + pvar v, + unsigned w_idx, + unsigned_vector const& widths, + pvar_vector const& overlaps, + fixed_bits_info const& fbi, + rational const& to_cover_lo, + rational const& to_cover_hi, + rational& out_val, + ptr_vector& refine_todo); std::pair find_value(rational const& val, entry* entries);