ClassName
stringclasses 24
values | HeaderPath
stringclasses 12
values | Name
stringlengths 4
216
| Description
stringlengths 0
182
| Module
stringclasses 1
value | Type
stringclasses 78
values |
---|---|---|---|---|---|
FAIResourcesSet
|
#include "AITypes.h"
|
Clear()
|
AIModule
|
void
|
|
FAIResourcesSet
|
#include "AITypes.h"
|
ContainsResource(const FAIResourceID& Resource)
|
AIModule
|
bool
|
|
FAIResourcesSet
|
#include "AITypes.h"
|
ContainsResourceIndex(uint8 ResourceID)
|
AIModule
|
bool
|
|
FAIResourcesSet
|
#include "AITypes.h"
|
IsEmpty()
|
AIModule
|
bool
|
|
FAIResourcesSet
|
#include "AITypes.h"
|
RemoveResource(const FAIResourceID& Resource)
|
AIModule
|
FAIResourcesSet
|
|
FAIResourcesSet
|
#include "AITypes.h"
|
RemoveResourceIndex(uint8 ResourceIndex)
|
AIModule
|
FAIResourcesSet
|
|
FFocusKnowledge
|
#include "AIController.h"
|
Priorities
|
AIModule
|
TArray
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
TeamID
|
AIModule
|
uint8
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
GetAttitude(const AActor* A,const AActor* B)
|
AIModule
|
ETeamAttitude::Type
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
GetAttitude(FGenericTeamId TeamA,FGenericTeamId TeamB)
|
AIModule
|
ETeamAttitude::Type
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
GetId()
|
AIModule
|
uint8
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
GetTeamIdentifier(const AActor* TeamMember)
|
AIModule
|
FGenericTeamId
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
ResetAttitudeSolver()
|
AIModule
|
void
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
SetAttitudeSolver(const FAttitudeSolverFunction& Sol...)
|
AIModule
|
void
|
|
FGenericTeamId
|
#include "GenericTeamAgentInterface.h"
|
operator uint8()
|
AIModule
| ||
FGraphAStar
|
#include "GraphAStar.h"
|
Graph
|
AIModule
|
const TGraph &
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
NodePool
|
AIModule
|
FNodePool
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
NodeSorter
|
AIModule
|
FNodeSorter
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
OpenList
|
AIModule
|
FOpenList
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
FindPath(const FSearchNode& StartNode,const FSearchNode& EndNode,const TQueryFilter& Filter,TResultPathInfo& OutPath)
|
Performs the actual search.
|
AIModule
|
EGraphAStarResult
|
FGraphAStar
|
#include "GraphAStar.h"
|
FloodFrom(const FSearchNode& StartNode,const TQueryFilter& Filter)
|
Floods node pool until running out of either free nodes or open set
|
AIModule
|
EGraphAStarResult
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetCostLimit(const TemplateClass& Obj)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetCostLimit(const TemplateClass& Obj)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetHeuristicCost(const TemplateClass& Obj,const FSearchNode& Param1,const FSearchNode& Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetHeuristicCost(const TemplateClass& Obj,const FSearchNode& Param1,const FSearchNode& Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetNeighbour(const TemplateClass& Obj,const FSearchNode& Param1,const int32 Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetNeighbour(const TemplateClass& Obj,const FSearchNode& Param1,const int32 Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetNeighbourCount(const TemplateClass& Obj,const FGraphNodeRef Param1)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetNeighbourCount(const TemplateClass& Obj,const FGraphNodeRef Param1)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetTraversalCost(const TemplateClass& Obj,const FSearchNode& Param1,const FSearchNode& Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
GetTraversalCost(const TemplateClass& Obj,const FSearchNode& Param1,const FSearchNode& Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
HasExceededCostLimit(const TemplateClass& Obj,float Cost)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
HasExceededCostLimit(const TemplateClass& Obj,float Cost)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
HasReachMaxSearchNodes(const TQueryFilter& Filter)
|
AIModule
|
bool
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
HasReachMaxSearchNodes(const TemplateClass& Obj,uint32 NodeCount)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
HasReachMaxSearchNodes(const TemplateClass& Obj,uint32 NodeCount)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
ProcessSingleNode(const FSearchNode& EndNode,const bool bIsBound,const TQueryFilter& Filter,int32& OutBestNodeIndex,float& OutBestNodeCost)
|
Single run of A* loop: get node from open set and process neighbors returns true if loop should be continued
|
AIModule
|
bool
|
FGraphAStar
|
#include "GraphAStar.h"
|
SetPathInfo(TemplateClass& Obj,const int32 Param1,const FSearchNode& Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
SetPathInfo(TemplateClass& Obj,const int32 Param1,const FSearchNode& Param2)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
ShouldIgnoreClosedNodes(const TemplateClass& Obj)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
ShouldIgnoreClosedNodes(const TemplateClass& Obj)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
ShouldIncludeStartNodeInPath(const TemplateClass& Obj)
|
AIModule
|
TEnableIf
|
|
FGraphAStar
|
#include "GraphAStar.h"
|
ShouldIncludeStartNodeInPath(const TemplateClass& Obj)
|
AIModule
|
TEnableIf
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
bIsClosed
|
AIModule
|
uint8: 1
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
bIsOpened
|
AIModule
|
uint8: 1
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
NodeRef
|
AIModule
|
FGraphNodeRef
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
ParentNodeIndex
|
AIModule
|
int32
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
ParentRef
|
AIModule
|
FGraphNodeRef
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
SearchNodeIndex
|
AIModule
|
int32
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
TotalCost
|
AIModule
|
float
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
TraversalCost
|
AIModule
|
float
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
IsClosed()
|
AIModule
|
bool
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
IsOpened()
|
AIModule
|
bool
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
MarkClosed()
|
AIModule
|
void
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
MarkNotClosed()
|
AIModule
|
void
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
MarkNotOpened()
|
AIModule
|
void
|
|
FGraphAStarDefaultNode
|
#include "GraphAStar.h"
|
MarkOpened()
|
AIModule
|
void
|
|
FGridSize2D
|
#include "SimpleCellGrid.h"
|
Height
|
AIModule
|
uint32
|
|
FGridSize2D
|
#include "SimpleCellGrid.h"
|
Width
|
AIModule
|
uint32
|
|
FIntervalCountdown
|
#include "AITypes.h"
|
Interval
|
AIModule
|
float
|
|
FIntervalCountdown
|
#include "AITypes.h"
|
TimeLeft
|
AIModule
|
float
|
|
FIntervalCountdown
|
#include "AITypes.h"
|
GetElapsedTime()
|
That this function returns meaningful results only if Interval > 0
|
AIModule
|
float
|
FIntervalCountdown
|
#include "AITypes.h"
|
GetElapsedTimeWithFallback(const float FallbackValue)
|
AIModule
|
float
|
|
FIntervalCountdown
|
#include "AITypes.h"
|
Reset()
|
Resets the countdown back to Interval
|
AIModule
|
void
|
FIntervalCountdown
|
#include "AITypes.h"
|
Set(const float InNewTimeLeft)
|
AIModule
|
void
|
|
FIntervalCountdown
|
#include "AITypes.h"
|
Tick(const float TimeDelta)
|
AIModule
|
bool
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
CurrentTimestamp
|
AIModule
|
float
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
EQSRenderingComponents
|
AIModule
|
TArray
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
SelectedEQSId
|
AIModule
|
uint32
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
DrawData(IVisualLoggerEditorInterface* ...,UCanvas* Canvas)
|
AIModule
|
void
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
OnItemsSelectionChanged(IVisualLoggerEditorInterface* ...)
|
AIModule
|
void
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
OnLogLineSelectionChanged(IVisualLoggerEditorInterface* ...,TSharedPtr< struct FLogEntryItem > ...,int64 UserData)
|
AIModule
|
void
|
|
FVisualLoggerExtension
|
#include "VisualLoggerExtension.h"
|
ResetData(IVisualLoggerEditorInterface* ...)
|
AIModule
|
void
|
|
IAIModule
|
#include "AIModule.h"
|
Get()
|
Singleton-like access to this module's interface.
|
AIModule
|
IAIModule &
|
IAIModule
|
#include "AIModule.h"
|
GetAIAssetCategoryBit()
|
AIModule
|
EAssetTypeCategories::Type
|
|
IAIModule
|
#include "AIModule.h"
|
IsAvailable()
|
Checks to see if this module is loaded and ready.
|
AIModule
|
bool
|
TBVTree
|
#include "BVTree.h"
|
CalcElementBounds(const FElement&)
|
You have to supply this yourself
|
AIModule
|
FBox
|
TBVTree
|
#include "BVTree.h"
|
CalcNodeBounds(const TArray< FElementBox >& Eleme...,const int StartIndex,const int LimitIndex)
|
AIModule
|
FBox
|
|
TBVTree
|
#include "BVTree.h"
|
Create(TArray< FElement >&& InElements)
|
AIModule
|
void
|
|
TBVTree
|
#include "BVTree.h"
|
Create(const TArray< FElement >& InElemen...)
|
AIModule
|
void
|
|
TBVTree
|
#include "BVTree.h"
|
CreateCommonInternal()
|
Assumes Elements has been set up
|
AIModule
|
void
|
TBVTree
|
#include "BVTree.h"
|
GetBoundingBoxes()
|
AIModule
|
TArray
|
|
TBVTree
|
#include "BVTree.h"
|
GetElements()
|
AIModule
|
TArray
|
|
TBVTree
|
#include "BVTree.h"
|
GetLongestAxis(const FBox& NodeBounds)
|
AIModule
|
int
|
|
TBVTree
|
#include "BVTree.h"
|
GetNodes()
|
AIModule
|
TArray
|
|
TBVTree
|
#include "BVTree.h"
|
GetOverlapping(const FBox& Box,TArray< FElement >& OutOverlapping...)
|
AIModule
|
void
|
|
TBVTree
|
#include "BVTree.h"
|
IsEmpty()
|
AIModule
|
bool
|
|
TBVTree
|
#include "BVTree.h"
|
RecreateTree(const TArray< FElement >& InElemen...)
|
AIModule
|
void
|
|
TBVTree
|
#include "BVTree.h"
|
RecreateTree(TArray< FElement >&& InElements)
|
AIModule
|
void
|
|
TBVTree
|
#include "BVTree.h"
|
Reset()
|
AIModule
|
void
|
|
TBVTree
|
#include "BVTree.h"
|
Subdivide(TArray< FElementBox >& ElementBBox...,const int StartIndex,const int LimitIndex,int& CurrentNode)
|
AIModule
|
void
|
|
TDefaultManagerInstanceTracker
|
#include "DefaultManagerInstanceTracker.h"
|
bCreateIfMissing
|
AIModule
|
bool
|
|
TDefaultManagerInstanceTracker
|
#include "DefaultManagerInstanceTracker.h"
|
WorldToInstanceMap
|
AIModule
|
TMap
|
|
TDefaultManagerInstanceTracker
|
#include "DefaultManagerInstanceTracker.h"
|
GetManagerInstance(UWorld& World)
|
AIModule
|
FManager ...
|
|
TDefaultManagerInstanceTracker
|
#include "DefaultManagerInstanceTracker.h"
|
OnWorldCleanup(UWorld* World,bool,bool)
|
AIModule
|
void
|
|
TSimpleCellGrid
|
#include "SimpleCellGrid.h"
|
BoundsSize
|
AIModule
|
FVector
|
|
TSimpleCellGrid
|
#include "SimpleCellGrid.h"
|
Cells
|
AIModule
|
TArray
|
|
TSimpleCellGrid
|
#include "SimpleCellGrid.h"
|
CellSize
|
DEPRECATED, use GridCellSize instead of this.
|
AIModule
|
uint32
|
TSimpleCellGrid
|
#include "SimpleCellGrid.h"
|
GridCellSize
|
AIModule
|
float
|
|
TSimpleCellGrid
|
#include "SimpleCellGrid.h"
|
GridSize
|
AIModule
|
FGridSize2D
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.