Boolean expressions
[Direct modeling support]
Functions | |
BoolExpr | Gecode::operator! (const BoolExpr &) |
Negated Boolean expression. | |
BoolExpr | Gecode::operator&& (const BoolExpr &, const BoolExpr &) |
Conjunction of Boolean expressions. | |
BoolExpr | Gecode::operator|| (const BoolExpr &, const BoolExpr &) |
Disjunction of Boolean expressions. | |
BoolExpr | Gecode::operator^ (const BoolExpr &, const BoolExpr &) |
Exclusive-or of Boolean expressions. | |
BoolExpr | Gecode::operator!= (const BoolExpr &, const BoolExpr &) |
Non-equivalence of Boolean expressions. | |
BoolExpr | Gecode::operator== (const BoolExpr &, const BoolExpr &) |
Equivalence of Boolean expressions. | |
BoolExpr | Gecode::operator>> (const BoolExpr &, const BoolExpr &) |
Implication of Boolean expressions. | |
BoolExpr | Gecode::operator<< (const BoolExpr &, const BoolExpr &) |
Reverse implication of Boolean expressions. |
Detailed Description
Boolean expressions can be freely composed of variables with the usual connectives and reified linear expressions.
Function Documentation
BoolExpr Gecode::operator! | ( | const BoolExpr & | e | ) |
Negated Boolean expression.
BoolExpr Gecode::operator&& | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Conjunction of Boolean expressions.
BoolExpr Gecode::operator|| | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Disjunction of Boolean expressions.
BoolExpr Gecode::operator^ | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Exclusive-or of Boolean expressions.
BoolExpr Gecode::operator!= | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Non-equivalence of Boolean expressions.
BoolExpr Gecode::operator== | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Equivalence of Boolean expressions.
BoolExpr Gecode::operator>> | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Implication of Boolean expressions.
BoolExpr Gecode::operator<< | ( | const BoolExpr & | l, | |
const BoolExpr & | r | |||
) |
Reverse implication of Boolean expressions.