SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <ConflictGenerator.h>
Public Member Functions | |
Bound (ConstraintT constr, Poly p, Poly q, Rational r, bool neg) | |
Data Fields | |
ConstraintT | constr |
Poly | p |
Poly | q |
Rational | r |
bool | neg |
Friends | |
std::ostream & | operator<< (std::ostream &os, const Bound &dt) |
Definition at line 50 of file ConflictGenerator.h.
|
inline |
Definition at line 56 of file ConflictGenerator.h.
|
friend |
Definition at line 60 of file ConflictGenerator.h.
ConstraintT smtrat::mcsat::fm::Bound::constr |
Definition at line 51 of file ConflictGenerator.h.
bool smtrat::mcsat::fm::Bound::neg |
Definition at line 55 of file ConflictGenerator.h.
Poly smtrat::mcsat::fm::Bound::p |
Definition at line 52 of file ConflictGenerator.h.
Poly smtrat::mcsat::fm::Bound::q |
Definition at line 53 of file ConflictGenerator.h.
Rational smtrat::mcsat::fm::Bound::r |
Definition at line 54 of file ConflictGenerator.h.