Class GlobalNodeStorage

Unity.Jobs.JobHandle AllocateNodesJob<T> (

T[]	result
int	count
System.Func<T>	createNode
uint	variantsPerNode

)

void DestroyNode (

GraphNode

node

)

Destroyes the given node.

This is to be called after the node has been disconnected from the graph so that it cannot be reached from any other nodes. It should only be called during graph updates, that is when the pathfinding threads are either not running or paused.

GraphNode GetNode (

uint

nodeIndex

)

GlobalNodeStorage (

AstarPath

astar

)

void GrowTemporaryNodeStorage (

int

threadID

)

Grows temporary node storage for the given thread.

This can happen if a path traverses a lot of off-mesh links, or if it is a multi-target path with a lot of targets.

If enough nodes are created that we have a to grow the regular node storage, then the number of temporary nodes will grow to the same value on all threads.

void InitializeNode (

GraphNode

node

)

Initializes temporary path data for a node.

void OnDisable ()

void SetThreadCount (

int

threadCount

)

uint destroyedNodesVersion

Number of nodes that have been destroyed in total.

uint nextNodeIndex = 1

Holds the next node index which has not been used by any previous node.

PathfindingThreadData[] pathfindingThreadData = new PathfindingThreadData[0]

uint reservedPathNodeData = 0

The number of nodes for which path node data has been reserved.

Will be at least as high as nextNodeIndex

void DisposeThreadData ()

const int InitialTemporaryNodes = 256

void ReserveNodeIndices (

uint

nextNodeIndex

)

Reserves space for global node data.

AstarPath astar

Unity.Jobs.JobHandle lastAllocationJob

IndexedStack<uint >[] nodeIndexPools = new [] { new IndexedStack<uint>(), new IndexedStack<uint>(), new IndexedStack<uint>(), }

Holds indices for nodes that have been destroyed.

To avoid trashing a lot of memory structures when nodes are frequently deleted and created, node indices are reused.

There's one pool for each possible number of node variants (1, 2 and 3).

GraphNode[] nodes = new GraphNode[0]

Maps from NodeIndex to node.

int temporaryNodeCount = InitialTemporaryNodes