Struct RVOQuadtreeBurst

JobBuild BuildJob (

NativeArray<float3>	agentPositions
NativeArray<AgentIndex>	agentVersions
NativeArray<float>	agentSpeeds
NativeArray<float>	agentRadii
int	numAgents
MovementPlane	movementPlane

)

void DebugDraw (

CommandBuilder

draw

)

void DebugDraw (

int	nodeIndex
float3	nodeMin
float3	nodeMax
CommandBuilder	draw

)

void Dispose ()

float QueryArea (

float3	position
float	radius

)

Find the total agent area inside the circle at position with the given radius.

float QueryAreaRec (

int	treeNodeIndex
float3	p
float	radius
float3	nodeMin
float3	nodeMax

)

void QueryKNearest (

QuadtreeQuery

query

)

void QueryRec (

refQuadtreeQuery	query
int	treeNodeIndex
float3	nodeMin
float3	nodeMax
ref float	maxRadius

)

void Reserve (

int

minSize

)

int InnerNodeCountUpperBound (

int	numAgents
MovementPlane	movementPlane

)

static RVOQuadtreeBurst ()

NativeArray<int> agentCountBuffer

NativeArray<float3> agentPositions

NativeArray<float> agentRadii

NativeArray<int> agents

NativeArray<float3> boundingBoxBuffer

Rect? bounds

NativeArray<int> childPointers

NativeArray<float> maxRadius

NativeArray<float> maxSpeeds

MovementPlane movementPlane

NativeArray<float> nodeAreas

const int BitPackingMask = (1 << BitPackingShift) - 1

const int BitPackingShift = 15

byte[] ChildLookup = new byte[256]

For a given number, contains the index of the first non-zero bit.

Only the values 0 through 15 are used when movementPlane is XZ or XY.

Use bytes instead of ints to save some precious L1 cache memory.

const int LeafNodeBit = 1 << 30

const int LeafSize = 16

const int MaxAgents = BitPackingMask

const int MaxDepth = 10