protected abstract class LocationIndexTree.XFirstSearchCheck extends BreadthFirstSearch
| Constructor and Description |
|---|
XFirstSearchCheck(double queryLat,
double queryLon,
GHBitSet checkBitset,
EdgeFilter edgeFilter) |
| Modifier and Type | Method and Description |
|---|---|
protected abstract boolean |
check(int node,
double normedDist,
int wayIndex,
EdgeIteratorState iter,
QueryResult.Position pos) |
protected boolean |
checkAdjacent(EdgeIteratorState currEdge) |
protected GHBitSet |
createBitSet()
Pick the BitSet implementation wisely.
|
protected abstract double |
getQueryDistance() |
protected boolean |
goFurther(int baseNode) |
startpublic XFirstSearchCheck(double queryLat,
double queryLon,
GHBitSet checkBitset,
EdgeFilter edgeFilter)
protected GHBitSet createBitSet()
XFirstSearchGHBitSetImpl only if we are sure you visit a large portion of the graph.
And if you choose GHTBitSet the initial capacity can be also important for performance.createBitSet in class XFirstSearchprotected boolean goFurther(int baseNode)
goFurther in class XFirstSearchprotected boolean checkAdjacent(EdgeIteratorState currEdge)
checkAdjacent in class XFirstSearchprotected abstract double getQueryDistance()
protected abstract boolean check(int node,
double normedDist,
int wayIndex,
EdgeIteratorState iter,
QueryResult.Position pos)
Copyright © 2012–2020. All rights reserved.