3c76a34338c964e25530178b92cded7495fcb487
Files Diff
- Added: 13
- Removed: 1
- Renamed: 0
- Modified: 20
Refactorings reported:
| Refactoring Name | Occurences | ||
|---|---|---|---|
| Move And Rename Method | 1 | ||
| Move And Rename Method public CollisionPolicyAdapter(policy BranchCollisionPolicy) from class org.neo4j.graphdb.traversal.BranchCollisionPolicy.CollisionPolicyAdapter to public CollisionPolicyWrapper(policy BranchCollisionPolicy) from class org.neo4j.graphdb.traversal.BranchCollisionPolicy.CollisionPolicyWrapper | From | To | |
| Change Parameter Type | 2 | ||
| Change Parameter Type interest : PathInterest to interest : PathInterest<Double> in method public DijkstraSelectorFactory(interest PathInterest<Double>, evaluator CostEvaluator<Double>) in class org.neo4j.graphalgo.impl.util.DijkstraSelectorFactory | From | To | |
| Change Parameter Type interest : PathInterest to interest : PathInterest<P> in method public BestFirstSelectorFactory(interest PathInterest<P>) in class org.neo4j.graphalgo.impl.util.BestFirstSelectorFactory | From | To | |
| Move Method | 5 | ||
| Move Method public create(evaluator Evaluator, pathPredicate Predicate<Path>) : BranchCollisionDetector from class org.neo4j.graphdb.traversal.BranchCollisionPolicy.CollisionPolicyAdapter to public create(evaluator Evaluator, pathPredicate Predicate<Path>) : BranchCollisionDetector from class org.neo4j.graphdb.traversal.BranchCollisionPolicy.CollisionPolicyWrapper | From | To | |
| Move Method private assertContainsRelationship(path WeightedPath, relationship Relationship) : void from class org.neo4j.graphalgo.path.TestDijkstra to private assertContainsRelationship(path WeightedPath, relationship Relationship) : void from class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Move Method public testSmallGraph() : void from class org.neo4j.graphalgo.path.TestDijkstra to public testSmallGraph() : void from class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Move Method public testSmallGraphWithDefaults() : void from class org.neo4j.graphalgo.path.TestDijkstra to public testSmallGraphWithDefaults() : void from class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Move Method private createGraph(includeOnes boolean) : Relationship from class org.neo4j.graphalgo.path.TestDijkstra to private createGraph(includeOnes boolean) : Relationship from class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Rename Variable | 4 | ||
| Rename Variable algo : Dijkstra to finder : PathFinder in method public canGetMultiplePathsInASmallRoadNetwork() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Rename Variable algo : Dijkstra to finder : PathFinder in method public canGetPathsInTriangleGraph() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Rename Variable algo : Dijkstra to finder : PathFinder in method public canContinueGettingPathsByDiminishingCost() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Rename Variable algo : Dijkstra to finder : PathFinder in method public canGetMultiplePathsInTriangleGraph() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Move Attribute | 3 | ||
| Move Attribute private policy : BranchCollisionPolicy from class org.neo4j.graphdb.traversal.BranchCollisionPolicy.CollisionPolicyAdapter to private policy : BranchCollisionPolicy from class org.neo4j.graphdb.traversal.BranchCollisionPolicy.CollisionPolicyWrapper | From | To | |
| Move Attribute private stopAfterLowestCost : boolean from class org.neo4j.graphalgo.impl.path.Dijkstra to private stopAfterLowestCost : boolean from class org.neo4j.graphalgo.impl.path.DijkstraBidirectional.DijkstraBidirectionalPathExpander | From | To | |
| Move Attribute private stopAfterLowestCost : boolean from class org.neo4j.graphalgo.impl.path.Dijkstra to protected stopAfterLowestCost : boolean from class org.neo4j.graphalgo.impl.path.Dijkstra.DijkstraPathExpander | From | To | |
| Move And Rename Class | 2 | ||
| Move And Rename Class org.neo4j.graphalgo.impl.path.Dijkstra.SelectorFactory moved and renamed to org.neo4j.graphalgo.impl.util.DijkstraSelectorFactory | From | To | |
| Move And Rename Class org.neo4j.graphalgo.impl.util.BestFirstSelectorFactory.PathInterest moved and renamed to org.neo4j.graphalgo.impl.util.PathInterest | From | To | |
| Move Class | 2 | ||
| Move Class org.neo4j.graphalgo.impl.path.ShortestPath.MutableBoolean moved to org.neo4j.kernel.impl.util.MutableBoolean | From | To | |
| Move Class org.neo4j.graphalgo.impl.path.ShortestPath.MutableInteger moved to org.neo4j.kernel.impl.util.MutableInteger | From | To | |
| Change Variable Type | 4 | ||
| Change Variable Type algo : Dijkstra to finder : PathFinder in method public canGetMultiplePathsInASmallRoadNetwork() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Change Variable Type algo : Dijkstra to finder : PathFinder in method public canGetPathsInTriangleGraph() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Change Variable Type algo : Dijkstra to finder : PathFinder in method public canContinueGettingPathsByDiminishingCost() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Change Variable Type algo : Dijkstra to finder : PathFinder in method public canGetMultiplePathsInTriangleGraph() : void in class org.neo4j.graphalgo.path.DijkstraTest | From | To | |
| Extract Variable | 1 | ||
| Extract Variable costProp : Object in method public getCost(relationship Relationship, direction Direction) : Integer from class org.neo4j.graphalgo.impl.util.IntegerEvaluator | From | To | |
| Extract Method | 1 | ||
| Extract Method public assertPaths(paths Iterable<? extends Path>, pathDefs List<String>) : void extracted from public assertPaths(paths Iterable<? extends Path>, pathDefinitions String...) : void in class common.Neo4jAlgoTestCase | From | To | |
| Change Attribute Type | 1 | ||
| Change Attribute Type interest : PathInterest to interest : PathInterest<P> in class org.neo4j.graphalgo.impl.util.BestFirstSelectorFactory | From | To | |
| Split Attribute | 1 | ||
| Split Attribute stopAfterLowestCost : boolean to [interest : PathInterest<Double>, epsilon : double] in class org.neo4j.graphalgo.impl.path.Dijkstra | From | To |