public class BiReExpression extends Object implements ReExpression
Project: choco-solver.
ReExpression.OperatorNO_CHILD| Constructor and Description |
|---|
BiReExpression(ReExpression.Operator op,
ArExpression e1,
ArExpression e2)
Builds a binary expression
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
beval(int[] values,
Map<IntVar,Integer> map) |
BoolVar |
boolVar() |
Constraint |
decompose() |
void |
extractVar(HashSet<IntVar> variables)
Extract the variables from this expression
|
Model |
getModel()
Return the associated model
|
String |
toString() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitand, extension, ieval, iff, ift, ift, ift, ift, imp, intVar, not, or, post, xorabs, add, add, add, dist, dist, div, div, eq, eq, eq, ge, ge, getExpressionChild, getNoChild, gt, gt, isExpressionLeaf, le, le, lt, lt, max, max, max, min, min, min, mod, mod, mul, mul, mul, ne, ne, neg, pow, pow, sqr, sub, subpublic BiReExpression(ReExpression.Operator op, ArExpression e1, ArExpression e2)
op - an operatore1 - an expressione2 - an expressionpublic Model getModel()
ReExpressiongetModel in interface ArExpressiongetModel in interface ReExpressionpublic BoolVar boolVar()
boolVar in interface ReExpressionBoolVar.
If necessary, it creates intermediary variable and posts intermediary constraintspublic void extractVar(HashSet<IntVar> variables)
ReExpressionextractVar in interface ArExpressionextractVar in interface ReExpressionvariables - set of variablespublic Constraint decompose()
decompose in interface ReExpressionpublic boolean beval(int[] values,
Map<IntVar,Integer> map)
beval in interface ReExpressionvalues - int values to evaluatemap - mapping between variables of the topmost expression and position in valuesCopyright © 2018. All rights reserved.