mirror of
https://github.com/Z3Prover/z3
synced 2025-08-22 11:07:51 +00:00
make offset_claim structured similar to fixed_claim
This commit is contained in:
parent
b1072d0a1c
commit
f0c23f9b7b
3 changed files with 24 additions and 9 deletions
|
@ -41,11 +41,12 @@ namespace polysat {
|
|||
// val 1011
|
||||
// next 1100
|
||||
|
||||
// algorith: Let i be the most significant index where fixed bits disagree with val.
|
||||
// algorithm: Let i be the most significant index where fixed bits disagree with val.
|
||||
// Set non-fixed values below i to 0.
|
||||
// If m_fixed[i] == l_true; then updating val to mask by fixed bits sufficies.
|
||||
// Otherwise, the range above the disagreement has to be incremented.
|
||||
// Increment the non-fixed bits by 1
|
||||
// The first non-fixed 0 position is set to 1, non-fixed positions below are set to 0.s
|
||||
// The first non-fixed 0 position is set to 1, non-fixed positions below are set to 0.
|
||||
// If there are none, then the value is maximal and we return false.
|
||||
|
||||
bool fixed_bits::next(rational& val) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue