38 Condition(
const smtrat::ConstraintT&,
size_t _id,
size_t = 0,
bool =
false,
const carl::PointerSet<Condition>& = carl::PointerSet<Condition>(),
bool =
false );
96 double valuate(
const carl::Variable&,
size_t,
bool )
const;
100 void print( std::ostream& = std::cout )
const;
void print(std::ostream &=std::cout) const
Prints the condition to an output stream.
Condition(const Condition &)=delete
const smtrat::ConstraintT & constraint() const
static const double INFINITLY_MANY_SOLUTIONS_WEIGHT
bool & rRecentlyAdded() const
bool recentlyAdded() const
double valuate(const carl::Variable &, size_t, bool) const
Valuates the constraint according to a variable (it possibly not contains).
carl::PointerSet< Condition > * pOriginalConditions() const
smtrat::ConstraintT mConstraint
carl::PointerSet< Condition > * mpOriginalConditions
friend std::ostream & operator<<(std::ostream &_out, const Condition &_condition)
size_t & rValuation() const
const carl::PointerSet< Condition > & originalConditions() const
bool operator<(const Condition &) const
Checks if the given condition (right hand side) is greater than this condition (left hand side).
bool operator==(const Condition &) const
Checks the equality of a given condition (right hand side) with this condition (left hand side).
Condition(const smtrat::ConstraintT &, size_t _id, size_t=0, bool=false, const carl::PointerSet< Condition > &=carl::PointerSet< Condition >(), bool=false)
Class to create the formulas for axioms.
carl::Constraint< Poly > ConstraintT