Class PointKDTree

void Add (

GraphNode

node

)

Add the node to the tree.

void GetInRange (

Int3	point	Nodes around this point will be added to the buffer.
long	sqrRadius	squared maximum distance in Int3 space. If you are converting from world space you will need to multiply by Int3.Precision: var sqrRadius = (worldSpaceRadius * Int3.Precision) * (worldSpaceRadius * Int3.Precision);
List<GraphNode>	buffer	All nodes will be added to this list.

)

Add all nodes within a squared distance of the point to the buffer.

GraphNode GetNearest (

Int3	point
NNConstraint	constraint

)

Closest node to the point which satisfies the constraint.

PointKDTree ()

void Rebuild (

GraphNode[]	nodes
int	start
int	end

)

Rebuild the tree starting with all nodes in the array between index start (inclusive) and end (exclusive)

const int LeafArraySize = LeafSize*2 + 1

const int LeafSize = 10

void Add (

GraphNode	point
int	index
int	depth=0

)

Stack<GraphNode[]> arrayCache = new Stack<GraphNode[]>()

void Build (

int	index
List<GraphNode>	nodes
int	start
int	end

)

void CollectAndClear (

int	index
List<GraphNode>	buffer

)

IComparer<GraphNode> [] comparers = new IComparer<GraphNode>[] { new CompareX(), new CompareY(), new CompareZ() }

void EnsureSize (

int

index

)

void GetInRangeInternal (

int	index
Int3	point
long	sqrRadius
List<GraphNode>	buffer

)

void GetNearestInternal (

int	index
Int3	point
NNConstraint	constraint
refGraphNode	best
ref long	bestSqrDist

)

GraphNode[] GetOrCreateList ()

List<GraphNode> largeList = new List<GraphNode>()

int MaxAllowedSize (

int	numNodes
int	depth

)

int numNodes = 0

void Rebalance (

int

index

)

int Size (

int

index

)

Node[] tree = new Node[16]