| | | 1 | | using System; |
| | | 2 | | using System.Collections.Generic; |
| | | 3 | | using System.Linq; |
| | | 4 | | using Itinero.Network; |
| | | 5 | | using Itinero.Network.Enumerators.Edges; |
| | | 6 | | using Itinero.Profiles; |
| | | 7 | | using Itinero.Routing.Costs.Caches; |
| | | 8 | | |
| | | 9 | | namespace Itinero.Routing.Costs; |
| | | 10 | | |
| | | 11 | | internal class ProfileCostFunctionCached : ICostFunction |
| | | 12 | | { |
| | | 13 | | private readonly Profile _profile; |
| | | 14 | | private readonly EdgeFactorCache _edgeFactorCache; |
| | | 15 | | private readonly TurnCostFactorCache _turnCostFactorCache; |
| | | 16 | | |
| | 13712 | 17 | | internal ProfileCostFunctionCached(Profile profile, EdgeFactorCache edgeFactorCache, TurnCostFactorCache turnCostFac |
| | 13712 | 18 | | { |
| | 13712 | 19 | | _profile = profile; |
| | 13712 | 20 | | _edgeFactorCache = edgeFactorCache; |
| | 13712 | 21 | | _turnCostFactorCache = turnCostFactorCache; |
| | 13712 | 22 | | } |
| | | 23 | | |
| | | 24 | | public (bool canAccess, bool canStop, bool localAccess, double cost, double turnCost) Get( |
| | | 25 | | IEdgeEnumerator<RoutingNetwork> edgeEnumerator, bool tailToHead = true, |
| | | 26 | | IEnumerable<(EdgeId edgeId, byte? turn)>? previousEdges = null) |
| | 1096047 | 27 | | { |
| | 1096047 | 28 | | previousEdges ??= ArraySegment<(EdgeId edgeId, byte? turn)>.Empty; |
| | | 29 | | |
| | | 30 | | // get edge factor and length. |
| | | 31 | | EdgeFactor factor; |
| | 1096047 | 32 | | var edgeTypeId = edgeEnumerator.EdgeTypeId; |
| | 1096047 | 33 | | if (edgeTypeId == null) |
| | 32 | 34 | | { |
| | 32 | 35 | | factor = _profile.FactorInEdgeDirection(edgeEnumerator); |
| | 32 | 36 | | } |
| | | 37 | | else |
| | 1096015 | 38 | | { |
| | 1096015 | 39 | | var edgeFactor = _edgeFactorCache.Get(edgeTypeId.Value); |
| | 1096015 | 40 | | if (edgeFactor == null) |
| | 1802 | 41 | | { |
| | | 42 | | // no cached value, cache forward value. |
| | 1802 | 43 | | factor = _profile.Factor(edgeEnumerator.Attributes); |
| | 1802 | 44 | | _edgeFactorCache.Set(edgeTypeId.Value, factor); |
| | 1802 | 45 | | } |
| | | 46 | | else |
| | 1094213 | 47 | | { |
| | 1094213 | 48 | | factor = edgeFactor.Value; |
| | 1094213 | 49 | | } |
| | | 50 | | |
| | | 51 | | // cached value is always forward. |
| | 1096015 | 52 | | if (!edgeEnumerator.Forward) |
| | 495552 | 53 | | { |
| | 495552 | 54 | | factor = factor.Reverse; |
| | 495552 | 55 | | } |
| | 1096015 | 56 | | } |
| | | 57 | | |
| | 1096047 | 58 | | var lengthNullable = edgeEnumerator.Length; |
| | 1096047 | 59 | | var length = lengthNullable ?? |
| | 1096047 | 60 | | (uint)(edgeEnumerator.EdgeLength() * 100); |
| | 1096047 | 61 | | var cost = tailToHead ? factor.ForwardFactor * length : factor.BackwardFactor * length; |
| | 1096047 | 62 | | var canAccess = tailToHead ? factor.ForwardFactor > 0 : factor.BackwardFactor > 0; |
| | 1096047 | 63 | | var localAccess = factor.IsLocalAccess; |
| | | 64 | | |
| | 1096047 | 65 | | var totalTurnCost = 0.0; |
| | 1096047 | 66 | | var (_, turn) = previousEdges.FirstOrDefault(); |
| | 2172904 | 67 | | if (turn == null) return (canAccess, factor.CanStop, localAccess, cost, totalTurnCost); |
| | | 68 | | |
| | 19190 | 69 | | if (tailToHead) |
| | 19173 | 70 | | { |
| | 19173 | 71 | | var turnCosts = edgeEnumerator.GetTurnCostToTail(turn.Value); |
| | | 72 | | |
| | 95816 | 73 | | foreach (var (turnCostType, attributes, turnCost, prefixEdges) in turnCosts) |
| | 19165 | 74 | | { |
| | | 75 | | // TODO: compare prefix edges with the previous edges. |
| | | 76 | | |
| | 19165 | 77 | | var turnCostFactor = _turnCostFactorCache.Get(turnCostType); |
| | 19165 | 78 | | if (turnCostFactor == null) |
| | 55 | 79 | | { |
| | 55 | 80 | | turnCostFactor = _profile.TurnCostFactor(attributes); |
| | 55 | 81 | | _turnCostFactorCache.Set(turnCostType, turnCostFactor.Value); |
| | 55 | 82 | | } |
| | | 83 | | |
| | 19165 | 84 | | if (turnCostFactor.Value.IsBinary && turnCost > 0) |
| | 33 | 85 | | { |
| | 33 | 86 | | totalTurnCost = double.MaxValue; |
| | 33 | 87 | | break; |
| | | 88 | | } |
| | | 89 | | |
| | 19132 | 90 | | totalTurnCost += turnCostFactor.Value.CostFactor * turnCost; |
| | 19132 | 91 | | } |
| | 19173 | 92 | | } |
| | | 93 | | else |
| | 17 | 94 | | { |
| | 17 | 95 | | var turnCosts = edgeEnumerator.GetTurnCostFromTail(turn.Value); |
| | | 96 | | |
| | 65 | 97 | | foreach (var (turnCostType, attributes, turnCost, prefixEdges) in turnCosts) |
| | 13 | 98 | | { |
| | | 99 | | // TODO: compare prefix edges with the previous edges. |
| | | 100 | | |
| | 13 | 101 | | var turnCostFactor = _turnCostFactorCache.Get(turnCostType); |
| | 13 | 102 | | if (turnCostFactor == null) |
| | 1 | 103 | | { |
| | 1 | 104 | | turnCostFactor = _profile.TurnCostFactor(attributes); |
| | 1 | 105 | | _turnCostFactorCache.Set(turnCostType, turnCostFactor.Value); |
| | 1 | 106 | | } |
| | | 107 | | |
| | 13 | 108 | | if (turnCostFactor.Value.IsBinary && turnCost > 0) |
| | 12 | 109 | | { |
| | 12 | 110 | | totalTurnCost = double.MaxValue; |
| | 12 | 111 | | break; |
| | | 112 | | } |
| | | 113 | | |
| | 1 | 114 | | totalTurnCost += turnCostFactor.Value.CostFactor * turnCost; |
| | 1 | 115 | | } |
| | 17 | 116 | | } |
| | | 117 | | |
| | 19190 | 118 | | return (canAccess, factor.CanStop, localAccess, cost, totalTurnCost); |
| | 1096047 | 119 | | } |
| | | 120 | | } |