private void printLocationIndexQuery(Graph g, final LocationIndex idx, int count) { count *= 2; final BBox bbox = g.getBounds(); final double latDelta = bbox.maxLat - bbox.minLat; final double lonDelta = bbox.maxLon - bbox.minLon; final Random rand = new Random(seed); MiniPerfTest miniPerf = new MiniPerfTest() { @Override public int doCalc(boolean warmup, int run) { double lat = rand.nextDouble() * latDelta + bbox.minLat; double lon = rand.nextDouble() * lonDelta + bbox.minLon; int val = idx.findClosest(lat, lon, EdgeFilter.ALL_EDGES).getClosestNode(); // if (!warmup && val >= 0) // list.add(val); return val; } }.setIterations(count).start(); print("location_index", miniPerf); }
}.setIterations(count).start();
return GHUtility.count(chExplorer.setBaseNode(nodeId)); }.setIterations(count).start(); print("unit_testsCH.level_edge_state_next", miniPerf); }.setIterations(count).start(); print("unit_testsCH.get_weight", miniPerf); return GHUtility.count(outExplorer.setBaseNode(nodeId)); }.setIterations(count).start(); print("unit_tests" + description + ".out_edge_state_next", miniPerf); return GHUtility.count(allExplorer.setBaseNode(nodeId)); }.setIterations(count).start(); print("unit_tests" + description + ".all_edge_state_next", miniPerf); }.setIterations(count).start(); print("unit_tests" + description + ".get_edge_state", miniPerf);
/** * Test the performance of finding candidate points for the index (which is run for every GPX * entry). * */ private void printLocationIndexMatchQuery(final LocationIndexTree idx) { final double latDelta = bbox.maxLat - bbox.minLat; final double lonDelta = bbox.maxLon - bbox.minLon; final Random rand = new Random(seed); MiniPerfTest miniPerf = new MiniPerfTest() { @Override public int doCalc(boolean warmup, int run) { double lat = rand.nextDouble() * latDelta + bbox.minLat; double lon = rand.nextDouble() * lonDelta + bbox.minLon; return idx.findNClosest(lat, lon, EdgeFilter.ALL_EDGES, rand.nextDouble() * 500).size(); } }.setIterations(count).start(); print("location_index_match", miniPerf); }
}.setIterations(count).start(); print("map_match", miniPerf);