Struct PathNode

uint QuantizeFractionAlongEdge (

float

v

)

uint ReverseFractionAlongEdge (

uint

v

)

float UnQuantizeFractionAlongEdge (

uint

v

)

bool? flag1

Use as temporary flag during pathfinding.

Pathfinders (only) can use this during pathfinding to mark nodes. When done, this flag should be reverted to its default state (false) to avoid messing up other pathfinding requests.

bool? flag2

Use as temporary flag during pathfinding.

Pathfinders (only) can use this during pathfinding to mark nodes. When done, this flag should be reverted to its default state (false) to avoid messing up other pathfinding requests.

uint fractionAlongEdge

ushort heapIndex

Index of the node in the binary heap.

The open list in the A* algorithm is backed by a binary heap. To support fast 'decrease key' operations, the index of the node is saved here.

uint parentIndex

ushort pathID

The path request (in this thread, if multithreading is used) which last used this node.

PathNode Default = new PathNode { pathID = 0, heapIndex = BinaryHeap.NotInHeap, flags = 0 }

const int FractionAlongEdgeQuantization = 1 << (30 - 26)

const uint Flag1Mask = 1U << Flag1Offset

const int Flag1Offset = 30

Flag 1 is at bit 30.

const uint Flag2Mask = 1U << Flag2Offset

const int Flag2Offset = 31

Flag 2 is at bit 31.

const uint FractionAlongEdgeMask = ((1U << 30) - 1U) & ~ParentIndexMask

const int FractionAlongEdgeOffset = 26

const uint ParentIndexMask = (1U << 26) - 1U

Parent index uses the first 26 bits.

uint flags

Bitpacked variable which stores several fields.