public class LinearFloat extends Linear
eq, ge, gt, le, list, lt, ne, relationType, sum, weights, xmlAttributesnotConsistencyPruningEventsatomicExecution, consistencyPruningEvents, earlyTerminationOK, id, increaseWeight, numberArgs, numberId, tracequeueIndex| Constructor and Description |
|---|
LinearFloat(Store store,
ArrayList<? extends FloatVar> variables,
ArrayList<Double> weights,
String rel,
double sum)
It constructs the constraint LinearFloat.
|
LinearFloat(Store store,
FloatVar[] list,
double[] weights,
String rel,
double sum) |
| Modifier and Type | Method and Description |
|---|---|
FloatVar |
derivative(Store store,
FloatVar f,
Set<FloatVar> vars,
FloatVar x) |
void |
queueVariable(int level,
Var var)
This is a function called to indicate which variable in a scope of
constraint has changed.
|
arguments, consistency, getConsistencyPruningEvent, getNestedPruningEvent, getNotConsistencyPruningEvent, impose, increaseWeight, notConsistency, notSatisfied, rel2String, relation, removeConstraint, satisfied, toStringinclude, setNotConsistencyPruningEventcleanAfterFailure, decompose, getGuideConstraint, getGuideValue, getGuideVariable, id, impose, imposeDecomposition, numberArgs, removeLevel, removeLevelLate, requiresMonotonicity, setConsistencyPruningEvent, supplyGuideFeedbackauxiliaryVariables, imposeDecompositionpublic LinearFloat(Store store, FloatVar[] list, double[] weights, String rel, double sum)
list - weights - sum - public LinearFloat(Store store, ArrayList<? extends FloatVar> variables, ArrayList<Double> weights, String rel, double sum)
variables - variables which are being multiplied by weights.weights - weight for each variable.sum - variable containing the sum of weighted variables.public void queueVariable(int level,
Var var)
ConstraintqueueVariable in class Linearlevel - the level of the store at which the change has occurred.var - variable which has changed.public FloatVar derivative(Store store, FloatVar f, Set<FloatVar> vars, FloatVar x)
derivative in class DecomposedConstraintCopyright © 2016. All rights reserved.