|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use CspSetVariable | |
jopt.csp | |
jopt.csp.search | The interfaces to all your searching needs. |
jopt.csp.solution | Defines structures for storing solutions to constraint satisfaction problems |
jopt.csp.variable | The interfaces for building, combining, and constraining variables and expressions |
Uses of CspSetVariable in jopt.csp |
Methods in jopt.csp with parameters of type CspSetVariable | |
boolean |
CspSolver.solve(CspSetVariable[] vars)
Resets the solver and locates a solution for an array of variables within the problem contained by the solver |
Uses of CspSetVariable in jopt.csp.search |
Methods in jopt.csp.search with parameters of type CspSetVariable | |
java.lang.Object |
SetSelector.select(CspSetVariable var)
|
SearchAction |
SearchActions.generate(CspSetVariable[] vars)
Creates an action that will instantiate an array of variables in order. |
SearchAction |
SearchActions.generate(CspSetVariable[] vars,
SetSelector selector)
Creates an action that will instantiate an array of variables in order. |
Uses of CspSetVariable in jopt.csp.solution |
Methods in jopt.csp.solution with parameters of type CspSetVariable | |
SetSolution |
SolverSolution.add(CspSetVariable var)
Adds a set variable solution |
SetSolution |
SolverSolution.getSolution(CspSetVariable var)
Returns a stored solution for a set variable |
java.util.Set |
SolverSolution.getPossibleSet(CspSetVariable var)
Returns the set of possible values for the variable |
java.util.Set |
SolverSolution.getRequiredSet(CspSetVariable var)
Returns the set of required values for the variable |
void |
SolverSolution.setPossibleSet(CspSetVariable var,
java.util.Set possibleSet)
Sets the set of possible values for the variable |
void |
SolverSolution.setRequiredSet(CspSetVariable var,
java.util.Set requiredSet)
Sets the set of required values for the variable |
Constructors in jopt.csp.solution with parameters of type CspSetVariable | |
SetSolution(CspSetVariable var)
Initializes internal solution information for variable |
Uses of CspSetVariable in jopt.csp.variable |
Subinterfaces of CspSetVariable in jopt.csp.variable | |
interface |
CspIntSetVariable
Interface implemented by variables representing a set of integer values |
Methods in jopt.csp.variable with parameters of type CspSetVariable | |
CspConstraint |
CspSetConstraints.eqIntersection(CspSetVariable x,
CspSetVariable y,
CspSetVariable z)
Constraint representing intersection( X, Y ) = Z. |
CspConstraint |
CspSetConstraints.eqIntersection(CspSetVariable[] sources,
CspSetVariable target)
Constraint representing intersection( sources ) = target. |
CspConstraint |
CspSetConstraints.eqPartition(CspSetVariable x,
CspSetVariable y,
CspSetVariable z)
Constraint representing partition( X, Y ) = Z. |
CspConstraint |
CspSetConstraints.eqPartition(CspSetVariable[] sources,
CspSetVariable target)
Constraint representing partition( sources ) = target. |
CspConstraint |
CspSetConstraints.eqPartition(CspSetVariable x,
CspSetVariable y,
CspSetVariable z,
boolean advancedFilter)
Constraint representing partition( X, Y ) = Z that has more advanced filtering than the normal eqPartition constraint
Advanced filtering will reduce domains more than normal but takes longer to run. |
CspConstraint |
CspSetConstraints.eqPartition(CspSetVariable[] sources,
CspSetVariable target,
boolean advancedFilter)
Constraint representing partition( X, Y ) = Z that has more advanced filtering than the normal eqPartition constraint . |
CspConstraint |
CspSetConstraints.eqUnion(CspSetVariable x,
CspSetVariable y,
CspSetVariable z)
Creates new union constraint representing union( X, Y ) = Z |
CspConstraint |
CspSetConstraints.eqUnion(CspSetVariable[] sources,
CspSetVariable target)
Creates new union constraint representing union( sources ) = target |
CspConstraint |
CspSetConstraints.eqUnion(CspSetVariable x,
CspSetVariable y,
CspSetVariable z,
CspSetVariable intersect)
Creates new union constraint that can utilize a variable that is the intersection of X and Y variables to further reduce the target Z than the normal eqUnion constraint . |
CspConstraint |
CspSetConstraints.eqUnion(CspSetVariable[] sources,
CspSetVariable target,
boolean advancedFilter)
Creates new union constraint that will filter the domains more than the normal eqUnion constraint , but will
take longer to run. |
CspConstraint |
CspSetConstraints.nullIntersection(CspSetVariable[] sources)
Creates new constraint representing null-intersection( sources ) |
CspConstraint |
CspSetConstraints.nullIntersection(CspSetVariable a,
CspSetVariable b)
Creates new constraint representing null-intersection( A, B ) |
CspConstraint |
CspSetConstraints.nullIntersection(CspSetVariable a,
java.util.Set constb)
Creates new constraint representing null-intersection( A, b ) |
CspConstraint |
CspSetConstraints.nullIntersection(java.util.Set consta,
CspSetVariable b)
Creates new constraint representing null-intersection( a, B ) |
CspConstraint |
CspSetConstraints.eqSubset(CspSetVariable a,
CspSetVariable b)
Creates new constraint representing B is a subset of A |
CspConstraint |
CspSetConstraints.eqSubset(java.util.Set a,
CspSetVariable b)
Creates new constraint representing B is a subset of a |
CspConstraint |
CspSetConstraints.eqSubset(CspSetVariable a,
java.util.Set b)
Creates new constraint representing b is a subset of A |
CspConstraint |
CspSetConstraints.strictSubset(CspSetVariable a,
CspSetVariable b)
Creates new constraint representing B is a strict subset of A |
CspConstraint |
CspSetConstraints.strictSubset(java.util.Set a,
CspSetVariable b)
Creates new constraint representing B is a strict subset of a |
CspConstraint |
CspSetConstraints.strictSubset(CspSetVariable a,
java.util.Set b)
Creates new constraint representing b is a strict subset of A |
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |