A* Pathfinding Project  4.3.5
The A* Pathfinding Project for Unity 3D
PointKDTree Member List

This is the complete list of members for PointKDTree, including all inherited members.

Add(GraphNode node)PointKDTree
Add(GraphNode point, int index, int depth=0)PointKDTreeprivate
arrayCachePointKDTreeprivate
Build(int index, List< GraphNode > nodes, int start, int end)PointKDTreeprivate
CollectAndClear(int index, List< GraphNode > buffer)PointKDTreeprivate
comparersPointKDTreeprivatestatic
EnsureSize(int index)PointKDTreeprivate
GetInRange(Int3 point, long sqrRadius, List< GraphNode > buffer)PointKDTree
GetInRangeInternal(int index, Int3 point, long sqrRadius, List< GraphNode > buffer)PointKDTreeprivate
GetNearest(Int3 point, NNConstraint constraint)PointKDTree
GetNearestConnection(Int3 point, NNConstraint constraint, long maximumSqrConnectionLength)PointKDTree
GetNearestConnectionInternal(int index, Int3 point, NNConstraint constraint, ref GraphNode best, ref long bestSqrDist, long distanceThresholdOffset)PointKDTreeprivate
GetNearestInternal(int index, Int3 point, NNConstraint constraint, ref GraphNode best, ref long bestSqrDist)PointKDTreeprivate
GetOrCreateList()PointKDTreeprivate
largeListPointKDTreeprivate
LeafArraySizePointKDTree
LeafSizePointKDTree
MaxAllowedSize(int numNodes, int depth)PointKDTreeprivatestatic
numNodesPointKDTreeprivate
PointKDTree()PointKDTree
Rebalance(int index)PointKDTreeprivate
Rebuild(GraphNode[] nodes, int start, int end)PointKDTree
Size(int index)PointKDTreeprivate
treePointKDTreeprivate