PointGraph

: NavGraph : Object

Pathfinding.PointGraph, AstarPathfindingProject 0x0128 (296 B) inherited 0x00D0 AstarPathfindingProject.dll

implements IUpdatableGraph

0x00x0128

Members 16

Show inherited members

Offset	Size	Name	Type	Flags	Default
	0x08	root	Transform	Public	—
	0x08	searchTag	string	Public	—
	0x04	maxDistance	float	Public	—
	0x0C	limits	Vector3	Public	—
	0x01	raycast	bool	Public	—
	0x01	use2DPhysics	bool	Public	—
	0x01	thickRaycast	bool	Public	—
0x00F3	0x01	padding / unreflected
	0x04	thickRaycastRadius	float	Public	—
	0x01	recursive	bool	Public	—
0x00F9	0x03	padding / unreflected
	0x04	mask	LayerMask	Public	—
	0x01	optimizeForSparseGraph	bool	Public	—
0x0101	0x07	padding / unreflected
	0x08	lookupTree	PointKDTree	Private	—
	0x08	maximumConnectionLength	long	Private	—
	0x08	nodes	PointNode[]	Public	—
	0x04	nearestNodeDistanceMode	NodeDistanceMode	Public	—
	0x04	<nodeCount>k__BackingField	int	Private	—

Inherited from NavGraph 11

Offset	Size	Name	Type	Flags	Default
	0x08	active	AstarPath	Public	—
	0x10	guid	Guid	Public	—
	0x04	initialPenalty	uint	Public	—
	0x01	open	bool	Public	—
0x002D	0x03	padding / unreflected
	0x04	graphIndex	uint	Public	—
0x0034	0x04	padding / unreflected
	0x08	name	string	Public	—
	0x01	drawGizmos	bool	Public	—
	0x01	infoScreenOpen	bool	Public	—
0x0042	0x06	padding / unreflected
	0x08	serializedEditorSettings	string	Private	—
	0x40	matrix	Matrix4x4	Public	—
	0x40	inverseMatrix	Matrix4x4	Public	—

Functions 31

Signature	Flags	Params
int get_nodeCount()	Public+1 flags	0x04
void set_nodeCount(int value)	2 flags	0x04
int CountNodes()	Public+1 flags	0x04
void GetNodes(Action<Pathfinding.GraphNode> action)	Public+1 flags	0x08
NNInfoInternal GetNearest(const Vector3& position, NNConstraint constraint, GraphNode hint)	Public+1 flags	0x28
NNInfoInternal GetNearestForce(const Vector3& position, NNConstraint constraint)	Public+1 flags	0x28
NNInfoInternal GetNearestInternal(const Vector3& position, NNConstraint constraint, bool fastCheck)	Private	0x28
NNInfoInternal FindClosestConnectionPoint(PointNode node, const Vector3& position)	Private	0x28
PointNode AddNode(const Int3& position)	Public	0x0C
uint8 AddNode(const uint8& node, const Int3& position)	Public	0x0C
int CountChildren(Transform tr)	Static+1 flags	0x08
void AddChildren(ref int& c, Transform tr)	1 flags	0x08
void RebuildNodeLookup()	Public	0x00
void RebuildConnectionDistanceLookup()	Public	0x00
void AddToLookup(PointNode node)	Private	0x08
void RegisterConnectionLength(long sqrLength)	Public	0x08
PointNode[] CreateNodes(int count)	3 flags	0x08
IEnumerable<Pathfinding.Progress> ScanInternal()	2 flags	0x08
void ConnectNodes()	Public	0x00
IEnumerable<Pathfinding.Progress> ConnectNodesAsync()	Private	0x08
bool IsValidConnection(GraphNode a, GraphNode b, ref float& dist)	Public+2 flags	0x08
GraphUpdateThreading Pathfinding.IUpdatableGraph.CanUpdateAsync(GraphUpdateObject o)	PrivateFinal+2 flags	0x08
void Pathfinding.IUpdatableGraph.UpdateAreaInit(GraphUpdateObject o)	PrivateFinal+2 flags	0x08
void Pathfinding.IUpdatableGraph.UpdateAreaPost(GraphUpdateObject o)	PrivateFinal+2 flags	0x08
void Pathfinding.IUpdatableGraph.UpdateArea(GraphUpdateObject guo)	PrivateFinal+2 flags	0x08
void PostDeserialization(GraphSerializationContext ctx)	2 flags	0x08
void RelocateNodes(const Matrix4x4& deltaMatrix)	Public+1 flags	0x40
void DeserializeSettingsCompatibility(GraphSerializationContext ctx)	2 flags	0x08
void SerializeExtraInfo(GraphSerializationContext ctx)	2 flags	0x08
void DeserializeExtraInfo(GraphSerializationContext ctx)	2 flags	0x08
void .ctor()	Public+1 flags	0x00

Used by 3

types with a member, parameter or interface of this type

<ConnectNodesAsync>d__37 <ScanInternal>d__35 AstarData

// Pathfinding.PointGraph, AstarPathfindingProject
// size 0x0128 (296), inherited 0x00D0
class PointGraph : public NavGraph
{
public:
    Transform root;                                    // 0x00D0(0x08) Public
    string searchTag;                                  // 0x00D8(0x08) Public
    float maxDistance;                                 // 0x00E0(0x04) Public
    Vector3 limits;                                    // 0x00E4(0x0C) Public
    bool raycast;                                      // 0x00F0(0x01) Public
    bool use2DPhysics;                                 // 0x00F1(0x01) Public
    bool thickRaycast;                                 // 0x00F2(0x01) Public
    uint8 pad_0[0x01];                             // 0x00F3(0x01)
    float thickRaycastRadius;                          // 0x00F4(0x04) Public
    bool recursive;                                    // 0x00F8(0x01) Public
    uint8 pad_1[0x03];                             // 0x00F9(0x03)
    LayerMask mask;                                    // 0x00FC(0x04) Public
    bool optimizeForSparseGraph;                       // 0x0100(0x01) Public
    uint8 pad_2[0x07];                             // 0x0101(0x07)
    PointKDTree lookupTree;                            // 0x0108(0x08) Private
    long maximumConnectionLength;                      // 0x0110(0x08) Private
    PointNode[] nodes;                                 // 0x0118(0x08) Public
    NodeDistanceMode nearestNodeDistanceMode;          // 0x0120(0x04) Public
    int _nodeCount_k__BackingField;                    // 0x0124(0x04) Private

    int get_nodeCount(); // 0x573000 [Public SpecialName]
    void set_nodeCount(int value); // 0x573020 [Family SpecialName]
    int CountNodes(); // 0x573000 [Public Virtual]
    void GetNodes(Action<Pathfinding.GraphNode> action); // 0xb38ca0 [Public Virtual]
    NNInfoInternal GetNearest(Vector3 position, NNConstraint constraint, GraphNode hint); // 0xb38c40 [Public Virtual]
    NNInfoInternal GetNearestForce(Vector3 position, NNConstraint constraint); // 0xb38790 [Public Virtual]
    NNInfoInternal GetNearestInternal(Vector3 position, NNConstraint constraint, bool fastCheck); // 0xb387f0 [Private]
    NNInfoInternal FindClosestConnectionPoint(PointNode node, Vector3 position); // 0xb38510 [Private]
    PointNode AddNode(Int3 position); // 0xb37b20 [Public]
    uint8 AddNode(uint8 node, Int3 position); // 0x3788c0 [Public]
    int CountChildren(Transform tr); // 0xb37d60 [Family Static]
    void AddChildren(ref int c, Transform tr); // 0xb377f0 [Family]
    void RebuildNodeLookup(); // 0xb39db0 [Public]
    void RebuildConnectionDistanceLookup(); // 0xb39c50 [Public]
    void AddToLookup(PointNode node); // 0xb37bb0 [Private]
    void RegisterConnectionLength(long sqrLength); // 0xb39e70 [Public]
    PointNode[] CreateNodes(int count); // 0xb37f60 [Family Virtual NewSlot]
    IEnumerable<Pathfinding.Progress> ScanInternal(); // 0xb39f40 [Family Virtual]
    void ConnectNodes(); // 0xb37c60 [Public]
    IEnumerable<Pathfinding.Progress> ConnectNodesAsync(); // 0xb37be0 [Private]
    bool IsValidConnection(GraphNode a, GraphNode b, ref float dist); // 0xb38d20 [Public Virtual NewSlot]
    GraphUpdateThreading Pathfinding.IUpdatableGraph.CanUpdateAsync(GraphUpdateObject o); // 0x45e1f0 [Private Final Virtual NewSlot]
    void Pathfinding.IUpdatableGraph.UpdateAreaInit(GraphUpdateObject o); // 0x43eec0 [Private Final Virtual NewSlot]
    void Pathfinding.IUpdatableGraph.UpdateAreaPost(GraphUpdateObject o); // 0x43eec0 [Private Final Virtual NewSlot]
    void Pathfinding.IUpdatableGraph.UpdateArea(GraphUpdateObject guo); // 0xb395f0 [Private Final Virtual NewSlot]
    void PostDeserialization(GraphSerializationContext ctx); // 0xb39c40 [Family Virtual]
    void RelocateNodes(Matrix4x4 deltaMatrix); // 0xb39ef0 [Public Virtual]
    void DeserializeSettingsCompatibility(GraphSerializationContext ctx); // 0xb38260 [Family Virtual]
    void SerializeExtraInfo(GraphSerializationContext ctx); // 0xb39fc0 [Family Virtual]
    void DeserializeExtraInfo(GraphSerializationContext ctx); // 0xb38060 [Family Virtual]
    void .ctor(); // 0xb3a0f0 [Public SpecialName]
};