Uses of Interface
javax.constraints.Solution

Packages that use Solution

javax.constraints	This package describes a generic Java programming interface for Constraint Programming (CP API) - see www.jcp.org .
javax.constraints.impl.search
javax.constraints.impl.search.goal

Uses of Solution in javax.constraints

Methods in javax.constraints that return Solution

Solution[]	Solver.findAllSolutions() This method attempts to find all solutions for the Problem.
Solution	Solver.findOptimalSolution(Objective objective, Var objectiveVar) This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar,OptimizationStrategy.NATIVE) It is usually overridden by an implementation
Solution	Solver.findOptimalSolution(Objective objective, Var objectiveVar, OptimizationStrategy optStrategy) This method attempts to find the solution that minimizes/maximizes the objective variable.
Solution	Solver.findOptimalSolution(Var objectiveVar) This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar)
Solution	Solver.findSolution() This method is equivalent to findSolution(DO_NOT_RESTORE); It means that the problem state will always be restored even when a solution is found.
Solution	Solver.findSolution(ProblemState restoreOrNot) This method attempts to find a solution of the problem, for which the solver was defined.
Solution	Solver.getSolution(int i) Returns the i-th Solution found by the latest search
Solution	SolutionIterator.next() Returns the next solution

Uses of Solution in javax.constraints.impl.search

Classes in javax.constraints.impl.search that implement Solution

class

BasicSolution

Methods in javax.constraints.impl.search that return Solution

Solution[]	AbstractSolver.findAllSolutions() This method attempts to find all solutions for the Problem.
Solution	AbstractSolver.findOptimalSolution(Objective objective, Var objectiveVar) This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar,OptimizationStrategy.NATIVE) It is usually overridden by an implementation.
Solution	AbstractSolver.findOptimalSolution(Objective objective, Var objectiveVar, OptimizationStrategy optStrategy) This method attempts to find the solution that minimizes/maximizes the objective variable.
Solution	AbstractSolver.findOptimalSolution(Var objectiveVar) This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar)
Solution	AbstractSolver.findOptimalSolutionBasic(Objective objective, Var objectiveVar) This method is similar to findOptimalSolution(Objective objective, Var objectiveVar) but uses the common (no solver-specific) implementation
Solution	AbstractSolver.findOptimalSolutionDichotomize(Objective objective, Var objectiveVar) The actual minimization algorithm executes a dichotomized search.
Solution	AbstractSolver.findOptimalSolutionDichotomize(Var objectiveVar) This method is equivalent to findOptimalSolutionCommon(Objective.MINIMIZE,objectiveVar)
Solution	AbstractSolver.findSolution() This method is equivalent to findSolution(DO_NOT_RESTORE); It means that the problem state will always be restored even when a solution is found.
abstract Solution	AbstractSolver.findSolution(ProblemState restoreOrNot) This method attempts to find a solution of the problem, for which the solver was defined.
Solution	AbstractSolver.getSolution() Returns the first (or only) solution
Solution	AbstractSolver.getSolution(int i) Returns the i-th Solution
Solution[]	AbstractSolver.getSolutions() Returns an array of Solutions, containing all found solutions.
Solution	BasicSolutionIterator.next()

Methods in javax.constraints.impl.search with parameters of type Solution

void	AbstractSolver.addSolution(Solution solution) Adds a solution to the current array of solutions
abstract boolean	AbstractSolver.applySolution(Solution solution) This method tries to resolve the problem by applying the Solution "solution" to the problem, and returns true if "solution" satisfies all of the posted constraints, false otherwise.

Uses of Solution in javax.constraints.impl.search.goal

Methods in javax.constraints.impl.search.goal that return Solution

Solution	Dichotomize.execute() The actual minimization algorithm executes a dichotomized search.
Solution[]	SolverWithGoals.findAllSolutions() This method attempts to find all solutions for the Problem.
Solution	SolverWithGoals.findOptimalSolutionDichotomize(Objective objective, Var objectiveVar) The actual minimization algorithm executes a dichotomized search.
Solution	SolverWithGoals.findSolution(ProblemState restoreOrNot) This method attempts to find a solution of the problem, for which the solver was defined.

Methods in javax.constraints.impl.search.goal with parameters of type Solution

boolean

SolverWithGoals.applySolution(Solution solution) This method tries to resolve the problem by applying the Solution "solution" to the problem, and returns true if "solution" satisfies all of the posted constraints, false otherwise.

Constructors in javax.constraints.impl.search.goal with parameters of type Solution

GoalApplySolution(Solution solution)

GoalLogSolution(Solution solution)