Class XPath Extends ABPath
Extended Path.
This is the same as a standard path but it is possible to customize when the target should be considered reached. Can be used to for example signal a path as complete when it is within a specific distance from the target.
Note
More customizations does make it slower to calculate than an ABPath but not by very much.
A* Pro Feature:
This is an A* Pathfinding Project Pro feature only. This function/class/variable might not exist in the Free version of the A* Pathfinding Project or the functionality might be limited.
The Pro version can be bought here
Public Methods
Public Static Methods
Public Variables
Ending Condition for the path.
Inherited Public Members
Blocks until this path has been calculated and returned.
Calculate partial path if the target node cannot be reached.
Callback to call when the path is complete.
Claim this path (pooling).
Current state of the path.
Construct a path with a start and end point.
How long it took to calculate this path in milliseconds.
Which graph tags are traversable.
End node of the path.
End point of the path.
If the path failed, this is true.
Aborts the path because of an error.
Additional info on why a path failed.
Creates a fake path.
Returns penalty for the given tag.
Total Length of the path.
Determines which heuristic to use.
Scale of the heuristic values.
Immediate callback to call when the path is complete.
Returns if this path is done calculating.
Constraint for how to search for nodes.
End Point exactly as in the path request.
Start Point exactly as in the path request.
Holds the path as a Node array.
ID of this path.
Returns the state of the path in the pathfinding pipeline.
Releases a path claim (pooling).
Start point in integer coordinates.
Start node of the path.
Start point of the path.
Penalties for each tag.
Provides additional traversal information to a path request.
Holds the (possibly post processed) path as a Vector3 list.
Waits until this path has been calculated and returned.
Private/Protected Members
Estimated cost from the specified node to the target.
Calculates the path until completed or until the time has passed targetTick.
Returns if the node can be traversed.
Changes the endNode to target and resets some temporary flags on the previous node.
Always called after the path has been calculated.
The start node need to be special cased and checked here if it is a valid target.
The node currently being processed.
Returns a debug string for this path.
Writes text shared for all overrides of DebugString to the string builder.
Writes text shared for all overrides of DebugString to the string builder.
Saved original costs for the end node.
Applies a special case for grid nodes.
True for paths that want to search all nodes and not jump over nodes as optimizations.
May be called by graph nodes to get a special cost for some connections.
True if the Reset function has been called.
Determines if a search for an end node should be done.
Target to use for H score calculations.
Target to use for H score calculation.
Initializes the path.
The tag penalties that are actually used.
Tag penalties set by other scripts.
Internal linked list implementation.
Called when the path enters the pool.
Current best target for the partial path.
Data for the thread calculating this path.
Prepares the path.
Prepares low level path variables for calculation.
Reset all values to their default values.
Calls callback to return the calculated path.
Number of nodes this path has searched.
Traces the calculated path from the end node to the start.
Sets the start and end points.