| Modifier and Type | Field and Description |
|---|---|
List<EdgeIteratorState> |
Trip.Leg.edges |
| Constructor and Description |
|---|
Leg(String type,
String departureLocation,
Date departureTime,
List<EdgeIteratorState> edges,
com.vividsolutions.jts.geom.Geometry geometry,
double distance,
Date arrivalTime) |
PtLeg(String feedId,
boolean isInSameVehicleAsPrevious,
String tripId,
String routeId,
List<EdgeIteratorState> edges,
Date departureTime,
List<Trip.Stop> stops,
double distance,
long travelTime,
Date arrivalTime,
com.vividsolutions.jts.geom.Geometry geometry) |
WalkLeg(String departureLocation,
Date departureTime,
List<EdgeIteratorState> edges,
com.vividsolutions.jts.geom.Geometry geometry,
double distance,
InstructionList instructions,
Date arrivalTime) |
| Modifier and Type | Method and Description |
|---|---|
void |
AbstractEdgeElevationInterpolator.gatherOuterAndInnerNodeIds(EdgeExplorer edgeExplorer,
EdgeIteratorState interpolatableEdge,
GHBitSet visitedEdgesIds,
com.carrotsearch.hppc.IntSet outerNodeIds,
GHIntHashSet innerNodeIds) |
protected abstract boolean |
AbstractEdgeElevationInterpolator.isInterpolatableEdge(EdgeIteratorState edge) |
protected boolean |
BridgeElevationInterpolator.isInterpolatableEdge(EdgeIteratorState edge) |
protected boolean |
TunnelElevationInterpolator.isInterpolatableEdge(EdgeIteratorState edge) |
| Modifier and Type | Class and Description |
|---|---|
class |
VirtualEdgeIteratorState
Creates an edge state decoupled from a graph where nodes, pointList, etc are kept in memory.
|
| Modifier and Type | Method and Description |
|---|---|
EdgeIteratorState |
VirtualEdgeIteratorState.copyPropertiesTo(EdgeIteratorState edge) |
EdgeIteratorState |
VirtualEdgeIteratorState.detach(boolean reverse) |
EdgeIteratorState |
QueryGraph.edge(int a,
int b) |
EdgeIteratorState |
QueryGraph.edge(int a,
int b,
double distance,
boolean bothDirections) |
EdgeIteratorState |
QueryGraph.edge(int a,
int b,
double distance,
int flags) |
EdgeIteratorState |
QueryGraph.getEdgeIteratorState(int origEdgeId,
int adjNode) |
EdgeIteratorState |
Path.getFinalEdge()
Yields the final edge of the path
|
EdgeIteratorState |
QueryGraph.getOriginalEdgeFromVirtNode(int nodeId) |
EdgeIteratorState |
VirtualEdgeIteratorState.setAdditionalField(int value) |
EdgeIteratorState |
VirtualEdgeIteratorState.setDistance(double dist) |
EdgeIteratorState |
VirtualEdgeIteratorState.setFlags(long flags) |
EdgeIteratorState |
VirtualEdgeIteratorState.setName(String name) |
EdgeIteratorState |
VirtualEdgeIteratorState.setWayGeometry(PointList list) |
| Modifier and Type | Method and Description |
|---|---|
List<EdgeIteratorState> |
Path.calcEdges()
Returns the list of all edges.
|
Set<EdgeIteratorState> |
QueryGraph.getUnfavoredVirtualEdges()
Returns all virtual edges that have been unfavored via
QueryGraph.enforceHeading(int, double, boolean) or QueryGraph.unfavorVirtualEdgePair(int, int). |
| Modifier and Type | Method and Description |
|---|---|
EdgeIteratorState |
VirtualEdgeIteratorState.copyPropertiesTo(EdgeIteratorState edge) |
void |
InstructionsFromEdges.next(EdgeIteratorState edge,
int index,
int prevEdgeId) |
void |
Path.EdgeVisitor.next(EdgeIteratorState edge,
int index,
int prevEdgeId) |
void |
VirtualEdgeIteratorState.setReverseEdge(EdgeIteratorState reverseEdge) |
void |
AStarBidirection.updateBestPath(EdgeIteratorState edgeState,
AStar.AStarEntry entryCurrent,
int currLoc) |
protected void |
AbstractRoutingAlgorithm.updateBestPath(EdgeIteratorState edgeState,
SPTEntry bestSPTEntry,
int traversalId) |
protected void |
DijkstraBidirectionRef.updateBestPath(EdgeIteratorState edgeState,
SPTEntry entryCurrent,
int traversalId) |
| Modifier and Type | Method and Description |
|---|---|
long |
PreparationWeighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
PreparationWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
AllCHEdgesIterator |
interface |
AllEdgesIterator |
| Modifier and Type | Method and Description |
|---|---|
boolean |
EdgeFilter.accept(EdgeIteratorState edgeState) |
boolean |
DefaultEdgeFilter.accept(EdgeIteratorState iter) |
boolean |
LevelEdgeFilter.accept(EdgeIteratorState edgeIterState) |
boolean |
NameSimilarityEdgeFilter.accept(EdgeIteratorState iter) |
void |
AbstractFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge)
Second parsing step.
|
void |
MotorcycleFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge) |
void |
Bike2WeightFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge) |
void |
EncodingManager.applyWayTags(ReaderWay way,
EdgeIteratorState edge) |
int |
TraversalMode.createTraversalId(EdgeIteratorState iterState,
boolean reverse)
Returns the identifier to access the map of the shortest path tree according to the traversal
mode.
|
double |
DataFlagEncoder.getHeight(EdgeIteratorState edge) |
int |
DataFlagEncoder.getHighway(EdgeIteratorState edge) |
String |
DataFlagEncoder.getHighwayAsString(EdgeIteratorState edge)
Do not use within weighting as this is suboptimal from performance point of view.
|
double |
DataFlagEncoder.getMaxspeed(EdgeIteratorState edge,
int accessType,
boolean reverse) |
double |
DataFlagEncoder.WeightingConfig.getSpeed(EdgeIteratorState edgeState) |
int |
DataFlagEncoder.getSurface(EdgeIteratorState edge) |
String |
DataFlagEncoder.getSurfaceAsString(EdgeIteratorState edge) |
int |
DataFlagEncoder.getTransportMode(EdgeIteratorState edge) |
String |
DataFlagEncoder.getTransportModeAsString(EdgeIteratorState edge) |
double |
DataFlagEncoder.getWeight(EdgeIteratorState edge) |
double |
DataFlagEncoder.getWidth(EdgeIteratorState edge) |
boolean |
DataFlagEncoder.isBackward(EdgeIteratorState edge,
int accessType) |
boolean |
DataFlagEncoder.isForward(EdgeIteratorState edge,
int accessType) |
boolean |
DataFlagEncoder.isRoundabout(EdgeIteratorState edge) |
boolean |
DataFlagEncoder.isTransportModeBridge(EdgeIteratorState edge) |
boolean |
DataFlagEncoder.isTransportModeTunnel(EdgeIteratorState edge) |
| Modifier and Type | Method and Description |
|---|---|
long |
GenericWeighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
long |
AbstractAdjustedWeighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
long |
Weighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId)
This method calculates the time taken (in milli seconds) for the specified edgeState and
optionally include the turn costs (in seconds) of the previous (or next) edgeId via
prevOrNextEdgeId.
|
long |
TurnWeighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
long |
AbstractWeighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
long |
FastestWeighting.calcMillis(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
CurvatureWeighting.calcWeight(EdgeIteratorState edge,
boolean reverse,
int prevOrNextEdgeId) |
double |
GenericWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
PriorityWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
Weighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId)
This method calculates the weighting a certain edgeState should be associated.
|
double |
TurnWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
AvoidEdgesWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
ShortFastestWeighting.calcWeight(EdgeIteratorState edge,
boolean reverse,
int prevOrNextEdgeId) |
double |
BlockAreaWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
ShortestWeighting.calcWeight(EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
double |
FastestWeighting.calcWeight(EdgeIteratorState edge,
boolean reverse,
int prevOrNextEdgeId) |
protected double |
CurvatureWeighting.getRoadSpeed(EdgeIteratorState edge,
boolean reverse) |
| Modifier and Type | Method and Description |
|---|---|
void |
AvoidEdgesWeighting.addEdges(Collection<EdgeIteratorState> edges)
This method adds the specified path to this weighting which should be penalized in the
calcWeight method.
|
| Modifier and Type | Method and Description |
|---|---|
EdgeIteratorState |
GraphHopperStorage.edge(int a,
int b) |
EdgeIteratorState |
Graph.edge(int a,
int b)
Creates an edge between the nodes a and b.
|
EdgeIteratorState |
GraphHopperStorage.edge(int a,
int b,
double distance,
boolean bothDirections) |
EdgeIteratorState |
CHGraphImpl.edge(int a,
int b,
double distance,
boolean bothDirections) |
EdgeIteratorState |
Graph.edge(int a,
int b,
double distance,
boolean bothDirections)
Use edge(a,b).setDistance().setFlags instead
|
EdgeIteratorState |
GraphHopperStorage.getEdgeIteratorState(int edgeId,
int adjNode) |
EdgeIteratorState |
Graph.getEdgeIteratorState(int edgeId,
int adjNode)
Returns a wrapper over the specified edgeId.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
GraphEdgeIdFinder.BlockArea.contains(EdgeIteratorState edgeState) |
void |
CHGraphImpl.disconnect(CHEdgeExplorer explorer,
EdgeIteratorState edgeState)
Disconnects the edges (higher to lower node) via the specified edgeState pointing from lower to
higher node.
|
| Modifier and Type | Method and Description |
|---|---|
EdgeIteratorState |
QueryResult.getClosestEdge() |
| Modifier and Type | Method and Description |
|---|---|
protected abstract boolean |
LocationIndexTree.XFirstSearchCheck.check(int node,
double normedDist,
int wayIndex,
EdgeIteratorState iter,
QueryResult.Position pos) |
protected boolean |
LocationIndexTree.XFirstSearchCheck.checkAdjacent(EdgeIteratorState currEdge) |
void |
QueryResult.setClosestEdge(EdgeIteratorState detach) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
CHEdgeIterator
Support for CH edges
|
interface |
CHEdgeIteratorState
The state returned from the EdgeIterator of a CHGraph
|
interface |
EdgeIterator
Iterates through all edges of one node.
|
| Modifier and Type | Class and Description |
|---|---|
static class |
GHUtility.DisabledEdgeIterator
This edge iterator can be used in tests to mock specific iterator behaviour via overloading
certain methods.
|
| Modifier and Type | Method and Description |
|---|---|
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.copyPropertiesTo(EdgeIteratorState edge) |
EdgeIteratorState |
EdgeIteratorState.copyPropertiesTo(EdgeIteratorState e)
Copies the properties of this edge into the specified edge.
|
static EdgeIteratorState |
GHUtility.createMockedEdgeIteratorState(double distance,
long flags) |
EdgeIteratorState |
EdgeIteratorState.detach(boolean reverse)
Clones this EdgeIteratorState.
|
static EdgeIteratorState |
GHUtility.getEdge(Graph graph,
int base,
int adj) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setAdditionalField(int value) |
EdgeIteratorState |
EdgeIteratorState.setAdditionalField(int value)
Updates the additional field value for this edge
|
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setDistance(double dist) |
EdgeIteratorState |
EdgeIteratorState.setDistance(double dist) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setFlags(long flags) |
EdgeIteratorState |
EdgeIteratorState.setFlags(long flags) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setName(String name) |
EdgeIteratorState |
EdgeIteratorState.setName(String name) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setWayGeometry(PointList list) |
EdgeIteratorState |
EdgeIteratorState.setWayGeometry(PointList list) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
XFirstSearch.checkAdjacent(EdgeIteratorState edge) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.copyPropertiesTo(EdgeIteratorState edge) |
EdgeIteratorState |
EdgeIteratorState.copyPropertiesTo(EdgeIteratorState e)
Copies the properties of this edge into the specified edge.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
TimeDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
AverageSpeedDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
StreetNameDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
EdgeIdDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
PathDetailsBuilder.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
void |
PathDetailsFromEdges.next(EdgeIteratorState edge,
int index,
int prevEdgeId) |
Copyright © 2012–2017. All rights reserved.