22 template<
typename PolType,
bool AS,
typename InIt,
typename InsertIt>
30 for(
auto it = start; it != end; ++it)
32 if(it->isTrivialTrue())
36 else if(it->isTrivialFalse())
40 else if(it->lhs().denominator().is_one())
42 out = PCon(it->lhs().nominator(), it->rel());
46 assert(!it->lhs().denominator().is_constant());
47 out = PCon(it->lhs().nominator(),
inverse(it->rel()));
48 out = PCon(it->lhs().nominator() * it->lhs().denominator(), it->rel());
carl is the main namespace for the library.
Relation inverse(Relation r)
Inverts the given relation symbol.
void toPolynomialConstraints(InIt start, InIt end, InsertIt out)
Converts Constraint<RationalFunction<Poly>> to Constraint<Poly>
Represent a polynomial (in)equality against zero.