| | 1 | | using System; |
| | 2 | | using System.Collections.Generic; |
| | 3 | | using System.IO; |
| | 4 | | using Itinero.IO; |
| | 5 | | using Itinero.Network.Storage; |
| | 6 | | using Itinero.Network.TurnCosts; |
| | 7 | | using Reminiscence.Arrays; |
| | 8 | |
|
| | 9 | | namespace Itinero.Network.Tiles; |
| | 10 | |
|
| | 11 | | internal partial class NetworkTile |
| | 12 | | { |
| | 13 | | private const int DefaultSizeIncrease = 16; |
| | 14 | |
|
| | 15 | | private readonly uint _tileId; |
| | 16 | | private readonly int _zoom; // the zoom level. |
| | 17 | | private readonly Guid _edgeTypeMapId; // the edge type index id. |
| | 18 | |
|
| 210 | 19 | | private uint _nextVertexId = 0; // the next vertex id. |
| | 20 | |
|
| | 21 | | // the pointers, per vertex, to their first edge. |
| | 22 | | // TODO: investigate if it's worth storing these with less precision, one tile will never contain this much data. |
| | 23 | | // TODO: investigate if we can not use one-increasing vertex ids but also use their pointers like with the edges. |
| | 24 | | private readonly ArrayBase<uint> _pointers; |
| | 25 | | private uint _nextCrossTileId; // the next id for an edge that crosses tile boundaries. |
| | 26 | | private readonly ArrayBase<uint> _crossEdgePointers; // points to the cross tile boundary edges. |
| | 27 | |
|
| | 28 | | // the next edge id. |
| 210 | 29 | | private uint _nextEdgeId = 0; |
| | 30 | |
|
| | 31 | | // the edges. |
| | 32 | | private readonly ArrayBase<byte> _edges; |
| | 33 | |
|
| | 34 | | /// <summary> |
| | 35 | | /// Creates a new tile. |
| | 36 | | /// </summary> |
| | 37 | | /// <param name="zoom">The zoom level.</param> |
| | 38 | | /// <param name="tileId">The tile id.</param> |
| | 39 | | /// <param name="edgeTypeMapId">The edge type index id.</param> |
| 194 | 40 | | public NetworkTile(int zoom, uint tileId, Guid? edgeTypeMapId = null) |
| 194 | 41 | | { |
| 194 | 42 | | _zoom = zoom; |
| 194 | 43 | | _tileId = tileId; |
| 194 | 44 | | _edgeTypeMapId = edgeTypeMapId ?? Guid.Empty; |
| 194 | 45 | | _nextCrossTileId = 0; |
| | 46 | |
|
| 194 | 47 | | _pointers = new MemoryArray<uint>(0); |
| 194 | 48 | | _edges = new MemoryArray<byte>(0); |
| 194 | 49 | | _crossEdgePointers = new MemoryArray<uint>(0); |
| | 50 | |
|
| 194 | 51 | | _coordinates = new MemoryArray<byte>(0); |
| 194 | 52 | | _shapes = new MemoryArray<byte>(0); |
| 194 | 53 | | _attributes = new MemoryArray<byte>(0); |
| 194 | 54 | | _strings = new MemoryArray<string>(0); |
| 194 | 55 | | } |
| | 56 | |
|
| 16 | 57 | | private NetworkTile(int zoom, uint tileId, Guid edgeTypeMapId, uint nextCrossTileId, ArrayBase<uint> pointers, |
| 16 | 58 | | ArrayBase<byte> edges, |
| 16 | 59 | | ArrayBase<uint> crossEdgePointers, ArrayBase<byte> coordinates, ArrayBase<byte> shapes, |
| 16 | 60 | | ArrayBase<byte> attributes, |
| 16 | 61 | | ArrayBase<string> strings, ArrayBase<byte> turnCosts, uint nextVertexId, uint nextEdgeId, |
| 16 | 62 | | uint nextAttributePointer, |
| 16 | 63 | | uint nextShapePointer, uint nextStringId) |
| 16 | 64 | | { |
| 16 | 65 | | _zoom = zoom; |
| 16 | 66 | | _tileId = tileId; |
| 16 | 67 | | _edgeTypeMapId = edgeTypeMapId; |
| 16 | 68 | | _nextCrossTileId = nextCrossTileId; |
| 16 | 69 | | _pointers = pointers; |
| 16 | 70 | | _edges = edges; |
| 16 | 71 | | _crossEdgePointers = crossEdgePointers; |
| | 72 | |
|
| 16 | 73 | | _coordinates = coordinates; |
| 16 | 74 | | _shapes = shapes; |
| 16 | 75 | | _attributes = attributes; |
| 16 | 76 | | _strings = strings; |
| 16 | 77 | | _turnCosts = turnCosts; |
| | 78 | |
|
| 16 | 79 | | _nextVertexId = nextVertexId; |
| 16 | 80 | | _nextEdgeId = nextEdgeId; |
| 16 | 81 | | _nextAttributePointer = nextAttributePointer; |
| 16 | 82 | | _nextShapePointer = nextShapePointer; |
| 16 | 83 | | _nextStringId = nextStringId; |
| 16 | 84 | | } |
| | 85 | |
|
| | 86 | | /// <summary> |
| | 87 | | /// Clones this graph tile. |
| | 88 | | /// </summary> |
| | 89 | | /// <returns>The copy of this tile.</returns> |
| | 90 | | public NetworkTile Clone() |
| 10 | 91 | | { |
| 10 | 92 | | return new(_zoom, _tileId, _edgeTypeMapId, _nextCrossTileId, _pointers.Clone(), _edges.Clone(), |
| 10 | 93 | | _crossEdgePointers.Clone(), |
| 10 | 94 | | _coordinates.Clone(), _shapes.Clone(), _attributes.Clone(), _strings.Clone(), _turnCosts.Clone(), |
| 10 | 95 | | _nextVertexId, |
| 10 | 96 | | _nextEdgeId, _nextAttributePointer, _nextShapePointer, _nextStringId); |
| 10 | 97 | | } |
| | 98 | |
|
| | 99 | | /// <summary> |
| | 100 | | /// Gets the tile id. |
| | 101 | | /// </summary> |
| 2726 | 102 | | public uint TileId => _tileId; |
| | 103 | |
|
| | 104 | | /// <summary> |
| | 105 | | /// Gets the number of vertices. |
| | 106 | | /// </summary> |
| 362 | 107 | | public uint VertexCount => _nextVertexId; |
| | 108 | |
|
| | 109 | | /// <summary> |
| | 110 | | /// Gets the edge type map id. |
| | 111 | | /// </summary> |
| 988 | 112 | | public Guid EdgeTypeMapId => _edgeTypeMapId; |
| | 113 | |
|
| | 114 | | /// <summary> |
| | 115 | | /// Adds a new vertex and returns its id. |
| | 116 | | /// </summary> |
| | 117 | | /// <param name="longitude">The longitude.</param> |
| | 118 | | /// <param name="latitude">The latitude.</param> |
| | 119 | | /// <param name="e">The elevation in meters.</param> |
| | 120 | | /// <returns>The ID of the new vertex.</returns> |
| | 121 | | public VertexId AddVertex(double longitude, double latitude, float? e = null) |
| 433 | 122 | | { |
| | 123 | | // set coordinate. |
| 433 | 124 | | this.SetCoordinate(_nextVertexId, longitude, latitude, e); |
| | 125 | |
|
| | 126 | | // create id. |
| 433 | 127 | | var vertexId = new VertexId(_tileId, _nextVertexId); |
| 433 | 128 | | _nextVertexId++; |
| | 129 | |
|
| | 130 | | // make room. |
| 433 | 131 | | _pointers.EnsureMinimumSize(vertexId.LocalId, DefaultSizeIncrease); |
| | 132 | |
|
| 433 | 133 | | return vertexId; |
| 433 | 134 | | } |
| | 135 | |
|
| | 136 | | /// <summary> |
| | 137 | | /// Returns true if the vertex exists. |
| | 138 | | /// </summary> |
| | 139 | | /// <param name="vertex"></param> |
| | 140 | | /// <returns></returns> |
| | 141 | | public bool HasVertex(VertexId vertex) |
| 34 | 142 | | { |
| 34 | 143 | | if (vertex.LocalId >= _nextVertexId) |
| 11 | 144 | | { |
| 11 | 145 | | return false; |
| | 146 | | } |
| | 147 | |
|
| 23 | 148 | | return true; |
| 34 | 149 | | } |
| | 150 | |
|
| | 151 | | /// <summary> |
| | 152 | | /// Gets the vertex with the given id. |
| | 153 | | /// </summary> |
| | 154 | | /// <param name="vertex">The vertex.</param> |
| | 155 | | /// <param name="longitude">The longitude.</param> |
| | 156 | | /// <param name="latitude">The latitude.</param> |
| | 157 | | /// <param name="elevation">The elevation.</param> |
| | 158 | | /// <returns>True if the vertex exists.</returns> |
| | 159 | | public bool TryGetVertex(VertexId vertex, out double longitude, out double latitude, out float? elevation) |
| 691 | 160 | | { |
| 691 | 161 | | longitude = default; |
| 691 | 162 | | latitude = default; |
| 691 | 163 | | elevation = null; |
| 691 | 164 | | if (vertex.LocalId >= _nextVertexId) |
| 11 | 165 | | { |
| 11 | 166 | | return false; |
| | 167 | | } |
| | 168 | |
|
| 680 | 169 | | this.GetCoordinate(vertex.LocalId, out longitude, out latitude, out elevation); |
| 680 | 170 | | return true; |
| 691 | 171 | | } |
| | 172 | |
|
| | 173 | | /// <summary> |
| | 174 | | /// Adds a new edge and returns its id. |
| | 175 | | /// </summary> |
| | 176 | | /// <param name="vertex1">The first vertex.</param> |
| | 177 | | /// <param name="vertex2">The second vertex.</param> |
| | 178 | | /// <param name="shape">The shape."</param> |
| | 179 | | /// <param name="attributes">The attributes."</param> |
| | 180 | | /// <param name="edgeId">The edge id if this edge is a part of another tile.</param> |
| | 181 | | /// <param name="edgeTypeId">The edge type id, if any.</param> |
| | 182 | | /// <param name="length">The length in centimeters.</param> |
| | 183 | | /// <returns>The new edge id.</returns> |
| | 184 | | public EdgeId AddEdge(VertexId vertex1, VertexId vertex2, |
| | 185 | | IEnumerable<(double longitude, double latitude, float? e)>? shape = null, |
| | 186 | | IEnumerable<(string key, string value)>? attributes = null, EdgeId? edgeId = null, uint? edgeTypeId = null, |
| | 187 | | uint? length = null) |
| 270 | 188 | | { |
| 270 | 189 | | if (vertex2.TileId != _tileId) |
| 7 | 190 | | { |
| | 191 | | // this edge crosses tiles boundaries, it need special treatment and a stable id. |
| | 192 | | // because the edge originates in this tile, this tile is responsible for generating the id. |
| 7 | 193 | | if (edgeId != null) throw new ArgumentException( |
| 0 | 194 | | "The edge id shouldn't be a given, it should be generated by the originating tile.", |
| 0 | 195 | | nameof(edgeId)); |
| 7 | 196 | | if (vertex1.TileId != _tileId) throw new ArgumentException("None of the two vertices in this edge are in thi |
| 0 | 197 | | nameof(vertex1)); |
| | 198 | |
|
| | 199 | | // generate a new cross tile id and store pointer to edge. |
| 7 | 200 | | edgeId = EdgeId.CrossEdgeId(_tileId, _nextCrossTileId); |
| 7 | 201 | | _crossEdgePointers.EnsureMinimumSize(_nextCrossTileId + 1); |
| 7 | 202 | | _crossEdgePointers[_nextCrossTileId] = _nextEdgeId; |
| 7 | 203 | | _nextCrossTileId++; |
| 7 | 204 | | } |
| 263 | 205 | | else if (vertex1.TileId != _tileId) |
| 6 | 206 | | { |
| | 207 | | // this edge crosses tiles boundaries, it need special treatment and a stable id. |
| | 208 | | // because the edge originates in another tile it should already have an id. |
| 6 | 209 | | if (edgeId == null) throw new ArgumentException( |
| 0 | 210 | | "Cannot add an edge that doesn't start in this tile without a proper edge id.", |
| 0 | 211 | | nameof(edgeId)); |
| 6 | 212 | | if (edgeId.Value.TileId != vertex1.TileId) throw new ArgumentException("The edge id doesn't match the tile i |
| 0 | 213 | | nameof(edgeId)); |
| 6 | 214 | | } |
| | 215 | | else |
| 257 | 216 | | { |
| | 217 | | // this edge starts in this tile, it get an id from this tile. |
| 257 | 218 | | edgeId = new EdgeId(_tileId, _nextEdgeId); |
| 257 | 219 | | } |
| | 220 | |
|
| | 221 | | // write the edge data. |
| 270 | 222 | | var newEdgePointer = _nextEdgeId; |
| 270 | 223 | | var size = EncodeVertex(_edges, _tileId, _nextEdgeId, vertex1); |
| 270 | 224 | | _nextEdgeId += size; |
| 270 | 225 | | size = EncodeVertex(_edges, _tileId, _nextEdgeId, vertex2); |
| 270 | 226 | | _nextEdgeId += size; |
| | 227 | |
|
| | 228 | | // get previous pointers if vertex already has edges |
| | 229 | | // set the new pointers. |
| 270 | 230 | | uint? v1p = null; |
| 270 | 231 | | if (vertex1.TileId == _tileId) |
| 264 | 232 | | { |
| 264 | 233 | | v1p = _pointers[vertex1.LocalId].DecodeNullableData(); |
| 264 | 234 | | _pointers[vertex1.LocalId] = newEdgePointer.EncodeToNullableData(); |
| 264 | 235 | | } |
| | 236 | |
|
| 270 | 237 | | uint? v2p = null; |
| 270 | 238 | | if (vertex2.TileId == _tileId) |
| 263 | 239 | | { |
| 263 | 240 | | v2p = _pointers[vertex2.LocalId].DecodeNullableData(); |
| 263 | 241 | | _pointers[vertex2.LocalId] = newEdgePointer.EncodeToNullableData(); |
| 263 | 242 | | } |
| | 243 | |
|
| | 244 | | // set next pointers. |
| 270 | 245 | | size = EncodePointer(_edges, _nextEdgeId, v1p); |
| 270 | 246 | | _nextEdgeId += size; |
| 270 | 247 | | size = EncodePointer(_edges, _nextEdgeId, v2p); |
| 270 | 248 | | _nextEdgeId += size; |
| | 249 | |
|
| | 250 | | // write edge id explicitly if not in this edge. |
| 270 | 251 | | if (vertex1.TileId != vertex2.TileId) |
| 13 | 252 | | { |
| | 253 | | // this data will only be there for edges crossing tile boundaries. |
| 13 | 254 | | _nextEdgeId += (uint)_edges.SetDynamicUInt32(_nextEdgeId, |
| 13 | 255 | | edgeId.Value.LocalId - EdgeId.MinCrossId); |
| 13 | 256 | | } |
| | 257 | |
|
| | 258 | | // write edge profile id. |
| 270 | 259 | | _nextEdgeId += SetDynamicUIn32Nullable(_edges, _nextEdgeId, edgeTypeId); |
| | 260 | |
|
| | 261 | | // write length. |
| 270 | 262 | | _nextEdgeId += SetDynamicUIn32Nullable(_edges, _nextEdgeId, length); |
| | 263 | |
|
| | 264 | | // set tail and head order. |
| 270 | 265 | | _edges.SetTailHeadOrder(_nextEdgeId, null, null); |
| 270 | 266 | | _nextEdgeId++; |
| | 267 | |
|
| | 268 | | // take care of shape if any. |
| 270 | 269 | | uint? shapePointer = null; |
| 270 | 270 | | if (shape != null) |
| 88 | 271 | | { |
| 88 | 272 | | shapePointer = this.SetShape(shape); |
| 88 | 273 | | } |
| | 274 | |
|
| 270 | 275 | | size = EncodePointer(_edges, _nextEdgeId, shapePointer); |
| 270 | 276 | | _nextEdgeId += size; |
| | 277 | |
|
| | 278 | | // take care of attributes if any. |
| 270 | 279 | | uint? attributesPointer = null; |
| 270 | 280 | | if (attributes != null) |
| 113 | 281 | | { |
| 113 | 282 | | attributesPointer = this.SetAttributes(attributes); |
| 113 | 283 | | } |
| | 284 | |
|
| 270 | 285 | | size = EncodePointer(_edges, _nextEdgeId, attributesPointer); |
| 270 | 286 | | _nextEdgeId += size; |
| | 287 | |
|
| 270 | 288 | | return edgeId.Value; |
| 270 | 289 | | } |
| | 290 | |
|
| | 291 | | private HashSet<EdgeId>? _deletedEdges; |
| | 292 | |
|
| | 293 | | /// <summary> |
| | 294 | | /// Marks the given edge as deleted. |
| | 295 | | /// </summary> |
| | 296 | | /// <param name="edge">The edge to delete.</param> |
| | 297 | | internal void DeleteEdge(EdgeId edge) |
| 10 | 298 | | { |
| 10 | 299 | | _deletedEdges ??= new HashSet<EdgeId>(); |
| 10 | 300 | | _deletedEdges.Add(edge); |
| 10 | 301 | | } |
| | 302 | |
|
| | 303 | | /// <summary> |
| | 304 | | /// Returns true if the edge is deleted. |
| | 305 | | /// </summary> |
| | 306 | | /// <param name="edge">The edge.</param> |
| | 307 | | /// <returns>True if the edge was deleted.</returns> |
| | 308 | | internal bool IsEdgeDeleted(EdgeId edge) |
| 1105 | 309 | | { |
| 2204 | 310 | | if (_deletedEdges == null) return false; |
| | 311 | |
|
| 6 | 312 | | return _deletedEdges.Contains(edge); |
| 1105 | 313 | | } |
| | 314 | |
|
| | 315 | | /// <summary> |
| | 316 | | /// Returns true if there are deleted edges. |
| | 317 | | /// </summary> |
| 123 | 318 | | internal bool HasDeletedEdges => _deletedEdges != null; |
| | 319 | |
|
| | 320 | | /// <summary> |
| | 321 | | /// Removes all the deleted edges. |
| | 322 | | /// </summary> |
| | 323 | | /// <remarks>This changes all the edges if all edges written after a deleted edge.</remarks> |
| | 324 | | internal void RemoveDeletedEdges() |
| 10 | 325 | | { |
| 10 | 326 | | if (_deletedEdges == null) return; |
| | 327 | |
|
| | 328 | | // reset vertex pointers. |
| 340 | 329 | | for (var i = 0; i < _pointers.Length; i++) |
| 160 | 330 | | { |
| 160 | 331 | | _pointers[i] = 0; |
| 160 | 332 | | } |
| | 333 | |
|
| | 334 | | // redo edges, skipping deleted edges. |
| 10 | 335 | | var nextEdgeId = _nextEdgeId; |
| 10 | 336 | | var p = 0U; |
| 10 | 337 | | var newP = 0U; |
| 24 | 338 | | while (p < nextEdgeId) |
| 14 | 339 | | { |
| | 340 | | // read edge data. |
| 14 | 341 | | var currentEdgeId = p; |
| 14 | 342 | | p += this.DecodeVertex(p, out var local1Id, out var tile1Id); |
| 14 | 343 | | var vertex1 = new VertexId(tile1Id, local1Id); |
| 14 | 344 | | p += this.DecodeVertex(p, out var local2Id, out var tile2Id); |
| 14 | 345 | | var vertex2 = new VertexId(tile2Id, local2Id); |
| 14 | 346 | | p += this.DecodePointer(p, out _); |
| 14 | 347 | | p += this.DecodePointer(p, out _); |
| 14 | 348 | | uint? crossEdgeId = null; |
| 14 | 349 | | if (tile1Id != tile2Id) |
| 4 | 350 | | { |
| 4 | 351 | | p += (uint)_edges.GetDynamicUInt32(p, out var c); |
| 4 | 352 | | crossEdgeId = c; |
| 4 | 353 | | } |
| | 354 | |
|
| 14 | 355 | | p += (uint)_edges.GetDynamicUInt32Nullable(p, out var edgeTypeId); |
| 14 | 356 | | p += (uint)_edges.GetDynamicUInt32Nullable(p, out var length); |
| 14 | 357 | | var tailHeadOrder = _edges[p]; |
| 14 | 358 | | p++; |
| 14 | 359 | | p += this.DecodePointer(p, out var shapePointer); |
| 14 | 360 | | p += this.DecodePointer(p, out var attributePointer); |
| | 361 | |
|
| | 362 | | // check if edge was deleted. |
| 20 | 363 | | if (_deletedEdges.Contains(new EdgeId(_tileId, currentEdgeId))) continue; |
| 8 | 364 | | if (crossEdgeId.HasValue) |
| 4 | 365 | | { |
| 8 | 366 | | if (_deletedEdges.Contains(EdgeId.CrossEdgeId(vertex1.TileId, crossEdgeId.Value))) continue; |
| 0 | 367 | | } |
| | 368 | |
|
| | 369 | | // no need to overwrite identical data. |
| 4 | 370 | | if (p == newP) continue; |
| | 371 | |
|
| | 372 | | // write edge data again. |
| 4 | 373 | | var newEdgePointer = newP; |
| 4 | 374 | | newP += EncodeVertex(_edges, _tileId, newP, vertex1); |
| 4 | 375 | | newP += EncodeVertex(_edges, _tileId, newP, vertex2); |
| 4 | 376 | | uint? v1p = null; |
| 4 | 377 | | if (vertex1.TileId == _tileId) |
| 4 | 378 | | { |
| 4 | 379 | | v1p = _pointers[vertex1.LocalId].DecodeNullableData(); |
| 4 | 380 | | _pointers[vertex1.LocalId] = newEdgePointer.EncodeToNullableData(); |
| 4 | 381 | | } |
| | 382 | |
|
| 4 | 383 | | uint? v2P = null; |
| 4 | 384 | | if (vertex2.TileId == _tileId) |
| 4 | 385 | | { |
| 4 | 386 | | v2P = _pointers[vertex2.LocalId].DecodeNullableData(); |
| 4 | 387 | | _pointers[vertex2.LocalId] = newEdgePointer.EncodeToNullableData(); |
| 4 | 388 | | } |
| | 389 | |
|
| 4 | 390 | | newP += EncodePointer(_edges, newP, v1p); |
| 4 | 391 | | newP += EncodePointer(_edges, newP, v2P); |
| 4 | 392 | | if (crossEdgeId != null) |
| 0 | 393 | | { |
| 0 | 394 | | newP += (uint)_edges.SetDynamicUInt32(newP, crossEdgeId.Value); |
| 0 | 395 | | if (vertex1.TileId == _tileId) |
| 0 | 396 | | { |
| 0 | 397 | | _crossEdgePointers[crossEdgeId.Value] = newEdgePointer; |
| 0 | 398 | | } |
| 0 | 399 | | } |
| | 400 | |
|
| 4 | 401 | | newP += (uint)_edges.SetDynamicUInt32Nullable(newP, edgeTypeId); |
| 4 | 402 | | newP += (uint)_edges.SetDynamicUInt32Nullable(newP, length); |
| 4 | 403 | | _edges[newP] = tailHeadOrder; |
| 4 | 404 | | newP++; |
| 4 | 405 | | newP += EncodePointer(_edges, newP, shapePointer); |
| 4 | 406 | | newP += EncodePointer(_edges, newP, attributePointer); |
| 4 | 407 | | } |
| | 408 | |
|
| 10 | 409 | | _nextEdgeId = newP; |
| 10 | 410 | | _deletedEdges = null; |
| 10 | 411 | | } |
| | 412 | |
|
| | 413 | | internal NetworkTile CloneForEdgeTypeMap( |
| | 414 | | (Guid id, Func<IEnumerable<(string key, string value)>, uint> func) edgeTypeMap) |
| 6 | 415 | | { |
| 6 | 416 | | var edges = new MemoryArray<byte>(_edges.Length); |
| 6 | 417 | | var pointers = new MemoryArray<uint>(_pointers.Length); |
| 6 | 418 | | var crossEdgePointers = new MemoryArray<uint>(_crossEdgePointers.Length); |
| 6 | 419 | | var nextEdgeId = _nextEdgeId; |
| 6 | 420 | | var p = 0U; |
| 6 | 421 | | var newP = 0U; |
| 16 | 422 | | while (p < nextEdgeId) |
| 10 | 423 | | { |
| | 424 | | // read edge data. |
| 10 | 425 | | p += this.DecodeVertex(p, out var local1Id, out var tile1Id); |
| 10 | 426 | | var vertex1 = new VertexId(tile1Id, local1Id); |
| 10 | 427 | | p += this.DecodeVertex(p, out var local2Id, out var tile2Id); |
| 10 | 428 | | var vertex2 = new VertexId(tile2Id, local2Id); |
| 10 | 429 | | p += this.DecodePointer(p, out _); |
| 10 | 430 | | p += this.DecodePointer(p, out _); |
| 10 | 431 | | uint? crossEdgeId = null; |
| 10 | 432 | | if (tile1Id != tile2Id) |
| 0 | 433 | | { |
| 0 | 434 | | p += (uint)_edges.GetDynamicUInt32(p, out var c); |
| 0 | 435 | | crossEdgeId = c; |
| 0 | 436 | | } |
| | 437 | |
|
| 10 | 438 | | p += (uint)_edges.GetDynamicUInt32Nullable(p, out var _); |
| 10 | 439 | | p += (uint)_edges.GetDynamicUInt32Nullable(p, out var length); |
| 10 | 440 | | var tailHeadOrder = _edges[p]; |
| 10 | 441 | | p++; |
| 10 | 442 | | p += this.DecodePointer(p, out var shapePointer); |
| 10 | 443 | | p += this.DecodePointer(p, out var attributePointer); |
| | 444 | |
|
| | 445 | | // generate new edge type id. |
| 10 | 446 | | var newEdgeTypeId = edgeTypeMap.func(this.GetAttributes(attributePointer)); |
| | 447 | |
|
| | 448 | | // write edge data again. |
| 10 | 449 | | var newEdgePointer = newP; |
| 10 | 450 | | newP += EncodeVertex(edges, _tileId, newP, vertex1); |
| 10 | 451 | | newP += EncodeVertex(edges, _tileId, newP, vertex2); |
| 10 | 452 | | uint? v1p = null; |
| 10 | 453 | | if (vertex1.TileId == _tileId) |
| 10 | 454 | | { |
| 10 | 455 | | v1p = pointers[vertex1.LocalId].DecodeNullableData(); |
| 10 | 456 | | pointers[vertex1.LocalId] = newEdgePointer.EncodeToNullableData(); |
| 10 | 457 | | } |
| | 458 | |
|
| 10 | 459 | | uint? v2p = null; |
| 10 | 460 | | if (vertex2.TileId == _tileId) |
| 10 | 461 | | { |
| 10 | 462 | | v2p = pointers[vertex2.LocalId].DecodeNullableData(); |
| 10 | 463 | | pointers[vertex2.LocalId] = newEdgePointer.EncodeToNullableData(); |
| 10 | 464 | | } |
| | 465 | |
|
| 10 | 466 | | newP += EncodePointer(edges, newP, v1p); |
| 10 | 467 | | newP += EncodePointer(edges, newP, v2p); |
| 10 | 468 | | if (crossEdgeId != null) |
| 0 | 469 | | { |
| 0 | 470 | | newP += (uint)edges.SetDynamicUInt32(newP, crossEdgeId.Value); |
| 0 | 471 | | if (vertex1.TileId == _tileId) |
| 0 | 472 | | { |
| 0 | 473 | | crossEdgePointers[crossEdgeId.Value] = newEdgePointer; |
| 0 | 474 | | } |
| 0 | 475 | | } |
| | 476 | |
|
| 10 | 477 | | newP += (uint)edges.SetDynamicUInt32Nullable(newP, newEdgeTypeId); |
| 10 | 478 | | newP += (uint)edges.SetDynamicUInt32Nullable(newP, length); |
| 10 | 479 | | edges[newP] = tailHeadOrder; |
| 10 | 480 | | newP++; |
| 10 | 481 | | newP += EncodePointer(edges, newP, shapePointer); |
| 10 | 482 | | newP += EncodePointer(edges, newP, attributePointer); |
| 10 | 483 | | } |
| | 484 | |
|
| 6 | 485 | | return new NetworkTile(_zoom, _tileId, edgeTypeMap.id, _nextCrossTileId, pointers, edges, crossEdgePointers, |
| 6 | 486 | | _coordinates, |
| 6 | 487 | | _shapes, _attributes, _strings, _turnCosts, _nextVertexId, _nextEdgeId, |
| 6 | 488 | | _nextAttributePointer, _nextShapePointer, _nextStringId); |
| 6 | 489 | | } |
| | 490 | |
|
| | 491 | | internal uint VertexEdgePointer(uint vertex) |
| 374 | 492 | | { |
| 374 | 493 | | return _pointers[vertex]; |
| 374 | 494 | | } |
| | 495 | |
|
| | 496 | | internal static uint EncodeVertex(ArrayBase<byte> edges, uint localTileId, uint location, VertexId vertexId) |
| 568 | 497 | | { |
| 568 | 498 | | if (vertexId.TileId == localTileId) |
| 555 | 499 | | { |
| | 500 | | // same tile, only store local id. |
| 555 | 501 | | if (edges.Length <= location + 5) |
| 173 | 502 | | { |
| 173 | 503 | | edges.Resize(edges.Length + DefaultSizeIncrease); |
| 173 | 504 | | } |
| | 505 | |
|
| 555 | 506 | | return (uint)edges.SetDynamicUInt32(location, vertexId.LocalId); |
| | 507 | | } |
| | 508 | |
|
| | 509 | | // other tile, store full id. |
| 13 | 510 | | if (edges.Length <= location + 10) |
| 6 | 511 | | { |
| 6 | 512 | | edges.Resize(edges.Length + DefaultSizeIncrease); |
| 6 | 513 | | } |
| | 514 | |
|
| 13 | 515 | | var encodedId = vertexId.Encode(); |
| 13 | 516 | | return (uint)edges.SetDynamicUInt64(location, encodedId); |
| 568 | 517 | | } |
| | 518 | |
|
| | 519 | | internal uint DecodeVertex(uint location, out uint localId, out uint tileId) |
| 2304 | 520 | | { |
| 2304 | 521 | | var size = (uint)_edges.GetDynamicUInt64(location, out var encodedId); |
| 2304 | 522 | | if (encodedId < uint.MaxValue) |
| 2290 | 523 | | { |
| 2290 | 524 | | localId = (uint)encodedId; |
| 2290 | 525 | | tileId = _tileId; |
| 2290 | 526 | | return size; |
| | 527 | | } |
| | 528 | |
|
| 14 | 529 | | VertexId.Decode(encodedId, out tileId, out localId); |
| 14 | 530 | | return size; |
| 2304 | 531 | | } |
| | 532 | |
|
| | 533 | | internal uint DecodeEdgeCrossId(uint location, out uint edgeCrossId) |
| 9 | 534 | | { |
| 9 | 535 | | var s = _edges.GetDynamicUInt32(location, out var c); |
| 9 | 536 | | edgeCrossId = EdgeId.MinCrossId + c; |
| 9 | 537 | | return (uint)s; |
| 9 | 538 | | } |
| | 539 | |
|
| | 540 | | internal uint GetEdgeCrossPointer(uint edgeCrossId) |
| 3 | 541 | | { |
| 3 | 542 | | return _crossEdgePointers[edgeCrossId]; |
| 3 | 543 | | } |
| | 544 | |
|
| | 545 | | internal static uint EncodePointer(ArrayBase<byte> edges, uint location, uint? pointer) |
| 1136 | 546 | | { |
| | 547 | | // TODO: save the diff instead of the full pointer. |
| 1136 | 548 | | if (edges.Length <= location + 5) |
| 79 | 549 | | { |
| 79 | 550 | | edges.Resize(edges.Length + DefaultSizeIncrease); |
| 79 | 551 | | } |
| | 552 | |
|
| 1136 | 553 | | return (uint)edges.SetDynamicUInt32(location, |
| 1136 | 554 | | pointer.EncodeAsNullableData()); |
| 1136 | 555 | | } |
| | 556 | |
|
| | 557 | | internal uint DecodePointer(uint location, out uint? pointer) |
| 4560 | 558 | | { |
| 4560 | 559 | | var size = _edges.GetDynamicUInt32(location, out var data); |
| 4560 | 560 | | pointer = data.DecodeNullableData(); |
| 4560 | 561 | | return (uint)size; |
| 4560 | 562 | | } |
| | 563 | |
|
| | 564 | | internal static uint SetDynamicUIn32Nullable(ArrayBase<byte> edges, uint pointer, uint? data) |
| 540 | 565 | | { |
| 540 | 566 | | while (edges.Length <= pointer + 5) |
| 0 | 567 | | { |
| 0 | 568 | | edges.Resize(edges.Length + DefaultSizeIncrease); |
| 0 | 569 | | } |
| | 570 | |
|
| 540 | 571 | | return (uint)edges.SetDynamicUInt32Nullable(pointer, data); |
| 540 | 572 | | } |
| | 573 | |
|
| | 574 | | internal void GetTailHeadOrder(uint location, ref byte? tail, ref byte? head) |
| 1127 | 575 | | { |
| 1127 | 576 | | _edges.GetTailHeadOrder(location, ref tail, ref head); |
| 1127 | 577 | | } |
| | 578 | |
|
| | 579 | | internal uint DecodeEdgePointerId(uint location, out uint? edgeProfileId) |
| 2254 | 580 | | { |
| 2254 | 581 | | return (uint)_edges.GetDynamicUInt32Nullable(location, out edgeProfileId); |
| 2254 | 582 | | } |
| | 583 | |
|
| | 584 | | private void WriteEdgesAndVerticesTo(Stream stream) |
| 8 | 585 | | { |
| | 586 | | // write vertex pointers. |
| 8 | 587 | | stream.WriteVarUInt32(_nextVertexId); |
| 42 | 588 | | for (var i = 0; i < _nextVertexId; i++) |
| 13 | 589 | | { |
| 13 | 590 | | stream.WriteVarUInt32(_pointers[i]); |
| 13 | 591 | | } |
| | 592 | |
|
| | 593 | | // write edges. |
| 8 | 594 | | stream.WriteVarUInt32(_nextEdgeId); |
| 106 | 595 | | for (var i = 0; i < _nextEdgeId; i++) |
| 45 | 596 | | { |
| 45 | 597 | | stream.WriteByte(_edges[i]); |
| 45 | 598 | | } |
| | 599 | |
|
| | 600 | | // write cross edge pointers. |
| 8 | 601 | | stream.WriteVarUInt32(_nextCrossTileId); |
| 16 | 602 | | for (var i = 0; i < _nextCrossTileId; i++) |
| 0 | 603 | | { |
| 0 | 604 | | stream.WriteVarUInt32(_crossEdgePointers[i]); |
| 0 | 605 | | } |
| 8 | 606 | | } |
| | 607 | |
|
| | 608 | | private void ReadEdgesAndVerticesFrom(Stream stream) |
| 8 | 609 | | { |
| | 610 | | // read vertex pointers. |
| 8 | 611 | | _nextVertexId = stream.ReadVarUInt32(); |
| 8 | 612 | | _pointers.Resize(_nextVertexId); |
| 42 | 613 | | for (var i = 0; i < _nextVertexId; i++) |
| 13 | 614 | | { |
| 13 | 615 | | _pointers[i] = stream.ReadVarUInt32(); |
| 13 | 616 | | } |
| | 617 | |
|
| | 618 | | // read edges. |
| 8 | 619 | | _nextEdgeId = stream.ReadVarUInt32(); |
| 8 | 620 | | _edges.Resize(_nextEdgeId); |
| 106 | 621 | | for (var i = 0; i < _nextEdgeId; i++) |
| 45 | 622 | | { |
| 45 | 623 | | _edges[i] = (byte)stream.ReadByte(); |
| 45 | 624 | | } |
| | 625 | |
|
| | 626 | | // read cross tile edge pointers. |
| 8 | 627 | | _nextCrossTileId = stream.ReadVarUInt32(); |
| 8 | 628 | | _crossEdgePointers.Resize(_nextCrossTileId); |
| 16 | 629 | | for (var i = 0; i < _nextCrossTileId; i++) |
| 0 | 630 | | { |
| 0 | 631 | | _crossEdgePointers[i] = stream.ReadVarUInt32(); |
| 0 | 632 | | } |
| 8 | 633 | | } |
| | 634 | | } |