PointKDTree

: Object

Pathfinding.PointKDTree, AstarPathfindingProject 0x0030 (48 B) inherited 0x0010 AstarPathfindingProject.dll

0x00x0030

Members 7

Show inherited members

Offset	Size	Name	Type	Flags	Default
—	0x04	LeafSize	int	PublicStatic+1 flags	-2128597328
—	0x04	LeafArraySize	int	PublicStatic+1 flags	-2128597328
	0x08	tree	Node[]	Private	—
	0x04	numNodes	int	Private	—
0x001C	0x04	padding / unreflected
	0x08	largeList	List<Pathfinding.GraphNode>	Private+1 flags	—
	0x08	arrayCache	Stack<Pathfinding.GraphNode[]>	Private+1 flags	—
	0x08	comparers	IComparer<Pathfinding.GraphNode>[]	PrivateStatic+1 flags	—

Functions 18

Signature	Flags	Native	Params
void .ctor()	Public+1 flags	—	0x00
void Add(GraphNode node)	Public	—	0x08
void Rebuild(const GraphNode[]& nodes, int start, int end)	Public		0x08
GraphNode[] GetOrCreateList()	Private		0x08
int Size(int index)	Private		0x04
void CollectAndClear(int index, List<Pathfinding.GraphNode> buffer)	Private		0x08
int MaxAllowedSize(int numNodes, int depth)	PrivateStatic		0x04
void Rebalance(int index)	Private		0x04
void EnsureSize(int index)	Private		0x04
void Build(int index, List<Pathfinding.GraphNode> nodes, int start, int end)	Private		0x08
void Add(GraphNode point, int index, int depth)	Private		0x08
GraphNode GetNearest(const Int3& point, NNConstraint constraint)	Public		0x0C
void GetNearestInternal(int index, const Int3& point, NNConstraint constraint, ref GraphNode& best, ref long& bestSqrDist)	Private		0x0C
GraphNode GetNearestConnection(const Int3& point, NNConstraint constraint, long maximumSqrConnectionLength)	Public		0x0C
void GetNearestConnectionInternal(int index, const Int3& point, NNConstraint constraint, ref GraphNode& best, ref long& bestSqrDist, long distanceThresholdOffset)	Private		0x0C
void GetInRange(const Int3& point, long sqrRadius, List<Pathfinding.GraphNode> buffer)	Public		0x0C
void GetInRangeInternal(int index, const Int3& point, long sqrRadius, List<Pathfinding.GraphNode> buffer)	Private		0x0C
void .cctor()	PrivateStatic+1 flags		0x00

Used by 1

types with a member, parameter or interface of this type

PointGraph

// Pathfinding.PointKDTree, AstarPathfindingProject
// size 0x0030 (48), inherited 0x0010
class PointKDTree : public Object
{
public:
    int LeafSize;                                      // ????(0x04) Public Static Literal = -2128597328
    int LeafArraySize;                                 // ????(0x04) Public Static Literal = -2128597328
    Node[] tree;                                       // 0x0010(0x08) Private
    int numNodes;                                      // 0x0018(0x04) Private
    uint8 pad_0[0x04];                             // 0x001C(0x04)
    List<Pathfinding.GraphNode> largeList;             // 0x0020(0x08) Private InitOnly
    Stack<Pathfinding.GraphNode[]> arrayCache;         // 0x0028(0x08) Private InitOnly
    IComparer<Pathfinding.GraphNode>[] comparers;      // 0x0000(0x08) Private Static InitOnly

    void .ctor(); [Public SpecialName]
    void Add(GraphNode node); [Public]
    void Rebuild(GraphNode[] nodes, int start, int end); // 0xb546e0 [Public]
    GraphNode[] GetOrCreateList(); // 0xb54540 [Private]
    int Size(int index); // 0xb54910 [Private]
    void CollectAndClear(int index, List<Pathfinding.GraphNode> buffer); // 0xb53810 [Private]
    int MaxAllowedSize(int numNodes, int depth); // 0xb545c0 [Private Static]
    void Rebalance(int index); // 0xb54640 [Private]
    void EnsureSize(int index); // 0xb539c0 [Private]
    void Build(int index, List<Pathfinding.GraphNode> nodes, int start, int end); // 0xb53290 [Private]
    void Add(GraphNode point, int index, int depth); // 0xb52f30 [Private]
    GraphNode GetNearest(Int3 point, NNConstraint constraint); // 0xb544e0 [Public]
    void GetNearestInternal(int index, Int3 point, NNConstraint constraint, ref GraphNode best, ref long bestSqrDist); // 0xb54290 [Private]
    GraphNode GetNearestConnection(Int3 point, NNConstraint constraint, long maximumSqrConnectionLength); // 0xb54220 [Public]
    void GetNearestConnectionInternal(int index, Int3 point, NNConstraint constraint, ref GraphNode best, ref long bestSqrDist, long distanceThresholdOffset); // 0xb53cf0 [Private]
    void GetInRange(Int3 point, long sqrRadius, List<Pathfinding.GraphNode> buffer); // 0xb53cb0 [Public]
    void GetInRangeInternal(int index, Int3 point, long sqrRadius, List<Pathfinding.GraphNode> buffer); // 0xb53a80 [Private]
    void .cctor(); // 0xb549a0 [Private Static SpecialName]
};