EuclideanEmbedding

: Object

Pathfinding.EuclideanEmbedding, AstarPathfindingProject 0x0050 (80 B) inherited 0x0010 AstarPathfindingProject.dll

0x00x0050

Members 13

Show inherited members

Offset	Size	Name	Type	Flags	Default
	0x04	mode	HeuristicOptimizationMode	Public	—
	0x04	seed	int	Public	—
	0x08	pivotPointRoot	Transform	Public	—
	0x04	spreadOutCount	int	Public	—
	0x01	dirty	bool	Public+1 flags	—
0x0025	0x03	padding / unreflected
	0x08	costs	uint[]	Private	—
	0x04	maxNodeIndex	int	Private	—
	0x04	pivotCount	int	Private	—
	0x08	pivots	GraphNode[]	Private	—
—	0x04	ra	uint	PrivateStatic+1 flags	12820163
—	0x04	rc	uint	PrivateStatic+1 flags	1140671485
	0x04	rval	uint	Private	—
0x0044	0x04	padding / unreflected
	0x08	lockObj	object	Private	—

Functions 11

Signature	Flags	Params
uint GetRandom()	Private	0x04
void EnsureCapacity(int index)	Private	0x04
uint GetHeuristic(int nodeIndex1, int nodeIndex2)	Public	0x04
void GetClosestWalkableNodesToChildrenRecursively(Transform tr, List<Pathfinding.GraphNode> nodes)	Private	0x08
void PickNRandomNodes(int count, List<Pathfinding.GraphNode> buffer)	Private	0x08
GraphNode PickAnyWalkableNode()	Private	0x08
void RecalculatePivots()	Public	0x00
void RecalculateCosts()	Public	0x00
void ApplyGridGraphEndpointSpecialCase()	Private	0x00
void OnDrawGizmos()	Public	0x00
void .ctor()	Public+1 flags	0x00

Used by 3

types with a member, parameter or interface of this type

<>c__DisplayClass17_0 <>c__DisplayClass20_0 AstarPath

// Pathfinding.EuclideanEmbedding, AstarPathfindingProject
// size 0x0050 (80), inherited 0x0010
class EuclideanEmbedding : public Object
{
public:
    HeuristicOptimizationMode mode;                    // 0x0010(0x04) Public
    int seed;                                          // 0x0014(0x04) Public
    Transform pivotPointRoot;                          // 0x0018(0x08) Public
    int spreadOutCount;                                // 0x0020(0x04) Public
    bool dirty;                                        // 0x0024(0x01) Public NotSerialized
    uint8 pad_0[0x03];                             // 0x0025(0x03)
    uint[] costs;                                      // 0x0028(0x08) Private
    int maxNodeIndex;                                  // 0x0030(0x04) Private
    int pivotCount;                                    // 0x0034(0x04) Private
    GraphNode[] pivots;                                // 0x0038(0x08) Private
    uint ra;                                           // ????(0x04) Private Static Literal = 12820163
    uint rc;                                           // ????(0x04) Private Static Literal = 1140671485
    uint rval;                                         // 0x0040(0x04) Private
    uint8 pad_1[0x04];                             // 0x0044(0x04)
    object lockObj;                                    // 0x0048(0x08) Private

    uint GetRandom(); // 0xb32780 [Private]
    void EnsureCapacity(int index); // 0xb321b0 [Private]
    uint GetHeuristic(int nodeIndex1, int nodeIndex2); // 0xb32670 [Public]
    void GetClosestWalkableNodesToChildrenRecursively(Transform tr, List<Pathfinding.GraphNode> nodes); // 0xb32360 [Private]
    void PickNRandomNodes(int count, List<Pathfinding.GraphNode> buffer); // 0xb32aa0 [Private]
    GraphNode PickAnyWalkableNode(); // 0xb32920 [Private]
    void RecalculatePivots(); // 0xb32f90 [Public]
    void RecalculateCosts(); // 0xb32c20 [Public]
    void ApplyGridGraphEndpointSpecialCase(); // 0xb31c60 [Private]
    void OnDrawGizmos(); // 0xb32790 [Public]
    void .ctor(); // 0xb33620 [Public SpecialName]
};