/
TurnWeighting.java
133 lines (114 loc) · 4.71 KB
/
TurnWeighting.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/*
* Licensed to GraphHopper GmbH under one or more contributor
* license agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* GraphHopper GmbH licenses this file to you under the Apache License,
* Version 2.0 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.graphhopper.routing.weighting;
import com.graphhopper.routing.util.FlagEncoder;
import com.graphhopper.routing.util.HintsMap;
import com.graphhopper.routing.util.TurnCostEncoder;
import com.graphhopper.storage.TurnCostExtension;
import com.graphhopper.util.EdgeIterator;
import com.graphhopper.util.EdgeIteratorState;
/**
* Provides methods to retrieve turn costs for a specific turn.
* <p>
*
* @author Karl Hübner
* @author Peter Karich
*/
public class TurnWeighting implements Weighting {
/**
* Encoder, which decodes the turn flags
*/
private final TurnCostEncoder turnCostEncoder;
private final TurnCostExtension turnCostExt;
private final Weighting superWeighting;
private double defaultUTurnCost = 40;
/**
* @param turnCostExt the turn cost storage to be used
*/
public TurnWeighting(Weighting superWeighting, TurnCostExtension turnCostExt) {
this.turnCostEncoder = superWeighting.getFlagEncoder();
this.superWeighting = superWeighting;
this.turnCostExt = turnCostExt;
if (turnCostExt == null)
throw new RuntimeException("No storage set to calculate turn weight");
}
/**
* Set the default cost for an u-turn in seconds. Default is 40s. Should be that high to avoid
* 'tricking' other turn costs or restrictions.
*/
public TurnWeighting setDefaultUTurnCost(double costInSeconds) {
defaultUTurnCost = costInSeconds;
return this;
}
@Override
public double getMinWeight(double distance) {
return superWeighting.getMinWeight(distance);
}
@Override
public double calcWeight(EdgeIteratorState edgeState, boolean reverse, int prevOrNextEdgeId) {
double weight = superWeighting.calcWeight(edgeState, reverse, prevOrNextEdgeId);
if (prevOrNextEdgeId == EdgeIterator.NO_EDGE)
return weight;
final int origEdgeId = reverse ? edgeState.getOrigEdgeLast() : edgeState.getOrigEdgeFirst();
double turnCosts = reverse ?
calcTurnWeight(origEdgeId, edgeState.getBaseNode(), prevOrNextEdgeId) :
calcTurnWeight(prevOrNextEdgeId, edgeState.getBaseNode(), origEdgeId);
if (turnCosts == 0 && origEdgeId == prevOrNextEdgeId)
return weight + defaultUTurnCost;
return weight + turnCosts;
}
@Override
public long calcMillis(EdgeIteratorState edgeState, boolean reverse, int prevOrNextEdgeId) {
long millis = superWeighting.calcMillis(edgeState, reverse, prevOrNextEdgeId);
if (prevOrNextEdgeId == EdgeIterator.NO_EDGE)
return millis;
// should we also separate weighting vs. time for turn? E.g. a fast but dangerous turn - is this common?
long turnCostsInSeconds;
if (reverse)
turnCostsInSeconds = (long) calcTurnWeight(edgeState.getEdge(), edgeState.getBaseNode(), prevOrNextEdgeId);
else
turnCostsInSeconds = (long) calcTurnWeight(prevOrNextEdgeId, edgeState.getBaseNode(), edgeState.getEdge());
return millis + 1000 * turnCostsInSeconds;
}
/**
* This method calculates the turn weight separately.
*/
public double calcTurnWeight(int edgeFrom, int nodeVia, int edgeTo) {
long turnFlags = turnCostExt.getTurnCostFlags(edgeFrom, nodeVia, edgeTo);
if (turnCostEncoder.isTurnRestricted(turnFlags))
return Double.POSITIVE_INFINITY;
return turnCostEncoder.getTurnCost(turnFlags);
}
@Override
public FlagEncoder getFlagEncoder() {
return superWeighting.getFlagEncoder();
}
@Override
public boolean matches(HintsMap weightingMap) {
// TODO without 'turn' in comparison
return superWeighting.matches(weightingMap);
}
@Override
public String toString() {
return "turn|" + superWeighting.toString();
}
@Override
public String getName() {
return "turn|" + superWeighting.getName();
}
}