if (check(tmpClosestNode, currNormedDist, 0, currEdge, QueryResult.Position.TOWER)) { if (currNormedDist <= equalNormedDelta) return false; tmpNormedDist = distCalc.calcNormalizedEdgeDistance(queryLat, queryLon, tmpLat, tmpLon, wayLat, wayLon); check(tmpClosestNode, tmpNormedDist, pointIndex, currEdge, pos); } else { if (pointIndex + 1 == len) { pos = QueryResult.Position.PILLAR; check(tmpClosestNode, tmpNormedDist, pointIndex + 1, currEdge, pos); tmpLon = wayLon; return getQueryDistance() > equalNormedDelta;
if (check(tmpClosestNode, currNormedDist, 0, currEdge, QueryResult.Position.TOWER)) check(tmpClosestNode, tmpNormedDist, pointIndex, currEdge, pos); } else pos = QueryResult.Position.PILLAR; check(tmpClosestNode, tmpNormedDist, pointIndex + 1, currEdge, pos); tmpLon = wayLon; return getQueryDistance() > equalNormedDelta;
if (check(tmpClosestNode, currNormedDist, 0, currEdge, QueryResult.Position.TOWER)) { if (currNormedDist <= equalNormedDelta) return false; tmpNormedDist = distCalc.calcNormalizedEdgeDistance(queryLat, queryLon, tmpLat, tmpLon, wayLat, wayLon); check(tmpClosestNode, tmpNormedDist, pointIndex, currEdge, pos); } else { if (pointIndex + 1 == len) { pos = QueryResult.Position.PILLAR; check(tmpClosestNode, tmpNormedDist, pointIndex + 1, currEdge, pos); tmpLon = wayLon; return getQueryDistance() > equalNormedDelta;
if (check(tmpClosestNode, currNormedDist, 0, currEdge, QueryResult.Position.TOWER)) { if (currNormedDist <= equalNormedDelta) return false; tmpNormedDist = distCalc.calcNormalizedEdgeDistance(queryLat, queryLon, tmpLat, tmpLon, wayLat, wayLon); check(tmpClosestNode, tmpNormedDist, pointIndex, currEdge, pos); } else { if (pointIndex + 1 == len) { pos = QueryResult.Position.PILLAR; check(tmpClosestNode, tmpNormedDist, pointIndex + 1, currEdge, pos); tmpLon = wayLon; return getQueryDistance() > equalNormedDelta;