热门标签 | HotTags
当前位置:  开发笔记 > 编程语言 > 正文

com.graphhopper.storage.index.QueryResult.setClosestEdge()方法的使用及代码示例

本文整理了Java中com.graphhopper.storage.index.QueryResult.setClosestEdge方法的一些代码示例,展示了

本文整理了Java中com.graphhopper.storage.index.QueryResult.setClosestEdge方法的一些代码示例,展示了QueryResult.setClosestEdge的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。QueryResult.setClosestEdge方法的具体详情如下:
包路径:com.graphhopper.storage.index.QueryResult
类名称:QueryResult
方法名:setClosestEdge

QueryResult.setClosestEdge介绍

暂无

代码示例

代码示例来源:origin: graphhopper/graphhopper

public QueryResult createLocationResult(double lat, double lon,
EdgeIteratorState edge, int wayIndex, QueryResult.Position pos) {
if (edge == null)
throw new IllegalStateException("Specify edge != null");
QueryResult tmp = new QueryResult(lat, lon);
tmp.setClosestEdge(edge);
tmp.setWayIndex(wayIndex);
tmp.setSnappedPosition(pos);
tmp.calcSnappedPoint(new DistanceCalcEarth());
return tmp;
}

代码示例来源:origin: graphhopper/graphhopper

QueryResult createQR(double lat, double lon, int wayIndex, EdgeIteratorState edge) {
QueryResult res = new QueryResult(lat, lon);
res.setClosestEdge(edge);
res.setWayIndex(wayIndex);
res.setSnappedPosition(QueryResult.Position.EDGE);
res.calcSnappedPoint(Helper.DIST_PLANE);
return res;
}

代码示例来源:origin: graphhopper/graphhopper

private QueryResult fakeEdgeQueryResult(EdgeIteratorState edge, double lat, double lon, int wayIndex) {
QueryResult qr = new QueryResult(lat, lon);
qr.setClosestEdge(edge);
qr.setWayIndex(wayIndex);
qr.setSnappedPosition(EDGE);
qr.calcSnappedPoint(new DistanceCalc2D());
return qr;
}

代码示例来源:origin: graphhopper/graphhopper

closestEdge = closestEdge.detach(true);
PointList fullPL = closestEdge.fetchWayGeometry(3);
res.setClosestEdge(closestEdge);
if (res.getSnappedPosition() == QueryResult.Position.PILLAR)

代码示例来源:origin: graphhopper/graphhopper

res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
foundDist = fromDist;
res.setQueryDistance(distEdge);
res.setClosestNode(node);
res.setClosestEdge(iter);
if (fromDist > calc.calcDist(toLat, toLon, queryLat, queryLon))
res.setClosestNode(toNode);

代码示例来源:origin: graphhopper/graphhopper

double dist = calc.calcDist(tmpLat, tmpLon, queryLat, queryLon);
if (circle == null || dist res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
res.setQueryDistance(dist);

代码示例来源:origin: graphhopper/graphhopper

/**
* Creates query result on edge (node1-node2) very close to node1.
*/
QueryResult newQR(Graph graph, int node1, int node2) {
EdgeIteratorState edge = GHUtility.getEdge(graph, node1, node2);
if (edge == null)
throw new IllegalStateException("edge not found? " + node1 + "-" + node2);
NodeAccess na = graph.getNodeAccess();
double lat = na.getLatitude(edge.getBaseNode());
double lon = na.getLongitude(edge.getBaseNode());
double latAdj = na.getLatitude(edge.getAdjNode());
double lOnAdj= na.getLongitude(edge.getAdjNode());
// calculate query point near the base node but not directly on it!
QueryResult res = new QueryResult(lat + (latAdj - lat) * .1, lon + (lonAdj - lon) * .1);
res.setClosestNode(edge.getBaseNode());
res.setClosestEdge(edge);
res.setWayIndex(0);
res.setSnappedPosition(QueryResult.Position.EDGE);
res.calcSnappedPoint(distCalc);
return res;
}

代码示例来源:origin: graphhopper/graphhopper

qr.setClosestEdge(edge);
qr.setWayIndex(1);
qr.calcSnappedPoint(new DistanceCalc2D());

代码示例来源:origin: graphhopper/graphhopper

@Test
public void testUseMeanElevation() {
g.close();
g = new GraphHopperStorage(new RAMDirectory(), encodingManager, true, new GraphExtension.NoOpExtension()).create(100);
NodeAccess na = g.getNodeAccess();
na.setNode(0, 0, 0, 0);
na.setNode(1, 0, 0.0001, 20);
EdgeIteratorState edge = g.edge(0, 1);
EdgeIteratorState edgeReverse = edge.detach(true);
DistanceCalc2D distCalc = new DistanceCalc2D();
QueryResult qr = new QueryResult(0, 0.00005);
qr.setClosestEdge(edge);
qr.setWayIndex(0);
qr.setSnappedPosition(EDGE);
qr.calcSnappedPoint(distCalc);
assertEquals(10, qr.getSnappedPoint().getEle(), 1e-1);
qr = new QueryResult(0, 0.00005);
qr.setClosestEdge(edgeReverse);
qr.setWayIndex(0);
qr.setSnappedPosition(EDGE);
qr.calcSnappedPoint(distCalc);
assertEquals(10, qr.getSnappedPoint().getEle(), 1e-1);
}

代码示例来源:origin: graphhopper/graphhopper

@Test
public void testLoopStreet_Issue151() {
// do query at x should result in ignoring only the bottom edge 1-3 not the upper One=> getNeighbors are 0, 5, 3 and not only 0, 5
//
// 0--1--3--4
// | |
// x---
//
g.edge(0, 1, 10, true);
g.edge(1, 3, 10, true);
g.edge(3, 4, 10, true);
EdgeIteratorState edge = g.edge(1, 3, 20, true).setWayGeometry(Helper.createPointList(-0.001, 0.001, -0.001, 0.002));
AbstractRoutingAlgorithmTester.updateDistancesFor(g, 0, 0, 0);
AbstractRoutingAlgorithmTester.updateDistancesFor(g, 1, 0, 0.001);
AbstractRoutingAlgorithmTester.updateDistancesFor(g, 3, 0, 0.002);
AbstractRoutingAlgorithmTester.updateDistancesFor(g, 4, 0, 0.003);
QueryResult qr = new QueryResult(-0.0005, 0.001);
qr.setClosestEdge(edge);
qr.setWayIndex(1);
qr.calcSnappedPoint(new DistanceCalc2D());
QueryGraph qg = new QueryGraph(g);
qg.lookup(Arrays.asList(qr));
EdgeExplorer ee = qg.createEdgeExplorer();
assertEquals(GHUtility.asSet(0, 5, 3), GHUtility.getNeighbors(ee.setBaseNode(1)));
}

代码示例来源:origin: com.graphhopper/graphhopper-map-matching-core

vqr.setWayIndex(qr.getWayIndex());
vqr.setSnappedPosition(qr.getSnappedPosition());
vqr.setClosestEdge(qr.getClosestEdge());
vqr.calcSnappedPoint(distanceCalc);
GPXExtension candidate = new GPXExtension(gpxEntry, vqr, incomingVirtualEdge,

代码示例来源:origin: graphhopper/map-matching

vqr.setWayIndex(qr.getWayIndex());
vqr.setSnappedPosition(qr.getSnappedPosition());
vqr.setClosestEdge(qr.getClosestEdge());
vqr.calcSnappedPoint(distanceCalc);
GPXExtension candidate = new GPXExtension(gpxEntry, vqr, incomingVirtualEdge,

代码示例来源:origin: com.graphhopper/graphhopper-core

closestEdge = closestEdge.detach(true);
PointList fullPL = closestEdge.fetchWayGeometry(3);
res.setClosestEdge(closestEdge);
if (res.getSnappedPosition() == QueryResult.Position.PILLAR)

代码示例来源:origin: com.rgi-corp/graphhopper

closestEdge = closestEdge.detach(true);
PointList fullPL = closestEdge.fetchWayGeometry(3);
res.setClosestEdge(closestEdge);
if (res.getSnappedPosition() == QueryResult.Position.PILLAR)

代码示例来源:origin: com.graphhopper/graphhopper-core

res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
foundDist = fromDist;
res.setQueryDistance(distEdge);
res.setClosestNode(node);
res.setClosestEdge(iter);
if (fromDist > calc.calcDist(toLat, toLon, queryLat, queryLon))
res.setClosestNode(toNode);

代码示例来源:origin: com.rgi-corp/graphhopper

res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
foundDist = fromDist;
res.setQueryDistance(distEdge);
res.setClosestNode(node);
res.setClosestEdge(iter);
if (fromDist > calc.calcDist(toLat, toLon, queryLat, queryLon))
res.setClosestNode(toNode);

代码示例来源:origin: com.graphhopper/graphhopper

res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
foundDist = fromDist;
res.setClosestEdge(iter);
if (fromDist > calc.calcDist(toLat, toLon, queryLat, queryLon))
res.setClosestNode(toNode);

代码示例来源:origin: com.rgi-corp/graphhopper

double dist = calc.calcDist(tmpLat, tmpLon, queryLat, queryLon);
if (circle == null || dist res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
res.setQueryDistance(dist);

代码示例来源:origin: com.graphhopper/graphhopper-core

double dist = calc.calcDist(tmpLat, tmpLon, queryLat, queryLon);
if (circle == null || dist res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
res.setQueryDistance(dist);

代码示例来源:origin: com.graphhopper/graphhopper

if (circle == null || dist res.setClosestEdge(iter.detach(false));
res.setClosestNode(node);
res.setQueryDistance(dist);

推荐阅读
author-avatar
妩媚的谢染小妃
这个家伙很懒,什么也没留下!
PHP1.CN | 中国最专业的PHP中文社区 | DevBox开发工具箱 | json解析格式化 |PHP资讯 | PHP教程 | 数据库技术 | 服务器技术 | 前端开发技术 | PHP框架 | 开发工具 | 在线工具
Copyright © 1998 - 2020 PHP1.CN. All Rights Reserved | 京公网安备 11010802041100号 | 京ICP备19059560号-4 | PHP1.CN 第一PHP社区 版权所有