| | | 1 | | using FixedMathSharp; |
| | | 2 | | using GridForge.Grids; |
| | | 3 | | using GridForge.Spatial; |
| | | 4 | | using SwiftCollections; |
| | | 5 | | using System; |
| | | 6 | | |
| | | 7 | | namespace Trailblazer.Pathing; |
| | | 8 | | |
| | | 9 | | /// <summary> |
| | | 10 | | /// Default-context facade for conservative solid-partition connectivity snapshots used for fast unreachable-route rejec |
| | | 11 | | /// </summary> |
| | | 12 | | internal static class SolidPartitionReachability |
| | | 13 | | { |
| | 10108 | 14 | | private static SolidPartitionReachabilityState State => PathManager.ActiveState.ReachabilityState; |
| | | 15 | | |
| | 1153 | 16 | | private static object _lock => State.Lock; |
| | | 17 | | |
| | | 18 | | private static SwiftDictionary<WorldVoxelIndex, SolidChartPartition> _passablePartitions => |
| | 804 | 19 | | State.PassablePartitions; |
| | | 20 | | |
| | 493 | 21 | | private static SwiftList<SolidChartPartition> _componentRoots => State.ComponentRoots; |
| | | 22 | | |
| | 182 | 23 | | private static SwiftQueue<SolidChartPartition> _componentQueue => State.ComponentQueue; |
| | | 24 | | |
| | | 25 | | private static ReachabilitySnapshotKey _activeSnapshotKey |
| | | 26 | | { |
| | 1089 | 27 | | get => State.ActiveSnapshotKey; |
| | 58 | 28 | | set => State.ActiveSnapshotKey = value; |
| | | 29 | | } |
| | | 30 | | |
| | | 31 | | private static bool _hasActiveSnapshot |
| | | 32 | | { |
| | 1153 | 33 | | get => State.HasActiveSnapshot; |
| | 58 | 34 | | set => State.HasActiveSnapshot = value; |
| | | 35 | | } |
| | | 36 | | |
| | | 37 | | private static int _activeSnapshotId |
| | | 38 | | { |
| | 1261 | 39 | | get => State.ActiveSnapshotId; |
| | 58 | 40 | | set => State.ActiveSnapshotId = value; |
| | | 41 | | } |
| | | 42 | | |
| | | 43 | | private static int _activeSnapshotVersion |
| | | 44 | | { |
| | 1145 | 45 | | get => State.ActiveSnapshotVersion; |
| | 116 | 46 | | set => State.ActiveSnapshotVersion = value; |
| | | 47 | | } |
| | | 48 | | |
| | | 49 | | private static long _snapshotBuildCount |
| | | 50 | | { |
| | 66 | 51 | | get => State.SnapshotBuildCount; |
| | 58 | 52 | | set => State.SnapshotBuildCount = value; |
| | | 53 | | } |
| | | 54 | | |
| | | 55 | | private static int _version |
| | | 56 | | { |
| | 2414 | 57 | | get => State.Version; |
| | 0 | 58 | | set => State.Version = value; |
| | | 59 | | } |
| | | 60 | | |
| | | 61 | | /// <summary> |
| | | 62 | | /// Clears cached connectivity snapshots after live solid topology changes. |
| | | 63 | | /// </summary> |
| | 4470 | 64 | | internal static void Invalidate() => Invalidate(PathManager.ActiveState); |
| | | 65 | | |
| | | 66 | | /// <summary> |
| | | 67 | | /// Clears cached connectivity snapshots on an explicit pathing state after live solid topology changes. |
| | | 68 | | /// </summary> |
| | | 69 | | internal static void Invalidate(PathingWorldState state) |
| | | 70 | | { |
| | 4478 | 71 | | if (state == null) |
| | 1 | 72 | | throw new ArgumentNullException(nameof(state)); |
| | | 73 | | |
| | 4477 | 74 | | SolidPartitionReachabilityState reachabilityState = state.ReachabilityState; |
| | 4477 | 75 | | lock (reachabilityState.Lock) |
| | | 76 | | { |
| | 4477 | 77 | | unchecked { reachabilityState.Version++; } |
| | 4477 | 78 | | reachabilityState.HasActiveSnapshot = false; |
| | 4477 | 79 | | reachabilityState.ActiveSnapshotVersion = -1; |
| | 4477 | 80 | | } |
| | 4477 | 81 | | } |
| | | 82 | | |
| | | 83 | | /// <summary> |
| | | 84 | | /// Captures reachability snapshot state for benchmarks and regression tests. |
| | | 85 | | /// </summary> |
| | | 86 | | internal static SolidPartitionReachabilityStats CaptureStats() |
| | | 87 | | { |
| | 8 | 88 | | lock (_lock) |
| | | 89 | | { |
| | 8 | 90 | | return new SolidPartitionReachabilityStats( |
| | 8 | 91 | | _hasActiveSnapshot ? 1 : 0, |
| | 8 | 92 | | _version, |
| | 8 | 93 | | _snapshotBuildCount, |
| | 8 | 94 | | _passablePartitions.Capacity, |
| | 8 | 95 | | _componentRoots.Capacity, |
| | 8 | 96 | | _componentQueue.Capacity); |
| | | 97 | | } |
| | 8 | 98 | | } |
| | | 99 | | |
| | | 100 | | /// <summary> |
| | | 101 | | /// Returns true only when the current solid-partition graph proves the request cannot reach its destination. |
| | | 102 | | /// </summary> |
| | | 103 | | internal static bool IsProvablyUnreachable(AStarPathRequest request) |
| | | 104 | | { |
| | 1197 | 105 | | if (request == null |
| | 1197 | 106 | | || request.AllowTraversalTransitions |
| | 1197 | 107 | | || request.AllowUnwalkableEndpoints |
| | 1197 | 108 | | || request.StartNode == null |
| | 1197 | 109 | | || request.EndNode == null |
| | 1197 | 110 | | || !request.StartNode.TryGetPartition(out SolidChartPartition? startPartition) |
| | 1197 | 111 | | || !request.EndNode.TryGetPartition(out SolidChartPartition? endPartition) |
| | 1197 | 112 | | || startPartition == null |
| | 1197 | 113 | | || endPartition == null |
| | 1197 | 114 | | || ReferenceEquals(startPartition, endPartition) |
| | 1197 | 115 | | || startPartition.Neighbors == null |
| | 1197 | 116 | | || endPartition.Neighbors == null) |
| | | 117 | | { |
| | 52 | 118 | | return false; |
| | | 119 | | } |
| | | 120 | | |
| | 1145 | 121 | | ReachabilitySnapshotKey key = new(request.UnitSize, request.MaxClimbHeight); |
| | 1145 | 122 | | lock (_lock) |
| | | 123 | | { |
| | 1145 | 124 | | int snapshotId = EnsureSnapshot(key); |
| | 1145 | 125 | | return IsProvablyUnreachable( |
| | 1145 | 126 | | startPartition, |
| | 1145 | 127 | | endPartition, |
| | 1145 | 128 | | snapshotId, |
| | 1145 | 129 | | _version, |
| | 1145 | 130 | | request.MaxClimbHeight); |
| | | 131 | | } |
| | 1145 | 132 | | } |
| | | 133 | | |
| | | 134 | | private static bool IsProvablyUnreachable( |
| | | 135 | | SolidChartPartition startPartition, |
| | | 136 | | SolidChartPartition endPartition, |
| | | 137 | | int snapshotId, |
| | | 138 | | int version, |
| | | 139 | | Fixed64 maxClimbHeight) |
| | | 140 | | { |
| | 1145 | 141 | | if (!endPartition.TryGetReachabilityComponent(snapshotId, version, out int endComponent)) |
| | 0 | 142 | | return false; |
| | | 143 | | |
| | 1145 | 144 | | if (endComponent == 0) |
| | 0 | 145 | | return true; |
| | | 146 | | |
| | 1145 | 147 | | if (!startPartition.TryGetReachabilityComponent(snapshotId, version, out int startComponent)) |
| | 0 | 148 | | return false; |
| | | 149 | | |
| | 1145 | 150 | | if (startComponent > 0) |
| | 1145 | 151 | | return startComponent != endComponent; |
| | | 152 | | |
| | | 153 | | // A* can expand from an oversized/low-clearance start voxel, but only into passable |
| | | 154 | | // neighboring partitions. If none of those neighbors are in the end component, no route exists. |
| | 0 | 155 | | return !HasReachableNeighborInComponent(startPartition, endComponent, snapshotId, version, maxClimbHeight); |
| | | 156 | | } |
| | | 157 | | |
| | | 158 | | private static int EnsureSnapshot(ReachabilitySnapshotKey key) |
| | | 159 | | { |
| | 1145 | 160 | | if (!_hasActiveSnapshot || !_activeSnapshotKey.Equals(key)) |
| | | 161 | | { |
| | 58 | 162 | | _activeSnapshotKey = key; |
| | 58 | 163 | | _activeSnapshotId = GetNextSnapshotId(_activeSnapshotId); |
| | 58 | 164 | | _activeSnapshotVersion = -1; |
| | 58 | 165 | | _hasActiveSnapshot = true; |
| | | 166 | | } |
| | | 167 | | |
| | 1145 | 168 | | if (_activeSnapshotVersion == _version) |
| | 1087 | 169 | | return _activeSnapshotId; |
| | | 170 | | |
| | 58 | 171 | | BuildSnapshot(_activeSnapshotId, key.UnitSize, key.MaxClimbHeight, _version); |
| | 58 | 172 | | _activeSnapshotVersion = _version; |
| | 58 | 173 | | _snapshotBuildCount++; |
| | 58 | 174 | | return _activeSnapshotId; |
| | | 175 | | } |
| | | 176 | | |
| | | 177 | | private static int GetNextSnapshotId(int current) |
| | | 178 | | { |
| | | 179 | | unchecked |
| | | 180 | | { |
| | 58 | 181 | | int next = current + 1; |
| | 58 | 182 | | return next == 0 ? 1 : next; |
| | | 183 | | } |
| | | 184 | | } |
| | | 185 | | |
| | | 186 | | private static void BuildSnapshot( |
| | | 187 | | int snapshotId, |
| | | 188 | | Fixed64 unitSize, |
| | | 189 | | Fixed64 maxClimbHeight, |
| | | 190 | | int version) |
| | | 191 | | { |
| | | 192 | | // Snapshot construction runs under the reachability lock, so these scratch containers |
| | | 193 | | // can be reused without exposing partition references after the build completes. |
| | 58 | 194 | | _passablePartitions.Clear(); |
| | 58 | 195 | | _componentRoots.Clear(); |
| | 58 | 196 | | _componentQueue.Clear(); |
| | | 197 | | |
| | | 198 | | try |
| | | 199 | | { |
| | 58 | 200 | | GridWorld world = PathManager.ActiveState.World; |
| | 290 | 201 | | foreach (NavigationChart chart in PathManager.AllCharts) |
| | | 202 | | { |
| | 87 | 203 | | if (chart == null || !PathManager.IsChartInitialized(chart.Name)) |
| | | 204 | | continue; |
| | | 205 | | |
| | 1292 | 206 | | foreach ((Vector3d position, NavigationChartCell cell) in chart.GetAuthoredCells()) |
| | | 207 | | { |
| | 559 | 208 | | if (!cell.HasSolid |
| | 559 | 209 | | || !world.TryGetVoxel(position, out Voxel? voxel) |
| | 559 | 210 | | || voxel == null |
| | 559 | 211 | | || !voxel.TryGetPartition(out SolidChartPartition? partition) |
| | 559 | 212 | | || partition == null |
| | 559 | 213 | | || partition.Neighbors == null) |
| | | 214 | | { |
| | | 215 | | continue; |
| | | 216 | | } |
| | | 217 | | |
| | 502 | 218 | | partition.SetReachabilityComponent(snapshotId, version, 0); |
| | 502 | 219 | | if (partition.IsImpassable(unitSize) || _passablePartitions.ContainsKey(partition.WorldIndex)) |
| | | 220 | | continue; |
| | | 221 | | |
| | 311 | 222 | | _passablePartitions[partition.WorldIndex] = partition; |
| | 311 | 223 | | _componentRoots.Add(partition); |
| | | 224 | | } |
| | | 225 | | } |
| | | 226 | | |
| | 58 | 227 | | AssignComponents( |
| | 58 | 228 | | snapshotId, |
| | 58 | 229 | | version, |
| | 58 | 230 | | _passablePartitions, |
| | 58 | 231 | | _componentRoots, |
| | 58 | 232 | | _componentQueue, |
| | 58 | 233 | | maxClimbHeight); |
| | 58 | 234 | | } |
| | | 235 | | finally |
| | | 236 | | { |
| | 58 | 237 | | _componentQueue.Clear(); |
| | 58 | 238 | | _componentRoots.Clear(); |
| | 58 | 239 | | _passablePartitions.Clear(); |
| | 58 | 240 | | } |
| | 58 | 241 | | } |
| | | 242 | | |
| | | 243 | | private static void AssignComponents( |
| | | 244 | | int snapshotId, |
| | | 245 | | int version, |
| | | 246 | | SwiftDictionary<WorldVoxelIndex, SolidChartPartition> passablePartitions, |
| | | 247 | | SwiftList<SolidChartPartition> componentRoots, |
| | | 248 | | SwiftQueue<SolidChartPartition> queue, |
| | | 249 | | Fixed64 maxClimbHeight) |
| | | 250 | | { |
| | 58 | 251 | | int componentId = 0; |
| | | 252 | | |
| | 738 | 253 | | for (int i = 0; i < componentRoots.Count; i++) |
| | | 254 | | { |
| | 311 | 255 | | SolidChartPartition root = componentRoots[i]; |
| | 311 | 256 | | if (!root.TryGetReachabilityComponent(snapshotId, version, out int existingComponent) |
| | 311 | 257 | | || existingComponent != 0) |
| | | 258 | | { |
| | | 259 | | continue; |
| | | 260 | | } |
| | | 261 | | |
| | 80 | 262 | | componentId++; |
| | 80 | 263 | | root.SetReachabilityComponent(snapshotId, version, componentId); |
| | 80 | 264 | | queue.Enqueue(root); |
| | | 265 | | |
| | 391 | 266 | | while (queue.Count > 0) |
| | | 267 | | { |
| | 311 | 268 | | SolidChartPartition current = queue.Dequeue(); |
| | 311 | 269 | | SolidChartPartition?[]? neighbors = current.Neighbors; |
| | 311 | 270 | | if (neighbors == null) |
| | | 271 | | continue; |
| | | 272 | | |
| | 16794 | 273 | | for (int neighborIndex = 0; neighborIndex < neighbors.Length; neighborIndex++) |
| | | 274 | | { |
| | 8086 | 275 | | SolidChartPartition? neighbor = neighbors[neighborIndex]; |
| | 8086 | 276 | | if (neighbor == null |
| | 8086 | 277 | | || !passablePartitions.ContainsKey(neighbor.WorldIndex) |
| | 8086 | 278 | | || !neighbor.TryGetReachabilityComponent(snapshotId, version, out int neighborComponent) |
| | 8086 | 279 | | || neighborComponent != 0 |
| | 8086 | 280 | | || !CanTraverse(current, neighbor, (SpatialDirection)neighborIndex, passablePartitions, maxClimb |
| | | 281 | | { |
| | | 282 | | continue; |
| | | 283 | | } |
| | | 284 | | |
| | 231 | 285 | | neighbor.SetReachabilityComponent(snapshotId, version, componentId); |
| | 231 | 286 | | queue.Enqueue(neighbor); |
| | | 287 | | } |
| | | 288 | | } |
| | | 289 | | } |
| | 58 | 290 | | } |
| | | 291 | | |
| | | 292 | | private static bool HasReachableNeighborInComponent( |
| | | 293 | | SolidChartPartition start, |
| | | 294 | | int targetComponent, |
| | | 295 | | int snapshotId, |
| | | 296 | | int version, |
| | | 297 | | Fixed64 maxClimbHeight) |
| | | 298 | | { |
| | 3 | 299 | | SolidChartPartition?[]? neighbors = start.Neighbors; |
| | 3 | 300 | | if (neighbors == null) |
| | 1 | 301 | | return false; |
| | | 302 | | |
| | 60 | 303 | | for (int neighborIndex = 0; neighborIndex < neighbors.Length; neighborIndex++) |
| | | 304 | | { |
| | 29 | 305 | | SolidChartPartition? neighbor = neighbors[neighborIndex]; |
| | 29 | 306 | | if (neighbor == null |
| | 29 | 307 | | || !neighbor.TryGetReachabilityComponent(snapshotId, version, out int neighborComponent) |
| | 29 | 308 | | || neighborComponent != targetComponent |
| | 29 | 309 | | || !CanTraverseFromMarkedStart(start, neighbor, (SpatialDirection)neighborIndex, snapshotId, version, ma |
| | | 310 | | { |
| | | 311 | | continue; |
| | | 312 | | } |
| | | 313 | | |
| | 1 | 314 | | return true; |
| | | 315 | | } |
| | | 316 | | |
| | 1 | 317 | | return false; |
| | | 318 | | } |
| | | 319 | | |
| | | 320 | | private static bool CanTraverse( |
| | | 321 | | SolidChartPartition current, |
| | | 322 | | SolidChartPartition neighbor, |
| | | 323 | | SpatialDirection direction, |
| | | 324 | | SwiftDictionary<WorldVoxelIndex, SolidChartPartition> passablePartitions, |
| | | 325 | | Fixed64 maxClimbHeight) |
| | | 326 | | { |
| | 259 | 327 | | Fixed64 heightDifference = (current.VoxelPosition.y - neighbor.VoxelPosition.y).Abs(); |
| | 259 | 328 | | if (heightDifference > maxClimbHeight) |
| | 0 | 329 | | return false; |
| | | 330 | | |
| | 259 | 331 | | if (ContainsDirection(SpatialAwareness.PerpendicularDirections, direction)) |
| | 194 | 332 | | return true; |
| | | 333 | | |
| | 65 | 334 | | return ContainsDirection(SpatialAwareness.DiagonalDirections, direction) |
| | 65 | 335 | | && HasValidDiagonalLegs(current, direction, passablePartitions); |
| | | 336 | | } |
| | | 337 | | |
| | | 338 | | private static bool CanTraverseFromMarkedStart( |
| | | 339 | | SolidChartPartition current, |
| | | 340 | | SolidChartPartition neighbor, |
| | | 341 | | SpatialDirection direction, |
| | | 342 | | int snapshotId, |
| | | 343 | | int version, |
| | | 344 | | Fixed64 maxClimbHeight) |
| | | 345 | | { |
| | 4 | 346 | | Fixed64 heightDifference = (current.VoxelPosition.y - neighbor.VoxelPosition.y).Abs(); |
| | 4 | 347 | | if (heightDifference > maxClimbHeight) |
| | 1 | 348 | | return false; |
| | | 349 | | |
| | 3 | 350 | | if (ContainsDirection(SpatialAwareness.PerpendicularDirections, direction)) |
| | 1 | 351 | | return true; |
| | | 352 | | |
| | 2 | 353 | | return ContainsDirection(SpatialAwareness.DiagonalDirections, direction) |
| | 2 | 354 | | && HasValidDiagonalLegsFromMarkedStart(current, direction, snapshotId, version); |
| | | 355 | | } |
| | | 356 | | |
| | | 357 | | private static bool HasValidDiagonalLegs( |
| | | 358 | | SolidChartPartition current, |
| | | 359 | | SpatialDirection diagonal, |
| | | 360 | | SwiftDictionary<WorldVoxelIndex, SolidChartPartition> passablePartitions) |
| | | 361 | | { |
| | 65 | 362 | | (int dx, int dy, int dz) = SpatialAwareness.DirectionOffsets[(int)diagonal]; |
| | | 363 | | |
| | 65 | 364 | | if (dx != 0 && !IsLegClear(current, DiagonalTraversalLegs.ForXOffset(dx), passablePartitions)) |
| | 13 | 365 | | return false; |
| | | 366 | | |
| | 52 | 367 | | if (dy != 0 && !IsLegClear(current, DiagonalTraversalLegs.ForYOffset(dy), passablePartitions)) |
| | 0 | 368 | | return false; |
| | | 369 | | |
| | 52 | 370 | | if (dz != 0 && !IsLegClear(current, DiagonalTraversalLegs.ForZOffset(dz), passablePartitions)) |
| | 15 | 371 | | return false; |
| | | 372 | | |
| | 37 | 373 | | return true; |
| | | 374 | | } |
| | | 375 | | |
| | | 376 | | private static bool HasValidDiagonalLegsFromMarkedStart( |
| | | 377 | | SolidChartPartition current, |
| | | 378 | | SpatialDirection diagonal, |
| | | 379 | | int snapshotId, |
| | | 380 | | int version) |
| | | 381 | | { |
| | 2 | 382 | | (int dx, int dy, int dz) = SpatialAwareness.DirectionOffsets[(int)diagonal]; |
| | | 383 | | |
| | 2 | 384 | | if (dx != 0 && !IsMarkedLegClear(current, DiagonalTraversalLegs.ForXOffset(dx), snapshotId, version)) |
| | 0 | 385 | | return false; |
| | | 386 | | |
| | 2 | 387 | | if (dy != 0 && !IsMarkedLegClear(current, DiagonalTraversalLegs.ForYOffset(dy), snapshotId, version)) |
| | 0 | 388 | | return false; |
| | | 389 | | |
| | 2 | 390 | | if (dz != 0 && !IsMarkedLegClear(current, DiagonalTraversalLegs.ForZOffset(dz), snapshotId, version)) |
| | 1 | 391 | | return false; |
| | | 392 | | |
| | 1 | 393 | | return true; |
| | | 394 | | } |
| | | 395 | | |
| | | 396 | | private static bool IsLegClear( |
| | | 397 | | SolidChartPartition current, |
| | | 398 | | SpatialDirection legDirection, |
| | | 399 | | SwiftDictionary<WorldVoxelIndex, SolidChartPartition> passablePartitions) |
| | | 400 | | { |
| | 117 | 401 | | SolidChartPartition? leg = current.Neighbors?[(int)legDirection]; |
| | 117 | 402 | | return leg != null && passablePartitions.ContainsKey(leg.WorldIndex); |
| | | 403 | | } |
| | | 404 | | |
| | | 405 | | private static bool IsMarkedLegClear( |
| | | 406 | | SolidChartPartition current, |
| | | 407 | | SpatialDirection legDirection, |
| | | 408 | | int snapshotId, |
| | | 409 | | int version) |
| | | 410 | | { |
| | 6 | 411 | | SolidChartPartition? leg = current.Neighbors?[(int)legDirection]; |
| | 6 | 412 | | return leg != null |
| | 6 | 413 | | && leg.TryGetReachabilityComponent(snapshotId, version, out int componentId) |
| | 6 | 414 | | && componentId > 0; |
| | | 415 | | } |
| | | 416 | | |
| | | 417 | | private static bool ContainsDirection(SpatialDirection[] directions, SpatialDirection direction) |
| | | 418 | | { |
| | 2788 | 419 | | for (int i = 0; i < directions.Length; i++) |
| | | 420 | | { |
| | 1327 | 421 | | if (directions[i] == direction) |
| | 262 | 422 | | return true; |
| | | 423 | | } |
| | | 424 | | |
| | 67 | 425 | | return false; |
| | | 426 | | } |
| | | 427 | | |
| | | 428 | | /// <summary> |
| | | 429 | | /// Snapshot counters used by benchmarks and tests to verify reachability cache policy. |
| | | 430 | | /// </summary> |
| | | 431 | | internal readonly struct SolidPartitionReachabilityStats |
| | | 432 | | { |
| | | 433 | | internal SolidPartitionReachabilityStats( |
| | | 434 | | int activeSnapshotCount, |
| | | 435 | | int version, |
| | | 436 | | long snapshotBuildCount, |
| | | 437 | | int passablePartitionCapacity, |
| | | 438 | | int componentRootCapacity, |
| | | 439 | | int componentQueueCapacity) |
| | | 440 | | { |
| | 8 | 441 | | ActiveSnapshotCount = activeSnapshotCount; |
| | 8 | 442 | | Version = version; |
| | 8 | 443 | | SnapshotBuildCount = snapshotBuildCount; |
| | 8 | 444 | | PassablePartitionCapacity = passablePartitionCapacity; |
| | 8 | 445 | | ComponentRootCapacity = componentRootCapacity; |
| | 8 | 446 | | ComponentQueueCapacity = componentQueueCapacity; |
| | 8 | 447 | | } |
| | | 448 | | |
| | | 449 | | /// <summary> |
| | | 450 | | /// Gets the number of snapshot keys currently retained by the reachability cache. |
| | | 451 | | /// </summary> |
| | | 452 | | internal int ActiveSnapshotCount { get; } |
| | | 453 | | |
| | | 454 | | /// <summary> |
| | | 455 | | /// Gets the current topology version tracked by the reachability cache. |
| | | 456 | | /// </summary> |
| | | 457 | | internal int Version { get; } |
| | | 458 | | |
| | | 459 | | /// <summary> |
| | | 460 | | /// Gets the number of connectivity snapshots built since process start. |
| | | 461 | | /// </summary> |
| | | 462 | | internal long SnapshotBuildCount { get; } |
| | | 463 | | |
| | | 464 | | /// <summary> |
| | | 465 | | /// Gets the retained capacity of the passable-partition scratch map. |
| | | 466 | | /// </summary> |
| | | 467 | | internal int PassablePartitionCapacity { get; } |
| | | 468 | | |
| | | 469 | | /// <summary> |
| | | 470 | | /// Gets the retained capacity of the component-root scratch list. |
| | | 471 | | /// </summary> |
| | | 472 | | internal int ComponentRootCapacity { get; } |
| | | 473 | | |
| | | 474 | | /// <summary> |
| | | 475 | | /// Gets the retained capacity of the component queue. |
| | | 476 | | /// </summary> |
| | | 477 | | internal int ComponentQueueCapacity { get; } |
| | | 478 | | } |
| | | 479 | | |
| | | 480 | | } |