void addNode(final int nodeA, final int nodeB, final double lat1, final double lon1, final double lat2, final double lon2) { PointEmitter pointEmitter = new PointEmitter() { @Override public void set(double lat, double lon) { long key = keyAlgo.encode(lat, lon); long keyPart = createReverseKey(key); // no need to feed both nodes as we search neighbors in fillIDs addNode(root, nodeA, 0, keyPart, key); } }; if (!distCalc.isCrossBoundary(lon1, lon2)) { BresenhamLine.calcPoints(lat1, lon1, lat2, lon2, pointEmitter, graph.getBounds().minLat, graph.getBounds().minLon, deltaLat, deltaLon); } }
if (pointList.is3D()) { ele = pointList.getElevation(i); if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc3D.calcDist(prevLat, prevLon, prevEle, lat, lon, ele); prevEle = ele; } else if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc.calcDist(prevLat, prevLon, lat, lon);
double wayLon = pointList.getLongitude(pointIndex); QueryResult.Position pos = QueryResult.Position.EDGE; if (distCalc.isCrossBoundary(tmpLon, wayLon)) { tmpLat = wayLat; tmpLon = wayLon;
void addNode(final int nodeA, final int nodeB, final double lat1, final double lon1, final double lat2, final double lon2) { PointEmitter pointEmitter = new PointEmitter() { @Override public void set(double lat, double lon) { long key = keyAlgo.encode(lat, lon); long keyPart = createReverseKey(key); // no need to feed both nodes as we search neighbors in fillIDs addNode(root, nodeA, 0, keyPart, key); } }; if (!distCalc.isCrossBoundary(lon1, lon2)) { BresenhamLine.calcPoints(lat1, lon1, lat2, lon2, pointEmitter, graph.getBounds().minLat, graph.getBounds().minLon, deltaLat, deltaLon); } }
void addNode(final int nodeA, final int nodeB, final double lat1, final double lon1, final double lat2, final double lon2) { PointEmitter pointEmitter = new PointEmitter() { @Override public void set(double lat, double lon) { long key = keyAlgo.encode(lat, lon); long keyPart = createReverseKey(key); // no need to feed both nodes as we search neighbors in fillIDs addNode(root, nodeA, 0, keyPart, key); } }; if (!distCalc.isCrossBoundary(lon1, lon2)) { BresenhamLine.calcPoints(lat1, lon1, lat2, lon2, pointEmitter, graph.getBounds().minLat, graph.getBounds().minLon, deltaLat, deltaLon); } }
void addNode( final int nodeA, final int nodeB, final double lat1, final double lon1, final double lat2, final double lon2 ) { PointEmitter pointEmitter = new PointEmitter() { @Override public void set( double lat, double lon ) { long key = keyAlgo.encode(lat, lon); long keyPart = createReverseKey(key); // no need to feed both nodes as we search neighbors in fillIDs addNode(root, nodeA, 0, keyPart, key); } }; if (!distCalc.isCrossBoundary(lon1, lon2)) { BresenhamLine.calcPoints(lat1, lon1, lat2, lon2, pointEmitter, graph.getBounds().minLat, graph.getBounds().minLon, deltaLat, deltaLon); } }
if (pointList.is3D()) { ele = pointList.getElevation(i); if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc3D.calcDist(prevLat, prevLon, prevEle, lat, lon, ele); prevEle = ele; } else if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc.calcDist(prevLat, prevLon, lat, lon);
if (pointList.is3D()) { ele = pointList.getElevation(i); if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc3D.calcDist(prevLat, prevLon, prevEle, lat, lon, ele); prevEle = ele; } else if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc.calcDist(prevLat, prevLon, lat, lon);
if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc3D.calcDist(prevLat, prevLon, prevEle, lat, lon, ele); prevEle = ele; } else if (!distCalc.isCrossBoundary(lon, prevLon)) towerNodeDistance += distCalc.calcDist(prevLat, prevLon, lat, lon);
double wayLon = pointList.getLongitude(pointIndex); QueryResult.Position pos = QueryResult.Position.EDGE; if (distCalc.isCrossBoundary(tmpLon, wayLon))
double wayLon = pointList.getLongitude(pointIndex); QueryResult.Position pos = QueryResult.Position.EDGE; if (distCalc.isCrossBoundary(tmpLon, wayLon)) { tmpLat = wayLat; tmpLon = wayLon;
double wayLon = pointList.getLongitude(pointIndex); QueryResult.Position pos = QueryResult.Position.EDGE; if (distCalc.isCrossBoundary(tmpLon, wayLon)) { tmpLat = wayLat; tmpLon = wayLon;