Struct BurstPathfindingJob
Burst-compiled A* pathfinding job. Uses binary min-heap for O(log n) priority queue operations.
[BurstCompile]
public struct BurstPathfindingJob
Fields
adjacencyData
public NativeAdjacencyData adjacencyData
Field Value
cameFrom
public NativeHashMap<ushort, ushort> cameFrom
Field Value
- NativeHashMap<ushort, ushort>
closedSet
public NativeHashSet<ushort> closedSet
Field Value
- NativeHashSet<ushort>
gScore
public NativeHashMap<ushort, FixedPoint64> gScore
Field Value
- NativeHashMap<ushort, FixedPoint64>
goal
public ushort goal
Field Value
- ushort
neighborBuffer
public NativeList<ushort> neighborBuffer
Field Value
- NativeList<ushort>
openHeap
public NativeMinHeap<PathfindingNode> openHeap
Field Value
pathResult
public NativeList<ushort> pathResult
Field Value
- NativeList<ushort>
start
public ushort start
Field Value
- ushort
Methods
Execute()
Implement this method to perform work on a worker thread.
public void Execute()