minor size allocation fix in DijkstraBidirectionRef

karussell · karussell · commit fd58c17d3e71 · 2016-11-18T23:45:07.000+01:00
diff --git a/core/src/main/java/com/graphhopper/routing/AStarBidirection.java b/core/src/main/java/com/graphhopper/routing/AStarBidirection.java
@@ -18,7 +18,6 @@
 package com.graphhopper.routing;
 
 import com.graphhopper.routing.AStar.AStarEntry;
-import com.graphhopper.routing.util.FlagEncoder;
 import com.graphhopper.routing.util.TraversalMode;
 import com.graphhopper.routing.weighting.BeelineWeightApproximator;
 import com.graphhopper.routing.weighting.ConsistentWeightApproximator;
diff --git a/core/src/main/java/com/graphhopper/routing/Dijkstra.java b/core/src/main/java/com/graphhopper/routing/Dijkstra.java
@@ -17,7 +17,6 @@
  */
 package com.graphhopper.routing;
 
-import com.graphhopper.routing.util.FlagEncoder;
 import com.graphhopper.routing.util.TraversalMode;
 import com.graphhopper.routing.weighting.Weighting;
 import com.graphhopper.storage.Graph;
diff --git a/core/src/main/java/com/graphhopper/routing/DijkstraBidirectionRef.java b/core/src/main/java/com/graphhopper/routing/DijkstraBidirectionRef.java
@@ -56,7 +56,7 @@ protected void initCollections(int size) {
         openSetFrom = new PriorityQueue<SPTEntry>(size);
         bestWeightMapFrom = new TIntObjectHashMap<SPTEntry>(size);
 
-        openSetTo = new PriorityQueue<SPTEntry>(size / 10);
+        openSetTo = new PriorityQueue<SPTEntry>(size);
         bestWeightMapTo = new TIntObjectHashMap<SPTEntry>(size);
     }
 

Original file line number	Diff line number	Diff line change
`@@ -56,7 +56,7 @@ protected void initCollections(int size) {`
`56`	`56`	`openSetFrom = new PriorityQueue<SPTEntry>(size);`
`57`	`57`	`bestWeightMapFrom = new TIntObjectHashMap<SPTEntry>(size);`
`58`	`58`
`59`		`- openSetTo = new PriorityQueue<SPTEntry>(size / 10);`
	`59`	`+ openSetTo = new PriorityQueue<SPTEntry>(size);`
`60`	`60`	`bestWeightMapTo = new TIntObjectHashMap<SPTEntry>(size);`
`61`	`61`	`}`
`62`	`62`