|
Rename Method public getNodeExpander() : NodeExpander<S,A> renamed to public getNodeFactory() : NodeFactory<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Rename Method public expand(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> renamed to public getSuccessors(node Node<S,A>, problem Problem<S,A>) : List<Node<S,A>> in class aima.core.search.framework.NodeFactory |
From |
To |
|
Rename Method public createRootNode(state S) : Node<S,A> renamed to public createNode(state S) : Node<S,A> in class aima.core.search.framework.NodeFactory |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public DepthLimitedSearch(limit int, nodeFactory NodeFactory<S,A>) in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public GraphSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method protected QueueSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public RecursiveBestFirstSearch(evalFn EvaluationFunction<S,A>, avoidLoops boolean, nodeFactory NodeFactory<S,A>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler, nodeFactory NodeFactory<S,A>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public TreeSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.TreeSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>, nodeFactory NodeFactory<S,A>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public GraphSearchBFS(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public IterativeDeepeningSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public BidirectionalSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Change Parameter Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public GraphSearchReducedFrontier(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Rename Attribute nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Attribute nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Attribute nodeListeners : List<Consumer<Node<S,A>>> to listeners : List<Consumer<Node<S,A>>> in class aima.core.search.framework.NodeFactory |
From |
To |
|
Rename Attribute nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Rename Attribute nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Attribute nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Rename Attribute nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Change Attribute Type nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public GraphSearchReducedFrontier(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public BidirectionalSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public RecursiveBestFirstSearch(evalFn EvaluationFunction<S,A>, avoidLoops boolean, nodeFactory NodeFactory<S,A>) in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public SimulatedAnnealingSearch(h ToDoubleFunction<Node<S,A>>, scheduler Scheduler, nodeFactory NodeFactory<S,A>) in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Parameter pTracer : ProgressTracker<A> to pTracker : ProgressTracker<A> in method public addProgressTracer(pTracker ProgressTracker<A>) : void in class aima.core.search.local.GeneticAlgorithm |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public IterativeDeepeningSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public GraphSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public DepthLimitedSearch(limit int, nodeFactory NodeFactory<S,A>) in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method protected QueueSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public TreeSearch(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.TreeSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public HillClimbingSearch(h ToDoubleFunction<Node<S,A>>, nodeFactory NodeFactory<S,A>) in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Parameter nodeExpander : NodeExpander<S,A> to nodeFactory : NodeFactory<S,A> in method public GraphSearchBFS(nodeFactory NodeFactory<S,A>) in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |