#include <DetourNavMeshQuery.h>
◆ dtQueryFilterData()
| dtQueryFilterData::dtQueryFilterData |
( |
| ) |
|
◆ copyFrom()
◆ equals()
◆ heuristicScale
| dtReal dtQueryFilterData::heuristicScale |
◆ 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
Flags for polygons that should not be visited. (Used by default implementation.)
◆ 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: