Uses of Interface
jopt.csp.search.SearchAction

Packages that use SearchAction

jopt.csp
jopt.csp.search	The interfaces to all your searching needs.

Uses of SearchAction in jopt.csp

Methods in jopt.csp with parameters of type SearchAction

abstract boolean	CspSolver.solve(SearchAction action, SearchGoal goal, SearchTechnique technique, boolean continuallyImprove, boolean reset) Locates a solution for the current problem.
boolean	CspSolver.solve(SearchAction action, SearchGoal goal, SearchTechnique technique, boolean continuallyImprove) Resets the solver and locates a solution for the current problem.
boolean	CspSolver.solve(SearchAction action, SearchGoal goal, SearchTechnique technique) Resets the solver and locates a solution.
boolean	CspSolver.solve(SearchAction action, SearchTechnique technique) Resets the solver and locates a solution.
boolean	CspSolver.solve(SearchAction action, SearchTechnique technique, boolean reset) Locates a solution for the current problem.
boolean	CspSolver.solve(SearchAction action, SearchGoal goal, boolean continuallyImprove) Resets the solver and locates a solution for the current problem given a search action that defines a set of operations that should be performed in order to locate a solution.
boolean	CspSolver.solve(SearchAction action, SearchGoal goal) Resets the solver and locates a solution for the current problem given a search action that defines a set of operations that should be performed in order to locate a solution.
boolean	CspSolver.solve(SearchAction action) Resets the solver and locates a solution for the current problem given a search action that defines a set of operations that should be performed in order to locate a solution.
boolean	CspSolver.solve(SearchAction action, boolean reset) Locates a solution for the current problem given a search action that defines a set of operations that should be searched in order to locate a solution.

Uses of SearchAction in jopt.csp.search

Methods in jopt.csp.search that return SearchAction

SearchAction	SearchTechniques.changeSearch(SearchTechnique technique, SearchAction action) Special action that changes the search technique being used at this point in the search tree
SearchAction	SearchTechniques.changeSearch(SearchGoal goal, SearchAction action) Special action that changes the goal being used at this point in the search tree
SearchAction	SearchTechniques.changeSearch(SearchGoal goal, SearchTechnique technique, SearchAction action) Special action that changes the goal and search technique being used at this point in the search tree
SearchAction	SearchLimits.limitSearch(SearchLimit limit, SearchAction action) Special action that applies a limit to the search technique being used at this point in the search tree
SearchAction	SearchActions.generate(CspIntVariable[] vars) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspIntVariable[] vars, IntegerSelector selector) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspLongVariable[] vars) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspLongVariable[] vars, LongSelector selector) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspFloatVariable[] vars, float precision) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspFloatVariable[] vars, float precision, boolean minFirst) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspDoubleVariable[] vars, double precision) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generate(CspDoubleVariable[] vars, double precision, boolean minFirst) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.generateNonBinary(CspIntVariable[] vars) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.splitGenerate(CspIntVariable[] vars) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.splitGenerate(CspIntVariable[] vars, boolean minFirst) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.splitGenerate(CspLongVariable[] vars) Creates an action that will instantiate an array of variables in order.
SearchAction	SearchActions.splitGenerate(CspLongVariable[] vars, boolean minFirst) Creates an action that will instantiate an array of variables in order.
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.
SearchAction	SearchActions.storeSolution(SolverSolution solution) Creates an action that will store all information for the current problem state in a solution that can be restored at a later date.
SearchAction	SearchActions.restoreSolution(SolverSolution solution) Action that will push all current changes onto the stack and restore another solution.
SearchAction	SearchActions.addConstraint(CspConstraint constraint) Adds a constraint during a search that can be undone as the search routine backtracks
SearchAction	SearchActions.choice(SearchAction action1, SearchAction action2) Creates a choice point between two different actions
SearchAction	SearchActions.choice(SearchAction[] actions) Creates a choice point between an array of actions
SearchAction	SearchActions.combine(SearchAction action1, SearchAction action2) Creates a new combined action
SearchAction	SearchActions.combine(SearchAction action1, SearchAction action2, SearchAction action3) Creates a new combined action
SearchAction	SearchActions.combine(SearchAction[] actions) Creates a new combined action
SearchAction	SearchAction.performAction() Executes this action and returns the next action to execute.
SearchAction	LocalSearch.browseNeighbors(SolverSolution initial, SolverSolution[] neighbors) This action will browse a list of neighboring solutions based on an initial solution.
SearchAction	LocalSearch.moveToNeighbor(SolverSolution initial, SolverSolution neighbor) Restores a neighboring solution to the solver
SearchAction	LocalSearch.browseNeighborhood(SolverSolution initial, Neighborhood hood, CurrentNeighbor current) This action will browse a list of neighbors produced from a Neighborhood and attempt to apply each in turn in order to locate other valid solutions to the problem.
SearchAction	LocalSearch.browseNeighborhood(SolverSolution initial, Neighborhood hood, Metaheuristic meta, CurrentNeighbor current) This action will browse a list of neighboring solutions with the guidance of a metaheuristic used to determine which solutions are acceptable.
SearchAction	LocalSearch.selectCurrentNeighbor(SolverSolution initial, CurrentNeighbor current) Advises neighborhoods that the current neighbor is about to be made the new initial solution.
SearchAction	LocalSearch.improve(SolverSolution solution, int step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.improve(SolverSolution solution, float step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.improve(SolverSolution solution, long step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.improve(SolverSolution solution, double step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta, SearchGoal goal) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood, SearchGoal goal) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta, SearchGoal goal, int numToCheck)
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta, int numToCheck)
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, SearchGoal goal, int numToCheck)
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, int numToCheck)

Methods in jopt.csp.search with parameters of type SearchAction

Search	SearchTechniques.search(SearchAction action) Creates a search object that can be used to search for a problem solution as an alternative to the solve methods in the CspSolver the uses a default DFS search technique
Search	SearchTechniques.search(SearchAction action, SearchTechnique technique) Creates a search object that can be used to search for a problem solution as an alternative to the solve methods in the CspSolver
SearchAction	SearchTechniques.changeSearch(SearchTechnique technique, SearchAction action) Special action that changes the search technique being used at this point in the search tree
SearchAction	SearchTechniques.changeSearch(SearchGoal goal, SearchAction action) Special action that changes the goal being used at this point in the search tree
SearchAction	SearchTechniques.changeSearch(SearchGoal goal, SearchTechnique technique, SearchAction action) Special action that changes the goal and search technique being used at this point in the search tree
SearchAction	SearchLimits.limitSearch(SearchLimit limit, SearchAction action) Special action that applies a limit to the search technique being used at this point in the search tree
SearchAction	SearchActions.choice(SearchAction action1, SearchAction action2) Creates a choice point between two different actions
SearchAction	SearchActions.choice(SearchAction[] actions) Creates a choice point between an array of actions
SearchAction	SearchActions.combine(SearchAction action1, SearchAction action2) Creates a new combined action
SearchAction	SearchActions.combine(SearchAction action1, SearchAction action2, SearchAction action3) Creates a new combined action
SearchAction	SearchActions.combine(SearchAction[] actions) Creates a new combined action