double dist = calc.calcDist(tmpLat, tmpLon, queryLat, queryLon); if (circle == null || dist < calc.calcDist(circle.getLat(), circle.getLon(), queryLat, queryLon)) { res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); res.setQueryDistance(dist);
res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); foundDist = fromDist;
EdgeIteratorState eState = iter.detach(false); assertEquals(iter.toString(), eState.toString()); assertTrue(iter.next()); assertNotEquals(iter.toString(), eState.toString()); EdgeIteratorState eState2 = iter.detach(true); assertEquals(iter.getAdjNode(), eState2.getBaseNode()); assertEquals(iter.getBaseNode(), eState2.getAdjNode());
double dist = calc.calcDist(tmpLat, tmpLon, queryLat, queryLon); if (circle == null || dist < calc.calcDist(circle.getLat(), circle.getLon(), queryLat, queryLon)) { res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); res.setQueryDistance(dist);
double dist = calc.calcDist(tmpLat, tmpLon, queryLat, queryLon); if (circle == null || dist < calc.calcDist(circle.getLat(), circle.getLon(), queryLat, queryLon)) { res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); res.setQueryDistance(dist);
if (circle == null || dist < calc.calcDist(circle.getLat(), circle.getLon(), queryLat, queryLon)) res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); res.setQueryDistance(dist);
res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); foundDist = fromDist;
res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); foundDist = fromDist;
res.setClosestEdge(iter.detach(false)); res.setClosestNode(node); foundDist = fromDist;