| | | 1 | | using System.Collections.Generic; |
| | | 2 | | using Itinero.Network; |
| | | 3 | | using Itinero.Network.Enumerators.Edges; |
| | | 4 | | |
| | | 5 | | namespace Itinero.Network.Search; |
| | | 6 | | |
| | | 7 | | internal class VertexEdgeEnumerator : IEdgeEnumerator<RoutingNetwork> |
| | | 8 | | { |
| | | 9 | | private readonly IEnumerator<VertexId> _vertexEnumerator; |
| | | 10 | | |
| | 2 | 11 | | public VertexEdgeEnumerator(RoutingNetwork graph, IEnumerable<VertexId> vertices) |
| | 2 | 12 | | { |
| | 2 | 13 | | this.Network = graph; |
| | 2 | 14 | | _vertexEnumerator = vertices.GetEnumerator(); |
| | 2 | 15 | | this.RoutingNetworkEdgeEnumerator = graph.GetEdgeEnumerator(); |
| | 2 | 16 | | } |
| | | 17 | | |
| | 2 | 18 | | private bool _firstEdge = false; |
| | | 19 | | |
| | | 20 | | public void Reset() |
| | 0 | 21 | | { |
| | 0 | 22 | | _firstEdge = false; |
| | 0 | 23 | | this.RoutingNetworkEdgeEnumerator.Reset(); |
| | 0 | 24 | | _vertexEnumerator.Reset(); |
| | 0 | 25 | | } |
| | | 26 | | |
| | | 27 | | public bool MoveNext() |
| | 3 | 28 | | { |
| | 3 | 29 | | if (!_firstEdge) |
| | 2 | 30 | | { |
| | 3 | 31 | | while (_vertexEnumerator.MoveNext()) |
| | 2 | 32 | | { |
| | 2 | 33 | | while (this.RoutingNetworkEdgeEnumerator.MoveTo(_vertexEnumerator.Current)) |
| | 2 | 34 | | { |
| | 2 | 35 | | if (!this.RoutingNetworkEdgeEnumerator.MoveNext()) |
| | 1 | 36 | | { |
| | 1 | 37 | | break; |
| | | 38 | | } |
| | | 39 | | |
| | 1 | 40 | | _firstEdge = true; |
| | 1 | 41 | | return true; |
| | | 42 | | } |
| | 1 | 43 | | } |
| | | 44 | | |
| | 1 | 45 | | return false; |
| | | 46 | | } |
| | | 47 | | |
| | 1 | 48 | | while (true) |
| | 1 | 49 | | { |
| | 1 | 50 | | if (this.RoutingNetworkEdgeEnumerator.MoveNext()) |
| | 0 | 51 | | { |
| | 0 | 52 | | return true; |
| | | 53 | | } |
| | | 54 | | |
| | 1 | 55 | | if (!_vertexEnumerator.MoveNext()) |
| | 1 | 56 | | { |
| | 1 | 57 | | return false; |
| | | 58 | | } |
| | | 59 | | |
| | 0 | 60 | | while (this.RoutingNetworkEdgeEnumerator.MoveTo(_vertexEnumerator.Current)) |
| | 0 | 61 | | { |
| | 0 | 62 | | if (this.RoutingNetworkEdgeEnumerator.MoveNext()) |
| | 0 | 63 | | { |
| | 0 | 64 | | return true; |
| | | 65 | | } |
| | | 66 | | |
| | 0 | 67 | | if (!_vertexEnumerator.MoveNext()) |
| | 0 | 68 | | { |
| | 0 | 69 | | return false; |
| | | 70 | | } |
| | 0 | 71 | | } |
| | 0 | 72 | | } |
| | 3 | 73 | | } |
| | | 74 | | |
| | 6 | 75 | | internal RoutingNetworkEdgeEnumerator RoutingNetworkEdgeEnumerator { get; } |
| | | 76 | | |
| | 0 | 77 | | public void Dispose() { } |
| | | 78 | | |
| | 0 | 79 | | public RoutingNetwork Network { get; } |
| | | 80 | | |
| | 0 | 81 | | public bool Forward => this.RoutingNetworkEdgeEnumerator.Forward; |
| | 0 | 82 | | public VertexId Tail => this.RoutingNetworkEdgeEnumerator.Tail; |
| | 0 | 83 | | public (double longitude, double latitude, float? e) TailLocation => this.RoutingNetworkEdgeEnumerator.TailLocation; |
| | 0 | 84 | | public VertexId Head => this.RoutingNetworkEdgeEnumerator.Head; |
| | 0 | 85 | | public (double longitude, double latitude, float? e) HeadLocation => this.RoutingNetworkEdgeEnumerator.HeadLocation; |
| | 1 | 86 | | public EdgeId EdgeId => this.RoutingNetworkEdgeEnumerator.EdgeId; |
| | 0 | 87 | | public IEnumerable<(double longitude, double latitude, float? e)> Shape => this.RoutingNetworkEdgeEnumerator.Shape; |
| | 0 | 88 | | public IEnumerable<(string key, string value)> Attributes => this.RoutingNetworkEdgeEnumerator.Attributes; |
| | 0 | 89 | | public uint? EdgeTypeId => this.RoutingNetworkEdgeEnumerator.EdgeTypeId; |
| | 0 | 90 | | public uint? Length => this.RoutingNetworkEdgeEnumerator.Length; |
| | 0 | 91 | | public byte? HeadOrder => this.RoutingNetworkEdgeEnumerator.HeadOrder; |
| | 0 | 92 | | public byte? TailOrder => this.RoutingNetworkEdgeEnumerator.TailOrder; |
| | | 93 | | |
| | | 94 | | /// <summary> |
| | | 95 | | /// Gets the turn cost at the tail turn (source -> [tail -> head]). |
| | | 96 | | /// </summary> |
| | | 97 | | /// <param name="sourceOrder">The order of the source edge.</param> |
| | | 98 | | /// <returns>The turn costs if any.</returns> |
| | | 99 | | public IEnumerable<(uint turnCostType, IEnumerable<(string key, string value)> attributes, uint cost, IEnumerable<Ed |
| | | 100 | | byte sourceOrder) |
| | 0 | 101 | | { |
| | 0 | 102 | | return this.RoutingNetworkEdgeEnumerator.GetTurnCostToTail(sourceOrder); |
| | 0 | 103 | | } |
| | | 104 | | |
| | | 105 | | /// <summary> |
| | | 106 | | /// Gets the turn cost at the tail turn ([head -> tail] -> target). |
| | | 107 | | /// </summary> |
| | | 108 | | /// <param name="targetOrder">The order of the target edge.</param> |
| | | 109 | | /// <returns>The turn costs if any.</returns> |
| | | 110 | | public IEnumerable<(uint turnCostType, IEnumerable<(string key, string value)> attributes, uint cost, IEnumerable<Ed |
| | | 111 | | byte targetOrder) |
| | 0 | 112 | | { |
| | 0 | 113 | | return this.RoutingNetworkEdgeEnumerator.GetTurnCostFromTail(targetOrder); |
| | 0 | 114 | | } |
| | | 115 | | |
| | | 116 | | /// <summary> |
| | | 117 | | /// Gets the turn cost at the tail turn (source -> [head -> tail]). |
| | | 118 | | /// </summary> |
| | | 119 | | /// <param name="sourceOrder">The order of the source edge.</param> |
| | | 120 | | /// <returns>The turn costs if any.</returns> |
| | | 121 | | public IEnumerable<(uint turnCostType, IEnumerable<(string key, string value)> attributes, uint cost, IEnumerable<Ed |
| | | 122 | | byte sourceOrder) |
| | 0 | 123 | | { |
| | 0 | 124 | | return this.RoutingNetworkEdgeEnumerator.GetTurnCostToHead(sourceOrder); |
| | 0 | 125 | | } |
| | | 126 | | |
| | | 127 | | /// <summary> |
| | | 128 | | /// Gets the turn cost at the tail turn ([tail -> head] -> target). |
| | | 129 | | /// </summary> |
| | | 130 | | /// <param name="targetOrder">The order of the target edge.</param> |
| | | 131 | | /// <returns>The turn costs if any.</returns> |
| | | 132 | | public IEnumerable<(uint turnCostType, IEnumerable<(string key, string value)> attributes, uint cost, IEnumerable<Ed |
| | | 133 | | byte targetOrder) |
| | 0 | 134 | | { |
| | 0 | 135 | | return this.RoutingNetworkEdgeEnumerator.GetTurnCostFromHead(targetOrder); |
| | 0 | 136 | | } |
| | | 137 | | } |