| | | 1 | | using System; |
| | | 2 | | using System.Collections.Generic; |
| | | 3 | | using System.Linq; |
| | | 4 | | using Itinero.Data; |
| | | 5 | | using Itinero.Network.Tiles.Standalone.Global; |
| | | 6 | | using Itinero.Network.Writer; |
| | | 7 | | |
| | | 8 | | namespace Itinero.Network.Tiles.Standalone.Writer; |
| | | 9 | | |
| | | 10 | | /// <summary> |
| | | 11 | | /// Extension methods related to writing standalone tiles to a network. |
| | | 12 | | /// </summary> |
| | | 13 | | public static class RoutingNetworkWriterExtensions |
| | | 14 | | { |
| | | 15 | | /// <summary> |
| | | 16 | | /// Adds a tile in the form of a standalone tile to the network. |
| | | 17 | | /// </summary> |
| | | 18 | | /// <param name="writer">The writer to write to.</param> |
| | | 19 | | /// <param name="tile">The tile to add.</param> |
| | | 20 | | /// <param name="globalIdSet">The global id set.</param> |
| | | 21 | | public static void AddStandaloneTile(this RoutingNetworkWriter writer, StandaloneNetworkTile tile, |
| | | 22 | | GlobalNetworkManager globalIdSet) |
| | 23 | 23 | | { |
| | | 24 | | // add the tile without boundary crossings. |
| | 23 | 25 | | writer.AddTile(tile.NetworkTile); |
| | | 26 | | |
| | | 27 | | // register all GlobalEdgeId → EdgeId mappings from the tile's internal edges. |
| | 23 | 28 | | var tileEnumerator = new NetworkTileEnumerator(); |
| | 23 | 29 | | tileEnumerator.MoveTo(tile.NetworkTile); |
| | 23 | 30 | | var tileId = tile.TileId; |
| | 174 | 31 | | for (uint v = 0; v < tile.NetworkTile.VertexCount; v++) |
| | 64 | 32 | | { |
| | 64 | 33 | | var vertexId = new VertexId(tileId, v); |
| | 64 | 34 | | if (!tileEnumerator.MoveTo(vertexId)) continue; |
| | | 35 | | |
| | 146 | 36 | | while (tileEnumerator.MoveNext()) |
| | 82 | 37 | | { |
| | | 38 | | // only process forward edges to avoid double registration. |
| | 123 | 39 | | if (!tileEnumerator.Forward) continue; |
| | | 40 | | |
| | 41 | 41 | | var globalEdgeId = tileEnumerator.GlobalEdgeId; |
| | 41 | 42 | | if (globalEdgeId != null) |
| | 41 | 43 | | { |
| | 41 | 44 | | globalIdSet.EdgeIdSet.Set(globalEdgeId.Value, tileEnumerator.EdgeId); |
| | 41 | 45 | | } |
| | 41 | 46 | | } |
| | 64 | 47 | | } |
| | | 48 | | |
| | | 49 | | // process boundary crossings. |
| | 101 | 50 | | foreach (var (isIncoming, globalEdgeId, vertex, attributes, edgeTypeId) in tile.GetBoundaryCrossings()) |
| | 16 | 51 | | { |
| | 16 | 52 | | if (globalIdSet.PendingBoundaryCrossings.TryGetValue(globalEdgeId, out var pending)) |
| | 8 | 53 | | { |
| | | 54 | | // match found - the other tile already loaded its half, create the boundary edge. |
| | | 55 | | EdgeId newEdge; |
| | 8 | 56 | | if (isIncoming) |
| | 4 | 57 | | { |
| | | 58 | | // isIncoming=true: vertex is at way tail, pending.vertex is at way head. |
| | 4 | 59 | | var length = writer.ComputeEdgeLength(vertex, pending.vertex); |
| | 4 | 60 | | newEdge = writer.AddEdge(vertex, pending.vertex, null, attributes, edgeTypeId, length, globalEdgeId) |
| | 4 | 61 | | } |
| | | 62 | | else |
| | 4 | 63 | | { |
| | | 64 | | // isIncoming=false: vertex is at way head, pending.vertex is at way tail. |
| | 4 | 65 | | var length = writer.ComputeEdgeLength(pending.vertex, vertex); |
| | 4 | 66 | | newEdge = writer.AddEdge(pending.vertex, vertex, null, attributes, edgeTypeId, length, globalEdgeId) |
| | 4 | 67 | | } |
| | | 68 | | |
| | | 69 | | // register boundary edge's GlobalEdgeId → EdgeId mapping. |
| | 8 | 70 | | globalIdSet.EdgeIdSet.Set(globalEdgeId, newEdge); |
| | 8 | 71 | | globalIdSet.PendingBoundaryCrossings.Remove(globalEdgeId); |
| | 8 | 72 | | } |
| | | 73 | | else |
| | 8 | 74 | | { |
| | | 75 | | // no match yet - store as pending (materialize attributes). |
| | 8 | 76 | | globalIdSet.PendingBoundaryCrossings[globalEdgeId] = |
| | 8 | 77 | | (vertex, attributes.ToArray(), edgeTypeId, isIncoming); |
| | 8 | 78 | | } |
| | 16 | 79 | | } |
| | | 80 | | |
| | | 81 | | // resolve global restrictions from this tile. |
| | 93 | 82 | | foreach (var (edges, isProhibitory, turnCostTypeId, restrictionAttributes) in tile.GetGlobalRestrictions()) |
| | 12 | 83 | | { |
| | 12 | 84 | | var globalRestriction = new GlobalRestriction( |
| | 24 | 85 | | edges.Select(e => e.globalEdgeId), |
| | 12 | 86 | | isProhibitory, |
| | 12 | 87 | | restrictionAttributes.ToArray()); |
| | | 88 | | |
| | 12 | 89 | | if (!TryResolveRestriction(globalRestriction, globalIdSet, writer)) |
| | 8 | 90 | | { |
| | 8 | 91 | | globalIdSet.PendingRestrictions.Add(globalRestriction); |
| | 8 | 92 | | } |
| | 12 | 93 | | } |
| | | 94 | | |
| | | 95 | | // retry pending restrictions with newly available edges. |
| | 78 | 96 | | for (var i = globalIdSet.PendingRestrictions.Count - 1; i >= 0; i--) |
| | 16 | 97 | | { |
| | 16 | 98 | | if (TryResolveRestriction(globalIdSet.PendingRestrictions[i], globalIdSet, writer)) |
| | 8 | 99 | | { |
| | 8 | 100 | | globalIdSet.PendingRestrictions.RemoveAt(i); |
| | 8 | 101 | | } |
| | 16 | 102 | | } |
| | 23 | 103 | | } |
| | | 104 | | |
| | | 105 | | private static bool TryResolveRestriction(GlobalRestriction globalRestriction, |
| | | 106 | | GlobalNetworkManager globalIdSet, RoutingNetworkWriter writer) |
| | 28 | 107 | | { |
| | | 108 | | // try to resolve all GlobalEdgeIds to EdgeIds. |
| | 28 | 109 | | if (!globalRestriction.TryBuildNetworkRestriction(GetEdge, out var networkRestriction)) |
| | 16 | 110 | | return false; |
| | | 111 | | |
| | 12 | 112 | | if (networkRestriction!.Count < 2) return true; |
| | | 113 | | |
| | | 114 | | // get last edge and determine turn cost vertex. |
| | 12 | 115 | | var last = networkRestriction[^1]; |
| | 12 | 116 | | var edgeEnumerator = writer.GetEdgeEnumerator(); |
| | 12 | 117 | | if (!edgeEnumerator.MoveTo(last.edge, last.forward)) |
| | 0 | 118 | | return false; |
| | 12 | 119 | | var turnCostVertex = edgeEnumerator.Tail; |
| | | 120 | | |
| | 12 | 121 | | var secondToLast = networkRestriction[^2]; |
| | | 122 | | |
| | 12 | 123 | | if (networkRestriction.IsProhibitory) |
| | 12 | 124 | | { |
| | | 125 | | // prohibitory: add a single cost entry forbidding this specific turn. |
| | 12 | 126 | | var costs = new uint[,] { { 0, 1 }, { 0, 0 } }; |
| | 12 | 127 | | writer.AddTurnCosts(turnCostVertex, networkRestriction.Attributes, |
| | 12 | 128 | | [secondToLast.edge, last.edge], costs, |
| | 12 | 129 | | networkRestriction.Take(networkRestriction.Count - 2).Select(x => x.edge)); |
| | | 130 | | |
| | 12 | 131 | | } |
| | | 132 | | else |
| | 0 | 133 | | { |
| | | 134 | | // mandatory: add cost for every *other* edge at the vertex. |
| | 0 | 135 | | if (!edgeEnumerator.MoveTo(secondToLast.edge, secondToLast.forward)) |
| | 0 | 136 | | return false; |
| | 0 | 137 | | var to = edgeEnumerator.Head; |
| | | 138 | | |
| | 0 | 139 | | edgeEnumerator.MoveTo(to); |
| | 0 | 140 | | while (edgeEnumerator.MoveNext()) |
| | 0 | 141 | | { |
| | 0 | 142 | | if (edgeEnumerator.EdgeId == secondToLast.edge || |
| | 0 | 143 | | edgeEnumerator.EdgeId == last.edge) continue; |
| | | 144 | | |
| | 0 | 145 | | var costs = new uint[,] { { 0, 1 }, { 0, 0 } }; |
| | 0 | 146 | | writer.AddTurnCosts(turnCostVertex, networkRestriction.Attributes, |
| | 0 | 147 | | [secondToLast.edge, edgeEnumerator.EdgeId], costs, |
| | 0 | 148 | | networkRestriction.Take(networkRestriction.Count - 2).Select(x => x.edge)); |
| | 0 | 149 | | } |
| | 0 | 150 | | } |
| | | 151 | | |
| | 12 | 152 | | return true; |
| | | 153 | | |
| | | 154 | | (EdgeId edge, bool forward)? GetEdge(GlobalEdgeId geid, bool isFirst) |
| | 48 | 155 | | { |
| | | 156 | | // exact match short-circuit (cheap check before walking). |
| | 48 | 157 | | if (globalIdSet.EdgeIdSet.TryGet(geid, out var edgeId)) |
| | 11 | 158 | | return (edgeId, true); |
| | 37 | 159 | | if (globalIdSet.EdgeIdSet.TryGet(geid.GetInverted(), out edgeId)) |
| | 13 | 160 | | return (edgeId, false); |
| | | 161 | | |
| | | 162 | | // walk from the chain-anchor end; first edge anchors at Head, every |
| | | 163 | | // subsequent edge anchors at Tail (chain invariant: previous.Head == |
| | | 164 | | // current.Tail). |
| | 24 | 165 | | return GlobalRestrictionExtensions.WalkFromAnchor(geid, isFirst, |
| | 24 | 166 | | globalIdSet.EdgeIdSet.TryGet); |
| | 48 | 167 | | } |
| | 28 | 168 | | } |
| | | 169 | | } |