| | | 1 | | using System.Collections.Generic; |
| | | 2 | | using Itinero.Network; |
| | | 3 | | using Itinero.Network.Enumerators.Edges; |
| | | 4 | | using Itinero.Routing.DataStructures; |
| | | 5 | | |
| | | 6 | | namespace Itinero.Routing.Flavours.Dijkstra; |
| | | 7 | | |
| | | 8 | | internal static class PathTreeExtensions |
| | | 9 | | { |
| | | 10 | | // TODO: this can all be represented much more compact. |
| | | 11 | | |
| | | 12 | | /// <summary> |
| | | 13 | | /// Adds a new visit the path tree. |
| | | 14 | | /// </summary> |
| | | 15 | | /// <param name="tree">The tree.</param> |
| | | 16 | | /// <param name="vertex">The vertex.</param> |
| | | 17 | | /// <param name="edge">The edge.</param> |
| | | 18 | | /// <param name="forward">The edge direction.</param> |
| | | 19 | | /// <param name="head">The head index.</param> |
| | | 20 | | /// <param name="previousPointer">The pointer to the previous entry.</param> |
| | | 21 | | /// <returns>A pointer to the visit.</returns> |
| | | 22 | | public static uint AddVisit(this PathTree tree, VertexId vertex, EdgeId edge, bool forward, byte? head, |
| | | 23 | | uint previousPointer) |
| | 95 | 24 | | { |
| | 95 | 25 | | var data0 = vertex.TileId; |
| | 95 | 26 | | var data1 = vertex.LocalId; |
| | 95 | 27 | | var data2 = edge.TileId; |
| | 95 | 28 | | var data3 = edge.LocalId; |
| | 95 | 29 | | var data4 = head ?? uint.MaxValue; |
| | 95 | 30 | | var data5 = previousPointer; |
| | 95 | 31 | | var data6 = forward ? 1U : 0; |
| | | 32 | | |
| | 95 | 33 | | return tree.Add(data0, data1, data2, data3, data4, data5, data6); |
| | 95 | 34 | | } |
| | | 35 | | |
| | | 36 | | /// <summary> |
| | | 37 | | /// Adds a new visit to the path tree. |
| | | 38 | | /// </summary> |
| | | 39 | | /// <param name="tree">The tree.</param> |
| | | 40 | | /// <param name="enumerator">The current edge.</param> |
| | | 41 | | /// <param name="previousPointer">The pointer to the previous entry.</param> |
| | | 42 | | /// <returns>A pointer to the visit.</returns> |
| | | 43 | | public static uint AddVisit(this PathTree tree, RoutingNetworkEdgeEnumerator enumerator, uint previousPointer) |
| | 95 | 44 | | { |
| | 95 | 45 | | return tree.AddVisit(enumerator.Head, enumerator.EdgeId, enumerator.Forward, enumerator.HeadOrder, |
| | 95 | 46 | | previousPointer); |
| | 95 | 47 | | } |
| | | 48 | | |
| | | 49 | | /// <summary> |
| | | 50 | | /// Gets the visit at the given location. |
| | | 51 | | /// </summary> |
| | | 52 | | /// <param name="tree">The tree.</param> |
| | | 53 | | /// <param name="pointer">The pointer.</param> |
| | | 54 | | /// <returns>The visit.</returns> |
| | | 55 | | public static (VertexId vertex, EdgeId edge, bool forward, byte? head, uint previousPointer) GetVisit(this PathTree |
| | | 56 | | uint pointer) |
| | 176 | 57 | | { |
| | 176 | 58 | | tree.Get(pointer, out var data0, out var data1, out var data2, out var data3, out var data4, out var data5, out |
| | | 59 | | |
| | 176 | 60 | | var head = data4 == uint.MaxValue ? null : (byte?)data4; |
| | | 61 | | |
| | 176 | 62 | | return (new VertexId(data0, data1), new EdgeId(data2, data3), data6 == 1U, head, data5); |
| | 176 | 63 | | } |
| | | 64 | | |
| | | 65 | | /// <summary> |
| | | 66 | | /// Enumerates the edges backwards from the visit at the given pointer. |
| | | 67 | | /// </summary> |
| | | 68 | | /// <param name="tree">The tree.</param> |
| | | 69 | | /// <param name="pointer">The pointer.</param> |
| | | 70 | | /// <returns>The edges and their turn.</returns> |
| | | 71 | | public static IEnumerable<(EdgeId edge, byte? turn)> GetPreviousEdges(this PathTree tree, uint pointer) |
| | 17 | 72 | | { |
| | 17 | 73 | | while (pointer != uint.MaxValue) |
| | 17 | 74 | | { |
| | 17 | 75 | | var (_, edge, _, head, next) = tree.GetVisit(pointer); |
| | | 76 | | |
| | 17 | 77 | | yield return (edge, head); |
| | | 78 | | |
| | 0 | 79 | | pointer = next; |
| | 0 | 80 | | } |
| | 0 | 81 | | } |
| | | 82 | | |
| | | 83 | | #if DEBUG |
| | | 84 | | public static IEnumerable<(EdgeId edge, bool forward, byte? turn)> GetPathDebug(this PathTree tree, uint pointer) |
| | 0 | 85 | | { |
| | 0 | 86 | | while (pointer != uint.MaxValue) |
| | 0 | 87 | | { |
| | 0 | 88 | | var (_, edge, forward, head, next) = tree.GetVisit(pointer); |
| | | 89 | | |
| | 0 | 90 | | yield return (edge, forward, head); |
| | | 91 | | |
| | 0 | 92 | | pointer = next; |
| | 0 | 93 | | } |
| | 0 | 94 | | } |
| | | 95 | | #endif |
| | | 96 | | } |