congrats Icon
New! Tabnine Pro 14-day free trial
Start a free trial
Tabnine Logo
AllEdgesIterator
Code IndexAdd Tabnine to your IDE (free)

How to use
AllEdgesIterator
in
com.graphhopper.routing.util

Best Java code snippets using com.graphhopper.routing.util.AllEdgesIterator (Showing top 20 results out of 315)

origin: graphhopper/graphhopper

Circle circle = null;
AllEdgesIterator iter = graph.getAllEdges();
while (iter.next()) {
  if (!edgeFilter.accept(iter))
    continue;
      node = iter.getBaseNode();
    } else {
      node = iter.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);
origin: graphhopper/graphhopper

public static void printEdgeInfo(final Graph g, FlagEncoder encoder) {
  System.out.println("-- Graph nodes:" + g.getNodes() + " edges:" + g.getAllEdges().length() + " ---");
  AllEdgesIterator iter = g.getAllEdges();
  while (iter.next()) {
    String prefix = (iter instanceof AllCHEdgesIterator && ((AllCHEdgesIterator) iter).isShortcut()) ? "sc" : "  ";
    String fwdStr = iter.isForward(encoder) ? "fwd" : "   ";
    String bwdStr = iter.isBackward(encoder) ? "bwd" : "   ";
    System.out.println(prefix + " " + iter + " " + fwdStr + " " + bwdStr + " " + iter.getDistance());
  }
}
origin: graphhopper/graphhopper

/**
 * @return the specified toGraph which is now filled with data from fromGraph
 */
// TODO very similar to createSortedGraph -> use a 'int map(int)' interface
public static Graph copyTo(Graph fromGraph, Graph toGraph) {
  AllEdgesIterator eIter = fromGraph.getAllEdges();
  while (eIter.next()) {
    int base = eIter.getBaseNode();
    int adj = eIter.getAdjNode();
    eIter.copyPropertiesTo(toGraph.edge(base, adj));
  }
  NodeAccess fna = fromGraph.getNodeAccess();
  NodeAccess tna = toGraph.getNodeAccess();
  int nodes = fromGraph.getNodes();
  for (int node = 0; node < nodes; node++) {
    if (tna.is3D())
      tna.setNode(node, fna.getLatitude(node), fna.getLongitude(node), fna.getElevation(node));
    else
      tna.setNode(node, fna.getLatitude(node), fna.getLongitude(node));
  }
  return toGraph;
}
origin: graphhopper/graphhopper

void fillAllowedEdges(AllEdgesIterator iter, GHBitSet bs) {
  bs.clear();
  while (iter.next()) {
    bs.add(iter.getEdge());
  }
}
origin: graphhopper/graphhopper

private void interpolateElevationsOfTowerNodes() {
  final AllEdgesIterator edge = storage.getAllEdges();
  final GHBitSet visitedEdgeIds = new GHBitSetImpl(edge.length());
  final EdgeExplorer edgeExplorer = storage.createEdgeExplorer();
  while (edge.next()) {
    final int edgeId = edge.getEdge();
    if (isInterpolatableEdge(edge)) {
      if (!visitedEdgeIds.contains(edgeId)) {
        interpolateEdge(edge, visitedEdgeIds, edgeExplorer);
      }
    }
    visitedEdgeIds.add(edgeId);
  }
}
origin: graphhopper/graphhopper

/**
 * This method makes edges crossing the specified border inaccessible to split a bigger area into smaller subnetworks.
 * This is important for the world wide use case to limit the maximum distance and also to detect unreasonable routes faster.
 */
protected IntHashSet findBorderEdgeIds(SpatialRuleLookup ruleLookup) {
  AllEdgesIterator allEdgesIterator = graph.getAllEdges();
  NodeAccess nodeAccess = graph.getNodeAccess();
  IntHashSet inaccessible = new IntHashSet();
  while (allEdgesIterator.next()) {
    int adjNode = allEdgesIterator.getAdjNode();
    SpatialRule ruleAdj = ruleLookup.lookupRule(nodeAccess.getLatitude(adjNode), nodeAccess.getLongitude(adjNode));
    int baseNode = allEdgesIterator.getBaseNode();
    SpatialRule ruleBase = ruleLookup.lookupRule(nodeAccess.getLatitude(baseNode), nodeAccess.getLongitude(baseNode));
    if (ruleAdj != ruleBase) {
      inaccessible.add(allEdgesIterator.getEdge());
    }
  }
  return inaccessible;
}
origin: graphhopper/graphhopper

public static void printGraphForUnitTest(Graph g, FlagEncoder encoder, BBox bBox) {
  NodeAccess na = g.getNodeAccess();
  for (int node = 0; node < g.getNodes(); ++node) {
    if (bBox.contains(na.getLat(node), na.getLon(node))) {
      System.out.printf(Locale.ROOT, "na.setNode(%d, %f, %f);\n", node, na.getLat(node), na.getLon(node));
    }
  }
  AllEdgesIterator iter = g.getAllEdges();
  while (iter.next()) {
    if (bBox.contains(na.getLat(iter.getBaseNode()), na.getLon(iter.getBaseNode())) &&
        bBox.contains(na.getLat(iter.getAdjNode()), na.getLon(iter.getAdjNode()))) {
      printUnitTestEdge(encoder, iter);
    }
  }
}
origin: graphhopper/graphhopper

while (edge.next()) {
  if (fastPaint && rand.nextInt(30) > 1)
    continue;
  int nodeIndex = edge.getBaseNode();
  double lat = na.getLatitude(nodeIndex);
  double lon = na.getLongitude(nodeIndex);
  int nodeId = edge.getAdjNode();
  double lat2 = na.getLatitude(nodeId);
  double lon2 = na.getLongitude(nodeId);
  double speed = encoder.getSpeed(edge.getFlags());
  Color color;
  if (speed >= 120) {
  boolean fwd = encoder.isForward(edge.getFlags());
  boolean bwd = encoder.isBackward(edge.getFlags());
  float width = speed > 90 ? 1f : 0.8f;
  if (fwd && !bwd) {
origin: graphhopper/graphhopper

@Override
public int getEdges() {
  return getAllEdges().length();
}
origin: com.rgi-corp/graphhopper

public static void printEdgeInfo(final Graph g, FlagEncoder encoder) {
  System.out.println("-- Graph n:" + g.getNodes() + " e:" + g.getAllEdges().getMaxId() + " ---");
  AllEdgesIterator iter = g.getAllEdges();
  while (iter.next()) {
    String sc = "";
    if (iter instanceof AllCHEdgesIterator) {
      AllCHEdgesIterator aeSkip = (AllCHEdgesIterator) iter;
      sc = aeSkip.isShortcut() ? "sc" : "  ";
    }
    String fwdStr = iter.isForward(encoder) ? "fwd" : "   ";
    String bckStr = iter.isBackward(encoder) ? "bckwd" : "";
    System.out.println(sc + " " + iter + " " + fwdStr + " " + bckStr);
  }
}
origin: com.rgi-corp/graphhopper

private void interpolateElevationsOfTowerNodes() {
  final AllEdgesIterator edge = storage.getAllEdges();
  final GHBitSet visitedEdgeIds = new GHBitSetImpl(edge.getMaxId());
  final EdgeExplorer edgeExplorer = storage.createEdgeExplorer();
  while (edge.next()) {
    final int edgeId = edge.getEdge();
    if (isInterpolatableEdge(edge)) {
      if (!visitedEdgeIds.contains(edgeId)) {
        interpolateEdge(edge, visitedEdgeIds, edgeExplorer);
      }
    }
    visitedEdgeIds.add(edgeId);
  }
}
origin: graphhopper/graphhopper

while (iter.next()) {
  iter.setFlags(bikeEncoder.setAccess(iter.getFlags(), false, false));
origin: graphhopper/graphhopper

@Test
public void testBigDataEdge() {
  Directory dir = new RAMDirectory();
  GraphHopperStorage graph = new GraphHopperStorage(dir, encodingManager, false, new GraphExtension.NoOpExtension());
  graph.create(defaultSize);
  ((BaseGraph) graph.getGraph(Graph.class)).setEdgeCount(Integer.MAX_VALUE / 2);
  assertTrue(graph.getAllEdges().next());
  graph.close();
}
origin: com.rgi-corp/graphhopper

/**
 * This method makes edges crossing the specified border inaccessible to split a bigger area into smaller subnetworks.
 * This is important for the world wide use case to limit the maximum distance and also to detect unreasonable routes faster.
 */
protected IntHashSet findBorderEdgeIds(SpatialRuleLookup ruleLookup) {
  AllEdgesIterator allEdgesIterator = graph.getAllEdges();
  NodeAccess nodeAccess = graph.getNodeAccess();
  IntHashSet inaccessible = new IntHashSet();
  while (allEdgesIterator.next()) {
    int adjNode = allEdgesIterator.getAdjNode();
    SpatialRule ruleAdj = ruleLookup.lookupRule(nodeAccess.getLatitude(adjNode), nodeAccess.getLongitude(adjNode));
    int baseNode = allEdgesIterator.getBaseNode();
    SpatialRule ruleBase = ruleLookup.lookupRule(nodeAccess.getLatitude(baseNode), nodeAccess.getLongitude(baseNode));
    if (ruleAdj != ruleBase)
      inaccessible.add(allEdgesIterator.getEdge());
  }
  return inaccessible;
}
origin: com.graphhopper/graphhopper-core

public static void printGraphForUnitTest(Graph g, FlagEncoder encoder, BBox bBox) {
  NodeAccess na = g.getNodeAccess();
  for (int node = 0; node < g.getNodes(); ++node) {
    if (bBox.contains(na.getLat(node), na.getLon(node))) {
      System.out.printf(Locale.ROOT, "na.setNode(%d, %f, %f);\n", node, na.getLat(node), na.getLon(node));
    }
  }
  AllEdgesIterator iter = g.getAllEdges();
  while (iter.next()) {
    if (bBox.contains(na.getLat(iter.getBaseNode()), na.getLon(iter.getBaseNode())) &&
        bBox.contains(na.getLat(iter.getAdjNode()), na.getLon(iter.getAdjNode()))) {
      printUnitTestEdge(encoder, iter);
    }
  }
}
origin: graphhopper/graphhopper

@Override
public int getEdges() {
  return getAllEdges().length();
}
origin: com.graphhopper/graphhopper

public static void printEdgeInfo( final Graph g, FlagEncoder encoder )
{
  System.out.println("-- Graph n:" + g.getNodes() + " e:" + g.getAllEdges().getMaxId() + " ---");
  AllEdgesIterator iter = g.getAllEdges();
  while (iter.next())
  {
    String sc = "";
    if (iter instanceof AllCHEdgesIterator)
    {
      AllCHEdgesIterator aeSkip = (AllCHEdgesIterator) iter;
      sc = aeSkip.isShortcut() ? "sc" : "  ";
    }
    String fwdStr = iter.isForward(encoder) ? "fwd" : "   ";
    String bckStr = iter.isBackward(encoder) ? "bckwd" : "";
    System.out.println(sc + " " + iter + " " + fwdStr + " " + bckStr);
  }
}
origin: com.graphhopper/graphhopper-core

private void interpolateElevationsOfTowerNodes() {
  final AllEdgesIterator edge = storage.getAllEdges();
  final GHBitSet visitedEdgeIds = new GHBitSetImpl(edge.length());
  final EdgeExplorer edgeExplorer = storage.createEdgeExplorer();
  while (edge.next()) {
    final int edgeId = edge.getEdge();
    if (isInterpolatableEdge(edge)) {
      if (!visitedEdgeIds.contains(edgeId)) {
        interpolateEdge(edge, visitedEdgeIds, edgeExplorer);
      }
    }
    visitedEdgeIds.add(edgeId);
  }
}
origin: graphhopper/graphhopper

double defaultSpeed = encoder.getSpeed(GHUtility.getEdge(graph, 0, 1).getFlags());
AllEdgesIterator iter = graph.getAllEdges();
while (iter.next()) {
  long flags = GHUtility.getEdge(graph, 0, 1).getFlags();
  assertEquals(defaultSpeed, encoder.getSpeed(flags), .1);
origin: graphhopper/graphhopper

double foundDist = Double.MAX_VALUE;
AllEdgesIterator iter = graph.getAllEdges();
while (iter.next()) {
  if (!filter.accept(iter)) {
    continue;
      node = iter.getBaseNode();
    } else {
      node = iter.getAdjNode();
      res.setClosestEdge(iter.detach(false));
      res.setClosestNode(node);
      foundDist = fromDist;
      continue;
    int toNode = iter.getAdjNode();
    double toLat = nodeAccess.getLatitude(toNode);
    double toLon = nodeAccess.getLongitude(toNode);
com.graphhopper.routing.utilAllEdgesIterator

Most used methods

  • getAdjNode
  • getBaseNode
  • next
  • detach
  • length
  • copyPropertiesTo
  • getEdge
  • isBackward
  • isForward
  • getFlags
  • getMaxId
  • getDistance
  • getMaxId,
  • getDistance,
  • setFlags

Popular in Java

  • Making http requests using okhttp
  • onRequestPermissionsResult (Fragment)
  • getResourceAsStream (ClassLoader)
  • getContentResolver (Context)
  • RandomAccessFile (java.io)
    Allows reading from and writing to a file in a random-access manner. This is different from the uni-
  • BitSet (java.util)
    The BitSet class implements abit array [http://en.wikipedia.org/wiki/Bit_array]. Each element is eit
  • Date (java.util)
    A specific moment in time, with millisecond precision. Values typically come from System#currentTime
  • SortedMap (java.util)
    A map that has its keys ordered. The sorting is according to either the natural ordering of its keys
  • TimeZone (java.util)
    TimeZone represents a time zone offset, and also figures out daylight savings. Typically, you get a
  • Vector (java.util)
    Vector is an implementation of List, backed by an array and synchronized. All optional operations in
  • PhpStorm for WordPress
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now