Modifier and Type | Method and Description |
---|---|
void |
EdgeElevationInterpolator.gatherOuterAndInnerNodeIds(EdgeExplorer edgeExplorer,
EdgeIteratorState interpolatableEdge,
GHBitSet visitedEdgesIds,
com.carrotsearch.hppc.IntSet outerNodeIds,
GHIntHashSet innerNodeIds) |
protected boolean |
EdgeElevationInterpolator.isInterpolatableEdge(EdgeIteratorState edge) |
Modifier and Type | Method and Description |
---|---|
EdgeIteratorState |
Path.getFinalEdge()
Yields the final edge of the path
|
Modifier and Type | Method and Description |
---|---|
List<EdgeIteratorState> |
Path.calcEdges()
Returns the list of all edges.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
AbstractRoutingAlgorithm.accept(EdgeIteratorState iter,
int prevOrNextEdgeId) |
protected boolean |
AbstractNonCHBidirAlgo.accept(EdgeIteratorState iter,
int prevOrNextEdgeId) |
protected boolean |
AbstractNonCHBidirAlgo.accept(EdgeIteratorState edge,
SPTEntry currEdge,
boolean reverse) |
protected double |
AStarBidirection.calcWeight(EdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
protected double |
AbstractNonCHBidirAlgo.calcWeight(EdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
protected SPTEntry |
AStarBidirection.createEntry(EdgeIteratorState edge,
int incEdge,
double weight,
SPTEntry parent,
boolean reverse) |
protected SPTEntry |
DijkstraBidirectionRef.createEntry(EdgeIteratorState edge,
int incEdge,
double weight,
SPTEntry parent,
boolean reverse) |
protected abstract SPTEntry |
AbstractNonCHBidirAlgo.createEntry(EdgeIteratorState edge,
int incEdge,
double weight,
SPTEntry parent,
boolean reverse)
Creates a new entry of the shortest path tree (a
SPTEntry or one of its subclasses) during a dijkstra
expansion. |
protected int |
AbstractNonCHBidirAlgo.getOrigEdgeId(EdgeIteratorState edge,
boolean reverse) |
protected int |
AbstractNonCHBidirAlgo.getTraversalId(EdgeIteratorState edge,
int origEdgeId,
boolean reverse) |
void |
Path.EdgeVisitor.next(EdgeIteratorState edge,
int index,
int prevEdgeId) |
void |
InstructionsFromEdges.next(EdgeIteratorState edge,
int index,
int prevEdgeId) |
protected void |
Dijkstra.updateBestPath(EdgeIteratorState edgeState,
SPTEntry bestSPTEntry,
int traversalId) |
protected void |
AStar.updateBestPath(EdgeIteratorState edgeState,
SPTEntry bestSPTEntry,
int traversalId) |
protected void |
AStarBidirection.updateEntry(SPTEntry entry,
EdgeIteratorState edge,
int edgeId,
double weight,
SPTEntry parent,
boolean reverse) |
protected void |
AbstractNonCHBidirAlgo.updateEntry(SPTEntry entry,
EdgeIteratorState edge,
int edgeId,
double weight,
SPTEntry parent,
boolean reverse) |
Modifier and Type | Method and Description |
---|---|
void |
ShortcutUnpacker.Visitor.visit(EdgeIteratorState edge,
boolean reverse,
int prevOrNextEdgeId) |
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.copyPropertiesFrom(EdgeIteratorState fromEdge) |
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.getEdgeIteratorState(int origEdgeId,
int adjNode) |
EdgeIteratorState |
VirtualEdgeIteratorState.set(BooleanEncodedValue property,
boolean value) |
EdgeIteratorState |
VirtualEdgeIteratorState.set(DecimalEncodedValue property,
double value) |
<T extends Enum> |
VirtualEdgeIteratorState.set(EnumEncodedValue<T> property,
T value) |
EdgeIteratorState |
VirtualEdgeIteratorState.set(IntEncodedValue property,
int value) |
EdgeIteratorState |
VirtualEdgeIteratorState.setDistance(double dist) |
EdgeIteratorState |
VirtualEdgeIteratorState.setFlags(IntsRef flags) |
EdgeIteratorState |
VirtualEdgeIteratorState.setName(String name) |
EdgeIteratorState |
VirtualEdgeIteratorState.setReverse(BooleanEncodedValue property,
boolean value) |
EdgeIteratorState |
VirtualEdgeIteratorState.setReverse(DecimalEncodedValue property,
double value) |
<T extends Enum> |
VirtualEdgeIteratorState.setReverse(EnumEncodedValue<T> property,
T value) |
EdgeIteratorState |
VirtualEdgeIteratorState.setReverse(IntEncodedValue property,
int value) |
EdgeIteratorState |
VirtualEdgeIteratorState.setWayGeometry(PointList list) |
Modifier and Type | Method and Description |
---|---|
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.copyPropertiesFrom(EdgeIteratorState fromEdge) |
void |
VirtualEdgeIteratorState.setReverseEdge(EdgeIteratorState reverseEdge) |
Modifier and Type | Method and Description |
---|---|
static int |
EdgeBasedTarjanSCC.createEdgeKey(EdgeIteratorState edgeState,
boolean reverse) |
Modifier and Type | Interface and Description |
---|---|
interface |
AllCHEdgesIterator |
interface |
AllEdgesIterator |
Modifier and Type | Method and Description |
---|---|
boolean |
DefaultEdgeFilter.accept(EdgeIteratorState iter) |
boolean |
SnapPreventionEdgeFilter.accept(EdgeIteratorState edgeState) |
boolean |
LevelEdgeFilter.accept(EdgeIteratorState edgeIterState) |
boolean |
EdgeFilter.accept(EdgeIteratorState edgeState) |
boolean |
NameSimilarityEdgeFilter.accept(EdgeIteratorState iter) |
void |
AbstractFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge)
Second parsing step.
|
void |
EncodingManager.applyWayTags(ReaderWay way,
EdgeIteratorState edge) |
void |
HikeFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge) |
void |
Bike2WeightFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge) |
void |
WheelchairFlagEncoder.applyWayTags(ReaderWay way,
EdgeIteratorState edge)
Calculate slopes from elevation data and set speed according to that.
|
void |
MotorcycleFlagEncoder.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.
|
Modifier and Type | Method and Description |
---|---|
long |
Weighting.calcEdgeMillis(EdgeIteratorState edgeState,
boolean reverse)
This method calculates the time taken (in milli seconds) to travel along the specified edgeState.
|
long |
AbstractWeighting.calcEdgeMillis(EdgeIteratorState edgeState,
boolean reverse) |
long |
AbstractAdjustedWeighting.calcEdgeMillis(EdgeIteratorState edgeState,
boolean reverse) |
long |
FastestWeighting.calcEdgeMillis(EdgeIteratorState edgeState,
boolean reverse) |
long |
QueryGraphWeighting.calcEdgeMillis(EdgeIteratorState edgeState,
boolean reverse) |
double |
BlockAreaWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
ShortestWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
Weighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse)
This method calculates the weight of a given
EdgeIteratorState . |
abstract double |
AbstractWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse)
In most cases subclasses should only override this method to change the edge-weight.
|
double |
ShortFastestWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
AbstractAdjustedWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
PriorityWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
AvoidEdgesWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
CurvatureWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
FastestWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
double |
QueryGraphWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
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 |
---|---|
long |
CustomWeighting.calcEdgeMillis(EdgeIteratorState edgeState,
boolean reverse) |
double |
CustomWeighting.calcEdgeWeight(EdgeIteratorState edgeState,
boolean reverse) |
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 |
RoutingCHEdgeIteratorStateImpl.getBaseGraphEdgeState() |
EdgeIteratorState |
RoutingCHEdgeIteratorState.getBaseGraphEdgeState() |
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.intersects(EdgeIteratorState edgeState) |
Constructor and Description |
---|
RoutingCHEdgeIteratorStateImpl(EdgeIteratorState edgeState,
Weighting weighting) |
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) |
abstract void |
LocationIndex.EdgeVisitor.onEdge(EdgeIteratorState edge,
int nodeA,
int nodeB) |
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 |
EdgeIteratorState.copyPropertiesFrom(EdgeIteratorState e)
Copies the properties of the specified edge into this edge.
|
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.copyPropertiesFrom(EdgeIteratorState edge) |
static EdgeIteratorState |
GHUtility.createMockedEdgeIteratorState(double distance,
IntsRef flags) |
static EdgeIteratorState |
GHUtility.createMockedEdgeIteratorState(double distance,
IntsRef flags,
int base,
int adj,
int edge,
int origFirst,
int origLast) |
EdgeIteratorState |
EdgeIteratorState.detach(boolean reverse)
Clones this EdgeIteratorState.
|
static EdgeIteratorState |
GHUtility.getEdge(Graph graph,
int base,
int adj) |
EdgeIteratorState |
EdgeIteratorState.set(BooleanEncodedValue property,
boolean value) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.set(BooleanEncodedValue property,
boolean value) |
EdgeIteratorState |
EdgeIteratorState.set(DecimalEncodedValue property,
double value) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.set(DecimalEncodedValue property,
double value) |
<T extends Enum> |
EdgeIteratorState.set(EnumEncodedValue<T> property,
T value) |
<T extends Enum> |
GHUtility.DisabledEdgeIterator.set(EnumEncodedValue<T> property,
T value) |
EdgeIteratorState |
EdgeIteratorState.set(IntEncodedValue property,
int value) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.set(IntEncodedValue property,
int value) |
EdgeIteratorState |
EdgeIteratorState.setDistance(double dist) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setDistance(double dist) |
EdgeIteratorState |
EdgeIteratorState.setFlags(IntsRef edgeFlags)
Stores the specified edgeFlags down to the DataAccess
|
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setFlags(IntsRef flags) |
EdgeIteratorState |
EdgeIteratorState.setName(String name) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setName(String name) |
static EdgeIteratorState |
GHUtility.setProperties(EdgeIteratorState edge,
FlagEncoder encoder,
double averageSpeed,
boolean fwd,
boolean bwd) |
static EdgeIteratorState |
GHUtility.setProperties(EdgeIteratorState edge,
FlagEncoder encoder,
double fwdSpeed,
double bwdSpeed) |
EdgeIteratorState |
EdgeIteratorState.setReverse(BooleanEncodedValue property,
boolean value) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setReverse(BooleanEncodedValue property,
boolean value) |
EdgeIteratorState |
EdgeIteratorState.setReverse(DecimalEncodedValue property,
double value) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setReverse(DecimalEncodedValue property,
double value) |
<T extends Enum> |
EdgeIteratorState.setReverse(EnumEncodedValue<T> property,
T value) |
<T extends Enum> |
GHUtility.DisabledEdgeIterator.setReverse(EnumEncodedValue<T> property,
T value) |
EdgeIteratorState |
EdgeIteratorState.setReverse(IntEncodedValue property,
int value) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setReverse(IntEncodedValue property,
int value) |
EdgeIteratorState |
EdgeIteratorState.setWayGeometry(PointList list) |
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.setWayGeometry(PointList list) |
Modifier and Type | Method and Description |
---|---|
static long |
GHUtility.calcMillisWithTurnMillis(Weighting weighting,
EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId) |
static double |
GHUtility.calcWeightWithTurnWeight(Weighting weighting,
EdgeIteratorState edgeState,
boolean reverse,
int prevOrNextEdgeId)
Calculates the weight of a given edge like
Weighting.calcEdgeWeight(com.graphhopper.util.EdgeIteratorState, boolean) and adds the transition
cost (the turn weight, Weighting.calcTurnWeight(int, int, int) ) associated with transitioning from/to the edge with ID prevOrNextEdgeId. |
protected boolean |
XFirstSearch.checkAdjacent(EdgeIteratorState edge) |
EdgeIteratorState |
EdgeIteratorState.copyPropertiesFrom(EdgeIteratorState e)
Copies the properties of the specified edge into this edge.
|
EdgeIteratorState |
GHUtility.DisabledEdgeIterator.copyPropertiesFrom(EdgeIteratorState edge) |
static BBox |
GHUtility.createBBox(EdgeIteratorState edgeState) |
static EdgeIteratorState |
GHUtility.setProperties(EdgeIteratorState edge,
FlagEncoder encoder,
double averageSpeed,
boolean fwd,
boolean bwd) |
static EdgeIteratorState |
GHUtility.setProperties(EdgeIteratorState edge,
FlagEncoder encoder,
double fwdSpeed,
double bwdSpeed) |
Modifier and Type | Method and Description |
---|---|
boolean |
PathDetailsBuilder.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
EnumDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
AverageSpeedDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
DistanceDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
DecimalDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
EdgeIdDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
TimeDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
StreetNameDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
IntDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
boolean |
WeightDetails.isEdgeDifferentToLastEdge(EdgeIteratorState edge) |
void |
PathDetailsFromEdges.next(EdgeIteratorState edge,
int index,
int prevEdgeId) |
Copyright © 2012–2020. All rights reserved.