Class GridIterationUtilities

void FilterNodeConnections<T> (

IntBounds	bounds	Sub-rectangle of the grid graph that is being updated/scanned
NativeArray<ulong>	nodeConnections	Data with all node connections.
bool	layeredDataLayout	Should be true for layered grid graphs and false otherwise.
ref T	filter	Your callback struct. The IsValidConnection method on the callback struct will be called for each connection. If false is returned, the connection will be disabled.

)

Iterate through all enabled connections of all nodes.

void ForEachCellIn3DArray<T> (

int3	size	Size of the array.
ref T	action	Your callback struct. The Execute method on the callback struct will be called for each element in the array. It will be passed the x, y and z coordinates of the element as well as the index in the array.

)

Iterates over a 3D array.

This is a helper for iterating over grid graph data, which is typically stored in an array of size width*layers*depth (x*y*z).

In burst-compiled code, this will be essentially as fast as writing the loop code yourself. In C#, it is marginally slower than writing the loop code yourself.

void ForEachCellIn3DSlice<T> (

Slice3D	slice	Bounds of the slice and the size of the outer array it is relative to.
ref T	action	Your callback struct. The Execute method on the callback struct will be called for each element in the slice. It will be passed both the index in the slice and the index in the outer array.

)

Iterates over a slice of a 3D array.

This is a helper for iterating over grid graph data, which is typically stored in an array of size width*layers*depth (x*y*z).

In burst-compiled code, this will be essentially as fast as writing the loop code yourself. In C#, it is marginally slower than writing the loop code yourself.

void ForEachCellIn3DSliceWithCoords<T> (

Slice3D	slice	Bounds of the slice and the size of the outer array it is relative to.
ref T	action	Your callback struct. The Execute method on the callback struct will be called for each element in the slice. It will be passed both the index in the slice and the index in the outer array.

)

Iterates over a slice of a 3D array.

This is a helper for iterating over grid graph data, which is typically stored in an array of size width*layers*depth (x*y*z).

In burst-compiled code, this will be essentially as fast as writing the loop code yourself. In C#, it is marginally slower than writing the loop code yourself.

void ForEachNode<T> (

int3	arrayBounds	Size of the rectangle of the grid graph that is being updated/scanned
NativeArray<float4>	nodeNormals	Data for all node normals. This is used to determine if a node exists (important for layered grid graphs).
ref T	callback	The ModifyNode method on the callback struct will be called for each node.

)

Iterate through all nodes that exist.

? int GetNeighbourDataIndex (

IntBounds	bounds	Sub-rectangle of the grid graph that is being updated/scanned
NativeArray<ulong>	nodeConnections	Data for all node connections
bool	layeredDataLayout	True if this is a layered grid graph
int	dataX	X coordinate in the data arrays for the node for which you want to get a neighbour
int	dataLayer	Layer (Y) coordinate in the data arrays for the node for which you want to get a neighbour
int	dataZ	Z coordinate in the data arrays for the node for which you want to get a neighbour
int	direction	Direction to the neighbour. See GridNode.HasConnectionInDirection.

)

Returns the data index for a node's neighbour in the given direction.

The bounds, nodeConnections and layeredDataLayout fields can be retrieved from the GridGraphRules.Context.data object.