|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use IntExp | |
---|---|
choco.cp.solver | |
choco.cp.solver.variables.integer | |
choco.kernel.solver | |
choco.kernel.solver.variables.integer | A package devoted to the management of variables and domains for integers |
samples.tutorials.lns.lns |
Uses of IntExp in choco.cp.solver |
---|
Methods in choco.cp.solver that return IntExp | |
---|---|
static IntExp |
CPSolver.minus(IntExp t,
int c)
|
static IntExp |
CPSolver.minus(IntExp v1,
IntExp v2)
Subtracting two terms one from another |
static IntExp |
CPSolver.minus(int c,
IntExp t)
|
static IntExp |
CPSolver.mult(int a,
IntExp x)
Creates a simple linear term from one coefficient and one variable |
protected static IntExp |
CPSolver.plus(int[] coeffs1,
IntVar[] vars1,
int cste1,
int[] coeffs2,
IntVar[] vars2,
int cste2)
Utility method for constructing a term from two lists of variables, list of coeffcicients and constants |
IntExp |
CPSolver.plus(IntExp t,
int c)
|
IntExp |
CPSolver.plus(IntExp v1,
IntExp v2)
Adding two terms one to another |
IntExp |
CPSolver.plus(int c,
IntExp t1)
|
IntExp |
CPSolver.scalar(int[] lc,
IntDomainVar[] lv)
Building a term from a scalar product of coefficients and variables |
IntExp |
CPSolver.scalar(IntDomainVar[] lv,
int[] lc)
Building a term from a scalar product of coefficients and variables |
IntExp |
CPSolver.sum(IntExp... lv)
Building a term from a sum of integer expressions |
static IntExp |
CPSolver.sum(IntVar... lv)
Building a term from a sum of integer variables |
Methods in choco.cp.solver with parameters of type IntExp | |
---|---|
SConstraint |
CPSolver.eq(IntExp x,
int c)
|
SConstraint |
CPSolver.eq(IntExp x,
IntExp y)
|
SConstraint |
CPSolver.eq(int c,
IntExp x)
|
SConstraint |
CPSolver.geq(IntExp x,
int c)
Creates a constraint by stating that a term is greater or equal than a constant |
SConstraint |
CPSolver.geq(IntExp x,
IntExp y)
|
SConstraint |
CPSolver.geq(int c,
IntExp x)
|
SConstraint |
CPSolver.gt(IntExp x,
int c)
|
SConstraint |
CPSolver.gt(IntExp x,
IntExp y)
|
SConstraint |
CPSolver.gt(int c,
IntExp x)
|
SConstraint |
CPSolver.leq(IntExp v1,
int v2)
|
SConstraint |
CPSolver.leq(IntExp v1,
IntExp v2)
|
SConstraint |
CPSolver.leq(int v1,
IntExp v2)
|
SConstraint |
CPSolver.lt(IntExp v1,
int v2)
|
SConstraint |
CPSolver.lt(IntExp v1,
IntExp v2)
|
SConstraint |
CPSolver.lt(int v1,
IntExp v2)
|
static IntExp |
CPSolver.minus(IntExp t,
int c)
|
static IntExp |
CPSolver.minus(IntExp v1,
IntExp v2)
Subtracting two terms one from another |
static IntExp |
CPSolver.minus(int c,
IntExp t)
|
static IntExp |
CPSolver.mult(int a,
IntExp x)
Creates a simple linear term from one coefficient and one variable |
SConstraint |
CPSolver.neq(IntExp x,
int c)
Creates a constraint by stating that a term is not equal than a constant |
SConstraint |
CPSolver.neq(IntExp x,
IntExp y)
|
SConstraint |
CPSolver.neq(int c,
IntExp x)
|
IntExp |
CPSolver.plus(IntExp t,
int c)
|
IntExp |
CPSolver.plus(IntExp v1,
IntExp v2)
Adding two terms one to another |
IntExp |
CPSolver.plus(int c,
IntExp t1)
|
IntExp |
CPSolver.sum(IntExp... lv)
Building a term from a sum of integer expressions |
Uses of IntExp in choco.cp.solver.variables.integer |
---|
Classes in choco.cp.solver.variables.integer that implement IntExp | |
---|---|
class |
AbstractBijectiveVar
|
class |
BooleanVarImpl<C extends AbstractSConstraint & IntPropagator>
A variable implementation dedicated to boolean domains |
class |
BoolVarNot
A bijective boolean variable B : B = not(A) |
class |
IntDomainVarAddCste
Declare a variable Y, based on a variable X and a constante c, such as Y = X + c |
class |
IntDomainVarImpl<C extends AbstractSConstraint & IntPropagator>
Implements search valued domain variables. |
class |
IntDomainVarTimePosCste
Declare a variable Y, based on a variable X and a constante c, such as Y = X * c |
class |
IntTerm
Implements linear terms: Sigma_i(a_i*X_i), where a_i are search coefficients, and X_i are search domain variable |
class |
ViewIntDomainVarImpl
|
Uses of IntExp in choco.kernel.solver |
---|
Methods in choco.kernel.solver that return IntExp | |
---|---|
IntExp |
Solver.plus(IntExp v1,
int v2)
|
IntExp |
Solver.plus(IntExp v1,
IntExp v2)
|
IntExp |
Solver.plus(int v1,
IntExp v2)
|
IntExp |
Solver.scalar(int[] lc,
IntDomainVar[] lv)
|
IntExp |
Solver.scalar(IntDomainVar[] lv,
int[] lc)
|
IntExp |
Solver.sum(IntExp... lv)
|
Methods in choco.kernel.solver with parameters of type IntExp | |
---|---|
SConstraint |
Solver.eq(IntExp x,
int c)
|
SConstraint |
Solver.eq(IntExp x,
IntExp y)
|
SConstraint |
Solver.eq(int c,
IntExp x)
|
SConstraint |
Solver.geq(IntExp x,
int c)
|
SConstraint |
Solver.geq(IntExp x,
IntExp y)
|
SConstraint |
Solver.geq(int c,
IntExp x)
|
SConstraint |
Solver.gt(IntExp x,
int c)
|
SConstraint |
Solver.gt(IntExp x,
IntExp y)
|
SConstraint |
Solver.gt(int c,
IntExp x)
|
SConstraint |
Solver.leq(IntExp x,
int c)
|
SConstraint |
Solver.leq(IntExp x,
IntExp y)
|
SConstraint |
Solver.leq(int c,
IntExp x)
|
SConstraint |
Solver.lt(IntExp x,
int c)
|
SConstraint |
Solver.lt(IntExp x,
IntExp y)
|
SConstraint |
Solver.lt(int c,
IntExp x)
|
SConstraint |
Solver.neq(IntExp x,
int c)
|
SConstraint |
Solver.neq(IntExp x,
IntExp y)
|
SConstraint |
Solver.neq(int c,
IntExp x)
|
IntExp |
Solver.plus(IntExp v1,
int v2)
|
IntExp |
Solver.plus(IntExp v1,
IntExp v2)
|
IntExp |
Solver.plus(int v1,
IntExp v2)
|
IntExp |
Solver.sum(IntExp... lv)
|
Uses of IntExp in choco.kernel.solver.variables.integer |
---|
Subinterfaces of IntExp in choco.kernel.solver.variables.integer | |
---|---|
interface |
IntDomainVar
An interface for all implementations of search valued domain variables |
interface |
IntVar
|
Uses of IntExp in samples.tutorials.lns.lns |
---|
Methods in samples.tutorials.lns.lns that return IntExp | |
---|---|
IntExp |
AbstractLNSSolver.plus(IntExp v1,
int v2)
Deprecated. |
IntExp |
AbstractLNSSolver.plus(IntExp v1,
IntExp v2)
Deprecated. |
IntExp |
AbstractLNSSolver.plus(int v1,
IntExp v2)
Deprecated. |
IntExp |
AbstractLNSSolver.scalar(int[] lc,
IntDomainVar[] lv)
Deprecated. |
IntExp |
AbstractLNSSolver.scalar(IntDomainVar[] lv,
int[] lc)
Deprecated. |
IntExp |
AbstractLNSSolver.sum(IntExp... lv)
Deprecated. |
Methods in samples.tutorials.lns.lns with parameters of type IntExp | |
---|---|
SConstraint |
AbstractLNSSolver.eq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.eq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.eq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.geq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.geq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.geq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.gt(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.gt(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.gt(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.leq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.leq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.leq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.lt(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.lt(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.lt(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.neq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.neq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.neq(int c,
IntExp x)
Deprecated. |
IntExp |
AbstractLNSSolver.plus(IntExp v1,
int v2)
Deprecated. |
IntExp |
AbstractLNSSolver.plus(IntExp v1,
IntExp v2)
Deprecated. |
IntExp |
AbstractLNSSolver.plus(int v1,
IntExp v2)
Deprecated. |
IntExp |
AbstractLNSSolver.sum(IntExp... lv)
Deprecated. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |