Namespace AnyPath.Native

Classes

AStarCheapestOption

Burst compatible methods to find the cheapest path between a starting node and a set of possible targets.

AStarOption

Burst compatible methods to find the first option for which a path exists.

AStarStops

Burst compatible methods that find a path that visits multiple stops in order.

Structs

AStarEvalOptionResult

Indicates wether a path was found and contains the index of the target.

AStarEvalResult

Indicates wether a path was found

AStarFindOptionResult

Indicates wether a path was found, contains the index of the target and the index and length of the path in the buffer.

AStarFindPathResult

Indicates wether a path was found and contains the index and length of the path in the path buffer

AStar<TNode>

Core A* and Dijkstra algorithm implementation. Create an instance of this struct and use FindPath<TGraph, TH, TMod, TProc, TSeg>(ref TGraph, TNode, TNode, TH, TMod, TProc, NativeList<TSeg>), EvalPath<TGraph, TH, TMod>(ref TGraph, TNode, TNode, TH, TMod) or any of the extension methods to do burst compatible pathfinding queries.

ComposedGraph<TGraph, TNode>

Edge<TNode>

Directed edge used by the pathfinding algorithms.

FlagBitmask<TNode>

Modifier that only allows nodes in a path when any bit flag matches (bitwise AND produces a non zero result). This could for example represent different kinds of surfaces that an agent can walk on.

NativeListWrapper<TSeg>

Wrapper struct to allow SSFA.GetDirection to be used in native context. NativeList does not implement IReadOnlyList or some other interface that provides a read only indexer and Length, so wrapping a NativeList containing the path within this struct allows for using the same code for the managed version as well as on a raw NativeList.

NoEdgeMod<TNode>

Default edge mod that does nothing

NoProcessing<TNode>

Default processing that just copies the path to the buffer without any modifications

OffsetInfo

Contains information about where a path starts and ends in an array.

ReversedGraph<TNode>

A reversed edge representation of a graph. Used by the ALT heuristic provider for directed graphs.

Interfaces

IEdgeMod<TNode>

IGraph<TNode>

Interface that needs to be implemented to use a structure as a graph for pathfinding.

IHeuristicProvider<TNode>

Implement this interface to create your own custom heuristic provider for a given node type.

INodeFlags

Specifies that a node can be used by the FlagBitmask modifier

IPathProcessor<TNode, TSeg>

Defines an operation that converts a raw pathfinding result into another format.