FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck > Member List

This is the complete list of members for FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >, including all inherited members.

DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_1PARAM_CONST(int32, GetNeighbourCount, const FGraphNodeRef, NO_COUNT)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_1PARAM_CONST(int32, GetNeighbourCountV2, const FSearchNode &, Obj.GetNeighbourCount(Param1.NodeRef))	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_2PARAMS(FGraphNodeRef, SetPathInfo, const int32, const FSearchNode &, Obj[Param1]=Param2.NodeRef)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_2PARAMS_CONST(FGraphNodeRef, GetNeighbour, const FSearchNode &, const int32, Obj.GetNeighbour(Param1.NodeRef, Param2))	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_CONST(bool, ShouldIgnoreClosedNodes, false)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_CONST(bool, ShouldIncludeStartNodeInPath, false)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_CONST(bool, ShouldFailOnInvalidEndNode, true)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_CONST(FVector::FReal, GetCostLimit, TNumericLimits< FVector::FReal >::Max())	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_CUSTOM(GetMaxSearchNodes, bool, HasReachMaxSearchNodes, uint32 NodeCount, false, NodeCount >=Obj.GetMaxSearchNodes())	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
DECLARE_OPTIONALLY_IMPLEMENTED_TEMPLATE_CLASS_FUNCTION_CUSTOM(GetCostLimit, bool, HasExceededCostLimit, FVector::FReal Cost, false, Cost > Obj.GetCostLimit())	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
FGraphAStar(const TGraph &InGraph)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >	inline
FGraphNodeRef typedef	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
FIndexArray typedef	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
FindPath(const FSearchNode &StartNode, const FSearchNode &EndNode, const TQueryFilter &Filter, TResultPathInfo &OutPath)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >	inline
FloodFrom(const FSearchNode &StartNode, const TQueryFilter &Filter)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >	inline
FNodeArray typedef	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
FNodeMap typedef	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
FRangeChecklessSetAllocator typedef	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
FSearchNode typedef	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
Graph	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
HasReachMaxSearchNodes(const TQueryFilter &Filter) const	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >	inline
NodePool	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
NodeSorter	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
OpenList	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >
ProcessSingleNode(const FSearchNode &EndNode, const bool bIsBound, const TQueryFilter &Filter, int32 &OutBestNodeIndex, float &OutBestNodeCost)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >	inline
ProcessSingleNode(const FSearchNode &EndNode, const bool bIsBound, const TQueryFilter &Filter, int32 &OutBestNodeIndex, FVector::FReal &OutBestNodeCost)	FGraphAStar< TGraph, Policy, TSearchNode, DoRangeCheck >	inline