UDocumentation UE5.7 10.02.2026 (Source)
API documentation for Unreal Engine 5.7
dtQueryFilterData Struct Reference

#include <DetourNavMeshQuery.h>

Public Member Functions

NAVMESH_API dtQueryFilterData ()
 
NAVMESH_API bool equals (const dtQueryFilterData *other) const
 
NAVMESH_API void copyFrom (const dtQueryFilterData *source)
 

Public Attributes

dtReal m_areaCost [DT_MAX_AREAS]
 Cost per area type. (Used by default implementation.)
 
dtReal m_areaFixedCost [DT_MAX_AREAS]
 Fixed cost for entering an area type (Used by default implementation.)
 
dtReal heuristicScale
 Search heuristic scale.
 
dtReal lowestAreaCost
 
unsigned short m_includeFlags
 Flags for polygons that can be visited. (Used by default implementation.)
 
unsigned short m_excludeFlags
 Flags for polygons that should not be visited. (Used by default implementation.)
 
bool m_isBacktracking
 
bool m_shouldIgnoreClosedNodes
 

Constructor & Destructor Documentation

◆ dtQueryFilterData()

dtQueryFilterData::dtQueryFilterData ( )

Member Function Documentation

◆ copyFrom()

void dtQueryFilterData::copyFrom ( const dtQueryFilterData source)

◆ equals()

bool dtQueryFilterData::equals ( const dtQueryFilterData other) const

Member Data Documentation

◆ heuristicScale

dtReal dtQueryFilterData::heuristicScale

Search heuristic scale.

◆ lowestAreaCost

dtReal dtQueryFilterData::lowestAreaCost

◆ m_areaCost

dtReal dtQueryFilterData::m_areaCost[DT_MAX_AREAS]

Cost per area type. (Used by default implementation.)

◆ m_areaFixedCost

dtReal dtQueryFilterData::m_areaFixedCost[DT_MAX_AREAS]

Fixed cost for entering an area type (Used by default implementation.)

◆ m_excludeFlags

unsigned short dtQueryFilterData::m_excludeFlags

Flags for polygons that should not be visited. (Used by default implementation.)

◆ m_includeFlags

unsigned short dtQueryFilterData::m_includeFlags

Flags for polygons that can be visited. (Used by default implementation.)

◆ m_isBacktracking

bool dtQueryFilterData::m_isBacktracking

◆ m_shouldIgnoreClosedNodes

bool dtQueryFilterData::m_shouldIgnoreClosedNodes

whether to ignore neighbour nodes that have already been visited. FALSE by default but you might want to set it to true if using heuristic scale much larger than 1 or experiencing cycles in our paths for any other reason


The documentation for this struct was generated from the following files: