|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public MapAgent(map Map, search SearchForActions<String,MoveToAction>, goal String) in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public SimpleMapAgent(map Map, search SearchForActions<String,MoveToAction>, goals String[]) in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private rbfs(p Problem<S,A>, node Node<S,A>, node_f double, fLimit double, recursiveDepth int) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type s : Object to s : S in method private lrtaCost(s S, action A, sDelta S) : double in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type node : ExtendedNode to node : ExtendedNode<S,A> in method private getCorrespondingNodeFromOtherProblem(node ExtendedNode<S,A>) : ExtendedNode<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type queue : Queue<Node> to queue : Queue<Node<S,A>> in method protected QueueBasedSearch(impl QueueSearch<S,A>, queue Queue<Node<S,A>>) in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Parameter Type ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in method public OnlineDFSAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>) in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method protected QueueBasedSearch(impl QueueSearch<S,A>, queue Queue<Node<S,A>>) in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method public UniformCostSearch(impl QueueSearch<S,A>) in class aima.core.search.uninformed.UniformCostSearch |
From |
To |
|
Change Parameter Type n : Node to n : Node<S,A> in method private getValue(n Node<S,A>) : double in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method private expandNode(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public MapAgent(map Map, search SearchForActions<String,MoveToAction>, goals List<String>) in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<String,MoveToAction> in method protected search(problem Problem<String,MoveToAction>) : List<MoveToAction> in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.BestFirstSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public SimpleMapAgent(map Map, notifier EnvironmentViewNotifier, search SearchForActions<String,MoveToAction>) in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Parameter Type resultsFunction : ResultsFunction to resultsFn : ResultsFunction<S,A> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method public getSequenceOfActions(node Node<S,A>) : List<A> in class aima.core.search.framework.SearchUtils |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type state : Object to state : S in method public createRootNode(state S) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type actions : List<Action> to actions : List<A> in method public isFailure(actions List<A>) : boolean in class aima.core.search.framework.SearchUtils |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Parameter Type problem : OnlineSearchProblem to problem : OnlineSearchProblem<S,A> in method public LRTAStarAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>, h ToDoubleFunction<S>) in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type action : Action to action : A in method public createNode(state S, parent Node<S,A>, action A, stepCost double) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.framework.SearchForStates |
From |
To |
|
Change Parameter Type actions : List<Action> to actions : List<QueenAction> in method private assertCorrectPlacement(actions List<QueenAction>) : void in class aima.test.core.unit.search.uninformed.IterativeDeepeningSearchTest |
From |
To |
|
Change Parameter Type problem : OnlineSearchProblem to problem : OnlineSearchProblem<S,A> in method public setProblem(problem OnlineSearchProblem<S,A>) : void in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method public GreedyBestFirstSearch(impl QueueSearch<S,A>, h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.GreedyBestFirstSearch |
From |
To |
|
Change Parameter Type ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in method public LRTAStarAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>, h ToDoubleFunction<S>) in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.framework.SearchForActions |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public MapAgent(map Map, search SearchForActions<String,MoveToAction>, goal String, notifier EnvironmentViewNotifier) in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public IterativeDeepeningSearch(nodeExpander NodeExpander<S,A>) in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type state : Object to state : S in method public Node(state S, parent Node<S,A>, action A, pathCost double) in class aima.core.search.framework.Node |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public BidirectionalSearch(nodeExpander NodeExpander<S,A>) in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type goalTest : GoalTest to goalTest : GoalTest<S> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public DepthLimitedSearch(limit int, nodeExpander NodeExpander<S,A>) in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method public AStarSearch(impl QueueSearch<S,A>, h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.AStarSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.framework.SearchForActions |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public GraphSearchReducedFrontier(nodeExpander NodeExpander<S,A>) in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>, nodeExpander NodeExpander<S,A>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type state : Object to state : S in method public createNode(state S, parent Node<S,A>, action A, stepCost double) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type goalTest : GoalTest to goalTest : GoalTest<Individual<A>> in method public geneticAlgorithm(initPopulation Collection<Individual<A>>, fitnessFn FitnessFunction<A>, goalTest GoalTest<Individual<A>>, maxTimeMilliseconds long) : Individual<A> in class aima.core.search.local.GeneticAlgorithm |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public EvalFunction(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.GreedyBestFirstSearch.EvalFunction |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type initialState : Object to initialState : S in method public GeneralProblem(initialState S, actionsFn ActionsFunction<S,A>, resultFn ResultFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.framework.problem.GeneralProblem |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Parameter Type ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>, avoidLoops boolean) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public SimpleMapAgent(map Map, notifier EnvironmentViewNotifier, search SearchForActions<String,MoveToAction>, maxGoalsToFormulate int) in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.framework.SearchForActions |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected notifyNodeListeners(node Node<S,A>) : void in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type stepCostFunction : StepCostFunction to stepCostFn : StepCostFunction<S,A> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public MapAgent(map Map, search SearchForActions<String,MoveToAction>, goals List<String>, notifier EnvironmentViewNotifier) in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type orgP : Problem to orgP : Problem<S,A> in method private getReverseAction(orgP Problem<S,A>, node Node<S,A>) : A in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type goal : Object to goal : String in method private modifyHeuristicFunction(goal String) : void in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to ptsFn : Function<Percept,S> in method public setPerceptToStateFunction(ptsFn Function<Percept,S>) : void in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private recursiveDLS(node Node<S,A>, problem Problem<S,A>, limit int) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type problem : NondeterministicProblem to problem : NondeterministicProblem<S,A> in method public orSearch(state S, problem NondeterministicProblem<S,A>, path Path) : Plan in class aima.core.search.nondeterministic.AndOrSearch |
From |
To |
|
Change Parameter Type state : Object to state : S in method public orSearch(state S, problem NondeterministicProblem<S,A>, path Path) : Plan in class aima.core.search.nondeterministic.AndOrSearch |
From |
To |
|
Change Parameter Type state : Object to state : S in method public Node(state S) in class aima.core.search.framework.Node |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type action : Action to action : A in method public Node(state S, parent Node<S,A>, action A, pathCost double) in class aima.core.search.framework.Node |
From |
To |
|
Change Parameter Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Parameter Type ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public BestFirstSearch(impl QueueSearch<S,A>, evalFn ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.BestFirstSearch |
From |
To |
|
Change Parameter Type initialState : Object to initialState : S in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<MapNode,OsmMoveAction>> in method protected createSearch(h ToDoubleFunction<Node<MapNode,OsmMoveAction>>, taskSelection int) : SearchForActions<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Parameter Type actions : List<Action> to actions : List<QueenAction> in method private assertCorrectPlacement(actions List<QueenAction>) : void in class aima.test.core.unit.search.uninformed.BreadthFirstSearchTest |
From |
To |
|
Change Parameter Type goalTest : GoalTest to goalTest : GoalTest<S> in method public GeneralProblem(initialState S, actionsFn ActionsFunction<S,A>, resultFn ResultFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.framework.problem.GeneralProblem |
From |
To |
|
Change Parameter Type n : Node to n : Node<S,A> in method private getValue(n Node<S,A>) : double in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type actions : List<Action> to actions : List<QueenAction> in method private assertCorrectPlacement(actions List<QueenAction>) : void in class aima.test.core.unit.search.uninformed.DepthFirstSearchTest |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type parent : Node to parent : Node<S,A> in method public Node(state S, parent Node<S,A>, action A, pathCost double) in class aima.core.search.framework.Node |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler, nodeExpander NodeExpander<S,A>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method private recursiveDLS(node Node<S,A>, problem Problem<S,A>, limit int) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type hfFactory : HeuristicFunctionFactory to hfFactory : HeuristicFunctionFactory<String,MoveToAction> in method public MapAgent(map Map, search SearchForActions<String,MoveToAction>, goals List<String>, notifier EnvironmentViewNotifier, hfFactory HeuristicFunctionFactory<String,MoveToAction>) in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type solutionNode : Node to solutionNode : Node<S,A> in method private getResult(currNode Node<S,A>, solutionNode Node<S,A>, fCostLimit double) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Parameter Type state : Object to state : VacuumEnvironmentState in method public results(state VacuumEnvironmentState, action Action) : Set<VacuumEnvironmentState> in class aima.core.environment.vacuum.VacuumWorldResults |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type pTracer : ProgressTracer<A> to pTracer : ProgressTracker<A> in method public addProgressTracer(pTracer ProgressTracker<A>) : void in class aima.core.search.local.GeneticAlgorithm |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.framework.SearchForStates |
From |
To |
|
Change Parameter Type action : Action to action : A in method private lrtaCost(s S, action A, sDelta S) : double in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public createSearch(strategy int, qSearchImpl int, h ToDoubleFunction<Node<S,A>>) : SearchForActions<S,A> in class aima.gui.util.SearchFactory |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method public DepthFirstSearch(impl QueueSearch<S,A>) in class aima.core.search.uninformed.DepthFirstSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method private findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.framework.SearchForStates |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private getReverseAction(orgP Problem<S,A>, node Node<S,A>) : A in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type actions : List<Action> to actions : List<QueenAction> in method private assertCorrectPlacement(actions List<QueenAction>) : void in class aima.test.core.unit.search.uninformed.DepthLimitedSearchTest |
From |
To |
|
Change Parameter Type solutionNode : Node to solutionNode : Node<S,A> in method public SearchResult(solutionNode Node<S,A>, fCostLimit double) in class aima.core.search.informed.RecursiveBestFirstSearch.SearchResult |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public EvalFunction(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.AStarSearch.EvalFunction |
From |
To |
|
Change Parameter Type currNode : Node to currNode : Node<S,A> in method private getResult(currNode Node<S,A>, solutionNode Node<S,A>, fCostLimit double) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method public BestFirstSearch(impl QueueSearch<S,A>, evalFn ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.BestFirstSearch |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.TreeSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public AStarSearch(impl QueueSearch<S,A>, h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.AStarSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public TreeSearch(nodeExpander NodeExpander<S,A>) in class aima.core.search.framework.qsearch.TreeSearch |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private isExplored(node Node<S,A>) : boolean in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>, avoidLoops boolean, nodeExpander NodeExpander<S,A>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type impl : QueueSearch to impl : QueueSearch<S,A> in method public BreadthFirstSearch(impl QueueSearch<S,A>) in class aima.core.search.uninformed.BreadthFirstSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public SearchAgent(p Problem<S,A>, search SearchForActions<S,A>) in class aima.core.search.framework.SearchAgent |
From |
To |
|
Change Parameter Type state : Object to state : S in method public testGoal(state S) : boolean in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Parameter Type orgP : Problem to orgP : Problem<S,A> in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Parameter Type problem : OnlineSearchProblem to problem : OnlineSearchProblem<S,A> in method public setProblem(problem OnlineSearchProblem<S,A>) : void in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Parameter Type actionsFunction : ActionsFunction to actionsFn : ActionsFunction<S,A> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public GraphSearch(nodeExpander NodeExpander<S,A>) in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.Informed |
From |
To |
|
Change Parameter Type problem : OnlineSearchProblem to problem : OnlineSearchProblem<S,A> in method public OnlineDFSAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>) in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected abstract addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Parameter Type state : Object to state : String in method public apply(state String) : List<MoveToAction> in class aima.core.environment.map.MapFunctions.MapActionsFunction |
From |
To |
|
Change Parameter Type tracer : ProgressTracer to tracer : ProgressTracker in method public addProgressTracker(tracer ProgressTracker) : void in class aima.gui.fx.applications.search.NQueensSearchDemo |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public removeNodeListener(listener Consumer<Node<S,A>>) : boolean in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<S> in method public LRTAStarAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>, h ToDoubleFunction<S>) in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private expandNode(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type algo : SearchForActions to algo : SearchForActions<NQueensBoard,QueenAction> in method public addSearchAlgorithm(name String, algo SearchForActions<NQueensBoard,QueenAction>) : void in class aima.gui.swing.applications.search.games.NQueensApp |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method package ExtendedNode(node Node<S,A>, problemIndex int) in class aima.core.search.framework.qsearch.BidirectionalSearch.ExtendedNode |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public MapAgent(map Map, search SearchForActions<String,MoveToAction>, goals List<String>, notifier EnvironmentViewNotifier, hfFactory HeuristicFunctionFactory<String,MoveToAction>) in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type state : Object to state : Double in method protected getSuccessor(state Double) : Double in class aima.gui.fx.applications.search.local.SimulatedAnnealingMaximumFinderApp |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method protected addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<S,A> in method public SearchAgent(p Problem<S,A>, search SearchForActions<S,A>) in class aima.core.search.framework.SearchAgent |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<String,MoveToAction> in method protected search(problem Problem<String,MoveToAction>) : List<MoveToAction> in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method protected QueueSearch(nodeExpander NodeExpander<S,A>) in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Parameter Type node1 : ExtendedNode to node1 : ExtendedNode<S,A> in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>, nodeExpander NodeExpander<S,A>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type state : Object to state : S in method public testGoal(state S) : boolean in class aima.core.search.framework.problem.GeneralProblem |
From |
To |
|
Change Parameter Type sDelta : Object to sDelta : S in method private lrtaCost(s S, action A, sDelta S) : double in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private getSolution(node Node<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Parameter Type problem : NondeterministicProblem to problem : NondeterministicProblem<S,A> in method public andSearch(states Set<S>, problem NondeterministicProblem<S,A>, path Path) : Plan in class aima.core.search.nondeterministic.AndOrSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in method public setPerceptToStateFunction(ptsFn Function<Percept,S>) : void in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Parameter Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type children : List<Node> to children : List<Node<S,A>> in method private getHighestValuedNodeFrom(children List<Node<S,A>>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.HeuristicEvaluationFunction |
From |
To |
|
Change Parameter Type node : Node to node : Node<S,A> in method private setExplored(node Node<S,A>) : void in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public SimpleMapAgent(map Map, notifier EnvironmentViewNotifier, search SearchForActions<String,MoveToAction>, goals String[]) in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Parameter Type parent : Node to parent : Node<S,A> in method public createNode(state S, parent Node<S,A>, action A, stepCost double) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Parameter Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public GreedyBestFirstSearch(impl QueueSearch<S,A>, h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.GreedyBestFirstSearch |
From |
To |
|
Change Parameter Type action : Action to action : Object in method public prepend(action Object) : Plan in class aima.core.search.nondeterministic.Plan |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type node2 : ExtendedNode to node2 : ExtendedNode<S,A> in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method public addNodeListener(listener Consumer<Node<S,A>>) : void in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type pTracer : ProgressTracer<Double> to pTracer : ProgressTracker<Double> in method public startExperiment(pTracer ProgressTracker<Double>) : void in class aima.gui.fx.applications.search.local.GeneticMaximumFinderDemo |
From |
To |
|
Change Parameter Type problem : NondeterministicProblem to problem : NondeterministicProblem<S,A> in method public search(problem NondeterministicProblem<S,A>) : Plan in class aima.core.search.nondeterministic.AndOrSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler, nodeExpander NodeExpander<S,A>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public GraphSearchBFS(nodeExpander NodeExpander<S,A>) in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>, avoidLoops boolean, nodeExpander NodeExpander<S,A>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Parameter Type p : Problem to p : Problem<S,A> in method private rbfs(p Problem<S,A>, node Node<S,A>, node_f double, fLimit double, recursiveDepth int) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type problem : Problem to problem : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type states : Set<Object> to states : Set<S> in method public andSearch(states Set<S>, problem NondeterministicProblem<S,A>, path Path) : Plan in class aima.core.search.nondeterministic.AndOrSearch |
From |
To |
|
Change Variable Type goalTest : GoalTest to goalTest : GoalTest<Individual<Integer>> in method private nQueensGeneticAlgorithmSearch() : void in class aima.gui.demo.search.NQueensDemo |
From |
To |
|
Change Variable Type a : VacuumEnvironment.LocationState to a : LocationState in method public testSearchExecutesSuccessfully() : void in class aima.test.core.unit.search.nondeterministic.AndOrSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<AgentPosition,Action> in method public planRoute(current AgentPosition, goals Set<Room>, allowed Set<Room>) : List<Action> in class aima.core.environment.wumpusworld.HybridWumpusAgent |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testDepthFirstSuccesfulSearch() : void in class aima.test.core.unit.search.uninformed.DepthFirstSearchTest |
From |
To |
|
Change Variable Type ahf : Function<Object,Double> to h : ToDoubleFunction<Node<String,MoveToAction>> in method protected createHeuristic(heuIdx int, goal String) : ToDoubleFunction<Node<String,MoveToAction>> in class aimax.osm.gui.swing.viewer.agent.OsmAgentController |
From |
To |
|
Change Variable Type actions : List<Action> to actions : List<QueenAction> in method public testSimpleBoardSuccessorGenerator() : void in class aima.test.core.unit.environment.nqueens.NQueensFunctionsTest |
From |
To |
|
Change Variable Type frontierNode : Node to frontierNode : Node<S,A> in method protected addToFrontier(node Node<S,A>) : void in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Variable Type nodes : List<Node> to nodes : List<Node<S,A>> in method public getSequenceOfActions(node Node<S,A>) : List<A> in class aima.core.search.framework.SearchUtils |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method private nQueensWithDepthFirstSearch() : void in class aima.gui.demo.search.NQueensDemo |
From |
To |
|
Change Variable Type current : Node to current : Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Variable Type listener : Consumer<Node> to listener : Consumer<Node<S,A>> in method protected notifyNodeListeners(node Node<S,A>) : void in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Variable Type currState : Object to currState : S in method private getReverseAction(orgP Problem<S,A>, node Node<S,A>) : A in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testDepthFirstUnSuccessfulSearch() : void in class aima.test.core.unit.search.uninformed.DepthFirstSearchTest |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method private recursiveDLS(node Node<S,A>, problem Problem<S,A>, limit int) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Variable Type search : QueueBasedSearch to search : QueueBasedSearch<EightPuzzleBoard,Action> in method public testGreedyBestFirstSearchReducedFrontier() : void in class aima.test.core.unit.search.informed.GreedyBestFirstSearchTest |
From |
To |
|
Change Variable Type sr : SearchResult to sr : SearchResult<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type heuristic : Function<Object,Double> to heuristic : ToDoubleFunction<Node<String,MoveToAction>> in method protected createAgent(locations List<String>) : Agent in class aimax.osm.gui.fx.applications.OsmAgentBaseApp |
From |
To |
|
Change Variable Type actions : List<Action> to actions : List<QueenAction> in method public testComplexBoardSuccessorGenerator() : void in class aima.test.core.unit.environment.nqueens.NQueensFunctionsTest |
From |
To |
|
Change Variable Type tracer : ProgressTracer<A> to tracer : ProgressTracker<A> in method private notifyProgressTrackers(itCount int, generation Collection<Individual<A>>) : void in class aima.core.search.local.GeneticAlgorithm |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testCheckFrontierPathCost() : void in class aima.test.core.unit.search.informed.AStarSearchTest |
From |
To |
|
Change Variable Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<String,MoveToAction>> in method protected createHeuristic(heuIdx int) : ToDoubleFunction<Node<String,MoveToAction>> in class aima.gui.swing.applications.agent.map.RouteFindingAgentApp.RouteFindingAgentController |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Variable Type result : List<Node> to result : List<Node<S,A>> in method private expandNode(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method public testAStarSearch() : void in class aima.test.core.unit.search.informed.AStarSearchTest |
From |
To |
|
Change Variable Type child : Node to child : Node<S,A> in method private getHighestValuedNodeFrom(children List<Node<S,A>>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type children : List<Node> to children : List<Node<S,A>> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Variable Type p : Problem to p : Problem<String,MoveToAction> in method protected createAgent(locations List<String>) : Agent in class aimax.osm.gui.fx.applications.OsmLRTAStarAgentApp |
From |
To |
|
Change Variable Type actions : List<Action> to actions : List<A> in method public getSequenceOfActions(node Node<S,A>) : List<A> in class aima.core.search.framework.SearchUtils |
From |
To |
|
Change Variable Type root : Node to root : Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testBreadthFirstUnSuccesfulSearch() : void in class aima.test.core.unit.search.uninformed.BreadthFirstSearchTest |
From |
To |
|
Change Variable Type p : Problem to p : Problem<String,MoveToAction> in method protected initAgents(logger MessageLogger) : void in class aimax.osm.gui.swing.viewer.agent.OsmAgentController |
From |
To |
|
Change Variable Type nodeFromOtherProblem : ExtendedNode to nodeFromOtherProblem : ExtendedNode<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type initStateNode : ExtendedNode to initStateNode : ExtendedNode<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type result : List<Action> to result : List<MoveToAction> in method protected search(problem Problem<String,MoveToAction>) : List<MoveToAction> in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Variable Type action : Action to action : A in method public orSearch(state S, problem NondeterministicProblem<S,A>, path Path) : Plan in class aima.core.search.nondeterministic.AndOrSearch |
From |
To |
|
Change Variable Type child : Node to child : Node<S,A> in method private recursiveDLS(node Node<S,A>, problem Problem<S,A>, limit int) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testMultiGoalProblem() : void in class aima.test.core.unit.search.framework.SolutionTesterTest |
From |
To |
|
Change Variable Type n : Node to n : Node<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type current : Node to current : Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type ni : Iterator<Node> to ni : Iterator<Node<S,A>> in method private expandNode(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type sa : Pair<Object,Action> to sa : Pair<S,A> in method public execute(psPrimed Percept) : Action in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testCheckFrontierPathCost() : void in class aima.test.core.unit.search.uninformed.UniformCostSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<MapNode,OsmMoveAction> in method public calculateRoute(markers List<MapNode>, map OsmMap, taskSelection int) : List<Position> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Variable Type sDelta : Object to sPrimed : S in method public execute(psPrimed Percept) : Action in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Variable Type popped : Object to popped : S in method public execute(psPrimed Percept) : Action in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Variable Type nextState : Object to nextState : S in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type result : Node to result : Node<NQueensBoard,QueenAction> in method public testCutOff() : void in class aima.test.core.unit.search.uninformed.DepthLimitedSearchTest |
From |
To |
|
Change Variable Type b : VacuumEnvironment.LocationState to b : LocationState in method public testSearchExecutesSuccessfully() : void in class aima.test.core.unit.search.nondeterministic.AndOrSearchTest |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Variable Type action : Action to action : A in method private getReverseAction(orgP Problem<S,A>, node Node<S,A>) : A in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testAIMA3eFigure3_23() : void in class aima.test.core.unit.search.informed.GreedyBestFirstSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testUniformCostUnSuccesfulSearch() : void in class aima.test.core.unit.search.uninformed.UniformCostSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method private eightPuzzleGreedyBestFirstManhattanDemo() : void in class aima.gui.demo.search.EightPuzzleDemo |
From |
To |
|
Change Variable Type children : List<Node> to children : List<Node<S,A>> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method private eightPuzzleAStarDemo() : void in class aima.gui.demo.search.EightPuzzleDemo |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testAIMA3eFigure3_24_using_GraphSearch() : void in class aima.test.core.unit.search.informed.AStarSearchTest |
From |
To |
|
Change Variable Type goal : Object to goal : String in method protected formulateGoal() : Object in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Variable Type problem : Problem to problem : Problem<S,A> in method public execute(p Percept) : Action in class aima.core.search.framework.SimpleProblemSolvingAgent |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method private eightPuzzleDLSDemo() : void in class aima.gui.demo.search.EightPuzzleDemo |
From |
To |
|
Change Variable Type af : ActionsFunction to actionsFn : ActionsFunction<NQueensBoard,QueenAction> in method protected addAgent() : void in class aima.gui.swing.applications.search.games.NQueensApp.NQueensController |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testUniformCostSuccesfulSearch() : void in class aima.test.core.unit.search.uninformed.UniformCostSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method private eightPuzzleAStarManhattanDemo() : void in class aima.gui.demo.search.EightPuzzleDemo |
From |
To |
|
Change Variable Type orgNode : Node to orgNode : Node<S,A> in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type current : Node to current : Node<S,A> in method public getPathFromRoot() : List<Node<S,A>> in class aima.core.search.framework.Node |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testAIMA3eFigure3_23_using_GraphSearch() : void in class aima.test.core.unit.search.informed.GreedyBestFirstSearchTest |
From |
To |
|
Change Variable Type problem : Problem to problem : Problem<S,A> in method public execute(p Percept) : Action in class aima.core.search.framework.ProblemSolvingAgent |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method private nQueensWithBreadthFirstSearch() : void in class aima.gui.demo.search.NQueensDemo |
From |
To |
|
Change Variable Type successors : List<Node> to successors : List<Node<S,A>> in method private rbfs(p Problem<S,A>, node Node<S,A>, node_f double, fLimit double, recursiveDepth int) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type p : Problem to p : Problem<String,MoveToAction> in method protected initAgents(logger MessageLogger) : void in class aimax.osm.gui.swing.applications.SearchDemoOsmAgentApp.SDController |
From |
To |
|
Change Variable Type action : Action to action : A in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type result : SearchForActions to result : SearchForActions<S,A> in method public createSearch(strategy int, qSearchImpl int, h ToDoubleFunction<Node<S,A>>) : SearchForActions<S,A> in class aima.gui.util.SearchFactory |
From |
To |
|
Change Variable Type a : Action to a : MoveToAction in method public testSuccessors() : void in class aima.test.core.unit.environment.map.MapFunctionsTest |
From |
To |
|
Change Variable Type next : Node to next : Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testSuccessfulDepthLimitedSearch() : void in class aima.test.core.unit.search.uninformed.DepthLimitedSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testIterativeDeepeningSearch() : void in class aima.test.core.unit.search.uninformed.IterativeDeepeningSearchTest |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Variable Type neighbor : Node to neighbor : Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type s : Node to s : Node<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type nodeToExpand : Node to nodeToExpand : Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Variable Type path : List<Node> to path : List<Node<S,A>> in method public getPathFromRoot() : List<Node<S,A>> in class aima.core.search.framework.Node |
From |
To |
|
Change Variable Type result : List<Action> to result : List<MoveToAction> in method protected search(problem Problem<String,MoveToAction>) : List<MoveToAction> in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Variable Type eNode : ExtendedNode to eNode : ExtendedNode<S,A> in method private setExplored(node Node<S,A>) : void in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type successor : Node to successor : Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Variable Type sDelta : Object to sPrimed : S in method public execute(psPrimed Percept) : Action in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Variable Type s : Node to s : Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type problem : Problem to problem : Problem<MapNode,OsmMoveAction> in method public calculateRoute(markers List<MapNode>, map OsmMap, taskSelection int) : List<Position> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method private eightPuzzleIDLSDemo() : void in class aima.gui.demo.search.EightPuzzleDemo |
From |
To |
|
Change Variable Type nodeToExpand : ExtendedNode to nodeToExpand : ExtendedNode<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method public testGreedyBestFirstSearch() : void in class aima.test.core.unit.search.informed.GreedyBestFirstSearchTest |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testAIMA3eFigure3_15() : void in class aima.test.core.unit.search.informed.AStarSearchTest |
From |
To |
|
Change Variable Type orgP : Problem to orgP : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type eNode : ExtendedNode to eNode : ExtendedNode<S,A> in method private isExplored(node Node<S,A>) : boolean in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type revP : Problem to revP : Problem<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type sr : SearchResult to sr : SearchResult<S,A> in method private rbfs(p Problem<S,A>, node Node<S,A>, node_f double, fLimit double, recursiveDepth int) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<MapNode,OsmMoveAction>> in method public calculateRoute(markers List<MapNode>, map OsmMap, taskSelection int) : List<Position> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Variable Type p : Node to p : Node<S,A> in method public createNode(state S, parent Node<S,A>, action A, stepCost double) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Variable Type results : Set<Object> to results : Set<VacuumEnvironmentState> in method public results(state VacuumEnvironmentState, action Action) : Set<VacuumEnvironmentState> in class aima.core.environment.vacuum.VacuumWorldResults |
From |
To |
|
Change Variable Type nodeWithHighestValue : Node to nodeWithHighestValue : Node<S,A> in method private getHighestValuedNodeFrom(children List<Node<S,A>>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type heuristic : Function<Object,Double> to heuristic : ToDoubleFunction<String> in method protected createAgent(locations List<String>) : Agent in class aimax.osm.gui.fx.applications.OsmLRTAStarAgentApp |
From |
To |
|
Change Variable Type revNode : Node to revNode : Node<S,A> in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<EightPuzzleBoard,Action> in method private eightPuzzleGreedyBestFirstDemo() : void in class aima.gui.demo.search.EightPuzzleDemo |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method private nQueensWithRecursiveDLS() : void in class aima.gui.demo.search.NQueensDemo |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testAIMA3eFigure3_15() : void in class aima.test.core.unit.search.uninformed.UniformCostSearchTest |
From |
To |
|
Change Variable Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<AgentPosition,Action>> in method public planRoute(current AgentPosition, goals Set<Room>, allowed Set<Room>) : List<Action> in class aima.core.environment.wumpusworld.HybridWumpusAgent |
From |
To |
|
Change Variable Type result : StringBuffer to result : StringBuilder in method private getStatistics() : String in class aima.gui.swing.applications.search.games.NQueensApp.NQueensController |
From |
To |
|
Change Variable Type nextState : Object to nextState : S in method private getReverseAction(orgP Problem<S,A>, node Node<S,A>) : A in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method private nQueensWithIterativeDeepeningSearch() : void in class aima.gui.demo.search.NQueensDemo |
From |
To |
|
Change Variable Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<String,MoveToAction>> in method public testCheckFrontierPathCost() : void in class aima.test.core.unit.search.informed.AStarSearchTest |
From |
To |
|
Change Variable Type result : ExtendedNode to result : ExtendedNode<S,A> in method private getCorrespondingNodeFromOtherProblem(node ExtendedNode<S,A>) : ExtendedNode<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.TreeSearch |
From |
To |
|
Change Variable Type result : Node to result : Node<S,A> in method private findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Variable Type actions : List<Action> to actions : List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in method public testAIMA3eFigure3_24() : void in class aima.test.core.unit.search.informed.AStarSearchTest |
From |
To |
|
Change Variable Type statusMsg : StringBuffer to statusMsg : StringBuilder in method public update(simulationThread SimulationThread) : void in class aima.gui.swing.applications.agent.map.AbstractMapAgentController |
From |
To |
|
Change Variable Type qs : QueueSearch to qs : QueueSearch<S,A> in method public createSearch(strategy int, qSearchImpl int, h ToDoubleFunction<Node<S,A>>) : SearchForActions<S,A> in class aima.gui.util.SearchFactory |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method public testBreadthFirstSuccesfulSearch() : void in class aima.test.core.unit.search.uninformed.BreadthFirstSearchTest |
From |
To |
|
Change Variable Type b : Action to b : A in method public execute(psPrimed Percept) : Action in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Variable Type actions : List<Action> to actions : List<OsmMoveAction> in method public calculateRoute(markers List<MapNode>, map OsmMap, taskSelection int) : List<Position> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Variable Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in method protected addAgent() : void in class aima.gui.swing.applications.search.games.NQueensApp.NQueensController |
From |
To |
|
Change Variable Type node : Node to node : Node<S,A> in method public findState(p Problem<S,A>) : S in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Return Type List<Action> to List<MoveToAction> in method protected search(problem Problem<String,MoveToAction>) : List<MoveToAction> in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Return Type Problem to Problem<String,MoveToAction> in method protected formulateProblem(goal Object) : Problem<String,MoveToAction> in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Return Type Problem to Problem<MapNode,OsmMoveAction> in method protected createProblem(pNodes MapNode[], map OsmMap, wayFilter MapWayFilter, ignoreOneways boolean, taskSelection int) : Problem<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Return Type NondeterministicProblem to NondeterministicProblem<VacuumEnvironmentState,Action> in method private createNondeterministicProblem() : NondeterministicProblem<VacuumEnvironmentState,Action> in class aima.gui.fx.applications.agent.VacuumAgentApp |
From |
To |
|
Change Return Type SearchResult to SearchResult<S,A> in method private getResult(currNode Node<S,A>, solutionNode Node<S,A>, fCostLimit double) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Return Type Object to S in method public findState(p Problem<S,A>) : S in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Return Type ResultsFunction to ResultsFunction<S,A> in method public getResultsFn() : ResultsFunction<S,A> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Return Type Node to Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Return Type List<Node> to List<Node<S,A>> in method private expandNode(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Return Type Problem to Problem<S,A> in method public getReverseProblem() : Problem<S,A> in class aima.core.search.framework.problem.BidirectionalProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method private getHighestValuedNodeFrom(children List<Node<S,A>>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Return Type GoalTest to GoalTest<S> in method public getGoalTest() : GoalTest<S> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Return Type Problem to Problem<S,A> in method protected abstract formulateProblem(goal Object) : Problem<S,A> in class aima.core.search.framework.SimpleProblemSolvingAgent |
From |
To |
|
Change Return Type Function<Object,Double> to ToDoubleFunction<S> in method public getHeuristicFunction() : ToDoubleFunction<S> in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Return Type List<Node> to List<Node<S,A>> in method public getPathFromRoot() : List<Node<S,A>> in class aima.core.search.framework.Node |
From |
To |
|
Change Return Type State to void in method protected updateState(p Percept) : void in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Return Type Function<Object,Double> to ToDoubleFunction<Node<String,MoveToAction>> in method protected createHeuristic(heuIdx int) : ToDoubleFunction<Node<String,MoveToAction>> in class aima.gui.swing.applications.agent.map.RouteFindingAgentApp.RouteFindingAgentController |
From |
To |
|
Change Return Type Node to Node<S,A> in method public createNode(state S, parent Node<S,A>, action A, stepCost double) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Return Type Problem to Problem<MapNode,OsmMoveAction> in method public getReverseProblem() : Problem<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteFindingProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method public createRootNode(state S) : Node<S,A> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Return Type Node to Node<S,A> in method private recursiveDLS(node Node<S,A>, problem Problem<S,A>, limit int) : Node<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Return Type Set<Object> to Set<VacuumEnvironmentState> in method public results(state VacuumEnvironmentState, action Action) : Set<VacuumEnvironmentState> in class aima.core.environment.vacuum.VacuumWorldResults |
From |
To |
|
Change Return Type Node to Node<S,A> in method private getSolution(node Node<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Return Type Function<Object,Double> to ToDoubleFunction<Node<String,MoveToAction>> in method protected abstract createHeuristic(heuIdx int) : ToDoubleFunction<Node<String,MoveToAction>> in class aima.gui.swing.applications.agent.map.AbstractMapAgentController |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Return Type Object to S in method public findState(p Problem<S,A>) : S in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Return Type SearchForActions to SearchForActions<S,A> in method public createSearch(strategy int, qSearchImpl int, h ToDoubleFunction<Node<S,A>>) : SearchForActions<S,A> in class aima.gui.util.SearchFactory |
From |
To |
|
Change Return Type Object to S in method public getInitialState() : S in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Return Type SearchResult to SearchResult<S,A> in method private rbfs(p Problem<S,A>, node Node<S,A>, node_f double, fLimit double, recursiveDepth int) : SearchResult<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Return Type Object to S in method public findState(p Problem<S,A>) : S in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Return Type Problem to Problem<String,MoveToAction> in method public getReverseProblem() : Problem<String,MoveToAction> in class aima.core.environment.map.BidirectionalMapProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Return Type Function<Percept,Object> to Function<Percept,S> in method public getPerceptToStateFunction() : Function<Percept,S> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Return Type ActionsFunction to ActionsFunction<S,A> in method public getActionsFn() : ActionsFunction<S,A> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Return Type Problem to Problem<EightPuzzleBoard,Action> in method public getOriginalProblem() : Problem<EightPuzzleBoard,Action> in class aima.core.environment.eightpuzzle.BidirectionalEightPuzzleProblem |
From |
To |
|
Change Return Type Action to A in method public getAction() : A in class aima.core.search.framework.Node |
From |
To |
|
Change Return Type Function<Object,Double> to ToDoubleFunction<Node<MapNode,OsmMoveAction>> in method protected createHeuristicFunction(pNodes MapNode[], taskSelection int) : ToDoubleFunction<Node<MapNode,OsmMoveAction>> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Return Type SearchForActions to SearchForActions<MapNode,OsmMoveAction> in method protected createSearch(h ToDoubleFunction<Node<MapNode,OsmMoveAction>>, taskSelection int) : SearchForActions<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Return Type Object to S in method public getState() : S in class aima.core.search.framework.Node |
From |
To |
|
Change Return Type State to void in method protected updateState(p Percept) : void in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Return Type StepCostFunction to StepCostFunction<S,A> in method public getStepCostFn() : StepCostFunction<S,A> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method private getSolution(orgP Problem<S,A>, node1 ExtendedNode<S,A>, node2 ExtendedNode<S,A>) : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.framework.SearchForActions |
From |
To |
|
Change Return Type Object to S in method public findState(p Problem<S,A>) : S in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Return Type List<Action> to List<A> in method public findActions(p Problem<S,A>) : List<A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Return Type Function<Object,Double> to ToDoubleFunction<Node<S,A>> in method public getHeuristicFunction() : ToDoubleFunction<Node<S,A>> in class aima.core.search.informed.HeuristicEvaluationFunction |
From |
To |
|
Change Return Type Node to Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Return Type Problem to Problem<S,A> in method protected abstract formulateProblem(goal Object) : Problem<S,A> in class aima.core.search.framework.ProblemSolvingAgent |
From |
To |
|
Change Return Type Double to List<MoveToAction> in method public apply(state String) : List<MoveToAction> in class aima.core.environment.map.MapFunctions.MapActionsFunction |
From |
To |
|
Change Return Type GoalTest to GoalTest<Individual<Integer>> in method public getGoalTest() : GoalTest<Individual<Integer>> in class aima.core.environment.nqueens.NQueensGenAlgoUtil |
From |
To |
|
Change Return Type Function<Object,Double> to ToDoubleFunction<Node<String,MoveToAction>> in method protected createHeuristic(heuIdx int, goal String) : ToDoubleFunction<Node<String,MoveToAction>> in class aimax.osm.gui.swing.viewer.agent.OsmAgentController |
From |
To |
|
Change Return Type Problem to Problem<String,MoveToAction> in method public getOriginalProblem() : Problem<String,MoveToAction> in class aima.core.environment.map.BidirectionalMapProblem |
From |
To |
|
Change Return Type Function<Percept,Object> to Function<Percept,S> in method public getPerceptToStateFunction() : Function<Percept,S> in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Return Type Object to S in method public findState(p Problem<S,A>) : S in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Return Type Object to S in method public getLastSearchState() : S in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Return Type Problem to Problem<S,A> in method public getOriginalProblem() : Problem<S,A> in class aima.core.search.framework.problem.BidirectionalProblem |
From |
To |
|
Change Return Type ExtendedNode to ExtendedNode<S,A> in method private getCorrespondingNodeFromOtherProblem(node ExtendedNode<S,A>) : ExtendedNode<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Return Type OnlineSearchProblem to OnlineSearchProblem<S,A> in method public getProblem() : OnlineSearchProblem<S,A> in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Return Type Node to Node<S,A> in method protected abstract removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Return Type OnlineSearchProblem to OnlineSearchProblem<S,A> in method public getProblem() : OnlineSearchProblem<S,A> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Return Type Problem to Problem<EightPuzzleBoard,Action> in method public getReverseProblem() : Problem<EightPuzzleBoard,Action> in class aima.core.environment.eightpuzzle.BidirectionalEightPuzzleProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method private findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Return Type Problem to Problem<String,MoveToAction> in method protected formulateProblem(goal Object) : Problem<String,MoveToAction> in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Return Type Node to Node<S,A> in method public getSolutionNode() : Node<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch.SearchResult |
From |
To |
|
Change Return Type Object to void in method protected abstract updateState(p Percept) : void in class aima.core.search.framework.ProblemSolvingAgent |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(p Problem<S,A>) : Node<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Return Type Comparator<? super Node> to Comparator<? super Node<S,A>> in method public getNodeComparator() : Comparator<? super Node<S,A>> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Return Type List<Action> to List<A> in method public getSequenceOfActions(node Node<S,A>) : List<A> in class aima.core.search.framework.SearchUtils |
From |
To |
|
Change Return Type Object to S in method public findState(p Problem<S,A>) : S in class aima.core.search.framework.SearchForStates |
From |
To |
|
Change Return Type Action to A in method private getReverseAction(orgP Problem<S,A>, node Node<S,A>) : A in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Return Type Node to Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.TreeSearch |
From |
To |
|
Change Return Type Problem to Problem<MapNode,OsmMoveAction> in method public getOriginalProblem() : Problem<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteFindingProblem |
From |
To |
|
Change Return Type Node to Node<S,A> in method public getParent() : Node<S,A> in class aima.core.search.framework.Node |
From |
To |
|
Change Return Type State to void in method protected abstract updateState(p Percept) : void in class aima.core.search.framework.SimpleProblemSolvingAgent |
From |
To |
|
Change Return Type Node to Node<S,A> in method protected removeFromFrontier() : Node<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Return Type List<Action> to List<A> in method public failure() : List<A> in class aima.core.search.framework.SearchUtils |
From |
To |
|
Change Return Type List<Action> to List<MoveToAction> in method protected search(problem Problem<String,MoveToAction>) : List<MoveToAction> in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Return Type SearchForActions to Agent in method protected createAgent(locations List<String>) : Agent in class aimax.osm.gui.fx.applications.OsmAgentBaseApp |
From |
To |
|
Change Return Type NodeExpander to NodeExpander<S,A> in method public getNodeExpander() : NodeExpander<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Return Type Double to double in method public applyAsDouble(n Node) : double in class aima.core.search.informed.AStarSearch.EvalFunction |
From |
To |
|
Change Return Type Node to Node<S,A> in method public findNode(problem Problem<S,A>, frontier Queue<Node<S,A>>) : Node<S,A> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Return Type NondeterministicProblem to NondeterministicProblem<VacuumEnvironmentState,Action> in method private createNondeterministicProblem() : NondeterministicProblem<VacuumEnvironmentState,Action> in class aima.gui.swing.applications.agent.VacuumController |
From |
To |
|
Change Attribute Type goalStateNode : ExtendedNode to goalStateNode : ExtendedNode<S,A> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Attribute Type progressTracers : List<ProgressTracer<A>> to progressTrackers : List<ProgressTracker<A>> in class aima.core.search.local.GeneticAlgorithm |
From |
To |
|
Change Attribute Type recursiveBestFirstSearchAvoidingLoops : RecursiveBestFirstSearch to recursiveBestFirstSearchAvoidingLoops : RecursiveBestFirstSearch<String,MoveToAction> in class aima.test.core.unit.search.informed.RecursiveBestFirstSearchTest |
From |
To |
|
Change Attribute Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Attribute Type nodeListeners : List<Consumer<Node>> to nodeListeners : List<Consumer<Node<S,A>>> in class aima.core.search.framework.NodeExpander |
From |
To |
|
Change Attribute Type frontierNodeLookup : Map<Object,Node> to frontierNodeLookup : Map<S,Node<S,A>> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Attribute Type recursiveBestFirstSearch : RecursiveBestFirstSearch to recursiveBestFirstSearch : RecursiveBestFirstSearch<String,MoveToAction> in class aima.test.core.unit.search.informed.RecursiveBestFirstSearchTest |
From |
To |
|
Change Attribute Type actionFunction : ActionsFunction to actionFn : ActionsFunction<AgentPosition,Action> in class aima.test.core.unit.environment.wumpusworld.WumpusFunctionsTest |
From |
To |
|
Change Attribute Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Attribute Type goalTest : GoalTest to goalTest : GoalTest<S> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Attribute Type solNode : Node to solNode : Node<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch.SearchResult |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Attribute Type impl : QueueSearch to impl : QueueSearch<S,A> in class aima.core.search.framework.QueueBasedSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander to nodeExpander : NodeExpander<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Attribute Type explored : Set<Object> to explored : Set<S> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Attribute Type stepCostFunction : StepCostFunction to stepCostFn : StepCostFunction<S,A> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Attribute Type goalTest : GoalTest to goalTest : GoalTest<Individual<Integer>> in class aima.test.core.unit.environment.nqueens.NQueensGenAlgoUtilTest |
From |
To |
|
Change Attribute Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in class aima.core.environment.map.SimpleMapAgent |
From |
To |
|
Change Attribute Type hf : Function<Object,Double> to h : ToDoubleFunction<String> in class aima.test.core.unit.search.online.LRTAStarAgentTest |
From |
To |
|
Change Attribute Type problem : OnlineSearchProblem to problem : OnlineSearchProblem<S,A> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type heuristic : Function<Object,Double> to heuristic : ToDoubleFunction<Node<String,MoveToAction>> in class aima.gui.swing.applications.agent.map.AbstractMapAgentController |
From |
To |
|
Change Attribute Type initialState : Object to initialState : S in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Attribute Type explored : Set<Object> to explored : Set<S> in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Attribute Type result : TwoKeyHashMap<Object,Action,Object> to result : TwoKeyHashMap<S,A,S> in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Attribute Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in class aima.gui.swing.applications.agent.map.AbstractMapAgentController |
From |
To |
|
Change Attribute Type s : Object to s : S in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type goalTest : NQueensGoalTest to goalTest : GoalTest<NQueensBoard> in class aima.core.environment.nqueens.NQueensGenAlgoUtil.NQueensGenAlgoGoalTest |
From |
To |
|
Change Attribute Type a : Action to a : A in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Attribute Type evalFunc : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Attribute Type nodeComparator : Comparator<? super Node> to nodeComparator : Comparator<? super Node<S,A>> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Attribute Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in class aima.core.search.informed.HeuristicEvaluationFunction |
From |
To |
|
Change Attribute Type ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type rf : ResultFunction to resultFn : ResultFunction<String,MoveToAction> in class aima.test.core.unit.environment.map.MapFunctionsTest |
From |
To |
|
Change Attribute Type frontier : Queue<Node> to frontier : Queue<Node<S,A>> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Attribute Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Attribute Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in class aimax.osm.gui.swing.viewer.agent.OsmAgentController |
From |
To |
|
Change Attribute Type reverseProblem : Problem to reverseProblem : Problem<String,MoveToAction> in class aima.core.environment.map.BidirectionalMapProblem |
From |
To |
|
Change Attribute Type result : TwoKeyHashMap<Object,Action,Object> to result : TwoKeyHashMap<S,A,S> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type gf : Function<Node,Double> to g : ToDoubleFunction<Node> in class aima.core.search.informed.AStarSearch.EvalFunction |
From |
To |
|
Change Attribute Type search : SearchForActions to search : SearchForActions<String,MoveToAction> in class aima.test.core.unit.search.uninformed.BidirectionalSearchTest |
From |
To |
|
Change Attribute Type evalFunc : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in class aima.core.search.informed.BestFirstSearch |
From |
To |
|
Change Attribute Type reverseProblem : Problem to reverseProblem : Problem<EightPuzzleBoard,Action> in class aima.core.environment.eightpuzzle.BidirectionalEightPuzzleProblem |
From |
To |
|
Change Attribute Type SEARCH_ALGOS : List<SearchForActions> to SEARCH_ALGOS : List<SearchForActions<NQueensBoard,QueenAction>> in class aima.gui.swing.applications.search.games.NQueensApp |
From |
To |
|
Change Attribute Type reverseProblem : Problem to reverseProblem : Problem<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteFindingProblem |
From |
To |
|
Change Attribute Type af : ActionsFunction to actionsFn : ActionsFunction<String,MoveToAction> in class aima.test.core.unit.environment.map.MapFunctionsTest |
From |
To |
|
Change Attribute Type s : Object to s : S in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Attribute Type heuristic : Function<Object,Double> to heuristic : ToDoubleFunction<Node<String,MoveToAction>> in class aimax.osm.gui.swing.viewer.agent.OsmAgentController |
From |
To |
|
Change Attribute Type search : SearchForActions to search : SearchForActions<NQueensBoard,QueenAction> in class aima.gui.fx.applications.search.NQueensSearchDemo |
From |
To |
|
Change Attribute Type resultsFunction : ResultsFunction to resultsFn : ResultsFunction<S,A> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Change Attribute Type resultFunction : ResultFunction to resultFn : ResultFunction<AgentPosition,Action> in class aima.test.core.unit.environment.wumpusworld.WumpusFunctionsTest |
From |
To |
|
Change Attribute Type progressTracers : List<ProgressTracer> to progressTracers : List<ProgressTracker> in class aima.gui.fx.applications.search.NQueensSearchDemo |
From |
To |
|
Change Attribute Type explored : Set<Object> to explored : Set<S> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Attribute Type heuristic : Function<Object,Double> to heuristic : ToDoubleFunction<Node<String,MoveToAction>> in class aima.gui.fx.applications.agent.RouteFindingAgentApp |
From |
To |
|
Change Attribute Type lastState : Object to lastState : S in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Attribute Type plan : List<Action> to plan : Queue<A> in class aima.core.search.framework.ProblemSolvingAgent |
From |
To |
|
Change Attribute Type unbacktracked : Map<Object,List<Object>> to unbacktracked : Map<S,List<S>> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type a : Action to a : A in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type state : Object to state : S in class aima.core.search.framework.Node |
From |
To |
|
Change Attribute Type hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Attribute Type frontierStates : Set<Object> to frontierStates : Set<S> in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Attribute Type explored : Set<Object> to explored : Set<S> in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Change Attribute Type problem : OnlineSearchProblem to problem : OnlineSearchProblem<S,A> in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Attribute Type parent : Node to parent : Node<S,A> in class aima.core.search.framework.Node |
From |
To |
|
Change Attribute Type explored : List<Map<Object,ExtendedNode>> to explored : List<Map<S,ExtendedNode<S,A>>> in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Attribute Type search : SimulatedAnnealingSearch to search : SimulatedAnnealingSearch<Double,Action> in class aima.gui.fx.applications.search.local.SimulatedAnnealingMaximumFinderApp |
From |
To |
|
Change Attribute Type H : HashMap<Object,Double> to H : HashMap<S,Double> in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Change Attribute Type lastState : Object to lastState : S in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Attribute Type action : Action to action : A in class aima.core.search.framework.Node |
From |
To |
|
Change Attribute Type hfFactory : HeuristicFunctionFactory to hfFactory : HeuristicFunctionFactory<String,MoveToAction> in class aima.core.environment.map.MapAgent |
From |
To |
|
Change Attribute Type seq : List<Action> to seq : Queue<A> in class aima.core.search.framework.SimpleProblemSolvingAgent |
From |
To |
|
Change Attribute Type untried : Map<Object,List<Action>> to untried : Map<S,List<A>> in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Change Attribute Type actionsFunction : ActionsFunction to actionsFn : ActionsFunction<S,A> in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Rename Parameter ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in method public OnlineDFSAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>) in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Rename Parameter stepCostFunction : StepCostFunction to stepCostFn : StepCostFunction<S,A> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Rename Parameter state : boolean to s : boolean in method public useParentLinks(s boolean) : NodeExpander in class aima.core.search.framework.NodeExpander |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public EvalFunction(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.GreedyBestFirstSearch.EvalFunction |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public GreedyBestFirstSearch(impl QueueSearch<S,A>, h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.GreedyBestFirstSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.BestFirstSearch |
From |
To |
|
Rename Parameter actionsFunction : ActionsFunction to actionsFn : ActionsFunction<S,A> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |
|
Rename Parameter ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in method public setPerceptToStateFunction(ptsFn Function<Percept,S>) : void in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Rename Parameter state : boolean to b : boolean in method public setEarlyGoalTest(b boolean) : void in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.HeuristicEvaluationFunction |
From |
To |
|
Rename Parameter psDelta : Percept to psPrimed : Percept in method public execute(psPrimed Percept) : Action in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Rename Parameter ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public BestFirstSearch(impl QueueSearch<S,A>, evalFn ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.BestFirstSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public createSearch(strategy int, qSearchImpl int, h ToDoubleFunction<Node<S,A>>) : SearchForActions<S,A> in class aima.gui.util.SearchFactory |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<S> in method public LRTAStarAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>, h ToDoubleFunction<S>) in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to ptsFn : Function<Percept,S> in method public setPerceptToStateFunction(ptsFn Function<Percept,S>) : void in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public EvalFunction(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.AStarSearch.EvalFunction |
From |
To |
|
Rename Parameter ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>, avoidLoops boolean) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Parameter ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>, avoidLoops boolean, nodeExpander NodeExpander<S,A>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>, nodeExpander NodeExpander<S,A>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Parameter psDelta : Percept to psPrimed : Percept in method public execute(psPrimed Percept) : Action in class aima.core.search.online.OnlineDFSAgent |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.informed.Informed |
From |
To |
|
Rename Parameter ptsFunction : Function<Percept,Object> to ptsFn : Function<Percept,S> in method public LRTAStarAgent(problem OnlineSearchProblem<S,A>, ptsFn Function<Percept,S>, h ToDoubleFunction<S>) in class aima.core.search.online.LRTAStarAgent |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler, nodeExpander NodeExpander<S,A>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Parameter state : boolean to b : boolean in method public setReverseActionTestEnabled(b boolean) : void in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public setHeuristicFunction(h ToDoubleFunction<Node<S,A>>) : void in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<MapNode,OsmMoveAction>> in method protected createSearch(h ToDoubleFunction<Node<MapNode,OsmMoveAction>>, taskSelection int) : SearchForActions<MapNode,OsmMoveAction> in class aimax.osm.routing.RouteCalculator |
From |
To |
|
Rename Parameter ef : Function<Node,Double> to evalFn : ToDoubleFunction<Node<S,A>> in method public RecursiveBestFirstSearch(evalFn ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public AStarSearch(impl QueueSearch<S,A>, h ToDoubleFunction<Node<S,A>>) in class aima.core.search.informed.AStarSearch |
From |
To |
|
Rename Parameter hf : Function<Object,Double> to h : ToDoubleFunction<Node<S,A>> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Parameter resultsFunction : ResultsFunction to resultsFn : ResultsFunction<S,A> in method public NondeterministicProblem(initialState S, actionsFn ActionsFunction<S,A>, resultsFn ResultsFunction<S,A>, goalTest GoalTest<S>, stepCostFn StepCostFunction<S,A>) in class aima.core.search.nondeterministic.NondeterministicProblem |
From |
To |